diff --git a/NOTICE.md b/NOTICE.md
index 2e8eb59..78e24fc 100644
--- a/NOTICE.md
+++ b/NOTICE.md
@@ -1,17 +1,29 @@
 FEAScript makes use of the following third-party software:
 
-1. **math.js**
+1. **Comlink**
+   - License: Apache 2.0 (https://github.com/GoogleChromeLabs/comlink/blob/main/LICENSE)
+   - Source: https://github.com/GoogleChromeLabs/comlink
+
+2. **d3-scale**
+   - License: ISC (https://github.com/d3/d3-scale/blob/main/LICENSE)
+   - Source: https://github.com/d3/d3-scale
+
+3. **gl-matrix**
+   - License: MIT (https://github.com/toji/gl-matrix/blob/master/LICENSE.md)
+   - Source: https://github.com/toji/gl-matrix
+
+4. **math.js**
    - License: Apache 2.0 (https://github.com/josdejong/mathjs/blob/develop/LICENSE)
    - Source: https://github.com/josdejong/mathjs
 
-2. **plotly.js**
+5. **plotly.js**
    - License: MIT (https://github.com/plotly/plotly.js/blob/master/LICENSE)
    - Source: https://github.com/plotly/plotly.js/tree/master
 
-3. **Comlink**
-   - License: Apache 2.0 (https://github.com/GoogleChromeLabs/comlink/blob/main/LICENSE)
-   - Source: https://github.com/GoogleChromeLabs/comlink
-
-4. **taichi.js**
+6. **taichi.js**
    - License: MIT (https://github.com/AmesingFlank/taichi.js/blob/main/LICENSE)
-   - Source: https://github.com/AmesingFlank/taichi.js
\ No newline at end of file
+   - Source: https://github.com/AmesingFlank/taichi.js
+
+7. **vtk.js**
+   - License: BSD 3-Clause (https://github.com/Kitware/vtk-js/blob/master/LICENSE)
+   - Source: https://github.com/Kitware/vtk-js
diff --git a/README.md b/README.md
index 42f8b85..e50d17d 100644
--- a/README.md
+++ b/README.md
@@ -19,7 +19,7 @@
 - <b>Meshing:</b> simple 1D/2D mesh generation, unstructured mesh import from Gmsh (`.msh`)
 - <b>Solvers:</b> frontal, Jacobi (CPU/WebGPU) and LU, Newton–Raphson for nonlinear systems
 - <b>Performance:</b> web worker support for multi-threaded computation
-- <b>Visualization:</b> interactive plots with Plotly
+- <b>Visualization:</b> interactive rendering with vtk.js and Plotly
 
 <!-- ## Contents
 
@@ -84,7 +84,7 @@ FEAScript works well in interactive JavaScript playgrounds where you can write c
 Install FEAScript and its peer dependencies from npm as follows:
 
 ```bash
-npm install feascript mathjs plotly.js
+npm install feascript mathjs
 ```
 
 Then, import it in your JavaScript file:
diff --git a/dist/feascript.cjs.js b/dist/feascript.cjs.js
index 077c20d..3730005 100644
--- a/dist/feascript.cjs.js
+++ b/dist/feascript.cjs.js
@@ -1,7 +1,8 @@
-function e(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}Object.defineProperty(exports,"__esModule",{value:!0});let t="basic";function n(e){"debug"===t&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function o(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function s(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}function i(e){console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;")}
+function e(e){if(e&&e.__esModule)return e;var t=Object.create(null);return e&&Object.keys(e).forEach((function(n){if("default"!==n){var o=Object.getOwnPropertyDescriptor(e,n);Object.defineProperty(t,n,o.get?o:{enumerable:!0,get:function(){return e[n]}})}})),t.default=e,Object.freeze(t)}function t(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}Object.defineProperty(exports,"__esModule",{value:!0});let n="basic";function o(e){"debug"===n&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function s(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function i(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}
 /**
  * @license
  * Copyright 2019 Google LLC
  * SPDX-License-Identifier: Apache-2.0
- */const r=Symbol("Comlink.proxy"),a=Symbol("Comlink.endpoint"),l=Symbol("Comlink.releaseProxy"),d=Symbol("Comlink.finalizer"),c=Symbol("Comlink.thrown"),u=e=>"object"==typeof e&&null!==e||"function"==typeof e,m=new Map([["proxy",{canHandle:e=>u(e)&&e[r],serialize(e){const{port1:t,port2:n}=new MessageChannel;return h(e,t),[n,[n]]},deserialize:e=>(e.start(),p(e))}],["throw",{canHandle:e=>u(e)&&c in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function h(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:a,path:l}=Object.assign({path:[]},s.data),u=(s.data.argumentList||[]).map($);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(a){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=$(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,u);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[r]:!0})}(new n(...u));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;h(e,n),m=function(e,t){return M.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[c]:0}}Promise.resolve(m).catch((e=>({value:e,[c]:0}))).then((n=>{const[s,r]=D(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),r),"RELEASE"===a&&(t.removeEventListener("message",o),f(t),d in e&&"function"==typeof e[d]&&e[d]())})).catch((e=>{const[n,o]=D({value:new TypeError("Unserializable return value"),[c]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function f(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function p(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),v(e,n,[],t)}function g(e){if(e)throw new Error("Proxy has been released and is not useable")}function b(e){return F(e,new Map,{type:"RELEASE"}).then((()=>{f(e)}))}const y=new WeakMap,E="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(y.get(e)||0)-1;y.set(e,t),0===t&&b(e)}));function v(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(g(s),r===l)return()=>{!function(e){E&&E.unregister(e)}(i),b(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=F(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then($);return o.then.bind(o)}return v(e,t,[...n,r])},set(o,i,r){g(s);const[a,l]=D(r);return F(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then($)},apply(o,i,r){g(s);const l=n[n.length-1];if(l===a)return F(e,t,{type:"ENDPOINT"}).then($);if("bind"===l)return v(e,t,n.slice(0,-1));const[d,c]=C(r);return F(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:d},c).then($)},construct(o,i){g(s);const[r,a]=C(i);return F(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then($)}});return function(e,t){const n=(y.get(t)||0)+1;y.set(t,n),E&&E.register(e,t,e)}(i,e),i}function C(e){const t=e.map(D);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const M=new WeakMap;function D(e){for(const[t,n]of m)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},M.get(e)||[]]}function $(e){switch(e.type){case"HANDLER":return m.get(e.name).deserialize(e.value);case"RAW":return e.value}}function F(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function x(e,t,i,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let d=[],c=!0,u=0;if(o(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),n=math.slu(e,1,1);let o=math.lusolve(n,i);d=math.squeeze(o).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,i,new Array(i.length).fill(0),{maxIterations:a,tolerance:l});e.converged?n(`Jacobi method converged in ${e.iterations} iterations`):s(`Jacobi method did not converge after ${e.iterations} iterations`),d=e.solutionVector,c=e.converged,u=e.iterations}else s(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),o("System solved successfully"),{solutionVector:d,converged:c,iterations:u}}async function w(e,t,i,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;o(`Solving system using ${e}...`),console.time("systemSolving");const d=Array.isArray(t)?t:t?.toArray?.()??t,c=Array.isArray(i)?i:i?.toArray?.()??i;let u,m=null,h=null,f=[],g=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js","undefined"==typeof document?new(require("url").URL)("file:"+__filename).href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.cjs.js",document.baseURI).href),{type:"module"}),t=p(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(c.length).fill(0);let t;t=await h.webgpuJacobiSolver(d,c,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,g=t.converged,u=t.iterations,g?n(`Jacobi method converged in ${u} iterations`):s(`Jacobi method did not converge after ${u} iterations`)}else s(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),o(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:g,iterations:u}}class A{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],i=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void s("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,i[0]=-1*r(e),i[1]=1*r(e),i[2]=-1*e,i[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function d(e){return 2*e**2-e}function c(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*d(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*d(t),n[6]=d(e)*a(t),n[7]=d(e)*l(t),n[8]=d(e)*d(t),o[0]=c(e)*a(t),o[1]=c(e)*l(t),o[2]=c(e)*d(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*d(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*d(t),i[0]=a(e)*c(t),i[1]=a(e)*u(t),i[2]=a(e)*m(t),i[3]=l(e)*c(t),i[4]=l(e)*u(t),i[5]=l(e)*m(t),i[6]=d(e)*c(t),i[7]=d(e)*u(t),i[8]=d(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:i}}}class N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:s=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=s,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(o("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||s("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,n("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&s("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(n("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const o=t[0],i=t[1];n(`Processing boundary node pair: [${o}, ${i}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const s=this.parsedMesh.nodalNumbering[t];if(4===s.length){if(s.includes(o)&&s.includes(i)){let a;const l=s.indexOf(o),d=s.indexOf(i);n(`  Found element ${t} containing boundary nodes. Element nodes: [${s.join(", ")}]`),n(`  Node ${o} is at index ${l}, Node ${i} is at index ${d} in the element`),0===l&&2===d||2===l&&0===d?(a=0,n(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===d||1===l&&0===d?(a=1,n(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===d||3===l&&1===d?(a=2,n(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===d||3===l&&2===d)&&(a=3,n(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),n(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===s.length&&s.includes(o)&&s.includes(i)){let a;const l=s.indexOf(o),d=s.indexOf(i);n(`  Found element ${t} containing boundary nodes. Element nodes: [${s.join(", ")}]`),n(`  Node ${o} is at index ${l}, Node ${i} is at index ${d} in the element`),0===l&&6===d||6===l&&0===d||0===l&&3===d||3===l&&0===d||3===l&&6===d||6===l&&3===d?(a=0,n(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===d||2===l&&0===d||0===l&&1===d||1===l&&0===d||1===l&&2===d||2===l&&1===d?(a=1,n(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===d||8===l&&2===d||2===l&&5===d||5===l&&2===d||5===l&&8===d||8===l&&5===d?(a=2,n(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===d||8===l&&6===d||6===l&&7===d||7===l&&6===d||7===l&&8===d||8===l&&7===d)&&(a=3,n(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),n(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||s(`Could not find element containing boundary nodes ${o} and ${i}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class O extends N{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||s("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,o;if("linear"===this.elementOrder){t=this.numElementsX+1,o=(this.maxX-0)/this.numElementsX,e[0]=0;for(let n=1;n<t;n++)e[n]=e[n-1]+o}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,o=(this.maxX-0)/this.numElementsX,e[0]=0;for(let n=1;n<t;n++)e[n]=e[n-1]+o/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return n("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),n("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class V extends N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:i="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:i,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||s("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let o,s,i,r;if("linear"===this.elementOrder){o=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let n=1;n<o;n++){const o=n*s;e[o]=e[0]+n*i,t[o]=t[0];for(let n=1;n<s;n++)e[o+n]=e[o],t[o+n]=t[o]+n*r}}else if("quadratic"===this.elementOrder){o=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let n=1;n<o;n++){const o=n*s;e[o]=e[0]+n*i/2,t[o]=t[0];for(let n=1;n<s;n++)e[o+n]=e[o],t[o+n]=t[o]+n*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const n=Math.PI/180,i=Math.tan(this.angleLeft*n),r=Math.tan(this.angleRight*n),a=1e-12;for(let n=0;n<s;n++){const l=t[n],d=Math.abs(i)<a?0:l/i,c=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<o;t++){const i=1===o?0:t/(o-1);e[t*s+n]=d+(c-d)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return n("Generated node X coordinates: "+JSON.stringify(e)),n("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:o,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return n("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class P{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function X(e){const{meshDimension:t,numElementsX:o,numElementsY:i,maxX:r,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}=e;let m;"1D"===t?m=new O({numElementsX:o,maxX:r,elementOrder:l,parsedMesh:d}):"2D"===t?m=new V({numElementsX:o,maxX:r,numElementsY:i,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}):s("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,E=h.boundaryElements;let v,C;return null!=d?(v=y.length,C=f.length,n(`Using parsed mesh with ${v} elements and ${C} nodes`)):(v=o*("2D"===t?i:1),C=g*("2D"===t?b:1),n(`Using mesh generated from geometry with ${v} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:E,totalElements:v,totalNodes:C,meshDimension:t,elementOrder:l}}function S(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new A({meshDimension:o,elementOrder:s});let l=new P({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function I(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,d=[];for(let e=0;e<i;e++)d[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:d}}function T(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,d=0,c=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],d+=i[r[e]]*t[e],c+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=c*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(c*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:d,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function k(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function R(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=k(e,t,o),r=k(e,t,s),a=i.inside||r.inside;let l=0,d=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),c=a(o,s),u=a(i,r),m=a(o,i);l=c/(c+u),d=m/(m+a(s,r))}return{inside:a,ksi:l,eta:d}}class Y{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((o=>{if("constantTemp"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((o=>{if("constantTemp"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((o=>{if("constantTemp"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((o=>{if("constantTemp"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant temperature to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,o,s,i,r,a){let l=[],d=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],d[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((o=>{if("convection"===this.boundaryConditions[o][0]){const s=l[o],i=d[o];n(`Boundary ${o}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[o].forEach((([o,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[o][a]-1;n(`  - Applied convection boundary condition to node ${l+1} (element ${o+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((c=>{if("convection"===this.boundaryConditions[c][0]){const u=l[c],m=d[c];n(`Boundary ${c}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[c].forEach((([l,d])=>{if("linear"===this.elementOrder){let c,h,f,p,g;0===d?(c=o[0],h=0,f=0,p=3,g=2):1===d?(c=0,h=o[0],f=0,p=2,g=1):2===d?(c=o[0],h=1,f=1,p=4,g=2):3===d&&(c=1,h=o[0],f=2,p=4,g=1);let b=a.getBasisFunctions(c,h),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[l].length;for(let e=0;e<F;e++){const t=this.nop[l][e]-1;0===d||2===d?(C+=i[t]*E[e],M+=r[t]*E[e]):1!==d&&3!==d||(D+=i[t]*v[e],$+=r[t]*v[e])}let x;x=0===d||2===d?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let o=f;o<p;o+=g){let i=this.nop[l][o]-1;n(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${o+1})`),e[i]+=-s[0]*x*y[o]*u*m;for(let e=f;e<p;e+=g){let n=this.nop[l][e]-1;t[i][n]+=-s[0]*x*y[o]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let c=0;c<3;c++){let h,f,p,g,b;0===d?(h=o[c],f=0,p=0,g=7,b=3):1===d?(h=0,f=o[c],p=0,g=3,b=1):2===d?(h=o[c],f=1,p=2,g=9,b=3):3===d&&(h=1,f=o[c],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),E=y.basisFunction,v=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,M=0,D=0,$=0,F=0;const x=this.nop[l].length;for(let e=0;e<x;e++){const t=this.nop[l][e]-1;0===d||2===d?(M+=i[t]*v[e],D+=r[t]*v[e]):1!==d&&3!==d||($+=i[t]*C[e],F+=r[t]*C[e])}let w;w=0===d||2===d?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let o=p;o<g;o+=b){let i=this.nop[l][o]-1;n(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${o+1})`),e[i]+=-s[c]*w*E[o]*u*m;for(let e=p;e<g;e+=b){let n=this.nop[l][e]-1;t[i][n]+=-s[c]*w*E[o]*E[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,o,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const d=this.nop[e].length,c=Array(d).fill().map((()=>Array(d).fill(0))),u=Array(d).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];n(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),n(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,c[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let n,l,m,p,g;0===a?(n=s[0],l=0,m=0,p=3,g=2):1===a?(n=0,l=s[0],m=0,p=2,g=1):2===a?(n=s[0],l=1,m=1,p=4,g=2):3===a&&(n=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(n,l),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta;let C,M=0,D=0,$=0,F=0;for(let n=0;n<d;n++){const s=this.nop[e][n]-1;0===a||2===a?(M+=t[s]*E[n],D+=o[s]*E[n]):1!==a&&3!==a||($+=t[s]*v[n],F+=o[s]*v[n])}C=0===a||2===a?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let n=0;n<3;n++){let l,d,m,p,g;0===a?(l=s[n],d=0,m=0,p=7,g=3):1===a?(l=0,d=s[n],m=0,p=3,g=1):2===a?(l=s[n],d=1,m=2,p=9,g=3):3===a&&(l=1,d=s[n],m=6,p=9,g=1);let b=r.getBasisFunctions(l,d),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[e].length;for(let n=0;n<F;n++){const s=this.nop[e][n]-1;0===a||2===a?(C+=t[s]*E[n],M+=o[s]*E[n]):1!==a&&3!==a||(D+=t[s]*v[n],$+=o[s]*v[n])}let x;x=0===a||2===a?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let e=m;e<p;e+=g){u[e]+=-i[n]*x*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[n]*x*y[e]*y[t]*h}}}}return{localJacobianMatrix:c,localResidualVector:u}}}function B(e,t){o("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:s,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:d}=e,c=S(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=c;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const o=f.getBasisFunctions(p[e],p[t]),i=T({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:s,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new Y(t,r,i,l,d);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,s,f),y.imposeConstantTempBoundaryConditions(u,m),o("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function q({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:d,meshDimension:c}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===c)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:d}=I({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(d[t]*d[n])}else if("2D"===c)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c,nodesXCoordinates:l,nodesYCoordinates:d,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class j{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((o=>{if("constantValue"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((o=>{if("constantValue"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((o=>{if("constantValue"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((o=>{if("constantValue"===this.boundaryConditions[o][0]){const s=this.boundaryConditions[o][1];n(`Boundary ${o}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[o].forEach((([o,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[o][i]-1;n(`  - Applied constant value to node ${r+1} (element ${o+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function W(e,t,s,i){o("Starting front propagation matrix assembly...");let r=1-i+.01;n(`eikonalViscousTerm: ${r}`),n(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:d,boundaryElements:c,totalElements:u,meshDimension:m,elementOrder:h}=e,f=S(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:E,gaussWeights:v,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=d[e][t]-1;for(let e=0;e<E.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(E[e]);const n=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:o,basisFunctionDerivX:i}=n;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=s[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<E.length;t++){let n=y.getBasisFunctions(E[e],E[t]);const o=T({basisFunction:n.basisFunction,basisFunctionDerivKsi:n.basisFunctionDerivKsi,basisFunctionDerivEta:n.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=o,m=n.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=s[b[e]]*c[e],f+=s[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*v[e]*v[t]*d*c[n]*h+r*v[e]*v[t]*d*u[n]*f,0!==i&&(p[o]+=i*(v[e]*v[t]*d*m[n]*Math.sqrt(h**2+f**2)-v[e]*v[t]*d*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*v[e]*v[t]*d*(c[n]*c[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-d*h*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*c[s]-i*(d*f*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new j(t,c,d,m,h).imposeDirichletBoundaryConditions(p,g),o("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function G({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:d}=s,{nodesXCoordinates:c,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(d).fill().map((()=>Array(d).fill(0))),p=Array(d).fill(0),g=Array(d),b=Array(d);for(let n=0;n<d;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:c,localToGlobalMap:b,nodesPerElement:d}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<d;e++)l+=i[b[e]]*r[e];for(let e=0;e<d;e++){b[e];for(let e=0;e<d;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:E}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:c,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:d});let v=0,C=0;for(let e=0;e<d;e++)v+=i[b[e]]*y[e],C+=i[b[e]]*E[e];for(let o=0;o<d;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*v+h*l[e]*l[t]*g*E[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(v**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<d;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+E[o]*E[s]),0!==r&&(f[o][s]+=r*(-g*v*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*E[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const K={},J={},L={currentElementIndex:0},H={};let U;function _(e,t,i,r={}){const a=S(t),l=t.nodesXCoordinates.length,d=t.totalElements;!function(e,t){K.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),K.nodeConstraintCode=Array(e).fill(0),K.boundaryValues=Array(e).fill(0),K.globalResidualVector=Array(e).fill(0),K.solutionVector=Array(e).fill(0),K.topologyData=Array(t).fill(0),K.lateralData=Array(t).fill(0),J.writeFlag=0,J.totalNodes=e,J.transformationFlag=0,J.nodesPerElement=Array(t).fill(0),J.determinant=1;const n=Math.max(e,2e3);J.globalSolutionVector=Array(n).fill(0),J.frontDataIndex=0,L.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),L.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);H.frontValues=Array(o).fill(0),H.columnHeaders=Array(n).fill(0),H.pivotRow=Array(n).fill(0),H.pivotData=Array(o).fill(0)}(a.nodesPerElement,d),o("Solving system using frontal..."),console.time("systemSolving"),U=new A({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)K.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)K.nodeConstraintCode[e]=0,K.boundaryValues[e]=0;let c;e===q?(c=new Y(i,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantTempBoundaryConditionsFront(K.nodeConstraintCode,K.boundaryValues)):e===G&&(c=new j(i,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantValueBoundaryConditionsFront(K.nodeConstraintCode,K.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)K.globalResidualVector[e]=0;J.totalNodes=t.nodesXCoordinates.length,J.writeFlag=0,J.transformationFlag=1,J.determinant=1;for(let e=0;e<t.totalElements;e++)J.nodesPerElement[e]=a.nodesPerElement;J.currentSolutionVector=r.solutionVector,J.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,o,i){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,J.globalSolutionVector.length);let d,c=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),E=Array(a).fill(0),v=Array(a).fill(0),C=1;J.writeFlag++;let M=1,D=1;L.currentElementIndex=0;for(let e=0;e<J.totalNodes;e++)y[e]=0,E[e]=0;if(0!==J.transformationFlag){for(let e=0;e<J.totalNodes;e++)v[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<J.nodesPerElement[t];e++){let n=K.nodalNumbering[t][e];0===v[n-1]&&(v[n-1]=1,K.nodalNumbering[t][e]=-K.nodalNumbering[t][e])}}}J.transformationFlag=0;let $=0,F=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,v=0,x=0;if(L.currentElementIndex<r&&(L.currentElementIndex++,a=z(e,t,o,i)),a){const e=L.currentElementIndex;v=J.nodesPerElement[e-1],x=J.nodesPerElement[e-1];for(let t=0;t<x;t++){let n,o,s=K.nodalNumbering[e-1][t];if(0===$)$++,c[t]=$,H.columnHeaders[$-1]=s;else{for(n=0;n<$&&Math.abs(s)!==Math.abs(H.columnHeaders[n]);n++);n===$?($++,c[t]=$,H.columnHeaders[$-1]=s):(c[t]=n+1,H.columnHeaders[n]=s)}if(0===F)F++,u[t]=F,m[F-1]=s;else{for(o=0;o<F&&Math.abs(s)!==Math.abs(m[o]);o++);o===F?(F++,u[t]=F,m[F-1]=s):(u[t]=o+1,m[o]=s)}}if(F>l||$>l)return void s("Error: systemSize not large enough");for(let e=0;e<x;e++){let t=c[e];for(let n=0;n<v;n++){b[u[n]-1][t-1]+=L.localJacobianMatrix[n][e]}}}let w=0;for(let e=0;e<$;e++)H.columnHeaders[e]<0&&(f[w]=e+1,w++);let A=0,N=0;for(let e=0;e<F;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===K.nodeConstraintCode[n-1]&&(p[A]=e+1,A++,K.nodeConstraintCode[n-1]=2,K.globalResidualVector[n-1]=K.boundaryValues[n-1])}}if(A>0)for(let e=0;e<A;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<$;e++){b[t][e]=0,Math.abs(H.columnHeaders[e])===n&&(b[t][e]=1)}}if(w>D||L.currentElementIndex<r){if(0===w)return void s("Error: no more rows fully summed");let e=h[0],t=f[0],o=b[e-1][t-1];if(Math.abs(o)<1e-4){o=0;for(let n=0;n<w;n++){let s=f[n];for(let n=0;n<N;n++){let i=h[n],r=b[i-1][s-1];Math.abs(r)>Math.abs(o)&&(o=r,t=s,e=i)}}}let i=Math.abs(m[e-1]);d=Math.abs(H.columnHeaders[t-1]);let a=i+d+y[i-1]+E[d-1];J.determinant=J.determinant*o*(-1)**a/Math.abs(o);for(let e=0;e<J.totalNodes;e++)e>=i&&y[e]--,e>=d&&E[e]--;if(Math.abs(o)<1e-10&&s(`Matrix singular or ill-conditioned, currentElementIndex=${L.currentElementIndex}, pivotGlobalRowIndex=${i}, pivotColumnGlobalIndex=${d}, pivotValue=${o}`),0===o)return;for(let t=0;t<$;t++)H.pivotRow[t]=b[e-1][t]/o;let l=K.globalResidualVector[i-1]/o;if(K.globalResidualVector[i-1]=l,g[e-1]=o,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*H.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n][e-1]=b[n][e]-o*H.pivotRow[e];K.globalResidualVector[e-1]-=o*l}if(e<F)for(let n=e;n<F;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*H.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n-1][e-1]=b[n][e]-o*H.pivotRow[e];K.globalResidualVector[e-1]-=o*l}for(let e=0;e<F;e++)H.pivotData[M+e-1]=g[e];M+=F;for(let e=0;e<F;e++)H.pivotData[M+e-1]=m[e];M+=F,H.pivotData[M-1]=e,M++;for(let e=0;e<$;e++)H.frontValues[C-1+e]=H.pivotRow[e];C+=$;for(let e=0;e<$;e++)H.frontValues[C-1+e]=H.columnHeaders[e];C+=$,H.frontValues[C-1]=i,H.frontValues[C]=$,H.frontValues[C+1]=t,H.frontValues[C+2]=o,C+=4;for(let e=0;e<F;e++)b[e][$-1]=0;for(let e=0;e<$;e++)b[F-1][e]=0;if($--,t<$+1)for(let e=t-1;e<$;e++)H.columnHeaders[e]=H.columnHeaders[e+1];if(F--,e<F+1)for(let t=e-1;t<F;t++)m[t]=m[t+1];if(F>1||L.currentElementIndex<r)continue;if(d=Math.abs(H.columnHeaders[0]),e=1,o=b[0][0],i=Math.abs(m[0]),t=1,a=i+d+y[i-1]+E[d-1],J.determinant=J.determinant*o*(-1)**a/Math.abs(o),H.pivotRow[0]=1,Math.abs(o)<1e-10&&s(`Matrix singular or ill-conditioned, currentElementIndex=${L.currentElementIndex}, pivotGlobalRowIndex=${i}, pivotColumnGlobalIndex=${d}, pivotValue=${o}`),0===o)return;K.globalResidualVector[i-1]=K.globalResidualVector[i-1]/o,H.frontValues[C-1]=H.pivotRow[0],C++,H.frontValues[C-1]=H.columnHeaders[0],C++,H.frontValues[C-1]=i,H.frontValues[C]=$,H.frontValues[C+1]=t,H.frontValues[C+2]=o,C+=4,H.pivotData[M-1]=g[0],M++,H.pivotData[M-1]=m[0],M++,H.pivotData[M-1]=e,M++,J.frontDataIndex=C,1===J.writeFlag&&n(`total ecs transfer in matrix reduction=${C}`),Q(C);break}}}(t,a,c,e);for(let e=0;e<t.nodesXCoordinates.length;e++)K.solutionVector[e]=J.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?n(`${u[e].toExponential(5)}  ${K.solutionVector[e].toExponential(5)}`):n(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${K.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),o("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:K.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function z(e,t,n,o){const i=L.currentElementIndex-1;if(i<0||i>=e.totalElements)return s(`Skipping out-of-range elementIndex=${i} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:i,nop:K.nodalNumbering,meshData:e,basisFunctions:U,FEAData:t,solutionVector:J.currentSolutionVector,eikonalActivationFlag:J.eikonalActivationFlag});let d=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),c=Array(t.nodesPerElement).fill(0);if(o===q){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===i))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:s}=t,r=n.imposeConvectionBoundaryConditionsFront(i,e.nodesXCoordinates,e.nodesYCoordinates,o,s,U);d=r.localJacobianMatrix,c=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)L.localJacobianMatrix[e][n]=r[e][n]+d[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;K.globalResidualVector[t]+=a[e]+c[e]}return!0}function Q(e){for(let e=0;e<J.totalNodes;e++)J.globalSolutionVector[e]=K.boundaryValues[e];for(let t=1;t<=J.totalNodes;t++){e-=4;let n=H.frontValues[e-1],o=H.frontValues[e],s=H.frontValues[e+1];if(H.frontValues[e+2],1===t)e--,H.columnHeaders[0]=H.frontValues[e-1],e--,H.pivotRow[0]=H.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)H.columnHeaders[t]=H.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)H.pivotRow[t]=H.frontValues[e-1+t]}let i=Math.abs(H.columnHeaders[s-1]);if(K.nodeConstraintCode[i-1]>0)continue;let r=0;H.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=H.pivotRow[e]*J.globalSolutionVector[Math.abs(H.columnHeaders[e])-1];J.globalSolutionVector[i-1]=r+K.globalResidualVector[n-1],K.nodeConstraintCode[i-1]=1}1===J.writeFlag&&n(`value of frontDataCounter after backsubstitution=${e}`)}function Z(t,n={}){let i=0,r=!1,a=0,l=[],d=[],c=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,d[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(d=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<d.length;e++)d[e]=Number(d[e])+Number(l[e]);if("frontal"===n.solverMethod){l=_(G,n.meshData,n.boundaryConditions,{solutionVector:d,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:c,residualVector:u}=t(n.meshData,n.boundaryConditions,d,n.eikonalActivationFlag));l=x(n.solverMethod,c,u).solutionVector}if(i=e(l),o(`Newton-Raphson iteration ${a+1}: Error norm = ${i.toExponential(4)}`),i<=h)r=!0;else if(i>100){s(`Solution not converged. Error norm: ${i}`);break}a++}return{solutionVector:d,converged:r,iterations:a,jacobianMatrix:c,residualVector:u}}class ee{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const o=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,n(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];n(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;n(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<o;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<o;e++)t[c][e]=0;t[c][c]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;n(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<o;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<o;e++)t[c][e]=0;t[c][c]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<o;e++)t[s][e]=0;t[s][s]=1,e[s]=0,n("Pinned pressure at first pressure node (p = 0) to remove null space")}}}function te(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:ne(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:ne(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function ne(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let d,c=r.getBasisFunctions(s,i).basisFunction;d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function oe(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}exports.FEAScriptModel=class{constructor(){this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,i("FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE"),o("FEAScriptModel instance created")}setSolverConfig(e,t={}){this.solverConfig=e,i("setSolverConfig() is deprecated. Use setModelConfig() instead"),void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,n("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,n(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,n(`tolerance set to ${this.tolerance}`)),n(`solverConfig set to ${e}`)}setModelConfig(e,t={}){this.setSolverConfig(e,t)}setMeshConfig(e){this.meshConfig=e,n(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,n(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,n(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||s("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],i=[],r=[],a=[];o("Preparing mesh...");const l=X(this.meshConfig);o("Mesh preparation completed");const d={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(o("Beginning solving process..."),console.time("totalSolvingTime"),o(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=_(q,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:i}=B(l,this.boundaryConditions));r=x(this.solverMethod,t,i,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let n=0;const o=5,s={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:n,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;n<=1;){s.eikonalActivationFlag=n,r.length>0&&(s.initialSolution=[...r]);const e=Z(W,s);t=e.jacobianMatrix,i=e.residualVector,r=e.solutionVector,n+=1/o}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)s("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:i}=function(e,t,n){o("Starting general form PDE matrix assembly...");const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,meshDimension:c,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=S(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:E,basisFunctions:v,gaussPoints:C,gaussWeights:M,nodesPerElement:D}=g;if("1D"===c)for(let e=0;e<d;e++){for(let t=0;t<D;t++)E[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=v.getBasisFunctions(C[e]),{detJacobian:o,basisFunctionDerivX:s}=I({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:i,localToGlobalMap:E,nodesPerElement:D});let r=0;for(let e=0;e<D;e++)r+=i[E[e]]*t[e];const a=m(r),l=h(r),d=f(r),c=p(r);for(let n=0;n<D;n++){const i=E[n];b[i]-=M[e]*o*c*t[n];for(let r=0;r<D;r++){const c=E[r];y[i][c]+=M[e]*o*a*s[n]*s[r],y[i][c]-=M[e]*o*l*s[r]*t[n],y[i][c]-=M[e]*o*d*t[n]*t[r]}}}}else"2D"===c&&s("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new j(t,l,a,c,u).imposeDirichletBoundaryConditions(b,y),o("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=x(this.solverMethod,t,i,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){o("Starting creeping flow matrix assembly...");const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,totalNodes:c,meshDimension:u,elementOrder:m}=e;"2D"!==u&&s("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&s("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=c,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<d;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,E=2*h+y;n(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${E} total DOFs`);let v=[],C=[];for(let e=0;e<E;e++){v[e]=0,C.push([]);for(let t=0;t<E;t++)C[e][t]=0}const M=new A({meshDimension:"2D",elementOrder:"quadratic"}),D=new A({meshDimension:"2D",elementOrder:"linear"});let $=new P({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),F=$.gaussPoints,x=$.gaussWeights;for(let e=0;e<d;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let n=[];for(let t=0;t<4;t++){const o=a[e][f[t]]-1;n[t]=p.get(o)}for(let e=0;e<F.length;e++)for(let o=0;o<F.length;o++){const s=M.getBasisFunctions(F[e],F[o]),a=D.getBasisFunctions(F[e],F[o]),l=T({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:i,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=l,m=x[e]*x[o]*d;for(let e=0;e<9;e++){let o=t[e],s=o,i=h+o;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(c[e]*c[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let o=2*h+n[t],r=m*a.basisFunction[t]*c[e],l=m*a.basisFunction[t]*u[e];C[s][o]+=r,C[i][o]+=l,C[o][s]+=-r,C[o][i]+=-l}}}}return new ee(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(v,C),o("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:v,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,i=a.residualVector;r=x(this.solverMethod,t,i,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),o("Solving process completed"),{solutionVector:r,nodesCoordinates:d}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||s("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],i=[],r=[];o("Preparing mesh...");const a=X(this.meshConfig);o("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(o("Beginning solving process..."),console.time("totalSolvingTime"),o(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:i}=B(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:o}=await w("jacobi-gpu",n,i,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=o}return console.timeEnd("totalSolvingTime"),o("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}},exports.FEAScriptWorker=class{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js","undefined"==typeof document?new(require("url").URL)("file:"+__filename).href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.cjs.js",document.baseURI).href),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=p(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}},exports.importGmshQuadTri=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const o={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,d=0,c={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},E=null,v=null,C=0,M=0,D=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",v="counts",r++;continue}if("$EndEntities"===e){i="",E=null,v=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const n=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(n[0]),t.ascii="0"===n[1],t.fltBytes=n[2];else if("physicalNames"===i){const e=parseInt(n[0],10),o=parseInt(n[1],10);let s=n.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:o,dimension:e,name:s})}else if("entities"===i)if("counts"===v)E={points:parseInt(n[0],10),curves:parseInt(n[1],10),surfaces:parseInt(n[2],10),volumes:parseInt(n[3],10)},v="points";else if("points"===v)C++,C===E.points&&(v="curves");else if("curves"===v){const e=parseInt(n[0],10),t=parseInt(n[7],10),s=n.slice(8,8+t).map((e=>parseInt(e,10)));o.curves[e]=s,M++,M===E.curves&&(v="surfaces")}else"surfaces"===v&&(D++,D===E.surfaces&&(v="volumes"));else if("nodes"===i){if(0===a)a=parseInt(n[0],10),l=parseInt(n[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(d<a&&0===c.numNodes)c={dim:parseInt(n[0],10),tag:parseInt(n[1],10),parametric:parseInt(n[2],10),numNodes:parseInt(n[3],10)},u=[],m=0,h=0;else if(m<c.numNodes){for(let e of n)if(u.push(parseInt(e,10)),m++,m===c.numNodes)break}else if(h<c.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(n[0]),t.nodesYCoordinates[e]=parseFloat(n[1]),t.totalNodesX++,t.totalNodesY++,h++,h===c.numNodes&&(d++,c={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(n[0],10),parseInt(n[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(n[0],10),tag:parseInt(n[1],10),elementType:parseInt(n[2],10),numElements:parseInt(n[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=n.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=o.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),n(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t},exports.logSystem=function(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),t="basic"):(t=e,o(`Log level set to: ${e}`))},exports.plotInterpolatedSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=X(e.meshConfig),l=new A({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],d=[],c=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(c*m),f=Math.round(u*m),p=c/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),d[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],d[e]=d[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,d[t]=d[0];for(let e=1;e<f;e++)r[t+e]=r[t],d[t+e]=d[t]+e*g}b=new Array(h*f).fill(null);const y=function(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:d,elementOrder:c}=e;"1D"===d?("linear"===c||"quadratic"===c)&&(t={0:[0],1:[1]}):"2D"===d&&("linear"===c?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===c&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let d=0;d<l[e].length;d++){n[s]=l[e][d],s++;const[c,u]=l[e][d];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[c][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}(a),{nodeNeighbors:E,neighborCount:v}=function(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}(a);let C=0;for(let n=0;n<h*f;n++){if(!oe(r[n],d[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<v[i];s++){let c=E[i][s];const u=te(e,a,t,c,r[n],d[n],l);if(u.inside){C=c,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=te(e,a,t,s,r[n],d[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let M=Math.min(window.innerWidth,700),D=u/c,$=Math.min(M,600),F=$*D,x={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:$,height:F,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},w={x:r,y:d,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[w],x,{responsive:!0}),console.timeEnd("plottingTime")}},exports.plotSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(X(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),d=Math.max(...s),c=Math.min(...i),u=(Math.max(...i)-c)/(d-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}},exports.printVersion="0.2.0";
+ */
+const r=Symbol("Comlink.proxy"),a=Symbol("Comlink.endpoint"),l=Symbol("Comlink.releaseProxy"),c=Symbol("Comlink.finalizer"),d=Symbol("Comlink.thrown"),u=e=>"object"==typeof e&&null!==e||"function"==typeof e,m=new Map([["proxy",{canHandle:e=>u(e)&&e[r],serialize(e){const{port1:t,port2:n}=new MessageChannel;return h(e,t),[n,[n]]},deserialize:e=>(e.start(),p(e))}],["throw",{canHandle:e=>u(e)&&d in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function h(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:a,path:l}=Object.assign({path:[]},s.data),u=(s.data.argumentList||[]).map(F);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(a){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=F(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,u);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[r]:!0})}(new n(...u));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;h(e,n),m=function(e,t){return D.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[d]:0}}Promise.resolve(m).catch((e=>({value:e,[d]:0}))).then((n=>{const[s,r]=M(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),r),"RELEASE"===a&&(t.removeEventListener("message",o),f(t),c in e&&"function"==typeof e[c]&&e[c]())})).catch((e=>{const[n,o]=M({value:new TypeError("Unserializable return value"),[d]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function f(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function p(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),E(e,n,[],t)}function g(e){if(e)throw new Error("Proxy has been released and is not useable")}function b(e){return w(e,new Map,{type:"RELEASE"}).then((()=>{f(e)}))}const y=new WeakMap,v="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(y.get(e)||0)-1;y.set(e,t),0===t&&b(e)}));function E(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(g(s),r===l)return()=>{!function(e){v&&v.unregister(e)}(i),b(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=w(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then(F);return o.then.bind(o)}return E(e,t,[...n,r])},set(o,i,r){g(s);const[a,l]=M(r);return w(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then(F)},apply(o,i,r){g(s);const l=n[n.length-1];if(l===a)return w(e,t,{type:"ENDPOINT"}).then(F);if("bind"===l)return E(e,t,n.slice(0,-1));const[c,d]=C(r);return w(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:c},d).then(F)},construct(o,i){g(s);const[r,a]=C(i);return w(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then(F)}});return function(e,t){const n=(y.get(t)||0)+1;y.set(t,n),v&&v.register(e,t,e)}(i,e),i}function C(e){const t=e.map(M);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const D=new WeakMap;function M(e){for(const[t,n]of m)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},D.get(e)||[]]}function F(e){switch(e.type){case"HANDLER":return m.get(e.name).deserialize(e.value);case"RAW":return e.value}}function w(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function $(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let c=[],d=!0,u=0;if(s(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),o=math.slu(e,1,1);let s=math.lusolve(o,n);c=math.squeeze(s).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,n,new Array(n.length).fill(0),{maxIterations:a,tolerance:l});e.converged?o(`Jacobi method converged in ${e.iterations} iterations`):i(`Jacobi method did not converge after ${e.iterations} iterations`),c=e.solutionVector,d=e.converged,u=e.iterations}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s("System solved successfully"),{solutionVector:c,converged:d,iterations:u}}async function A(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;s(`Solving system using ${e}...`),console.time("systemSolving");const c=Array.isArray(t)?t:t?.toArray?.()??t,d=Array.isArray(n)?n:n?.toArray?.()??n;let u,m=null,h=null,f=[],g=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js","undefined"==typeof document?new(require("url").URL)("file:"+__filename).href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.cjs.js",document.baseURI).href),{type:"module"}),t=p(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(d.length).fill(0);let t;t=await h.webgpuJacobiSolver(c,d,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,g=t.converged,u=t.iterations,g?o(`Jacobi method converged in ${u} iterations`):i(`Jacobi method did not converge after ${u} iterations`)}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:g,iterations:u}}class x{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],s=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void i("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,s[0]=-1*r(e),s[1]=1*r(e),s[2]=-1*e,s[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function c(e){return 2*e**2-e}function d(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*c(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*c(t),n[6]=c(e)*a(t),n[7]=c(e)*l(t),n[8]=c(e)*c(t),o[0]=d(e)*a(t),o[1]=d(e)*l(t),o[2]=d(e)*c(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*c(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*c(t),s[0]=a(e)*d(t),s[1]=a(e)*u(t),s[2]=a(e)*m(t),s[3]=l(e)*d(t),s[4]=l(e)*u(t),s[5]=l(e)*m(t),s[6]=c(e)*d(t),s[7]=c(e)*u(t),s[8]=c(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:s}}}class N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=o,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(s("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||i("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,o("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&i("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(o("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const n=t[0],s=t[1];o(`Processing boundary node pair: [${n}, ${s}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const i=this.parsedMesh.nodalNumbering[t];if(4===i.length){if(i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),c=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${c} in the element`),0===l&&2===c||2===l&&0===c?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===c||1===l&&0===c?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===c||3===l&&1===c?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===c||3===l&&2===c)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===i.length&&i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),c=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${c} in the element`),0===l&&6===c||6===l&&0===c||0===l&&3===c||3===l&&0===c||3===l&&6===c||6===l&&3===c?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===c||2===l&&0===c||0===l&&1===c||1===l&&0===c||1===l&&2===c||2===l&&1===c?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===c||8===l&&2===c||2===l&&5===c||5===l&&2===c||5===l&&8===c||8===l&&5===c?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===c||8===l&&6===c||6===l&&7===c||7===l&&6===c||7===l&&8===c||8===l&&7===c)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||i(`Could not find element containing boundary nodes ${n} and ${s}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class P extends N{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||i("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,n;if("linear"===this.elementOrder){t=this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class k extends N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:s="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:s,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||i("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let n,s,i,r;if("linear"===this.elementOrder){n=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r}}else if("quadratic"===this.elementOrder){n=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i/2,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const o=Math.PI/180,i=Math.tan(this.angleLeft*o),r=Math.tan(this.angleRight*o),a=1e-12;for(let o=0;o<s;o++){const l=t[o],c=Math.abs(i)<a?0:l/i,d=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<n;t++){const i=1===n?0:t/(n-1);e[t*s+o]=c+(d-c)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),o("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:n,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class O{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function S(e){const{meshDimension:t,numElementsX:n,numElementsY:s,maxX:r,maxY:a,elementOrder:l,parsedMesh:c,angleLeft:d,angleRight:u}=e;let m;"1D"===t?m=new P({numElementsX:n,maxX:r,elementOrder:l,parsedMesh:c}):"2D"===t?m=new k({numElementsX:n,maxX:r,numElementsY:s,maxY:a,elementOrder:l,parsedMesh:c,angleLeft:d,angleRight:u}):i("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,v=h.boundaryElements;let E,C;return null!=c?(E=y.length,C=f.length,o(`Using parsed mesh with ${E} elements and ${C} nodes`)):(E=n*("2D"===t?s:1),C=g*("2D"===t?b:1),o(`Using mesh generated from geometry with ${E} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:v,totalElements:E,totalNodes:C,meshDimension:t,elementOrder:l}}function I(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new x({meshDimension:o,elementOrder:s});let l=new O({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function V(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,c=[];for(let e=0;e<i;e++)c[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:c}}function T(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,c=0,d=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],c+=i[r[e]]*t[e],d+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=d*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(d*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:c,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function X(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function R(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=X(e,t,o),r=X(e,t,s),a=i.inside||r.inside;let l=0,c=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),d=a(o,s),u=a(i,r),m=a(o,i);l=d/(d+u),c=m/(m+a(s,r))}return{inside:a,ksi:l,eta:c}}function j(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}function Y(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:c,elementOrder:d}=e;"1D"===c?("linear"===d||"quadratic"===d)&&(t={0:[0],1:[1]}):"2D"===c&&("linear"===d?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===d&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let c=0;c<l[e].length;c++){n[s]=l[e][c],s++;const[d,u]=l[e][c];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[d][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}class B{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,n,s,i,r,a){let l=[],c=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],c[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("convection"===this.boundaryConditions[n][0]){const s=l[n],i=c[n];o(`Boundary ${n}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[n].forEach((([n,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[n][a]-1;o(`  - Applied convection boundary condition to node ${l+1} (element ${n+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((d=>{if("convection"===this.boundaryConditions[d][0]){const u=l[d],m=c[d];o(`Boundary ${d}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[d].forEach((([l,c])=>{if("linear"===this.elementOrder){let d,h,f,p,g;0===c?(d=n[0],h=0,f=0,p=3,g=2):1===c?(d=0,h=n[0],f=0,p=2,g=1):2===c?(d=n[0],h=1,f=1,p=4,g=2):3===c&&(d=1,h=n[0],f=2,p=4,g=1);let b=a.getBasisFunctions(d,h),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const w=this.nop[l].length;for(let e=0;e<w;e++){const t=this.nop[l][e]-1;0===c||2===c?(C+=i[t]*v[e],D+=r[t]*v[e]):1!==c&&3!==c||(M+=i[t]*E[e],F+=r[t]*E[e])}let $;$=0===c||2===c?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let n=f;n<p;n+=g){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[0]*$*y[n]*u*m;for(let e=f;e<p;e+=g){let o=this.nop[l][e]-1;t[i][o]+=-s[0]*$*y[n]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let d=0;d<3;d++){let h,f,p,g,b;0===c?(h=n[d],f=0,p=0,g=7,b=3):1===c?(h=0,f=n[d],p=0,g=3,b=1):2===c?(h=n[d],f=1,p=2,g=9,b=3):3===c&&(h=1,f=n[d],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),v=y.basisFunction,E=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,D=0,M=0,F=0,w=0;const $=this.nop[l].length;for(let e=0;e<$;e++){const t=this.nop[l][e]-1;0===c||2===c?(D+=i[t]*E[e],M+=r[t]*E[e]):1!==c&&3!==c||(F+=i[t]*C[e],w+=r[t]*C[e])}let A;A=0===c||2===c?Math.sqrt(D**2+M**2):Math.sqrt(F**2+w**2);for(let n=p;n<g;n+=b){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[d]*A*v[n]*u*m;for(let e=p;e<g;e+=b){let o=this.nop[l][e]-1;t[i][o]+=-s[d]*A*v[n]*v[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,n,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const c=this.nop[e].length,d=Array(c).fill().map((()=>Array(c).fill(0))),u=Array(c).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];o(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),o(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,d[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let o,l,m,p,g;0===a?(o=s[0],l=0,m=0,p=3,g=2):1===a?(o=0,l=s[0],m=0,p=2,g=1):2===a?(o=s[0],l=1,m=1,p=4,g=2):3===a&&(o=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(o,l),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta;let C,D=0,M=0,F=0,w=0;for(let o=0;o<c;o++){const s=this.nop[e][o]-1;0===a||2===a?(D+=t[s]*v[o],M+=n[s]*v[o]):1!==a&&3!==a||(F+=t[s]*E[o],w+=n[s]*E[o])}C=0===a||2===a?Math.sqrt(D**2+M**2):Math.sqrt(F**2+w**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)d[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let o=0;o<3;o++){let l,c,m,p,g;0===a?(l=s[o],c=0,m=0,p=7,g=3):1===a?(l=0,c=s[o],m=0,p=3,g=1):2===a?(l=s[o],c=1,m=2,p=9,g=3):3===a&&(l=1,c=s[o],m=6,p=9,g=1);let b=r.getBasisFunctions(l,c),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const w=this.nop[e].length;for(let o=0;o<w;o++){const s=this.nop[e][o]-1;0===a||2===a?(C+=t[s]*v[o],D+=n[s]*v[o]):1!==a&&3!==a||(M+=t[s]*E[o],F+=n[s]*E[o])}let $;$=0===a||2===a?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[o]*$*y[e]*h*f;for(let t=m;t<p;t+=g)d[e][t]+=-i[o]*$*y[e]*y[t]*h}}}}return{localJacobianMatrix:d,localResidualVector:u}}}function q(e,t){s("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:o,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:c}=e,d=I(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=d;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const s=f.getBasisFunctions(p[e],p[t]),i=T({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:o,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new B(t,r,i,l,c);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,o,f),y.imposeConstantTempBoundaryConditions(u,m),s("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function W({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:c,meshDimension:d}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===d)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:c}=V({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(c[t]*c[n])}else if("2D"===d)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:d}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:d,nodesXCoordinates:l,nodesYCoordinates:c,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class G{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function L(e,t,n,i){s("Starting front propagation matrix assembly...");let r=1-i+.01;o(`eikonalViscousTerm: ${r}`),o(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:c,boundaryElements:d,totalElements:u,meshDimension:m,elementOrder:h}=e,f=I(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:v,gaussWeights:E,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=c[e][t]-1;for(let e=0;e<v.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(v[e]);const o=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:s,basisFunctionDerivX:i}=o;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=n[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<v.length;t++){let o=y.getBasisFunctions(v[e],v[t]);const s=T({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:c,basisFunctionDerivX:d,basisFunctionDerivY:u}=s,m=o.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=n[b[e]]*d[e],f+=n[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*E[e]*E[t]*c*d[n]*h+r*E[e]*E[t]*c*u[n]*f,0!==i&&(p[o]+=i*(E[e]*E[t]*c*m[n]*Math.sqrt(h**2+f**2)-E[e]*E[t]*c*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*E[e]*E[t]*c*(d[n]*d[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-c*h*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*d[s]-i*(c*f*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new G(t,d,c,m,h).imposeDirichletBoundaryConditions(p,g),s("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function K({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:c}=s,{nodesXCoordinates:d,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(c).fill().map((()=>Array(c).fill(0))),p=Array(c).fill(0),g=Array(c),b=Array(c);for(let n=0;n<c;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:d,localToGlobalMap:b,nodesPerElement:c}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<c;e++)l+=i[b[e]]*r[e];for(let e=0;e<c;e++){b[e];for(let e=0;e<c;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:v}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:d,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:c});let E=0,C=0;for(let e=0;e<c;e++)E+=i[b[e]]*y[e],C+=i[b[e]]*v[e];for(let o=0;o<c;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*E+h*l[e]*l[t]*g*v[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(E**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<c;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+v[o]*v[s]),0!==r&&(f[o][s]+=r*(-g*E*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*v[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const J={},U={},H={currentElementIndex:0},_={};let z;function Q(e,t,n,r={}){const a=I(t),l=t.nodesXCoordinates.length,c=t.totalElements;!function(e,t){J.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),J.nodeConstraintCode=Array(e).fill(0),J.boundaryValues=Array(e).fill(0),J.globalResidualVector=Array(e).fill(0),J.solutionVector=Array(e).fill(0),J.topologyData=Array(t).fill(0),J.lateralData=Array(t).fill(0),U.writeFlag=0,U.totalNodes=e,U.transformationFlag=0,U.nodesPerElement=Array(t).fill(0),U.determinant=1;const n=Math.max(e,2e3);U.globalSolutionVector=Array(n).fill(0),U.frontDataIndex=0,H.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),H.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);_.frontValues=Array(o).fill(0),_.columnHeaders=Array(n).fill(0),_.pivotRow=Array(n).fill(0),_.pivotData=Array(o).fill(0)}(a.nodesPerElement,c),s("Solving system using frontal..."),console.time("systemSolving"),z=new x({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)J.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)J.nodeConstraintCode[e]=0,J.boundaryValues[e]=0;let d;e===W?(d=new B(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),d.imposeConstantTempBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues)):e===K&&(d=new G(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),d.imposeConstantValueBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)J.globalResidualVector[e]=0;U.totalNodes=t.nodesXCoordinates.length,U.writeFlag=0,U.transformationFlag=1,U.determinant=1;for(let e=0;e<t.totalElements;e++)U.nodesPerElement[e]=a.nodesPerElement;U.currentSolutionVector=r.solutionVector,U.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,n,s){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,U.globalSolutionVector.length);let c,d=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),v=Array(a).fill(0),E=Array(a).fill(0),C=1;U.writeFlag++;let D=1,M=1;H.currentElementIndex=0;for(let e=0;e<U.totalNodes;e++)y[e]=0,v[e]=0;if(0!==U.transformationFlag){for(let e=0;e<U.totalNodes;e++)E[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<U.nodesPerElement[t];e++){let n=J.nodalNumbering[t][e];0===E[n-1]&&(E[n-1]=1,J.nodalNumbering[t][e]=-J.nodalNumbering[t][e])}}}U.transformationFlag=0;let F=0,w=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,E=0,$=0;if(H.currentElementIndex<r&&(H.currentElementIndex++,a=Z(e,t,n,s)),a){const e=H.currentElementIndex;E=U.nodesPerElement[e-1],$=U.nodesPerElement[e-1];for(let t=0;t<$;t++){let n,o,s=J.nodalNumbering[e-1][t];if(0===F)F++,d[t]=F,_.columnHeaders[F-1]=s;else{for(n=0;n<F&&Math.abs(s)!==Math.abs(_.columnHeaders[n]);n++);n===F?(F++,d[t]=F,_.columnHeaders[F-1]=s):(d[t]=n+1,_.columnHeaders[n]=s)}if(0===w)w++,u[t]=w,m[w-1]=s;else{for(o=0;o<w&&Math.abs(s)!==Math.abs(m[o]);o++);o===w?(w++,u[t]=w,m[w-1]=s):(u[t]=o+1,m[o]=s)}}if(w>l||F>l)return void i("Error: systemSize not large enough");for(let e=0;e<$;e++){let t=d[e];for(let n=0;n<E;n++){b[u[n]-1][t-1]+=H.localJacobianMatrix[n][e]}}}let A=0;for(let e=0;e<F;e++)_.columnHeaders[e]<0&&(f[A]=e+1,A++);let x=0,N=0;for(let e=0;e<w;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===J.nodeConstraintCode[n-1]&&(p[x]=e+1,x++,J.nodeConstraintCode[n-1]=2,J.globalResidualVector[n-1]=J.boundaryValues[n-1])}}if(x>0)for(let e=0;e<x;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<F;e++){b[t][e]=0,Math.abs(_.columnHeaders[e])===n&&(b[t][e]=1)}}if(A>M||H.currentElementIndex<r){if(0===A)return void i("Error: no more rows fully summed");let e=h[0],t=f[0],n=b[e-1][t-1];if(Math.abs(n)<1e-4){n=0;for(let o=0;o<A;o++){let s=f[o];for(let o=0;o<N;o++){let i=h[o],r=b[i-1][s-1];Math.abs(r)>Math.abs(n)&&(n=r,t=s,e=i)}}}let s=Math.abs(m[e-1]);c=Math.abs(_.columnHeaders[t-1]);let a=s+c+y[s-1]+v[c-1];U.determinant=U.determinant*n*(-1)**a/Math.abs(n);for(let e=0;e<U.totalNodes;e++)e>=s&&y[e]--,e>=c&&v[e]--;if(Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${c}, pivotValue=${n}`),0===n)return;for(let t=0;t<F;t++)_.pivotRow[t]=b[e-1][t]/n;let l=J.globalResidualVector[s-1]/n;if(J.globalResidualVector[s-1]=l,g[e-1]=n,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*_.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n][e-1]=b[n][e]-o*_.pivotRow[e];J.globalResidualVector[e-1]-=o*l}if(e<w)for(let n=e;n<w;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*_.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n-1][e-1]=b[n][e]-o*_.pivotRow[e];J.globalResidualVector[e-1]-=o*l}for(let e=0;e<w;e++)_.pivotData[D+e-1]=g[e];D+=w;for(let e=0;e<w;e++)_.pivotData[D+e-1]=m[e];D+=w,_.pivotData[D-1]=e,D++;for(let e=0;e<F;e++)_.frontValues[C-1+e]=_.pivotRow[e];C+=F;for(let e=0;e<F;e++)_.frontValues[C-1+e]=_.columnHeaders[e];C+=F,_.frontValues[C-1]=s,_.frontValues[C]=F,_.frontValues[C+1]=t,_.frontValues[C+2]=n,C+=4;for(let e=0;e<w;e++)b[e][F-1]=0;for(let e=0;e<F;e++)b[w-1][e]=0;if(F--,t<F+1)for(let e=t-1;e<F;e++)_.columnHeaders[e]=_.columnHeaders[e+1];if(w--,e<w+1)for(let t=e-1;t<w;t++)m[t]=m[t+1];if(w>1||H.currentElementIndex<r)continue;if(c=Math.abs(_.columnHeaders[0]),e=1,n=b[0][0],s=Math.abs(m[0]),t=1,a=s+c+y[s-1]+v[c-1],U.determinant=U.determinant*n*(-1)**a/Math.abs(n),_.pivotRow[0]=1,Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${c}, pivotValue=${n}`),0===n)return;J.globalResidualVector[s-1]=J.globalResidualVector[s-1]/n,_.frontValues[C-1]=_.pivotRow[0],C++,_.frontValues[C-1]=_.columnHeaders[0],C++,_.frontValues[C-1]=s,_.frontValues[C]=F,_.frontValues[C+1]=t,_.frontValues[C+2]=n,C+=4,_.pivotData[D-1]=g[0],D++,_.pivotData[D-1]=m[0],D++,_.pivotData[D-1]=e,D++,U.frontDataIndex=C,1===U.writeFlag&&o(`total ecs transfer in matrix reduction=${C}`),ee(C);break}}}(t,a,d,e);for(let e=0;e<t.nodesXCoordinates.length;e++)J.solutionVector[e]=U.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?o(`${u[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`):o(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),s("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:J.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function Z(e,t,n,o){const s=H.currentElementIndex-1;if(s<0||s>=e.totalElements)return i(`Skipping out-of-range elementIndex=${s} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:s,nop:J.nodalNumbering,meshData:e,basisFunctions:z,FEAData:t,solutionVector:U.currentSolutionVector,eikonalActivationFlag:U.eikonalActivationFlag});let c=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),d=Array(t.nodesPerElement).fill(0);if(o===W){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===s))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:i}=t,r=n.imposeConvectionBoundaryConditionsFront(s,e.nodesXCoordinates,e.nodesYCoordinates,o,i,z);c=r.localJacobianMatrix,d=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)H.localJacobianMatrix[e][n]=r[e][n]+c[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;J.globalResidualVector[t]+=a[e]+d[e]}return!0}function ee(e){for(let e=0;e<U.totalNodes;e++)U.globalSolutionVector[e]=J.boundaryValues[e];for(let t=1;t<=U.totalNodes;t++){e-=4;let n=_.frontValues[e-1],o=_.frontValues[e],s=_.frontValues[e+1];if(_.frontValues[e+2],1===t)e--,_.columnHeaders[0]=_.frontValues[e-1],e--,_.pivotRow[0]=_.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)_.columnHeaders[t]=_.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)_.pivotRow[t]=_.frontValues[e-1+t]}let i=Math.abs(_.columnHeaders[s-1]);if(J.nodeConstraintCode[i-1]>0)continue;let r=0;_.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=_.pivotRow[e]*U.globalSolutionVector[Math.abs(_.columnHeaders[e])-1];U.globalSolutionVector[i-1]=r+J.globalResidualVector[n-1],J.nodeConstraintCode[i-1]=1}1===U.writeFlag&&o(`value of frontDataCounter after backsubstitution=${e}`)}function te(e,n={}){let o=0,r=!1,a=0,l=[],c=[],d=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,c[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(c=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<c.length;e++)c[e]=Number(c[e])+Number(l[e]);if("frontal"===n.solverMethod){l=Q(K,n.meshData,n.boundaryConditions,{solutionVector:c,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:d,residualVector:u}=e(n.meshData,n.boundaryConditions,c,n.eikonalActivationFlag));l=$(n.solverMethod,d,u).solutionVector}if(o=t(l),s(`Newton-Raphson iteration ${a+1}: Error norm = ${o.toExponential(4)}`),o<=h)r=!0;else if(o>100){i(`Solution not converged. Error norm: ${o}`);break}a++}return{solutionVector:c,converged:r,iterations:a,jacobianMatrix:d,residualVector:u}}class ne{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const n=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,o(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];o(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,c=l,d=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[c]=s;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1,e[d]=r;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,c=l,d=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[c]=s;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1,e[d]=r;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<n;e++)t[s][e]=0;t[s][s]=1,e[s]=0,o("Pinned pressure at first pressure node (p = 0) to remove null space")}}}function oe(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,c=t.nop[o].length;if(4===c){const c=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(c.inside)return{inside:!0,value:se(e,t,n,o,c.ksi,c.eta,r)}}else if(9===c){const c=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(c.inside)return{inside:!0,value:se(e,t,n,o,c.ksi,c.eta,r)}}return{inside:!1,value:null}}function se(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let c,d=r.getBasisFunctions(s,i).basisFunction;c=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=c[t.nop[o][e]-1]*d[e];return u}function ie(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}let re=null;async function ae(){if(re)return re;await Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Profiles/Geometry.js"))}));const[{default:t},{default:n},{default:o},{default:s},{default:i},{default:r},{default:a},{default:l},{default:c},{default:d}]=await Promise.all([Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Core/Actor.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Common/Core/DataArray.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Common/DataModel/ImageData.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Filters/General/ImageMarchingSquares.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Core/Mapper.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Common/DataModel/PolyData.js"))})),Promise.resolve().then((function(){return e(require("@kitware/vtk.js/Rendering/Core/ScalarBarActor.js"))}))]);return re={vtkActor:t,vtkColorTransferFunction:n,vtkColorMaps:o,vtkDataArray:s,vtkImageData:i,vtkImageMarchingSquares:r,vtkGenericRenderWindow:a,vtkMapper:l,vtkPolyData:c,vtkScalarBarActor:d},re}const le=new Map;function ce(e={}){return{presetName:e.presetName??"Cool to Warm",reverse:e.reverse??!1,showScalarBar:e.showScalarBar??!0,scalarBarTitle:e.scalarBarTitle??"Solution"}}function de(e={}){return{enabled:e.enabled??!0,numberOfContours:e.numberOfContours??12,color:e.color??[.15,.15,.15],lineWidth:e.lineWidth??1}}async function ue(e,t,n=null,o={}){const s=n??S(e.meshConfig),{nodesXCoordinates:i,nodesYCoordinates:r}=t.nodesCoordinates,a=pe(t.solutionVector,i.length),l=fe(i,r),c=o.mode??"surface",d="line"===c?function(e){if(e<2)return new Uint32Array(0);const t=new Uint32Array(3*(e-1));let n=0;for(let o=0;o<e-1;o++)t[n++]=2,t[n++]=o,t[n++]=o+1;return t}(i.length):function(e){const t=[];for(let n=0;n<e.length;n++){const o=ge(e[n]);t.push(o.length,...o)}return Uint32Array.from(t)}(s.nop??[]);return{points:l,scalars:a,cells:d,polyData:await he(l,a,d,c),mode:c,metadata:{solverConfig:e.solverConfig,meshDimension:e.meshConfig.meshDimension,numberOfPoints:l.length/3,numberOfCells:be(d)}}}async function me(e,t,n,o,s={}){if("undefined"==typeof document)return void i("vtk.js visualization requires a browser environment");const{vtkActor:r,vtkColorTransferFunction:a,vtkColorMaps:l,vtkGenericRenderWindow:c,vtkMapper:d,vtkScalarBarActor:u}=await ae(),m=document.getElementById(t);if(!m)return void i(`Could not find plot container with id: ${t}`);le.has(t)&&(le.get(t).delete(),le.delete(t)),m.innerHTML="",m.style.position="relative",m.style.width=m.style.width||"100%",m.style.height=m.style.height||"420px";const h=c.newInstance({background:[1,1,1]});h.setContainer(m),h.resize();const f=h.getRenderer(),p=h.getRenderWindow(),g=d.newInstance();g.setInputData(e.polyData),g.setScalarModeToUsePointData(),g.setColorModeToMapScalars(),g.setScalarVisibility(!0);const b=function(e){if(!e?.length)return[0,1];let t=Number.POSITIVE_INFINITY,n=Number.NEGATIVE_INFINITY;for(let o=0;o<e.length;o++){const s=e[o];Number.isFinite(s)&&(s<t&&(t=s),s>n&&(n=s))}return Number.isFinite(t)&&Number.isFinite(n)?t===n?[t-1,n+1]:[t,n]:[0,1]}(e.scalars);g.setScalarRange(b[0],b[1]);const y=s.colorScale??ce({}),v=a.newInstance(),E=function(e,t){if(!t||!e?.RGBPoints?.length)return e;const n=e.RGBPoints,o=n[0],s=n[n.length-4],i=[];for(let e=n.length-4;e>=0;e-=4)i.push(s-(n[e]-o),n[e+1],n[e+2],n[e+3]);return{...e,RGBPoints:i}}(l.getPresetByName(y.presetName)??l.getPresetByName("Cool to Warm"),y.reverse);v.applyColorMap(E),v.setMappingRange(b[0],b[1]),v.updateRange(),g.setLookupTable(v);const C=r.newInstance();if(C.setMapper(g),"line"===e.mode&&C.getProperty().setLineWidth(3),f.addActor(C),y.showScalarBar){const e=u.newInstance({drawNanAnnotation:!1,generateTicks:e=>{const t=e.getLastTickBounds();if(!t||t.length<2)return;const[n,o]=t,s=(o-n)/4,i=Array.from({length:5},((e,t)=>n+t*s));e.setTicks(i),e.setTickStrings(i.map((e=>{const t=Math.abs(e);return 0===t?"0":t>=.01&&t<1e4?parseFloat(e.toPrecision(4)).toString():e.toExponential(2)})))}});e.setTickTextStyle({fontColor:"black"}),e.setAxisTextStyle({fontColor:"black"}),e.setAxisLabel(y.scalarBarTitle),e.setScalarsToColors(v),f.addActor2D(e)}const D=de(s.contourLines??{enabled:!1});D.enabled&&"line"!==e.mode&&await async function(e,t,n,o){const s=t.metadata?.interpolationGrid;if(!s)return;const{vtkActor:i,vtkDataArray:r,vtkImageData:a,vtkImageMarchingSquares:l,vtkMapper:c}=await ae(),d=a.newInstance();d.setDimensions(s.nx,s.ny,1),d.setOrigin(s.origin[0],s.origin[1],0),d.setSpacing(s.spacing[0],s.spacing[1],1);const u=r.newInstance({name:"solution",numberOfComponents:1,values:s.imageScalars});d.getPointData().setScalars(u);const m=l.newInstance({slicingMode:2,slice:0,mergePoints:!0});m.setInputData(d);const h=Math.max(2,o.numberOfContours),f=n[0],p=n[1],g=(p-f)/(h-1),b=[];for(let e=0;e<h;e++)b.push(f+e*g);m.setContourValues(b),m.update();const y=c.newInstance();y.setInputData(m.getOutputData()),y.setScalarVisibility(!1);const v=i.newInstance();v.setMapper(y),v.getProperty().setColor(...o.color),v.getProperty().setLineWidth(o.lineWidth),e.addActor(v)}(f,e,b,D),f.resetCamera(),p.render(),le.set(t,h),m.title=`${o} plot - ${n}`}async function he(e,t,n,o="surface"){const{vtkPolyData:s,vtkDataArray:i}=await ae(),r=s.newInstance();r.getPoints().setData(e,3),n.length>0&&("line"===o?r.getLines().setData(n):r.getPolys().setData(n));const a=i.newInstance({name:"solution",numberOfComponents:1,values:t});return r.getPointData().setScalars(a),r}function fe(e,t){const n=new Float32Array(3*e.length);for(let o=0;o<e.length;o++){const s=3*o;n[s]=Number(e[o])||0,n[s+1]=Number(t?.[o])||0,n[s+2]=0}return n}function pe(e,t){const n=new Float32Array(t);for(let o=0;o<t;o++){const t=e?.[o];n[o]=Number(Array.isArray(t)?t[0]:t)||0}return n}function ge(e){const t=e.map((e=>e-1)),n=t.length;return 2===n||3===n?t:4===n?[t[0],t[2],t[3],t[1]]:6===n?[t[0],t[2],t[5]]:8===n?[t[0],t[4],t[6],t[2]]:9===n?[t[0],t[6],t[8],t[2]]:t.slice(0,Math.min(4,t.length))}function be(e){let t=0,n=0;for(;n<e.length;)n+=e[n]+1,t++;return t}function ye(e,t,n){const o=new Float32Array(t*n);for(let s=0;s<n;s++)for(let i=0;i<t;i++)o[i+s*t]=e[i*n+s];return o}function ve(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,c=t.nop[o].length;if(4===c){const c=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(c.inside)return{inside:!0,value:Ee(e,t,n,o,c.ksi,c.eta,r)}}else if(9===c){const c=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(c.inside)return{inside:!0,value:Ee(e,t,n,o,c.ksi,c.eta,r)}}return{inside:!1,value:null}}function Ee(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length,c=r.getBasisFunctions(s,i).basisFunction,d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function Ce(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}exports.FEAScriptModel=class{constructor(){var e;this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,e="FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE",console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;"),s("FEAScriptModel instance created")}setModelConfig(e,t={}){this.solverConfig=e,void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,o("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,o(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,o(`tolerance set to ${this.tolerance}`)),o(`solverConfig set to ${e}`)}setMeshConfig(e){this.meshConfig=e,o(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,o(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,o(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],n=[],r=[],a=[];s("Preparing mesh...");const l=S(this.meshConfig);s("Mesh preparation completed");const c={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=Q(W,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:n}=q(l,this.boundaryConditions));r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let o=0;const s=5,i={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:o,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;o<=1;){i.eikonalActivationFlag=o,r.length>0&&(i.initialSolution=[...r]);const e=te(L,i);t=e.jacobianMatrix,n=e.residualVector,r=e.solutionVector,o+=1/s}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)i("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:n}=function(e,t,n){s("Starting general form PDE matrix assembly...");const{nodesXCoordinates:o,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:c,meshDimension:d,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=I(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:v,basisFunctions:E,gaussPoints:C,gaussWeights:D,nodesPerElement:M}=g;if("1D"===d)for(let e=0;e<c;e++){for(let t=0;t<M;t++)v[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=E.getBasisFunctions(C[e]),{detJacobian:s,basisFunctionDerivX:i}=V({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:v,nodesPerElement:M});let r=0;for(let e=0;e<M;e++)r+=o[v[e]]*t[e];const a=m(r),l=h(r),c=f(r),d=p(r);for(let n=0;n<M;n++){const o=v[n];b[o]-=D[e]*s*d*t[n];for(let r=0;r<M;r++){const d=v[r];y[o][d]+=D[e]*s*a*i[n]*i[r],y[o][d]-=D[e]*s*l*i[r]*t[n],y[o][d]-=D[e]*s*c*t[n]*t[r]}}}}else"2D"===d&&i("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new G(t,l,a,d,u).imposeDirichletBoundaryConditions(b,y),s("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){s("Starting creeping flow matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:c,totalNodes:d,meshDimension:u,elementOrder:m}=e;"2D"!==u&&i("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&i("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=d,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<c;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,v=2*h+y;o(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${v} total DOFs`);let E=[],C=[];for(let e=0;e<v;e++){E[e]=0,C.push([]);for(let t=0;t<v;t++)C[e][t]=0}const D=new x({meshDimension:"2D",elementOrder:"quadratic"}),M=new x({meshDimension:"2D",elementOrder:"linear"});let F=new O({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),w=F.gaussPoints,$=F.gaussWeights;for(let e=0;e<c;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let o=[];for(let t=0;t<4;t++){const n=a[e][f[t]]-1;o[t]=p.get(n)}for(let e=0;e<w.length;e++)for(let s=0;s<w.length;s++){const i=D.getBasisFunctions(w[e],w[s]),a=M.getBasisFunctions(w[e],w[s]),l=T({basisFunction:i.basisFunction,basisFunctionDerivKsi:i.basisFunctionDerivKsi,basisFunctionDerivEta:i.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:c,basisFunctionDerivX:d,basisFunctionDerivY:u}=l,m=$[e]*$[s]*c;for(let e=0;e<9;e++){let n=t[e],s=n,i=h+n;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(d[e]*d[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let n=2*h+o[t],r=m*a.basisFunction[t]*d[e],l=m*a.basisFunction[t]*u[e];C[s][n]+=r,C[i][n]+=l,C[n][s]+=-r,C[n][i]+=-l}}}}return new ne(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(E,C),s("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:E,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,n=a.residualVector;r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:c}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],o=[],r=[];s("Preparing mesh...");const a=S(this.meshConfig);s("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:o}=q(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:s}=await A("jacobi-gpu",n,o,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=s}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}},exports.FEAScriptWorker=class{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js","undefined"==typeof document?new(require("url").URL)("file:"+__filename).href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.cjs.js",document.baseURI).href),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=p(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}},exports.createColorScale=ce,exports.createContourLineOptions=de,exports.importGmshQuadTri=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const n={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,c=0,d={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},v=null,E=null,C=0,D=0,M=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",E="counts",r++;continue}if("$EndEntities"===e){i="",v=null,E=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const o=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(o[0]),t.ascii="0"===o[1],t.fltBytes=o[2];else if("physicalNames"===i){const e=parseInt(o[0],10),n=parseInt(o[1],10);let s=o.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:n,dimension:e,name:s})}else if("entities"===i)if("counts"===E)v={points:parseInt(o[0],10),curves:parseInt(o[1],10),surfaces:parseInt(o[2],10),volumes:parseInt(o[3],10)},E="points";else if("points"===E)C++,C===v.points&&(E="curves");else if("curves"===E){const e=parseInt(o[0],10),t=parseInt(o[7],10),s=o.slice(8,8+t).map((e=>parseInt(e,10)));n.curves[e]=s,D++,D===v.curves&&(E="surfaces")}else"surfaces"===E&&(M++,M===v.surfaces&&(E="volumes"));else if("nodes"===i){if(0===a)a=parseInt(o[0],10),l=parseInt(o[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(c<a&&0===d.numNodes)d={dim:parseInt(o[0],10),tag:parseInt(o[1],10),parametric:parseInt(o[2],10),numNodes:parseInt(o[3],10)},u=[],m=0,h=0;else if(m<d.numNodes){for(let e of o)if(u.push(parseInt(e,10)),m++,m===d.numNodes)break}else if(h<d.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(o[0]),t.nodesYCoordinates[e]=parseFloat(o[1]),t.totalNodesX++,t.totalNodesY++,h++,h===d.numNodes&&(c++,d={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(o[0],10),parseInt(o[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(o[0],10),tag:parseInt(o[1],10),elementType:parseInt(o[2],10),numElements:parseInt(o[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=o.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=n.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),o(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t},exports.logSystem=function(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),n="basic"):(n=e,s(`Log level set to: ${e}`))},exports.plotInterpolatedSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=S(e.meshConfig),l=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],c=[],d=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(d*m),f=Math.round(u*m),p=d/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),c[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],c[e]=c[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,c[t]=c[0];for(let e=1;e<f;e++)r[t+e]=r[t],c[t+e]=c[t]+e*g}b=new Array(h*f).fill(null);const y=Y(a),{nodeNeighbors:v,neighborCount:E}=j(a);let C=0;for(let n=0;n<h*f;n++){if(!ie(r[n],c[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<E[i];s++){let d=v[i][s];const u=oe(e,a,t,d,r[n],c[n],l);if(u.inside){C=d,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=oe(e,a,t,s,r[n],c[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let D=Math.min(window.innerWidth,700),M=u/d,F=Math.min(D,600),w=F*M,$={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:F,height:w,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},A={x:r,y:c,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[A],$,{responsive:!0}),console.timeEnd("plottingTime")}},exports.plotInterpolatedSolutionVtk=async function(e,t,n,o,s={}){if(console.time("plottingTime"),"2D"!==e.meshConfig.meshDimension||"contour"!==n){const i=S(e.meshConfig),r=await ue(e,t,i,{mode:"1D"===e.meshConfig.meshDimension&&"line"===n?"line":"surface"});return await me(r,o,e.solverConfig,n,s),void console.timeEnd("plottingTime")}const i=S(e.meshConfig),r=await async function(e,t,n){const o=await async function(e,t,n){const{nodesXCoordinates:o,nodesYCoordinates:s}=t.nodesCoordinates,i=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});let r=o[0],a=o[0],l=s[0],c=s[0];for(let e=1;e<o.length;e++){const t=o[e],n=s[e];t<r&&(r=t),t>a&&(a=t),n<l&&(l=n),n>c&&(c=n)}const d=a-r,u=c-l,m=50,h=Math.max(2,Math.round(d*m)),f=Math.max(2,Math.round(u*m)),p=d/(h-1),g=u/(f-1),b=h*f,y=new Float32Array(b),v=new Float32Array(b),E=new Float32Array(b);E.fill(Number.NaN);const C=new Uint8Array(b),D=Y(n),{nodeNeighbors:M,neighborCount:F}=j(n);let w=0;for(let o=0;o<h;o++)for(let s=0;s<f;s++){const a=o*f+s,c=r+o*p,d=l+s*g;if(y[a]=c,v[a]=d,!Ce(c,d,D))continue;let u=!1;for(let o=0;o<n.nop[w].length;o++){const s=n.nop[w][o]-1;for(let o=0;o<F[s];o++){const r=M[s][o],l=ve(e,n,t,r,c,d,i);if(l.inside){w=r,E[a]=l.value,C[a]=1,u=!0;break}}if(u)break}if(!u)for(let o=0;o<n.nop.length;o++){const s=ve(e,n,t,o,c,d,i);if(s.inside){w=o,E[a]=s.value,C[a]=1;break}}}return{visNodesX:h,visNodesY:f,minX:r,minY:l,deltaX:p,deltaY:g,lengthX:d,lengthY:u,visNodeXCoordinates:y,visNodeYCoordinates:v,visSolution:E,insideMask:C}}(e,t,n),{visNodesX:s,visNodesY:i,minX:r,minY:a,deltaX:l,deltaY:c,visNodeXCoordinates:d,visNodeYCoordinates:u,visSolution:m,insideMask:h}=o,f=fe(d,u),p=function(e,t,n){const o=[];for(let s=0;s<e-1;s++)for(let e=0;e<t-1;e++){const i=s*t+e,r=(s+1)*t+e,a=(s+1)*t+(e+1),l=s*t+(e+1);n[i]&&n[r]&&n[a]&&n[l]&&o.push(4,i,r,a,l)}return Uint32Array.from(o)}(s,i,h),g=await he(f,m,p,"surface");return{points:f,scalars:m,cells:p,polyData:g,mode:"surface",metadata:{meshDimension:"2D",numberOfPoints:f.length/3,numberOfCells:be(p),interpolationGrid:{nx:s,ny:i,origin:[r,a],spacing:[l,c],imageScalars:ye(m,s,i)}}}}(e,t,i);await me(r,o,e.solverConfig,`${n}-interpolated`,s),console.timeEnd("plottingTime")},exports.plotSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(S(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),c=Math.max(...s),d=Math.min(...i),u=(Math.max(...i)-d)/(c-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}},exports.plotSolutionVtk=async function(e,t,n,o,s={}){console.time("plottingTime");const i=e.meshConfig.meshDimension,r=S(e.meshConfig),a=await ue(e,t,r,{mode:"1D"===i&&"line"===n?"line":"surface"});await me(a,o,e.solverConfig,n,s),console.timeEnd("plottingTime")},exports.printVersion="0.3.0 (RC)",exports.transformSolverOutputToMLBuffers=function(e){const{nodesXCoordinates:t,nodesYCoordinates:n}=e.nodesCoordinates,o=pe(e.solutionVector,t.length),s=new Float32Array(3*t.length);for(let e=0;e<t.length;e++){const i=3*e;s[i]=Number(t[e])||0,s[i+1]=Number(n[e])||0,s[i+2]=o[e]}return{features:s,featuresShape:[t.length,3],labels:o,points:fe(t,n)}},exports.transformSolverOutputToVTP=async function(e,t,n=null,o={}){return function(e){const{connectivity:t,offsets:n}=function(e){const t=[],n=[];let o=0,s=0;for(;o<e.length;){const i=e[o++];for(let n=0;n<i;n++)t.push(e[o++]);s+=i,n.push(s)}return{connectivity:t,offsets:n}}(e.cells),o=e.points.length/3,s="line"===e.mode,i=s?"Lines":"Polys";return['<?xml version="1.0"?>','<VTKFile type="PolyData" version="0.1" byte_order="LittleEndian">',"  <PolyData>",`    <Piece NumberOfPoints="${o}" NumberOfVerts="0" NumberOfLines="${s?n.length:0}" NumberOfStrips="0" NumberOfPolys="${s?0:n.length}">`,'      <PointData Scalars="solution">',`        <DataArray type="Float32" Name="solution" NumberOfComponents="1" format="ascii">${Array.from(e.scalars).join(" ")}</DataArray>`,"      </PointData>","      <Points>",`        <DataArray type="Float32" NumberOfComponents="3" format="ascii">${Array.from(e.points).join(" ")}</DataArray>`,"      </Points>",`      <${i}>`,`        <DataArray type="Int32" Name="connectivity" format="ascii">${t.join(" ")}</DataArray>`,`        <DataArray type="Int32" Name="offsets" format="ascii">${n.join(" ")}</DataArray>`,`      </${i}>`,"    </Piece>","  </PolyData>","</VTKFile>"].join("\n")}(await ue(e,t,n,o))},exports.transformSolverOutputToVtkData=ue;
 //# sourceMappingURL=feascript.cjs.js.map
diff --git a/dist/feascript.cjs.js.map b/dist/feascript.cjs.js.map
index 8816ff8..9a2cbdd 100644
--- a/dist/feascript.cjs.js.map
+++ b/dist/feascript.cjs.js.map
@@ -1 +1 @@
-{"version":3,"file":"feascript.cjs.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditions.js","../src/visualization/plotSolutionScript.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/workers/workerScript.js","../src/readers/gmshReaderScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\"\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  \n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : jacobianMatrix?.toArray?.() ?? jacobianMatrix;\n  const b = Array.isArray(residualVector) ? residualVector : residualVector?.toArray?.() ?? residualVector;\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => { });\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\"\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(Math.ceil(Math.sqrt(numElements)) * nodesPerElement, nodesPerElement * 2);\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex)\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag }\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideTriangle,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\"\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the solver configuration\n   * @param {string} solverConfig - Parameter specifying the type of solver\n   * @param {object} [options] - Optional additional configuration\n   */\n  setSolverConfig(solverConfig, options = {}) {\n    this.solverConfig = solverConfig;\n    warnLog(\"setSolverConfig() is deprecated. Use setModelConfig() instead\");\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${solverConfig}`);\n  }\n\n  // Alias modelConfig to solverConfig (solverConfig is deprecated, use setModelConfig instead)\n  setModelConfig(modelConfig, options = {}) {\n    this.setSolverConfig(modelConfig, options);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as \n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\"\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          }\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex]\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditions.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotSolutionScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.2.0\";"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","debugLog","message","console","log","basicLog","errorLog","warnLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","document","require","__filename","href","currentScript","tagName","toUpperCase","src","baseURI","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","globalNodeIndex","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","pointSearch","model","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","zData","solutionInterpolationValue","pointInsidePolygon","segments","x1","y1","x2","y2","solverConfig","coefficientFunctions","setSolverConfig","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","has","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseFloat","parseInt","replace","points","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","level","plotType","plotDivId","visNodeXCoordinates","visNodeYCoordinates","lengthX","min","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","k","getBoundarySegments","nodeNeighbors","neighborCount","from","elemIndex","computeNodeNeighbors","lastParentElement","visNodeIndex","found","neighborElementsIndex","searchResult","maxWindowWidth","window","innerWidth","aspectRatio","plotWidth","plotHeight","layout","title","width","height","xaxis","yaxis","scaleanchor","scaleratio","margin","hovermode","contourData","z","connectgaps","hoverongaps","smoothing","contours","coloring","showlabels","colorbar","Plotly","newPlot","responsive","yData","lineData","mode","color","minX","minY"],"mappings":"AAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,wDCXA,IAAIK,EAAkB,QAuBf,SAASC,EAASC,GACC,UAApBF,GACFG,QAAQC,IAAI,aAAeF,EAAS,qCAExC,CAMO,SAASG,EAASH,GACvBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC,CAMO,SAASI,EAASJ,GACvBC,QAAQC,IAAI,aAAeF,EAAS,qCACtC,CAMO,SAASK,EAAQL,GACtBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC;;;;;GCxDA,MAAMM,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACH3B,QAAS2B,EAAM3B,QACf+B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAM3B,SAAU4B,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADAzC,QAAQ8C,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKvD,OACL,MAAO,CAAE2E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKvD,OAAS,GAChC,GAAImH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAMxD,KAAKiI,MAAMjI,KAAKkI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGxF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHAxI,EAAS,wBAAwBgI,QACjClI,QAAQ2I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC5BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE5J,OACZ,IAAIgK,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAInK,EAAI,EAAGA,EAAIgK,EAAGhK,IAAK,CAC1B,IAAIoK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBrK,IAAMqK,IACRD,GAAOP,EAAE7J,GAAGqK,GAAKJ,EAAEI,IAGvBH,EAAKlK,IAAM8J,EAAE9J,GAAKoK,GAAOP,EAAE7J,GAAGA,EAC/B,CAGD,IAAIsK,EAAU,EACd,IAAK,IAAItK,EAAI,EAAGA,EAAIgK,EAAGhK,IACrBsK,EAAUpK,KAAKqK,IAAID,EAASpK,KAAKsK,IAAIN,EAAKlK,GAAKiK,EAAEjK,KAMnD,GAFAiK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDP+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAe1I,QAAQiI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrB3I,EAAS,8BAA8BuJ,EAAmBX,yBAE1DvI,EAAS,wCAAwCkJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACIvI,EAAS,0BAA0B+H,KAMrC,OAHAlI,QAAQmK,QAAQ,iBAChBjK,EAAS,8BAEF,CAAEsI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDnI,EAAS,wBAAwBgI,QACjClI,QAAQ2I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAiBA,GAAgBoC,aAAepC,EACpFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAiBA,GAAgBmC,aAAenC,EAE1F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAzCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,mCAAoC,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAAH,SAAAI,eAAA,WAAAJ,SAAAI,cAAAC,QAAAC,eAAAN,SAAAI,cAAAG,KAAA,IAAAR,IAAA,mBAAAC,SAAAQ,SAAAL,MAAkB,CACtFhI,KAAM,WAEFyH,EAAgBa,EAAaZ,GAEnC,aADMD,EAAcc,aACb,CAAEd,gBAAeC,SAC1B,CAkCoBc,GAChBf,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE7J,QAAQiI,KAAK,GACpC,IAAI8D,EAEJA,QAAehB,EAAciB,mBAAmBpC,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiBiD,EAAOjD,eACxBC,EAAYgD,EAAOhD,UACnBC,EAAa+C,EAAO/C,WAGhBD,EACF3I,EAAS,8BAA8B4I,gBAEvCvI,EAAS,wCAAwCuI,eAEvD,MACIvI,EAAS,0BAA0B+H,KAWrC,OARAlI,QAAQmK,QAAQ,iBAChBjK,EAAS,+BAA+BgI,MAEpCsC,UACIC,GAAekB,YAAYvH,OAAM,UACvCoG,EAAQE,OAAOkB,aAGV,CAAEpD,iBAAgBC,YAAWC,aACtC,CElIO,MAAMmD,EAMX,WAAA9G,EAAY+G,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADAhM,EAAS,8CAIX,GAA0B,WAAtB6L,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAA/H,EAAYgI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACPjN,EAAS,mEACT8L,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnBnN,EAAS,sDAKPkH,MAAMiD,QAAQ0B,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBjG,MAAMiD,QAAQ0B,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExD1N,EACE,yDACE2N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAa7N,OAAQmO,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAI1G,MAAMyG,EAAUpO,QAGlB,IAArBoO,EAAUpO,QAOZqO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAUpO,SASnBqO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtCxN,EAAS,4FASX,GANAL,EACE,gEACE2N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACE7G,MAAMiD,QAAQ0B,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBxO,OAAS,QACFuE,IAAxC+H,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAI1O,EAAI,EAAGA,EAAIuM,KAAKmB,WAAWe,iBAAiBxO,OAAQD,IACvDuM,KAAKmB,WAAWe,iBAAiBzO,IACnC0O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBzO,IAGhEuM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAAS5K,IAEvC,GAAuB,IAAnBA,EAAK6K,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkB3K,EAAK8K,MAAQ,GAErEH,EAAkB1O,OAAS,IAExBsM,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,OACzCvC,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExB1O,EACE,mCAAmC2O,MAAUC,mBAAuBjL,EAAK8K,QACvE9K,EAAK3B,MAAQ,cAKjB,IAAI6M,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAe5N,OAC9CmO,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoBlP,QAEtB,GAAIkP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C5O,EACE,mBAAmB+N,gDAA2De,EAAoB5G,KAChG,UAGJlI,EACE,UAAU2O,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,uCAAuCgP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,qCAAqCgP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,oCAAoCgP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPhP,EAAS,sCAAsCgP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAKP,KAAK,CAACH,EAAciB,IAC/DhP,EACE,8BAA8B+N,MAAiBiB,sBAAyBrL,EAAK8K,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoBlP,QAGzBkP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C5O,EACE,mBAAmB+N,gDAA2De,EAAoB5G,KAChG,UAGJlI,EACE,UAAU2O,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,uCAAuCgP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,qCAAqCgP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,oCAAoCgP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPhP,EAAS,sCAAsCgP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAKP,KAAK,CAACH,EAAciB,IAC/DhP,EACE,8BAA8B+N,MAAiBiB,sBAAyBrL,EAAK8K,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACHxO,EACE,oDAAoDsO,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBxO,OAAS,QACFuE,IAAxC+H,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAI1O,EAAI,EAAGA,EAAIuM,KAAKmB,WAAWe,iBAAiBxO,OAAQD,IACvDuM,KAAKmB,WAAWe,iBAAiBzO,IACnC0O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBzO,IAGhEuM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAA/H,EAAYgI,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrC7M,EAAS,wFAEZ,CAED,YAAAiP,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHA5P,EAAS,iCAAmC2N,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDjN,EAAS,yCAA2C2N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAA/H,EAAYgI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExF/M,EACE,6GAGL,CAED,YAAAiP,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAW5Q,KAAK6Q,GAAK,IACrBC,EAAU9Q,KAAK+Q,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAWhR,KAAK+Q,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQnR,KAAKsK,IAAIwG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAASpR,KAAKsK,IAAI0G,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJA5P,EAAS,iCAAmC2N,KAAKC,UAAU2B,IAC3DvP,EAAS,iCAAmC2N,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFA/N,EAAS,yCAA2C2N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAxM,EAAY+G,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAI9R,KAAKC,KAAK,KAAU,EAC1C6R,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAI9R,KAAKC,KAAK,KAAU,EAC1C8R,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGF7P,EAAS,8CAIX,MAAM2R,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAIjQ,OACpBsS,EAAa3C,EAAkB3P,OAC/BI,EAAS,0BAA0BiS,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnEpQ,EAAS,2CAA2CiS,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAI9J,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAIqH,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3DpH,EAAeoH,GAAa,EAC5BrH,EAAe6F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5ChK,EAAeqH,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACLpJ,iBACAD,iBACAmK,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAGjQ,OAWjC,CAOO,SAAS8S,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoB3J,EAAGmH,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAO/J,EAAI+J,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAO7J,EAAI+J,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyBlK,EAAGmH,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoB3J,EAAGmH,EAAGgD,GACrDK,EAA4Bb,EAAoB3J,EAAGmH,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnB1U,KAAKsK,KAAKoK,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAK1K,IAAM2K,EAAG,GAAKD,EAAG,KACnEzU,KAAKC,MAAMyU,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CC9RO,MAAMsI,EASX,WAAA1P,CAAY2P,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA4I,CAAqCvM,EAAgBD,GACxB,OAAvB6D,KAAKF,cACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvD/U,EACE,YAAY+U,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACd9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvD/U,EACE,YAAY+U,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAC,CAA0CC,EAAoBC,GACjC,OAAvBlJ,KAAKF,cACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvD/U,EACE,YAAY+U,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,KAE6B,OAAvB9I,KAAKF,eACd9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvD/U,EACE,YAAY+U,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4CiV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAK,CACE/M,EACAD,EACAsJ,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxBrT,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBvJ,KAAKF,cACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClC/U,EACE,YAAY+U,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAMiG,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,qDAAqDiV,EAAkB,cACrElH,EAAe,iBACD2B,EAAY,MAE9BpH,EAAe2M,KAAqBS,EAAkBC,EACtDtN,EAAe4M,GAAiBA,IAAoBS,CAAe,GAEtE,KAE6B,OAAvBxJ,KAAKF,eACd9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClC/U,EACE,YAAY+U,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D9S,EACE,qDAAqDiV,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInCxK,EAAe2M,KACZrD,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjE9N,EAAe4M,GAAiBmB,KAC7BxE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aACd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D9S,EACE,qDAAqDiV,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInCxK,EAAe2M,KACZrD,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjE9N,EAAe4M,GAAiBmB,KAC7BxE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACEvI,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxBrT,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMhD,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OACzC2W,EAAsBhP,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC2O,EAAsBjP,MAAMkL,GAAiB5K,KAAK,GAGxD,IAAK,MAAMkN,KAAe7I,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK0I,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClC/U,EACE,YAAY+U,2DAAqEW,0CAAwDC,OAI3I,MAAMc,EAAkBvK,KAAKkC,iBAAiB2G,GAAa2B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB5I,IAG1D,GAAI0I,EAAiB,CACnB,MAAMzH,EAAOyH,EAAgB,GAE7B,GAA2B,OAAvBvK,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/BhP,EACE,qDAAqD0P,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B8G,EAAoB9G,KAAegG,EAAkBC,EACrDY,EAAoB7G,GAAWA,IAAcgG,CACzD,MAAiB,GAA2B,OAAvBxJ,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAG3D,IAiBI0J,EAjBArD,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAKCwG,EADW,IAATlH,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aAEd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0BzE,EAAUwC,GAClDxU,EAAS,mDAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B,MAAMiK,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAG5EC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzC9N,EAAe6O,GAAmBC,KAC/BvF,EAAamF,GACdhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAY/R,OAAQwX,IAAoB,CAExF,MAAMnB,EAA+B3D,EAAenG,kBAClDwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzC9N,EAAe6O,GAAmBC,KAC/BvF,EAAamF,GACdnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAI1C,EACpCC,EACAxG,EACAyB,EACA7D,EACAC,GAkBF,OAdAoL,EAA0BhC,mCACxB/M,EACAD,EACAsJ,EACAC,EACArC,EACAY,EACAmC,GAIF+E,EAA0BxC,qCAAqCvM,EAAgBD,GAC/EjI,EAAS,iDAEF,CACLiI,iBACAC,iBAEJ,CAcO,SAASgP,GAA4BvJ,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcwE,QAAEA,IAEzF,MAAMnF,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DmE,EAAsBhP,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC2O,EAAsBjP,MAAMkL,GAAiB5K,KAAK,GAGlD0P,EAAMhQ,MAAMkL,GACZD,EAAmBjL,MAAMkL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkBjT,KAAKsK,IAAI0F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBjT,KAAKsK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IAAoB,CAExF,MAAMzK,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYoF,KAIRhE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAGnE,MACI,GAAsB,OAAlBnK,EAET,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAY/R,OAAQwX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,IAGxE5E,EAAmB+E,EAAIlU,KAAKmU,GAAgBA,EAAc,KAG1DzE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAAxS,CAAY2P,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAAyL,CAAkCpP,EAAgBD,GACrB,OAAvB6D,KAAKF,cACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMnT,EAAQsK,KAAK0I,mBAAmBG,GAAa,GACnD/U,EAAS,YAAY+U,iCAA2CnT,2BAChEsK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBrT,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBrT,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACd9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMnT,EAAQsK,KAAK0I,mBAAmBG,GAAa,GACnD/U,EAAS,YAAY+U,iCAA2CnT,2BAChEsK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBrT,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAe2M,GAAmBrT,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAe1I,OAAQyS,IACvDhK,EAAe4M,GAAiB5C,GAAY,EAG9ChK,EAAe4M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAA0C,CAA2CxC,EAAoBC,GAClC,OAAvBlJ,KAAKF,cACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMnT,EAAQsK,KAAK0I,mBAAmBG,GAAa,GACnD/U,EAAS,YAAY+U,iCAA2CnT,2BAChEsK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBrT,CAAK,GAEvD,MAAmB,GAA0B,cAAtBsK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBrT,CAAK,GAE1C,IAEJ,KAE6B,OAAvBsK,KAAKF,eACd9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMnT,EAAQsK,KAAK0I,mBAAmBG,GAAa,GACnD/U,EAAS,YAAY+U,iCAA2CnT,2BAChEsK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBrT,CAAK,GAEvD,MAAmB,GAA0B,cAAtBsK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsCiV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBrT,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASgW,EACdxF,EACAwC,EACAlM,EACAmP,GAEAzX,EAAS,iDAGT,IAAI0X,EAAqB,EAAID,EArBA,IAsB7B7X,EAAS,uBAAuB8X,KAChC9X,EAAS,0BAA0B6X,KAGnC,MAAMtI,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B3L,SAAS,6CAGT,IAAI4V,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACErP,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAY/R,OAAQwX,IAAoB,CAExF,IAAInB,EAA+B3D,EAAenG,kBAChDwF,EAAYoF,GACZpF,EAAYyF,IAId,MAAMJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAC5D1K,EAAgB2J,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACErP,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACEtP,EAAe8J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC3O,EAAe4O,IACbY,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACFvP,EAAe4O,IACbW,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACdpX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GAGzC9N,EAAe6O,GAAmBC,KAC/BW,EACDlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFxP,EAAe6O,GAAmBC,IAChCU,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbvX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbvX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkCpP,EAAgBD,GAC5EjI,EAAS,+CAEF,CACLiI,iBACAC,iBAEJ,CAgBO,SAAS2P,GAA8BlK,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcwE,QACdA,EAAOpO,eACPA,EAAcmP,sBACdA,IAGA,MAAMlG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI0F,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBhP,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC2O,EAAsBjP,MAAMkL,GAAiB5K,KAAK,GAGlD0P,EAAMhQ,MAAMkL,GACZD,EAAmBjL,MAAMkL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkBjT,KAAKsK,IAAI0F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBjT,KAAKsK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B3L,SAAS,6CAGT,IAAI4V,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACErP,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CAEP,MAAW,GAAsB,OAAlBnK,EACT,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAY/R,OAAQwX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,KAGxErE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIsF,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACErP,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACEtP,EAAe8J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAEzCT,EAAoBS,IAClBa,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACdpX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbvX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbvX,KAAKC,KAAKiY,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIhG,EAUG,SAASiG,EAAiBC,EAAepG,EAAUwC,EAAoBrM,EAAU,CAAA,GAEtF,MAAMuO,EAAU3E,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkB3P,OACxC6Y,EAAcrG,EAASH,eA6H/B,SAAiCQ,EAAiBgG,GAEhDP,EAAY1K,eAAiBjG,MAAMkR,GAChC5Q,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACzCqQ,EAAY/C,mBAAqB5N,MAAMkL,GAAiB5K,KAAK,GAC7DqQ,EAAY9C,eAAiB7N,MAAMkL,GAAiB5K,KAAK,GACzDqQ,EAAYQ,qBAAuBnR,MAAMkL,GAAiB5K,KAAK,GAC/DqQ,EAAYxP,eAAiBnB,MAAMkL,GAAiB5K,KAAK,GACzDqQ,EAAYS,aAAepR,MAAMkR,GAAa5Q,KAAK,GACnDqQ,EAAYU,YAAcrR,MAAMkR,GAAa5Q,KAAK,GAGlDsQ,EAAaU,UAAY,EACzBV,EAAajG,WAAaO,EAC1B0F,EAAaW,mBAAqB,EAClCX,EAAa1F,gBAAkBlL,MAAMkR,GAAa5Q,KAAK,GACvDsQ,EAAaY,YAAc,EAG3B,MAAMC,EAAanZ,KAAKqK,IAAIuI,EAAiB,KAC7C0F,EAAac,qBAAuB1R,MAAMyR,GAAYnR,KAAK,GAC3DsQ,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBhP,MAAMkL,GACrC5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACzCuQ,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B1G,EAAiBgG,GAC1C,MAAMW,EAAqBvZ,KAAKqK,IAAIrK,KAAKwZ,KAAKxZ,KAAKC,KAAK2Y,IAAgBhG,EAAmC,EAAlBA,GACzF,OAAO2G,EAAqBX,CAC9B,CAhBoBa,CAAkB7G,EAAiBgG,GACrDH,EAAaiB,YAAchS,MAAM4R,GAAWtR,KAAK,GACjDyQ,EAAakB,cAAgBjS,MAAMyR,GAAYnR,KAAK,GACpDyQ,EAAamB,SAAWlS,MAAMyR,GAAYnR,KAAK,GAC/CyQ,EAAaoB,UAAYnS,MAAM4R,GAAWtR,KAAK,EACjD,CA7JE8R,CAHwB7C,EAAQrE,gBAGSgG,GAGzCrY,EAAS,mCACTF,QAAQ2I,KAAK,iBAGbyJ,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYoH,EAAQrE,gBAAiB/C,IAC3DwI,EAAY1K,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEwI,EAAY/C,mBAAmBzF,GAAa,EAC5CwI,EAAY9C,eAAe1F,GAAa,EAI1C,IAAIkK,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIjF,EACvCC,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC7C,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI1F,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEwI,EAAYQ,qBAAqBhJ,GAAa,EAGhDyI,EAAajG,WAAaE,EAAS7C,kBAAkB3P,OACrDuY,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIhL,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEoK,EAAa1F,gBAAgB1E,GAAgB+I,EAAQrE,gBAIvD0F,EAAa0B,sBAAwBtR,EAAQG,eAC7CyP,EAAaN,sBAAwBtP,EAAQsP,sBAkM/C,SAA6BzF,EAAU0E,EAASO,EAA2BmB,GAEzE,MAAMvG,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkB3P,OAC7CoZ,EAAanZ,KAAKqK,IAAIuI,EAAiB0F,EAAac,qBAAqBrZ,QAC/E,IAaIka,EAbAC,EAAmBxS,MAAMuP,EAAQrE,iBAAiB5K,KAAK,GACvDmS,EAAiBzS,MAAMuP,EAAQrE,iBAAiB5K,KAAK,GACrDoS,EAAa1S,MAAMyR,GAAYnR,KAAK,GACpCqS,EAAkB3S,MAAMyR,GAAYnR,KAAK,GACzCsS,EAAqB5S,MAAMyR,GAAYnR,KAAK,GAC5CuS,EAAe7S,MAAMyR,GAAYnR,KAAK,GACtCwS,EAAc9S,MAAMyR,GAAYnR,KAAK,GACrCyS,EAAc/S,MAAMyR,GACrBnR,OACAxE,KAAI,IAAMkE,MAAMyR,GAAYnR,KAAK,KAChC0S,EAAehT,MAAMkL,GAAiB5K,KAAK,GAC3C2S,EAAkBjT,MAAMkL,GAAiB5K,KAAK,GAC9C4S,EAAsBlT,MAAMkL,GAAiB5K,KAAK,GAGlD6S,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI3I,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D6K,EAAa7K,GAAa,EAC1B8K,EAAgB9K,GAAa,EAG/B,GAAwC,IAApCyI,EAAaW,mBAA0B,CAEzC,IAAK,IAAIpJ,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D+K,EAAoB/K,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI8M,EAAsB5I,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBqF,EAAa1F,gBAAgBoI,GAC9C/H,IACA,CACA,IAAImC,EAAkBiD,EAAY1K,eAAeqN,GAAqB/H,GACrB,IAA7C2H,EAAoBxF,EAAkB,KACxCwF,EAAoBxF,EAAkB,GAAK,EAC3CiD,EAAY1K,eAAeqN,GAAqB/H,IAC7CoF,EAAY1K,eAAeqN,GAAqB/H,GAEtD,CACF,CACF,CAEDqF,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAIpb,EAAI,EAAGA,EAAIqZ,EAAYrZ,IAC9B,IAAK,IAAIqK,EAAI,EAAGA,EAAIgP,EAAYhP,IAC9BsQ,EAAYtQ,GAAGrK,GAAK,EAIxB,OAAa,CAEX,IAAIqb,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBpG,IACpCmG,EAAYC,sBACZ2C,EAAYG,EAA4B/I,EAAU0E,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa1F,gBAAgB2I,EAAiB,GAChEF,EAAoB/C,EAAa1F,gBAAgB2I,EAAiB,GAElE,IAAK,IAAItI,EAAiB,EAAGA,EAAiBoI,EAAmBpI,IAAkB,CACjF,IACIuI,EAqBAC,EAtBArG,EAAkBiD,EAAY1K,eAAe4N,EAAiB,GAAGtI,GAGrE,GAAoB,IAAhBgI,EACFA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,MACzC,CACL,IAAKoG,EAAc,EAAGA,EAAcP,GAC9Bjb,KAAKsK,IAAI8K,KAAqBpV,KAAKsK,IAAImO,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,IAE9C8E,EAAiBjH,GAAkBuI,EAAc,EACjD/C,EAAakB,cAAc6B,GAAepG,EAE7C,CAGD,GAAiB,IAAb8F,EACFA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,MACtB,CACL,IAAKqG,EAAW,EAAGA,EAAWP,GACxBlb,KAAKsK,IAAI8K,KAAqBpV,KAAKsK,IAAI8P,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,IAE3B+E,EAAelH,GAAkBwI,EAAW,EAC5CrB,EAAWqB,GAAYrG,EAE1B,CACF,CAED,GAAI8F,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADA3Y,EAAS,sCAIX,IAAK,IAAIkb,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAIrG,EAAkBgF,EAAWqB,GACjC,GAAIrG,EAAkB,EAAG,CACvBiF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoBhc,KAAKsK,IAAI8K,GAC6B,IAA1DiD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5C7G,EAAkBpV,KAAKsK,IAAI8P,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACbxb,KAAKsK,IAAImO,EAAakB,cAAc6B,MAClCpG,IAAiBqF,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBpG,EAAe,CACxF,GAA6B,IAAzByJ,EAEF,YADArb,EAAS,oCAIX,IAAI0b,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAInc,KAAKsK,IAAI8R,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5Drc,KAAKsK,IAAIiS,GAAavc,KAAKsK,IAAI8R,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBxc,KAAKsK,IAAI8P,EAAW8B,EAAgB,IAC9DjC,EAAyBja,KAAKsK,IAAImO,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBzc,KAAKsK,IAAI8R,GAEjF,IAAK,IAAIvM,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IACvDA,GAAa2M,GAAqB9B,EAAa7K,KAC/CA,GAAaoK,GAAwBU,EAAgB9K,KAS3D,GANI7P,KAAKsK,IAAI8R,GAAc,OACzB5b,EACE,2DAA2D+X,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiB3c,KAAKsK,IAAI8P,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiB3c,KAAKsK,IAAI8P,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAI5c,EAAI,EAAGA,EAAIob,EAAUpb,IAC5B2Y,EAAaoB,UAAUiB,EAAiBhb,EAAI,GAAK0a,EAAY1a,GAE/Dgb,GAAkBI,EAElB,IAAK,IAAIpb,EAAI,EAAGA,EAAIob,EAAUpb,IAC5B2Y,EAAaoB,UAAUiB,EAAiBhb,EAAI,GAAKsa,EAAWta,GAE9Dgb,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAIhb,EAAI,EAAGA,EAAImb,EAAanb,IAC/B2Y,EAAaiB,YAAYmB,EAAmB,EAAI/a,GAAK2Y,EAAamB,SAAS9Z,GAE7E+a,GAAoBI,EAEpB,IAAK,IAAInb,EAAI,EAAGA,EAAImb,EAAanb,IAC/B2Y,EAAaiB,YAAYmB,EAAmB,EAAI/a,GAAK2Y,EAAakB,cAAc7Z,GAElF+a,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBpG,EAAe,SAsBrE,GApBA6H,EAAyBja,KAAKsK,IAAImO,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBxc,KAAKsK,IAAI8P,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBzc,KAAKsK,IAAI8R,GAEjF3D,EAAamB,SAAS,GAAK,EACvB5Z,KAAKsK,IAAI8R,GAAc,OACzB5b,EACE,2DAA2D+X,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACf7Y,EAAS,0CAA0C0a,KAGrDgC,EAAwBhC,GACxB,KACD,CACF,CACH,CA1jBEiC,CAAoBvK,EAAU0E,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI9I,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEwI,EAAYxP,eAAegH,GAAayI,EAAac,qBAAqBvJ,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACtC,OAA3B0C,EAASpG,cAEXhM,EACE,GAAGuP,EAAkBG,GAAWkN,cAAc,OAAO1E,EAAYxP,eAC/DgH,GACAkN,cAAc,MAIlB5c,EACE,GAAGuP,EAAkBG,GAAWkN,cAAc,OAAOzM,EAAkBT,GAAWkN,cAChF,OACI1E,EAAYxP,eAAegH,GAAWkN,cAAc,MAKhE1c,QAAQmK,QAAQ,iBAChBjK,EAAS,8BAET,MAAQmP,kBAAmBsN,EAAa1M,kBAAmB2M,GAAgB1K,EAC3E,MAAO,CACL1J,eAAgBwP,EAAYxP,eAAejF,MAAM,EAAGyO,GACpD6K,iBAAkB,CAChBxN,kBAAmBsN,EACnB1M,kBAAmB2M,GAGzB,CAqEA,SAAS3B,EAA4B/I,EAAU0E,EAASO,EAA2BmB,GACjF,MAAMzK,EAAeqK,EAAYC,oBAAsB,EAGvD,GAAItK,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADA5R,EAAS,sCAAsC0N,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMsE,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtEzK,eACA8B,IAAKqI,EAAY1K,eACjB4E,WACAE,eAAgBA,EAChBwE,UAEApO,eAAgByP,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8BzV,MAAMuP,EAAQrE,iBAC7C5K,OACAxE,KAAI,IAAMkE,MAAMuP,EAAQrE,iBAAiB5K,KAAK,KAC7CoV,EAAyB1V,MAAMuP,EAAQrE,iBAAiB5K,KAAK,GAGjE,GAAI2Q,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMnI,KAAe3C,EAAShE,iBACjC,GACqE,eAAnEiJ,EAA0BzC,mBAAmBG,KAAe,IAC5D3C,EAAShE,iBAAiB2G,GAAaoI,MAAK,EAAExG,EAAsBC,KAAOD,IAAyB5I,IACpG,CACAmP,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMvL,YAAEA,EAAWC,aAAEA,GAAiBkF,EAChCnL,EAAS0L,EAA0Bf,wCACvCvI,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF0K,EAA8BrR,EAAO4K,oBACrC0G,EAAyBtR,EAAO6K,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQrE,gBAAiB2K,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQrE,gBAAiB4K,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIvK,EAAiB,EAAGA,EAAiBgE,EAAQrE,gBAAiBK,IAAkB,CACvF,MAAMmC,EAAkBsC,EAAIzE,GAAkB,EAC9CoF,EAAYQ,qBAAqBzD,IAC/BuB,EAAoB1D,GAAkBmK,EAAuBnK,EAChE,CAED,OAAO,CACT,CA0YA,SAAS4J,EAAwBhC,GAC/B,IAAK,IAAIhL,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3DyI,EAAac,qBAAqBvJ,GAAawI,EAAY9C,eAAe1F,GAG5E,IAAK,IAAI4N,EAAiB,EAAGA,GAAkBnF,EAAajG,WAAYoL,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyBja,KAAKsK,IAAImO,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqBpZ,KAAKsK,IAAImO,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACf7Y,EAAS,oDAAoD0a,IACjE,CC3sBO,SAAS8C,EAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZhV,GAAY,EACZC,EAAa,EACb6G,EAAS,GACT/G,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAASiV,EAGlD,IAAIxL,EAAawL,EAAQtL,SAAS7C,kBAAkB3P,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIuS,EAAYvS,IAC9B8P,EAAO9P,GAAK,EACZ+I,EAAe/I,GAAK,EAQtB,IAJI+d,EAAQE,iBAAmBF,EAAQE,gBAAgBhe,SAAWsS,IAChExJ,EAAiB,IAAIgV,EAAQE,kBAGxBhV,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAIhJ,EAAI,EAAGA,EAAI+I,EAAe9I,OAAQD,IACzC+I,EAAe/I,GAAKqI,OAAOU,EAAe/I,IAAMqI,OAAOyH,EAAO9P,IAIhE,GAA6B,YAAzB+d,EAAQtV,aAA4B,CAOtCqH,EANsB8I,EACpBN,EACAyF,EAAQtL,SACRsL,EAAQ9I,mBACR,CAAElM,iBAAgBmP,sBAAuB6F,EAAQ7F,wBAE5BnP,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmBmV,EACpCC,EAAQtL,SACRsL,EAAQ9I,mBACRlM,EACAgV,EAAQ7F,wBAKVpI,EAD2BtH,EAAkBuV,EAAQtV,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALAiV,EAAYne,EAAciQ,GAG1BrP,EAAS,4BAA4BwI,EAAa,mBAAmB+U,EAAUf,cAAc,MAEzFe,GAAalV,EACfE,GAAY,OACP,GAAIgV,EAAY,IAAK,CAC1Btd,EAAS,uCAAuCsd,KAChD,KACD,CAED/U,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAMuV,GAYX,WAAA5Y,CACE2P,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAEA9R,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK4R,mBAAqBA,EAC1B5R,KAAK6R,mBAAqBA,EAC1B7R,KAAK8R,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkCpP,EAAgBD,GAChD,MAAM4V,EAAY3V,EAAe1I,OACjC,IAAIse,GAAgB,EAEpB,GAA2B,OAAvBhS,KAAKF,gBACP9J,OAAO4S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,MAAMoJ,EAASjS,KAAK0I,mBAAmBG,GAAa,GAEpD,GAAe,eAAXoJ,EACFD,GAAgB,EAEhBle,EAAS,YAAY+U,uDAChB,GAAe,qBAAXoJ,EAA+B,CACxC,MAAMC,EAASlS,KAAK0I,mBAAmBG,GAAa,GAC9CsJ,EAASnS,KAAK0I,mBAAmBG,GAAa,GACpD/U,EACE,YAAY+U,8CAAwDqJ,QAAaC,MAEnFnS,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvCjV,EACE,0CAA0CiV,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAegW,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAeiW,GAAMjM,GAAY,EAEnChK,EAAeiW,GAAMA,GAAQ,EAG7BhW,EAAeiW,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAekW,GAAMlM,GAAY,EAEnChK,EAAekW,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBrS,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvCjV,EACE,0CAA0CiV,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9BpH,EAAegW,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAeiW,GAAMjM,GAAY,EAEnChK,EAAeiW,GAAMA,GAAQ,EAG7BhW,EAAeiW,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAekW,GAAMlM,GAAY,EAEnChK,EAAekW,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAItS,KAAK4R,mBACtB,IAAK,IAAIzL,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAemW,GAAMnM,GAAY,EAEnChK,EAAemW,GAAMA,GAAQ,EAC7BlW,EAAekW,GAAQ,EACvBxe,EAAS,sEACV,CAEJ,EC8JH,SAASye,GACPC,EACAtM,EACAzG,EACAyP,EACAuD,EACAC,EACAtM,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClDtK,EAAkBL,EAASvC,IAAIuL,GAAgBxb,OAErD,GAAwB,IAApB6S,EAAuB,CAoBzB,MAAMoM,EAAa/K,EAAyB6K,EAAoBC,EAlBjD,CACb,CACErP,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIyD,EAAWhL,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOkd,GACLJ,EACAtM,EACAzG,EACAyP,EACAyD,EAAWzS,IACXyS,EAAWxS,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMoM,EAAa/K,EAAyB6K,EAAoBC,EAlBjD,CACb,CACErP,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIyD,EAAWhL,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOkd,GACLJ,EACAtM,EACAzG,EACAyP,EACAyD,EAAWzS,IACXyS,EAAWxS,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOjS,MAAO,KACjC,CAaA,SAASkd,GAAsBJ,EAAOtM,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAM5J,EAAiBiD,EAAOjD,eACxB+J,EAAkBL,EAASvC,IAAI9B,GAAcnO,OAInD,IAGImf,EAHAzS,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/CyS,EADExX,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIsW,EAA6B,EACjC,IAAK,IAAIlM,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkM,GACED,EAAM3M,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOkM,CACT,CASA,SAASC,GAAmBrV,EAAGmH,EAAGmO,GAChC,IAAIrL,GAAS,EACb,IAAK,IAAIlU,EAAI,EAAGA,EAAIuf,EAAStf,OAAQD,IAAK,CACxC,OAAQwf,EAAIC,IAAMC,EAAIC,IAAOJ,EAASvf,GACpByf,EAAKrO,GAAMuO,EAAKvO,GAAKnH,GAAMyV,EAAKF,IAAOpO,EAAIqO,IAAQE,EAAKF,GAAMD,IACjEtL,GAAUA,EAC1B,CACD,OAAOA,CACT,wBC/aO,MACL,WAAA5O,GACEiH,KAAKqT,aAAe,KACpBrT,KAAK4F,WAAa,GAClB5F,KAAK0I,mBAAqB,GAC1B1I,KAAK9D,aAAe,UACpB8D,KAAKsT,qBAAuB,KAC5Blf,EACE,0PAEFF,EAAS,kCACV,CAOD,eAAAqf,CAAgBF,EAAchX,EAAU,IACtC2D,KAAKqT,aAAeA,EACpBjf,EAAQ,sEAG8B6D,IAAlCoE,GAASiX,uBACXtT,KAAKsT,qBAAuBjX,EAAQiX,qBACpCxf,EAAS,kCAGoBmE,IAA3BoE,GAASC,gBACX0D,KAAK1D,cAAgBD,EAAQC,cAC7BxI,EAAS,wBAAwBkM,KAAK1D,uBAEbrE,IAAvBoE,GAASE,YACXyD,KAAKzD,UAAYF,EAAQE,UACzBzI,EAAS,oBAAoBkM,KAAKzD,cAGpCzI,EAAS,uBAAuBuf,IACjC,CAGD,cAAAG,CAAeC,EAAapX,EAAU,IACpC2D,KAAKuT,gBAAgBE,EAAapX,EACnC,CAED,aAAAqX,CAAc9N,GACZ5F,KAAK4F,WAAaA,EAClB9R,EAAS,mCAAmC8R,EAAW9F,gBACxD,CAED,oBAAA6T,CAAqB9K,EAAa+K,GAChC5T,KAAK0I,mBAAmBG,GAAe+K,EACvC9f,EAAS,0CAA0C+U,YAAsB+K,EAAU,KACpF,CAED,eAAAC,CAAgB3X,GACd8D,KAAK9D,aAAeA,EACpBpI,EAAS,wBAAwBoI,IAClC,CAOD,KAAA4X,CAAMzX,EAAU,IACT2D,KAAKqT,cAAiBrT,KAAK4F,YAAe5F,KAAK0I,oBAClDvU,EAAS,8EAYX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjBkV,EAAkB,GAGtBxd,EAAS,qBACT,MAAMgS,EAAWP,EAAY3F,KAAK4F,YAClC1R,EAAS,8BAGT,MAAM2c,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHA/P,EAAS,gCACTF,QAAQ2I,KAAK,oBACbzI,EAAS,gBAAgB8L,KAAKqT,gBACJ,yBAAtBrT,KAAKqT,aAEP,GAA0B,YAAtBrT,KAAK9D,aAA4B,CAMnCM,EALsB6P,EACpBjB,EACAlF,EACAlG,KAAK0I,oBAEwBlM,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmBuO,EAA0BzE,EAAUlG,KAAK0I,qBAK/ElM,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,cACrC,MACI,GAA0B,2BAAtBwD,KAAKqT,aAA2C,CAEzD,IAAI1H,EAAwB,EAC5B,MAAMoI,EAA2B,EAG3BvC,EAAU,CACdtL,SAAUA,EACVwC,mBAAoB1I,KAAK0I,mBACzBiD,sBAAuBA,EACvBzP,aAAc8D,KAAK9D,aACnBwV,kBAEApV,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,WAGvC,KAAOoP,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5BnP,EAAe9I,OAAS,IAC1B8d,EAAQE,gBAAkB,IAAIlV,IAIhC,MAAMwX,EAAsB1C,EAAc5F,EAA6B8F,GAGvErV,EAAiB6X,EAAoB7X,eACrCC,EAAiB4X,EAAoB5X,eACrCI,EAAiBwX,EAAoBxX,eAGrCmP,GAAyB,EAAIoI,CAC9B,CACP,MAAW,GAA0B,yBAAtB/T,KAAKqT,aAEd,GAA0B,YAAtBrT,KAAK9D,aACP/H,EACE,uGAEG,GAEFgI,iBAAgBC,kBCvKpB,SAAmC8J,EAAUwC,EAAoB4K,GACtEpf,EAAS,gDAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGE5I,EAAEA,EAAC2W,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMb,EAGjB1I,EAAU3E,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAEJ,GAAsB,OAAlB9K,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjT,KAAKsK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIuD,EAAkB,EAAGA,EAAkB1E,EAAY/R,OAAQyW,IAAmB,CAErF,MAAM/J,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY0E,KAIRtD,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAI6N,EAAS,EACb,IAAK,IAAI3gB,EAAI,EAAGA,EAAI8S,EAAiB9S,IACnC2gB,GAAU/Q,EAAkBiD,EAAiB7S,IAAM2M,EAAc3M,GAInE,MAAM4gB,EAAI/W,EAAE8W,GACN7W,EAAI0W,EAAEG,GACN5T,EAAI0T,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIrJ,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,MAAMwJ,EAAmBjO,EAAiByE,GAG1C3O,EAAemY,IACb7O,EAAayE,GAAmBtD,EAAcyN,EAAIlU,EAAc2K,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,MAAMC,EAAmB5D,EAAiB2D,GAG1C9N,EAAeoY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACAwN,EACAvN,EAAoBiE,GACpBjE,EAAoBmD,GAGtB9N,EAAeoY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACAtJ,EACAuJ,EAAoBmD,GACpB7J,EAAc2K,GAGhB5O,EAAeoY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACArG,EACAJ,EAAc2K,GACd3K,EAAc6J,EACjB,CACF,CACF,CACF,KAC0B,OAAlBnK,GACT3L,EAAS,0EAkBX,OAbkC,IAAIoX,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkCpP,EAAgBD,GAE5EjI,EAAS,8CAEF,CACLiI,iBACAC,iBAEJ,CDsC8CoY,CACpCtO,EACAlG,KAAK0I,mBACL1I,KAAKsT,uBAOP9W,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,cACrC,MACI,GAA0B,uBAAtBwD,KAAKqT,aAAuC,CAErD,MAAMoB,EEnKL,SAAoCvO,EAAUwC,GACnDxU,EAAS,6CAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACF3L,EAAS,2CAEU,cAAjB4L,GACF5L,EAAS,wFAIX,MAAMyd,EAAqB5L,EAYrB0O,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/B5C,EAAkB,IAAIhd,IACtB6f,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAI/S,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAIgT,EAAc,EAAGA,EAAcH,EAAmBhhB,OAAQmhB,IAAe,CAChF,MAAMC,EAAenR,EAAI9B,GAAc6S,EAAmBG,IAAgB,EACrE/C,EAAgBiD,IAAID,KACvBhD,EAAgB/Z,IAAI+c,EAAcF,GAClCD,EAAoB3S,KAAK8S,GACzBF,IAEH,CAEH,MAAM/C,EAAqB+C,EACrB7C,EAAY,EAAIH,EAAqBC,EAE3C/d,EACE,uBAAuB8d,0BAA2CC,0BAA2CE,gBAI/G,IAAI3V,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAIqH,EAAY,EAAGA,EAAYuO,EAAWvO,IAAa,CAC1DpH,EAAeoH,GAAa,EAC5BrH,EAAe6F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3ChK,EAAeqH,GAAW2C,GAAY,CAEzC,CAGD,MAAM6O,EAAyB,IAAInV,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEVkV,EAAyB,IAAIpV,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIqT,EAAsB,GAC1B,IAAK,IAAItO,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEsO,EAAoBtO,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAIuO,EAAuB,GAC3B,IAAK,IAAIvO,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAMkO,EAAenR,EAAI9B,GAAc6S,EAAmB9N,IAAmB,EAC7EuO,EAAqBvO,GAAkBkL,EAAgBzY,IAAIyb,EAC5D,CAGD,IAAK,IAAIjK,EAAmB,EAAGA,EAAmBpF,EAAY/R,OAAQmX,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAY/R,OAAQwX,IAAoB,CAExF,MAAMkK,EAAuCJ,EAAuB/U,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRmK,EAAuCJ,EAAuBhV,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAegV,EAAqChV,cACpDC,sBAAuB+U,EAAqC/U,sBAC5DC,sBAAuB8U,EAAqC9U,sBAC5D+C,oBACAY,oBACAqC,iBAAkB4O,EAClB3O,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAG5DwK,EAAe5P,EAAamF,GAAoBnF,EAAawF,GAAoBrE,EAGvF,IAAK,IAAIkE,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAIwK,EAAcL,EAAoBnK,GAClCyK,EAAQD,EACRE,EAAQ7D,EAAqB2D,EAEjC,IAAK,IAAItL,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAIyL,EAAcR,EAAoBjL,GAClC0L,EAAQD,EACRE,EAAQhE,EAAqB8D,EAG7BG,EA9DH,GA+DEP,GAEAxO,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAG/D9N,EAAeqZ,GAAOG,IAAUE,EAChC1Z,EAAesZ,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAIxD,EAAO,EAAIV,EAAqBuD,EAAqBW,GAErDC,EACFT,EACAD,EAAqCjV,cAAc0V,GACnDhP,EAAoBiE,GAElBiL,EACFV,EACAD,EAAqCjV,cAAc0V,GACnD1O,EAAoB2D,GAGtB5O,EAAeqZ,GAAOlD,IAASyD,EAG/B5Z,EAAesZ,GAAOnD,IAAS0D,EAG/B7Z,EAAemW,GAAMkD,KAAWO,EAChC5Z,EAAemW,GAAMmD,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAIrE,GACjCjJ,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAGqBtG,kCAAkCpP,EAAgBD,GACzEjI,EAAS,2CAEF,CACLiI,iBACAC,iBACAwV,qBACAC,qBACA8C,sBAEJ,CFpDiCsB,CAA2B/P,EAAUlG,KAAK0I,oBACrEvM,EAAiBsY,EAAmBtY,eACpCC,EAAiBqY,EAAmBrY,eAMpCI,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,eAGpCwD,KAAKkW,sBAAwB,CAC3BtE,mBAAoB6C,EAAmB7C,mBACvCC,mBAAoB4C,EAAmB5C,mBACvC8C,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHA3gB,QAAQmK,QAAQ,oBAChBjK,EAAS,6BAEF,CAAEsI,iBAAgBqU,mBAC1B,CAQD,gBAAMsF,CAAW1X,EAAepC,EAAU,IACnC2D,KAAKqT,cAAiBrT,KAAK4F,YAAe5F,KAAK0I,oBAClDvU,EAAS,mFAGX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBtI,EAAS,qBACT,MAAMgS,EAAWP,EAAY3F,KAAK4F,YAClC1R,EAAS,8BACT,MAAM2c,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJA/P,EAAS,gCACTF,QAAQ2I,KAAK,oBAEbzI,EAAS,iBAAiB8L,KAAKqT,gBACL,yBAAtBrT,KAAKqT,iBACJlX,iBAAgBC,kBAAmBuO,EAA0BzE,EAAUlG,KAAK0I,qBAErD,eAAtB1I,KAAK9D,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHA1J,QAAQmK,QAAQ,oBAChBjK,EAAS,6BAEF,CAAEsI,iBAAgBqU,mBAC1B,2BGtQI,MAKL,WAAA9X,GACEiH,KAAKtB,OAAS,KACdsB,KAAKoW,UAAY,KACjBpW,KAAKqW,SAAU,EAEfrW,KAAKsW,aACN,CAOD,iBAAMA,GACJ,IACEtW,KAAKtB,OAAS,IAAIC,OAAO,IAAIC,IAAI,qBAAsB,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAAH,SAAAI,eAAA,WAAAJ,SAAAI,cAAAC,QAAAC,eAAAN,SAAAI,cAAAG,KAAA,IAAAR,IAAA,mBAAAC,SAAAQ,SAAAL,MAAkB,CACvEhI,KAAM,WAGRgJ,KAAKtB,OAAO6X,QAAWC,IACrBxiB,QAAQ4E,MAAM,iCAAkC4d,EAAM,EAExD,MAAMC,EAAgBnX,EAAaU,KAAKtB,QAExCsB,KAAKoW,gBAAkB,IAAIK,EAE3BzW,KAAKqW,SAAU,CAChB,CAAC,MAAOzd,GAEP,MADA5E,QAAQ4E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAM8d,GACJ,OAAI1W,KAAKqW,QAAgBne,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAASwe,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACI5W,KAAKqW,QACPle,IACSye,GANO,GAOhBD,EAAO,IAAI/gB,MAAM,2CAEjBkhB,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAMrD,CAAeC,GAEnB,aADMzT,KAAK0W,eACJ1W,KAAKoW,UAAU5C,eAAeC,EACtC,CAOD,mBAAMC,CAAc9N,GAElB,aADM5F,KAAK0W,eACJ1W,KAAKoW,UAAU1C,cAAc9N,EACrC,CAQD,0BAAM+N,CAAqB9K,EAAa+K,GAEtC,aADM5T,KAAK0W,eACJ1W,KAAKoW,UAAUzC,qBAAqB9K,EAAa+K,EACzD,CAOD,qBAAMC,CAAgB3X,GAEpB,aADM8D,KAAK0W,eACJ1W,KAAKoW,UAAUvC,gBAAgB3X,EACvC,CAMD,WAAM4X,SACE9T,KAAK0W,eACOK,YAAYC,MAC9B,MAAMvX,QAAeO,KAAKoW,UAAUtC,QAEpC,OADgBiD,YAAYC,MACrBvX,CACR,CAMD,kBAAMwX,GAEJ,aADMjX,KAAK0W,eACJ1W,KAAKoW,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADMlX,KAAK0W,eACJ1W,KAAKoW,UAAUc,MACvB,CAKD,SAAAtX,GACMI,KAAKtB,SACPsB,KAAKtB,OAAOkB,YACZI,KAAKtB,OAAS,KACdsB,KAAKoW,UAAY,KACjBpW,KAAKqW,SAAU,EAElB,6BChJuBjY,MAAO+Y,IAC/B,IAAI1X,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClBwG,mBAAoB,GACpBtG,kBAAmB,CAAE,EACrBgV,MAAO,EACPC,OAAO,EACPC,SAAU,IACVhU,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAM4V,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNxgB,KAAKygB,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnBjS,EAAa,EACbkS,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAEnM,YAAa,GACrCoM,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAM/jB,QAAQ,CAC/B,MAAMwlB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACFtY,EAAO2X,MAAQgC,WAAWD,EAAM,IAChC1Z,EAAO4X,MAAqB,MAAb8B,EAAM,GACrB1Z,EAAO6X,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAMzV,EAAY+W,SAASF,EAAM,GAAI,IAC/B5W,EAAM8W,SAASF,EAAM,GAAI,IAC/B,IAAIrjB,EAAOqjB,EAAM5hB,MAAM,GAAGyE,KAAK,KAAKsd,QAAQ,SAAU,IAEtD7Z,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWxM,QAC/C,MAGI,GAAgB,aAAZiiB,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbU,OAAQF,SAASF,EAAM,GAAI,IAC3B3B,OAAQ6B,SAASF,EAAM,GAAI,IAC3BK,SAAUH,SAASF,EAAM,GAAI,IAC7BM,QAASJ,SAASF,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAaU,SAAQT,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAMvW,EAAM8W,SAASF,EAAM,GAAI,IACzBO,EAAcL,SAASF,EAAM,GAAI,IACjCQ,EAAWR,EAAM5hB,MAAM,EAAG,EAAImiB,GAAaviB,KAAKqD,GAAM6e,SAAS7e,EAAG,MACxE+c,EAAkBC,OAAOjV,GAAOoX,EAChCX,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaW,WAAUV,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBoB,SAASF,EAAM,GAAI,IACtCnT,EAAaqT,SAASF,EAAM,GAAI,IAChC1Z,EAAO4D,kBAAoB,IAAIhI,MAAM2K,GAAYrK,KAAK,GACtD8D,EAAOwE,kBAAoB,IAAI5I,MAAM2K,GAAYrK,KAAK,QACjD,GAAIuc,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjByB,IAAKP,SAASF,EAAM,GAAI,IACxB5W,IAAK8W,SAASF,EAAM,GAAI,IACxBU,WAAYR,SAASF,EAAM,GAAI,IAC/Bf,SAAUiB,SAASF,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAI5d,KAAK2e,EAGZ,GAFAd,EAASrW,KAAKqX,SAAS7e,EAAG,KAC1B8d,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAM0B,EAAUzB,EAASE,GAA4B,EACrD9Y,EAAO4D,kBAAkByW,GAAWV,WAAWD,EAAM,IACrD1Z,EAAOwE,kBAAkB6V,GAAWV,WAAWD,EAAM,IACrD1Z,EAAO6D,cACP7D,EAAOyE,cACPqU,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBa,SAASF,EAAM,GAAI,IACzBE,SAASF,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoBnM,YAC7EmM,EAAsB,CACpBkB,IAAKP,SAASF,EAAM,GAAI,IACxB5W,IAAK8W,SAASF,EAAM,GAAI,IACxBY,YAAaV,SAASF,EAAM,GAAI,IAChC5M,YAAa8M,SAASF,EAAM,GAAI,KAGlC1Z,EAAOkC,aAAa+W,EAAoBqB,cACrCta,EAAOkC,aAAa+W,EAAoBqB,cAAgB,GAAKrB,EAAoBnM,YAEpFoM,EAA2B,OACtB,GAAIA,EAA2BD,EAAoBnM,YAAa,CACrE,MAAMyN,EAAcb,EAAM5hB,MAAM,GAAGJ,KAAKsG,GAAM4b,SAAS5b,EAAG,MAG1D,IAAIwc,EAAcvB,EAAoBnW,IACtC,GAAgC,IAA5BmW,EAAoBkB,IAAW,CACjC,MAAMM,EAAS3C,EAAkBC,OAAOkB,EAAoBnW,KACxD2X,GAAUA,EAAOxmB,OAAS,IAAGumB,EAAcC,EAAO,GACvD,CAEuC,IAApCxB,EAAoBqB,aAAyD,IAApCrB,EAAoBqB,aAC1DnB,EAAsBqB,KAAcrB,EAAsBqB,GAAe,IAC9ErB,EAAsBqB,GAAajY,KAAKgY,GAEnCva,EAAO2C,kBAAkB6X,KAAcxa,EAAO2C,kBAAkB6X,GAAe,IACpFxa,EAAO2C,kBAAkB6X,GAAajY,KAAKgY,IACE,IAApCtB,EAAoBqB,YAC7Bta,EAAO6B,eAAeE,iBAAiBQ,KAAKgY,GACC,IAApCtB,EAAoBqB,aAAyD,KAApCrB,EAAoBqB,aACtEta,EAAO6B,eAAeC,aAAaS,KAAKgY,GAG1CrB,IACIA,IAA6BD,EAAoBnM,cACnDkM,IACAC,EAAsB,CAAEnM,YAAa,GAExC,CAGHyL,GACD,CAkBD,OAfAvY,EAAOwC,gBAAgBI,SAAS5K,IAC9B,GAAuB,IAAnBA,EAAK6K,UAAiB,CACxB,MAAM6X,EAAQvB,EAAsBnhB,EAAK8K,MAAQ,GAC7C4X,EAAMzmB,OAAS,GACjB+L,EAAOiJ,mBAAmB1G,KAAK,CAC7BlM,KAAM2B,EAAK3B,KACXyM,IAAK9K,EAAK8K,IACV4X,SAGL,KAGHrmB,EAAS,+CAA+C2N,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,oBpB1QR,SAAmB2a,GACV,UAAVA,GAA+B,UAAVA,GACvBpmB,QAAQC,IACN,+BAAiCmmB,EAAQ,yBACzC,sCAEFvmB,EAAkB,UAElBA,EAAkBumB,EAClBlmB,EAAS,qBAAqBkmB,KAElC,mCe+GO,SAAkC5H,EAAO/S,EAAQ4a,EAAUC,GAChEtmB,QAAQ2I,KAAK,gBACb,MAAM0G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClD/Q,EAAgB0S,EAAM5M,WAAW9F,cACjCoG,EAAWP,EAAY6M,EAAM5M,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe0S,EAAM5M,WAAW9F,cAChCC,aAAcyS,EAAM5M,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAbua,QAEvB,GAAsB,OAAlBva,GAAuC,YAAbua,EAAwB,CAC3D,MAAME,EAAsB,GACtBC,EAAsB,GACtBC,EAAU9mB,KAAKqK,OAAOqF,GAAqB1P,KAAK+mB,OAAOrX,GACvDsX,EAAUhnB,KAAKqK,OAAOiG,GAAqBtQ,KAAK+mB,OAAOzW,GACvD2W,EAAkB,GAClBC,EAAYlnB,KAAKmnB,MAAML,EAAUG,GACjCG,EAAYpnB,KAAKmnB,MAAMH,EAAUC,GACjCI,EAAYP,GAAWI,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBX,EAAoB,GAAK5mB,KAAK+mB,OAAOrX,GACrCmX,EAAoB,GAAK7mB,KAAK+mB,OAAOzW,GAErC,IAAK,IAAIkX,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDZ,EAAoBY,GAAiBZ,EAAoB,GACzDC,EAAoBW,GAAiBX,EAAoB,GAAKW,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAM9W,EAAQ8W,EAAgBL,EAC9BR,EAAoBjW,GAASiW,EAAoB,GAAKa,EAAgBJ,EACtER,EAAoBlW,GAASkW,EAAoB,GAEjD,IAAK,IAAIW,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDZ,EAAoBjW,EAAQ6W,GAAiBZ,EAAoBjW,GACjEkW,EAAoBlW,EAAQ6W,GAAiBX,EAAoBlW,GAAS6W,EAAgBF,CAE7F,CAKDC,EAAc,IAAI7f,MAAMwf,EAAYE,GAAWpf,KAAK,MAGpD,MAAM0f,ERwKH,SAA6BnV,GAClC,IAGIoV,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAMpY,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJTub,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBxb,IACY,WAAjBC,EACFub,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjBvb,IACTub,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBxZ,EAAiBxO,OAAQgoB,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4BzZ,EAAiBwZ,GAAehoB,OAC5DioB,IACA,CACAJ,EAAqBE,GACnBvZ,EAAiBwZ,GAAeC,GAClCF,IAEA,MAAO5Z,EAAciB,GAAQZ,EAAiBwZ,GAAeC,GAC7D,IAAIC,EAA2BN,EAAcxY,GACzC+Y,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyBloB,OAClDqoB,IACA,CACA,MAAMhT,EAAkBpF,EAAI9B,GAAc+Z,EAAyBG,IAA2B,EAE9FF,EAAqB7Z,KAAKqB,EAAkB0F,IAC5C+S,EAAqB9Z,KAAKiC,EAAkB8E,GAC7C,CAGD,IAAK,IAAIiT,EAAI,EAAGA,EAAIH,EAAqBnoB,OAAS,EAAGsoB,IACnDR,EAAsBxZ,KAAK,CACzB,CAAC6Z,EAAqBG,GAAIF,EAAqBE,IAC/C,CAACH,EAAqBG,EAAI,GAAIF,EAAqBE,EAAI,KAG5D,CAEH,OAAOR,CACT,CQpP6BS,CAAoB/V,IAGvCgW,cAAEA,EAAaC,cAAEA,GRuIpB,SAA8BjW,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkB3P,OAC/B6S,EAAkB5C,EAAI,GAAGjQ,OAGzBwoB,EAAgB7gB,MAAM+gB,KAAK,CAAE1oB,OAAQsS,IAAc,IAAM,KACzDmW,EAAgB9gB,MAAM2K,GAAYrK,KAAK,GAG7C,IAAK,IAAI0gB,EAAY,EAAGA,EAAY1Y,EAAIjQ,OAAQ2oB,IAC9C,IAAK,IAAIzV,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAI0Y,GAAWzV,GAAkB,EAGnDuV,EAAc3Y,GAAa2Y,EAAc3Y,GAAa,EAGtD0Y,EAAc1Y,GAAWxB,KAAKqa,EAC/B,CAGH,MAAO,CAAEH,gBAAeC,gBAC1B,CQ9J6CG,CAAqBpW,GAC9D,IAAIqW,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAe3B,EAAYE,EAAWyB,IAAgB,CAE/E,IACGzJ,GACCwH,EAAoBiC,GACpBhC,EAAoBgC,GACpBnB,GAGF,SAEF,IAAIoB,GAAQ,EACZ,IACE,IAAI7V,EAAiB,EACrBA,EAAiBV,EAASvC,IAAI4Y,GAAmB7oB,OACjDkT,IACA,CACA,IAAImC,EAAkB7C,EAASvC,IAAI4Y,GAAmB3V,GAAkB,EACxE,IACE,IAAI8V,EAAwB,EAC5BA,EAAwBP,EAAcpT,GACtC2T,IACA,CACA,IAAIxN,EAAiBgN,EAAcnT,GAAiB2T,GACpD,MAAMC,EAAepK,GACnBC,EACAtM,EACAzG,EACAyP,EACAqL,EAAoBiC,GACpBhC,EAAoBgC,GACpBpW,GAGF,GAAIuW,EAAahV,OAAQ,CACvB4U,EAAoBrN,EACpBgM,EAAYsB,GAAgBG,EAAajnB,MACzC+mB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAIvN,EAAiB,EAAGA,EAAiBhJ,EAASvC,IAAIjQ,OAAQwb,IAAkB,CACnF,MAAMyN,EAAepK,GACnBC,EACAtM,EACAzG,EACAyP,EACAqL,EAAoBiC,GACpBhC,EAAoBgC,GACpBpW,GAGF,GAAIuW,EAAahV,OAAQ,CACvB4U,EAAoBrN,EACpBgM,EAAYsB,GAAgBG,EAAajnB,MACzC+mB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAIG,EAAiBjpB,KAAK+mB,IAAImC,OAAOC,WAAY,KAC7CC,EAAcpC,EAAUF,EACxBuC,EAAYrpB,KAAK+mB,IAAIkC,EAAgB,KACrCK,EAAaD,EAAYD,EAGzBG,EAAS,CACXC,MAAO,GAAG9C,2BAAkC7H,EAAMa,eAClD+J,MAAOJ,EACPK,OAAQJ,EACRK,MAAO,CAAEH,MAAO,KAChBI,MAAO,CACLJ,MAAO,IACPK,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAE9F,EAAG,GAAIrd,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,IAClCogB,UAAW,WAITC,EAAc,CAChBlgB,EAAG6c,EACH1V,EAAG2V,EACHqD,EAAG3C,EACHlkB,KAAM,UACN8mB,aAAa,EACbC,aAAa,EACb7E,KAAM,CACJ8E,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRjB,MAAO,YAETrnB,KAAM,+BAGRuoB,OAAOC,QAAQhE,EAAW,CAACsD,GAAcV,EAAQ,CAAEqB,YAAY,IAC/DvqB,QAAQmK,QAAQ,eACjB,CACH,uBAvRO,SAAsBqU,EAAO/S,EAAQ4a,EAAUC,GACpDtmB,QAAQ2I,KAAK,gBACb,MAAM0G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClDrU,EAAiBiD,EAAOjD,eACxB6W,EAAeb,EAAMa,aACrBvT,EAAgB0S,EAAM5M,WAAW9F,cAGvC,GAFiB6F,EAAY6M,EAAM5M,YAEb,OAAlB9F,GAAuC,SAAbua,EAAqB,CAEjD,IAAImE,EAEFA,EADEhiB,EAAe9I,OAAS,GAAK2H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAM+gB,KAAK/Y,GAEvB,IAAIob,EAAW,CACb/gB,EAAG2F,EACHwB,EAAG2Z,EACHE,KAAM,QACN1nB,KAAM,UACNkiB,KAAM,CAAEyF,MAAO,mBAAoBvB,MAAO,GAC1CtnB,KAAM,YAGJ8mB,EAAiBjpB,KAAK+mB,IAAImC,OAAOC,WAAY,KAI7CI,EAAS,CACXC,MAAO,eAAe9J,IACtB+J,MALczpB,KAAK+mB,IAAIkC,EAAgB,KAMvCS,OALe,IAMfC,MAAO,CAAEH,MAAO,KAChBI,MAAO,CAAEJ,MAAO,YAChBO,OAAQ,CAAE9F,EAAG,GAAIrd,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,KAGpC8gB,OAAOC,QAAQhE,EAAW,CAACmE,GAAWvB,EAAQ,CAAEqB,YAAY,IAC5DvqB,QAAQmK,QAAQ,eACjB,MAAM,GAAsB,OAAlB2B,GAAuC,YAAbua,EAAwB,CAE3D,IAAIxH,EAEFA,EADExX,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIogB,EAAiBjpB,KAAK+mB,IAAImC,OAAOC,WAAY,KAC7C8B,EAAOjrB,KAAK+mB,OAAOrX,GACnBrC,EAAOrN,KAAKqK,OAAOqF,GACnBwb,EAAOlrB,KAAK+mB,OAAOzW,GAInB8Y,GAHOppB,KAAKqK,OAAOiG,GAEF4a,IADP7d,EAAO4d,GAGjB5B,EAAYrpB,KAAK+mB,IAAIkC,EAAgB,KAIrCM,EAAS,CACXC,MAAO,GAAG9C,YAAmBhH,IAC7B+J,MAAOJ,EACPK,OANeL,EAAYD,EAO3BO,MAAO,CAAEH,MAAO,KAChBI,MAAO,CACLJ,MAAO,IACPK,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAE9F,EAAG,GAAIrd,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,IAClCogB,UAAW,WAITC,EAAc,CAChBlgB,EAAG2F,EACHwB,EAAGZ,EACH4Z,EAAGhL,EACH7b,KAAM,UACNkiB,KAAM,CACJ8E,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRjB,MAAO,YAETrnB,KAAM,kBAGRuoB,OAAOC,QAAQhE,EAAW,CAACsD,GAAcV,EAAQ,CAAEqB,YAAY,IAC/DvqB,QAAQmK,QAAQ,eACjB,CACH,uBMnH4B"}
\ No newline at end of file
+{"version":3,"file":"feascript.cjs.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditionsScript.js","../src/visualization/plotlyPlotScript.js","../src/visualization/vtkPlotScript.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/workers/workerScript.js","../src/readers/gmshReaderScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\",\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : (jacobianMatrix?.toArray?.() ?? jacobianMatrix);\n  const b = Array.isArray(residualVector) ? residualVector : (residualVector?.toArray?.() ?? residualVector);\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => {});\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`,\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`,\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\",\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder,\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`,\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`,\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag,\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`,\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5,\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`,\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(\n    Math.ceil(Math.sqrt(numElements)) * nodesPerElement,\n    nodesPerElement * 2,\n  );\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        )\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions,\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag },\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag, // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments,\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { errorLog } from \"../utilities/loggingScript.js\";\n\nlet _vtkModules = null;\n\n/**\n * Lazily loads and caches vtk.js modules required for rendering\n * @returns {Promise<object>} Object containing vtk.js module references\n */\nasync function loadVtkModules() {\n  if (_vtkModules) return _vtkModules;\n  await import(\"@kitware/vtk.js/Rendering/Profiles/Geometry.js\");\n  const [\n    { default: vtkActor },\n    { default: vtkColorTransferFunction },\n    { default: vtkColorMaps },\n    { default: vtkDataArray },\n    { default: vtkImageData },\n    { default: vtkImageMarchingSquares },\n    { default: vtkGenericRenderWindow },\n    { default: vtkMapper },\n    { default: vtkPolyData },\n    { default: vtkScalarBarActor },\n  ] = await Promise.all([\n    import(\"@kitware/vtk.js/Rendering/Core/Actor.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js\"),\n    import(\"@kitware/vtk.js/Common/Core/DataArray.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/ImageData.js\"),\n    import(\"@kitware/vtk.js/Filters/General/ImageMarchingSquares.js\"),\n    import(\"@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/Mapper.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/PolyData.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ScalarBarActor.js\"),\n  ]);\n  _vtkModules = {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkDataArray,\n    vtkImageData,\n    vtkImageMarchingSquares,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkPolyData,\n    vtkScalarBarActor,\n  };\n  return _vtkModules;\n}\n\nconst rendererCache = new Map();\n\n/**\n * Creates a color scale configuration for visualization\n * @param {object} options - Color scale options\n * @param {string} [options.presetName=\"Cool to Warm\"] - Color map preset name\n * @param {boolean} [options.reverse=false] - Whether to reverse the color map\n * @param {boolean} [options.showScalarBar=true] - Whether to display the scalar bar\n * @param {string} [options.scalarBarTitle=\"Solution\"] - Title for the scalar bar\n * @returns {object} Color scale configuration object\n */\nexport function createColorScale(options = {}) {\n  return {\n    presetName: options.presetName ?? \"Cool to Warm\",\n    reverse: options.reverse ?? false,\n    showScalarBar: options.showScalarBar ?? true,\n    scalarBarTitle: options.scalarBarTitle ?? \"Solution\",\n  };\n}\n\n/**\n * Creates contour line options for visualization\n * @param {object} options - Contour line options\n * @param {boolean} [options.enabled=true] - Whether contour lines are enabled\n * @param {number} [options.numberOfContours=12] - Number of contour lines\n * @param {Array<number>} [options.color=[0.15,0.15,0.15]] - RGB color array for contour lines\n * @param {number} [options.lineWidth=1] - Width of contour lines\n * @returns {object} Contour line configuration object\n */\nexport function createContourLineOptions(options = {}) {\n  return {\n    enabled: options.enabled ?? true,\n    numberOfContours: options.numberOfContours ?? 12,\n    color: options.color ?? [0.15, 0.15, 0.15],\n    lineWidth: options.lineWidth ?? 1,\n  };\n}\n\n/**\n * Plots the FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"line\", \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig);\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n    mode: meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n  });\n  await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Plots an interpolated FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotInterpolatedSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  if (model.meshConfig.meshDimension !== \"2D\" || plotType !== \"contour\") {\n    // Fallback to non-interpolated for non-2D contour cases\n    const meshData = prepareMesh(model.meshConfig);\n    const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n      mode: model.meshConfig.meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n    });\n    await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n    console.timeEnd(\"plottingTime\");\n    return;\n  }\n  const meshData = prepareMesh(model.meshConfig);\n  const interpolatedVtkData = await buildInterpolatedVtkData(model, result, meshData);\n  await renderVtkScene(\n    interpolatedVtkData,\n    plotDivId,\n    model.solverConfig,\n    `${plotType}-interpolated`,\n    renderOptions,\n  );\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Transforms solver output into VTK-compatible data structures\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<object>} VTK data object with points, scalars, cells, polyData, and metadata\n */\nexport async function transformSolverOutputToVtkData(model, result, meshData = null, options = {}) {\n  const preparedMesh = meshData ?? prepareMesh(model.meshConfig);\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionArray = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const points = buildPointsArray(nodesXCoordinates, nodesYCoordinates);\n\n  const mode = options.mode ?? \"surface\";\n  const cells =\n    mode === \"line\"\n      ? buildLineCellsFromPoints(nodesXCoordinates.length)\n      : buildCellArrayFromNop(preparedMesh.nop ?? []);\n\n  const polyData = await buildPolyData(points, solutionArray, cells, mode);\n\n  return {\n    points,\n    scalars: solutionArray,\n    cells,\n    polyData,\n    mode,\n    metadata: {\n      solverConfig: model.solverConfig,\n      meshDimension: model.meshConfig.meshDimension,\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n    },\n  };\n}\n\n/**\n * Transforms solver output into a VTP (VTK PolyData XML) string\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<string>} VTP XML string\n */\nexport async function transformSolverOutputToVTP(model, result, meshData = null, options = {}) {\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, options);\n  return buildVTPString(vtkData);\n}\n\n/**\n * Transforms solver output into typed array buffers suitable for ML pipelines\n * @param {object} result - Object containing solution vector and node coordinates\n * @returns {object} Object with features (Float32Array), featuresShape, labels, and points\n */\nexport function transformSolverOutputToMLBuffers(result) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const scalars = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const features = new Float32Array(nodesXCoordinates.length * 3);\n\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    features[base] = Number(nodesXCoordinates[i]) || 0;\n    features[base + 1] = Number(nodesYCoordinates[i]) || 0;\n    features[base + 2] = scalars[i];\n  }\n\n  return {\n    features,\n    featuresShape: [nodesXCoordinates.length, 3],\n    labels: scalars,\n    points: buildPointsArray(nodesXCoordinates, nodesYCoordinates),\n  };\n}\n\n// VTK rendering\n\nasync function renderVtkScene(vtkData, plotDivId, solverConfig, plotType, renderOptions = {}) {\n  if (typeof document === \"undefined\") {\n    errorLog(\"vtk.js visualization requires a browser environment\");\n    return;\n  }\n  const {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkScalarBarActor,\n  } = await loadVtkModules();\n\n  const container = document.getElementById(plotDivId);\n  if (!container) {\n    errorLog(`Could not find plot container with id: ${plotDivId}`);\n    return;\n  }\n\n  if (rendererCache.has(plotDivId)) {\n    rendererCache.get(plotDivId).delete();\n    rendererCache.delete(plotDivId);\n  }\n\n  container.innerHTML = \"\";\n  container.style.position = \"relative\";\n  container.style.width = container.style.width || \"100%\";\n  container.style.height = container.style.height || \"420px\";\n\n  const genericRenderWindow = vtkGenericRenderWindow.newInstance({ background: [1, 1, 1] });\n  genericRenderWindow.setContainer(container);\n  genericRenderWindow.resize();\n\n  const renderer = genericRenderWindow.getRenderer();\n  const renderWindow = genericRenderWindow.getRenderWindow();\n\n  const mapper = vtkMapper.newInstance();\n  mapper.setInputData(vtkData.polyData);\n  mapper.setScalarModeToUsePointData();\n  mapper.setColorModeToMapScalars();\n  mapper.setScalarVisibility(true);\n\n  const scalarRange = getScalarRange(vtkData.scalars);\n  mapper.setScalarRange(scalarRange[0], scalarRange[1]);\n\n  const colorScale = renderOptions.colorScale ?? createColorScale({});\n  const lookupTable = vtkColorTransferFunction.newInstance();\n  const preset =\n    vtkColorMaps.getPresetByName(colorScale.presetName) ?? vtkColorMaps.getPresetByName(\"Cool to Warm\");\n  const mappedPreset = reverseColorMapPreset(preset, colorScale.reverse);\n  lookupTable.applyColorMap(mappedPreset);\n  lookupTable.setMappingRange(scalarRange[0], scalarRange[1]);\n  lookupTable.updateRange();\n  mapper.setLookupTable(lookupTable);\n\n  const actor = vtkActor.newInstance();\n  actor.setMapper(mapper);\n  if (vtkData.mode === \"line\") actor.getProperty().setLineWidth(3);\n  renderer.addActor(actor);\n\n  if (colorScale.showScalarBar) {\n    const scalarBarActor = vtkScalarBarActor.newInstance({\n      drawNanAnnotation: false,\n      generateTicks: (helper) => {\n        const bounds = helper.getLastTickBounds();\n        if (!bounds || bounds.length < 2) return;\n        const [minVal, maxVal] = bounds;\n        const count = 5;\n        const step = (maxVal - minVal) / (count - 1);\n        const ticks = Array.from({ length: count }, (_, i) => minVal + i * step);\n        helper.setTicks(ticks);\n        helper.setTickStrings(\n          ticks.map((v) => {\n            const abs = Math.abs(v);\n            if (abs === 0) return \"0\";\n            if (abs >= 0.01 && abs < 10000) return parseFloat(v.toPrecision(4)).toString();\n            return v.toExponential(2);\n          }),\n        );\n      },\n    });\n    scalarBarActor.setTickTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisLabel(colorScale.scalarBarTitle);\n    scalarBarActor.setScalarsToColors(lookupTable);\n    renderer.addActor2D(scalarBarActor);\n  }\n\n  const contourLines = createContourLineOptions(renderOptions.contourLines ?? { enabled: false });\n  if (contourLines.enabled && vtkData.mode !== \"line\") {\n    await addContourLinesToRenderer(renderer, vtkData, scalarRange, contourLines);\n  }\n\n  renderer.resetCamera();\n  renderWindow.render();\n  rendererCache.set(plotDivId, genericRenderWindow);\n  container.title = `${plotType} plot - ${solverConfig}`;\n}\n\nasync function addContourLinesToRenderer(renderer, vtkData, scalarRange, contourOptions) {\n  const gridMeta = vtkData.metadata?.interpolationGrid;\n  if (!gridMeta) {\n    return;\n  }\n  const { vtkActor, vtkDataArray, vtkImageData, vtkImageMarchingSquares, vtkMapper } = await loadVtkModules();\n\n  const imageData = vtkImageData.newInstance();\n  imageData.setDimensions(gridMeta.nx, gridMeta.ny, 1);\n  imageData.setOrigin(gridMeta.origin[0], gridMeta.origin[1], 0);\n  imageData.setSpacing(gridMeta.spacing[0], gridMeta.spacing[1], 1);\n\n  const imageScalars = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: gridMeta.imageScalars,\n  });\n  imageData.getPointData().setScalars(imageScalars);\n\n  const contourFilter = vtkImageMarchingSquares.newInstance({\n    slicingMode: 2,\n    slice: 0,\n    mergePoints: true,\n  });\n  contourFilter.setInputData(imageData);\n\n  const n = Math.max(2, contourOptions.numberOfContours);\n  const minValue = scalarRange[0];\n  const maxValue = scalarRange[1];\n  const step = (maxValue - minValue) / (n - 1);\n  const contourValues = [];\n  for (let i = 0; i < n; i++) {\n    contourValues.push(minValue + i * step);\n  }\n  contourFilter.setContourValues(contourValues);\n  contourFilter.update();\n\n  const contourMapper = vtkMapper.newInstance();\n  contourMapper.setInputData(contourFilter.getOutputData());\n  contourMapper.setScalarVisibility(false);\n\n  const contourActor = vtkActor.newInstance();\n  contourActor.setMapper(contourMapper);\n  contourActor.getProperty().setColor(...contourOptions.color);\n  contourActor.getProperty().setLineWidth(contourOptions.lineWidth);\n  renderer.addActor(contourActor);\n}\n\n// Color map helpers\n\nfunction reverseColorMapPreset(preset, reverse) {\n  if (!reverse || !preset?.RGBPoints?.length) return preset;\n  const rgb = preset.RGBPoints;\n  const minX = rgb[0];\n  const maxX = rgb[rgb.length - 4];\n  const reversed = [];\n  for (let i = rgb.length - 4; i >= 0; i -= 4) {\n    reversed.push(maxX - (rgb[i] - minX), rgb[i + 1], rgb[i + 2], rgb[i + 3]);\n  }\n  return { ...preset, RGBPoints: reversed };\n}\n\n// Data building helpers\n\nasync function buildPolyData(points, scalars, cells, mode = \"surface\") {\n  const { vtkPolyData, vtkDataArray } = await loadVtkModules();\n  const polyData = vtkPolyData.newInstance();\n  polyData.getPoints().setData(points, 3);\n  if (cells.length > 0) {\n    if (mode === \"line\") polyData.getLines().setData(cells);\n    else polyData.getPolys().setData(cells);\n  }\n  const scalarData = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: scalars,\n  });\n  polyData.getPointData().setScalars(scalarData);\n  return polyData;\n}\n\nfunction buildPointsArray(nodesXCoordinates, nodesYCoordinates) {\n  const points = new Float32Array(nodesXCoordinates.length * 3);\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    points[base] = Number(nodesXCoordinates[i]) || 0;\n    points[base + 1] = Number(nodesYCoordinates?.[i]) || 0;\n    points[base + 2] = 0;\n  }\n  return points;\n}\n\nfunction extractScalarSolution(solutionVector, expectedLength) {\n  const scalars = new Float32Array(expectedLength);\n  for (let i = 0; i < expectedLength; i++) {\n    const value = solutionVector?.[i];\n    scalars[i] = Number(Array.isArray(value) ? value[0] : value) || 0;\n  }\n  return scalars;\n}\n\nfunction buildLineCellsFromPoints(totalPoints) {\n  if (totalPoints < 2) return new Uint32Array(0);\n  const packed = new Uint32Array((totalPoints - 1) * 3);\n  let offset = 0;\n  for (let i = 0; i < totalPoints - 1; i++) {\n    packed[offset++] = 2;\n    packed[offset++] = i;\n    packed[offset++] = i + 1;\n  }\n  return packed;\n}\n\nfunction buildCellArrayFromNop(nop) {\n  const packed = [];\n  for (let i = 0; i < nop.length; i++) {\n    const cell = convertElementNodesToLinearCell(nop[i]);\n    packed.push(cell.length, ...cell);\n  }\n  return Uint32Array.from(packed);\n}\n\nfunction convertElementNodesToLinearCell(elementNodes) {\n  const indices = elementNodes.map((node) => node - 1);\n  const n = indices.length;\n\n  if (n === 2 || n === 3) {\n    return indices;\n  }\n\n  if (n === 4) {\n    // FEAScript quad numbering:\n    //   1 --- 3\n    //   |     |\n    //   0 --- 2\n    // Perimeter order for VTK polygon: 0 -> 2 -> 3 -> 1\n    return [indices[0], indices[2], indices[3], indices[1]];\n  }\n\n  if (n === 6) {\n    return [indices[0], indices[2], indices[5]];\n  }\n\n  if (n === 8) {\n    // Perimeter corners for FEAScript serendipity quad:\n    //   2 --- 6\n    //   |     |\n    //   0 --- 4\n    return [indices[0], indices[4], indices[6], indices[2]];\n  }\n\n  if (n === 9) {\n    // FEAScript 9-node quad numbering:\n    //   2 -- 5 -- 8\n    //   |         |\n    //   1 -- 4 -- 7\n    //   |         |\n    //   0 -- 3 -- 6\n    // Corner perimeter order for VTK polygon: 0 -> 6 -> 8 -> 2\n    return [indices[0], indices[6], indices[8], indices[2]];\n  }\n\n  // Generic fallback for polygonal/high-order cells.\n  return indices.slice(0, Math.min(4, indices.length));\n}\n\nfunction getScalarRange(scalars) {\n  if (!scalars?.length) return [0, 1];\n  let minValue = Number.POSITIVE_INFINITY;\n  let maxValue = Number.NEGATIVE_INFINITY;\n  for (let i = 0; i < scalars.length; i++) {\n    const value = scalars[i];\n    if (!Number.isFinite(value)) continue;\n    if (value < minValue) minValue = value;\n    if (value > maxValue) maxValue = value;\n  }\n  if (!Number.isFinite(minValue) || !Number.isFinite(maxValue)) return [0, 1];\n  if (minValue === maxValue) return [minValue - 1, maxValue + 1];\n  return [minValue, maxValue];\n}\n\nfunction countPackedCells(packedCells) {\n  let count = 0,\n    offset = 0;\n  while (offset < packedCells.length) {\n    offset += packedCells[offset] + 1;\n    count++;\n  }\n  return count;\n}\n\n// VTP export\n\nfunction packedCellsToConnectivityAndOffsets(packedCells) {\n  const connectivity = [],\n    offsets = [];\n  let offset = 0,\n    running = 0;\n  while (offset < packedCells.length) {\n    const npts = packedCells[offset++];\n    for (let i = 0; i < npts; i++) connectivity.push(packedCells[offset++]);\n    running += npts;\n    offsets.push(running);\n  }\n  return { connectivity, offsets };\n}\n\nfunction buildVTPString(vtkData) {\n  const { connectivity, offsets } = packedCellsToConnectivityAndOffsets(vtkData.cells);\n  const numberOfPoints = vtkData.points.length / 3;\n  const isLine = vtkData.mode === \"line\";\n  const topologyTag = isLine ? \"Lines\" : \"Polys\";\n  return [\n    '<?xml version=\"1.0\"?>',\n    '<VTKFile type=\"PolyData\" version=\"0.1\" byte_order=\"LittleEndian\">',\n    \"  <PolyData>\",\n    `    <Piece NumberOfPoints=\"${numberOfPoints}\" NumberOfVerts=\"0\" NumberOfLines=\"${isLine ? offsets.length : 0}\" NumberOfStrips=\"0\" NumberOfPolys=\"${isLine ? 0 : offsets.length}\">`,\n    '      <PointData Scalars=\"solution\">',\n    `        <DataArray type=\"Float32\" Name=\"solution\" NumberOfComponents=\"1\" format=\"ascii\">${Array.from(vtkData.scalars).join(\" \")}</DataArray>`,\n    \"      </PointData>\",\n    \"      <Points>\",\n    `        <DataArray type=\"Float32\" NumberOfComponents=\"3\" format=\"ascii\">${Array.from(vtkData.points).join(\" \")}</DataArray>`,\n    \"      </Points>\",\n    `      <${topologyTag}>`,\n    `        <DataArray type=\"Int32\" Name=\"connectivity\" format=\"ascii\">${connectivity.join(\" \")}</DataArray>`,\n    `        <DataArray type=\"Int32\" Name=\"offsets\" format=\"ascii\">${offsets.join(\" \")}</DataArray>`,\n    `      </${topologyTag}>`,\n    \"    </Piece>\",\n    \"  </PolyData>\",\n    \"</VTKFile>\",\n  ].join(\"\\n\");\n}\n\n// Interpolation helpers\n\nasync function buildInterpolatedGridValues(model, result, meshData) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  let minX = nodesXCoordinates[0];\n  let maxX = nodesXCoordinates[0];\n  let minY = nodesYCoordinates[0];\n  let maxY = nodesYCoordinates[0];\n  for (let i = 1; i < nodesXCoordinates.length; i++) {\n    const x = nodesXCoordinates[i];\n    const y = nodesYCoordinates[i];\n    if (x < minX) minX = x;\n    if (x > maxX) maxX = x;\n    if (y < minY) minY = y;\n    if (y > maxY) maxY = y;\n  }\n\n  const lengthX = maxX - minX;\n  const lengthY = maxY - minY;\n  const visPointsPerUnit = 50;\n\n  const visNodesX = Math.max(2, Math.round(lengthX * visPointsPerUnit));\n  const visNodesY = Math.max(2, Math.round(lengthY * visPointsPerUnit));\n\n  const deltaX = lengthX / (visNodesX - 1);\n  const deltaY = lengthY / (visNodesY - 1);\n\n  const totalVisNodes = visNodesX * visNodesY;\n  const visNodeXCoordinates = new Float32Array(totalVisNodes);\n  const visNodeYCoordinates = new Float32Array(totalVisNodes);\n  const visSolution = new Float32Array(totalVisNodes);\n  visSolution.fill(Number.NaN);\n  const insideMask = new Uint8Array(totalVisNodes);\n\n  const boundarySegments = getBoundarySegments(meshData);\n  const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n\n  let lastParentElement = 0;\n  for (let ix = 0; ix < visNodesX; ix++) {\n    for (let iy = 0; iy < visNodesY; iy++) {\n      const visNodeIndex = ix * visNodesY + iy;\n      const x = minX + ix * deltaX;\n      const y = minY + iy * deltaY;\n\n      visNodeXCoordinates[visNodeIndex] = x;\n      visNodeYCoordinates[visNodeIndex] = y;\n\n      if (!pointInsidePolygon(x, y, boundarySegments)) {\n        continue;\n      }\n\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        const globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (let ni = 0; ni < neighborCount[globalNodeIndex]; ni++) {\n          const currentElement = nodeNeighbors[globalNodeIndex][ni];\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  return {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    lengthX,\n    lengthY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  };\n}\n\nasync function buildInterpolatedVtkData(model, result, meshData) {\n  const grid = await buildInterpolatedGridValues(model, result, meshData);\n  const {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  } = grid;\n\n  const points = buildPointsArray(visNodeXCoordinates, visNodeYCoordinates);\n  const cells = buildStructuredGridCells(visNodesX, visNodesY, insideMask);\n  const polyData = await buildPolyData(points, visSolution, cells, \"surface\");\n\n  return {\n    points,\n    scalars: visSolution,\n    cells,\n    polyData,\n    mode: \"surface\",\n    metadata: {\n      meshDimension: \"2D\",\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n      interpolationGrid: {\n        nx: visNodesX,\n        ny: visNodesY,\n        origin: [minX, minY],\n        spacing: [deltaX, deltaY],\n        imageScalars: reorderStructuredScalarsForImage(visSolution, visNodesX, visNodesY),\n      },\n    },\n  };\n}\n\nfunction reorderStructuredScalarsForImage(values, nx, ny) {\n  // FEAScript interpolation uses index = ix * ny + iy (y-fast).\n  // vtkImageData expects index = ix + iy * nx (x-fast).\n  const reordered = new Float32Array(nx * ny);\n  for (let iy = 0; iy < ny; iy++) {\n    for (let ix = 0; ix < nx; ix++) {\n      reordered[ix + iy * nx] = values[ix * ny + iy];\n    }\n  }\n  return reordered;\n}\n\nfunction buildStructuredGridCells(nx, ny, insideMask) {\n  const packed = [];\n\n  for (let ix = 0; ix < nx - 1; ix++) {\n    for (let iy = 0; iy < ny - 1; iy++) {\n      const n0 = ix * ny + iy;\n      const n1 = (ix + 1) * ny + iy;\n      const n2 = (ix + 1) * ny + (iy + 1);\n      const n3 = ix * ny + (iy + 1);\n\n      if (!insideMask[n0] || !insideMask[n1] || !insideMask[n2] || !insideMask[n3]) {\n        continue;\n      }\n\n      packed.push(4, n0, n1, n2, n3);\n    }\n  }\n\n  return Uint32Array.from(packed);\n}\n\n// Point search & solution interpolation\n\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  }\n\n  return { inside: false, value: null };\n}\n\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  const zData = Array.isArray(solutionVector[0]) ? solutionVector.map((value) => value[0]) : solutionVector;\n\n  let interpolatedValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    interpolatedValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return interpolatedValue;\n}\n\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\",\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the model configuration\n   * @param {string} modelConfig - Parameter specifying the type of model\n   * @param {object} [options] - Optional additional configuration\n   */\n  setModelConfig(modelConfig, options = {}) {\n    this.solverConfig = modelConfig;\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${modelConfig}`);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as\n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions,\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\",\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions,\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          },\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex],\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotlyPlotScript.js\";\nexport {\n  plotSolutionVtk,\n  plotInterpolatedSolutionVtk,\n  createColorScale,\n  createContourLineOptions,\n  transformSolverOutputToVtkData,\n  transformSolverOutputToVTP,\n  transformSolverOutputToMLBuffers,\n} from \"./visualization/vtkPlotScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.3.0 (RC)\";\n"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","debugLog","message","console","log","basicLog","errorLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","document","require","__filename","href","currentScript","tagName","toUpperCase","src","baseURI","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","computeNodeNeighbors","nodeNeighbors","from","neighborCount","elemIndex","getBoundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","globalNodeIndex","k","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","pointSearch","model","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","zData","solutionInterpolationValue","pointInsidePolygon","segments","x1","y1","x2","y2","_vtkModules","loadVtkModules","_interopNamespace","default","vtkActor","vtkColorTransferFunction","vtkColorMaps","vtkDataArray","vtkImageData","vtkImageMarchingSquares","vtkGenericRenderWindow","vtkMapper","vtkPolyData","vtkScalarBarActor","all","rendererCache","createColorScale","presetName","reverse","showScalarBar","scalarBarTitle","createContourLineOptions","enabled","numberOfContours","color","lineWidth","transformSolverOutputToVtkData","preparedMesh","solutionArray","extractScalarSolution","points","buildPointsArray","mode","cells","totalPoints","Uint32Array","packed","offset","buildLineCellsFromPoints","cell","convertElementNodesToLinearCell","buildCellArrayFromNop","scalars","polyData","buildPolyData","metadata","solverConfig","numberOfPoints","numberOfCells","countPackedCells","renderVtkScene","vtkData","plotDivId","plotType","renderOptions","container","getElementById","has","innerHTML","style","position","width","height","genericRenderWindow","newInstance","background","setContainer","resize","renderer","getRenderer","renderWindow","getRenderWindow","mapper","setInputData","setScalarModeToUsePointData","setColorModeToMapScalars","setScalarVisibility","scalarRange","minValue","POSITIVE_INFINITY","maxValue","NEGATIVE_INFINITY","isFinite","getScalarRange","setScalarRange","colorScale","lookupTable","mappedPreset","preset","RGBPoints","rgb","minX","reversed","reverseColorMapPreset","getPresetByName","applyColorMap","setMappingRange","updateRange","setLookupTable","actor","setMapper","getProperty","setLineWidth","addActor","scalarBarActor","drawNanAnnotation","generateTicks","helper","bounds","getLastTickBounds","minVal","maxVal","step","ticks","setTicks","setTickStrings","parseFloat","toPrecision","setTickTextStyle","fontColor","setAxisTextStyle","setAxisLabel","setScalarsToColors","addActor2D","contourLines","contourOptions","gridMeta","interpolationGrid","imageData","setDimensions","nx","ny","setOrigin","setSpacing","spacing","imageScalars","numberOfComponents","values","getPointData","setScalars","contourFilter","slicingMode","mergePoints","contourValues","setContourValues","update","contourMapper","getOutputData","contourActor","setColor","addContourLinesToRenderer","resetCamera","render","title","getPoints","setData","getLines","getPolys","scalarData","Float32Array","base","expectedLength","elementNodes","indices","node","min","packedCells","count","reorderStructuredScalarsForImage","reordered","iy","ix","interpolatedValue","coefficientFunctions","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseInt","replace","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","level","visNodeXCoordinates","visNodeYCoordinates","lengthX","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","lastParentElement","visNodeIndex","found","neighborElementsIndex","searchResult","maxWindowWidth","window","innerWidth","aspectRatio","plotWidth","plotHeight","layout","xaxis","yaxis","scaleanchor","scaleratio","margin","hovermode","contourData","z","connectgaps","hoverongaps","smoothing","contours","coloring","showlabels","colorbar","Plotly","newPlot","responsive","interpolatedVtkData","grid","minY","visPointsPerUnit","totalVisNodes","NaN","insideMask","Uint8Array","ni","buildInterpolatedGridValues","n0","n1","n2","n3","buildStructuredGridCells","buildInterpolatedVtkData","yData","lineData","features","featuresShape","labels","connectivity","offsets","running","npts","packedCellsToConnectivityAndOffsets","isLine","topologyTag","buildVTPString"],"mappings":"+RAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,wDCXA,IAAIK,EAAkB,QAuBf,SAASC,EAASC,GACC,UAApBF,GACFG,QAAQC,IAAI,aAAeF,EAAS,qCAExC,CAMO,SAASG,EAASH,GACvBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC,CAMO,SAASI,EAASJ,GACvBC,QAAQC,IAAI,aAAeF,EAAS,qCACtC;;;;;;AChDA,MAAMK,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACH1B,QAAS0B,EAAM1B,QACf8B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAM1B,SAAU2B,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADAxC,QAAQ6C,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKtD,OACL,MAAO,CAAE0E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKtD,OAAS,GAChC,GAAIkH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAMvD,KAAKgI,MAAMhI,KAAKiI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAExF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHAvI,EAAS,wBAAwB+H,QACjCjI,QAAQ0I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC3BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE3J,OACZ,IAAI+J,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAIlK,EAAI,EAAGA,EAAI+J,EAAG/J,IAAK,CAC1B,IAAImK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBpK,IAAMoK,IACRD,GAAOP,EAAE5J,GAAGoK,GAAKJ,EAAEI,IAGvBH,EAAKjK,IAAM6J,EAAE7J,GAAKmK,GAAOP,EAAE5J,GAAGA,EAC/B,CAGD,IAAIqK,EAAU,EACd,IAAK,IAAIrK,EAAI,EAAGA,EAAI+J,EAAG/J,IACrBqK,EAAUnK,KAAKoK,IAAID,EAASnK,KAAKqK,IAAIN,EAAKjK,GAAKgK,EAAEhK,KAMnD,GAFAgK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDR+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAezI,QAAQgI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrB1I,EAAS,8BAA8BsJ,EAAmBX,yBAE1DtI,EAAS,wCAAwCiJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACItI,EAAS,0BAA0B8H,KAMrC,OAHAjI,QAAQkK,QAAQ,iBAChBhK,EAAS,8BAEF,CAAEqI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAEnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDlI,EAAS,wBAAwB+H,QACjCjI,QAAQ0I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAkBA,GAAgBoC,aAAepC,EACrFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAkBA,GAAgBmC,aAAenC,EAE3F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAxCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,mCAAoC,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAAH,SAAAI,eAAA,WAAAJ,SAAAI,cAAAC,QAAAC,eAAAN,SAAAI,cAAAG,KAAA,IAAAR,IAAA,mBAAAC,SAAAQ,SAAAL,MAAkB,CACtFhI,KAAM,WAEFyH,EAAgBa,EAAaZ,GAEnC,aADMD,EAAcc,aACb,CAAEd,gBAAeC,SAC1B,CAiCoBc,GAChBf,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE5J,QAAQgI,KAAK,GACpC,IAAI8D,EAEJA,QAAehB,EAAciB,mBAAmBpC,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiBiD,EAAOjD,eACxBC,EAAYgD,EAAOhD,UACnBC,EAAa+C,EAAO/C,WAGhBD,EACF1I,EAAS,8BAA8B2I,gBAEvCtI,EAAS,wCAAwCsI,eAEvD,MACItI,EAAS,0BAA0B8H,KAWrC,OARAjI,QAAQkK,QAAQ,iBAChBhK,EAAS,+BAA+B+H,MAEpCsC,UACIC,GAAekB,YAAYvH,OAAM,UACvCoG,EAAQE,OAAOkB,aAGV,CAAEpD,iBAAgBC,YAAWC,aACtC,CEhIO,MAAMmD,EAMX,WAAA9G,EAAY+G,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADA/L,EAAS,8CAIX,GAA0B,WAAtB4L,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAA/H,EAAYgI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACPhN,EAAS,mEACT6L,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnBlN,EAAS,sDAKPiH,MAAMiD,QAAQ0B,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBjG,MAAMiD,QAAQ0B,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExDzN,EACE,yDACE0N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAa5N,OAAQkO,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAI1G,MAAMyG,EAAUnO,QAGlB,IAArBmO,EAAUnO,QAOZoO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAUnO,SASnBoO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtCvN,EAAS,4FASX,GANAL,EACE,gEACE0N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACE7G,MAAMiD,QAAQ0B,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBvO,OAAS,QACFsE,IAAxC+H,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAIzO,EAAI,EAAGA,EAAIsM,KAAKmB,WAAWe,iBAAiBvO,OAAQD,IACvDsM,KAAKmB,WAAWe,iBAAiBxO,IACnCyO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBxO,IAGhEsM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAAS5K,IAEvC,GAAuB,IAAnBA,EAAK6K,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkB3K,EAAK8K,MAAQ,GAErEH,EAAkBzO,OAAS,IAExBqM,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,OACzCvC,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExBzO,EACE,mCAAmC0O,MAAUC,mBAAuBjL,EAAK8K,QACvE9K,EAAK3B,MAAQ,cAKjB,IAAI6M,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAe3N,OAC9CkO,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoBjP,QAEtB,GAAIiP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C3O,EACE,mBAAmB8N,gDAA2De,EAAoB5G,KAChG,UAGJjI,EACE,UAAU0O,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,uCAAuC+O,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,qCAAqC+O,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,oCAAoC+O,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACP/O,EAAS,sCAAsC+O,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAKP,KAAK,CAACH,EAAciB,IAC/D/O,EACE,8BAA8B8N,MAAiBiB,sBAAyBrL,EAAK8K,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoBjP,QAGzBiP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C3O,EACE,mBAAmB8N,gDAA2De,EAAoB5G,KAChG,UAGJjI,EACE,UAAU0O,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,uCAAuC+O,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,qCAAqC+O,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACP/O,EAAS,oCAAoC+O,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACP/O,EAAS,sCAAsC+O,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBzK,EAAK8K,KAAKP,KAAK,CAACH,EAAciB,IAC/D/O,EACE,8BAA8B8N,MAAiBiB,sBAAyBrL,EAAK8K,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACHvO,EACE,oDAAoDqO,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBvO,OAAS,QACFsE,IAAxC+H,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAIzO,EAAI,EAAGA,EAAIsM,KAAKmB,WAAWe,iBAAiBvO,OAAQD,IACvDsM,KAAKmB,WAAWe,iBAAiBxO,IACnCyO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBxO,IAGhEsM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAA/H,EAAYgI,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrC5M,EAAS,wFAEZ,CAED,YAAAgP,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHA3P,EAAS,iCAAmC0N,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDhN,EAAS,yCAA2C0N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAA/H,EAAYgI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExF9M,EACE,6GAGL,CAED,YAAAgP,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAW3Q,KAAK4Q,GAAK,IACrBC,EAAU7Q,KAAK8Q,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAW/Q,KAAK8Q,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQlR,KAAKqK,IAAIwG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAASnR,KAAKqK,IAAI0G,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJA3P,EAAS,iCAAmC0N,KAAKC,UAAU2B,IAC3DtP,EAAS,iCAAmC0N,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFA9N,EAAS,yCAA2C0N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAxM,EAAY+G,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAI7R,KAAKC,KAAK,KAAU,EAC1C4R,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAI7R,KAAKC,KAAK,KAAU,EAC1C6R,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGF5P,EAAS,8CAIX,MAAM0R,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAIhQ,OACpBqS,EAAa3C,EAAkB1P,OAC/BI,EAAS,0BAA0BgS,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnEnQ,EAAS,2CAA2CgS,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAI9J,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAIqH,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3DpH,EAAeoH,GAAa,EAC5BrH,EAAe6F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5ChK,EAAeqH,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACLpJ,iBACAD,iBACAmK,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAGhQ,OAWjC,CAOO,SAAS6S,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoB3J,EAAGmH,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAO/J,EAAI+J,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAO7J,EAAI+J,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyBlK,EAAGmH,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoB3J,EAAGmH,EAAGgD,GACrDK,EAA4Bb,EAAoB3J,EAAGmH,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnBzU,KAAKqK,KAAKoK,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAK1K,IAAM2K,EAAG,GAAKD,EAAG,KACnExU,KAAKC,MAAMwU,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CA0BO,SAASsI,EAAqBvC,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkB1P,OAC/B4S,EAAkB5C,EAAI,GAAGhQ,OAGzB+U,EAAgBrN,MAAMsN,KAAK,CAAEhV,OAAQqS,IAAc,IAAM,KACzD4C,EAAgBvN,MAAM2K,GAAYrK,KAAK,GAG7C,IAAK,IAAIkN,EAAY,EAAGA,EAAYlF,EAAIhQ,OAAQkV,IAC9C,IAAK,IAAIjC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAIkF,GAAWjC,GAAkB,EAGnDgC,EAAcpF,GAAaoF,EAAcpF,GAAa,EAGtDkF,EAAclF,GAAWxB,KAAK6G,EAC/B,CAGH,MAAO,CAAEH,gBAAeE,gBAC1B,CAOO,SAASE,EAAoB5C,GAClC,IAGI6C,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAM7F,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJTgJ,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBjJ,IACY,WAAjBC,EACFgJ,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjBhJ,IACTgJ,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBjH,EAAiBvO,OAAQwV,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4BlH,EAAiBiH,GAAexV,OAC5DyV,IACA,CACAJ,EAAqBE,GACnBhH,EAAiBiH,GAAeC,GAClCF,IAEA,MAAOrH,EAAciB,GAAQZ,EAAiBiH,GAAeC,GAC7D,IAAIC,EAA2BN,EAAcjG,GACzCwG,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyB1V,OAClD6V,IACA,CACA,MAAMC,EAAkB9F,EAAI9B,GAAcwH,EAAyBG,IAA2B,EAE9FF,EAAqBtH,KAAKqB,EAAkBoG,IAC5CF,EAAqBvH,KAAKiC,EAAkBwF,GAC7C,CAGD,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAAqB3V,OAAS,EAAG+V,IACnDT,EAAsBjH,KAAK,CACzB,CAACsH,EAAqBI,GAAIH,EAAqBG,IAC/C,CAACJ,EAAqBI,EAAI,GAAIH,EAAqBG,EAAI,KAG5D,CAEH,OAAOT,CACT,CClaO,MAAMU,EASX,WAAA5Q,CAAY6Q,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA8J,CAAqCzN,EAAgBD,GACxB,OAAvB6D,KAAKF,cACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDhW,EACE,YAAYgW,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACd9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDhW,EACE,YAAYgW,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAQ,CAA0CC,EAAoBC,GACjC,OAAvBnK,KAAKF,cACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDhW,EACE,YAAYgW,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,KAE6B,OAAvBhK,KAAKF,eACd9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDhW,EACE,YAAYgW,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,4CAA4C0V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAI,CACEhO,EACAD,EACAsJ,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxBtU,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBxK,KAAKF,cACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClChW,EACE,YAAYgW,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAM2G,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,qDAAqD0V,EAAkB,cACrE5H,EAAe,iBACD2B,EAAY,MAE9BpH,EAAeqN,KAAqBgB,EAAkBC,EACtDvO,EAAesN,GAAiBA,IAAoBgB,CAAe,GAEtE,KAE6B,OAAvBzK,KAAKF,eACd9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClChW,EACE,YAAYgW,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAclO,OAC/C,IAAK,IAAI6P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMlP,KAAKC,KAAK8S,GAAa,EAAIO,GAAa,GAExCtT,KAAKC,KAAKoT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D7S,EACE,qDAAqD0V,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInCxK,EAAeqN,KACZ/D,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjE/O,EAAesN,GAAiB0B,KAC7BzF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aACd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAclO,OAC/C,IAAK,IAAI6P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMlP,KAAKC,KAAK8S,GAAa,EAAIO,GAAa,GAExCtT,KAAKC,KAAKoT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D7S,EACE,qDAAqD0V,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInCxK,EAAeqN,KACZ/D,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjE/O,EAAesN,GAAiB0B,KAC7BzF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACExJ,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxBtU,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMjE,EAAkBvG,KAAK2D,IAAI9B,GAAclO,OACzC2X,EAAsBjQ,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC4P,EAAsBlQ,MAAMkL,GAAiB5K,KAAK,GAGxD,IAAK,MAAMoO,KAAe/J,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK4J,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClChW,EACE,YAAYgW,2DAAqEU,0CAAwDC,OAI3I,MAAMc,EAAkBxL,KAAKkC,iBAAiB6H,GAAa0B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB7J,IAG1D,GAAI2J,EAAiB,CACnB,MAAM1I,EAAO0I,EAAgB,GAE7B,GAA2B,OAAvBxL,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/B/O,EACE,qDAAqDyP,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B+H,EAAoB/H,KAAeiH,EAAkBC,EACrDY,EAAoB9H,GAAWA,IAAciH,CACzD,MAAiB,GAA2B,OAAvBzK,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAG3D,IAiBI2K,EAjBAtE,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAKCyH,EADW,IAATnI,GAAuB,IAATA,EACMlP,KAAKC,KAAK8S,GAAa,EAAIO,GAAa,GAExCtT,KAAKC,KAAKoT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aAEd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAclO,OAC/C,IAAK,IAAI6P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMlP,KAAKC,KAAK8S,GAAa,EAAIO,GAAa,GAExCtT,KAAKC,KAAKoT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0B1F,EAAU0D,GAClDzV,EAAS,mDAGT,MAAMkP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B,MAAMkL,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAG5EC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzC/O,EAAe8P,GAAmBC,KAC/BxG,EAAaoG,GACdjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY9R,OAAQwY,IAAoB,CAExF,MAAMnB,EAA+B5E,EAAenG,kBAClDwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzC/O,EAAe8P,GAAmBC,KAC/BxG,EAAaoG,GACdpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAIzC,EACpCC,EACA1H,EACAyB,EACA7D,EACAC,GAkBF,OAdAqM,EAA0BhC,mCACxBhO,EACAD,EACAsJ,EACAC,EACArC,EACAY,EACAmC,GAIFgG,EAA0BvC,qCAAqCzN,EAAgBD,GAC/EhI,EAAS,iDAEF,CACLgI,iBACAC,iBAEJ,CAcO,SAASiQ,GAA4BxK,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcyF,QAAEA,IAEzF,MAAMpG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DoF,EAAsBjQ,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC4P,EAAsBlQ,MAAMkL,GAAiB5K,KAAK,GAGlD2Q,EAAMjR,MAAMkL,GACZD,EAAmBjL,MAAMkL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkBhT,KAAKqK,IAAI0F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBhT,KAAKqK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IAAoB,CAExF,MAAM1L,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYqG,KAIRjF,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAGnE,MACI,GAAsB,OAAlBpL,EAET,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAY9R,OAAQwY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,IAGxE7F,EAAmBgG,EAAInV,KAAKoV,GAAgBA,EAAc,KAG1D1F,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAAzT,CAAY6Q,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAA0M,CAAkCrQ,EAAgBD,GACrB,OAAvB6D,KAAKF,cACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMrU,EAAQsK,KAAK4J,mBAAmBG,GAAa,GACnDhW,EAAS,YAAYgW,iCAA2CrU,2BAChEsK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmB/T,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmB/T,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACd9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMrU,EAAQsK,KAAK4J,mBAAmBG,GAAa,GACnDhW,EAAS,YAAYgW,iCAA2CrU,2BAChEsK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmB/T,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeqN,GAAmB/T,EAElC,IAAK,IAAIyQ,EAAW,EAAGA,EAAW/J,EAAezI,OAAQwS,IACvDhK,EAAesN,GAAiBtD,GAAY,EAG9ChK,EAAesN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAAiD,CAA2CxC,EAAoBC,GAClC,OAAvBnK,KAAKF,cACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMrU,EAAQsK,KAAK4J,mBAAmBG,GAAa,GACnDhW,EAAS,YAAYgW,iCAA2CrU,2BAChEsK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmB/T,CAAK,GAEvD,MAAmB,GAA0B,cAAtBsK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmB/T,CAAK,GAE1C,IAEJ,KAE6B,OAAvBsK,KAAKF,eACd9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMrU,EAAQsK,KAAK4J,mBAAmBG,GAAa,GACnDhW,EAAS,YAAYgW,iCAA2CrU,2BAChEsK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmB/T,CAAK,GAEvD,MAAmB,GAA0B,cAAtBsK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5DzP,EACE,sCAAsC0V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmB/T,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASiX,EACdzG,EACA0D,EACApN,EACAoQ,GAEAzY,EAAS,iDAGT,IAAI0Y,EAAqB,EAAID,EArBA,IAsB7B7Y,EAAS,uBAAuB8Y,KAChC9Y,EAAS,0BAA0B6Y,KAGnC,MAAMvJ,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B1L,SAAS,6CAGT,IAAI4W,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEtQ,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY9R,OAAQwY,IAAoB,CAExF,IAAInB,EAA+B5E,EAAenG,kBAChDwF,EAAYqG,GACZrG,EAAY0G,IAId,MAAMJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAC5D3L,EAAgB4K,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEtQ,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACEvQ,EAAe8J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC5P,EAAe6P,IACbY,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFxQ,EAAe6P,IACbW,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACdpY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GAGzC/O,EAAe8P,GAAmBC,KAC/BW,EACDnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACFzQ,EAAe8P,GAAmBC,IAChCU,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbvY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbvY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkCrQ,EAAgBD,GAC5EhI,EAAS,+CAEF,CACLgI,iBACAC,iBAEJ,CAgBO,SAAS4Q,GAA8BnL,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcyF,QACdA,EAAOrP,eACPA,EAAcoQ,sBACdA,IAGA,MAAMnH,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI2G,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBjQ,MAAMkL,GAC/B5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACnC4P,EAAsBlQ,MAAMkL,GAAiB5K,KAAK,GAGlD2Q,EAAMjR,MAAMkL,GACZD,EAAmBjL,MAAMkL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkBhT,KAAKqK,IAAI0F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBhT,KAAKqK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B1L,SAAS,6CAGT,IAAI4W,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEtQ,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CAEP,MAAW,GAAsB,OAAlBpL,EACT,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY9R,OAAQwY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,KAGxEtF,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIuG,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEtQ,EAAe8J,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACEvQ,EAAe8J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAEzCT,EAAoBS,IAClBa,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACdpY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbvY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbvY,KAAKC,KAAKiZ,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIjH,EAUG,SAASkH,EAAiBC,EAAerH,EAAU0D,EAAoBvN,EAAU,CAAA,GAEtF,MAAMwP,EAAU5F,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkB1P,OACxC6Z,EAActH,EAASH,eA6H/B,SAAiCQ,EAAiBiH,GAEhDP,EAAY3L,eAAiBjG,MAAMmS,GAChC7R,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACzCsR,EAAY/C,mBAAqB7O,MAAMkL,GAAiB5K,KAAK,GAC7DsR,EAAY9C,eAAiB9O,MAAMkL,GAAiB5K,KAAK,GACzDsR,EAAYQ,qBAAuBpS,MAAMkL,GAAiB5K,KAAK,GAC/DsR,EAAYzQ,eAAiBnB,MAAMkL,GAAiB5K,KAAK,GACzDsR,EAAYS,aAAerS,MAAMmS,GAAa7R,KAAK,GACnDsR,EAAYU,YAActS,MAAMmS,GAAa7R,KAAK,GAGlDuR,EAAaU,UAAY,EACzBV,EAAalH,WAAaO,EAC1B2G,EAAaW,mBAAqB,EAClCX,EAAa3G,gBAAkBlL,MAAMmS,GAAa7R,KAAK,GACvDuR,EAAaY,YAAc,EAG3B,MAAMC,EAAana,KAAKoK,IAAIuI,EAAiB,KAC7C2G,EAAac,qBAAuB3S,MAAM0S,GAAYpS,KAAK,GAC3DuR,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBjQ,MAAMkL,GACrC5K,OACAxE,KAAI,IAAMkE,MAAMkL,GAAiB5K,KAAK,KACzCwR,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B3H,EAAiBiH,GAC1C,MAAMW,EAAqBva,KAAKoK,IAC9BpK,KAAKwa,KAAKxa,KAAKC,KAAK2Z,IAAgBjH,EAClB,EAAlBA,GAEF,OAAO4H,EAAqBX,CAC9B,CAnBoBa,CAAkB9H,EAAiBiH,GACrDH,EAAaiB,YAAcjT,MAAM6S,GAAWvS,KAAK,GACjD0R,EAAakB,cAAgBlT,MAAM0S,GAAYpS,KAAK,GACpD0R,EAAamB,SAAWnT,MAAM0S,GAAYpS,KAAK,GAC/C0R,EAAaoB,UAAYpT,MAAM6S,GAAWvS,KAAK,EACjD,CA7JE+S,CAHwB7C,EAAQtF,gBAGSiH,GAGzCrZ,EAAS,mCACTF,QAAQ0I,KAAK,iBAGbyJ,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYqI,EAAQtF,gBAAiB/C,IAC3DyJ,EAAY3L,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB1P,OAAQ6P,IACrEyJ,EAAY/C,mBAAmB1G,GAAa,EAC5CyJ,EAAY9C,eAAe3G,GAAa,EAI1C,IAAImL,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIhF,EACvCC,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC5C,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI3G,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB1P,OAAQ6P,IACrEyJ,EAAYQ,qBAAqBjK,GAAa,EAGhD0J,EAAalH,WAAaE,EAAS7C,kBAAkB1P,OACrDuZ,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIjM,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEqL,EAAa3G,gBAAgB1E,GAAgBgK,EAAQtF,gBAIvD2G,EAAa0B,sBAAwBvS,EAAQG,eAC7C0Q,EAAaN,sBAAwBvQ,EAAQuQ,sBAuM/C,SAA6B1G,EAAU2F,EAASO,EAA2BmB,GAEzE,MAAMxH,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkB1P,OAC7Coa,EAAana,KAAKoK,IAAIuI,EAAiB2G,EAAac,qBAAqBra,QAC/E,IAaIkb,EAbAC,EAAmBzT,MAAMwQ,EAAQtF,iBAAiB5K,KAAK,GACvDoT,EAAiB1T,MAAMwQ,EAAQtF,iBAAiB5K,KAAK,GACrDqT,EAAa3T,MAAM0S,GAAYpS,KAAK,GACpCsT,EAAkB5T,MAAM0S,GAAYpS,KAAK,GACzCuT,EAAqB7T,MAAM0S,GAAYpS,KAAK,GAC5CwT,EAAe9T,MAAM0S,GAAYpS,KAAK,GACtCyT,EAAc/T,MAAM0S,GAAYpS,KAAK,GACrC0T,EAAchU,MAAM0S,GACrBpS,OACAxE,KAAI,IAAMkE,MAAM0S,GAAYpS,KAAK,KAChC2T,EAAejU,MAAMkL,GAAiB5K,KAAK,GAC3C4T,EAAkBlU,MAAMkL,GAAiB5K,KAAK,GAC9C6T,EAAsBnU,MAAMkL,GAAiB5K,KAAK,GAGlD8T,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI5J,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D8L,EAAa9L,GAAa,EAC1B+L,EAAgB/L,GAAa,EAG/B,GAAwC,IAApC0J,EAAaW,mBAA0B,CAEzC,IAAK,IAAIrK,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3DgM,EAAoBhM,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI+N,EAAsB7J,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBsG,EAAa3G,gBAAgBqJ,GAC9ChJ,IACA,CACA,IAAI6C,EAAkBwD,EAAY3L,eAAesO,GAAqBhJ,GACrB,IAA7C4I,EAAoB/F,EAAkB,KACxC+F,EAAoB/F,EAAkB,GAAK,EAC3CwD,EAAY3L,eAAesO,GAAqBhJ,IAC7CqG,EAAY3L,eAAesO,GAAqBhJ,GAEtD,CACF,CACF,CAEDsG,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAIpc,EAAI,EAAGA,EAAIqa,EAAYra,IAC9B,IAAK,IAAIoK,EAAI,EAAGA,EAAIiQ,EAAYjQ,IAC9BuR,EAAYvR,GAAGpK,GAAK,EAIxB,OAAa,CAEX,IAAIqc,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBrH,IACpCoH,EAAYC,sBACZ2C,EAAYG,EAA4BhK,EAAU2F,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa3G,gBAAgB4J,EAAiB,GAChEF,EAAoB/C,EAAa3G,gBAAgB4J,EAAiB,GAElE,IAAK,IAAIvJ,EAAiB,EAAGA,EAAiBqJ,EAAmBrJ,IAAkB,CACjF,IACIwJ,EAqBAC,EAtBA5G,EAAkBwD,EAAY3L,eAAe6O,EAAiB,GAAGvJ,GAGrE,GAAoB,IAAhBiJ,EACFA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,MACzC,CACL,IAAK2G,EAAc,EAAGA,EAAcP,GAC9Bjc,KAAKqK,IAAIwL,KAAqB7V,KAAKqK,IAAIoP,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,IAE9CqF,EAAiBlI,GAAkBwJ,EAAc,EACjD/C,EAAakB,cAAc6B,GAAe3G,EAE7C,CAGD,GAAiB,IAAbqG,EACFA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,MACtB,CACL,IAAK4G,EAAW,EAAGA,EAAWP,GACxBlc,KAAKqK,IAAIwL,KAAqB7V,KAAKqK,IAAI+Q,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,IAE3BsF,EAAenI,GAAkByJ,EAAW,EAC5CrB,EAAWqB,GAAY5G,EAE1B,CACF,CAED,GAAIqG,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADA3Z,EAAS,sCAIX,IAAK,IAAIkc,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAI5G,EAAkBuF,EAAWqB,GACjC,GAAI5G,EAAkB,EAAG,CACvBwF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoBhd,KAAKqK,IAAIwL,GAC6B,IAA1DwD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5CpH,EAAkB7V,KAAKqK,IAAI+Q,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACbxc,KAAKqK,IAAIoP,EAAakB,cAAc6B,MAClC3G,IAAiB4F,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBrH,EAAe,CACxF,GAA6B,IAAzB0K,EAEF,YADArc,EAAS,oCAIX,IAAI0c,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAInd,KAAKqK,IAAI+S,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5Drd,KAAKqK,IAAIkT,GAAavd,KAAKqK,IAAI+S,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBxd,KAAKqK,IAAI+Q,EAAW8B,EAAgB,IAC9DjC,EAAyBjb,KAAKqK,IAAIoP,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBzd,KAAKqK,IAAI+S,GAEjF,IAAK,IAAIxN,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IACvDA,GAAa4N,GAAqB9B,EAAa9L,KAC/CA,GAAaqL,GAAwBU,EAAgB/L,KAS3D,GANI5P,KAAKqK,IAAI+S,GAAc,OACzB5c,EACE,2DAA2D+Y,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiB3d,KAAKqK,IAAI+Q,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiB3d,KAAKqK,IAAI+Q,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAI5d,EAAI,EAAGA,EAAIoc,EAAUpc,IAC5B2Z,EAAaoB,UAAUiB,EAAiBhc,EAAI,GAAK0b,EAAY1b,GAE/Dgc,GAAkBI,EAElB,IAAK,IAAIpc,EAAI,EAAGA,EAAIoc,EAAUpc,IAC5B2Z,EAAaoB,UAAUiB,EAAiBhc,EAAI,GAAKsb,EAAWtb,GAE9Dgc,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAIhc,EAAI,EAAGA,EAAImc,EAAanc,IAC/B2Z,EAAaiB,YAAYmB,EAAmB,EAAI/b,GAAK2Z,EAAamB,SAAS9a,GAE7E+b,GAAoBI,EAEpB,IAAK,IAAInc,EAAI,EAAGA,EAAImc,EAAanc,IAC/B2Z,EAAaiB,YAAYmB,EAAmB,EAAI/b,GAAK2Z,EAAakB,cAAc7a,GAElF+b,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBrH,EAAe,SAsBrE,GApBA8I,EAAyBjb,KAAKqK,IAAIoP,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBxd,KAAKqK,IAAI+Q,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBzd,KAAKqK,IAAI+S,GAEjF3D,EAAamB,SAAS,GAAK,EACvB5a,KAAKqK,IAAI+S,GAAc,OACzB5c,EACE,2DAA2D+Y,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACf7Z,EAAS,0CAA0C0b,KAGrDgC,GAAwBhC,GACxB,KACD,CACF,CACH,CA/jBEiC,CAAoBxL,EAAU2F,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI/J,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB1P,OAAQ6P,IACrEyJ,EAAYzQ,eAAegH,GAAa0J,EAAac,qBAAqBxK,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB1P,OAAQ6P,IACtC,OAA3B0C,EAASpG,cAEX/L,EACE,GAAGsP,EAAkBG,GAAWmO,cAAc,OAAO1E,EAAYzQ,eAC/DgH,GACAmO,cAAc,MAIlB5d,EACE,GAAGsP,EAAkBG,GAAWmO,cAAc,OAAO1N,EAAkBT,GAAWmO,cAChF,OACI1E,EAAYzQ,eAAegH,GAAWmO,cAAc,MAKhE1d,QAAQkK,QAAQ,iBAChBhK,EAAS,8BAET,MAAQkP,kBAAmBuO,EAAa3N,kBAAmB4N,GAAgB3L,EAC3E,MAAO,CACL1J,eAAgByQ,EAAYzQ,eAAejF,MAAM,EAAGyO,GACpD8L,iBAAkB,CAChBzO,kBAAmBuO,EACnB3N,kBAAmB4N,GAGzB,CAwEA,SAAS3B,EAA4BhK,EAAU2F,EAASO,EAA2BmB,GACjF,MAAM1L,EAAesL,EAAYC,oBAAsB,EAGvD,GAAIvL,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADA3R,EAAS,sCAAsCyN,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMuF,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtE1L,eACA8B,IAAKsJ,EAAY3L,eACjB4E,WACAE,eAAgBA,EAChByF,UAEArP,eAAgB0Q,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8B1W,MAAMwQ,EAAQtF,iBAC7C5K,OACAxE,KAAI,IAAMkE,MAAMwQ,EAAQtF,iBAAiB5K,KAAK,KAC7CqW,EAAyB3W,MAAMwQ,EAAQtF,iBAAiB5K,KAAK,GAGjE,GAAI4R,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMlI,KAAe7D,EAAShE,iBACjC,GACqE,eAAnEkK,EAA0BxC,mBAAmBG,KAAe,IAC5D7D,EAAShE,iBAAiB6H,GAAamI,MACrC,EAAExG,EAAsBC,KAAOD,IAAyB7J,IAE1D,CACAoQ,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMxM,YAAEA,EAAWC,aAAEA,GAAiBmG,EAChCpM,EAAS2M,EAA0Bf,wCACvCxJ,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF2L,EAA8BtS,EAAO6L,oBACrC0G,EAAyBvS,EAAO8L,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQtF,gBAAiB4L,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQtF,gBAAiB6L,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIxL,EAAiB,EAAGA,EAAiBiF,EAAQtF,gBAAiBK,IAAkB,CACvF,MAAM6C,EAAkB6C,EAAI1F,GAAkB,EAC9CqG,EAAYQ,qBAAqBhE,IAC/B8B,EAAoB3E,GAAkBoL,EAAuBpL,EAChE,CAED,OAAO,CACT,CA0YA,SAAS6K,GAAwBhC,GAC/B,IAAK,IAAIjM,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D0J,EAAac,qBAAqBxK,GAAayJ,EAAY9C,eAAe3G,GAG5E,IAAK,IAAI6O,EAAiB,EAAGA,GAAkBnF,EAAalH,WAAYqM,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyBjb,KAAKqK,IAAIoP,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqBpa,KAAKqK,IAAIoP,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACf7Z,EAAS,oDAAoD0b,IACjE,CChtBO,SAAS8C,GAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZjW,GAAY,EACZC,EAAa,EACb6G,EAAS,GACT/G,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAASkW,EAGlD,IAAIzM,EAAayM,EAAQvM,SAAS7C,kBAAkB1P,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIsS,EAAYtS,IAC9B6P,EAAO7P,GAAK,EACZ8I,EAAe9I,GAAK,EAQtB,IAJI+e,EAAQE,iBAAmBF,EAAQE,gBAAgBhf,SAAWqS,IAChExJ,EAAiB,IAAIiW,EAAQE,kBAGxBjW,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAI/I,EAAI,EAAGA,EAAI8I,EAAe7I,OAAQD,IACzC8I,EAAe9I,GAAKoI,OAAOU,EAAe9I,IAAMoI,OAAOyH,EAAO7P,IAIhE,GAA6B,YAAzB+e,EAAQvW,aAA4B,CAOtCqH,EANsB+J,EACpBN,EACAyF,EAAQvM,SACRuM,EAAQ7I,mBACR,CAAEpN,iBAAgBoQ,sBAAuB6F,EAAQ7F,wBAE5BpQ,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmBoW,EACpCC,EAAQvM,SACRuM,EAAQ7I,mBACRpN,EACAiW,EAAQ7F,wBAKVrJ,EAD2BtH,EAAkBwW,EAAQvW,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALAkW,EAAYnf,EAAcgQ,GAG1BpP,EAAS,4BAA4BuI,EAAa,mBAAmBgW,EAAUf,cAAc,MAEzFe,GAAanW,EACfE,GAAY,OACP,GAAIiW,EAAY,IAAK,CAC1Bte,EAAS,uCAAuCse,KAChD,KACD,CAEDhW,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAMwW,GAYX,WAAA7Z,CACE6Q,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAEA/S,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK6S,mBAAqBA,EAC1B7S,KAAK8S,mBAAqBA,EAC1B9S,KAAK+S,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkCrQ,EAAgBD,GAChD,MAAM6W,EAAY5W,EAAezI,OACjC,IAAIsf,GAAgB,EAEpB,GAA2B,OAAvBjT,KAAKF,gBACP9J,OAAO8T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,MAAMmJ,EAASlT,KAAK4J,mBAAmBG,GAAa,GAEpD,GAAe,eAAXmJ,EACFD,GAAgB,EAEhBlf,EAAS,YAAYgW,uDAChB,GAAe,qBAAXmJ,EAA+B,CACxC,MAAMC,EAASnT,KAAK4J,mBAAmBG,GAAa,GAC9CqJ,EAASpT,KAAK4J,mBAAmBG,GAAa,GACpDhW,EACE,YAAYgW,8CAAwDoJ,QAAaC,MAEnFpT,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC1V,EACE,0CAA0C0V,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeiX,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAekX,GAAMlN,GAAY,EAEnChK,EAAekX,GAAMA,GAAQ,EAG7BjX,EAAekX,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAemX,GAAMnN,GAAY,EAEnChK,EAAemX,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBtT,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC1V,EACE,0CAA0C0V,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9BpH,EAAeiX,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAekX,GAAMlN,GAAY,EAEnChK,EAAekX,GAAMA,GAAQ,EAG7BjX,EAAekX,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAemX,GAAMnN,GAAY,EAEnChK,EAAemX,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAIvT,KAAK6S,mBACtB,IAAK,IAAI1M,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAeoX,GAAMpN,GAAY,EAEnChK,EAAeoX,GAAMA,GAAQ,EAC7BnX,EAAemX,GAAQ,EACvBxf,EAAS,sEACV,CAEJ,EC4JH,SAASyf,GACPC,EACAvN,EACAzG,EACA0Q,EACAuD,EACAC,EACAvN,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBxc,OAErD,GAAwB,IAApB4S,EAAuB,CAoBzB,MAAMqN,EAAahM,EAAyB8L,EAAoBC,EAlBjD,CACb,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOme,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMqN,EAAahM,EAAyB8L,EAAoBC,EAlBjD,CACb,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOme,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOjS,MAAO,KACjC,CAaA,SAASme,GAAsBJ,EAAOvN,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAM5J,EAAiBiD,EAAOjD,eACxB+J,EAAkBL,EAASvC,IAAI9B,GAAclO,OAInD,IAGImgB,EAHA1T,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/C0T,EADEzY,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIuX,EAA6B,EACjC,IAAK,IAAInN,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DmN,GACED,EAAM5N,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOmN,CACT,CASA,SAASC,GAAmBtW,EAAGmH,EAAGoP,GAChC,IAAItM,GAAS,EACb,IAAK,IAAIjU,EAAI,EAAGA,EAAIugB,EAAStgB,OAAQD,IAAK,CACxC,OAAQwgB,EAAIC,IAAMC,EAAIC,IAAOJ,EAASvgB,GACpBygB,EAAKtP,GAAMwP,EAAKxP,GAAKnH,GAAM0W,EAAKF,IAAOrP,EAAIsP,IAAQE,EAAKF,GAAMD,IACjEvM,GAAUA,EAC1B,CACD,OAAOA,CACT,CCtbA,IAAI2M,GAAc,KAMlBlW,eAAemW,KACb,GAAID,GAAa,OAAOA,SAClBpc,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,kDAAgD,IAC7D,OACI2V,QAASC,IACTD,QAASE,IACTF,QAASG,IACTH,QAASI,IACTJ,QAASK,IACTL,QAASM,IACTN,QAASO,IACTP,QAASQ,IACTR,QAASS,IACTT,QAASU,UACHjd,QAAQkd,IAAI,CACpBld,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,2CAA0C,IACjD5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,2DAA0D,IACjE5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,qEAAoE,IAC3E5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,4CAA2C,IAClD5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,iDAAgD,IACvD5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,2DAA0D,IACjE5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,yDAAwD,IAC/D5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,4CAA2C,IAClD5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,gDAA+C,IACtD5G,QAAAC,UAAAE,MAAA,WAAA,OAAAmc,EAAA1V,QAAO,oDAAmD,MAc5D,OAZAwV,GAAc,CACZI,WACAC,2BACAC,eACAC,eACAC,eACAC,0BACAC,yBACAC,YACAC,cACAC,qBAEKb,EACT,CAEA,MAAMe,GAAgB,IAAIvgB,IAWnB,SAASwgB,GAAiBjZ,EAAU,IACzC,MAAO,CACLkZ,WAAYlZ,EAAQkZ,YAAc,eAClCC,QAASnZ,EAAQmZ,UAAW,EAC5BC,cAAepZ,EAAQoZ,gBAAiB,EACxCC,eAAgBrZ,EAAQqZ,gBAAkB,WAE9C,CAWO,SAASC,GAAyBtZ,EAAU,IACjD,MAAO,CACLuZ,QAASvZ,EAAQuZ,UAAW,EAC5BC,iBAAkBxZ,EAAQwZ,kBAAoB,GAC9CC,MAAOzZ,EAAQyZ,OAAS,CAAC,IAAM,IAAM,KACrCC,UAAW1Z,EAAQ0Z,WAAa,EAEpC,CA6DO3X,eAAe4X,GAA+BvC,EAAOhU,EAAQyG,EAAW,KAAM7J,EAAU,IAC7F,MAAM4Z,EAAe/P,GAAYP,EAAY8N,EAAM7N,aAC7CvC,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDoE,EAAgBC,GAAsB1W,EAAOjD,eAAgB6G,EAAkB1P,QAC/EyiB,EAASC,GAAiBhT,EAAmBY,GAE7CqS,EAAOja,EAAQia,MAAQ,UACvBC,EACK,SAATD,EAsQJ,SAAkCE,GAChC,GAAIA,EAAc,EAAG,OAAO,IAAIC,YAAY,GAC5C,MAAMC,EAAS,IAAID,YAAgC,GAAnBD,EAAc,IAC9C,IAAIG,EAAS,EACb,IAAK,IAAIjjB,EAAI,EAAGA,EAAI8iB,EAAc,EAAG9iB,IACnCgjB,EAAOC,KAAY,EACnBD,EAAOC,KAAYjjB,EACnBgjB,EAAOC,KAAYjjB,EAAI,EAEzB,OAAOgjB,CACT,CA/QQE,CAAyBvT,EAAkB1P,QAiRnD,SAA+BgQ,GAC7B,MAAM+S,EAAS,GACf,IAAK,IAAIhjB,EAAI,EAAGA,EAAIiQ,EAAIhQ,OAAQD,IAAK,CACnC,MAAMmjB,EAAOC,GAAgCnT,EAAIjQ,IACjDgjB,EAAO1U,KAAK6U,EAAKljB,UAAWkjB,EAC7B,CACD,OAAOJ,YAAY9N,KAAK+N,EAC1B,CAvRQK,CAAsBd,EAAatS,KAAO,IAIhD,MAAO,CACLyS,SACAY,QAASd,EACTK,QACAU,eANqBC,GAAcd,EAAQF,EAAeK,EAAOD,GAOjEA,OACAa,SAAU,CACRC,aAAc3D,EAAM2D,aACpBtX,cAAe2T,EAAM7N,WAAW9F,cAChCuX,eAAgBjB,EAAOziB,OAAS,EAChC2jB,cAAeC,GAAiBhB,IAGtC,CA0CAnY,eAAeoZ,GAAeC,EAASC,EAAWN,EAAcO,EAAUC,EAAgB,IACxF,GAAwB,oBAAb/Y,SAET,YADAzK,EAAS,uDAGX,MAAMsgB,SACJA,EAAQC,yBACRA,EAAwBC,aACxBA,EAAYI,uBACZA,EAAsBC,UACtBA,EAASE,kBACTA,SACQZ,KAEJsD,EAAYhZ,SAASiZ,eAAeJ,GAC1C,IAAKG,EAEH,YADAzjB,EAAS,0CAA0CsjB,KAIjDrC,GAAc0C,IAAIL,KACpBrC,GAAchc,IAAIqe,GAAWpe,SAC7B+b,GAAc/b,OAAOoe,IAGvBG,EAAUG,UAAY,GACtBH,EAAUI,MAAMC,SAAW,WAC3BL,EAAUI,MAAME,MAAQN,EAAUI,MAAME,OAAS,OACjDN,EAAUI,MAAMG,OAASP,EAAUI,MAAMG,QAAU,QAEnD,MAAMC,EAAsBrD,EAAuBsD,YAAY,CAAEC,WAAY,CAAC,EAAG,EAAG,KACpFF,EAAoBG,aAAaX,GACjCQ,EAAoBI,SAEpB,MAAMC,EAAWL,EAAoBM,cAC/BC,EAAeP,EAAoBQ,kBAEnCC,EAAS7D,EAAUqD,cACzBQ,EAAOC,aAAatB,EAAQR,UAC5B6B,EAAOE,8BACPF,EAAOG,2BACPH,EAAOI,qBAAoB,GAE3B,MAAMC,EA+NR,SAAwBnC,GACtB,IAAKA,GAASrjB,OAAQ,MAAO,CAAC,EAAG,GACjC,IAAIylB,EAAWtd,OAAOud,kBAClBC,EAAWxd,OAAOyd,kBACtB,IAAK,IAAI7lB,EAAI,EAAGA,EAAIsjB,EAAQrjB,OAAQD,IAAK,CACvC,MAAMgC,EAAQshB,EAAQtjB,GACjBoI,OAAO0d,SAAS9jB,KACjBA,EAAQ0jB,IAAUA,EAAW1jB,GAC7BA,EAAQ4jB,IAAUA,EAAW5jB,GAClC,CACD,OAAKoG,OAAO0d,SAASJ,IAActd,OAAO0d,SAASF,GAC/CF,IAAaE,EAAiB,CAACF,EAAW,EAAGE,EAAW,GACrD,CAACF,EAAUE,GAFmD,CAAC,EAAG,EAG3E,CA5OsBG,CAAehC,EAAQT,SAC3C8B,EAAOY,eAAeP,EAAY,GAAIA,EAAY,IAElD,MAAMQ,EAAa/B,EAAc+B,YAAcrE,GAAiB,CAAE,GAC5DsE,EAAcjF,EAAyB2D,cAGvCuB,EAoGR,SAA+BC,EAAQtE,GACrC,IAAKA,IAAYsE,GAAQC,WAAWpmB,OAAQ,OAAOmmB,EACnD,MAAME,EAAMF,EAAOC,UACbE,EAAOD,EAAI,GACXhZ,EAAOgZ,EAAIA,EAAIrmB,OAAS,GACxBumB,EAAW,GACjB,IAAK,IAAIxmB,EAAIsmB,EAAIrmB,OAAS,EAAGD,GAAK,EAAGA,GAAK,EACxCwmB,EAASlY,KAAKhB,GAAQgZ,EAAItmB,GAAKumB,GAAOD,EAAItmB,EAAI,GAAIsmB,EAAItmB,EAAI,GAAIsmB,EAAItmB,EAAI,IAExE,MAAO,IAAKomB,EAAQC,UAAWG,EACjC,CA9GuBC,CADnBvF,EAAawF,gBAAgBT,EAAWpE,aAAeX,EAAawF,gBAAgB,gBACnCT,EAAWnE,SAC9DoE,EAAYS,cAAcR,GAC1BD,EAAYU,gBAAgBnB,EAAY,GAAIA,EAAY,IACxDS,EAAYW,cACZzB,EAAO0B,eAAeZ,GAEtB,MAAMa,EAAQ/F,EAAS4D,cAKvB,GAJAmC,EAAMC,UAAU5B,GACK,SAAjBrB,EAAQnB,MAAiBmE,EAAME,cAAcC,aAAa,GAC9DlC,EAASmC,SAASJ,GAEdd,EAAWlE,cAAe,CAC5B,MAAMqF,EAAiB3F,EAAkBmD,YAAY,CACnDyC,mBAAmB,EACnBC,cAAgBC,IACd,MAAMC,EAASD,EAAOE,oBACtB,IAAKD,GAAUA,EAAOvnB,OAAS,EAAG,OAClC,MAAOynB,EAAQC,GAAUH,EAEnBI,GAAQD,EAASD,GAAM,EACvBG,EAAQlgB,MAAMsN,KAAK,CAAEhV,OAFb,IAE8B,CAACgY,EAAGjY,IAAM0nB,EAAS1nB,EAAI4nB,IACnEL,EAAOO,SAASD,GAChBN,EAAOQ,eACLF,EAAMpkB,KAAKgE,IACT,MAAM8C,EAAMrK,KAAKqK,IAAI9C,GACrB,OAAY,IAAR8C,EAAkB,IAClBA,GAAO,KAAQA,EAAM,IAAcyd,WAAWvgB,EAAEwgB,YAAY,IAAIlhB,WAC7DU,EAAEwW,cAAc,EAAE,IAE5B,IAGLmJ,EAAec,iBAAiB,CAAEC,UAAW,UAC7Cf,EAAegB,iBAAiB,CAAED,UAAW,UAC7Cf,EAAeiB,aAAapC,EAAWjE,gBACvCoF,EAAekB,mBAAmBpC,GAClClB,EAASuD,WAAWnB,EACrB,CAED,MAAMoB,EAAevG,GAAyBiC,EAAcsE,cAAgB,CAAEtG,SAAS,IACnFsG,EAAatG,SAA4B,SAAjB6B,EAAQnB,YAUtClY,eAAyCsa,EAAUjB,EAAS0B,EAAagD,GACvE,MAAMC,EAAW3E,EAAQN,UAAUkF,kBACnC,IAAKD,EACH,OAEF,MAAM1H,SAAEA,EAAQG,aAAEA,EAAYC,aAAEA,EAAYC,wBAAEA,EAAuBE,UAAEA,SAAoBV,KAErF+H,EAAYxH,EAAawD,cAC/BgE,EAAUC,cAAcH,EAASI,GAAIJ,EAASK,GAAI,GAClDH,EAAUI,UAAUN,EAAS3lB,OAAO,GAAI2lB,EAAS3lB,OAAO,GAAI,GAC5D6lB,EAAUK,WAAWP,EAASQ,QAAQ,GAAIR,EAASQ,QAAQ,GAAI,GAE/D,MAAMC,EAAehI,EAAayD,YAAY,CAC5CxiB,KAAM,WACNgnB,mBAAoB,EACpBC,OAAQX,EAASS,eAEnBP,EAAUU,eAAeC,WAAWJ,GAEpC,MAAMK,EAAgBnI,EAAwBuD,YAAY,CACxD6E,YAAa,EACb5lB,MAAO,EACP6lB,aAAa,IAEfF,EAAcnE,aAAauD,GAE3B,MAAM7e,EAAI7J,KAAKoK,IAAI,EAAGme,EAAetG,kBAC/BuD,EAAWD,EAAY,GACvBG,EAAWH,EAAY,GACvBmC,GAAQhC,EAAWF,IAAa3b,EAAI,GACpC4f,EAAgB,GACtB,IAAK,IAAI3pB,EAAI,EAAGA,EAAI+J,EAAG/J,IACrB2pB,EAAcrb,KAAKoX,EAAW1lB,EAAI4nB,GAEpC4B,EAAcI,iBAAiBD,GAC/BH,EAAcK,SAEd,MAAMC,EAAgBvI,EAAUqD,cAChCkF,EAAczE,aAAamE,EAAcO,iBACzCD,EAActE,qBAAoB,GAElC,MAAMwE,EAAehJ,EAAS4D,cAC9BoF,EAAahD,UAAU8C,GACvBE,EAAa/C,cAAcgD,YAAYxB,EAAerG,OACtD4H,EAAa/C,cAAcC,aAAauB,EAAepG,WACvD2C,EAASmC,SAAS6C,EACpB,CAvDUE,CAA0BlF,EAAUjB,EAAS0B,EAAa+C,GAGlExD,EAASmF,cACTjF,EAAakF,SACbzI,GAActd,IAAI2f,EAAWW,GAC7BR,EAAUkG,MAAQ,GAAGpG,YAAmBP,GAC1C,CAkEAhZ,eAAe8Y,GAAcd,EAAQY,EAAST,EAAOD,EAAO,WAC1D,MAAMpB,YAAEA,EAAWL,aAAEA,SAAuBN,KACtC0C,EAAW/B,EAAYoD,cAC7BrB,EAAS+G,YAAYC,QAAQ7H,EAAQ,GACjCG,EAAM5iB,OAAS,IACJ,SAAT2iB,EAAiBW,EAASiH,WAAWD,QAAQ1H,GAC5CU,EAASkH,WAAWF,QAAQ1H,IAEnC,MAAM6H,EAAavJ,EAAayD,YAAY,CAC1CxiB,KAAM,WACNgnB,mBAAoB,EACpBC,OAAQ/F,IAGV,OADAC,EAAS+F,eAAeC,WAAWmB,GAC5BnH,CACT,CAEA,SAASZ,GAAiBhT,EAAmBY,GAC3C,MAAMmS,EAAS,IAAIiI,aAAwC,EAA3Bhb,EAAkB1P,QAClD,IAAK,IAAID,EAAI,EAAGA,EAAI2P,EAAkB1P,OAAQD,IAAK,CACjD,MAAM4qB,EAAW,EAAJ5qB,EACb0iB,EAAOkI,GAAQxiB,OAAOuH,EAAkB3P,KAAO,EAC/C0iB,EAAOkI,EAAO,GAAKxiB,OAAOmI,IAAoBvQ,KAAO,EACrD0iB,EAAOkI,EAAO,GAAK,CACpB,CACD,OAAOlI,CACT,CAEA,SAASD,GAAsB3Z,EAAgB+hB,GAC7C,MAAMvH,EAAU,IAAIqH,aAAaE,GACjC,IAAK,IAAI7qB,EAAI,EAAGA,EAAI6qB,EAAgB7qB,IAAK,CACvC,MAAMgC,EAAQ8G,IAAiB9I,GAC/BsjB,EAAQtjB,GAAKoI,OAAOT,MAAMiD,QAAQ5I,GAASA,EAAM,GAAKA,IAAU,CACjE,CACD,OAAOshB,CACT,CAuBA,SAASF,GAAgC0H,GACvC,MAAMC,EAAUD,EAAarnB,KAAKunB,GAASA,EAAO,IAC5CjhB,EAAIghB,EAAQ9qB,OAElB,OAAU,IAAN8J,GAAiB,IAANA,EACNghB,EAGC,IAANhhB,EAMK,CAACghB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAANhhB,EACK,CAACghB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAGhC,IAANhhB,EAKK,CAACghB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAANhhB,EAQK,CAACghB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAI/CA,EAAQlnB,MAAM,EAAG3D,KAAK+qB,IAAI,EAAGF,EAAQ9qB,QAC9C,CAiBA,SAAS4jB,GAAiBqH,GACxB,IAAIC,EAAQ,EACVlI,EAAS,EACX,KAAOA,EAASiI,EAAYjrB,QAC1BgjB,GAAUiI,EAAYjI,GAAU,EAChCkI,IAEF,OAAOA,CACT,CAiMA,SAASC,GAAiC/B,EAAQP,EAAIC,GAGpD,MAAMsC,EAAY,IAAIV,aAAa7B,EAAKC,GACxC,IAAK,IAAIuC,EAAK,EAAGA,EAAKvC,EAAIuC,IACxB,IAAK,IAAIC,EAAK,EAAGA,EAAKzC,EAAIyC,IACxBF,EAAUE,EAAKD,EAAKxC,GAAMO,EAAOkC,EAAKxC,EAAKuC,GAG/C,OAAOD,CACT,CAyBA,SAASvL,GACPC,EACAvN,EACAzG,EACA0Q,EACAuD,EACAC,EACAvN,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBxc,OAErD,GAAwB,IAApB4S,EAAuB,CACzB,MAmBMqN,EAAahM,EAAyB8L,EAAoBC,EAnB/C,CACf,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOme,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAChC,MAmBMqN,EAAahM,EAAyB8L,EAAoBC,EAnB/C,CACf,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRjS,MAAOme,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIP,CAED,MAAO,CAAEuB,QAAQ,EAAOjS,MAAO,KACjC,CAEA,SAASme,GAAsBJ,EAAOvN,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAC9E,MAAM5J,EAAiBiD,EAAOjD,eACxB+J,EAAkBL,EAASvC,IAAI9B,GAAclO,OAE7CyM,EAD+BgG,EAAenG,kBAAkBC,EAAKC,GACxBC,cAE7C0T,EAAQzY,MAAMiD,QAAQ9B,EAAe,IAAMA,EAAerF,KAAKzB,GAAUA,EAAM,KAAM8G,EAE3F,IAAI0iB,EAAoB,EACxB,IAAK,IAAItY,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DsY,GACEpL,EAAM5N,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOsY,CACT,CAEA,SAASlL,GAAmBtW,EAAGmH,EAAGoP,GAChC,IAAItM,GAAS,EACb,IAAK,IAAIjU,EAAI,EAAGA,EAAIugB,EAAStgB,OAAQD,IAAK,CACxC,OAAQwgB,EAAIC,IAAMC,EAAIC,IAAOJ,EAASvgB,GACpBygB,EAAKtP,GAAMwP,EAAKxP,GAAKnH,GAAM0W,EAAKF,IAAOrP,EAAIsP,IAAQE,EAAKF,GAAMD,IACjEvM,GAAUA,EAC1B,CACD,OAAOA,CACT,wBCj0BO,MACL,WAAA5O,GjB8BK,IAAiB/E,EiB7BpBgM,KAAKoX,aAAe,KACpBpX,KAAK4F,WAAa,GAClB5F,KAAK4J,mBAAqB,GAC1B5J,KAAK9D,aAAe,UACpB8D,KAAKmf,qBAAuB,KjByBRnrB,EiBvBlB,yPjBwBJC,QAAQC,IAAI,YAAcF,EAAS,sCiBtBjCG,EAAS,kCACV,CAOD,cAAAirB,CAAeC,EAAahjB,EAAU,IACpC2D,KAAKoX,aAAeiI,OAGkBpnB,IAAlCoE,GAAS8iB,uBACXnf,KAAKmf,qBAAuB9iB,EAAQ8iB,qBACpCprB,EAAS,kCAGoBkE,IAA3BoE,GAASC,gBACX0D,KAAK1D,cAAgBD,EAAQC,cAC7BvI,EAAS,wBAAwBiM,KAAK1D,uBAEbrE,IAAvBoE,GAASE,YACXyD,KAAKzD,UAAYF,EAAQE,UACzBxI,EAAS,oBAAoBiM,KAAKzD,cAGpCxI,EAAS,uBAAuBsrB,IACjC,CAED,aAAAC,CAAc1Z,GACZ5F,KAAK4F,WAAaA,EAClB7R,EAAS,mCAAmC6R,EAAW9F,gBACxD,CAED,oBAAAyf,CAAqBxV,EAAayV,GAChCxf,KAAK4J,mBAAmBG,GAAeyV,EACvCzrB,EAAS,0CAA0CgW,YAAsByV,EAAU,KACpF,CAED,eAAAC,CAAgBvjB,GACd8D,KAAK9D,aAAeA,EACpBnI,EAAS,wBAAwBmI,IAClC,CAOD,KAAAwjB,CAAMrjB,EAAU,IACT2D,KAAKoX,cAAiBpX,KAAK4F,YAAe5F,KAAK4J,oBAClDxV,EAAS,8EAYX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjBmW,EAAkB,GAGtBxe,EAAS,qBACT,MAAM+R,EAAWP,EAAY3F,KAAK4F,YAClCzR,EAAS,8BAGT,MAAM2d,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHA9P,EAAS,gCACTF,QAAQ0I,KAAK,oBACbxI,EAAS,gBAAgB6L,KAAKoX,gBACJ,yBAAtBpX,KAAKoX,aAEP,GAA0B,YAAtBpX,KAAK9D,aAA4B,CAMnCM,EALsB8Q,EACpBjB,EACAnG,EACAlG,KAAK4J,oBAEwBpN,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmBwP,EAA0B1F,EAAUlG,KAAK4J,qBAK/EpN,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,cACrC,MACI,GAA0B,2BAAtBwD,KAAKoX,aAA2C,CAEzD,IAAIxK,EAAwB,EAC5B,MAAM+S,EAA2B,EAG3BlN,EAAU,CACdvM,SAAUA,EACV0D,mBAAoB5J,KAAK4J,mBACzBgD,sBAAuBA,EACvB1Q,aAAc8D,KAAK9D,aACnByW,kBAEArW,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,WAGvC,KAAOqQ,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5BpQ,EAAe7I,OAAS,IAC1B8e,EAAQE,gBAAkB,IAAInW,IAIhC,MAAMojB,EAAsBrN,GAAc5F,EAA6B8F,GAGvEtW,EAAiByjB,EAAoBzjB,eACrCC,EAAiBwjB,EAAoBxjB,eACrCI,EAAiBojB,EAAoBpjB,eAGrCoQ,GAAyB,EAAI+S,CAC9B,CACP,MAAW,GAA0B,yBAAtB3f,KAAKoX,aAEd,GAA0B,YAAtBpX,KAAK9D,aACP9H,EACE,uGAEG,GAEF+H,iBAAgBC,kBCjKpB,SAAmC8J,EAAU0D,EAAoBuV,GACtEhrB,EAAS,gDAGT,MAAMkP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGE5I,EAAEA,EAACuiB,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMZ,EAGjBtT,EAAU5F,EAAcC,IACxB9J,eACJA,EAAcD,eACdA,EAAcmK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAEJ,GAAsB,OAAlB/L,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBhT,KAAKqK,IAAI0F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkB3F,EAAY9R,OAAQyX,IAAmB,CAErF,MAAMhL,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY2F,KAIRvE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAIyZ,EAAS,EACb,IAAK,IAAItsB,EAAI,EAAGA,EAAI6S,EAAiB7S,IACnCssB,GAAU3c,EAAkBiD,EAAiB5S,IAAM0M,EAAc1M,GAInE,MAAMusB,EAAI3iB,EAAE0iB,GACNziB,EAAIsiB,EAAEG,GACNxf,EAAIsf,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIhU,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,MAAMmU,EAAmB7Z,EAAiB0F,GAG1C5P,EAAe+jB,IACbza,EAAa0F,GAAmBvE,EAAcqZ,EAAI9f,EAAc4L,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,MAAMC,EAAmB7E,EAAiB4E,GAG1C/O,EAAegkB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACAoZ,EACAnZ,EAAoBkF,GACpBlF,EAAoBoE,GAGtB/O,EAAegkB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACAtJ,EACAuJ,EAAoBoE,GACpB9K,EAAc4L,GAGhB7P,EAAegkB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACArG,EACAJ,EAAc4L,GACd5L,EAAc8K,EACjB,CACF,CACF,CACF,KAC0B,OAAlBpL,GACT1L,EAAS,0EAkBX,OAbkC,IAAIoY,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkCrQ,EAAgBD,GAE5EhI,EAAS,8CAEF,CACLgI,iBACAC,iBAEJ,CDgC8CgkB,CACpCla,EACAlG,KAAK4J,mBACL5J,KAAKmf,uBAOP3iB,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,cACrC,MACI,GAA0B,uBAAtBwD,KAAKoX,aAAuC,CAErD,MAAMiJ,EE7JL,SAAoCna,EAAU0D,GACnDzV,EAAS,6CAGT,MAAMkP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACF1L,EAAS,2CAEU,cAAjB2L,GACF3L,EAAS,wFAIX,MAAMye,EAAqB7M,EAYrBsa,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/BvN,EAAkB,IAAIje,IACtByrB,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAI3e,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAI4e,EAAc,EAAGA,EAAcH,EAAmB3sB,OAAQ8sB,IAAe,CAChF,MAAMC,EAAe/c,EAAI9B,GAAcye,EAAmBG,IAAgB,EACrE1N,EAAgBgF,IAAI2I,KACvB3N,EAAgBhb,IAAI2oB,EAAcF,GAClCD,EAAoBve,KAAK0e,GACzBF,IAEH,CAEH,MAAM1N,EAAqB0N,EACrBxN,EAAY,EAAIH,EAAqBC,EAE3C/e,EACE,uBAAuB8e,0BAA2CC,0BAA2CE,gBAI/G,IAAI5W,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAIqH,EAAY,EAAGA,EAAYwP,EAAWxP,IAAa,CAC1DpH,EAAeoH,GAAa,EAC5BrH,EAAe6F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3ChK,EAAeqH,GAAW2C,GAAY,CAEzC,CAGD,MAAMwa,EAAyB,IAAI9gB,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEV6gB,EAAyB,IAAI/gB,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIgf,EAAsB,GAC1B,IAAK,IAAIja,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEia,EAAoBja,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAIka,EAAuB,GAC3B,IAAK,IAAIla,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAM8Z,EAAe/c,EAAI9B,GAAcye,EAAmB1Z,IAAmB,EAC7Eka,EAAqBla,GAAkBmM,EAAgB1Z,IAAIqnB,EAC5D,CAGD,IAAK,IAAI5U,EAAmB,EAAGA,EAAmBrG,EAAY9R,OAAQmY,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAY9R,OAAQwY,IAAoB,CAExF,MAAM4U,EAAuCJ,EAAuB1gB,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIR6U,EAAuCJ,EAAuB3gB,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAe2gB,EAAqC3gB,cACpDC,sBAAuB0gB,EAAqC1gB,sBAC5DC,sBAAuBygB,EAAqCzgB,sBAC5D+C,oBACAY,oBACAqC,iBAAkBua,EAClBta,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAG5DkV,EAAevb,EAAaoG,GAAoBpG,EAAayG,GAAoBtF,EAGvF,IAAK,IAAImF,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAIkV,EAAcL,EAAoB7U,GAClCmV,EAAQD,EACRE,EAAQvO,EAAqBqO,EAEjC,IAAK,IAAIhW,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAImW,EAAcR,EAAoB3V,GAClCoW,EAAQD,EACRE,EAAQ1O,EAAqBwO,EAG7BG,EA9DH,GA+DEP,GAEAna,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAG/D/O,EAAeglB,GAAOG,IAAUE,EAChCrlB,EAAeilB,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAIlO,EAAO,EAAIV,EAAqBiO,EAAqBW,GAErDC,EACFT,EACAD,EAAqC5gB,cAAcqhB,GACnD3a,EAAoBkF,GAElB2V,EACFV,EACAD,EAAqC5gB,cAAcqhB,GACnDra,EAAoB4E,GAGtB7P,EAAeglB,GAAO5N,IAASmO,EAG/BvlB,EAAeilB,GAAO7N,IAASoO,EAG/BxlB,EAAeoX,GAAM4N,KAAWO,EAChCvlB,EAAeoX,GAAM6N,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAI/O,GACjChJ,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAGqBtG,kCAAkCrQ,EAAgBD,GACzEhI,EAAS,2CAEF,CACLgI,iBACAC,iBACAyW,qBACAC,qBACAyN,sBAEJ,CF1DiCqB,CAA2B1b,EAAUlG,KAAK4J,oBACrEzN,EAAiBkkB,EAAmBlkB,eACpCC,EAAiBikB,EAAmBjkB,eAMpCI,EAJ2BP,EAAkB+D,KAAK9D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAEHC,eAGpCwD,KAAK6hB,sBAAwB,CAC3BhP,mBAAoBwN,EAAmBxN,mBACvCC,mBAAoBuN,EAAmBvN,mBACvCyN,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHAtsB,QAAQkK,QAAQ,oBAChBhK,EAAS,6BAEF,CAAEqI,iBAAgBsV,mBAC1B,CAQD,gBAAMgQ,CAAWrjB,EAAepC,EAAU,IACnC2D,KAAKoX,cAAiBpX,KAAK4F,YAAe5F,KAAK4J,oBAClDxV,EAAS,mFAGX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBrI,EAAS,qBACT,MAAM+R,EAAWP,EAAY3F,KAAK4F,YAClCzR,EAAS,8BACT,MAAM2d,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJA9P,EAAS,gCACTF,QAAQ0I,KAAK,oBAEbxI,EAAS,iBAAiB6L,KAAKoX,gBACL,yBAAtBpX,KAAKoX,iBACJjb,iBAAgBC,kBAAmBwP,EAA0B1F,EAAUlG,KAAK4J,qBAErD,eAAtB5J,KAAK9D,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiB0D,KAAK1D,cAC7CC,UAAWF,EAAQE,WAAayD,KAAKzD,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHAzJ,QAAQkK,QAAQ,oBAChBhK,EAAS,6BAEF,CAAEqI,iBAAgBsV,mBAC1B,2BGhQI,MAKL,WAAA/Y,GACEiH,KAAKtB,OAAS,KACdsB,KAAK+hB,UAAY,KACjB/hB,KAAKgiB,SAAU,EAEfhiB,KAAKiiB,aACN,CAOD,iBAAMA,GACJ,IACEjiB,KAAKtB,OAAS,IAAIC,OAAO,IAAIC,IAAI,qBAAsB,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAAH,SAAAI,eAAA,WAAAJ,SAAAI,cAAAC,QAAAC,eAAAN,SAAAI,cAAAG,KAAA,IAAAR,IAAA,mBAAAC,SAAAQ,SAAAL,MAAkB,CACvEhI,KAAM,WAGRgJ,KAAKtB,OAAOwjB,QAAWC,IACrBluB,QAAQ2E,MAAM,iCAAkCupB,EAAM,EAExD,MAAMC,EAAgB9iB,EAAaU,KAAKtB,QAExCsB,KAAK+hB,gBAAkB,IAAIK,EAE3BpiB,KAAKgiB,SAAU,CAChB,CAAC,MAAOppB,GAEP,MADA3E,QAAQ2E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAMypB,GACJ,OAAIriB,KAAKgiB,QAAgB9pB,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAASmqB,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACIviB,KAAKgiB,QACP7pB,IACSoqB,GANO,GAOhBD,EAAO,IAAI1sB,MAAM,2CAEjB6sB,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAMpD,CAAeC,GAEnB,aADMrf,KAAKqiB,eACJriB,KAAK+hB,UAAU3C,eAAeC,EACtC,CAOD,mBAAMC,CAAc1Z,GAElB,aADM5F,KAAKqiB,eACJriB,KAAK+hB,UAAUzC,cAAc1Z,EACrC,CAQD,0BAAM2Z,CAAqBxV,EAAayV,GAEtC,aADMxf,KAAKqiB,eACJriB,KAAK+hB,UAAUxC,qBAAqBxV,EAAayV,EACzD,CAOD,qBAAMC,CAAgBvjB,GAEpB,aADM8D,KAAKqiB,eACJriB,KAAK+hB,UAAUtC,gBAAgBvjB,EACvC,CAMD,WAAMwjB,SACE1f,KAAKqiB,eACOK,YAAYC,MAC9B,MAAMljB,QAAeO,KAAK+hB,UAAUrC,QAEpC,OADgBgD,YAAYC,MACrBljB,CACR,CAMD,kBAAMmjB,GAEJ,aADM5iB,KAAKqiB,eACJriB,KAAK+hB,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADM7iB,KAAKqiB,eACJriB,KAAK+hB,UAAUc,MACvB,CAKD,SAAAjjB,GACMI,KAAKtB,SACPsB,KAAKtB,OAAOkB,YACZI,KAAKtB,OAAS,KACdsB,KAAK+hB,UAAY,KACjB/hB,KAAKgiB,SAAU,EAElB,6FChJuB5jB,MAAO0kB,IAC/B,IAAIrjB,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClB0H,mBAAoB,GACpBxH,kBAAmB,CAAE,EACrB2gB,MAAO,EACPC,OAAO,EACPC,SAAU,IACV3f,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAMuhB,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNnsB,KAAKosB,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnB5d,EAAa,EACb6d,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAE7W,YAAa,GACrC8W,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAMzvB,QAAQ,CAC/B,MAAMkxB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACFjkB,EAAOsjB,MAAQrH,WAAWoJ,EAAM,IAChCrlB,EAAOujB,MAAqB,MAAb8B,EAAM,GACrBrlB,EAAOwjB,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAMphB,EAAYyiB,SAASD,EAAM,GAAI,IAC/BviB,EAAMwiB,SAASD,EAAM,GAAI,IAC/B,IAAIhvB,EAAOgvB,EAAMvtB,MAAM,GAAGyE,KAAK,KAAKgpB,QAAQ,SAAU,IAEtDvlB,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWxM,QAC/C,MAGI,GAAgB,aAAZ4tB,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbpO,OAAQ2O,SAASD,EAAM,GAAI,IAC3B3B,OAAQ4B,SAASD,EAAM,GAAI,IAC3BG,SAAUF,SAASD,EAAM,GAAI,IAC7BI,QAASH,SAASD,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAapO,SAAQqO,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAMliB,EAAMwiB,SAASD,EAAM,GAAI,IACzBK,EAAcJ,SAASD,EAAM,GAAI,IACjCM,EAAWN,EAAMvtB,MAAM,EAAG,EAAI4tB,GAAahuB,KAAKqD,GAAMuqB,SAASvqB,EAAG,MACxE0oB,EAAkBC,OAAO5gB,GAAO6iB,EAChCT,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaS,WAAUR,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBmB,SAASD,EAAM,GAAI,IACtC9e,EAAa+e,SAASD,EAAM,GAAI,IAChCrlB,EAAO4D,kBAAoB,IAAIhI,MAAM2K,GAAYrK,KAAK,GACtD8D,EAAOwE,kBAAoB,IAAI5I,MAAM2K,GAAYrK,KAAK,QACjD,GAAIkoB,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjBuB,IAAKN,SAASD,EAAM,GAAI,IACxBviB,IAAKwiB,SAASD,EAAM,GAAI,IACxBQ,WAAYP,SAASD,EAAM,GAAI,IAC/Bf,SAAUgB,SAASD,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAIvpB,KAAKsqB,EAGZ,GAFAd,EAAShiB,KAAK+iB,SAASvqB,EAAG,KAC1BypB,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAMwB,EAAUvB,EAASE,GAA4B,EACrDzkB,EAAO4D,kBAAkBkiB,GAAW7J,WAAWoJ,EAAM,IACrDrlB,EAAOwE,kBAAkBshB,GAAW7J,WAAWoJ,EAAM,IACrDrlB,EAAO6D,cACP7D,EAAOyE,cACPggB,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBY,SAASD,EAAM,GAAI,IACzBC,SAASD,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoB7W,YAC7E6W,EAAsB,CACpBgB,IAAKN,SAASD,EAAM,GAAI,IACxBviB,IAAKwiB,SAASD,EAAM,GAAI,IACxBU,YAAaT,SAASD,EAAM,GAAI,IAChCtX,YAAauX,SAASD,EAAM,GAAI,KAGlCrlB,EAAOkC,aAAa0iB,EAAoBmB,cACrC/lB,EAAOkC,aAAa0iB,EAAoBmB,cAAgB,GAAKnB,EAAoB7W,YAEpF8W,EAA2B,OACtB,GAAIA,EAA2BD,EAAoB7W,YAAa,CACrE,MAAMiY,EAAcX,EAAMvtB,MAAM,GAAGJ,KAAKsG,GAAMsnB,SAAStnB,EAAG,MAG1D,IAAIioB,EAAcrB,EAAoB9hB,IACtC,GAAgC,IAA5B8hB,EAAoBgB,IAAW,CACjC,MAAMM,EAASzC,EAAkBC,OAAOkB,EAAoB9hB,KACxDojB,GAAUA,EAAOhyB,OAAS,IAAG+xB,EAAcC,EAAO,GACvD,CAEuC,IAApCtB,EAAoBmB,aAAyD,IAApCnB,EAAoBmB,aAC1DjB,EAAsBmB,KAAcnB,EAAsBmB,GAAe,IAC9EnB,EAAsBmB,GAAa1jB,KAAKyjB,GAEnChmB,EAAO2C,kBAAkBsjB,KAAcjmB,EAAO2C,kBAAkBsjB,GAAe,IACpFjmB,EAAO2C,kBAAkBsjB,GAAa1jB,KAAKyjB,IACE,IAApCpB,EAAoBmB,YAC7B/lB,EAAO6B,eAAeE,iBAAiBQ,KAAKyjB,GACC,IAApCpB,EAAoBmB,aAAyD,KAApCnB,EAAoBmB,aACtE/lB,EAAO6B,eAAeC,aAAaS,KAAKyjB,GAG1CnB,IACIA,IAA6BD,EAAoB7W,cACnD4W,IACAC,EAAsB,CAAE7W,YAAa,GAExC,CAGHmW,GACD,CAkBD,OAfAlkB,EAAOwC,gBAAgBI,SAAS5K,IAC9B,GAAuB,IAAnBA,EAAK6K,UAAiB,CACxB,MAAMsjB,EAAQrB,EAAsB9sB,EAAK8K,MAAQ,GAC7CqjB,EAAMjyB,OAAS,GACjB8L,EAAOmK,mBAAmB5H,KAAK,CAC7BlM,KAAM2B,EAAK3B,KACXyM,IAAK9K,EAAK8K,IACVqjB,SAGL,KAGH7xB,EAAS,+CAA+C0N,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,oBrB1QR,SAAmBomB,GACV,UAAVA,GAA+B,UAAVA,GACvB5xB,QAAQC,IACN,+BAAiC2xB,EAAQ,yBACzC,sCAEF/xB,EAAkB,UAElBA,EAAkB+xB,EAClB1xB,EAAS,qBAAqB0xB,KAElC,mCe6GO,SAAkCpS,EAAOhU,EAAQkY,EAAUD,GAChEzjB,QAAQ0I,KAAK,gBACb,MAAM0G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDhS,EAAgB2T,EAAM7N,WAAW9F,cACjCoG,EAAWP,EAAY8N,EAAM7N,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe2T,EAAM7N,WAAW9F,cAChCC,aAAc0T,EAAM7N,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAb6X,QAEvB,GAAsB,OAAlB7X,GAAuC,YAAb6X,EAAwB,CAC3D,MAAMmO,EAAsB,GACtBC,EAAsB,GACtBC,EAAUpyB,KAAKoK,OAAOqF,GAAqBzP,KAAK+qB,OAAOtb,GACvD4iB,EAAUryB,KAAKoK,OAAOiG,GAAqBrQ,KAAK+qB,OAAO1a,GACvDiiB,EAAkB,GAClBC,EAAYvyB,KAAKwyB,MAAMJ,EAAUE,GACjCG,EAAYzyB,KAAKwyB,MAAMH,EAAUC,GACjCI,EAAYN,GAAWG,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBV,EAAoB,GAAKlyB,KAAK+qB,OAAOtb,GACrC0iB,EAAoB,GAAKnyB,KAAK+qB,OAAO1a,GAErC,IAAK,IAAIwiB,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBW,GAAiBX,EAAoB,GACzDC,EAAoBU,GAAiBV,EAAoB,GAAKU,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAMpiB,EAAQoiB,EAAgBL,EAC9BP,EAAoBxhB,GAASwhB,EAAoB,GAAKY,EAAgBJ,EACtEP,EAAoBzhB,GAASyhB,EAAoB,GAEjD,IAAK,IAAIU,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBxhB,EAAQmiB,GAAiBX,EAAoBxhB,GACjEyhB,EAAoBzhB,EAAQmiB,GAAiBV,EAAoBzhB,GAASmiB,EAAgBF,CAE7F,CAKDC,EAAc,IAAInrB,MAAM8qB,EAAYE,GAAW1qB,KAAK,MAGpD,MAAMgrB,EAAmB7d,EAAoB5C,IAGvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAC9D,IAAI0gB,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAeV,EAAYE,EAAWQ,IAAgB,CAE/E,IACG7S,GACC8R,EAAoBe,GACpBd,EAAoBc,GACpBF,GAGF,SAEF,IAAIG,GAAQ,EACZ,IACE,IAAIlgB,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIijB,GAAmBjzB,OACjDiT,IACA,CACA,IAAI6C,EAAkBvD,EAASvC,IAAIijB,GAAmBhgB,GAAkB,EACxE,IACE,IAAImgB,EAAwB,EAC5BA,EAAwBne,EAAca,GACtCsd,IACA,CACA,IAAI5W,EAAiBzH,EAAce,GAAiBsd,GACpD,MAAMC,EAAexT,GACnBC,EACAvN,EACAzG,EACA0Q,EACA2V,EAAoBe,GACpBd,EAAoBc,GACpBzgB,GAGF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAatxB,MACzCoxB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAI3W,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAIhQ,OAAQwc,IAAkB,CACnF,MAAM6W,EAAexT,GACnBC,EACAvN,EACAzG,EACA0Q,EACA2V,EAAoBe,GACpBd,EAAoBc,GACpBzgB,GAGF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAatxB,MACzCoxB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAIG,EAAiBrzB,KAAK+qB,IAAIuI,OAAOC,WAAY,KAC7CC,EAAcnB,EAAUD,EACxBqB,EAAYzzB,KAAK+qB,IAAIsI,EAAgB,KACrCK,EAAaD,EAAYD,EAGzBG,EAAS,CACXxJ,MAAO,GAAGpG,2BAAkClE,EAAM2D,eAClDe,MAAOkP,EACPjP,OAAQkP,EACRE,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CACL1J,MAAO,IACP2J,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAErE,EAAG,GAAIhpB,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,IAClCsqB,UAAW,WAITC,EAAc,CAChBpqB,EAAGooB,EACHjhB,EAAGkhB,EACHgC,EAAGvB,EACHxvB,KAAM,UACNgxB,aAAa,EACbC,aAAa,EACbpD,KAAM,CACJqD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRvK,MAAO,YAETjoB,KAAM,+BAGRyyB,OAAOC,QAAQ9Q,EAAW,CAACoQ,GAAcP,EAAQ,CAAEkB,YAAY,IAC/Dx0B,QAAQkK,QAAQ,eACjB,CACH,sCC9KOC,eAA2CqV,EAAOhU,EAAQkY,EAAUD,EAAWE,EAAgB,IAEpG,GADA3jB,QAAQ0I,KAAK,gBAC0B,OAAnC8W,EAAM7N,WAAW9F,eAAuC,YAAb6X,EAAwB,CAErE,MAAMzR,EAAWP,EAAY8N,EAAM7N,YAC7B6R,QAAgBzB,GAA+BvC,EAAOhU,EAAQyG,EAAU,CAC5EoQ,KAAyC,OAAnC7C,EAAM7N,WAAW9F,eAAuC,SAAb6X,EAAsB,OAAS,YAIlF,aAFMH,GAAeC,EAASC,EAAWjE,EAAM2D,aAAcO,EAAUC,QACvE3jB,QAAQkK,QAAQ,eAEjB,CACD,MAAM+H,EAAWP,EAAY8N,EAAM7N,YAC7B8iB,QAkhBRtqB,eAAwCqV,EAAOhU,EAAQyG,GACrD,MAAMyiB,QA5GRvqB,eAA2CqV,EAAOhU,EAAQyG,GACxD,MAAM7C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClD1L,EAAiB,IAAIvG,EAAe,CACxCC,cAAe2T,EAAM7N,WAAW9F,cAChCC,aAAc0T,EAAM7N,WAAW7F,eAGjC,IAAIka,EAAO5W,EAAkB,GACzBrC,EAAOqC,EAAkB,GACzBulB,EAAO3kB,EAAkB,GACzB/C,EAAO+C,EAAkB,GAC7B,IAAK,IAAIvQ,EAAI,EAAGA,EAAI2P,EAAkB1P,OAAQD,IAAK,CACjD,MAAMgK,EAAI2F,EAAkB3P,GACtBmR,EAAIZ,EAAkBvQ,GACxBgK,EAAIuc,IAAMA,EAAOvc,GACjBA,EAAIsD,IAAMA,EAAOtD,GACjBmH,EAAI+jB,IAAMA,EAAO/jB,GACjBA,EAAI3D,IAAMA,EAAO2D,EACtB,CAED,MAAMmhB,EAAUhlB,EAAOiZ,EACjBgM,EAAU/kB,EAAO0nB,EACjBC,EAAmB,GAEnB1C,EAAYvyB,KAAKoK,IAAI,EAAGpK,KAAKwyB,MAAMJ,EAAU6C,IAC7CxC,EAAYzyB,KAAKoK,IAAI,EAAGpK,KAAKwyB,MAAMH,EAAU4C,IAE7CtlB,EAASyiB,GAAWG,EAAY,GAChChiB,EAAS8hB,GAAWI,EAAY,GAEhCyC,EAAgB3C,EAAYE,EAC5BP,EAAsB,IAAIzH,aAAayK,GACvC/C,EAAsB,IAAI1H,aAAayK,GACvCtC,EAAc,IAAInI,aAAayK,GACrCtC,EAAY7qB,KAAKG,OAAOitB,KACxB,MAAMC,EAAa,IAAIC,WAAWH,GAE5BnC,EAAmB7d,EAAoB5C,IACvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAE9D,IAAI0gB,EAAoB,EACxB,IAAK,IAAI3H,EAAK,EAAGA,EAAKkH,EAAWlH,IAC/B,IAAK,IAAID,EAAK,EAAGA,EAAKqH,EAAWrH,IAAM,CACrC,MAAM6H,EAAe5H,EAAKoH,EAAYrH,EAChCthB,EAAIuc,EAAOgF,EAAK1b,EAChBsB,EAAI+jB,EAAO5J,EAAK7a,EAKtB,GAHA2hB,EAAoBe,GAAgBnpB,EACpCqoB,EAAoBc,GAAgBhiB,GAE/BmP,GAAmBtW,EAAGmH,EAAG8hB,GAC5B,SAGF,IAAIG,GAAQ,EACZ,IACE,IAAIlgB,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIijB,GAAmBjzB,OACjDiT,IACA,CACA,MAAM6C,EAAkBvD,EAASvC,IAAIijB,GAAmBhgB,GAAkB,EAC1E,IAAK,IAAIsiB,EAAK,EAAGA,EAAKtgB,EAAca,GAAkByf,IAAM,CAC1D,MAAM/Y,EAAiBzH,EAAce,GAAiByf,GAChDlC,EAAexT,GAAYC,EAAOvN,EAAUzG,EAAQ0Q,EAAgBzS,EAAGmH,EAAGuB,GAEhF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAatxB,MACzCszB,EAAWnC,GAAgB,EAC3BC,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAED,IAAKA,EACH,IAAK,IAAI3W,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAIhQ,OAAQwc,IAAkB,CACnF,MAAM6W,EAAexT,GAAYC,EAAOvN,EAAUzG,EAAQ0Q,EAAgBzS,EAAGmH,EAAGuB,GAEhF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAatxB,MACzCszB,EAAWnC,GAAgB,EAC3B,KACD,CACF,CAEJ,CAGH,MAAO,CACLV,YACAE,YACApM,OACA2O,OACArlB,SACAY,SACA6hB,UACAC,UACAH,sBACAC,sBACAS,cACAwC,aAEJ,CAGqBG,CAA4B1V,EAAOhU,EAAQyG,IACxDigB,UACJA,EAASE,UACTA,EAASpM,KACTA,EAAI2O,KACJA,EAAIrlB,OACJA,EAAMY,OACNA,EAAM2hB,oBACNA,EAAmBC,oBACnBA,EAAmBS,YACnBA,EAAWwC,WACXA,GACEL,EAEEvS,EAASC,GAAiByP,EAAqBC,GAC/CxP,EAoCR,SAAkCiG,EAAIC,EAAIuM,GACxC,MAAMtS,EAAS,GAEf,IAAK,IAAIuI,EAAK,EAAGA,EAAKzC,EAAK,EAAGyC,IAC5B,IAAK,IAAID,EAAK,EAAGA,EAAKvC,EAAK,EAAGuC,IAAM,CAClC,MAAMoK,EAAKnK,EAAKxC,EAAKuC,EACfqK,GAAMpK,EAAK,GAAKxC,EAAKuC,EACrBsK,GAAMrK,EAAK,GAAKxC,GAAMuC,EAAK,GAC3BuK,EAAKtK,EAAKxC,GAAMuC,EAAK,GAEtBgK,EAAWI,IAAQJ,EAAWK,IAAQL,EAAWM,IAAQN,EAAWO,IAIzE7S,EAAO1U,KAAK,EAAGonB,EAAIC,EAAIC,EAAIC,EAC5B,CAGH,OAAO9S,YAAY9N,KAAK+N,EAC1B,CAvDgB8S,CAAyBrD,EAAWE,EAAW2C,GACvD/R,QAAiBC,GAAcd,EAAQoQ,EAAajQ,EAAO,WAEjE,MAAO,CACLH,SACAY,QAASwP,EACTjQ,QACAU,WACAX,KAAM,UACNa,SAAU,CACRrX,cAAe,KACfuX,eAAgBjB,EAAOziB,OAAS,EAChC2jB,cAAeC,GAAiBhB,GAChC8F,kBAAmB,CACjBG,GAAI2J,EACJ1J,GAAI4J,EACJ5vB,OAAQ,CAACwjB,EAAM2O,GACfhM,QAAS,CAACrZ,EAAQY,GAClB0Y,aAAciC,GAAiC0H,EAAaL,EAAWE,KAI/E,CAxjBoCoD,CAAyBhW,EAAOhU,EAAQyG,SACpEsR,GACJkR,EACAhR,EACAjE,EAAM2D,aACN,GAAGO,iBACHC,GAEF3jB,QAAQkK,QAAQ,eAClB,uBD/HO,SAAsBsV,EAAOhU,EAAQkY,EAAUD,GACpDzjB,QAAQ0I,KAAK,gBACb,MAAM0G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDtV,EAAiBiD,EAAOjD,eACxB4a,EAAe3D,EAAM2D,aACrBtX,EAAgB2T,EAAM7N,WAAW9F,cAGvC,GAFiB6F,EAAY8N,EAAM7N,YAEb,OAAlB9F,GAAuC,SAAb6X,EAAqB,CAEjD,IAAI+R,EAEFA,EADEltB,EAAe7I,OAAS,GAAK0H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAMsN,KAAKtF,GAEvB,IAAIsmB,EAAW,CACbjsB,EAAG2F,EACHwB,EAAG6kB,EACHpT,KAAM,QACNtf,KAAM,UACN6tB,KAAM,CAAE/O,MAAO,mBAAoBqC,MAAO,GAC1CriB,KAAM,YAGJmxB,EAAiBrzB,KAAK+qB,IAAIuI,OAAOC,WAAY,KAI7CI,EAAS,CACXxJ,MAAO,eAAe3G,IACtBe,MALcvkB,KAAK+qB,IAAIsI,EAAgB,KAMvC7O,OALe,IAMfoP,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CAAE1J,MAAO,YAChB6J,OAAQ,CAAErE,EAAG,GAAIhpB,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,KAGpCgrB,OAAOC,QAAQ9Q,EAAW,CAACiS,GAAWpC,EAAQ,CAAEkB,YAAY,IAC5Dx0B,QAAQkK,QAAQ,eACjB,MAAM,GAAsB,OAAlB2B,GAAuC,YAAb6X,EAAwB,CAE3D,IAAI7D,EAEFA,EADEzY,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIyqB,EAAiBrzB,KAAK+qB,IAAIuI,OAAOC,WAAY,KAC7ClN,EAAOrmB,KAAK+qB,OAAOtb,GACnBrC,EAAOpN,KAAKoK,OAAOqF,GACnBulB,EAAOh1B,KAAK+qB,OAAO1a,GAInBmjB,GAHOxzB,KAAKoK,OAAOiG,GAEF2kB,IADP5nB,EAAOiZ,GAGjBoN,EAAYzzB,KAAK+qB,IAAIsI,EAAgB,KAIrCM,EAAS,CACXxJ,MAAO,GAAGpG,YAAmBP,IAC7Be,MAAOkP,EACPjP,OANeiP,EAAYD,EAO3BI,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CACL1J,MAAO,IACP2J,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAErE,EAAG,GAAIhpB,EAAG,GAAIyK,EAAG,GAAIzH,EAAG,IAClCsqB,UAAW,WAITC,EAAc,CAChBpqB,EAAG2F,EACHwB,EAAGZ,EACH8jB,EAAGjU,EACH9c,KAAM,UACN6tB,KAAM,CACJqD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRvK,MAAO,YAETjoB,KAAM,kBAGRyyB,OAAOC,QAAQ9Q,EAAW,CAACoQ,GAAcP,EAAQ,CAAEkB,YAAY,IAC/Dx0B,QAAQkK,QAAQ,eACjB,CACH,0BCfOC,eAA+BqV,EAAOhU,EAAQkY,EAAUD,EAAWE,EAAgB,IACxF3jB,QAAQ0I,KAAK,gBACb,MAAMmD,EAAgB2T,EAAM7N,WAAW9F,cACjCoG,EAAWP,EAAY8N,EAAM7N,YAC7B6R,QAAgBzB,GAA+BvC,EAAOhU,EAAQyG,EAAU,CAC5EoQ,KAAwB,OAAlBxW,GAAuC,SAAb6X,EAAsB,OAAS,kBAE3DH,GAAeC,EAASC,EAAWjE,EAAM2D,aAAcO,EAAUC,GACvE3jB,QAAQkK,QAAQ,eAClB,uBMlG4B,sDN2LrB,SAA0CsB,GAC/C,MAAM4D,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDkF,EAAUb,GAAsB1W,EAAOjD,eAAgB6G,EAAkB1P,QACzEi2B,EAAW,IAAIvL,aAAwC,EAA3Bhb,EAAkB1P,QAEpD,IAAK,IAAID,EAAI,EAAGA,EAAI2P,EAAkB1P,OAAQD,IAAK,CACjD,MAAM4qB,EAAW,EAAJ5qB,EACbk2B,EAAStL,GAAQxiB,OAAOuH,EAAkB3P,KAAO,EACjDk2B,EAAStL,EAAO,GAAKxiB,OAAOmI,EAAkBvQ,KAAO,EACrDk2B,EAAStL,EAAO,GAAKtH,EAAQtjB,EAC9B,CAED,MAAO,CACLk2B,WACAC,cAAe,CAACxmB,EAAkB1P,OAAQ,GAC1Cm2B,OAAQ9S,EACRZ,OAAQC,GAAiBhT,EAAmBY,GAEhD,qCA5BO7F,eAA0CqV,EAAOhU,EAAQyG,EAAW,KAAM7J,EAAU,IAEzF,OAiVF,SAAwBob,GACtB,MAAMsS,aAAEA,EAAYC,QAAEA,GAfxB,SAA6CpL,GAC3C,MAAMmL,EAAe,GACnBC,EAAU,GACZ,IAAIrT,EAAS,EACXsT,EAAU,EACZ,KAAOtT,EAASiI,EAAYjrB,QAAQ,CAClC,MAAMu2B,EAAOtL,EAAYjI,KACzB,IAAK,IAAIjjB,EAAI,EAAGA,EAAIw2B,EAAMx2B,IAAKq2B,EAAa/nB,KAAK4c,EAAYjI,MAC7DsT,GAAWC,EACXF,EAAQhoB,KAAKioB,EACd,CACD,MAAO,CAAEF,eAAcC,UACzB,CAGoCG,CAAoC1S,EAAQlB,OACxEc,EAAiBI,EAAQrB,OAAOziB,OAAS,EACzCy2B,EAA0B,SAAjB3S,EAAQnB,KACjB+T,EAAcD,EAAS,QAAU,QACvC,MAAO,CACL,wBACA,oEACA,eACA,8BAA8B/S,uCAAoD+S,EAASJ,EAAQr2B,OAAS,wCAAwCy2B,EAAS,EAAIJ,EAAQr2B,WACzK,uCACA,2FAA2F0H,MAAMsN,KAAK8O,EAAQT,SAAShb,KAAK,mBAC5H,qBACA,iBACA,2EAA2EX,MAAMsN,KAAK8O,EAAQrB,QAAQpa,KAAK,mBAC3G,kBACA,UAAUquB,KACV,sEAAsEN,EAAa/tB,KAAK,mBACxF,iEAAiEguB,EAAQhuB,KAAK,mBAC9E,WAAWquB,KACX,eACA,gBACA,cACAruB,KAAK,KACT,CAzWSsuB,OADetU,GAA+BvC,EAAOhU,EAAQyG,EAAU7J,GAEhF"}
\ No newline at end of file
diff --git a/dist/feascript.esm.js b/dist/feascript.esm.js
index 412c58c..c6b8ecf 100644
--- a/dist/feascript.esm.js
+++ b/dist/feascript.esm.js
@@ -1,7 +1,8 @@
-function e(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}let t="basic";function n(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),t="basic"):(t=e,s(`Log level set to: ${e}`))}function o(e){"debug"===t&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function s(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function i(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}function r(e){console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;")}
+function e(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}let t="basic";function n(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),t="basic"):(t=e,s(`Log level set to: ${e}`))}function o(e){"debug"===t&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function s(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function i(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}
 /**
  * @license
  * Copyright 2019 Google LLC
  * SPDX-License-Identifier: Apache-2.0
- */const a=Symbol("Comlink.proxy"),l=Symbol("Comlink.endpoint"),d=Symbol("Comlink.releaseProxy"),c=Symbol("Comlink.finalizer"),u=Symbol("Comlink.thrown"),m=e=>"object"==typeof e&&null!==e||"function"==typeof e,h=new Map([["proxy",{canHandle:e=>m(e)&&e[a],serialize(e){const{port1:t,port2:n}=new MessageChannel;return f(e,t),[n,[n]]},deserialize:e=>(e.start(),g(e))}],["throw",{canHandle:e=>m(e)&&u in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function f(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:r,path:l}=Object.assign({path:[]},s.data),d=(s.data.argumentList||[]).map(F);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(r){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=F(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,d);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[a]:!0})}(new n(...d));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;f(e,n),m=function(e,t){return D.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[u]:0}}Promise.resolve(m).catch((e=>({value:e,[u]:0}))).then((n=>{const[s,a]=$(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),a),"RELEASE"===r&&(t.removeEventListener("message",o),p(t),c in e&&"function"==typeof e[c]&&e[c]())})).catch((e=>{const[n,o]=$({value:new TypeError("Unserializable return value"),[u]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function p(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function g(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),C(e,n,[],t)}function b(e){if(e)throw new Error("Proxy has been released and is not useable")}function y(e){return x(e,new Map,{type:"RELEASE"}).then((()=>{p(e)}))}const E=new WeakMap,v="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(E.get(e)||0)-1;E.set(e,t),0===t&&y(e)}));function C(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(b(s),r===d)return()=>{!function(e){v&&v.unregister(e)}(i),y(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=x(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then(F);return o.then.bind(o)}return C(e,t,[...n,r])},set(o,i,r){b(s);const[a,l]=$(r);return x(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then(F)},apply(o,i,r){b(s);const a=n[n.length-1];if(a===l)return x(e,t,{type:"ENDPOINT"}).then(F);if("bind"===a)return C(e,t,n.slice(0,-1));const[d,c]=M(r);return x(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:d},c).then(F)},construct(o,i){b(s);const[r,a]=M(i);return x(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then(F)}});return function(e,t){const n=(E.get(t)||0)+1;E.set(t,n),v&&v.register(e,t,e)}(i,e),i}function M(e){const t=e.map($);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const D=new WeakMap;function $(e){for(const[t,n]of h)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},D.get(e)||[]]}function F(e){switch(e.type){case"HANDLER":return h.get(e.name).deserialize(e.value);case"RAW":return e.value}}function x(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function A(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let d=[],c=!0,u=0;if(s(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),o=math.slu(e,1,1);let s=math.lusolve(o,n);d=math.squeeze(s).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,n,new Array(n.length).fill(0),{maxIterations:a,tolerance:l});e.converged?o(`Jacobi method converged in ${e.iterations} iterations`):i(`Jacobi method did not converge after ${e.iterations} iterations`),d=e.solutionVector,c=e.converged,u=e.iterations}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s("System solved successfully"),{solutionVector:d,converged:c,iterations:u}}async function w(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;s(`Solving system using ${e}...`),console.time("systemSolving");const d=Array.isArray(t)?t:t?.toArray?.()??t,c=Array.isArray(n)?n:n?.toArray?.()??n;let u,m=null,h=null,f=[],p=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js",import.meta.url),{type:"module"}),t=g(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(c.length).fill(0);let t;t=await h.webgpuJacobiSolver(d,c,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,p=t.converged,u=t.iterations,p?o(`Jacobi method converged in ${u} iterations`):i(`Jacobi method did not converge after ${u} iterations`)}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:p,iterations:u}}class N{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],s=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void i("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,s[0]=-1*r(e),s[1]=1*r(e),s[2]=-1*e,s[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function d(e){return 2*e**2-e}function c(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*d(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*d(t),n[6]=d(e)*a(t),n[7]=d(e)*l(t),n[8]=d(e)*d(t),o[0]=c(e)*a(t),o[1]=c(e)*l(t),o[2]=c(e)*d(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*d(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*d(t),s[0]=a(e)*c(t),s[1]=a(e)*u(t),s[2]=a(e)*m(t),s[3]=l(e)*c(t),s[4]=l(e)*u(t),s[5]=l(e)*m(t),s[6]=d(e)*c(t),s[7]=d(e)*u(t),s[8]=d(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:s}}}class O{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=o,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(s("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||i("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,o("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&i("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(o("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const n=t[0],s=t[1];o(`Processing boundary node pair: [${n}, ${s}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const i=this.parsedMesh.nodalNumbering[t];if(4===i.length){if(i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&2===d||2===l&&0===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===d||1===l&&0===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===d||3===l&&1===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===d||3===l&&2===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===i.length&&i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&6===d||6===l&&0===d||0===l&&3===d||3===l&&0===d||3===l&&6===d||6===l&&3===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===d||2===l&&0===d||0===l&&1===d||1===l&&0===d||1===l&&2===d||2===l&&1===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===d||8===l&&2===d||2===l&&5===d||5===l&&2===d||5===l&&8===d||8===l&&5===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===d||8===l&&6===d||6===l&&7===d||7===l&&6===d||7===l&&8===d||8===l&&7===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||i(`Could not find element containing boundary nodes ${n} and ${s}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class V extends O{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||i("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,n;if("linear"===this.elementOrder){t=this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class X extends O{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:s="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:s,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||i("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let n,s,i,r;if("linear"===this.elementOrder){n=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r}}else if("quadratic"===this.elementOrder){n=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i/2,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const o=Math.PI/180,i=Math.tan(this.angleLeft*o),r=Math.tan(this.angleRight*o),a=1e-12;for(let o=0;o<s;o++){const l=t[o],d=Math.abs(i)<a?0:l/i,c=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<n;t++){const i=1===n?0:t/(n-1);e[t*s+o]=d+(c-d)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),o("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:n,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class P{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function S(e){const{meshDimension:t,numElementsX:n,numElementsY:s,maxX:r,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}=e;let m;"1D"===t?m=new V({numElementsX:n,maxX:r,elementOrder:l,parsedMesh:d}):"2D"===t?m=new X({numElementsX:n,maxX:r,numElementsY:s,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}):i("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,E=h.boundaryElements;let v,C;return null!=d?(v=y.length,C=f.length,o(`Using parsed mesh with ${v} elements and ${C} nodes`)):(v=n*("2D"===t?s:1),C=g*("2D"===t?b:1),o(`Using mesh generated from geometry with ${v} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:E,totalElements:v,totalNodes:C,meshDimension:t,elementOrder:l}}function I(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new N({meshDimension:o,elementOrder:s});let l=new P({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function T(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,d=[];for(let e=0;e<i;e++)d[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:d}}function k(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,d=0,c=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],d+=i[r[e]]*t[e],c+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=c*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(c*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:d,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function R(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function Y(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=R(e,t,o),r=R(e,t,s),a=i.inside||r.inside;let l=0,d=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),c=a(o,s),u=a(i,r),m=a(o,i);l=c/(c+u),d=m/(m+a(s,r))}return{inside:a,ksi:l,eta:d}}class B{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,n,s,i,r,a){let l=[],d=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],d[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("convection"===this.boundaryConditions[n][0]){const s=l[n],i=d[n];o(`Boundary ${n}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[n].forEach((([n,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[n][a]-1;o(`  - Applied convection boundary condition to node ${l+1} (element ${n+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((c=>{if("convection"===this.boundaryConditions[c][0]){const u=l[c],m=d[c];o(`Boundary ${c}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[c].forEach((([l,d])=>{if("linear"===this.elementOrder){let c,h,f,p,g;0===d?(c=n[0],h=0,f=0,p=3,g=2):1===d?(c=0,h=n[0],f=0,p=2,g=1):2===d?(c=n[0],h=1,f=1,p=4,g=2):3===d&&(c=1,h=n[0],f=2,p=4,g=1);let b=a.getBasisFunctions(c,h),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[l].length;for(let e=0;e<F;e++){const t=this.nop[l][e]-1;0===d||2===d?(C+=i[t]*E[e],M+=r[t]*E[e]):1!==d&&3!==d||(D+=i[t]*v[e],$+=r[t]*v[e])}let x;x=0===d||2===d?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let n=f;n<p;n+=g){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[0]*x*y[n]*u*m;for(let e=f;e<p;e+=g){let o=this.nop[l][e]-1;t[i][o]+=-s[0]*x*y[n]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let c=0;c<3;c++){let h,f,p,g,b;0===d?(h=n[c],f=0,p=0,g=7,b=3):1===d?(h=0,f=n[c],p=0,g=3,b=1):2===d?(h=n[c],f=1,p=2,g=9,b=3):3===d&&(h=1,f=n[c],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),E=y.basisFunction,v=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,M=0,D=0,$=0,F=0;const x=this.nop[l].length;for(let e=0;e<x;e++){const t=this.nop[l][e]-1;0===d||2===d?(M+=i[t]*v[e],D+=r[t]*v[e]):1!==d&&3!==d||($+=i[t]*C[e],F+=r[t]*C[e])}let A;A=0===d||2===d?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let n=p;n<g;n+=b){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[c]*A*E[n]*u*m;for(let e=p;e<g;e+=b){let o=this.nop[l][e]-1;t[i][o]+=-s[c]*A*E[n]*E[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,n,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const d=this.nop[e].length,c=Array(d).fill().map((()=>Array(d).fill(0))),u=Array(d).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];o(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),o(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,c[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let o,l,m,p,g;0===a?(o=s[0],l=0,m=0,p=3,g=2):1===a?(o=0,l=s[0],m=0,p=2,g=1):2===a?(o=s[0],l=1,m=1,p=4,g=2):3===a&&(o=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(o,l),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta;let C,M=0,D=0,$=0,F=0;for(let o=0;o<d;o++){const s=this.nop[e][o]-1;0===a||2===a?(M+=t[s]*E[o],D+=n[s]*E[o]):1!==a&&3!==a||($+=t[s]*v[o],F+=n[s]*v[o])}C=0===a||2===a?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let o=0;o<3;o++){let l,d,m,p,g;0===a?(l=s[o],d=0,m=0,p=7,g=3):1===a?(l=0,d=s[o],m=0,p=3,g=1):2===a?(l=s[o],d=1,m=2,p=9,g=3):3===a&&(l=1,d=s[o],m=6,p=9,g=1);let b=r.getBasisFunctions(l,d),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[e].length;for(let o=0;o<F;o++){const s=this.nop[e][o]-1;0===a||2===a?(C+=t[s]*E[o],M+=n[s]*E[o]):1!==a&&3!==a||(D+=t[s]*v[o],$+=n[s]*v[o])}let x;x=0===a||2===a?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let e=m;e<p;e+=g){u[e]+=-i[o]*x*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[o]*x*y[e]*y[t]*h}}}}return{localJacobianMatrix:c,localResidualVector:u}}}function q(e,t){s("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:o,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:d}=e,c=I(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=c;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const s=f.getBasisFunctions(p[e],p[t]),i=k({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:o,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new B(t,r,i,l,d);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,o,f),y.imposeConstantTempBoundaryConditions(u,m),s("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function j({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:d,meshDimension:c}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===c)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:d}=T({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(d[t]*d[n])}else if("2D"===c)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=k({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c,nodesXCoordinates:l,nodesYCoordinates:d,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class W{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function G(e,t,n,i){s("Starting front propagation matrix assembly...");let r=1-i+.01;o(`eikonalViscousTerm: ${r}`),o(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:d,boundaryElements:c,totalElements:u,meshDimension:m,elementOrder:h}=e,f=I(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:E,gaussWeights:v,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=d[e][t]-1;for(let e=0;e<E.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(E[e]);const o=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:s,basisFunctionDerivX:i}=o;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=n[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<E.length;t++){let o=y.getBasisFunctions(E[e],E[t]);const s=k({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=s,m=o.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=n[b[e]]*c[e],f+=n[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*v[e]*v[t]*d*c[n]*h+r*v[e]*v[t]*d*u[n]*f,0!==i&&(p[o]+=i*(v[e]*v[t]*d*m[n]*Math.sqrt(h**2+f**2)-v[e]*v[t]*d*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*v[e]*v[t]*d*(c[n]*c[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-d*h*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*c[s]-i*(d*f*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new W(t,c,d,m,h).imposeDirichletBoundaryConditions(p,g),s("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function K({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:d}=s,{nodesXCoordinates:c,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(d).fill().map((()=>Array(d).fill(0))),p=Array(d).fill(0),g=Array(d),b=Array(d);for(let n=0;n<d;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:c,localToGlobalMap:b,nodesPerElement:d}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<d;e++)l+=i[b[e]]*r[e];for(let e=0;e<d;e++){b[e];for(let e=0;e<d;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:E}=k({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:c,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:d});let v=0,C=0;for(let e=0;e<d;e++)v+=i[b[e]]*y[e],C+=i[b[e]]*E[e];for(let o=0;o<d;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*v+h*l[e]*l[t]*g*E[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(v**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<d;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+E[o]*E[s]),0!==r&&(f[o][s]+=r*(-g*v*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*E[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const J={},L={},H={currentElementIndex:0},z={};let U;function _(e,t,n,r={}){const a=I(t),l=t.nodesXCoordinates.length,d=t.totalElements;!function(e,t){J.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),J.nodeConstraintCode=Array(e).fill(0),J.boundaryValues=Array(e).fill(0),J.globalResidualVector=Array(e).fill(0),J.solutionVector=Array(e).fill(0),J.topologyData=Array(t).fill(0),J.lateralData=Array(t).fill(0),L.writeFlag=0,L.totalNodes=e,L.transformationFlag=0,L.nodesPerElement=Array(t).fill(0),L.determinant=1;const n=Math.max(e,2e3);L.globalSolutionVector=Array(n).fill(0),L.frontDataIndex=0,H.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),H.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);z.frontValues=Array(o).fill(0),z.columnHeaders=Array(n).fill(0),z.pivotRow=Array(n).fill(0),z.pivotData=Array(o).fill(0)}(a.nodesPerElement,d),s("Solving system using frontal..."),console.time("systemSolving"),U=new N({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)J.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)J.nodeConstraintCode[e]=0,J.boundaryValues[e]=0;let c;e===j?(c=new B(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantTempBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues)):e===K&&(c=new W(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantValueBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)J.globalResidualVector[e]=0;L.totalNodes=t.nodesXCoordinates.length,L.writeFlag=0,L.transformationFlag=1,L.determinant=1;for(let e=0;e<t.totalElements;e++)L.nodesPerElement[e]=a.nodesPerElement;L.currentSolutionVector=r.solutionVector,L.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,n,s){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,L.globalSolutionVector.length);let d,c=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),E=Array(a).fill(0),v=Array(a).fill(0),C=1;L.writeFlag++;let M=1,D=1;H.currentElementIndex=0;for(let e=0;e<L.totalNodes;e++)y[e]=0,E[e]=0;if(0!==L.transformationFlag){for(let e=0;e<L.totalNodes;e++)v[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<L.nodesPerElement[t];e++){let n=J.nodalNumbering[t][e];0===v[n-1]&&(v[n-1]=1,J.nodalNumbering[t][e]=-J.nodalNumbering[t][e])}}}L.transformationFlag=0;let $=0,F=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,v=0,x=0;if(H.currentElementIndex<r&&(H.currentElementIndex++,a=Q(e,t,n,s)),a){const e=H.currentElementIndex;v=L.nodesPerElement[e-1],x=L.nodesPerElement[e-1];for(let t=0;t<x;t++){let n,o,s=J.nodalNumbering[e-1][t];if(0===$)$++,c[t]=$,z.columnHeaders[$-1]=s;else{for(n=0;n<$&&Math.abs(s)!==Math.abs(z.columnHeaders[n]);n++);n===$?($++,c[t]=$,z.columnHeaders[$-1]=s):(c[t]=n+1,z.columnHeaders[n]=s)}if(0===F)F++,u[t]=F,m[F-1]=s;else{for(o=0;o<F&&Math.abs(s)!==Math.abs(m[o]);o++);o===F?(F++,u[t]=F,m[F-1]=s):(u[t]=o+1,m[o]=s)}}if(F>l||$>l)return void i("Error: systemSize not large enough");for(let e=0;e<x;e++){let t=c[e];for(let n=0;n<v;n++){b[u[n]-1][t-1]+=H.localJacobianMatrix[n][e]}}}let A=0;for(let e=0;e<$;e++)z.columnHeaders[e]<0&&(f[A]=e+1,A++);let w=0,N=0;for(let e=0;e<F;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===J.nodeConstraintCode[n-1]&&(p[w]=e+1,w++,J.nodeConstraintCode[n-1]=2,J.globalResidualVector[n-1]=J.boundaryValues[n-1])}}if(w>0)for(let e=0;e<w;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<$;e++){b[t][e]=0,Math.abs(z.columnHeaders[e])===n&&(b[t][e]=1)}}if(A>D||H.currentElementIndex<r){if(0===A)return void i("Error: no more rows fully summed");let e=h[0],t=f[0],n=b[e-1][t-1];if(Math.abs(n)<1e-4){n=0;for(let o=0;o<A;o++){let s=f[o];for(let o=0;o<N;o++){let i=h[o],r=b[i-1][s-1];Math.abs(r)>Math.abs(n)&&(n=r,t=s,e=i)}}}let s=Math.abs(m[e-1]);d=Math.abs(z.columnHeaders[t-1]);let a=s+d+y[s-1]+E[d-1];L.determinant=L.determinant*n*(-1)**a/Math.abs(n);for(let e=0;e<L.totalNodes;e++)e>=s&&y[e]--,e>=d&&E[e]--;if(Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;for(let t=0;t<$;t++)z.pivotRow[t]=b[e-1][t]/n;let l=J.globalResidualVector[s-1]/n;if(J.globalResidualVector[s-1]=l,g[e-1]=n,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*z.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n][e-1]=b[n][e]-o*z.pivotRow[e];J.globalResidualVector[e-1]-=o*l}if(e<F)for(let n=e;n<F;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*z.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n-1][e-1]=b[n][e]-o*z.pivotRow[e];J.globalResidualVector[e-1]-=o*l}for(let e=0;e<F;e++)z.pivotData[M+e-1]=g[e];M+=F;for(let e=0;e<F;e++)z.pivotData[M+e-1]=m[e];M+=F,z.pivotData[M-1]=e,M++;for(let e=0;e<$;e++)z.frontValues[C-1+e]=z.pivotRow[e];C+=$;for(let e=0;e<$;e++)z.frontValues[C-1+e]=z.columnHeaders[e];C+=$,z.frontValues[C-1]=s,z.frontValues[C]=$,z.frontValues[C+1]=t,z.frontValues[C+2]=n,C+=4;for(let e=0;e<F;e++)b[e][$-1]=0;for(let e=0;e<$;e++)b[F-1][e]=0;if($--,t<$+1)for(let e=t-1;e<$;e++)z.columnHeaders[e]=z.columnHeaders[e+1];if(F--,e<F+1)for(let t=e-1;t<F;t++)m[t]=m[t+1];if(F>1||H.currentElementIndex<r)continue;if(d=Math.abs(z.columnHeaders[0]),e=1,n=b[0][0],s=Math.abs(m[0]),t=1,a=s+d+y[s-1]+E[d-1],L.determinant=L.determinant*n*(-1)**a/Math.abs(n),z.pivotRow[0]=1,Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;J.globalResidualVector[s-1]=J.globalResidualVector[s-1]/n,z.frontValues[C-1]=z.pivotRow[0],C++,z.frontValues[C-1]=z.columnHeaders[0],C++,z.frontValues[C-1]=s,z.frontValues[C]=$,z.frontValues[C+1]=t,z.frontValues[C+2]=n,C+=4,z.pivotData[M-1]=g[0],M++,z.pivotData[M-1]=m[0],M++,z.pivotData[M-1]=e,M++,L.frontDataIndex=C,1===L.writeFlag&&o(`total ecs transfer in matrix reduction=${C}`),Z(C);break}}}(t,a,c,e);for(let e=0;e<t.nodesXCoordinates.length;e++)J.solutionVector[e]=L.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?o(`${u[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`):o(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),s("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:J.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function Q(e,t,n,o){const s=H.currentElementIndex-1;if(s<0||s>=e.totalElements)return i(`Skipping out-of-range elementIndex=${s} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:s,nop:J.nodalNumbering,meshData:e,basisFunctions:U,FEAData:t,solutionVector:L.currentSolutionVector,eikonalActivationFlag:L.eikonalActivationFlag});let d=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),c=Array(t.nodesPerElement).fill(0);if(o===j){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===s))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:i}=t,r=n.imposeConvectionBoundaryConditionsFront(s,e.nodesXCoordinates,e.nodesYCoordinates,o,i,U);d=r.localJacobianMatrix,c=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)H.localJacobianMatrix[e][n]=r[e][n]+d[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;J.globalResidualVector[t]+=a[e]+c[e]}return!0}function Z(e){for(let e=0;e<L.totalNodes;e++)L.globalSolutionVector[e]=J.boundaryValues[e];for(let t=1;t<=L.totalNodes;t++){e-=4;let n=z.frontValues[e-1],o=z.frontValues[e],s=z.frontValues[e+1];if(z.frontValues[e+2],1===t)e--,z.columnHeaders[0]=z.frontValues[e-1],e--,z.pivotRow[0]=z.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)z.columnHeaders[t]=z.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)z.pivotRow[t]=z.frontValues[e-1+t]}let i=Math.abs(z.columnHeaders[s-1]);if(J.nodeConstraintCode[i-1]>0)continue;let r=0;z.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=z.pivotRow[e]*L.globalSolutionVector[Math.abs(z.columnHeaders[e])-1];L.globalSolutionVector[i-1]=r+J.globalResidualVector[n-1],J.nodeConstraintCode[i-1]=1}1===L.writeFlag&&o(`value of frontDataCounter after backsubstitution=${e}`)}function ee(t,n={}){let o=0,r=!1,a=0,l=[],d=[],c=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,d[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(d=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<d.length;e++)d[e]=Number(d[e])+Number(l[e]);if("frontal"===n.solverMethod){l=_(K,n.meshData,n.boundaryConditions,{solutionVector:d,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:c,residualVector:u}=t(n.meshData,n.boundaryConditions,d,n.eikonalActivationFlag));l=A(n.solverMethod,c,u).solutionVector}if(o=e(l),s(`Newton-Raphson iteration ${a+1}: Error norm = ${o.toExponential(4)}`),o<=h)r=!0;else if(o>100){i(`Solution not converged. Error norm: ${o}`);break}a++}return{solutionVector:d,converged:r,iterations:a,jacobianMatrix:c,residualVector:u}}class te{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const n=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,o(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];o(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<n;e++)t[s][e]=0;t[s][s]=1,e[s]=0,o("Pinned pressure at first pressure node (p = 0) to remove null space")}}}class ne{constructor(){this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,r("FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE"),s("FEAScriptModel instance created")}setSolverConfig(e,t={}){this.solverConfig=e,r("setSolverConfig() is deprecated. Use setModelConfig() instead"),void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,o("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,o(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,o(`tolerance set to ${this.tolerance}`)),o(`solverConfig set to ${e}`)}setModelConfig(e,t={}){this.setSolverConfig(e,t)}setMeshConfig(e){this.meshConfig=e,o(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,o(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,o(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],n=[],r=[],a=[];s("Preparing mesh...");const l=S(this.meshConfig);s("Mesh preparation completed");const d={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=_(j,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:n}=q(l,this.boundaryConditions));r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let o=0;const s=5,i={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:o,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;o<=1;){i.eikonalActivationFlag=o,r.length>0&&(i.initialSolution=[...r]);const e=ee(G,i);t=e.jacobianMatrix,n=e.residualVector,r=e.solutionVector,o+=1/s}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)i("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:n}=function(e,t,n){s("Starting general form PDE matrix assembly...");const{nodesXCoordinates:o,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,meshDimension:c,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=I(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:E,basisFunctions:v,gaussPoints:C,gaussWeights:M,nodesPerElement:D}=g;if("1D"===c)for(let e=0;e<d;e++){for(let t=0;t<D;t++)E[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=v.getBasisFunctions(C[e]),{detJacobian:s,basisFunctionDerivX:i}=T({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:E,nodesPerElement:D});let r=0;for(let e=0;e<D;e++)r+=o[E[e]]*t[e];const a=m(r),l=h(r),d=f(r),c=p(r);for(let n=0;n<D;n++){const o=E[n];b[o]-=M[e]*s*c*t[n];for(let r=0;r<D;r++){const c=E[r];y[o][c]+=M[e]*s*a*i[n]*i[r],y[o][c]-=M[e]*s*l*i[r]*t[n],y[o][c]-=M[e]*s*d*t[n]*t[r]}}}}else"2D"===c&&i("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new W(t,l,a,c,u).imposeDirichletBoundaryConditions(b,y),s("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){s("Starting creeping flow matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,totalNodes:c,meshDimension:u,elementOrder:m}=e;"2D"!==u&&i("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&i("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=c,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<d;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,E=2*h+y;o(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${E} total DOFs`);let v=[],C=[];for(let e=0;e<E;e++){v[e]=0,C.push([]);for(let t=0;t<E;t++)C[e][t]=0}const M=new N({meshDimension:"2D",elementOrder:"quadratic"}),D=new N({meshDimension:"2D",elementOrder:"linear"});let $=new P({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),F=$.gaussPoints,x=$.gaussWeights;for(let e=0;e<d;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let o=[];for(let t=0;t<4;t++){const n=a[e][f[t]]-1;o[t]=p.get(n)}for(let e=0;e<F.length;e++)for(let s=0;s<F.length;s++){const i=M.getBasisFunctions(F[e],F[s]),a=D.getBasisFunctions(F[e],F[s]),l=k({basisFunction:i.basisFunction,basisFunctionDerivKsi:i.basisFunctionDerivKsi,basisFunctionDerivEta:i.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=l,m=x[e]*x[s]*d;for(let e=0;e<9;e++){let n=t[e],s=n,i=h+n;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(c[e]*c[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let n=2*h+o[t],r=m*a.basisFunction[t]*c[e],l=m*a.basisFunction[t]*u[e];C[s][n]+=r,C[i][n]+=l,C[n][s]+=-r,C[n][i]+=-l}}}}return new te(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(v,C),s("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:v,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,n=a.residualVector;r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:d}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],o=[],r=[];s("Preparing mesh...");const a=S(this.meshConfig);s("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:o}=q(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:s}=await w("jacobi-gpu",n,o,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=s}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}}const oe=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const n={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,d=0,c={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},E=null,v=null,C=0,M=0,D=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",v="counts",r++;continue}if("$EndEntities"===e){i="",E=null,v=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const o=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(o[0]),t.ascii="0"===o[1],t.fltBytes=o[2];else if("physicalNames"===i){const e=parseInt(o[0],10),n=parseInt(o[1],10);let s=o.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:n,dimension:e,name:s})}else if("entities"===i)if("counts"===v)E={points:parseInt(o[0],10),curves:parseInt(o[1],10),surfaces:parseInt(o[2],10),volumes:parseInt(o[3],10)},v="points";else if("points"===v)C++,C===E.points&&(v="curves");else if("curves"===v){const e=parseInt(o[0],10),t=parseInt(o[7],10),s=o.slice(8,8+t).map((e=>parseInt(e,10)));n.curves[e]=s,M++,M===E.curves&&(v="surfaces")}else"surfaces"===v&&(D++,D===E.surfaces&&(v="volumes"));else if("nodes"===i){if(0===a)a=parseInt(o[0],10),l=parseInt(o[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(d<a&&0===c.numNodes)c={dim:parseInt(o[0],10),tag:parseInt(o[1],10),parametric:parseInt(o[2],10),numNodes:parseInt(o[3],10)},u=[],m=0,h=0;else if(m<c.numNodes){for(let e of o)if(u.push(parseInt(e,10)),m++,m===c.numNodes)break}else if(h<c.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(o[0]),t.nodesYCoordinates[e]=parseFloat(o[1]),t.totalNodesX++,t.totalNodesY++,h++,h===c.numNodes&&(d++,c={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(o[0],10),parseInt(o[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(o[0],10),tag:parseInt(o[1],10),elementType:parseInt(o[2],10),numElements:parseInt(o[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=o.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=n.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),o(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t};function se(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(S(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),d=Math.max(...s),c=Math.min(...i),u=(Math.max(...i)-c)/(d-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}}function ie(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=S(e.meshConfig),l=new N({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],d=[],c=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(c*m),f=Math.round(u*m),p=c/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),d[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],d[e]=d[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,d[t]=d[0];for(let e=1;e<f;e++)r[t+e]=r[t],d[t+e]=d[t]+e*g}b=new Array(h*f).fill(null);const y=function(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:d,elementOrder:c}=e;"1D"===d?("linear"===c||"quadratic"===c)&&(t={0:[0],1:[1]}):"2D"===d&&("linear"===c?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===c&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let d=0;d<l[e].length;d++){n[s]=l[e][d],s++;const[c,u]=l[e][d];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[c][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}(a),{nodeNeighbors:E,neighborCount:v}=function(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}(a);let C=0;for(let n=0;n<h*f;n++){if(!le(r[n],d[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<v[i];s++){let c=E[i][s];const u=re(e,a,t,c,r[n],d[n],l);if(u.inside){C=c,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=re(e,a,t,s,r[n],d[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let M=Math.min(window.innerWidth,700),D=u/c,$=Math.min(M,600),F=$*D,x={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:$,height:F,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},A={x:r,y:d,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[A],x,{responsive:!0}),console.timeEnd("plottingTime")}}function re(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=Y(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:ae(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=Y(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:ae(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function ae(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let d,c=r.getBasisFunctions(s,i).basisFunction;d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function le(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}class de{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js",import.meta.url),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=g(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}}const ce="0.2.0";export{ne as FEAScriptModel,de as FEAScriptWorker,oe as importGmshQuadTri,n as logSystem,ie as plotInterpolatedSolution,se as plotSolution,ce as printVersion};
+ */
+const r=Symbol("Comlink.proxy"),a=Symbol("Comlink.endpoint"),l=Symbol("Comlink.releaseProxy"),d=Symbol("Comlink.finalizer"),c=Symbol("Comlink.thrown"),u=e=>"object"==typeof e&&null!==e||"function"==typeof e,m=new Map([["proxy",{canHandle:e=>u(e)&&e[r],serialize(e){const{port1:t,port2:n}=new MessageChannel;return h(e,t),[n,[n]]},deserialize:e=>(e.start(),p(e))}],["throw",{canHandle:e=>u(e)&&c in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function h(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:a,path:l}=Object.assign({path:[]},s.data),u=(s.data.argumentList||[]).map(F);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(a){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=F(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,u);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[r]:!0})}(new n(...u));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;h(e,n),m=function(e,t){return D.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[c]:0}}Promise.resolve(m).catch((e=>({value:e,[c]:0}))).then((n=>{const[s,r]=M(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),r),"RELEASE"===a&&(t.removeEventListener("message",o),f(t),d in e&&"function"==typeof e[d]&&e[d]())})).catch((e=>{const[n,o]=M({value:new TypeError("Unserializable return value"),[c]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function f(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function p(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),E(e,n,[],t)}function g(e){if(e)throw new Error("Proxy has been released and is not useable")}function b(e){return $(e,new Map,{type:"RELEASE"}).then((()=>{f(e)}))}const y=new WeakMap,v="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(y.get(e)||0)-1;y.set(e,t),0===t&&b(e)}));function E(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(g(s),r===l)return()=>{!function(e){v&&v.unregister(e)}(i),b(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=$(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then(F);return o.then.bind(o)}return E(e,t,[...n,r])},set(o,i,r){g(s);const[a,l]=M(r);return $(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then(F)},apply(o,i,r){g(s);const l=n[n.length-1];if(l===a)return $(e,t,{type:"ENDPOINT"}).then(F);if("bind"===l)return E(e,t,n.slice(0,-1));const[d,c]=C(r);return $(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:d},c).then(F)},construct(o,i){g(s);const[r,a]=C(i);return $(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then(F)}});return function(e,t){const n=(y.get(t)||0)+1;y.set(t,n),v&&v.register(e,t,e)}(i,e),i}function C(e){const t=e.map(M);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const D=new WeakMap;function M(e){for(const[t,n]of m)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},D.get(e)||[]]}function F(e){switch(e.type){case"HANDLER":return m.get(e.name).deserialize(e.value);case"RAW":return e.value}}function $(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function w(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let d=[],c=!0,u=0;if(s(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),o=math.slu(e,1,1);let s=math.lusolve(o,n);d=math.squeeze(s).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,n,new Array(n.length).fill(0),{maxIterations:a,tolerance:l});e.converged?o(`Jacobi method converged in ${e.iterations} iterations`):i(`Jacobi method did not converge after ${e.iterations} iterations`),d=e.solutionVector,c=e.converged,u=e.iterations}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s("System solved successfully"),{solutionVector:d,converged:c,iterations:u}}async function A(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;s(`Solving system using ${e}...`),console.time("systemSolving");const d=Array.isArray(t)?t:t?.toArray?.()??t,c=Array.isArray(n)?n:n?.toArray?.()??n;let u,m=null,h=null,f=[],g=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js",import.meta.url),{type:"module"}),t=p(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(c.length).fill(0);let t;t=await h.webgpuJacobiSolver(d,c,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,g=t.converged,u=t.iterations,g?o(`Jacobi method converged in ${u} iterations`):i(`Jacobi method did not converge after ${u} iterations`)}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:g,iterations:u}}class x{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],s=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void i("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,s[0]=-1*r(e),s[1]=1*r(e),s[2]=-1*e,s[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function d(e){return 2*e**2-e}function c(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*d(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*d(t),n[6]=d(e)*a(t),n[7]=d(e)*l(t),n[8]=d(e)*d(t),o[0]=c(e)*a(t),o[1]=c(e)*l(t),o[2]=c(e)*d(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*d(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*d(t),s[0]=a(e)*c(t),s[1]=a(e)*u(t),s[2]=a(e)*m(t),s[3]=l(e)*c(t),s[4]=l(e)*u(t),s[5]=l(e)*m(t),s[6]=d(e)*c(t),s[7]=d(e)*u(t),s[8]=d(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:s}}}class N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=o,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(s("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||i("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,o("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&i("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(o("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const n=t[0],s=t[1];o(`Processing boundary node pair: [${n}, ${s}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const i=this.parsedMesh.nodalNumbering[t];if(4===i.length){if(i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&2===d||2===l&&0===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===d||1===l&&0===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===d||3===l&&1===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===d||3===l&&2===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===i.length&&i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&6===d||6===l&&0===d||0===l&&3===d||3===l&&0===d||3===l&&6===d||6===l&&3===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===d||2===l&&0===d||0===l&&1===d||1===l&&0===d||1===l&&2===d||2===l&&1===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===d||8===l&&2===d||2===l&&5===d||5===l&&2===d||5===l&&8===d||8===l&&5===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===d||8===l&&6===d||6===l&&7===d||7===l&&6===d||7===l&&8===d||8===l&&7===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||i(`Could not find element containing boundary nodes ${n} and ${s}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class k extends N{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||i("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,n;if("linear"===this.elementOrder){t=this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class P extends N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:s="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:s,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||i("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let n,s,i,r;if("linear"===this.elementOrder){n=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r}}else if("quadratic"===this.elementOrder){n=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i/2,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const o=Math.PI/180,i=Math.tan(this.angleLeft*o),r=Math.tan(this.angleRight*o),a=1e-12;for(let o=0;o<s;o++){const l=t[o],d=Math.abs(i)<a?0:l/i,c=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<n;t++){const i=1===n?0:t/(n-1);e[t*s+o]=d+(c-d)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),o("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:n,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class O{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function V(e){const{meshDimension:t,numElementsX:n,numElementsY:s,maxX:r,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}=e;let m;"1D"===t?m=new k({numElementsX:n,maxX:r,elementOrder:l,parsedMesh:d}):"2D"===t?m=new P({numElementsX:n,maxX:r,numElementsY:s,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}):i("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,v=h.boundaryElements;let E,C;return null!=d?(E=y.length,C=f.length,o(`Using parsed mesh with ${E} elements and ${C} nodes`)):(E=n*("2D"===t?s:1),C=g*("2D"===t?b:1),o(`Using mesh generated from geometry with ${E} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:v,totalElements:E,totalNodes:C,meshDimension:t,elementOrder:l}}function X(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new x({meshDimension:o,elementOrder:s});let l=new O({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function I(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,d=[];for(let e=0;e<i;e++)d[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:d}}function S(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,d=0,c=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],d+=i[r[e]]*t[e],c+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=c*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(c*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:d,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function T(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function R(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=T(e,t,o),r=T(e,t,s),a=i.inside||r.inside;let l=0,d=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),c=a(o,s),u=a(i,r),m=a(o,i);l=c/(c+u),d=m/(m+a(s,r))}return{inside:a,ksi:l,eta:d}}function Y(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}function B(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:d,elementOrder:c}=e;"1D"===d?("linear"===c||"quadratic"===c)&&(t={0:[0],1:[1]}):"2D"===d&&("linear"===c?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===c&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let d=0;d<l[e].length;d++){n[s]=l[e][d],s++;const[c,u]=l[e][d];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[c][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}class j{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,n,s,i,r,a){let l=[],d=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],d[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("convection"===this.boundaryConditions[n][0]){const s=l[n],i=d[n];o(`Boundary ${n}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[n].forEach((([n,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[n][a]-1;o(`  - Applied convection boundary condition to node ${l+1} (element ${n+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((c=>{if("convection"===this.boundaryConditions[c][0]){const u=l[c],m=d[c];o(`Boundary ${c}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[c].forEach((([l,d])=>{if("linear"===this.elementOrder){let c,h,f,p,g;0===d?(c=n[0],h=0,f=0,p=3,g=2):1===d?(c=0,h=n[0],f=0,p=2,g=1):2===d?(c=n[0],h=1,f=1,p=4,g=2):3===d&&(c=1,h=n[0],f=2,p=4,g=1);let b=a.getBasisFunctions(c,h),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const $=this.nop[l].length;for(let e=0;e<$;e++){const t=this.nop[l][e]-1;0===d||2===d?(C+=i[t]*v[e],D+=r[t]*v[e]):1!==d&&3!==d||(M+=i[t]*E[e],F+=r[t]*E[e])}let w;w=0===d||2===d?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let n=f;n<p;n+=g){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[0]*w*y[n]*u*m;for(let e=f;e<p;e+=g){let o=this.nop[l][e]-1;t[i][o]+=-s[0]*w*y[n]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let c=0;c<3;c++){let h,f,p,g,b;0===d?(h=n[c],f=0,p=0,g=7,b=3):1===d?(h=0,f=n[c],p=0,g=3,b=1):2===d?(h=n[c],f=1,p=2,g=9,b=3):3===d&&(h=1,f=n[c],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),v=y.basisFunction,E=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,D=0,M=0,F=0,$=0;const w=this.nop[l].length;for(let e=0;e<w;e++){const t=this.nop[l][e]-1;0===d||2===d?(D+=i[t]*E[e],M+=r[t]*E[e]):1!==d&&3!==d||(F+=i[t]*C[e],$+=r[t]*C[e])}let A;A=0===d||2===d?Math.sqrt(D**2+M**2):Math.sqrt(F**2+$**2);for(let n=p;n<g;n+=b){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[c]*A*v[n]*u*m;for(let e=p;e<g;e+=b){let o=this.nop[l][e]-1;t[i][o]+=-s[c]*A*v[n]*v[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,n,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const d=this.nop[e].length,c=Array(d).fill().map((()=>Array(d).fill(0))),u=Array(d).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];o(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),o(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,c[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let o,l,m,p,g;0===a?(o=s[0],l=0,m=0,p=3,g=2):1===a?(o=0,l=s[0],m=0,p=2,g=1):2===a?(o=s[0],l=1,m=1,p=4,g=2):3===a&&(o=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(o,l),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta;let C,D=0,M=0,F=0,$=0;for(let o=0;o<d;o++){const s=this.nop[e][o]-1;0===a||2===a?(D+=t[s]*v[o],M+=n[s]*v[o]):1!==a&&3!==a||(F+=t[s]*E[o],$+=n[s]*E[o])}C=0===a||2===a?Math.sqrt(D**2+M**2):Math.sqrt(F**2+$**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let o=0;o<3;o++){let l,d,m,p,g;0===a?(l=s[o],d=0,m=0,p=7,g=3):1===a?(l=0,d=s[o],m=0,p=3,g=1):2===a?(l=s[o],d=1,m=2,p=9,g=3):3===a&&(l=1,d=s[o],m=6,p=9,g=1);let b=r.getBasisFunctions(l,d),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const $=this.nop[e].length;for(let o=0;o<$;o++){const s=this.nop[e][o]-1;0===a||2===a?(C+=t[s]*v[o],D+=n[s]*v[o]):1!==a&&3!==a||(M+=t[s]*E[o],F+=n[s]*E[o])}let w;w=0===a||2===a?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[o]*w*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[o]*w*y[e]*y[t]*h}}}}return{localJacobianMatrix:c,localResidualVector:u}}}function q(e,t){s("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:o,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:d}=e,c=X(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=c;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const s=f.getBasisFunctions(p[e],p[t]),i=S({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:o,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new j(t,r,i,l,d);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,o,f),y.imposeConstantTempBoundaryConditions(u,m),s("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function W({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:d,meshDimension:c}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===c)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:d}=I({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(d[t]*d[n])}else if("2D"===c)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=S({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c,nodesXCoordinates:l,nodesYCoordinates:d,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class G{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function K(e,t,n,i){s("Starting front propagation matrix assembly...");let r=1-i+.01;o(`eikonalViscousTerm: ${r}`),o(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:d,boundaryElements:c,totalElements:u,meshDimension:m,elementOrder:h}=e,f=X(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:v,gaussWeights:E,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=d[e][t]-1;for(let e=0;e<v.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(v[e]);const o=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:s,basisFunctionDerivX:i}=o;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=n[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<v.length;t++){let o=y.getBasisFunctions(v[e],v[t]);const s=S({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=s,m=o.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=n[b[e]]*c[e],f+=n[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*E[e]*E[t]*d*c[n]*h+r*E[e]*E[t]*d*u[n]*f,0!==i&&(p[o]+=i*(E[e]*E[t]*d*m[n]*Math.sqrt(h**2+f**2)-E[e]*E[t]*d*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*E[e]*E[t]*d*(c[n]*c[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-d*h*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*c[s]-i*(d*f*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new G(t,c,d,m,h).imposeDirichletBoundaryConditions(p,g),s("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function L({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:d}=s,{nodesXCoordinates:c,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(d).fill().map((()=>Array(d).fill(0))),p=Array(d).fill(0),g=Array(d),b=Array(d);for(let n=0;n<d;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=I({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:c,localToGlobalMap:b,nodesPerElement:d}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<d;e++)l+=i[b[e]]*r[e];for(let e=0;e<d;e++){b[e];for(let e=0;e<d;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:v}=S({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:c,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:d});let E=0,C=0;for(let e=0;e<d;e++)E+=i[b[e]]*y[e],C+=i[b[e]]*v[e];for(let o=0;o<d;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*E+h*l[e]*l[t]*g*v[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(E**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<d;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+v[o]*v[s]),0!==r&&(f[o][s]+=r*(-g*E*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*v[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const J={},H={},U={currentElementIndex:0},z={};let _;function Q(e,t,n,r={}){const a=X(t),l=t.nodesXCoordinates.length,d=t.totalElements;!function(e,t){J.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),J.nodeConstraintCode=Array(e).fill(0),J.boundaryValues=Array(e).fill(0),J.globalResidualVector=Array(e).fill(0),J.solutionVector=Array(e).fill(0),J.topologyData=Array(t).fill(0),J.lateralData=Array(t).fill(0),H.writeFlag=0,H.totalNodes=e,H.transformationFlag=0,H.nodesPerElement=Array(t).fill(0),H.determinant=1;const n=Math.max(e,2e3);H.globalSolutionVector=Array(n).fill(0),H.frontDataIndex=0,U.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),U.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);z.frontValues=Array(o).fill(0),z.columnHeaders=Array(n).fill(0),z.pivotRow=Array(n).fill(0),z.pivotData=Array(o).fill(0)}(a.nodesPerElement,d),s("Solving system using frontal..."),console.time("systemSolving"),_=new x({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)J.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)J.nodeConstraintCode[e]=0,J.boundaryValues[e]=0;let c;e===W?(c=new j(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantTempBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues)):e===L&&(c=new G(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantValueBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)J.globalResidualVector[e]=0;H.totalNodes=t.nodesXCoordinates.length,H.writeFlag=0,H.transformationFlag=1,H.determinant=1;for(let e=0;e<t.totalElements;e++)H.nodesPerElement[e]=a.nodesPerElement;H.currentSolutionVector=r.solutionVector,H.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,n,s){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,H.globalSolutionVector.length);let d,c=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),v=Array(a).fill(0),E=Array(a).fill(0),C=1;H.writeFlag++;let D=1,M=1;U.currentElementIndex=0;for(let e=0;e<H.totalNodes;e++)y[e]=0,v[e]=0;if(0!==H.transformationFlag){for(let e=0;e<H.totalNodes;e++)E[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<H.nodesPerElement[t];e++){let n=J.nodalNumbering[t][e];0===E[n-1]&&(E[n-1]=1,J.nodalNumbering[t][e]=-J.nodalNumbering[t][e])}}}H.transformationFlag=0;let F=0,$=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,E=0,w=0;if(U.currentElementIndex<r&&(U.currentElementIndex++,a=Z(e,t,n,s)),a){const e=U.currentElementIndex;E=H.nodesPerElement[e-1],w=H.nodesPerElement[e-1];for(let t=0;t<w;t++){let n,o,s=J.nodalNumbering[e-1][t];if(0===F)F++,c[t]=F,z.columnHeaders[F-1]=s;else{for(n=0;n<F&&Math.abs(s)!==Math.abs(z.columnHeaders[n]);n++);n===F?(F++,c[t]=F,z.columnHeaders[F-1]=s):(c[t]=n+1,z.columnHeaders[n]=s)}if(0===$)$++,u[t]=$,m[$-1]=s;else{for(o=0;o<$&&Math.abs(s)!==Math.abs(m[o]);o++);o===$?($++,u[t]=$,m[$-1]=s):(u[t]=o+1,m[o]=s)}}if($>l||F>l)return void i("Error: systemSize not large enough");for(let e=0;e<w;e++){let t=c[e];for(let n=0;n<E;n++){b[u[n]-1][t-1]+=U.localJacobianMatrix[n][e]}}}let A=0;for(let e=0;e<F;e++)z.columnHeaders[e]<0&&(f[A]=e+1,A++);let x=0,N=0;for(let e=0;e<$;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===J.nodeConstraintCode[n-1]&&(p[x]=e+1,x++,J.nodeConstraintCode[n-1]=2,J.globalResidualVector[n-1]=J.boundaryValues[n-1])}}if(x>0)for(let e=0;e<x;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<F;e++){b[t][e]=0,Math.abs(z.columnHeaders[e])===n&&(b[t][e]=1)}}if(A>M||U.currentElementIndex<r){if(0===A)return void i("Error: no more rows fully summed");let e=h[0],t=f[0],n=b[e-1][t-1];if(Math.abs(n)<1e-4){n=0;for(let o=0;o<A;o++){let s=f[o];for(let o=0;o<N;o++){let i=h[o],r=b[i-1][s-1];Math.abs(r)>Math.abs(n)&&(n=r,t=s,e=i)}}}let s=Math.abs(m[e-1]);d=Math.abs(z.columnHeaders[t-1]);let a=s+d+y[s-1]+v[d-1];H.determinant=H.determinant*n*(-1)**a/Math.abs(n);for(let e=0;e<H.totalNodes;e++)e>=s&&y[e]--,e>=d&&v[e]--;if(Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${U.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;for(let t=0;t<F;t++)z.pivotRow[t]=b[e-1][t]/n;let l=J.globalResidualVector[s-1]/n;if(J.globalResidualVector[s-1]=l,g[e-1]=n,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*z.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n][e-1]=b[n][e]-o*z.pivotRow[e];J.globalResidualVector[e-1]-=o*l}if(e<$)for(let n=e;n<$;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*z.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n-1][e-1]=b[n][e]-o*z.pivotRow[e];J.globalResidualVector[e-1]-=o*l}for(let e=0;e<$;e++)z.pivotData[D+e-1]=g[e];D+=$;for(let e=0;e<$;e++)z.pivotData[D+e-1]=m[e];D+=$,z.pivotData[D-1]=e,D++;for(let e=0;e<F;e++)z.frontValues[C-1+e]=z.pivotRow[e];C+=F;for(let e=0;e<F;e++)z.frontValues[C-1+e]=z.columnHeaders[e];C+=F,z.frontValues[C-1]=s,z.frontValues[C]=F,z.frontValues[C+1]=t,z.frontValues[C+2]=n,C+=4;for(let e=0;e<$;e++)b[e][F-1]=0;for(let e=0;e<F;e++)b[$-1][e]=0;if(F--,t<F+1)for(let e=t-1;e<F;e++)z.columnHeaders[e]=z.columnHeaders[e+1];if($--,e<$+1)for(let t=e-1;t<$;t++)m[t]=m[t+1];if($>1||U.currentElementIndex<r)continue;if(d=Math.abs(z.columnHeaders[0]),e=1,n=b[0][0],s=Math.abs(m[0]),t=1,a=s+d+y[s-1]+v[d-1],H.determinant=H.determinant*n*(-1)**a/Math.abs(n),z.pivotRow[0]=1,Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${U.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;J.globalResidualVector[s-1]=J.globalResidualVector[s-1]/n,z.frontValues[C-1]=z.pivotRow[0],C++,z.frontValues[C-1]=z.columnHeaders[0],C++,z.frontValues[C-1]=s,z.frontValues[C]=F,z.frontValues[C+1]=t,z.frontValues[C+2]=n,C+=4,z.pivotData[D-1]=g[0],D++,z.pivotData[D-1]=m[0],D++,z.pivotData[D-1]=e,D++,H.frontDataIndex=C,1===H.writeFlag&&o(`total ecs transfer in matrix reduction=${C}`),ee(C);break}}}(t,a,c,e);for(let e=0;e<t.nodesXCoordinates.length;e++)J.solutionVector[e]=H.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?o(`${u[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`):o(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),s("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:J.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function Z(e,t,n,o){const s=U.currentElementIndex-1;if(s<0||s>=e.totalElements)return i(`Skipping out-of-range elementIndex=${s} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:s,nop:J.nodalNumbering,meshData:e,basisFunctions:_,FEAData:t,solutionVector:H.currentSolutionVector,eikonalActivationFlag:H.eikonalActivationFlag});let d=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),c=Array(t.nodesPerElement).fill(0);if(o===W){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===s))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:i}=t,r=n.imposeConvectionBoundaryConditionsFront(s,e.nodesXCoordinates,e.nodesYCoordinates,o,i,_);d=r.localJacobianMatrix,c=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)U.localJacobianMatrix[e][n]=r[e][n]+d[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;J.globalResidualVector[t]+=a[e]+c[e]}return!0}function ee(e){for(let e=0;e<H.totalNodes;e++)H.globalSolutionVector[e]=J.boundaryValues[e];for(let t=1;t<=H.totalNodes;t++){e-=4;let n=z.frontValues[e-1],o=z.frontValues[e],s=z.frontValues[e+1];if(z.frontValues[e+2],1===t)e--,z.columnHeaders[0]=z.frontValues[e-1],e--,z.pivotRow[0]=z.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)z.columnHeaders[t]=z.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)z.pivotRow[t]=z.frontValues[e-1+t]}let i=Math.abs(z.columnHeaders[s-1]);if(J.nodeConstraintCode[i-1]>0)continue;let r=0;z.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=z.pivotRow[e]*H.globalSolutionVector[Math.abs(z.columnHeaders[e])-1];H.globalSolutionVector[i-1]=r+J.globalResidualVector[n-1],J.nodeConstraintCode[i-1]=1}1===H.writeFlag&&o(`value of frontDataCounter after backsubstitution=${e}`)}function te(t,n={}){let o=0,r=!1,a=0,l=[],d=[],c=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,d[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(d=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<d.length;e++)d[e]=Number(d[e])+Number(l[e]);if("frontal"===n.solverMethod){l=Q(L,n.meshData,n.boundaryConditions,{solutionVector:d,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:c,residualVector:u}=t(n.meshData,n.boundaryConditions,d,n.eikonalActivationFlag));l=w(n.solverMethod,c,u).solutionVector}if(o=e(l),s(`Newton-Raphson iteration ${a+1}: Error norm = ${o.toExponential(4)}`),o<=h)r=!0;else if(o>100){i(`Solution not converged. Error norm: ${o}`);break}a++}return{solutionVector:d,converged:r,iterations:a,jacobianMatrix:c,residualVector:u}}class ne{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const n=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,o(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];o(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<n;e++)t[s][e]=0;t[s][s]=1,e[s]=0,o("Pinned pressure at first pressure node (p = 0) to remove null space")}}}class oe{constructor(){var e;this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,e="FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE",console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;"),s("FEAScriptModel instance created")}setModelConfig(e,t={}){this.solverConfig=e,void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,o("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,o(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,o(`tolerance set to ${this.tolerance}`)),o(`solverConfig set to ${e}`)}setMeshConfig(e){this.meshConfig=e,o(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,o(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,o(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],n=[],r=[],a=[];s("Preparing mesh...");const l=V(this.meshConfig);s("Mesh preparation completed");const d={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=Q(W,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:n}=q(l,this.boundaryConditions));r=w(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let o=0;const s=5,i={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:o,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;o<=1;){i.eikonalActivationFlag=o,r.length>0&&(i.initialSolution=[...r]);const e=te(K,i);t=e.jacobianMatrix,n=e.residualVector,r=e.solutionVector,o+=1/s}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)i("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:n}=function(e,t,n){s("Starting general form PDE matrix assembly...");const{nodesXCoordinates:o,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,meshDimension:c,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=X(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:v,basisFunctions:E,gaussPoints:C,gaussWeights:D,nodesPerElement:M}=g;if("1D"===c)for(let e=0;e<d;e++){for(let t=0;t<M;t++)v[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=E.getBasisFunctions(C[e]),{detJacobian:s,basisFunctionDerivX:i}=I({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:v,nodesPerElement:M});let r=0;for(let e=0;e<M;e++)r+=o[v[e]]*t[e];const a=m(r),l=h(r),d=f(r),c=p(r);for(let n=0;n<M;n++){const o=v[n];b[o]-=D[e]*s*c*t[n];for(let r=0;r<M;r++){const c=v[r];y[o][c]+=D[e]*s*a*i[n]*i[r],y[o][c]-=D[e]*s*l*i[r]*t[n],y[o][c]-=D[e]*s*d*t[n]*t[r]}}}}else"2D"===c&&i("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new G(t,l,a,c,u).imposeDirichletBoundaryConditions(b,y),s("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=w(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){s("Starting creeping flow matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,totalNodes:c,meshDimension:u,elementOrder:m}=e;"2D"!==u&&i("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&i("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=c,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<d;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,v=2*h+y;o(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${v} total DOFs`);let E=[],C=[];for(let e=0;e<v;e++){E[e]=0,C.push([]);for(let t=0;t<v;t++)C[e][t]=0}const D=new x({meshDimension:"2D",elementOrder:"quadratic"}),M=new x({meshDimension:"2D",elementOrder:"linear"});let F=new O({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),$=F.gaussPoints,w=F.gaussWeights;for(let e=0;e<d;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let o=[];for(let t=0;t<4;t++){const n=a[e][f[t]]-1;o[t]=p.get(n)}for(let e=0;e<$.length;e++)for(let s=0;s<$.length;s++){const i=D.getBasisFunctions($[e],$[s]),a=M.getBasisFunctions($[e],$[s]),l=S({basisFunction:i.basisFunction,basisFunctionDerivKsi:i.basisFunctionDerivKsi,basisFunctionDerivEta:i.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=l,m=w[e]*w[s]*d;for(let e=0;e<9;e++){let n=t[e],s=n,i=h+n;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(c[e]*c[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let n=2*h+o[t],r=m*a.basisFunction[t]*c[e],l=m*a.basisFunction[t]*u[e];C[s][n]+=r,C[i][n]+=l,C[n][s]+=-r,C[n][i]+=-l}}}}return new ne(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(E,C),s("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:E,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,n=a.residualVector;r=w(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:d}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],o=[],r=[];s("Preparing mesh...");const a=V(this.meshConfig);s("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:o}=q(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:s}=await A("jacobi-gpu",n,o,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=s}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}}const se=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const n={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,d=0,c={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},v=null,E=null,C=0,D=0,M=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",E="counts",r++;continue}if("$EndEntities"===e){i="",v=null,E=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const o=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(o[0]),t.ascii="0"===o[1],t.fltBytes=o[2];else if("physicalNames"===i){const e=parseInt(o[0],10),n=parseInt(o[1],10);let s=o.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:n,dimension:e,name:s})}else if("entities"===i)if("counts"===E)v={points:parseInt(o[0],10),curves:parseInt(o[1],10),surfaces:parseInt(o[2],10),volumes:parseInt(o[3],10)},E="points";else if("points"===E)C++,C===v.points&&(E="curves");else if("curves"===E){const e=parseInt(o[0],10),t=parseInt(o[7],10),s=o.slice(8,8+t).map((e=>parseInt(e,10)));n.curves[e]=s,D++,D===v.curves&&(E="surfaces")}else"surfaces"===E&&(M++,M===v.surfaces&&(E="volumes"));else if("nodes"===i){if(0===a)a=parseInt(o[0],10),l=parseInt(o[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(d<a&&0===c.numNodes)c={dim:parseInt(o[0],10),tag:parseInt(o[1],10),parametric:parseInt(o[2],10),numNodes:parseInt(o[3],10)},u=[],m=0,h=0;else if(m<c.numNodes){for(let e of o)if(u.push(parseInt(e,10)),m++,m===c.numNodes)break}else if(h<c.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(o[0]),t.nodesYCoordinates[e]=parseFloat(o[1]),t.totalNodesX++,t.totalNodesY++,h++,h===c.numNodes&&(d++,c={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(o[0],10),parseInt(o[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(o[0],10),tag:parseInt(o[1],10),elementType:parseInt(o[2],10),numElements:parseInt(o[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=o.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=n.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),o(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t};function ie(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(V(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),d=Math.max(...s),c=Math.min(...i),u=(Math.max(...i)-c)/(d-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}}function re(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=V(e.meshConfig),l=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],d=[],c=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(c*m),f=Math.round(u*m),p=c/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),d[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],d[e]=d[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,d[t]=d[0];for(let e=1;e<f;e++)r[t+e]=r[t],d[t+e]=d[t]+e*g}b=new Array(h*f).fill(null);const y=B(a),{nodeNeighbors:v,neighborCount:E}=Y(a);let C=0;for(let n=0;n<h*f;n++){if(!de(r[n],d[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<E[i];s++){let c=v[i][s];const u=ae(e,a,t,c,r[n],d[n],l);if(u.inside){C=c,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=ae(e,a,t,s,r[n],d[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let D=Math.min(window.innerWidth,700),M=u/c,F=Math.min(D,600),$=F*M,w={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:F,height:$,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},A={x:r,y:d,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[A],w,{responsive:!0}),console.timeEnd("plottingTime")}}function ae(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:le(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:le(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function le(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let d,c=r.getBasisFunctions(s,i).basisFunction;d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function de(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}let ce=null;async function ue(){if(ce)return ce;await import("@kitware/vtk.js/Rendering/Profiles/Geometry.js");const[{default:e},{default:t},{default:n},{default:o},{default:s},{default:i},{default:r},{default:a},{default:l},{default:d}]=await Promise.all([import("@kitware/vtk.js/Rendering/Core/Actor.js"),import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js"),import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js"),import("@kitware/vtk.js/Common/Core/DataArray.js"),import("@kitware/vtk.js/Common/DataModel/ImageData.js"),import("@kitware/vtk.js/Filters/General/ImageMarchingSquares.js"),import("@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js"),import("@kitware/vtk.js/Rendering/Core/Mapper.js"),import("@kitware/vtk.js/Common/DataModel/PolyData.js"),import("@kitware/vtk.js/Rendering/Core/ScalarBarActor.js")]);return ce={vtkActor:e,vtkColorTransferFunction:t,vtkColorMaps:n,vtkDataArray:o,vtkImageData:s,vtkImageMarchingSquares:i,vtkGenericRenderWindow:r,vtkMapper:a,vtkPolyData:l,vtkScalarBarActor:d},ce}const me=new Map;function he(e={}){return{presetName:e.presetName??"Cool to Warm",reverse:e.reverse??!1,showScalarBar:e.showScalarBar??!0,scalarBarTitle:e.scalarBarTitle??"Solution"}}function fe(e={}){return{enabled:e.enabled??!0,numberOfContours:e.numberOfContours??12,color:e.color??[.15,.15,.15],lineWidth:e.lineWidth??1}}async function pe(e,t,n,o,s={}){console.time("plottingTime");const i=e.meshConfig.meshDimension,r=V(e.meshConfig),a=await be(e,t,r,{mode:"1D"===i&&"line"===n?"line":"surface"});await Ee(a,o,e.solverConfig,n,s),console.timeEnd("plottingTime")}async function ge(e,t,n,o,s={}){if(console.time("plottingTime"),"2D"!==e.meshConfig.meshDimension||"contour"!==n){const i=V(e.meshConfig),r=await be(e,t,i,{mode:"1D"===e.meshConfig.meshDimension&&"line"===n?"line":"surface"});return await Ee(r,o,e.solverConfig,n,s),void console.timeEnd("plottingTime")}const i=V(e.meshConfig),r=await async function(e,t,n){const o=await async function(e,t,n){const{nodesXCoordinates:o,nodesYCoordinates:s}=t.nodesCoordinates,i=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});let r=o[0],a=o[0],l=s[0],d=s[0];for(let e=1;e<o.length;e++){const t=o[e],n=s[e];t<r&&(r=t),t>a&&(a=t),n<l&&(l=n),n>d&&(d=n)}const c=a-r,u=d-l,m=50,h=Math.max(2,Math.round(c*m)),f=Math.max(2,Math.round(u*m)),p=c/(h-1),g=u/(f-1),b=h*f,y=new Float32Array(b),v=new Float32Array(b),E=new Float32Array(b);E.fill(Number.NaN);const C=new Uint8Array(b),D=B(n),{nodeNeighbors:M,neighborCount:F}=Y(n);let $=0;for(let o=0;o<h;o++)for(let s=0;s<f;s++){const a=o*f+s,d=r+o*p,c=l+s*g;if(y[a]=d,v[a]=c,!Ne(d,c,D))continue;let u=!1;for(let o=0;o<n.nop[$].length;o++){const s=n.nop[$][o]-1;for(let o=0;o<F[s];o++){const r=M[s][o],l=Ae(e,n,t,r,d,c,i);if(l.inside){$=r,E[a]=l.value,C[a]=1,u=!0;break}}if(u)break}if(!u)for(let o=0;o<n.nop.length;o++){const s=Ae(e,n,t,o,d,c,i);if(s.inside){$=o,E[a]=s.value,C[a]=1;break}}}return{visNodesX:h,visNodesY:f,minX:r,minY:l,deltaX:p,deltaY:g,lengthX:c,lengthY:u,visNodeXCoordinates:y,visNodeYCoordinates:v,visSolution:E,insideMask:C}}(e,t,n),{visNodesX:s,visNodesY:i,minX:r,minY:a,deltaX:l,deltaY:d,visNodeXCoordinates:c,visNodeYCoordinates:u,visSolution:m,insideMask:h}=o,f=De(c,u),p=function(e,t,n){const o=[];for(let s=0;s<e-1;s++)for(let e=0;e<t-1;e++){const i=s*t+e,r=(s+1)*t+e,a=(s+1)*t+(e+1),l=s*t+(e+1);n[i]&&n[r]&&n[a]&&n[l]&&o.push(4,i,r,a,l)}return Uint32Array.from(o)}(s,i,h),g=await Ce(f,m,p,"surface");return{points:f,scalars:m,cells:p,polyData:g,mode:"surface",metadata:{meshDimension:"2D",numberOfPoints:f.length/3,numberOfCells:$e(p),interpolationGrid:{nx:s,ny:i,origin:[r,a],spacing:[l,d],imageScalars:we(m,s,i)}}}}(e,t,i);await Ee(r,o,e.solverConfig,`${n}-interpolated`,s),console.timeEnd("plottingTime")}async function be(e,t,n=null,o={}){const s=n??V(e.meshConfig),{nodesXCoordinates:i,nodesYCoordinates:r}=t.nodesCoordinates,a=Me(t.solutionVector,i.length),l=De(i,r),d=o.mode??"surface",c="line"===d?function(e){if(e<2)return new Uint32Array(0);const t=new Uint32Array(3*(e-1));let n=0;for(let o=0;o<e-1;o++)t[n++]=2,t[n++]=o,t[n++]=o+1;return t}(i.length):function(e){const t=[];for(let n=0;n<e.length;n++){const o=Fe(e[n]);t.push(o.length,...o)}return Uint32Array.from(t)}(s.nop??[]);return{points:l,scalars:a,cells:c,polyData:await Ce(l,a,c,d),mode:d,metadata:{solverConfig:e.solverConfig,meshDimension:e.meshConfig.meshDimension,numberOfPoints:l.length/3,numberOfCells:$e(c)}}}async function ye(e,t,n=null,o={}){return function(e){const{connectivity:t,offsets:n}=function(e){const t=[],n=[];let o=0,s=0;for(;o<e.length;){const i=e[o++];for(let n=0;n<i;n++)t.push(e[o++]);s+=i,n.push(s)}return{connectivity:t,offsets:n}}(e.cells),o=e.points.length/3,s="line"===e.mode,i=s?"Lines":"Polys";return['<?xml version="1.0"?>','<VTKFile type="PolyData" version="0.1" byte_order="LittleEndian">',"  <PolyData>",`    <Piece NumberOfPoints="${o}" NumberOfVerts="0" NumberOfLines="${s?n.length:0}" NumberOfStrips="0" NumberOfPolys="${s?0:n.length}">`,'      <PointData Scalars="solution">',`        <DataArray type="Float32" Name="solution" NumberOfComponents="1" format="ascii">${Array.from(e.scalars).join(" ")}</DataArray>`,"      </PointData>","      <Points>",`        <DataArray type="Float32" NumberOfComponents="3" format="ascii">${Array.from(e.points).join(" ")}</DataArray>`,"      </Points>",`      <${i}>`,`        <DataArray type="Int32" Name="connectivity" format="ascii">${t.join(" ")}</DataArray>`,`        <DataArray type="Int32" Name="offsets" format="ascii">${n.join(" ")}</DataArray>`,`      </${i}>`,"    </Piece>","  </PolyData>","</VTKFile>"].join("\n")}(await be(e,t,n,o))}function ve(e){const{nodesXCoordinates:t,nodesYCoordinates:n}=e.nodesCoordinates,o=Me(e.solutionVector,t.length),s=new Float32Array(3*t.length);for(let e=0;e<t.length;e++){const i=3*e;s[i]=Number(t[e])||0,s[i+1]=Number(n[e])||0,s[i+2]=o[e]}return{features:s,featuresShape:[t.length,3],labels:o,points:De(t,n)}}async function Ee(e,t,n,o,s={}){if("undefined"==typeof document)return void i("vtk.js visualization requires a browser environment");const{vtkActor:r,vtkColorTransferFunction:a,vtkColorMaps:l,vtkGenericRenderWindow:d,vtkMapper:c,vtkScalarBarActor:u}=await ue(),m=document.getElementById(t);if(!m)return void i(`Could not find plot container with id: ${t}`);me.has(t)&&(me.get(t).delete(),me.delete(t)),m.innerHTML="",m.style.position="relative",m.style.width=m.style.width||"100%",m.style.height=m.style.height||"420px";const h=d.newInstance({background:[1,1,1]});h.setContainer(m),h.resize();const f=h.getRenderer(),p=h.getRenderWindow(),g=c.newInstance();g.setInputData(e.polyData),g.setScalarModeToUsePointData(),g.setColorModeToMapScalars(),g.setScalarVisibility(!0);const b=function(e){if(!e?.length)return[0,1];let t=Number.POSITIVE_INFINITY,n=Number.NEGATIVE_INFINITY;for(let o=0;o<e.length;o++){const s=e[o];Number.isFinite(s)&&(s<t&&(t=s),s>n&&(n=s))}return Number.isFinite(t)&&Number.isFinite(n)?t===n?[t-1,n+1]:[t,n]:[0,1]}(e.scalars);g.setScalarRange(b[0],b[1]);const y=s.colorScale??he({}),v=a.newInstance(),E=function(e,t){if(!t||!e?.RGBPoints?.length)return e;const n=e.RGBPoints,o=n[0],s=n[n.length-4],i=[];for(let e=n.length-4;e>=0;e-=4)i.push(s-(n[e]-o),n[e+1],n[e+2],n[e+3]);return{...e,RGBPoints:i}}(l.getPresetByName(y.presetName)??l.getPresetByName("Cool to Warm"),y.reverse);v.applyColorMap(E),v.setMappingRange(b[0],b[1]),v.updateRange(),g.setLookupTable(v);const C=r.newInstance();if(C.setMapper(g),"line"===e.mode&&C.getProperty().setLineWidth(3),f.addActor(C),y.showScalarBar){const e=u.newInstance({drawNanAnnotation:!1,generateTicks:e=>{const t=e.getLastTickBounds();if(!t||t.length<2)return;const[n,o]=t,s=(o-n)/4,i=Array.from({length:5},((e,t)=>n+t*s));e.setTicks(i),e.setTickStrings(i.map((e=>{const t=Math.abs(e);return 0===t?"0":t>=.01&&t<1e4?parseFloat(e.toPrecision(4)).toString():e.toExponential(2)})))}});e.setTickTextStyle({fontColor:"black"}),e.setAxisTextStyle({fontColor:"black"}),e.setAxisLabel(y.scalarBarTitle),e.setScalarsToColors(v),f.addActor2D(e)}const D=fe(s.contourLines??{enabled:!1});D.enabled&&"line"!==e.mode&&await async function(e,t,n,o){const s=t.metadata?.interpolationGrid;if(!s)return;const{vtkActor:i,vtkDataArray:r,vtkImageData:a,vtkImageMarchingSquares:l,vtkMapper:d}=await ue(),c=a.newInstance();c.setDimensions(s.nx,s.ny,1),c.setOrigin(s.origin[0],s.origin[1],0),c.setSpacing(s.spacing[0],s.spacing[1],1);const u=r.newInstance({name:"solution",numberOfComponents:1,values:s.imageScalars});c.getPointData().setScalars(u);const m=l.newInstance({slicingMode:2,slice:0,mergePoints:!0});m.setInputData(c);const h=Math.max(2,o.numberOfContours),f=n[0],p=n[1],g=(p-f)/(h-1),b=[];for(let e=0;e<h;e++)b.push(f+e*g);m.setContourValues(b),m.update();const y=d.newInstance();y.setInputData(m.getOutputData()),y.setScalarVisibility(!1);const v=i.newInstance();v.setMapper(y),v.getProperty().setColor(...o.color),v.getProperty().setLineWidth(o.lineWidth),e.addActor(v)}(f,e,b,D),f.resetCamera(),p.render(),me.set(t,h),m.title=`${o} plot - ${n}`}async function Ce(e,t,n,o="surface"){const{vtkPolyData:s,vtkDataArray:i}=await ue(),r=s.newInstance();r.getPoints().setData(e,3),n.length>0&&("line"===o?r.getLines().setData(n):r.getPolys().setData(n));const a=i.newInstance({name:"solution",numberOfComponents:1,values:t});return r.getPointData().setScalars(a),r}function De(e,t){const n=new Float32Array(3*e.length);for(let o=0;o<e.length;o++){const s=3*o;n[s]=Number(e[o])||0,n[s+1]=Number(t?.[o])||0,n[s+2]=0}return n}function Me(e,t){const n=new Float32Array(t);for(let o=0;o<t;o++){const t=e?.[o];n[o]=Number(Array.isArray(t)?t[0]:t)||0}return n}function Fe(e){const t=e.map((e=>e-1)),n=t.length;return 2===n||3===n?t:4===n?[t[0],t[2],t[3],t[1]]:6===n?[t[0],t[2],t[5]]:8===n?[t[0],t[4],t[6],t[2]]:9===n?[t[0],t[6],t[8],t[2]]:t.slice(0,Math.min(4,t.length))}function $e(e){let t=0,n=0;for(;n<e.length;)n+=e[n]+1,t++;return t}function we(e,t,n){const o=new Float32Array(t*n);for(let s=0;s<n;s++)for(let i=0;i<t;i++)o[i+s*t]=e[i*n+s];return o}function Ae(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:xe(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:xe(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function xe(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length,d=r.getBasisFunctions(s,i).basisFunction,c=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=c[t.nop[o][e]-1]*d[e];return u}function Ne(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}class ke{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js",import.meta.url),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=p(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}}const Pe="0.3.0 (RC)";export{oe as FEAScriptModel,ke as FEAScriptWorker,he as createColorScale,fe as createContourLineOptions,se as importGmshQuadTri,n as logSystem,re as plotInterpolatedSolution,ge as plotInterpolatedSolutionVtk,ie as plotSolution,pe as plotSolutionVtk,Pe as printVersion,ve as transformSolverOutputToMLBuffers,ye as transformSolverOutputToVTP,be as transformSolverOutputToVtkData};
 //# sourceMappingURL=feascript.esm.js.map
diff --git a/dist/feascript.esm.js.map b/dist/feascript.esm.js.map
index d14ea29..1eb3e89 100644
--- a/dist/feascript.esm.js.map
+++ b/dist/feascript.esm.js.map
@@ -1 +1 @@
-{"version":3,"file":"feascript.esm.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditions.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/readers/gmshReaderScript.js","../src/visualization/plotSolutionScript.js","../src/workers/workerScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\"\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  \n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : jacobianMatrix?.toArray?.() ?? jacobianMatrix;\n  const b = Array.isArray(residualVector) ? residualVector : residualVector?.toArray?.() ?? residualVector;\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => { });\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\"\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(Math.ceil(Math.sqrt(numElements)) * nodesPerElement, nodesPerElement * 2);\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex)\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag }\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\"\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the solver configuration\n   * @param {string} solverConfig - Parameter specifying the type of solver\n   * @param {object} [options] - Optional additional configuration\n   */\n  setSolverConfig(solverConfig, options = {}) {\n    this.solverConfig = solverConfig;\n    warnLog(\"setSolverConfig() is deprecated. Use setModelConfig() instead\");\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${solverConfig}`);\n  }\n\n  // Alias modelConfig to solverConfig (solverConfig is deprecated, use setModelConfig instead)\n  setModelConfig(modelConfig, options = {}) {\n    this.setSolverConfig(modelConfig, options);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as \n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\"\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          }\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex]\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditions.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideTriangle,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotSolutionScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.2.0\";"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","logSystem","level","console","log","basicLog","debugLog","message","errorLog","warnLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","url","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","globalNodeIndex","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","FEAScriptModel","solverConfig","coefficientFunctions","setSolverConfig","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","has","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","importGmshQuadTri","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseFloat","parseInt","replace","points","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","plotSolution","model","plotType","plotDivId","yData","from","lineData","mode","color","width","maxWindowWidth","min","window","innerWidth","layout","title","height","xaxis","yaxis","margin","Plotly","newPlot","responsive","zData","minX","minY","aspectRatio","plotWidth","scaleanchor","scaleratio","hovermode","contourData","z","smoothing","contours","coloring","showlabels","colorbar","plotInterpolatedSolution","visNodeXCoordinates","visNodeYCoordinates","lengthX","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","k","getBoundarySegments","nodeNeighbors","neighborCount","elemIndex","computeNodeNeighbors","lastParentElement","visNodeIndex","pointInsidePolygon","found","neighborElementsIndex","searchResult","pointSearch","plotHeight","connectgaps","hoverongaps","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","solutionInterpolationValue","segments","x1","y1","x2","y2","FEAScriptWorker","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","printVersion"],"mappings":"AAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,CCXA,IAAIK,EAAkB,QAMf,SAASC,EAAUC,GACV,UAAVA,GAA+B,UAAVA,GACvBC,QAAQC,IACN,+BAAiCF,EAAQ,yBACzC,sCAEFF,EAAkB,UAElBA,EAAkBE,EAClBG,EAAS,qBAAqBH,KAElC,CAMO,SAASI,EAASC,GACC,UAApBP,GACFG,QAAQC,IAAI,aAAeG,EAAS,qCAExC,CAMO,SAASF,EAASE,GACvBJ,QAAQC,IAAI,YAAcG,EAAS,qCACrC,CAMO,SAASC,EAASD,GACvBJ,QAAQC,IAAI,aAAeG,EAAS,qCACtC,CAMO,SAASE,EAAQF,GACtBJ,QAAQC,IAAI,YAAcG,EAAS,qCACrC;;;;;GCxDA,MAAMG,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACHxB,QAASwB,EAAMxB,QACf4B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAMxB,SAAUyB,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADA3C,QAAQgD,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKzD,OACL,MAAO,CAAE6E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKzD,OAAS,GAChC,GAAIqH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAM1D,KAAKmI,MAAMnI,KAAKoI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGxF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHA1I,EAAS,wBAAwBkI,QACjCpI,QAAQ6I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC5BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE9J,OACZ,IAAIkK,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAIrK,EAAI,EAAGA,EAAIkK,EAAGlK,IAAK,CAC1B,IAAIsK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBvK,IAAMuK,IACRD,GAAOP,EAAE/J,GAAGuK,GAAKJ,EAAEI,IAGvBH,EAAKpK,IAAMgK,EAAEhK,GAAKsK,GAAOP,EAAE/J,GAAGA,EAC/B,CAGD,IAAIwK,EAAU,EACd,IAAK,IAAIxK,EAAI,EAAGA,EAAIkK,EAAGlK,IACrBwK,EAAUtK,KAAKuK,IAAID,EAAStK,KAAKwK,IAAIN,EAAKpK,GAAKmK,EAAEnK,KAMnD,GAFAmK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDP+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAe5I,QAAQmI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrBxI,EAAS,8BAA8BoJ,EAAmBX,yBAE1DvI,EAAS,wCAAwCkJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACIvI,EAAS,0BAA0B+H,KAMrC,OAHApI,QAAQqK,QAAQ,iBAChBnK,EAAS,8BAEF,CAAEwI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDrI,EAAS,wBAAwBkI,QACjCpI,QAAQ6I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAiBA,GAAgBoC,aAAepC,EACpFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAiBA,GAAgBmC,aAAenC,EAE1F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAzCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,+CAAgDC,KAAM,CACtF7H,KAAM,WAEFyH,EAAgBK,EAAaJ,GAEnC,aADMD,EAAcM,aACb,CAAEN,gBAAeC,SAC1B,CAkCoBM,GAChBP,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE/J,QAAQmI,KAAK,GACpC,IAAIsD,EAEJA,QAAeR,EAAcS,mBAAmB5B,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiByC,EAAOzC,eACxBC,EAAYwC,EAAOxC,UACnBC,EAAauC,EAAOvC,WAGhBD,EACFxI,EAAS,8BAA8ByI,gBAEvCvI,EAAS,wCAAwCuI,eAEvD,MACIvI,EAAS,0BAA0B+H,KAWrC,OARApI,QAAQqK,QAAQ,iBAChBnK,EAAS,+BAA+BkI,MAEpCsC,UACIC,GAAeU,YAAY/G,OAAM,UACvCoG,EAAQE,OAAOU,aAGV,CAAE5C,iBAAgBC,YAAWC,aACtC,CElIO,MAAM2C,EAMX,WAAAtG,EAAYuG,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADAxL,EAAS,8CAIX,GAA0B,WAAtBqL,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAAvH,EAAYwH,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACP3M,EAAS,mEACTwL,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnB3M,EAAS,sDAKPkH,MAAMiD,QAAQkB,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBzF,MAAMiD,QAAQkB,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExD/M,EACE,yDACEgN,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAavN,OAAQ6N,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAIlG,MAAMiG,EAAU9N,QAGlB,IAArB8N,EAAU9N,QAOZ+N,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAU9N,SASnB+N,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtChN,EAAS,4FASX,GANAF,EACE,gEACEgN,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACErG,MAAMiD,QAAQkB,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBlO,OAAS,QACFyE,IAAxCuH,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAIpO,EAAI,EAAGA,EAAIiM,KAAKmB,WAAWe,iBAAiBlO,OAAQD,IACvDiM,KAAKmB,WAAWe,iBAAiBnO,IACnCoO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBnO,IAGhEiM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAASpK,IAEvC,GAAuB,IAAnBA,EAAKqK,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkBnK,EAAKsK,MAAQ,GAErEH,EAAkBpO,OAAS,IAExBgM,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,OACzCvC,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExB/N,EACE,mCAAmCgO,MAAUC,mBAAuBzK,EAAKsK,QACvEtK,EAAK3B,MAAQ,cAKjB,IAAIqM,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAetN,OAC9C6N,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoB5O,QAEtB,GAAI4O,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/CjO,EACE,mBAAmBoN,gDAA2De,EAAoBpG,KAChG,UAGJ/H,EACE,UAAUgO,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,uCAAuCqO,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,qCAAqCqO,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,oCAAoCqO,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPrO,EAAS,sCAAsCqO,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAKP,KAAK,CAACH,EAAciB,IAC/DrO,EACE,8BAA8BoN,MAAiBiB,sBAAyB7K,EAAKsK,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoB5O,QAGzB4O,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/CjO,EACE,mBAAmBoN,gDAA2De,EAAoBpG,KAChG,UAGJ/H,EACE,UAAUgO,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,uCAAuCqO,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,qCAAqCqO,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPrO,EAAS,oCAAoCqO,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPrO,EAAS,sCAAsCqO,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAKP,KAAK,CAACH,EAAciB,IAC/DrO,EACE,8BAA8BoN,MAAiBiB,sBAAyB7K,EAAKsK,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACHhO,EACE,oDAAoD8N,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBlO,OAAS,QACFyE,IAAxCuH,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAIpO,EAAI,EAAGA,EAAIiM,KAAKmB,WAAWe,iBAAiBlO,OAAQD,IACvDiM,KAAKmB,WAAWe,iBAAiBnO,IACnCoO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBnO,IAGhEiM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAAvH,EAAYwH,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrCrM,EAAS,wFAEZ,CAED,YAAAyO,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHAjP,EAAS,iCAAmCgN,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDtM,EAAS,yCAA2CgN,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAAvH,EAAYwH,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExFvM,EACE,6GAGL,CAED,YAAAyO,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAWtQ,KAAKuQ,GAAK,IACrBC,EAAUxQ,KAAKyQ,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAW1Q,KAAKyQ,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQ7Q,KAAKwK,IAAIgG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAAS9Q,KAAKwK,IAAIkG,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJAjP,EAAS,iCAAmCgN,KAAKC,UAAU2B,IAC3D5O,EAAS,iCAAmCgN,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFApN,EAAS,yCAA2CgN,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAhM,EAAYuG,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAIxR,KAAKC,KAAK,KAAU,EAC1CuR,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAIxR,KAAKC,KAAK,KAAU,EAC1CwR,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGFrP,EAAS,8CAIX,MAAMmR,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAI3P,OACpBgS,EAAa3C,EAAkBrP,OAC/BS,EAAS,0BAA0BsR,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnEzP,EAAS,2CAA2CsR,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAItJ,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAI6G,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3D5G,EAAe4G,GAAa,EAC5B7G,EAAeqF,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5CxJ,EAAe6G,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACL5I,iBACAD,iBACA2J,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAG3P,OAWjC,CAOO,SAASwS,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoBnJ,EAAG2G,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAOvJ,EAAIuJ,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAOrJ,EAAIuJ,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyB1J,EAAG2G,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoBnJ,EAAG2G,EAAGgD,GACrDK,EAA4Bb,EAAoBnJ,EAAG2G,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnBpU,KAAKwK,KAAK4J,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAKlK,IAAMmK,EAAG,GAAKD,EAAG,KACnEnU,KAAKC,MAAMmU,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CC9RO,MAAMsI,EASX,WAAAlP,CAAYmP,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA4I,CAAqC/L,EAAgBD,GACxB,OAAvBqD,KAAKF,cACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDpU,EACE,YAAYoU,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACdtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDpU,EACE,YAAYoU,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAC,CAA0CC,EAAoBC,GACjC,OAAvBlJ,KAAKF,cACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDpU,EACE,YAAYoU,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,KAE6B,OAAvB9I,KAAKF,eACdtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDpU,EACE,YAAYoU,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,4CAA4CsU,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAK,CACEvM,EACAD,EACA8I,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxB7S,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBvJ,KAAKF,cACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClCpU,EACE,YAAYoU,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAMiG,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,qDAAqDsU,EAAkB,cACrElH,EAAe,iBACD2B,EAAY,MAE9B5G,EAAemM,KAAqBS,EAAkBC,EACtD9M,EAAeoM,GAAiBA,IAAoBS,CAAe,GAEtE,KAE6B,OAAvBxJ,KAAKF,eACdtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClCpU,EACE,YAAYoU,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc7N,OAC/C,IAAK,IAAIwP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACM7O,KAAKC,KAAKyS,GAAa,EAAIO,GAAa,GAExCjT,KAAKC,KAAK+S,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/DnS,EACE,qDAAqDsU,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInChK,EAAemM,KACZrD,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjEtN,EAAeoM,GAAiBmB,KAC7BxE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aACd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc7N,OAC/C,IAAK,IAAIwP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACM7O,KAAKC,KAAKyS,GAAa,EAAIO,GAAa,GAExCjT,KAAKC,KAAK+S,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/DnS,EACE,qDAAqDsU,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInChK,EAAemM,KACZrD,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjEtN,EAAeoM,GAAiBmB,KAC7BxE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACEvI,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxB7S,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMhD,EAAkBvG,KAAK2D,IAAI9B,GAAc7N,OACzCqW,EAAsBxO,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCmO,EAAsBzO,MAAM0K,GAAiBpK,KAAK,GAGxD,IAAK,MAAM0M,KAAe7I,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK0I,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClCpU,EACE,YAAYoU,2DAAqEW,0CAAwDC,OAI3I,MAAMc,EAAkBvK,KAAKkC,iBAAiB2G,GAAa2B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB5I,IAG1D,GAAI0I,EAAiB,CACnB,MAAMzH,EAAOyH,EAAgB,GAE7B,GAA2B,OAAvBvK,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/BrO,EACE,qDAAqD+O,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B8G,EAAoB9G,KAAegG,EAAkBC,EACrDY,EAAoB7G,GAAWA,IAAcgG,CACzD,MAAiB,GAA2B,OAAvBxJ,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAG3D,IAiBI0J,EAjBArD,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAKCwG,EADW,IAATlH,GAAuB,IAATA,EACM7O,KAAKC,KAAKyS,GAAa,EAAIO,GAAa,GAExCjT,KAAKC,KAAK+S,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aAEd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc7N,OAC/C,IAAK,IAAIwP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACM7O,KAAKC,KAAKyS,GAAa,EAAIO,GAAa,GAExCjT,KAAKC,KAAK+S,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0BzE,EAAUwC,GAClDlU,EAAS,mDAGT,MAAM6O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B,MAAMiK,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAG5EC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzCtN,EAAeqO,GAAmBC,KAC/BvF,EAAamF,GACdhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYzR,OAAQkX,IAAoB,CAExF,MAAMnB,EAA+B3D,EAAenG,kBAClDwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzCtN,EAAeqO,GAAmBC,KAC/BvF,EAAamF,GACdnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAI1C,EACpCC,EACAxG,EACAyB,EACA7D,EACAC,GAkBF,OAdAoL,EAA0BhC,mCACxBvM,EACAD,EACA8I,EACAC,EACArC,EACAY,EACAmC,GAIF+E,EAA0BxC,qCAAqC/L,EAAgBD,GAC/EnI,EAAS,iDAEF,CACLmI,iBACAC,iBAEJ,CAcO,SAASwO,GAA4BvJ,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcwE,QAAEA,IAEzF,MAAMnF,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DmE,EAAsBxO,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCmO,EAAsBzO,MAAM0K,GAAiBpK,KAAK,GAGlDkP,EAAMxP,MAAM0K,GACZD,EAAmBzK,MAAM0K,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkB3S,KAAKwK,IAAIkF,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkB3S,KAAKwK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IAAoB,CAExF,MAAMzK,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYoF,KAIRhE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAGnE,MACI,GAAsB,OAAlBnK,EAET,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAYzR,OAAQkX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,IAGxE5E,EAAmB+E,EAAI1T,KAAK2T,GAAgBA,EAAc,KAG1DzE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAAhS,CAAYmP,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAAyL,CAAkC5O,EAAgBD,GACrB,OAAvBqD,KAAKF,cACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM3S,EAAQ8J,KAAK0I,mBAAmBG,GAAa,GACnDpU,EAAS,YAAYoU,iCAA2C3S,2BAChE8J,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmB7S,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmB7S,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACdtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM3S,EAAQ8J,KAAK0I,mBAAmBG,GAAa,GACnDpU,EAAS,YAAYoU,iCAA2C3S,2BAChE8J,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmB7S,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAemM,GAAmB7S,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe5I,OAAQmS,IACvDxJ,EAAeoM,GAAiB5C,GAAY,EAG9CxJ,EAAeoM,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAA0C,CAA2CxC,EAAoBC,GAClC,OAAvBlJ,KAAKF,cACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM3S,EAAQ8J,KAAK0I,mBAAmBG,GAAa,GACnDpU,EAAS,YAAYoU,iCAA2C3S,2BAChE8J,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmB7S,CAAK,GAEvD,MAAmB,GAA0B,cAAtB8J,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmB7S,CAAK,GAE1C,IAEJ,KAE6B,OAAvB8J,KAAKF,eACdtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM3S,EAAQ8J,KAAK0I,mBAAmBG,GAAa,GACnDpU,EAAS,YAAYoU,iCAA2C3S,2BAChE8J,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmB7S,CAAK,GAEvD,MAAmB,GAA0B,cAAtB8J,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D/O,EACE,sCAAsCsU,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmB7S,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASwV,EACdxF,EACAwC,EACA1L,EACA2O,GAEAnX,EAAS,iDAGT,IAAIoX,EAAqB,EAAID,EArBA,IAsB7BlX,EAAS,uBAAuBmX,KAChCnX,EAAS,0BAA0BkX,KAGnC,MAAMtI,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1BnL,SAAS,6CAGT,IAAIoV,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACE7O,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYzR,OAAQkX,IAAoB,CAExF,IAAInB,EAA+B3D,EAAenG,kBAChDwF,EAAYoF,GACZpF,EAAYyF,IAId,MAAMJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAC5D1K,EAAgB2J,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACE7O,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACE9O,EAAesJ,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzCnO,EAAeoO,IACbY,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACF/O,EAAeoO,IACbW,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACd9W,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GAGzCtN,EAAeqO,GAAmBC,KAC/BW,EACDlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFhP,EAAeqO,GAAmBC,IAChCU,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbjX,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbjX,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkC5O,EAAgBD,GAC5EnI,EAAS,+CAEF,CACLmI,iBACAC,iBAEJ,CAgBO,SAASmP,GAA8BlK,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcwE,QACdA,EAAO5N,eACPA,EAAc2O,sBACdA,IAGA,MAAMlG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI0F,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBxO,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCmO,EAAsBzO,MAAM0K,GAAiBpK,KAAK,GAGlDkP,EAAMxP,MAAM0K,GACZD,EAAmBzK,MAAM0K,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkB3S,KAAKwK,IAAIkF,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkB3S,KAAKwK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1BnL,SAAS,6CAGT,IAAIoV,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACE7O,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CAEP,MAAW,GAAsB,OAAlBnK,EACT,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYzR,OAAQkX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,KAGxErE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIsF,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACE7O,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACE9O,EAAesJ,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAEzCT,EAAoBS,IAClBa,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACd9W,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbjX,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbjX,KAAKC,KAAK2X,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIhG,EAUG,SAASiG,EAAiBC,EAAepG,EAAUwC,EAAoB7L,EAAU,CAAA,GAEtF,MAAM+N,EAAU3E,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkBrP,OACxCuY,EAAcrG,EAASH,eA6H/B,SAAiCQ,EAAiBgG,GAEhDP,EAAY1K,eAAiBzF,MAAM0Q,GAChCpQ,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACzC6P,EAAY/C,mBAAqBpN,MAAM0K,GAAiBpK,KAAK,GAC7D6P,EAAY9C,eAAiBrN,MAAM0K,GAAiBpK,KAAK,GACzD6P,EAAYQ,qBAAuB3Q,MAAM0K,GAAiBpK,KAAK,GAC/D6P,EAAYhP,eAAiBnB,MAAM0K,GAAiBpK,KAAK,GACzD6P,EAAYS,aAAe5Q,MAAM0Q,GAAapQ,KAAK,GACnD6P,EAAYU,YAAc7Q,MAAM0Q,GAAapQ,KAAK,GAGlD8P,EAAaU,UAAY,EACzBV,EAAajG,WAAaO,EAC1B0F,EAAaW,mBAAqB,EAClCX,EAAa1F,gBAAkB1K,MAAM0Q,GAAapQ,KAAK,GACvD8P,EAAaY,YAAc,EAG3B,MAAMC,EAAa7Y,KAAKuK,IAAI+H,EAAiB,KAC7C0F,EAAac,qBAAuBlR,MAAMiR,GAAY3Q,KAAK,GAC3D8P,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBxO,MAAM0K,GACrCpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACzC+P,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B1G,EAAiBgG,GAC1C,MAAMW,EAAqBjZ,KAAKuK,IAAIvK,KAAKkZ,KAAKlZ,KAAKC,KAAKqY,IAAgBhG,EAAmC,EAAlBA,GACzF,OAAO2G,EAAqBX,CAC9B,CAhBoBa,CAAkB7G,EAAiBgG,GACrDH,EAAaiB,YAAcxR,MAAMoR,GAAW9Q,KAAK,GACjDiQ,EAAakB,cAAgBzR,MAAMiR,GAAY3Q,KAAK,GACpDiQ,EAAamB,SAAW1R,MAAMiR,GAAY3Q,KAAK,GAC/CiQ,EAAaoB,UAAY3R,MAAMoR,GAAW9Q,KAAK,EACjD,CA7JEsR,CAHwB7C,EAAQrE,gBAGSgG,GAGzC/X,EAAS,mCACTF,QAAQ6I,KAAK,iBAGbiJ,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYoH,EAAQrE,gBAAiB/C,IAC3DwI,EAAY1K,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBrP,OAAQwP,IACrEwI,EAAY/C,mBAAmBzF,GAAa,EAC5CwI,EAAY9C,eAAe1F,GAAa,EAI1C,IAAIkK,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIjF,EACvCC,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC7C,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI1F,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBrP,OAAQwP,IACrEwI,EAAYQ,qBAAqBhJ,GAAa,EAGhDyI,EAAajG,WAAaE,EAAS7C,kBAAkBrP,OACrDiY,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIhL,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEoK,EAAa1F,gBAAgB1E,GAAgB+I,EAAQrE,gBAIvD0F,EAAa0B,sBAAwB9Q,EAAQG,eAC7CiP,EAAaN,sBAAwB9O,EAAQ8O,sBAkM/C,SAA6BzF,EAAU0E,EAASO,EAA2BmB,GAEzE,MAAMvG,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkBrP,OAC7C8Y,EAAa7Y,KAAKuK,IAAI+H,EAAiB0F,EAAac,qBAAqB/Y,QAC/E,IAaI4Z,EAbAC,EAAmBhS,MAAM+O,EAAQrE,iBAAiBpK,KAAK,GACvD2R,EAAiBjS,MAAM+O,EAAQrE,iBAAiBpK,KAAK,GACrD4R,EAAalS,MAAMiR,GAAY3Q,KAAK,GACpC6R,EAAkBnS,MAAMiR,GAAY3Q,KAAK,GACzC8R,EAAqBpS,MAAMiR,GAAY3Q,KAAK,GAC5C+R,EAAerS,MAAMiR,GAAY3Q,KAAK,GACtCgS,EAActS,MAAMiR,GAAY3Q,KAAK,GACrCiS,EAAcvS,MAAMiR,GACrB3Q,OACAxE,KAAI,IAAMkE,MAAMiR,GAAY3Q,KAAK,KAChCkS,EAAexS,MAAM0K,GAAiBpK,KAAK,GAC3CmS,EAAkBzS,MAAM0K,GAAiBpK,KAAK,GAC9CoS,EAAsB1S,MAAM0K,GAAiBpK,KAAK,GAGlDqS,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI3I,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D6K,EAAa7K,GAAa,EAC1B8K,EAAgB9K,GAAa,EAG/B,GAAwC,IAApCyI,EAAaW,mBAA0B,CAEzC,IAAK,IAAIpJ,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D+K,EAAoB/K,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI8M,EAAsB5I,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBqF,EAAa1F,gBAAgBoI,GAC9C/H,IACA,CACA,IAAImC,EAAkBiD,EAAY1K,eAAeqN,GAAqB/H,GACrB,IAA7C2H,EAAoBxF,EAAkB,KACxCwF,EAAoBxF,EAAkB,GAAK,EAC3CiD,EAAY1K,eAAeqN,GAAqB/H,IAC7CoF,EAAY1K,eAAeqN,GAAqB/H,GAEtD,CACF,CACF,CAEDqF,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAI9a,EAAI,EAAGA,EAAI+Y,EAAY/Y,IAC9B,IAAK,IAAIuK,EAAI,EAAGA,EAAIwO,EAAYxO,IAC9B8P,EAAY9P,GAAGvK,GAAK,EAIxB,OAAa,CAEX,IAAI+a,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBpG,IACpCmG,EAAYC,sBACZ2C,EAAYG,EAA4B/I,EAAU0E,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa1F,gBAAgB2I,EAAiB,GAChEF,EAAoB/C,EAAa1F,gBAAgB2I,EAAiB,GAElE,IAAK,IAAItI,EAAiB,EAAGA,EAAiBoI,EAAmBpI,IAAkB,CACjF,IACIuI,EAqBAC,EAtBArG,EAAkBiD,EAAY1K,eAAe4N,EAAiB,GAAGtI,GAGrE,GAAoB,IAAhBgI,EACFA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,MACzC,CACL,IAAKoG,EAAc,EAAGA,EAAcP,GAC9B3a,KAAKwK,IAAIsK,KAAqB9U,KAAKwK,IAAI2N,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,IAE9C8E,EAAiBjH,GAAkBuI,EAAc,EACjD/C,EAAakB,cAAc6B,GAAepG,EAE7C,CAGD,GAAiB,IAAb8F,EACFA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,MACtB,CACL,IAAKqG,EAAW,EAAGA,EAAWP,GACxB5a,KAAKwK,IAAIsK,KAAqB9U,KAAKwK,IAAIsP,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,IAE3B+E,EAAelH,GAAkBwI,EAAW,EAC5CrB,EAAWqB,GAAYrG,EAE1B,CACF,CAED,GAAI8F,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADAnY,EAAS,sCAIX,IAAK,IAAI0a,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAIrG,EAAkBgF,EAAWqB,GACjC,GAAIrG,EAAkB,EAAG,CACvBiF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoB1b,KAAKwK,IAAIsK,GAC6B,IAA1DiD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5C7G,EAAkB9U,KAAKwK,IAAIsP,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACblb,KAAKwK,IAAI2N,EAAakB,cAAc6B,MAClCpG,IAAiBqF,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBpG,EAAe,CACxF,GAA6B,IAAzByJ,EAEF,YADA7a,EAAS,oCAIX,IAAIkb,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAI7b,KAAKwK,IAAIsR,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5D/b,KAAKwK,IAAIyR,GAAajc,KAAKwK,IAAIsR,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBlc,KAAKwK,IAAIsP,EAAW8B,EAAgB,IAC9DjC,EAAyB3Z,KAAKwK,IAAI2N,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBnc,KAAKwK,IAAIsR,GAEjF,IAAK,IAAIvM,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IACvDA,GAAa2M,GAAqB9B,EAAa7K,KAC/CA,GAAaoK,GAAwBU,EAAgB9K,KAS3D,GANIvP,KAAKwK,IAAIsR,GAAc,OACzBpb,EACE,2DAA2DuX,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiBrc,KAAKwK,IAAIsP,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiBrc,KAAKwK,IAAIsP,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAItc,EAAI,EAAGA,EAAI8a,EAAU9a,IAC5BqY,EAAaoB,UAAUiB,EAAiB1a,EAAI,GAAKoa,EAAYpa,GAE/D0a,GAAkBI,EAElB,IAAK,IAAI9a,EAAI,EAAGA,EAAI8a,EAAU9a,IAC5BqY,EAAaoB,UAAUiB,EAAiB1a,EAAI,GAAKga,EAAWha,GAE9D0a,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAI1a,EAAI,EAAGA,EAAI6a,EAAa7a,IAC/BqY,EAAaiB,YAAYmB,EAAmB,EAAIza,GAAKqY,EAAamB,SAASxZ,GAE7Eya,GAAoBI,EAEpB,IAAK,IAAI7a,EAAI,EAAGA,EAAI6a,EAAa7a,IAC/BqY,EAAaiB,YAAYmB,EAAmB,EAAIza,GAAKqY,EAAakB,cAAcvZ,GAElFya,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBpG,EAAe,SAsBrE,GApBA6H,EAAyB3Z,KAAKwK,IAAI2N,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBlc,KAAKwK,IAAIsP,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBnc,KAAKwK,IAAIsR,GAEjF3D,EAAamB,SAAS,GAAK,EACvBtZ,KAAKwK,IAAIsR,GAAc,OACzBpb,EACE,2DAA2DuX,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACflY,EAAS,0CAA0C+Z,KAGrDgC,EAAwBhC,GACxB,KACD,CACF,CACH,CA1jBEiC,CAAoBvK,EAAU0E,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI9I,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBrP,OAAQwP,IACrEwI,EAAYhP,eAAewG,GAAayI,EAAac,qBAAqBvJ,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBrP,OAAQwP,IACtC,OAA3B0C,EAASpG,cAEXrL,EACE,GAAG4O,EAAkBG,GAAWkN,cAAc,OAAO1E,EAAYhP,eAC/DwG,GACAkN,cAAc,MAIlBjc,EACE,GAAG4O,EAAkBG,GAAWkN,cAAc,OAAOzM,EAAkBT,GAAWkN,cAChF,OACI1E,EAAYhP,eAAewG,GAAWkN,cAAc,MAKhEpc,QAAQqK,QAAQ,iBAChBnK,EAAS,8BAET,MAAQ6O,kBAAmBsN,EAAa1M,kBAAmB2M,GAAgB1K,EAC3E,MAAO,CACLlJ,eAAgBgP,EAAYhP,eAAejF,MAAM,EAAGiO,GACpD6K,iBAAkB,CAChBxN,kBAAmBsN,EACnB1M,kBAAmB2M,GAGzB,CAqEA,SAAS3B,EAA4B/I,EAAU0E,EAASO,EAA2BmB,GACjF,MAAMzK,EAAeqK,EAAYC,oBAAsB,EAGvD,GAAItK,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADApR,EAAS,sCAAsCkN,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMsE,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtEzK,eACA8B,IAAKqI,EAAY1K,eACjB4E,WACAE,eAAgBA,EAChBwE,UAEA5N,eAAgBiP,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8BjV,MAAM+O,EAAQrE,iBAC7CpK,OACAxE,KAAI,IAAMkE,MAAM+O,EAAQrE,iBAAiBpK,KAAK,KAC7C4U,EAAyBlV,MAAM+O,EAAQrE,iBAAiBpK,KAAK,GAGjE,GAAImQ,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMnI,KAAe3C,EAAShE,iBACjC,GACqE,eAAnEiJ,EAA0BzC,mBAAmBG,KAAe,IAC5D3C,EAAShE,iBAAiB2G,GAAaoI,MAAK,EAAExG,EAAsBC,KAAOD,IAAyB5I,IACpG,CACAmP,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMvL,YAAEA,EAAWC,aAAEA,GAAiBkF,EAChCnL,EAAS0L,EAA0Bf,wCACvCvI,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF0K,EAA8BrR,EAAO4K,oBACrC0G,EAAyBtR,EAAO6K,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQrE,gBAAiB2K,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQrE,gBAAiB4K,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIvK,EAAiB,EAAGA,EAAiBgE,EAAQrE,gBAAiBK,IAAkB,CACvF,MAAMmC,EAAkBsC,EAAIzE,GAAkB,EAC9CoF,EAAYQ,qBAAqBzD,IAC/BuB,EAAoB1D,GAAkBmK,EAAuBnK,EAChE,CAED,OAAO,CACT,CA0YA,SAAS4J,EAAwBhC,GAC/B,IAAK,IAAIhL,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3DyI,EAAac,qBAAqBvJ,GAAawI,EAAY9C,eAAe1F,GAG5E,IAAK,IAAI4N,EAAiB,EAAGA,GAAkBnF,EAAajG,WAAYoL,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyB3Z,KAAKwK,IAAI2N,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqB9Y,KAAKwK,IAAI2N,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACflY,EAAS,oDAAoD+Z,IACjE,CC3sBO,SAAS8C,GAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZxU,GAAY,EACZC,EAAa,EACbqG,EAAS,GACTvG,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAASyU,EAGlD,IAAIxL,EAAawL,EAAQtL,SAAS7C,kBAAkBrP,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIiS,EAAYjS,IAC9BwP,EAAOxP,GAAK,EACZiJ,EAAejJ,GAAK,EAQtB,IAJIyd,EAAQE,iBAAmBF,EAAQE,gBAAgB1d,SAAWgS,IAChEhJ,EAAiB,IAAIwU,EAAQE,kBAGxBxU,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAIlJ,EAAI,EAAGA,EAAIiJ,EAAehJ,OAAQD,IACzCiJ,EAAejJ,GAAKuI,OAAOU,EAAejJ,IAAMuI,OAAOiH,EAAOxP,IAIhE,GAA6B,YAAzByd,EAAQ9U,aAA4B,CAOtC6G,EANsB8I,EACpBN,EACAyF,EAAQtL,SACRsL,EAAQ9I,mBACR,CAAE1L,iBAAgB2O,sBAAuB6F,EAAQ7F,wBAE5B3O,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmB2U,EACpCC,EAAQtL,SACRsL,EAAQ9I,mBACR1L,EACAwU,EAAQ7F,wBAKVpI,EAD2B9G,EAAkB+U,EAAQ9U,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALAyU,EAAY7d,EAAc2P,GAG1B/O,EAAS,4BAA4B0I,EAAa,mBAAmBuU,EAAUf,cAAc,MAEzFe,GAAa1U,EACfE,GAAY,OACP,GAAIwU,EAAY,IAAK,CAC1B9c,EAAS,uCAAuC8c,KAChD,KACD,CAEDvU,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAM+U,GAYX,WAAApY,CACEmP,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAEA9R,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK4R,mBAAqBA,EAC1B5R,KAAK6R,mBAAqBA,EAC1B7R,KAAK8R,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkC5O,EAAgBD,GAChD,MAAMoV,EAAYnV,EAAe5I,OACjC,IAAIge,GAAgB,EAEpB,GAA2B,OAAvBhS,KAAKF,gBACPtJ,OAAOoS,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,MAAMoJ,EAASjS,KAAK0I,mBAAmBG,GAAa,GAEpD,GAAe,eAAXoJ,EACFD,GAAgB,EAEhBvd,EAAS,YAAYoU,uDAChB,GAAe,qBAAXoJ,EAA+B,CACxC,MAAMC,EAASlS,KAAK0I,mBAAmBG,GAAa,GAC9CsJ,EAASnS,KAAK0I,mBAAmBG,GAAa,GACpDpU,EACE,YAAYoU,8CAAwDqJ,QAAaC,MAEnFnS,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvCtU,EACE,0CAA0CsU,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAewV,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAeyV,GAAMjM,GAAY,EAEnCxJ,EAAeyV,GAAMA,GAAQ,EAG7BxV,EAAeyV,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAe0V,GAAMlM,GAAY,EAEnCxJ,EAAe0V,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBrS,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvCtU,EACE,0CAA0CsU,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9B5G,EAAewV,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAeyV,GAAMjM,GAAY,EAEnCxJ,EAAeyV,GAAMA,GAAQ,EAG7BxV,EAAeyV,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAe0V,GAAMlM,GAAY,EAEnCxJ,EAAe0V,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAItS,KAAK4R,mBACtB,IAAK,IAAIzL,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAe2V,GAAMnM,GAAY,EAEnCxJ,EAAe2V,GAAMA,GAAQ,EAC7B1V,EAAe0V,GAAQ,EACvB7d,EAAS,sEACV,CAEJ,ECtII,MAAM8d,GACX,WAAAhZ,GACEyG,KAAKwS,aAAe,KACpBxS,KAAK4F,WAAa,GAClB5F,KAAK0I,mBAAqB,GAC1B1I,KAAKtD,aAAe,UACpBsD,KAAKyS,qBAAuB,KAC5B7d,EACE,0PAEFJ,EAAS,kCACV,CAOD,eAAAke,CAAgBF,EAAc3V,EAAU,IACtCmD,KAAKwS,aAAeA,EACpB5d,EAAQ,sEAG8B6D,IAAlCoE,GAAS4V,uBACXzS,KAAKyS,qBAAuB5V,EAAQ4V,qBACpChe,EAAS,kCAGoBgE,IAA3BoE,GAASC,gBACXkD,KAAKlD,cAAgBD,EAAQC,cAC7BrI,EAAS,wBAAwBuL,KAAKlD,uBAEbrE,IAAvBoE,GAASE,YACXiD,KAAKjD,UAAYF,EAAQE,UACzBtI,EAAS,oBAAoBuL,KAAKjD,cAGpCtI,EAAS,uBAAuB+d,IACjC,CAGD,cAAAG,CAAeC,EAAa/V,EAAU,IACpCmD,KAAK0S,gBAAgBE,EAAa/V,EACnC,CAED,aAAAgW,CAAcjN,GACZ5F,KAAK4F,WAAaA,EAClBnR,EAAS,mCAAmCmR,EAAW9F,gBACxD,CAED,oBAAAgT,CAAqBjK,EAAakK,GAChC/S,KAAK0I,mBAAmBG,GAAekK,EACvCte,EAAS,0CAA0CoU,YAAsBkK,EAAU,KACpF,CAED,eAAAC,CAAgBtW,GACdsD,KAAKtD,aAAeA,EACpBjI,EAAS,wBAAwBiI,IAClC,CAOD,KAAAuW,CAAMpW,EAAU,IACTmD,KAAKwS,cAAiBxS,KAAK4F,YAAe5F,KAAK0I,oBAClD/T,EAAS,8EAYX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjB0U,EAAkB,GAGtBld,EAAS,qBACT,MAAM0R,EAAWP,EAAY3F,KAAK4F,YAClCpR,EAAS,8BAGT,MAAMqc,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHAzP,EAAS,gCACTF,QAAQ6I,KAAK,oBACb3I,EAAS,gBAAgBwL,KAAKwS,gBACJ,yBAAtBxS,KAAKwS,aAEP,GAA0B,YAAtBxS,KAAKtD,aAA4B,CAMnCM,EALsBqP,EACpBjB,EACAlF,EACAlG,KAAK0I,oBAEwB1L,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmB+N,EAA0BzE,EAAUlG,KAAK0I,qBAK/E1L,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,cACrC,MACI,GAA0B,2BAAtBgD,KAAKwS,aAA2C,CAEzD,IAAI7G,EAAwB,EAC5B,MAAMuH,EAA2B,EAG3B1B,EAAU,CACdtL,SAAUA,EACVwC,mBAAoB1I,KAAK0I,mBACzBiD,sBAAuBA,EACvBjP,aAAcsD,KAAKtD,aACnBgV,kBAEA5U,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,WAGvC,KAAO4O,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5B3O,EAAehJ,OAAS,IAC1Bwd,EAAQE,gBAAkB,IAAI1U,IAIhC,MAAMmW,EAAsB7B,GAAc5F,EAA6B8F,GAGvE7U,EAAiBwW,EAAoBxW,eACrCC,EAAiBuW,EAAoBvW,eACrCI,EAAiBmW,EAAoBnW,eAGrC2O,GAAyB,EAAIuH,CAC9B,CACP,MAAW,GAA0B,yBAAtBlT,KAAKwS,aAEd,GAA0B,YAAtBxS,KAAKtD,aACP/H,EACE,uGAEG,GAEFgI,iBAAgBC,kBCvKpB,SAAmCsJ,EAAUwC,EAAoB+J,GACtEje,EAAS,gDAGT,MAAM6O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGEpI,EAAEA,EAACsV,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMb,EAGjB7H,EAAU3E,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAEJ,GAAsB,OAAlB9K,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkB3S,KAAKwK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIuD,EAAkB,EAAGA,EAAkB1E,EAAYzR,OAAQmW,IAAmB,CAErF,MAAM/J,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY0E,KAIRtD,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAIgN,EAAS,EACb,IAAK,IAAIxf,EAAI,EAAGA,EAAIwS,EAAiBxS,IACnCwf,GAAUlQ,EAAkBiD,EAAiBvS,IAAMqM,EAAcrM,GAInE,MAAMyf,EAAI1V,EAAEyV,GACNxV,EAAIqV,EAAEG,GACN/S,EAAI6S,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIxI,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,MAAM2I,EAAmBpN,EAAiByE,GAG1CnO,EAAe8W,IACbhO,EAAayE,GAAmBtD,EAAc4M,EAAIrT,EAAc2K,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,MAAMC,EAAmB5D,EAAiB2D,GAG1CtN,EAAe+W,GAAkBxJ,IAC/BxE,EAAayE,GACbtD,EACA2M,EACA1M,EAAoBiE,GACpBjE,EAAoBmD,GAGtBtN,EAAe+W,GAAkBxJ,IAC/BxE,EAAayE,GACbtD,EACA9I,EACA+I,EAAoBmD,GACpB7J,EAAc2K,GAGhBpO,EAAe+W,GAAkBxJ,IAC/BxE,EAAayE,GACbtD,EACArG,EACAJ,EAAc2K,GACd3K,EAAc6J,EACjB,CACF,CACF,CACF,KAC0B,OAAlBnK,GACTnL,EAAS,0EAkBX,OAbkC,IAAI4W,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkC5O,EAAgBD,GAE5EnI,EAAS,8CAEF,CACLmI,iBACAC,iBAEJ,CDsC8C+W,CACpCzN,EACAlG,KAAK0I,mBACL1I,KAAKyS,uBAOPzV,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,cACrC,MACI,GAA0B,uBAAtBgD,KAAKwS,aAAuC,CAErD,MAAMoB,EEnKL,SAAoC1N,EAAUwC,GACnDlU,EAAS,6CAGT,MAAM6O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACFnL,EAAS,2CAEU,cAAjBoL,GACFpL,EAAS,wFAIX,MAAMid,EAAqB5L,EAYrB6N,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/B/B,EAAkB,IAAIxc,IACtBwe,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAIlS,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAImS,EAAc,EAAGA,EAAcH,EAAmB7f,OAAQggB,IAAe,CAChF,MAAMC,EAAetQ,EAAI9B,GAAcgS,EAAmBG,IAAgB,EACrElC,EAAgBoC,IAAID,KACvBnC,EAAgBvZ,IAAI0b,EAAcF,GAClCD,EAAoB9R,KAAKiS,GACzBF,IAEH,CAEH,MAAMlC,EAAqBkC,EACrBhC,EAAY,EAAIH,EAAqBC,EAE3Cpd,EACE,uBAAuBmd,0BAA2CC,0BAA2CE,gBAI/G,IAAInV,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAI6G,EAAY,EAAGA,EAAYuO,EAAWvO,IAAa,CAC1D5G,EAAe4G,GAAa,EAC5B7G,EAAeqF,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CxJ,EAAe6G,GAAW2C,GAAY,CAEzC,CAGD,MAAMgO,EAAyB,IAAItU,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEVqU,EAAyB,IAAIvU,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIwS,EAAsB,GAC1B,IAAK,IAAIzN,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEyN,EAAoBzN,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAI0N,EAAuB,GAC3B,IAAK,IAAI1N,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAMqN,EAAetQ,EAAI9B,GAAcgS,EAAmBjN,IAAmB,EAC7E0N,EAAqB1N,GAAkBkL,EAAgBjY,IAAIoa,EAC5D,CAGD,IAAK,IAAIpJ,EAAmB,EAAGA,EAAmBpF,EAAYzR,OAAQ6W,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAYzR,OAAQkX,IAAoB,CAExF,MAAMqJ,EAAuCJ,EAAuBlU,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRsJ,EAAuCJ,EAAuBnU,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAemU,EAAqCnU,cACpDC,sBAAuBkU,EAAqClU,sBAC5DC,sBAAuBiU,EAAqCjU,sBAC5D+C,oBACAY,oBACAqC,iBAAkB+N,EAClB9N,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAG5D2J,EAAe/O,EAAamF,GAAoBnF,EAAawF,GAAoBrE,EAGvF,IAAK,IAAIkE,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAI2J,EAAcL,EAAoBtJ,GAClC4J,EAAQD,EACRE,EAAQhD,EAAqB8C,EAEjC,IAAK,IAAIzK,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAI4K,EAAcR,EAAoBpK,GAClC6K,EAAQD,EACRE,EAAQnD,EAAqBiD,EAG7BG,EA9DH,GA+DEP,GAEA3N,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAG/DtN,EAAegY,GAAOG,IAAUE,EAChCrY,EAAeiY,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAI3C,EAAO,EAAIV,EAAqB0C,EAAqBW,GAErDC,EACFT,EACAD,EAAqCpU,cAAc6U,GACnDnO,EAAoBiE,GAElBoK,EACFV,EACAD,EAAqCpU,cAAc6U,GACnD7N,EAAoB2D,GAGtBpO,EAAegY,GAAOrC,IAAS4C,EAG/BvY,EAAeiY,GAAOtC,IAAS6C,EAG/BxY,EAAe2V,GAAMqC,KAAWO,EAChCvY,EAAe2V,GAAMsC,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAIxD,GACjCjJ,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAGqBtG,kCAAkC5O,EAAgBD,GACzEnI,EAAS,2CAEF,CACLmI,iBACAC,iBACAgV,qBACAC,qBACAiC,sBAEJ,CFpDiCsB,CAA2BlP,EAAUlG,KAAK0I,oBACrE/L,EAAiBiX,EAAmBjX,eACpCC,EAAiBgX,EAAmBhX,eAMpCI,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,eAGpCgD,KAAKqV,sBAAwB,CAC3BzD,mBAAoBgC,EAAmBhC,mBACvCC,mBAAoB+B,EAAmB/B,mBACvCiC,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHAxf,QAAQqK,QAAQ,oBAChBnK,EAAS,6BAEF,CAAEwI,iBAAgB6T,mBAC1B,CAQD,gBAAMyE,CAAWrW,EAAepC,EAAU,IACnCmD,KAAKwS,cAAiBxS,KAAK4F,YAAe5F,KAAK0I,oBAClD/T,EAAS,mFAGX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBxI,EAAS,qBACT,MAAM0R,EAAWP,EAAY3F,KAAK4F,YAClCpR,EAAS,8BACT,MAAMqc,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJAzP,EAAS,gCACTF,QAAQ6I,KAAK,oBAEb3I,EAAS,iBAAiBwL,KAAKwS,gBACL,yBAAtBxS,KAAKwS,iBACJ7V,iBAAgBC,kBAAmB+N,EAA0BzE,EAAUlG,KAAK0I,qBAErD,eAAtB1I,KAAKtD,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHA5J,QAAQqK,QAAQ,oBAChBnK,EAAS,6BAEF,CAAEwI,iBAAgB6T,mBAC1B,EGpQE,MAAC0E,GAAoB3W,MAAO4W,IAC/B,IAAI/V,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClBwG,mBAAoB,GACpBtG,kBAAmB,CAAE,EACrBqT,MAAO,EACPC,OAAO,EACPC,SAAU,IACVrS,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAMiU,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNre,KAAKse,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnBtQ,EAAa,EACbuQ,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAExK,YAAa,GACrCyK,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAM9hB,QAAQ,CAC/B,MAAMujB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACF3W,EAAOgW,MAAQgC,WAAWD,EAAM,IAChC/X,EAAOiW,MAAqB,MAAb8B,EAAM,GACrB/X,EAAOkW,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAM9T,EAAYoV,SAASF,EAAM,GAAI,IAC/BjV,EAAMmV,SAASF,EAAM,GAAI,IAC/B,IAAIlhB,EAAOkhB,EAAMzf,MAAM,GAAGyE,KAAK,KAAKmb,QAAQ,SAAU,IAEtDlY,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWhM,QAC/C,MAGI,GAAgB,aAAZ8f,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbU,OAAQF,SAASF,EAAM,GAAI,IAC3B3B,OAAQ6B,SAASF,EAAM,GAAI,IAC3BK,SAAUH,SAASF,EAAM,GAAI,IAC7BM,QAASJ,SAASF,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAaU,SAAQT,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAM5U,EAAMmV,SAASF,EAAM,GAAI,IACzBO,EAAcL,SAASF,EAAM,GAAI,IACjCQ,EAAWR,EAAMzf,MAAM,EAAG,EAAIggB,GAAapgB,KAAKqD,GAAM0c,SAAS1c,EAAG,MACxE4a,EAAkBC,OAAOtT,GAAOyV,EAChCX,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaW,WAAUV,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBoB,SAASF,EAAM,GAAI,IACtCxR,EAAa0R,SAASF,EAAM,GAAI,IAChC/X,EAAO4D,kBAAoB,IAAIxH,MAAMmK,GAAY7J,KAAK,GACtDsD,EAAOwE,kBAAoB,IAAIpI,MAAMmK,GAAY7J,KAAK,QACjD,GAAIoa,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjByB,IAAKP,SAASF,EAAM,GAAI,IACxBjV,IAAKmV,SAASF,EAAM,GAAI,IACxBU,WAAYR,SAASF,EAAM,GAAI,IAC/Bf,SAAUiB,SAASF,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAIzb,KAAKwc,EAGZ,GAFAd,EAAS1U,KAAK0V,SAAS1c,EAAG,KAC1B2b,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAM0B,EAAUzB,EAASE,GAA4B,EACrDnX,EAAO4D,kBAAkB8U,GAAWV,WAAWD,EAAM,IACrD/X,EAAOwE,kBAAkBkU,GAAWV,WAAWD,EAAM,IACrD/X,EAAO6D,cACP7D,EAAOyE,cACP0S,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBa,SAASF,EAAM,GAAI,IACzBE,SAASF,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoBxK,YAC7EwK,EAAsB,CACpBkB,IAAKP,SAASF,EAAM,GAAI,IACxBjV,IAAKmV,SAASF,EAAM,GAAI,IACxBY,YAAaV,SAASF,EAAM,GAAI,IAChCjL,YAAamL,SAASF,EAAM,GAAI,KAGlC/X,EAAOkC,aAAaoV,EAAoBqB,cACrC3Y,EAAOkC,aAAaoV,EAAoBqB,cAAgB,GAAKrB,EAAoBxK,YAEpFyK,EAA2B,OACtB,GAAIA,EAA2BD,EAAoBxK,YAAa,CACrE,MAAM8L,EAAcb,EAAMzf,MAAM,GAAGJ,KAAKsG,GAAMyZ,SAASzZ,EAAG,MAG1D,IAAIqa,EAAcvB,EAAoBxU,IACtC,GAAgC,IAA5BwU,EAAoBkB,IAAW,CACjC,MAAMM,EAAS3C,EAAkBC,OAAOkB,EAAoBxU,KACxDgW,GAAUA,EAAOvkB,OAAS,IAAGskB,EAAcC,EAAO,GACvD,CAEuC,IAApCxB,EAAoBqB,aAAyD,IAApCrB,EAAoBqB,aAC1DnB,EAAsBqB,KAAcrB,EAAsBqB,GAAe,IAC9ErB,EAAsBqB,GAAatW,KAAKqW,GAEnC5Y,EAAO2C,kBAAkBkW,KAAc7Y,EAAO2C,kBAAkBkW,GAAe,IACpF7Y,EAAO2C,kBAAkBkW,GAAatW,KAAKqW,IACE,IAApCtB,EAAoBqB,YAC7B3Y,EAAO6B,eAAeE,iBAAiBQ,KAAKqW,GACC,IAApCtB,EAAoBqB,aAAyD,KAApCrB,EAAoBqB,aACtE3Y,EAAO6B,eAAeC,aAAaS,KAAKqW,GAG1CrB,IACIA,IAA6BD,EAAoBxK,cACnDuK,IACAC,EAAsB,CAAExK,YAAa,GAExC,CAGH8J,GACD,CAkBD,OAfA5W,EAAOwC,gBAAgBI,SAASpK,IAC9B,GAAuB,IAAnBA,EAAKqK,UAAiB,CACxB,MAAMkW,EAAQvB,EAAsBhf,EAAKsK,MAAQ,GAC7CiW,EAAMxkB,OAAS,GACjByL,EAAOiJ,mBAAmB1G,KAAK,CAC7B1L,KAAM2B,EAAK3B,KACXiM,IAAKtK,EAAKsK,IACViW,SAGL,KAGH/jB,EAAS,+CAA+CgN,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,EC9PR,SAASgZ,GAAaC,EAAOjZ,EAAQkZ,EAAUC,GACpDtkB,QAAQ6I,KAAK,gBACb,MAAMkG,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClD7T,EAAiByC,EAAOzC,eACxBwV,EAAekG,EAAMlG,aACrB1S,EAAgB4Y,EAAM9S,WAAW9F,cAGvC,GAFiB6F,EAAY+S,EAAM9S,YAEb,OAAlB9F,GAAuC,SAAb6Y,EAAqB,CAEjD,IAAIE,EAEFA,EADE7b,EAAehJ,OAAS,GAAK6H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAMid,KAAKzV,GAEvB,IAAI0V,EAAW,CACb7a,EAAGmF,EACHwB,EAAGgU,EACHG,KAAM,QACNxhB,KAAM,UACN+f,KAAM,CAAE0B,MAAO,mBAAoBC,MAAO,GAC1C5iB,KAAM,YAGJ6iB,EAAiBllB,KAAKmlB,IAAIC,OAAOC,WAAY,KAI7CC,EAAS,CACXC,MAAO,eAAehH,IACtB0G,MALcjlB,KAAKmlB,IAAID,EAAgB,KAMvCM,OALe,IAMfC,MAAO,CAAEF,MAAO,KAChBG,MAAO,CAAEH,MAAO,YAChBI,OAAQ,CAAE3D,EAAG,GAAIlb,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,KAGpC8b,OAAOC,QAAQlB,EAAW,CAACG,GAAWQ,EAAQ,CAAEQ,YAAY,IAC5DzlB,QAAQqK,QAAQ,eACjB,MAAM,GAAsB,OAAlBmB,GAAuC,YAAb6Y,EAAwB,CAE3D,IAAIqB,EAEFA,EADEne,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAImc,EAAiBllB,KAAKmlB,IAAIC,OAAOC,WAAY,KAC7CW,EAAOhmB,KAAKmlB,OAAO/V,GACnBrC,EAAO/M,KAAKuK,OAAO6E,GACnB6W,EAAOjmB,KAAKmlB,OAAOnV,GAInBkW,GAHOlmB,KAAKuK,OAAOyF,GAEFiW,IADPlZ,EAAOiZ,GAGjBG,EAAYnmB,KAAKmlB,IAAID,EAAgB,KAIrCI,EAAS,CACXC,MAAO,GAAGb,YAAmBnG,IAC7B0G,MAAOkB,EACPX,OANeW,EAAYD,EAO3BT,MAAO,CAAEF,MAAO,KAChBG,MAAO,CACLH,MAAO,IACPa,YAAa,IACbC,WAAY,GAEdV,OAAQ,CAAE3D,EAAG,GAAIlb,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,IAClCwc,UAAW,WAITC,EAAc,CAChBtc,EAAGmF,EACHwB,EAAGZ,EACHwW,EAAGT,EACHxiB,KAAM,UACN+f,KAAM,CACJmD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRtB,MAAO,YAETljB,KAAM,kBAGRujB,OAAOC,QAAQlB,EAAW,CAAC4B,GAAcjB,EAAQ,CAAEQ,YAAY,IAC/DzlB,QAAQqK,QAAQ,eACjB,CACH,CASO,SAASoc,GAAyBrC,EAAOjZ,EAAQkZ,EAAUC,GAChEtkB,QAAQ6I,KAAK,gBACb,MAAMkG,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClD/Q,EAAgB4Y,EAAM9S,WAAW9F,cACjCoG,EAAWP,EAAY+S,EAAM9S,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe4Y,EAAM9S,WAAW9F,cAChCC,aAAc2Y,EAAM9S,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAb6Y,QAEvB,GAAsB,OAAlB7Y,GAAuC,YAAb6Y,EAAwB,CAC3D,MAAMqC,EAAsB,GACtBC,EAAsB,GACtBC,EAAUjnB,KAAKuK,OAAO6E,GAAqBpP,KAAKmlB,OAAO/V,GACvD8X,EAAUlnB,KAAKuK,OAAOyF,GAAqBhQ,KAAKmlB,OAAOnV,GACvDmX,EAAkB,GAClBC,EAAYpnB,KAAKqnB,MAAMJ,EAAUE,GACjCG,EAAYtnB,KAAKqnB,MAAMH,EAAUC,GACjCI,EAAYN,GAAWG,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBV,EAAoB,GAAK/mB,KAAKmlB,OAAO/V,GACrC4X,EAAoB,GAAKhnB,KAAKmlB,OAAOnV,GAErC,IAAK,IAAI0X,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBW,GAAiBX,EAAoB,GACzDC,EAAoBU,GAAiBV,EAAoB,GAAKU,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAMtX,EAAQsX,EAAgBL,EAC9BP,EAAoB1W,GAAS0W,EAAoB,GAAKY,EAAgBJ,EACtEP,EAAoB3W,GAAS2W,EAAoB,GAEjD,IAAK,IAAIU,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoB1W,EAAQqX,GAAiBX,EAAoB1W,GACjE2W,EAAoB3W,EAAQqX,GAAiBV,EAAoB3W,GAASqX,EAAgBF,CAE7F,CAKDC,EAAc,IAAI7f,MAAMwf,EAAYE,GAAWpf,KAAK,MAGpD,MAAM0f,EZwKH,SAA6B3V,GAClC,IAGI4V,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAM5Y,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJT+b,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBhc,IACY,WAAjBC,EACF+b,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjB/b,IACT+b,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBha,EAAiBlO,OAAQkoB,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4Bja,EAAiBga,GAAeloB,OAC5DmoB,IACA,CACAJ,EAAqBE,GACnB/Z,EAAiBga,GAAeC,GAClCF,IAEA,MAAOpa,EAAciB,GAAQZ,EAAiBga,GAAeC,GAC7D,IAAIC,EAA2BN,EAAchZ,GACzCuZ,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyBpoB,OAClDuoB,IACA,CACA,MAAMxT,EAAkBpF,EAAI9B,GAAcua,EAAyBG,IAA2B,EAE9FF,EAAqBra,KAAKqB,EAAkB0F,IAC5CuT,EAAqBta,KAAKiC,EAAkB8E,GAC7C,CAGD,IAAK,IAAIyT,EAAI,EAAGA,EAAIH,EAAqBroB,OAAS,EAAGwoB,IACnDR,EAAsBha,KAAK,CACzB,CAACqa,EAAqBG,GAAIF,EAAqBE,IAC/C,CAACH,EAAqBG,EAAI,GAAIF,EAAqBE,EAAI,KAG5D,CAEH,OAAOR,CACT,CYpP6BS,CAAoBvW,IAGvCwW,cAAEA,EAAaC,cAAEA,GZuIpB,SAA8BzW,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkBrP,OAC/BuS,EAAkB5C,EAAI,GAAG3P,OAGzB0oB,EAAgB7gB,MAAMid,KAAK,CAAE9kB,OAAQgS,IAAc,IAAM,KACzD2W,EAAgB9gB,MAAMmK,GAAY7J,KAAK,GAG7C,IAAK,IAAIygB,EAAY,EAAGA,EAAYjZ,EAAI3P,OAAQ4oB,IAC9C,IAAK,IAAIhW,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAIiZ,GAAWhW,GAAkB,EAGnD+V,EAAcnZ,GAAamZ,EAAcnZ,GAAa,EAGtDkZ,EAAclZ,GAAWxB,KAAK4a,EAC/B,CAGH,MAAO,CAAEF,gBAAeC,gBAC1B,CY9J6CE,CAAqB3W,GAC9D,IAAI4W,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAe1B,EAAYE,EAAWwB,IAAgB,CAE/E,IACGC,GACChC,EAAoB+B,GACpB9B,EAAoB8B,GACpBlB,GAGF,SAEF,IAAIoB,GAAQ,EACZ,IACE,IAAIrW,EAAiB,EACrBA,EAAiBV,EAASvC,IAAImZ,GAAmB9oB,OACjD4S,IACA,CACA,IAAImC,EAAkB7C,EAASvC,IAAImZ,GAAmBlW,GAAkB,EACxE,IACE,IAAIsW,EAAwB,EAC5BA,EAAwBP,EAAc5T,GACtCmU,IACA,CACA,IAAIhO,EAAiBwN,EAAc3T,GAAiBmU,GACpD,MAAMC,EAAeC,GACnB1E,EACAxS,EACAzG,EACAyP,EACA8L,EAAoB+B,GACpB9B,EAAoB8B,GACpB3W,GAGF,GAAI+W,EAAaxV,OAAQ,CACvBmV,EAAoB5N,EACpBwM,EAAYqB,GAAgBI,EAAajnB,MACzC+mB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAI/N,EAAiB,EAAGA,EAAiBhJ,EAASvC,IAAI3P,OAAQkb,IAAkB,CACnF,MAAMiO,EAAeC,GACnB1E,EACAxS,EACAzG,EACAyP,EACA8L,EAAoB+B,GACpB9B,EAAoB8B,GACpB3W,GAGF,GAAI+W,EAAaxV,OAAQ,CACvBmV,EAAoB5N,EACpBwM,EAAYqB,GAAgBI,EAAajnB,MACzC+mB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAI9D,EAAiBllB,KAAKmlB,IAAIC,OAAOC,WAAY,KAC7Ca,EAAcgB,EAAUD,EACxBd,EAAYnmB,KAAKmlB,IAAID,EAAgB,KACrCkE,EAAajD,EAAYD,EAGzBZ,EAAS,CACXC,MAAO,GAAGb,2BAAkCD,EAAMlG,eAClD0G,MAAOkB,EACPX,OAAQ4D,EACR3D,MAAO,CAAEF,MAAO,KAChBG,MAAO,CACLH,MAAO,IACPa,YAAa,IACbC,WAAY,GAEdV,OAAQ,CAAE3D,EAAG,GAAIlb,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,IAClCwc,UAAW,WAITC,EAAc,CAChBtc,EAAG8c,EACHnW,EAAGoW,EACHR,EAAGiB,EACHlkB,KAAM,UACN8lB,aAAa,EACbC,aAAa,EACbhG,KAAM,CACJmD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRtB,MAAO,YAETljB,KAAM,+BAGRujB,OAAOC,QAAQlB,EAAW,CAAC4B,GAAcjB,EAAQ,CAAEQ,YAAY,IAC/DzlB,QAAQqK,QAAQ,eACjB,CACH,CAaA,SAASye,GACP1E,EACAxS,EACAzG,EACAyP,EACAsO,EACAC,EACArX,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClDtK,EAAkBL,EAASvC,IAAIuL,GAAgBlb,OAErD,GAAwB,IAApBuS,EAAuB,CAoBzB,MAAMmX,EAAa9V,EAAyB4V,EAAoBC,EAlBjD,CACb,CACEpa,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIwO,EAAW/V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOynB,GACLjF,EACAxS,EACAzG,EACAyP,EACAwO,EAAWxd,IACXwd,EAAWvd,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMmX,EAAa9V,EAAyB4V,EAAoBC,EAlBjD,CACb,CACEpa,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIwO,EAAW/V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOynB,GACLjF,EACAxS,EACAzG,EACAyP,EACAwO,EAAWxd,IACXwd,EAAWvd,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOzR,MAAO,KACjC,CAaA,SAASynB,GAAsBjF,EAAOxS,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAMpJ,EAAiByC,EAAOzC,eACxBuJ,EAAkBL,EAASvC,IAAI9B,GAAc7N,OAInD,IAGIgmB,EAHA5Z,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/C4Z,EADEne,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAI4gB,EAA6B,EACjC,IAAK,IAAIhX,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DgX,GACE5D,EAAM9T,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOgX,CACT,CASA,SAASZ,GAAmB9e,EAAG2G,EAAGgZ,GAChC,IAAIlW,GAAS,EACb,IAAK,IAAI5T,EAAI,EAAGA,EAAI8pB,EAAS7pB,OAAQD,IAAK,CACxC,OAAQ+pB,EAAIC,IAAMC,EAAIC,IAAOJ,EAAS9pB,GACpBgqB,EAAKlZ,GAAMoZ,EAAKpZ,GAAK3G,GAAM8f,EAAKF,IAAOjZ,EAAIkZ,IAAQE,EAAKF,GAAMD,IACjEnW,GAAUA,EAC1B,CACD,OAAOA,CACT,CC5bO,MAAMuW,GAKX,WAAA3kB,GACEyG,KAAKd,OAAS,KACdc,KAAKme,UAAY,KACjBne,KAAKoe,SAAU,EAEfpe,KAAKqe,aACN,CAOD,iBAAMA,GACJ,IACEre,KAAKd,OAAS,IAAIC,OAAO,IAAIC,IAAI,iCAAkCC,KAAM,CACvE7H,KAAM,WAGRwI,KAAKd,OAAOof,QAAWC,IACrBjqB,QAAQ8E,MAAM,iCAAkCmlB,EAAM,EAExD,MAAMC,EAAgBlf,EAAaU,KAAKd,QAExCc,KAAKme,gBAAkB,IAAIK,EAE3Bxe,KAAKoe,SAAU,CAChB,CAAC,MAAOhlB,GAEP,MADA9E,QAAQ8E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAMqlB,GACJ,OAAIze,KAAKoe,QAAgB1lB,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAAS+lB,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACI3e,KAAKoe,QACPzlB,IACSgmB,GANO,GAOhBD,EAAO,IAAItoB,MAAM,2CAEjByoB,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAMjM,CAAeC,GAEnB,aADM5S,KAAKye,eACJze,KAAKme,UAAUxL,eAAeC,EACtC,CAOD,mBAAMC,CAAcjN,GAElB,aADM5F,KAAKye,eACJze,KAAKme,UAAUtL,cAAcjN,EACrC,CAQD,0BAAMkN,CAAqBjK,EAAakK,GAEtC,aADM/S,KAAKye,eACJze,KAAKme,UAAUrL,qBAAqBjK,EAAakK,EACzD,CAOD,qBAAMC,CAAgBtW,GAEpB,aADMsD,KAAKye,eACJze,KAAKme,UAAUnL,gBAAgBtW,EACvC,CAMD,WAAMuW,SACEjT,KAAKye,eACOK,YAAYC,MAC9B,MAAMtf,QAAeO,KAAKme,UAAUlL,QAEpC,OADgB6L,YAAYC,MACrBtf,CACR,CAMD,kBAAMuf,GAEJ,aADMhf,KAAKye,eACJze,KAAKme,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADMjf,KAAKye,eACJze,KAAKme,UAAUc,MACvB,CAKD,SAAArf,GACMI,KAAKd,SACPc,KAAKd,OAAOU,YACZI,KAAKd,OAAS,KACdc,KAAKme,UAAY,KACjBne,KAAKoe,SAAU,EAElB,ECnJS,MAACc,GAAe"}
\ No newline at end of file
+{"version":3,"file":"feascript.esm.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditionsScript.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/readers/gmshReaderScript.js","../src/visualization/plotlyPlotScript.js","../src/visualization/vtkPlotScript.js","../src/workers/workerScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\",\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : (jacobianMatrix?.toArray?.() ?? jacobianMatrix);\n  const b = Array.isArray(residualVector) ? residualVector : (residualVector?.toArray?.() ?? residualVector);\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => {});\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`,\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`,\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\",\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder,\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`,\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`,\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag,\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`,\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5,\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`,\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(\n    Math.ceil(Math.sqrt(numElements)) * nodesPerElement,\n    nodesPerElement * 2,\n  );\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        )\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions,\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag },\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag, // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\",\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the model configuration\n   * @param {string} modelConfig - Parameter specifying the type of model\n   * @param {object} [options] - Optional additional configuration\n   */\n  setModelConfig(modelConfig, options = {}) {\n    this.solverConfig = modelConfig;\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${modelConfig}`);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as\n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions,\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\",\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions,\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          },\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex],\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments,\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { errorLog } from \"../utilities/loggingScript.js\";\n\nlet _vtkModules = null;\n\n/**\n * Lazily loads and caches vtk.js modules required for rendering\n * @returns {Promise<object>} Object containing vtk.js module references\n */\nasync function loadVtkModules() {\n  if (_vtkModules) return _vtkModules;\n  await import(\"@kitware/vtk.js/Rendering/Profiles/Geometry.js\");\n  const [\n    { default: vtkActor },\n    { default: vtkColorTransferFunction },\n    { default: vtkColorMaps },\n    { default: vtkDataArray },\n    { default: vtkImageData },\n    { default: vtkImageMarchingSquares },\n    { default: vtkGenericRenderWindow },\n    { default: vtkMapper },\n    { default: vtkPolyData },\n    { default: vtkScalarBarActor },\n  ] = await Promise.all([\n    import(\"@kitware/vtk.js/Rendering/Core/Actor.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js\"),\n    import(\"@kitware/vtk.js/Common/Core/DataArray.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/ImageData.js\"),\n    import(\"@kitware/vtk.js/Filters/General/ImageMarchingSquares.js\"),\n    import(\"@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/Mapper.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/PolyData.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ScalarBarActor.js\"),\n  ]);\n  _vtkModules = {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkDataArray,\n    vtkImageData,\n    vtkImageMarchingSquares,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkPolyData,\n    vtkScalarBarActor,\n  };\n  return _vtkModules;\n}\n\nconst rendererCache = new Map();\n\n/**\n * Creates a color scale configuration for visualization\n * @param {object} options - Color scale options\n * @param {string} [options.presetName=\"Cool to Warm\"] - Color map preset name\n * @param {boolean} [options.reverse=false] - Whether to reverse the color map\n * @param {boolean} [options.showScalarBar=true] - Whether to display the scalar bar\n * @param {string} [options.scalarBarTitle=\"Solution\"] - Title for the scalar bar\n * @returns {object} Color scale configuration object\n */\nexport function createColorScale(options = {}) {\n  return {\n    presetName: options.presetName ?? \"Cool to Warm\",\n    reverse: options.reverse ?? false,\n    showScalarBar: options.showScalarBar ?? true,\n    scalarBarTitle: options.scalarBarTitle ?? \"Solution\",\n  };\n}\n\n/**\n * Creates contour line options for visualization\n * @param {object} options - Contour line options\n * @param {boolean} [options.enabled=true] - Whether contour lines are enabled\n * @param {number} [options.numberOfContours=12] - Number of contour lines\n * @param {Array<number>} [options.color=[0.15,0.15,0.15]] - RGB color array for contour lines\n * @param {number} [options.lineWidth=1] - Width of contour lines\n * @returns {object} Contour line configuration object\n */\nexport function createContourLineOptions(options = {}) {\n  return {\n    enabled: options.enabled ?? true,\n    numberOfContours: options.numberOfContours ?? 12,\n    color: options.color ?? [0.15, 0.15, 0.15],\n    lineWidth: options.lineWidth ?? 1,\n  };\n}\n\n/**\n * Plots the FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"line\", \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig);\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n    mode: meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n  });\n  await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Plots an interpolated FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotInterpolatedSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  if (model.meshConfig.meshDimension !== \"2D\" || plotType !== \"contour\") {\n    // Fallback to non-interpolated for non-2D contour cases\n    const meshData = prepareMesh(model.meshConfig);\n    const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n      mode: model.meshConfig.meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n    });\n    await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n    console.timeEnd(\"plottingTime\");\n    return;\n  }\n  const meshData = prepareMesh(model.meshConfig);\n  const interpolatedVtkData = await buildInterpolatedVtkData(model, result, meshData);\n  await renderVtkScene(\n    interpolatedVtkData,\n    plotDivId,\n    model.solverConfig,\n    `${plotType}-interpolated`,\n    renderOptions,\n  );\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Transforms solver output into VTK-compatible data structures\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<object>} VTK data object with points, scalars, cells, polyData, and metadata\n */\nexport async function transformSolverOutputToVtkData(model, result, meshData = null, options = {}) {\n  const preparedMesh = meshData ?? prepareMesh(model.meshConfig);\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionArray = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const points = buildPointsArray(nodesXCoordinates, nodesYCoordinates);\n\n  const mode = options.mode ?? \"surface\";\n  const cells =\n    mode === \"line\"\n      ? buildLineCellsFromPoints(nodesXCoordinates.length)\n      : buildCellArrayFromNop(preparedMesh.nop ?? []);\n\n  const polyData = await buildPolyData(points, solutionArray, cells, mode);\n\n  return {\n    points,\n    scalars: solutionArray,\n    cells,\n    polyData,\n    mode,\n    metadata: {\n      solverConfig: model.solverConfig,\n      meshDimension: model.meshConfig.meshDimension,\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n    },\n  };\n}\n\n/**\n * Transforms solver output into a VTP (VTK PolyData XML) string\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<string>} VTP XML string\n */\nexport async function transformSolverOutputToVTP(model, result, meshData = null, options = {}) {\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, options);\n  return buildVTPString(vtkData);\n}\n\n/**\n * Transforms solver output into typed array buffers suitable for ML pipelines\n * @param {object} result - Object containing solution vector and node coordinates\n * @returns {object} Object with features (Float32Array), featuresShape, labels, and points\n */\nexport function transformSolverOutputToMLBuffers(result) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const scalars = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const features = new Float32Array(nodesXCoordinates.length * 3);\n\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    features[base] = Number(nodesXCoordinates[i]) || 0;\n    features[base + 1] = Number(nodesYCoordinates[i]) || 0;\n    features[base + 2] = scalars[i];\n  }\n\n  return {\n    features,\n    featuresShape: [nodesXCoordinates.length, 3],\n    labels: scalars,\n    points: buildPointsArray(nodesXCoordinates, nodesYCoordinates),\n  };\n}\n\n// VTK rendering\n\nasync function renderVtkScene(vtkData, plotDivId, solverConfig, plotType, renderOptions = {}) {\n  if (typeof document === \"undefined\") {\n    errorLog(\"vtk.js visualization requires a browser environment\");\n    return;\n  }\n  const {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkScalarBarActor,\n  } = await loadVtkModules();\n\n  const container = document.getElementById(plotDivId);\n  if (!container) {\n    errorLog(`Could not find plot container with id: ${plotDivId}`);\n    return;\n  }\n\n  if (rendererCache.has(plotDivId)) {\n    rendererCache.get(plotDivId).delete();\n    rendererCache.delete(plotDivId);\n  }\n\n  container.innerHTML = \"\";\n  container.style.position = \"relative\";\n  container.style.width = container.style.width || \"100%\";\n  container.style.height = container.style.height || \"420px\";\n\n  const genericRenderWindow = vtkGenericRenderWindow.newInstance({ background: [1, 1, 1] });\n  genericRenderWindow.setContainer(container);\n  genericRenderWindow.resize();\n\n  const renderer = genericRenderWindow.getRenderer();\n  const renderWindow = genericRenderWindow.getRenderWindow();\n\n  const mapper = vtkMapper.newInstance();\n  mapper.setInputData(vtkData.polyData);\n  mapper.setScalarModeToUsePointData();\n  mapper.setColorModeToMapScalars();\n  mapper.setScalarVisibility(true);\n\n  const scalarRange = getScalarRange(vtkData.scalars);\n  mapper.setScalarRange(scalarRange[0], scalarRange[1]);\n\n  const colorScale = renderOptions.colorScale ?? createColorScale({});\n  const lookupTable = vtkColorTransferFunction.newInstance();\n  const preset =\n    vtkColorMaps.getPresetByName(colorScale.presetName) ?? vtkColorMaps.getPresetByName(\"Cool to Warm\");\n  const mappedPreset = reverseColorMapPreset(preset, colorScale.reverse);\n  lookupTable.applyColorMap(mappedPreset);\n  lookupTable.setMappingRange(scalarRange[0], scalarRange[1]);\n  lookupTable.updateRange();\n  mapper.setLookupTable(lookupTable);\n\n  const actor = vtkActor.newInstance();\n  actor.setMapper(mapper);\n  if (vtkData.mode === \"line\") actor.getProperty().setLineWidth(3);\n  renderer.addActor(actor);\n\n  if (colorScale.showScalarBar) {\n    const scalarBarActor = vtkScalarBarActor.newInstance({\n      drawNanAnnotation: false,\n      generateTicks: (helper) => {\n        const bounds = helper.getLastTickBounds();\n        if (!bounds || bounds.length < 2) return;\n        const [minVal, maxVal] = bounds;\n        const count = 5;\n        const step = (maxVal - minVal) / (count - 1);\n        const ticks = Array.from({ length: count }, (_, i) => minVal + i * step);\n        helper.setTicks(ticks);\n        helper.setTickStrings(\n          ticks.map((v) => {\n            const abs = Math.abs(v);\n            if (abs === 0) return \"0\";\n            if (abs >= 0.01 && abs < 10000) return parseFloat(v.toPrecision(4)).toString();\n            return v.toExponential(2);\n          }),\n        );\n      },\n    });\n    scalarBarActor.setTickTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisLabel(colorScale.scalarBarTitle);\n    scalarBarActor.setScalarsToColors(lookupTable);\n    renderer.addActor2D(scalarBarActor);\n  }\n\n  const contourLines = createContourLineOptions(renderOptions.contourLines ?? { enabled: false });\n  if (contourLines.enabled && vtkData.mode !== \"line\") {\n    await addContourLinesToRenderer(renderer, vtkData, scalarRange, contourLines);\n  }\n\n  renderer.resetCamera();\n  renderWindow.render();\n  rendererCache.set(plotDivId, genericRenderWindow);\n  container.title = `${plotType} plot - ${solverConfig}`;\n}\n\nasync function addContourLinesToRenderer(renderer, vtkData, scalarRange, contourOptions) {\n  const gridMeta = vtkData.metadata?.interpolationGrid;\n  if (!gridMeta) {\n    return;\n  }\n  const { vtkActor, vtkDataArray, vtkImageData, vtkImageMarchingSquares, vtkMapper } = await loadVtkModules();\n\n  const imageData = vtkImageData.newInstance();\n  imageData.setDimensions(gridMeta.nx, gridMeta.ny, 1);\n  imageData.setOrigin(gridMeta.origin[0], gridMeta.origin[1], 0);\n  imageData.setSpacing(gridMeta.spacing[0], gridMeta.spacing[1], 1);\n\n  const imageScalars = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: gridMeta.imageScalars,\n  });\n  imageData.getPointData().setScalars(imageScalars);\n\n  const contourFilter = vtkImageMarchingSquares.newInstance({\n    slicingMode: 2,\n    slice: 0,\n    mergePoints: true,\n  });\n  contourFilter.setInputData(imageData);\n\n  const n = Math.max(2, contourOptions.numberOfContours);\n  const minValue = scalarRange[0];\n  const maxValue = scalarRange[1];\n  const step = (maxValue - minValue) / (n - 1);\n  const contourValues = [];\n  for (let i = 0; i < n; i++) {\n    contourValues.push(minValue + i * step);\n  }\n  contourFilter.setContourValues(contourValues);\n  contourFilter.update();\n\n  const contourMapper = vtkMapper.newInstance();\n  contourMapper.setInputData(contourFilter.getOutputData());\n  contourMapper.setScalarVisibility(false);\n\n  const contourActor = vtkActor.newInstance();\n  contourActor.setMapper(contourMapper);\n  contourActor.getProperty().setColor(...contourOptions.color);\n  contourActor.getProperty().setLineWidth(contourOptions.lineWidth);\n  renderer.addActor(contourActor);\n}\n\n// Color map helpers\n\nfunction reverseColorMapPreset(preset, reverse) {\n  if (!reverse || !preset?.RGBPoints?.length) return preset;\n  const rgb = preset.RGBPoints;\n  const minX = rgb[0];\n  const maxX = rgb[rgb.length - 4];\n  const reversed = [];\n  for (let i = rgb.length - 4; i >= 0; i -= 4) {\n    reversed.push(maxX - (rgb[i] - minX), rgb[i + 1], rgb[i + 2], rgb[i + 3]);\n  }\n  return { ...preset, RGBPoints: reversed };\n}\n\n// Data building helpers\n\nasync function buildPolyData(points, scalars, cells, mode = \"surface\") {\n  const { vtkPolyData, vtkDataArray } = await loadVtkModules();\n  const polyData = vtkPolyData.newInstance();\n  polyData.getPoints().setData(points, 3);\n  if (cells.length > 0) {\n    if (mode === \"line\") polyData.getLines().setData(cells);\n    else polyData.getPolys().setData(cells);\n  }\n  const scalarData = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: scalars,\n  });\n  polyData.getPointData().setScalars(scalarData);\n  return polyData;\n}\n\nfunction buildPointsArray(nodesXCoordinates, nodesYCoordinates) {\n  const points = new Float32Array(nodesXCoordinates.length * 3);\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    points[base] = Number(nodesXCoordinates[i]) || 0;\n    points[base + 1] = Number(nodesYCoordinates?.[i]) || 0;\n    points[base + 2] = 0;\n  }\n  return points;\n}\n\nfunction extractScalarSolution(solutionVector, expectedLength) {\n  const scalars = new Float32Array(expectedLength);\n  for (let i = 0; i < expectedLength; i++) {\n    const value = solutionVector?.[i];\n    scalars[i] = Number(Array.isArray(value) ? value[0] : value) || 0;\n  }\n  return scalars;\n}\n\nfunction buildLineCellsFromPoints(totalPoints) {\n  if (totalPoints < 2) return new Uint32Array(0);\n  const packed = new Uint32Array((totalPoints - 1) * 3);\n  let offset = 0;\n  for (let i = 0; i < totalPoints - 1; i++) {\n    packed[offset++] = 2;\n    packed[offset++] = i;\n    packed[offset++] = i + 1;\n  }\n  return packed;\n}\n\nfunction buildCellArrayFromNop(nop) {\n  const packed = [];\n  for (let i = 0; i < nop.length; i++) {\n    const cell = convertElementNodesToLinearCell(nop[i]);\n    packed.push(cell.length, ...cell);\n  }\n  return Uint32Array.from(packed);\n}\n\nfunction convertElementNodesToLinearCell(elementNodes) {\n  const indices = elementNodes.map((node) => node - 1);\n  const n = indices.length;\n\n  if (n === 2 || n === 3) {\n    return indices;\n  }\n\n  if (n === 4) {\n    // FEAScript quad numbering:\n    //   1 --- 3\n    //   |     |\n    //   0 --- 2\n    // Perimeter order for VTK polygon: 0 -> 2 -> 3 -> 1\n    return [indices[0], indices[2], indices[3], indices[1]];\n  }\n\n  if (n === 6) {\n    return [indices[0], indices[2], indices[5]];\n  }\n\n  if (n === 8) {\n    // Perimeter corners for FEAScript serendipity quad:\n    //   2 --- 6\n    //   |     |\n    //   0 --- 4\n    return [indices[0], indices[4], indices[6], indices[2]];\n  }\n\n  if (n === 9) {\n    // FEAScript 9-node quad numbering:\n    //   2 -- 5 -- 8\n    //   |         |\n    //   1 -- 4 -- 7\n    //   |         |\n    //   0 -- 3 -- 6\n    // Corner perimeter order for VTK polygon: 0 -> 6 -> 8 -> 2\n    return [indices[0], indices[6], indices[8], indices[2]];\n  }\n\n  // Generic fallback for polygonal/high-order cells.\n  return indices.slice(0, Math.min(4, indices.length));\n}\n\nfunction getScalarRange(scalars) {\n  if (!scalars?.length) return [0, 1];\n  let minValue = Number.POSITIVE_INFINITY;\n  let maxValue = Number.NEGATIVE_INFINITY;\n  for (let i = 0; i < scalars.length; i++) {\n    const value = scalars[i];\n    if (!Number.isFinite(value)) continue;\n    if (value < minValue) minValue = value;\n    if (value > maxValue) maxValue = value;\n  }\n  if (!Number.isFinite(minValue) || !Number.isFinite(maxValue)) return [0, 1];\n  if (minValue === maxValue) return [minValue - 1, maxValue + 1];\n  return [minValue, maxValue];\n}\n\nfunction countPackedCells(packedCells) {\n  let count = 0,\n    offset = 0;\n  while (offset < packedCells.length) {\n    offset += packedCells[offset] + 1;\n    count++;\n  }\n  return count;\n}\n\n// VTP export\n\nfunction packedCellsToConnectivityAndOffsets(packedCells) {\n  const connectivity = [],\n    offsets = [];\n  let offset = 0,\n    running = 0;\n  while (offset < packedCells.length) {\n    const npts = packedCells[offset++];\n    for (let i = 0; i < npts; i++) connectivity.push(packedCells[offset++]);\n    running += npts;\n    offsets.push(running);\n  }\n  return { connectivity, offsets };\n}\n\nfunction buildVTPString(vtkData) {\n  const { connectivity, offsets } = packedCellsToConnectivityAndOffsets(vtkData.cells);\n  const numberOfPoints = vtkData.points.length / 3;\n  const isLine = vtkData.mode === \"line\";\n  const topologyTag = isLine ? \"Lines\" : \"Polys\";\n  return [\n    '<?xml version=\"1.0\"?>',\n    '<VTKFile type=\"PolyData\" version=\"0.1\" byte_order=\"LittleEndian\">',\n    \"  <PolyData>\",\n    `    <Piece NumberOfPoints=\"${numberOfPoints}\" NumberOfVerts=\"0\" NumberOfLines=\"${isLine ? offsets.length : 0}\" NumberOfStrips=\"0\" NumberOfPolys=\"${isLine ? 0 : offsets.length}\">`,\n    '      <PointData Scalars=\"solution\">',\n    `        <DataArray type=\"Float32\" Name=\"solution\" NumberOfComponents=\"1\" format=\"ascii\">${Array.from(vtkData.scalars).join(\" \")}</DataArray>`,\n    \"      </PointData>\",\n    \"      <Points>\",\n    `        <DataArray type=\"Float32\" NumberOfComponents=\"3\" format=\"ascii\">${Array.from(vtkData.points).join(\" \")}</DataArray>`,\n    \"      </Points>\",\n    `      <${topologyTag}>`,\n    `        <DataArray type=\"Int32\" Name=\"connectivity\" format=\"ascii\">${connectivity.join(\" \")}</DataArray>`,\n    `        <DataArray type=\"Int32\" Name=\"offsets\" format=\"ascii\">${offsets.join(\" \")}</DataArray>`,\n    `      </${topologyTag}>`,\n    \"    </Piece>\",\n    \"  </PolyData>\",\n    \"</VTKFile>\",\n  ].join(\"\\n\");\n}\n\n// Interpolation helpers\n\nasync function buildInterpolatedGridValues(model, result, meshData) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  let minX = nodesXCoordinates[0];\n  let maxX = nodesXCoordinates[0];\n  let minY = nodesYCoordinates[0];\n  let maxY = nodesYCoordinates[0];\n  for (let i = 1; i < nodesXCoordinates.length; i++) {\n    const x = nodesXCoordinates[i];\n    const y = nodesYCoordinates[i];\n    if (x < minX) minX = x;\n    if (x > maxX) maxX = x;\n    if (y < minY) minY = y;\n    if (y > maxY) maxY = y;\n  }\n\n  const lengthX = maxX - minX;\n  const lengthY = maxY - minY;\n  const visPointsPerUnit = 50;\n\n  const visNodesX = Math.max(2, Math.round(lengthX * visPointsPerUnit));\n  const visNodesY = Math.max(2, Math.round(lengthY * visPointsPerUnit));\n\n  const deltaX = lengthX / (visNodesX - 1);\n  const deltaY = lengthY / (visNodesY - 1);\n\n  const totalVisNodes = visNodesX * visNodesY;\n  const visNodeXCoordinates = new Float32Array(totalVisNodes);\n  const visNodeYCoordinates = new Float32Array(totalVisNodes);\n  const visSolution = new Float32Array(totalVisNodes);\n  visSolution.fill(Number.NaN);\n  const insideMask = new Uint8Array(totalVisNodes);\n\n  const boundarySegments = getBoundarySegments(meshData);\n  const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n\n  let lastParentElement = 0;\n  for (let ix = 0; ix < visNodesX; ix++) {\n    for (let iy = 0; iy < visNodesY; iy++) {\n      const visNodeIndex = ix * visNodesY + iy;\n      const x = minX + ix * deltaX;\n      const y = minY + iy * deltaY;\n\n      visNodeXCoordinates[visNodeIndex] = x;\n      visNodeYCoordinates[visNodeIndex] = y;\n\n      if (!pointInsidePolygon(x, y, boundarySegments)) {\n        continue;\n      }\n\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        const globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (let ni = 0; ni < neighborCount[globalNodeIndex]; ni++) {\n          const currentElement = nodeNeighbors[globalNodeIndex][ni];\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  return {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    lengthX,\n    lengthY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  };\n}\n\nasync function buildInterpolatedVtkData(model, result, meshData) {\n  const grid = await buildInterpolatedGridValues(model, result, meshData);\n  const {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  } = grid;\n\n  const points = buildPointsArray(visNodeXCoordinates, visNodeYCoordinates);\n  const cells = buildStructuredGridCells(visNodesX, visNodesY, insideMask);\n  const polyData = await buildPolyData(points, visSolution, cells, \"surface\");\n\n  return {\n    points,\n    scalars: visSolution,\n    cells,\n    polyData,\n    mode: \"surface\",\n    metadata: {\n      meshDimension: \"2D\",\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n      interpolationGrid: {\n        nx: visNodesX,\n        ny: visNodesY,\n        origin: [minX, minY],\n        spacing: [deltaX, deltaY],\n        imageScalars: reorderStructuredScalarsForImage(visSolution, visNodesX, visNodesY),\n      },\n    },\n  };\n}\n\nfunction reorderStructuredScalarsForImage(values, nx, ny) {\n  // FEAScript interpolation uses index = ix * ny + iy (y-fast).\n  // vtkImageData expects index = ix + iy * nx (x-fast).\n  const reordered = new Float32Array(nx * ny);\n  for (let iy = 0; iy < ny; iy++) {\n    for (let ix = 0; ix < nx; ix++) {\n      reordered[ix + iy * nx] = values[ix * ny + iy];\n    }\n  }\n  return reordered;\n}\n\nfunction buildStructuredGridCells(nx, ny, insideMask) {\n  const packed = [];\n\n  for (let ix = 0; ix < nx - 1; ix++) {\n    for (let iy = 0; iy < ny - 1; iy++) {\n      const n0 = ix * ny + iy;\n      const n1 = (ix + 1) * ny + iy;\n      const n2 = (ix + 1) * ny + (iy + 1);\n      const n3 = ix * ny + (iy + 1);\n\n      if (!insideMask[n0] || !insideMask[n1] || !insideMask[n2] || !insideMask[n3]) {\n        continue;\n      }\n\n      packed.push(4, n0, n1, n2, n3);\n    }\n  }\n\n  return Uint32Array.from(packed);\n}\n\n// Point search & solution interpolation\n\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  }\n\n  return { inside: false, value: null };\n}\n\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  const zData = Array.isArray(solutionVector[0]) ? solutionVector.map((value) => value[0]) : solutionVector;\n\n  let interpolatedValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    interpolatedValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return interpolatedValue;\n}\n\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotlyPlotScript.js\";\nexport {\n  plotSolutionVtk,\n  plotInterpolatedSolutionVtk,\n  createColorScale,\n  createContourLineOptions,\n  transformSolverOutputToVtkData,\n  transformSolverOutputToVTP,\n  transformSolverOutputToMLBuffers,\n} from \"./visualization/vtkPlotScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.3.0 (RC)\";\n"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","logSystem","level","console","log","basicLog","debugLog","message","errorLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","url","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","computeNodeNeighbors","nodeNeighbors","from","neighborCount","elemIndex","getBoundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","globalNodeIndex","k","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","FEAScriptModel","solverConfig","coefficientFunctions","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","has","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","importGmshQuadTri","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseFloat","parseInt","replace","points","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","plotSolution","model","plotType","plotDivId","yData","lineData","mode","color","width","maxWindowWidth","min","window","innerWidth","layout","title","height","xaxis","yaxis","margin","Plotly","newPlot","responsive","zData","minX","minY","aspectRatio","plotWidth","scaleanchor","scaleratio","hovermode","contourData","z","smoothing","contours","coloring","showlabels","colorbar","plotInterpolatedSolution","visNodeXCoordinates","visNodeYCoordinates","lengthX","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","lastParentElement","visNodeIndex","pointInsidePolygon","found","neighborElementsIndex","searchResult","pointSearch","plotHeight","connectgaps","hoverongaps","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","solutionInterpolationValue","segments","x1","y1","x2","y2","_vtkModules","loadVtkModules","import","default","vtkActor","vtkColorTransferFunction","vtkColorMaps","vtkDataArray","vtkImageData","vtkImageMarchingSquares","vtkGenericRenderWindow","vtkMapper","vtkPolyData","vtkScalarBarActor","all","rendererCache","createColorScale","presetName","reverse","showScalarBar","scalarBarTitle","createContourLineOptions","enabled","numberOfContours","lineWidth","plotSolutionVtk","renderOptions","vtkData","transformSolverOutputToVtkData","renderVtkScene","plotInterpolatedSolutionVtk","interpolatedVtkData","grid","visPointsPerUnit","totalVisNodes","Float32Array","NaN","insideMask","Uint8Array","ix","iy","ni","buildInterpolatedGridValues","buildPointsArray","cells","nx","ny","packed","n0","n1","n2","n3","Uint32Array","buildStructuredGridCells","polyData","buildPolyData","scalars","metadata","numberOfPoints","numberOfCells","countPackedCells","interpolationGrid","spacing","imageScalars","reorderStructuredScalarsForImage","buildInterpolatedVtkData","preparedMesh","solutionArray","extractScalarSolution","totalPoints","offset","buildLineCellsFromPoints","cell","convertElementNodesToLinearCell","buildCellArrayFromNop","transformSolverOutputToVTP","connectivity","offsets","packedCells","running","npts","packedCellsToConnectivityAndOffsets","isLine","topologyTag","buildVTPString","transformSolverOutputToMLBuffers","features","base","featuresShape","labels","document","container","getElementById","innerHTML","style","position","genericRenderWindow","newInstance","background","setContainer","resize","renderer","getRenderer","renderWindow","getRenderWindow","mapper","setInputData","setScalarModeToUsePointData","setColorModeToMapScalars","setScalarVisibility","scalarRange","minValue","POSITIVE_INFINITY","maxValue","NEGATIVE_INFINITY","isFinite","getScalarRange","setScalarRange","colorScale","lookupTable","mappedPreset","preset","RGBPoints","rgb","reversed","reverseColorMapPreset","getPresetByName","applyColorMap","setMappingRange","updateRange","setLookupTable","actor","setMapper","getProperty","setLineWidth","addActor","scalarBarActor","drawNanAnnotation","generateTicks","helper","bounds","getLastTickBounds","minVal","maxVal","step","ticks","setTicks","setTickStrings","toPrecision","setTickTextStyle","fontColor","setAxisTextStyle","setAxisLabel","setScalarsToColors","addActor2D","contourLines","contourOptions","gridMeta","imageData","setDimensions","setOrigin","setSpacing","numberOfComponents","values","getPointData","setScalars","contourFilter","slicingMode","mergePoints","contourValues","setContourValues","update","contourMapper","getOutputData","contourActor","setColor","addContourLinesToRenderer","resetCamera","render","getPoints","setData","getLines","getPolys","scalarData","expectedLength","elementNodes","indices","node","count","reordered","interpolatedValue","FEAScriptWorker","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","printVersion"],"mappings":"AAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,CCXA,IAAIK,EAAkB,QAMf,SAASC,EAAUC,GACV,UAAVA,GAA+B,UAAVA,GACvBC,QAAQC,IACN,+BAAiCF,EAAQ,yBACzC,sCAEFF,EAAkB,UAElBA,EAAkBE,EAClBG,EAAS,qBAAqBH,KAElC,CAMO,SAASI,EAASC,GACC,UAApBP,GACFG,QAAQC,IAAI,aAAeG,EAAS,qCAExC,CAMO,SAASF,EAASE,GACvBJ,QAAQC,IAAI,YAAcG,EAAS,qCACrC,CAMO,SAASC,EAASD,GACvBJ,QAAQC,IAAI,aAAeG,EAAS,qCACtC;;;;;;AChDA,MAAME,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACHvB,QAASuB,EAAMvB,QACf2B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAMvB,SAAUwB,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADA1C,QAAQ+C,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKxD,OACL,MAAO,CAAE4E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKxD,OAAS,GAChC,GAAIoH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAMzD,KAAKkI,MAAMlI,KAAKmI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAExF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHAzI,EAAS,wBAAwBiI,QACjCnI,QAAQ4I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC3BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE7J,OACZ,IAAIiK,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAIpK,EAAI,EAAGA,EAAIiK,EAAGjK,IAAK,CAC1B,IAAIqK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBtK,IAAMsK,IACRD,GAAOP,EAAE9J,GAAGsK,GAAKJ,EAAEI,IAGvBH,EAAKnK,IAAM+J,EAAE/J,GAAKqK,GAAOP,EAAE9J,GAAGA,EAC/B,CAGD,IAAIuK,EAAU,EACd,IAAK,IAAIvK,EAAI,EAAGA,EAAIiK,EAAGjK,IACrBuK,EAAUrK,KAAKsK,IAAID,EAASrK,KAAKuK,IAAIN,EAAKnK,GAAKkK,EAAElK,KAMnD,GAFAkK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDR+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAe3I,QAAQkI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrBvI,EAAS,8BAA8BmJ,EAAmBX,yBAE1DtI,EAAS,wCAAwCiJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACItI,EAAS,0BAA0B8H,KAMrC,OAHAnI,QAAQoK,QAAQ,iBAChBlK,EAAS,8BAEF,CAAEuI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAEnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDpI,EAAS,wBAAwBiI,QACjCnI,QAAQ4I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAkBA,GAAgBoC,aAAepC,EACrFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAkBA,GAAgBmC,aAAenC,EAE3F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAxCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,+CAAgDC,KAAM,CACtF7H,KAAM,WAEFyH,EAAgBK,EAAaJ,GAEnC,aADMD,EAAcM,aACb,CAAEN,gBAAeC,SAC1B,CAiCoBM,GAChBP,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE9J,QAAQkI,KAAK,GACpC,IAAIsD,EAEJA,QAAeR,EAAcS,mBAAmB5B,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiByC,EAAOzC,eACxBC,EAAYwC,EAAOxC,UACnBC,EAAauC,EAAOvC,WAGhBD,EACFvI,EAAS,8BAA8BwI,gBAEvCtI,EAAS,wCAAwCsI,eAEvD,MACItI,EAAS,0BAA0B8H,KAWrC,OARAnI,QAAQoK,QAAQ,iBAChBlK,EAAS,+BAA+BiI,MAEpCsC,UACIC,GAAeU,YAAY/G,OAAM,UACvCoG,EAAQE,OAAOU,aAGV,CAAE5C,iBAAgBC,YAAWC,aACtC,CEhIO,MAAM2C,EAMX,WAAAtG,EAAYuG,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADAvL,EAAS,8CAIX,GAA0B,WAAtBoL,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAAvH,EAAYwH,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACP1M,EAAS,mEACTuL,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnB1M,EAAS,sDAKPiH,MAAMiD,QAAQkB,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBzF,MAAMiD,QAAQkB,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExD9M,EACE,yDACE+M,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAatN,OAAQ4N,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAIlG,MAAMiG,EAAU7N,QAGlB,IAArB6N,EAAU7N,QAOZ8N,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAU7N,SASnB8N,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtC/M,EAAS,4FASX,GANAF,EACE,gEACE+M,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACErG,MAAMiD,QAAQkB,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBjO,OAAS,QACFwE,IAAxCuH,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAInO,EAAI,EAAGA,EAAIgM,KAAKmB,WAAWe,iBAAiBjO,OAAQD,IACvDgM,KAAKmB,WAAWe,iBAAiBlO,IACnCmO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBlO,IAGhEgM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAASpK,IAEvC,GAAuB,IAAnBA,EAAKqK,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkBnK,EAAKsK,MAAQ,GAErEH,EAAkBnO,OAAS,IAExB+L,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,OACzCvC,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExB9N,EACE,mCAAmC+N,MAAUC,mBAAuBzK,EAAKsK,QACvEtK,EAAK3B,MAAQ,cAKjB,IAAIqM,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAerN,OAC9C4N,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoB3O,QAEtB,GAAI2O,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/ChO,EACE,mBAAmBmN,gDAA2De,EAAoBpG,KAChG,UAGJ9H,EACE,UAAU+N,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,uCAAuCoO,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,qCAAqCoO,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,oCAAoCoO,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPpO,EAAS,sCAAsCoO,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAKP,KAAK,CAACH,EAAciB,IAC/DpO,EACE,8BAA8BmN,MAAiBiB,sBAAyB7K,EAAKsK,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoB3O,QAGzB2O,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/ChO,EACE,mBAAmBmN,gDAA2De,EAAoBpG,KAChG,UAGJ9H,EACE,UAAU+N,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,uCAAuCoO,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,qCAAqCoO,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPpO,EAAS,oCAAoCoO,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPpO,EAAS,sCAAsCoO,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiBjK,EAAKsK,KAAKP,KAAK,CAACH,EAAciB,IAC/DpO,EACE,8BAA8BmN,MAAiBiB,sBAAyB7K,EAAKsK,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACH/N,EACE,oDAAoD6N,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBjO,OAAS,QACFwE,IAAxCuH,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAInO,EAAI,EAAGA,EAAIgM,KAAKmB,WAAWe,iBAAiBjO,OAAQD,IACvDgM,KAAKmB,WAAWe,iBAAiBlO,IACnCmO,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBlO,IAGhEgM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAAvH,EAAYwH,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrCpM,EAAS,wFAEZ,CAED,YAAAwO,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHAhP,EAAS,iCAAmC+M,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDrM,EAAS,yCAA2C+M,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAAvH,EAAYwH,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExFtM,EACE,6GAGL,CAED,YAAAwO,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAWrQ,KAAKsQ,GAAK,IACrBC,EAAUvQ,KAAKwQ,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAWzQ,KAAKwQ,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQ5Q,KAAKuK,IAAIgG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAAS7Q,KAAKuK,IAAIkG,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJAhP,EAAS,iCAAmC+M,KAAKC,UAAU2B,IAC3D3O,EAAS,iCAAmC+M,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFAnN,EAAS,yCAA2C+M,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAhM,EAAYuG,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAIvR,KAAKC,KAAK,KAAU,EAC1CsR,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAIvR,KAAKC,KAAK,KAAU,EAC1CuR,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGFpP,EAAS,8CAIX,MAAMkR,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAI1P,OACpB+R,EAAa3C,EAAkBpP,OAC/BS,EAAS,0BAA0BqR,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnExP,EAAS,2CAA2CqR,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAItJ,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAI6G,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3D5G,EAAe4G,GAAa,EAC5B7G,EAAeqF,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5CxJ,EAAe6G,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACL5I,iBACAD,iBACA2J,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAG1P,OAWjC,CAOO,SAASuS,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoBnJ,EAAG2G,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAOvJ,EAAIuJ,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAOrJ,EAAIuJ,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyB1J,EAAG2G,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoBnJ,EAAG2G,EAAGgD,GACrDK,EAA4Bb,EAAoBnJ,EAAG2G,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnBnU,KAAKuK,KAAK4J,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAKlK,IAAMmK,EAAG,GAAKD,EAAG,KACnElU,KAAKC,MAAMkU,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CA0BO,SAASsI,EAAqBvC,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkBpP,OAC/BsS,EAAkB5C,EAAI,GAAG1P,OAGzByU,EAAgB7M,MAAM8M,KAAK,CAAE1U,OAAQ+R,IAAc,IAAM,KACzD4C,EAAgB/M,MAAMmK,GAAY7J,KAAK,GAG7C,IAAK,IAAI0M,EAAY,EAAGA,EAAYlF,EAAI1P,OAAQ4U,IAC9C,IAAK,IAAIjC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAIkF,GAAWjC,GAAkB,EAGnDgC,EAAcpF,GAAaoF,EAAcpF,GAAa,EAGtDkF,EAAclF,GAAWxB,KAAK6G,EAC/B,CAGH,MAAO,CAAEH,gBAAeE,gBAC1B,CAOO,SAASE,EAAoB5C,GAClC,IAGI6C,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAM7F,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJTgJ,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBjJ,IACY,WAAjBC,EACFgJ,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjBhJ,IACTgJ,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBjH,EAAiBjO,OAAQkV,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4BlH,EAAiBiH,GAAelV,OAC5DmV,IACA,CACAJ,EAAqBE,GACnBhH,EAAiBiH,GAAeC,GAClCF,IAEA,MAAOrH,EAAciB,GAAQZ,EAAiBiH,GAAeC,GAC7D,IAAIC,EAA2BN,EAAcjG,GACzCwG,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyBpV,OAClDuV,IACA,CACA,MAAMC,EAAkB9F,EAAI9B,GAAcwH,EAAyBG,IAA2B,EAE9FF,EAAqBtH,KAAKqB,EAAkBoG,IAC5CF,EAAqBvH,KAAKiC,EAAkBwF,GAC7C,CAGD,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAAqBrV,OAAS,EAAGyV,IACnDT,EAAsBjH,KAAK,CACzB,CAACsH,EAAqBI,GAAIH,EAAqBG,IAC/C,CAACJ,EAAqBI,EAAI,GAAIH,EAAqBG,EAAI,KAG5D,CAEH,OAAOT,CACT,CClaO,MAAMU,EASX,WAAApQ,CAAYqQ,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA8J,CAAqCjN,EAAgBD,GACxB,OAAvBqD,KAAKF,cACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDrV,EACE,YAAYqV,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACdtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDrV,EACE,YAAYqV,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAQ,CAA0CC,EAAoBC,GACjC,OAAvBnK,KAAKF,cACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDrV,EACE,YAAYqV,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,KAE6B,OAAvBhK,KAAKF,eACdtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDrV,EACE,YAAYqV,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,4CAA4C+U,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAI,CACExN,EACAD,EACA8I,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxB9T,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBxK,KAAKF,cACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCrV,EACE,YAAYqV,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAM2G,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,qDAAqD+U,EAAkB,cACrE5H,EAAe,iBACD2B,EAAY,MAE9B5G,EAAe6M,KAAqBgB,EAAkBC,EACtD/N,EAAe8M,GAAiBA,IAAoBgB,CAAe,GAEtE,KAE6B,OAAvBzK,KAAKF,eACdtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCrV,EACE,YAAYqV,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc5N,OAC/C,IAAK,IAAIuP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACM5O,KAAKC,KAAKwS,GAAa,EAAIO,GAAa,GAExChT,KAAKC,KAAK8S,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/DlS,EACE,qDAAqD+U,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInChK,EAAe6M,KACZ/D,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjEvO,EAAe8M,GAAiB0B,KAC7BzF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aACd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc5N,OAC/C,IAAK,IAAIuP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACM5O,KAAKC,KAAKwS,GAAa,EAAIO,GAAa,GAExChT,KAAKC,KAAK8S,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/DlS,EACE,qDAAqD+U,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInChK,EAAe6M,KACZ/D,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjEvO,EAAe8M,GAAiB0B,KAC7BzF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACExJ,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxB9T,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMjE,EAAkBvG,KAAK2D,IAAI9B,GAAc5N,OACzCqX,EAAsBzP,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCoP,EAAsB1P,MAAM0K,GAAiBpK,KAAK,GAGxD,IAAK,MAAM4N,KAAe/J,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK4J,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCrV,EACE,YAAYqV,2DAAqEU,0CAAwDC,OAI3I,MAAMc,EAAkBxL,KAAKkC,iBAAiB6H,GAAa0B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB7J,IAG1D,GAAI2J,EAAiB,CACnB,MAAM1I,EAAO0I,EAAgB,GAE7B,GAA2B,OAAvBxL,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/BpO,EACE,qDAAqD8O,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B+H,EAAoB/H,KAAeiH,EAAkBC,EACrDY,EAAoB9H,GAAWA,IAAciH,CACzD,MAAiB,GAA2B,OAAvBzK,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAG3D,IAiBI2K,EAjBAtE,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAKCyH,EADW,IAATnI,GAAuB,IAATA,EACM5O,KAAKC,KAAKwS,GAAa,EAAIO,GAAa,GAExChT,KAAKC,KAAK8S,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aAEd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAc5N,OAC/C,IAAK,IAAIuP,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACM5O,KAAKC,KAAKwS,GAAa,EAAIO,GAAa,GAExChT,KAAKC,KAAK8S,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0B1F,EAAU0D,GAClDnV,EAAS,mDAGT,MAAM4O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B,MAAMkL,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAG5EC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzCvO,EAAesP,GAAmBC,KAC/BxG,EAAaoG,GACdjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAYxR,OAAQkY,IAAoB,CAExF,MAAMnB,EAA+B5E,EAAenG,kBAClDwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzCvO,EAAesP,GAAmBC,KAC/BxG,EAAaoG,GACdpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAIzC,EACpCC,EACA1H,EACAyB,EACA7D,EACAC,GAkBF,OAdAqM,EAA0BhC,mCACxBxN,EACAD,EACA8I,EACAC,EACArC,EACAY,EACAmC,GAIFgG,EAA0BvC,qCAAqCjN,EAAgBD,GAC/ElI,EAAS,iDAEF,CACLkI,iBACAC,iBAEJ,CAcO,SAASyP,GAA4BxK,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcyF,QAAEA,IAEzF,MAAMpG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DoF,EAAsBzP,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCoP,EAAsB1P,MAAM0K,GAAiBpK,KAAK,GAGlDmQ,EAAMzQ,MAAM0K,GACZD,EAAmBzK,MAAM0K,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkB1S,KAAKuK,IAAIkF,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkB1S,KAAKuK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IAAoB,CAExF,MAAM1L,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYqG,KAIRjF,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAGnE,MACI,GAAsB,OAAlBpL,EAET,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAYxR,OAAQkY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,IAGxE7F,EAAmBgG,EAAI3U,KAAK4U,GAAgBA,EAAc,KAG1D1F,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAAjT,CAAYqQ,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAA0M,CAAkC7P,EAAgBD,GACrB,OAAvBqD,KAAKF,cACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM7T,EAAQ8J,KAAK4J,mBAAmBG,GAAa,GACnDrV,EAAS,YAAYqV,iCAA2C7T,2BAChE8J,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBvT,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBvT,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACdtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM7T,EAAQ8J,KAAK4J,mBAAmBG,GAAa,GACnDrV,EAAS,YAAYqV,iCAA2C7T,2BAChE8J,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBvT,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAe6M,GAAmBvT,EAElC,IAAK,IAAIiQ,EAAW,EAAGA,EAAWvJ,EAAe3I,OAAQkS,IACvDxJ,EAAe8M,GAAiBtD,GAAY,EAG9CxJ,EAAe8M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAAiD,CAA2CxC,EAAoBC,GAClC,OAAvBnK,KAAKF,cACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM7T,EAAQ8J,KAAK4J,mBAAmBG,GAAa,GACnDrV,EAAS,YAAYqV,iCAA2C7T,2BAChE8J,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBvT,CAAK,GAEvD,MAAmB,GAA0B,cAAtB8J,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBvT,CAAK,GAE1C,IAEJ,KAE6B,OAAvB8J,KAAKF,eACdtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAM7T,EAAQ8J,KAAK4J,mBAAmBG,GAAa,GACnDrV,EAAS,YAAYqV,iCAA2C7T,2BAChE8J,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBvT,CAAK,GAEvD,MAAmB,GAA0B,cAAtB8J,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D9O,EACE,sCAAsC+U,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBvT,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASyW,EACdzG,EACA0D,EACA5M,EACA4P,GAEAnY,EAAS,iDAGT,IAAIoY,EAAqB,EAAID,EArBA,IAsB7BlY,EAAS,uBAAuBmY,KAChCnY,EAAS,0BAA0BkY,KAGnC,MAAMvJ,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1BlL,SAAS,6CAGT,IAAIoW,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACE9P,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAYxR,OAAQkY,IAAoB,CAExF,IAAInB,EAA+B5E,EAAenG,kBAChDwF,EAAYqG,GACZrG,EAAY0G,IAId,MAAMJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAC5D3L,EAAgB4K,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACE9P,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACE/P,EAAesJ,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzCpP,EAAeqP,IACbY,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFhQ,EAAeqP,IACbW,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACd9X,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GAGzCvO,EAAesP,GAAmBC,KAC/BW,EACDnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACFjQ,EAAesP,GAAmBC,IAChCU,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbjY,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbjY,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkC7P,EAAgBD,GAC5ElI,EAAS,+CAEF,CACLkI,iBACAC,iBAEJ,CAgBO,SAASoQ,GAA8BnL,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcyF,QACdA,EAAO7O,eACPA,EAAc4P,sBACdA,IAGA,MAAMnH,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI2G,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBzP,MAAM0K,GAC/BpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACnCoP,EAAsB1P,MAAM0K,GAAiBpK,KAAK,GAGlDmQ,EAAMzQ,MAAM0K,GACZD,EAAmBzK,MAAM0K,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkB1S,KAAKuK,IAAIkF,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkB1S,KAAKuK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1BlL,SAAS,6CAGT,IAAIoW,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACE9P,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CAEP,MAAW,GAAsB,OAAlBpL,EACT,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAYxR,OAAQkY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,KAGxEtF,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIuG,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACE9P,EAAesJ,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACE/P,EAAesJ,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAEzCT,EAAoBS,IAClBa,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACd9X,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbjY,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbjY,KAAKC,KAAK2Y,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIjH,EAUG,SAASkH,EAAiBC,EAAerH,EAAU0D,EAAoB/M,EAAU,CAAA,GAEtF,MAAMgP,EAAU5F,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkBpP,OACxCuZ,EAActH,EAASH,eA6H/B,SAAiCQ,EAAiBiH,GAEhDP,EAAY3L,eAAiBzF,MAAM2R,GAChCrR,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACzC8Q,EAAY/C,mBAAqBrO,MAAM0K,GAAiBpK,KAAK,GAC7D8Q,EAAY9C,eAAiBtO,MAAM0K,GAAiBpK,KAAK,GACzD8Q,EAAYQ,qBAAuB5R,MAAM0K,GAAiBpK,KAAK,GAC/D8Q,EAAYjQ,eAAiBnB,MAAM0K,GAAiBpK,KAAK,GACzD8Q,EAAYS,aAAe7R,MAAM2R,GAAarR,KAAK,GACnD8Q,EAAYU,YAAc9R,MAAM2R,GAAarR,KAAK,GAGlD+Q,EAAaU,UAAY,EACzBV,EAAalH,WAAaO,EAC1B2G,EAAaW,mBAAqB,EAClCX,EAAa3G,gBAAkB1K,MAAM2R,GAAarR,KAAK,GACvD+Q,EAAaY,YAAc,EAG3B,MAAMC,EAAa7Z,KAAKsK,IAAI+H,EAAiB,KAC7C2G,EAAac,qBAAuBnS,MAAMkS,GAAY5R,KAAK,GAC3D+Q,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBzP,MAAM0K,GACrCpK,OACAxE,KAAI,IAAMkE,MAAM0K,GAAiBpK,KAAK,KACzCgR,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B3H,EAAiBiH,GAC1C,MAAMW,EAAqBja,KAAKsK,IAC9BtK,KAAKka,KAAKla,KAAKC,KAAKqZ,IAAgBjH,EAClB,EAAlBA,GAEF,OAAO4H,EAAqBX,CAC9B,CAnBoBa,CAAkB9H,EAAiBiH,GACrDH,EAAaiB,YAAczS,MAAMqS,GAAW/R,KAAK,GACjDkR,EAAakB,cAAgB1S,MAAMkS,GAAY5R,KAAK,GACpDkR,EAAamB,SAAW3S,MAAMkS,GAAY5R,KAAK,GAC/CkR,EAAaoB,UAAY5S,MAAMqS,GAAW/R,KAAK,EACjD,CA7JEuS,CAHwB7C,EAAQtF,gBAGSiH,GAGzC/Y,EAAS,mCACTF,QAAQ4I,KAAK,iBAGbiJ,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYqI,EAAQtF,gBAAiB/C,IAC3DyJ,EAAY3L,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBpP,OAAQuP,IACrEyJ,EAAY/C,mBAAmB1G,GAAa,EAC5CyJ,EAAY9C,eAAe3G,GAAa,EAI1C,IAAImL,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIhF,EACvCC,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC5C,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI3G,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBpP,OAAQuP,IACrEyJ,EAAYQ,qBAAqBjK,GAAa,EAGhD0J,EAAalH,WAAaE,EAAS7C,kBAAkBpP,OACrDiZ,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIjM,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEqL,EAAa3G,gBAAgB1E,GAAgBgK,EAAQtF,gBAIvD2G,EAAa0B,sBAAwB/R,EAAQG,eAC7CkQ,EAAaN,sBAAwB/P,EAAQ+P,sBAuM/C,SAA6B1G,EAAU2F,EAASO,EAA2BmB,GAEzE,MAAMxH,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkBpP,OAC7C8Z,EAAa7Z,KAAKsK,IAAI+H,EAAiB2G,EAAac,qBAAqB/Z,QAC/E,IAaI4a,EAbAC,EAAmBjT,MAAMgQ,EAAQtF,iBAAiBpK,KAAK,GACvD4S,EAAiBlT,MAAMgQ,EAAQtF,iBAAiBpK,KAAK,GACrD6S,EAAanT,MAAMkS,GAAY5R,KAAK,GACpC8S,EAAkBpT,MAAMkS,GAAY5R,KAAK,GACzC+S,EAAqBrT,MAAMkS,GAAY5R,KAAK,GAC5CgT,EAAetT,MAAMkS,GAAY5R,KAAK,GACtCiT,EAAcvT,MAAMkS,GAAY5R,KAAK,GACrCkT,EAAcxT,MAAMkS,GACrB5R,OACAxE,KAAI,IAAMkE,MAAMkS,GAAY5R,KAAK,KAChCmT,EAAezT,MAAM0K,GAAiBpK,KAAK,GAC3CoT,EAAkB1T,MAAM0K,GAAiBpK,KAAK,GAC9CqT,EAAsB3T,MAAM0K,GAAiBpK,KAAK,GAGlDsT,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI5J,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D8L,EAAa9L,GAAa,EAC1B+L,EAAgB/L,GAAa,EAG/B,GAAwC,IAApC0J,EAAaW,mBAA0B,CAEzC,IAAK,IAAIrK,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3DgM,EAAoBhM,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI+N,EAAsB7J,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBsG,EAAa3G,gBAAgBqJ,GAC9ChJ,IACA,CACA,IAAI6C,EAAkBwD,EAAY3L,eAAesO,GAAqBhJ,GACrB,IAA7C4I,EAAoB/F,EAAkB,KACxC+F,EAAoB/F,EAAkB,GAAK,EAC3CwD,EAAY3L,eAAesO,GAAqBhJ,IAC7CqG,EAAY3L,eAAesO,GAAqBhJ,GAEtD,CACF,CACF,CAEDsG,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAI9b,EAAI,EAAGA,EAAI+Z,EAAY/Z,IAC9B,IAAK,IAAIsK,EAAI,EAAGA,EAAIyP,EAAYzP,IAC9B+Q,EAAY/Q,GAAGtK,GAAK,EAIxB,OAAa,CAEX,IAAI+b,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBrH,IACpCoH,EAAYC,sBACZ2C,EAAYG,EAA4BhK,EAAU2F,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa3G,gBAAgB4J,EAAiB,GAChEF,EAAoB/C,EAAa3G,gBAAgB4J,EAAiB,GAElE,IAAK,IAAIvJ,EAAiB,EAAGA,EAAiBqJ,EAAmBrJ,IAAkB,CACjF,IACIwJ,EAqBAC,EAtBA5G,EAAkBwD,EAAY3L,eAAe6O,EAAiB,GAAGvJ,GAGrE,GAAoB,IAAhBiJ,EACFA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,MACzC,CACL,IAAK2G,EAAc,EAAGA,EAAcP,GAC9B3b,KAAKuK,IAAIgL,KAAqBvV,KAAKuK,IAAI4O,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,IAE9CqF,EAAiBlI,GAAkBwJ,EAAc,EACjD/C,EAAakB,cAAc6B,GAAe3G,EAE7C,CAGD,GAAiB,IAAbqG,EACFA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,MACtB,CACL,IAAK4G,EAAW,EAAGA,EAAWP,GACxB5b,KAAKuK,IAAIgL,KAAqBvV,KAAKuK,IAAIuQ,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,IAE3BsF,EAAenI,GAAkByJ,EAAW,EAC5CrB,EAAWqB,GAAY5G,EAE1B,CACF,CAED,GAAIqG,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADAnZ,EAAS,sCAIX,IAAK,IAAI0b,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAI5G,EAAkBuF,EAAWqB,GACjC,GAAI5G,EAAkB,EAAG,CACvBwF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoB1c,KAAKuK,IAAIgL,GAC6B,IAA1DwD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5CpH,EAAkBvV,KAAKuK,IAAIuQ,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACblc,KAAKuK,IAAI4O,EAAakB,cAAc6B,MAClC3G,IAAiB4F,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBrH,EAAe,CACxF,GAA6B,IAAzB0K,EAEF,YADA7b,EAAS,oCAIX,IAAIkc,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAI7c,KAAKuK,IAAIuS,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5D/c,KAAKuK,IAAI0S,GAAajd,KAAKuK,IAAIuS,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBld,KAAKuK,IAAIuQ,EAAW8B,EAAgB,IAC9DjC,EAAyB3a,KAAKuK,IAAI4O,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBnd,KAAKuK,IAAIuS,GAEjF,IAAK,IAAIxN,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IACvDA,GAAa4N,GAAqB9B,EAAa9L,KAC/CA,GAAaqL,GAAwBU,EAAgB/L,KAS3D,GANItP,KAAKuK,IAAIuS,GAAc,OACzBpc,EACE,2DAA2DuY,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiBrd,KAAKuK,IAAIuQ,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiBrd,KAAKuK,IAAIuQ,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAItd,EAAI,EAAGA,EAAI8b,EAAU9b,IAC5BqZ,EAAaoB,UAAUiB,EAAiB1b,EAAI,GAAKob,EAAYpb,GAE/D0b,GAAkBI,EAElB,IAAK,IAAI9b,EAAI,EAAGA,EAAI8b,EAAU9b,IAC5BqZ,EAAaoB,UAAUiB,EAAiB1b,EAAI,GAAKgb,EAAWhb,GAE9D0b,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAI1b,EAAI,EAAGA,EAAI6b,EAAa7b,IAC/BqZ,EAAaiB,YAAYmB,EAAmB,EAAIzb,GAAKqZ,EAAamB,SAASxa,GAE7Eyb,GAAoBI,EAEpB,IAAK,IAAI7b,EAAI,EAAGA,EAAI6b,EAAa7b,IAC/BqZ,EAAaiB,YAAYmB,EAAmB,EAAIzb,GAAKqZ,EAAakB,cAAcva,GAElFyb,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBrH,EAAe,SAsBrE,GApBA8I,EAAyB3a,KAAKuK,IAAI4O,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBld,KAAKuK,IAAIuQ,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqBnd,KAAKuK,IAAIuS,GAEjF3D,EAAamB,SAAS,GAAK,EACvBta,KAAKuK,IAAIuS,GAAc,OACzBpc,EACE,2DAA2DuY,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACflZ,EAAS,0CAA0C+a,KAGrDgC,GAAwBhC,GACxB,KACD,CACF,CACH,CA/jBEiC,CAAoBxL,EAAU2F,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI/J,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBpP,OAAQuP,IACrEyJ,EAAYjQ,eAAewG,GAAa0J,EAAac,qBAAqBxK,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkBpP,OAAQuP,IACtC,OAA3B0C,EAASpG,cAEXpL,EACE,GAAG2O,EAAkBG,GAAWmO,cAAc,OAAO1E,EAAYjQ,eAC/DwG,GACAmO,cAAc,MAIlBjd,EACE,GAAG2O,EAAkBG,GAAWmO,cAAc,OAAO1N,EAAkBT,GAAWmO,cAChF,OACI1E,EAAYjQ,eAAewG,GAAWmO,cAAc,MAKhEpd,QAAQoK,QAAQ,iBAChBlK,EAAS,8BAET,MAAQ4O,kBAAmBuO,EAAa3N,kBAAmB4N,GAAgB3L,EAC3E,MAAO,CACLlJ,eAAgBiQ,EAAYjQ,eAAejF,MAAM,EAAGiO,GACpD8L,iBAAkB,CAChBzO,kBAAmBuO,EACnB3N,kBAAmB4N,GAGzB,CAwEA,SAAS3B,EAA4BhK,EAAU2F,EAASO,EAA2BmB,GACjF,MAAM1L,EAAesL,EAAYC,oBAAsB,EAGvD,GAAIvL,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADAnR,EAAS,sCAAsCiN,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMuF,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtE1L,eACA8B,IAAKsJ,EAAY3L,eACjB4E,WACAE,eAAgBA,EAChByF,UAEA7O,eAAgBkQ,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8BlW,MAAMgQ,EAAQtF,iBAC7CpK,OACAxE,KAAI,IAAMkE,MAAMgQ,EAAQtF,iBAAiBpK,KAAK,KAC7C6V,EAAyBnW,MAAMgQ,EAAQtF,iBAAiBpK,KAAK,GAGjE,GAAIoR,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMlI,KAAe7D,EAAShE,iBACjC,GACqE,eAAnEkK,EAA0BxC,mBAAmBG,KAAe,IAC5D7D,EAAShE,iBAAiB6H,GAAamI,MACrC,EAAExG,EAAsBC,KAAOD,IAAyB7J,IAE1D,CACAoQ,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMxM,YAAEA,EAAWC,aAAEA,GAAiBmG,EAChCpM,EAAS2M,EAA0Bf,wCACvCxJ,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF2L,EAA8BtS,EAAO6L,oBACrC0G,EAAyBvS,EAAO8L,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQtF,gBAAiB4L,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQtF,gBAAiB6L,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIxL,EAAiB,EAAGA,EAAiBiF,EAAQtF,gBAAiBK,IAAkB,CACvF,MAAM6C,EAAkB6C,EAAI1F,GAAkB,EAC9CqG,EAAYQ,qBAAqBhE,IAC/B8B,EAAoB3E,GAAkBoL,EAAuBpL,EAChE,CAED,OAAO,CACT,CA0YA,SAAS6K,GAAwBhC,GAC/B,IAAK,IAAIjM,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D0J,EAAac,qBAAqBxK,GAAayJ,EAAY9C,eAAe3G,GAG5E,IAAK,IAAI6O,EAAiB,EAAGA,GAAkBnF,EAAalH,WAAYqM,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyB3a,KAAKuK,IAAI4O,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqB9Z,KAAKuK,IAAI4O,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACflZ,EAAS,oDAAoD+a,IACjE,CChtBO,SAAS8C,GAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZzV,GAAY,EACZC,EAAa,EACbqG,EAAS,GACTvG,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAAS0V,EAGlD,IAAIzM,EAAayM,EAAQvM,SAAS7C,kBAAkBpP,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIgS,EAAYhS,IAC9BuP,EAAOvP,GAAK,EACZgJ,EAAehJ,GAAK,EAQtB,IAJIye,EAAQE,iBAAmBF,EAAQE,gBAAgB1e,SAAW+R,IAChEhJ,EAAiB,IAAIyV,EAAQE,kBAGxBzV,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAIjJ,EAAI,EAAGA,EAAIgJ,EAAe/I,OAAQD,IACzCgJ,EAAehJ,GAAKsI,OAAOU,EAAehJ,IAAMsI,OAAOiH,EAAOvP,IAIhE,GAA6B,YAAzBye,EAAQ/V,aAA4B,CAOtC6G,EANsB+J,EACpBN,EACAyF,EAAQvM,SACRuM,EAAQ7I,mBACR,CAAE5M,iBAAgB4P,sBAAuB6F,EAAQ7F,wBAE5B5P,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmB4V,EACpCC,EAAQvM,SACRuM,EAAQ7I,mBACR5M,EACAyV,EAAQ7F,wBAKVrJ,EAD2B9G,EAAkBgW,EAAQ/V,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALA0V,EAAY7e,EAAc0P,GAG1B9O,EAAS,4BAA4ByI,EAAa,mBAAmBwV,EAAUf,cAAc,MAEzFe,GAAa3V,EACfE,GAAY,OACP,GAAIyV,EAAY,IAAK,CAC1B9d,EAAS,uCAAuC8d,KAChD,KACD,CAEDxV,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAMgW,GAYX,WAAArZ,CACEqQ,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAEA/S,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK6S,mBAAqBA,EAC1B7S,KAAK8S,mBAAqBA,EAC1B9S,KAAK+S,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkC7P,EAAgBD,GAChD,MAAMqW,EAAYpW,EAAe3I,OACjC,IAAIgf,GAAgB,EAEpB,GAA2B,OAAvBjT,KAAKF,gBACPtJ,OAAOsT,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,MAAMmJ,EAASlT,KAAK4J,mBAAmBG,GAAa,GAEpD,GAAe,eAAXmJ,EACFD,GAAgB,EAEhBve,EAAS,YAAYqV,uDAChB,GAAe,qBAAXmJ,EAA+B,CACxC,MAAMC,EAASnT,KAAK4J,mBAAmBG,GAAa,GAC9CqJ,EAASpT,KAAK4J,mBAAmBG,GAAa,GACpDrV,EACE,YAAYqV,8CAAwDoJ,QAAaC,MAEnFpT,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC/U,EACE,0CAA0C+U,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAeyW,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe0W,GAAMlN,GAAY,EAEnCxJ,EAAe0W,GAAMA,GAAQ,EAG7BzW,EAAe0W,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe2W,GAAMnN,GAAY,EAEnCxJ,EAAe2W,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBtT,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC/U,EACE,0CAA0C+U,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9B5G,EAAeyW,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe0W,GAAMlN,GAAY,EAEnCxJ,EAAe0W,GAAMA,GAAQ,EAG7BzW,EAAe0W,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe2W,GAAMnN,GAAY,EAEnCxJ,EAAe2W,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAIvT,KAAK6S,mBACtB,IAAK,IAAI1M,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe4W,GAAMpN,GAAY,EAEnCxJ,EAAe4W,GAAMA,GAAQ,EAC7B3W,EAAe2W,GAAQ,EACvB7e,EAAS,sEACV,CAEJ,ECtII,MAAM8e,GACX,WAAAja,Gf8BK,IAAiB5E,Ee7BpBqL,KAAKyT,aAAe,KACpBzT,KAAK4F,WAAa,GAClB5F,KAAK4J,mBAAqB,GAC1B5J,KAAKtD,aAAe,UACpBsD,KAAK0T,qBAAuB,KfyBR/e,EevBlB,yPfwBJJ,QAAQC,IAAI,YAAcG,EAAS,sCetBjCF,EAAS,kCACV,CAOD,cAAAkf,CAAeC,EAAa/W,EAAU,IACpCmD,KAAKyT,aAAeG,OAGkBnb,IAAlCoE,GAAS6W,uBACX1T,KAAK0T,qBAAuB7W,EAAQ6W,qBACpChf,EAAS,kCAGoB+D,IAA3BoE,GAASC,gBACXkD,KAAKlD,cAAgBD,EAAQC,cAC7BpI,EAAS,wBAAwBsL,KAAKlD,uBAEbrE,IAAvBoE,GAASE,YACXiD,KAAKjD,UAAYF,EAAQE,UACzBrI,EAAS,oBAAoBsL,KAAKjD,cAGpCrI,EAAS,uBAAuBkf,IACjC,CAED,aAAAC,CAAcjO,GACZ5F,KAAK4F,WAAaA,EAClBlR,EAAS,mCAAmCkR,EAAW9F,gBACxD,CAED,oBAAAgU,CAAqB/J,EAAagK,GAChC/T,KAAK4J,mBAAmBG,GAAegK,EACvCrf,EAAS,0CAA0CqV,YAAsBgK,EAAU,KACpF,CAED,eAAAC,CAAgBtX,GACdsD,KAAKtD,aAAeA,EACpBhI,EAAS,wBAAwBgI,IAClC,CAOD,KAAAuX,CAAMpX,EAAU,IACTmD,KAAKyT,cAAiBzT,KAAK4F,YAAe5F,KAAK4J,oBAClDhV,EAAS,8EAYX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjB2V,EAAkB,GAGtBle,EAAS,qBACT,MAAMyR,EAAWP,EAAY3F,KAAK4F,YAClCnR,EAAS,8BAGT,MAAMqd,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHAxP,EAAS,gCACTF,QAAQ4I,KAAK,oBACb1I,EAAS,gBAAgBuL,KAAKyT,gBACJ,yBAAtBzT,KAAKyT,aAEP,GAA0B,YAAtBzT,KAAKtD,aAA4B,CAMnCM,EALsBsQ,EACpBjB,EACAnG,EACAlG,KAAK4J,oBAEwB5M,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmBgP,EAA0B1F,EAAUlG,KAAK4J,qBAK/E5M,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,cACrC,MACI,GAA0B,2BAAtBgD,KAAKyT,aAA2C,CAEzD,IAAI7G,EAAwB,EAC5B,MAAMsH,EAA2B,EAG3BzB,EAAU,CACdvM,SAAUA,EACV0D,mBAAoB5J,KAAK4J,mBACzBgD,sBAAuBA,EACvBlQ,aAAcsD,KAAKtD,aACnBiW,kBAEA7V,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,WAGvC,KAAO6P,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5B5P,EAAe/I,OAAS,IAC1Bwe,EAAQE,gBAAkB,IAAI3V,IAIhC,MAAMmX,EAAsB5B,GAAc5F,EAA6B8F,GAGvE9V,EAAiBwX,EAAoBxX,eACrCC,EAAiBuX,EAAoBvX,eACrCI,EAAiBmX,EAAoBnX,eAGrC4P,GAAyB,EAAIsH,CAC9B,CACP,MAAW,GAA0B,yBAAtBlU,KAAKyT,aAEd,GAA0B,YAAtBzT,KAAKtD,aACP9H,EACE,uGAEG,GAEF+H,iBAAgBC,kBCjKpB,SAAmCsJ,EAAU0D,EAAoB8J,GACtEjf,EAAS,gDAGT,MAAM4O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGEpI,EAAEA,EAACsW,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMZ,EAGjB7H,EAAU5F,EAAcC,IACxBtJ,eACJA,EAAcD,eACdA,EAAc2J,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAEJ,GAAsB,OAAlB/L,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkB1S,KAAKuK,IAAIkF,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkB3F,EAAYxR,OAAQmX,IAAmB,CAErF,MAAMhL,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY2F,KAIRvE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAIgO,EAAS,EACb,IAAK,IAAIvgB,EAAI,EAAGA,EAAIuS,EAAiBvS,IACnCugB,GAAUlR,EAAkBiD,EAAiBtS,IAAMoM,EAAcpM,GAInE,MAAMwgB,EAAI1W,EAAEyW,GACNxW,EAAIqW,EAAEG,GACN/T,EAAI6T,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIvI,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,MAAM0I,EAAmBpO,EAAiB0F,GAG1CpP,EAAe8X,IACbhP,EAAa0F,GAAmBvE,EAAc4N,EAAIrU,EAAc4L,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,MAAMC,EAAmB7E,EAAiB4E,GAG1CvO,EAAe+X,GAAkBvJ,IAC/BzF,EAAa0F,GACbvE,EACA2N,EACA1N,EAAoBkF,GACpBlF,EAAoBoE,GAGtBvO,EAAe+X,GAAkBvJ,IAC/BzF,EAAa0F,GACbvE,EACA9I,EACA+I,EAAoBoE,GACpB9K,EAAc4L,GAGhBrP,EAAe+X,GAAkBvJ,IAC/BzF,EAAa0F,GACbvE,EACArG,EACAJ,EAAc4L,GACd5L,EAAc8K,EACjB,CACF,CACF,CACF,KAC0B,OAAlBpL,GACTlL,EAAS,0EAkBX,OAbkC,IAAI4X,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkC7P,EAAgBD,GAE5ElI,EAAS,8CAEF,CACLkI,iBACAC,iBAEJ,CDgC8C+X,CACpCzO,EACAlG,KAAK4J,mBACL5J,KAAK0T,uBAOP1W,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,cACrC,MACI,GAA0B,uBAAtBgD,KAAKyT,aAAuC,CAErD,MAAMmB,EE7JL,SAAoC1O,EAAU0D,GACnDnV,EAAS,6CAGT,MAAM4O,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACFlL,EAAS,2CAEU,cAAjBmL,GACFnL,EAAS,wFAIX,MAAMie,EAAqB7M,EAYrB6O,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/B9B,EAAkB,IAAIzd,IACtBwf,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAIlT,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAImT,EAAc,EAAGA,EAAcH,EAAmB5gB,OAAQ+gB,IAAe,CAChF,MAAMC,EAAetR,EAAI9B,GAAcgT,EAAmBG,IAAgB,EACrEjC,EAAgBmC,IAAID,KACvBlC,EAAgBxa,IAAI0c,EAAcF,GAClCD,EAAoB9S,KAAKiT,GACzBF,IAEH,CAEH,MAAMjC,EAAqBiC,EACrB/B,EAAY,EAAIH,EAAqBC,EAE3Cpe,EACE,uBAAuBme,0BAA2CC,0BAA2CE,gBAI/G,IAAIpW,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAI6G,EAAY,EAAGA,EAAYwP,EAAWxP,IAAa,CAC1D5G,EAAe4G,GAAa,EAC5B7G,EAAeqF,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CxJ,EAAe6G,GAAW2C,GAAY,CAEzC,CAGD,MAAMgP,EAAyB,IAAItV,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEVqV,EAAyB,IAAIvV,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIwT,EAAsB,GAC1B,IAAK,IAAIzO,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEyO,EAAoBzO,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAI0O,EAAuB,GAC3B,IAAK,IAAI1O,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAMqO,EAAetR,EAAI9B,GAAcgT,EAAmBjO,IAAmB,EAC7E0O,EAAqB1O,GAAkBmM,EAAgBlZ,IAAIob,EAC5D,CAGD,IAAK,IAAInJ,EAAmB,EAAGA,EAAmBrG,EAAYxR,OAAQ6X,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAYxR,OAAQkY,IAAoB,CAExF,MAAMoJ,EAAuCJ,EAAuBlV,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIRqJ,EAAuCJ,EAAuBnV,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAemV,EAAqCnV,cACpDC,sBAAuBkV,EAAqClV,sBAC5DC,sBAAuBiV,EAAqCjV,sBAC5D+C,oBACAY,oBACAqC,iBAAkB+O,EAClB9O,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAG5D0J,EAAe/P,EAAaoG,GAAoBpG,EAAayG,GAAoBtF,EAGvF,IAAK,IAAImF,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAI0J,EAAcL,EAAoBrJ,GAClC2J,EAAQD,EACRE,EAAQ/C,EAAqB6C,EAEjC,IAAK,IAAIxK,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAI2K,EAAcR,EAAoBnK,GAClC4K,EAAQD,EACRE,EAAQlD,EAAqBgD,EAG7BG,EA9DH,GA+DEP,GAEA3O,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAG/DvO,EAAegZ,GAAOG,IAAUE,EAChCrZ,EAAeiZ,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAI1C,EAAO,EAAIV,EAAqByC,EAAqBW,GAErDC,EACFT,EACAD,EAAqCpV,cAAc6V,GACnDnP,EAAoBkF,GAElBmK,EACFV,EACAD,EAAqCpV,cAAc6V,GACnD7O,EAAoB4E,GAGtBrP,EAAegZ,GAAOpC,IAAS2C,EAG/BvZ,EAAeiZ,GAAOrC,IAAS4C,EAG/BxZ,EAAe4W,GAAMoC,KAAWO,EAChCvZ,EAAe4W,GAAMqC,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAIvD,GACjChJ,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAGqBtG,kCAAkC7P,EAAgBD,GACzElI,EAAS,2CAEF,CACLkI,iBACAC,iBACAiW,qBACAC,qBACAgC,sBAEJ,CF1DiCsB,CAA2BlQ,EAAUlG,KAAK4J,oBACrEjN,EAAiBiY,EAAmBjY,eACpCC,EAAiBgY,EAAmBhY,eAMpCI,EAJ2BP,EAAkBuD,KAAKtD,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAEHC,eAGpCgD,KAAKqW,sBAAwB,CAC3BxD,mBAAoB+B,EAAmB/B,mBACvCC,mBAAoB8B,EAAmB9B,mBACvCgC,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHAvgB,QAAQoK,QAAQ,oBAChBlK,EAAS,6BAEF,CAAEuI,iBAAgB8U,mBAC1B,CAQD,gBAAMwE,CAAWrX,EAAepC,EAAU,IACnCmD,KAAKyT,cAAiBzT,KAAK4F,YAAe5F,KAAK4J,oBAClDhV,EAAS,mFAGX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBvI,EAAS,qBACT,MAAMyR,EAAWP,EAAY3F,KAAK4F,YAClCnR,EAAS,8BACT,MAAMqd,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJAxP,EAAS,gCACTF,QAAQ4I,KAAK,oBAEb1I,EAAS,iBAAiBuL,KAAKyT,gBACL,yBAAtBzT,KAAKyT,iBACJ9W,iBAAgBC,kBAAmBgP,EAA0B1F,EAAUlG,KAAK4J,qBAErD,eAAtB5J,KAAKtD,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiBkD,KAAKlD,cAC7CC,UAAWF,EAAQE,WAAaiD,KAAKjD,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHA3J,QAAQoK,QAAQ,oBAChBlK,EAAS,6BAEF,CAAEuI,iBAAgB8U,mBAC1B,EG9PE,MAACyE,GAAoB3X,MAAO4X,IAC/B,IAAI/W,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClB0H,mBAAoB,GACpBxH,kBAAmB,CAAE,EACrBqU,MAAO,EACPC,OAAO,EACPC,SAAU,IACVrT,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAMiV,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNrf,KAAKsf,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnBtR,EAAa,EACbuR,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAEvK,YAAa,GACrCwK,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAM7iB,QAAQ,CAC/B,MAAMskB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACF3X,EAAOgX,MAAQgC,WAAWD,EAAM,IAChC/Y,EAAOiX,MAAqB,MAAb8B,EAAM,GACrB/Y,EAAOkX,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAM9U,EAAYoW,SAASF,EAAM,GAAI,IAC/BjW,EAAMmW,SAASF,EAAM,GAAI,IAC/B,IAAIliB,EAAOkiB,EAAMzgB,MAAM,GAAGyE,KAAK,KAAKmc,QAAQ,SAAU,IAEtDlZ,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWhM,QAC/C,MAGI,GAAgB,aAAZ8gB,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbU,OAAQF,SAASF,EAAM,GAAI,IAC3B3B,OAAQ6B,SAASF,EAAM,GAAI,IAC3BK,SAAUH,SAASF,EAAM,GAAI,IAC7BM,QAASJ,SAASF,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAaU,SAAQT,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAM5V,EAAMmW,SAASF,EAAM,GAAI,IACzBO,EAAcL,SAASF,EAAM,GAAI,IACjCQ,EAAWR,EAAMzgB,MAAM,EAAG,EAAIghB,GAAaphB,KAAKqD,GAAM0d,SAAS1d,EAAG,MACxE4b,EAAkBC,OAAOtU,GAAOyW,EAChCX,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaW,WAAUV,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBoB,SAASF,EAAM,GAAI,IACtCxS,EAAa0S,SAASF,EAAM,GAAI,IAChC/Y,EAAO4D,kBAAoB,IAAIxH,MAAMmK,GAAY7J,KAAK,GACtDsD,EAAOwE,kBAAoB,IAAIpI,MAAMmK,GAAY7J,KAAK,QACjD,GAAIob,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjByB,IAAKP,SAASF,EAAM,GAAI,IACxBjW,IAAKmW,SAASF,EAAM,GAAI,IACxBU,WAAYR,SAASF,EAAM,GAAI,IAC/Bf,SAAUiB,SAASF,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAIzc,KAAKwd,EAGZ,GAFAd,EAAS1V,KAAK0W,SAAS1d,EAAG,KAC1B2c,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAM0B,EAAUzB,EAASE,GAA4B,EACrDnY,EAAO4D,kBAAkB8V,GAAWV,WAAWD,EAAM,IACrD/Y,EAAOwE,kBAAkBkV,GAAWV,WAAWD,EAAM,IACrD/Y,EAAO6D,cACP7D,EAAOyE,cACP0T,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBa,SAASF,EAAM,GAAI,IACzBE,SAASF,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoBvK,YAC7EuK,EAAsB,CACpBkB,IAAKP,SAASF,EAAM,GAAI,IACxBjW,IAAKmW,SAASF,EAAM,GAAI,IACxBY,YAAaV,SAASF,EAAM,GAAI,IAChChL,YAAakL,SAASF,EAAM,GAAI,KAGlC/Y,EAAOkC,aAAaoW,EAAoBqB,cACrC3Z,EAAOkC,aAAaoW,EAAoBqB,cAAgB,GAAKrB,EAAoBvK,YAEpFwK,EAA2B,OACtB,GAAIA,EAA2BD,EAAoBvK,YAAa,CACrE,MAAM6L,EAAcb,EAAMzgB,MAAM,GAAGJ,KAAKsG,GAAMya,SAASza,EAAG,MAG1D,IAAIqb,EAAcvB,EAAoBxV,IACtC,GAAgC,IAA5BwV,EAAoBkB,IAAW,CACjC,MAAMM,EAAS3C,EAAkBC,OAAOkB,EAAoBxV,KACxDgX,GAAUA,EAAOtlB,OAAS,IAAGqlB,EAAcC,EAAO,GACvD,CAEuC,IAApCxB,EAAoBqB,aAAyD,IAApCrB,EAAoBqB,aAC1DnB,EAAsBqB,KAAcrB,EAAsBqB,GAAe,IAC9ErB,EAAsBqB,GAAatX,KAAKqX,GAEnC5Z,EAAO2C,kBAAkBkX,KAAc7Z,EAAO2C,kBAAkBkX,GAAe,IACpF7Z,EAAO2C,kBAAkBkX,GAAatX,KAAKqX,IACE,IAApCtB,EAAoBqB,YAC7B3Z,EAAO6B,eAAeE,iBAAiBQ,KAAKqX,GACC,IAApCtB,EAAoBqB,aAAyD,KAApCrB,EAAoBqB,aACtE3Z,EAAO6B,eAAeC,aAAaS,KAAKqX,GAG1CrB,IACIA,IAA6BD,EAAoBvK,cACnDsK,IACAC,EAAsB,CAAEvK,YAAa,GAExC,CAGH6J,GACD,CAkBD,OAfA5X,EAAOwC,gBAAgBI,SAASpK,IAC9B,GAAuB,IAAnBA,EAAKqK,UAAiB,CACxB,MAAMkX,EAAQvB,EAAsBhgB,EAAKsK,MAAQ,GAC7CiX,EAAMvlB,OAAS,GACjBwL,EAAOmK,mBAAmB5H,KAAK,CAC7B1L,KAAM2B,EAAK3B,KACXiM,IAAKtK,EAAKsK,IACViX,SAGL,KAGH9kB,EAAS,+CAA+C+M,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,EChQR,SAASga,GAAaC,EAAOja,EAAQka,EAAUC,GACpDrlB,QAAQ4I,KAAK,gBACb,MAAMkG,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClD9U,EAAiByC,EAAOzC,eACxByW,EAAeiG,EAAMjG,aACrB3T,EAAgB4Z,EAAM9T,WAAW9F,cAGvC,GAFiB6F,EAAY+T,EAAM9T,YAEb,OAAlB9F,GAAuC,SAAb6Z,EAAqB,CAEjD,IAAIE,EAEFA,EADE7c,EAAe/I,OAAS,GAAK4H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAM8M,KAAKtF,GAEvB,IAAIyW,EAAW,CACb5b,EAAGmF,EACHwB,EAAGgV,EACHE,KAAM,QACNviB,KAAM,UACN+gB,KAAM,CAAEyB,MAAO,mBAAoBC,MAAO,GAC1C3jB,KAAM,YAGJ4jB,EAAiBhmB,KAAKimB,IAAIC,OAAOC,WAAY,KAI7CC,EAAS,CACXC,MAAO,eAAe9G,IACtBwG,MALc/lB,KAAKimB,IAAID,EAAgB,KAMvCM,OALe,IAMfC,MAAO,CAAEF,MAAO,KAChBG,MAAO,CAAEH,MAAO,YAChBI,OAAQ,CAAE1D,EAAG,GAAIlc,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,KAGpC6c,OAAOC,QAAQjB,EAAW,CAACE,GAAWQ,EAAQ,CAAEQ,YAAY,IAC5DvmB,QAAQoK,QAAQ,eACjB,MAAM,GAAsB,OAAlBmB,GAAuC,YAAb6Z,EAAwB,CAE3D,IAAIoB,EAEFA,EADElf,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIkd,EAAiBhmB,KAAKimB,IAAIC,OAAOC,WAAY,KAC7CW,EAAO9mB,KAAKimB,OAAO9W,GACnBrC,EAAO9M,KAAKsK,OAAO6E,GACnB4X,EAAO/mB,KAAKimB,OAAOlW,GAInBiX,GAHOhnB,KAAKsK,OAAOyF,GAEFgX,IADPja,EAAOga,GAGjBG,EAAYjnB,KAAKimB,IAAID,EAAgB,KAIrCI,EAAS,CACXC,MAAO,GAAGZ,YAAmBlG,IAC7BwG,MAAOkB,EACPX,OANeW,EAAYD,EAO3BT,MAAO,CAAEF,MAAO,KAChBG,MAAO,CACLH,MAAO,IACPa,YAAa,IACbC,WAAY,GAEdV,OAAQ,CAAE1D,EAAG,GAAIlc,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,IAClCud,UAAW,WAITC,EAAc,CAChBrd,EAAGmF,EACHwB,EAAGZ,EACHuX,EAAGT,EACHvjB,KAAM,UACN+gB,KAAM,CACJkD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRtB,MAAO,YAETjkB,KAAM,kBAGRskB,OAAOC,QAAQjB,EAAW,CAAC2B,GAAcjB,EAAQ,CAAEQ,YAAY,IAC/DvmB,QAAQoK,QAAQ,eACjB,CACH,CASO,SAASmd,GAAyBpC,EAAOja,EAAQka,EAAUC,GAChErlB,QAAQ4I,KAAK,gBACb,MAAMkG,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDhS,EAAgB4Z,EAAM9T,WAAW9F,cACjCoG,EAAWP,EAAY+T,EAAM9T,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe4Z,EAAM9T,WAAW9F,cAChCC,aAAc2Z,EAAM9T,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAb6Z,QAEvB,GAAsB,OAAlB7Z,GAAuC,YAAb6Z,EAAwB,CAC3D,MAAMoC,EAAsB,GACtBC,EAAsB,GACtBC,EAAU/nB,KAAKsK,OAAO6E,GAAqBnP,KAAKimB,OAAO9W,GACvD6Y,EAAUhoB,KAAKsK,OAAOyF,GAAqB/P,KAAKimB,OAAOlW,GACvDkY,EAAkB,GAClBC,EAAYloB,KAAKmoB,MAAMJ,EAAUE,GACjCG,EAAYpoB,KAAKmoB,MAAMH,EAAUC,GACjCI,EAAYN,GAAWG,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBV,EAAoB,GAAK7nB,KAAKimB,OAAO9W,GACrC2Y,EAAoB,GAAK9nB,KAAKimB,OAAOlW,GAErC,IAAK,IAAIyY,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBW,GAAiBX,EAAoB,GACzDC,EAAoBU,GAAiBV,EAAoB,GAAKU,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAMrY,EAAQqY,EAAgBL,EAC9BP,EAAoBzX,GAASyX,EAAoB,GAAKY,EAAgBJ,EACtEP,EAAoB1X,GAAS0X,EAAoB,GAEjD,IAAK,IAAIU,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBzX,EAAQoY,GAAiBX,EAAoBzX,GACjE0X,EAAoB1X,EAAQoY,GAAiBV,EAAoB1X,GAASoY,EAAgBF,CAE7F,CAKDC,EAAc,IAAI5gB,MAAMugB,EAAYE,GAAWngB,KAAK,MAGpD,MAAMygB,EAAmB9T,EAAoB5C,IAGvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAC9D,IAAI2W,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAeV,EAAYE,EAAWQ,IAAgB,CAE/E,IACGC,GACChB,EAAoBe,GACpBd,EAAoBc,GACpBF,GAGF,SAEF,IAAII,GAAQ,EACZ,IACE,IAAIpW,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIkZ,GAAmB5oB,OACjD2S,IACA,CACA,IAAI6C,EAAkBvD,EAASvC,IAAIkZ,GAAmBjW,GAAkB,EACxE,IACE,IAAIqW,EAAwB,EAC5BA,EAAwBrU,EAAca,GACtCwT,IACA,CACA,IAAI9M,EAAiBzH,EAAce,GAAiBwT,GACpD,MAAMC,EAAeC,GACnBzD,EACAxT,EACAzG,EACA0Q,EACA4L,EAAoBe,GACpBd,EAAoBc,GACpB1W,GAGF,GAAI8W,EAAavV,OAAQ,CACvBkV,EAAoB1M,EACpBsM,EAAYK,GAAgBI,EAAahnB,MACzC8mB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAI7M,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAI1P,OAAQkc,IAAkB,CACnF,MAAM+M,EAAeC,GACnBzD,EACAxT,EACAzG,EACA0Q,EACA4L,EAAoBe,GACpBd,EAAoBc,GACpB1W,GAGF,GAAI8W,EAAavV,OAAQ,CACvBkV,EAAoB1M,EACpBsM,EAAYK,GAAgBI,EAAahnB,MACzC8mB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAI9C,EAAiBhmB,KAAKimB,IAAIC,OAAOC,WAAY,KAC7Ca,EAAcgB,EAAUD,EACxBd,EAAYjnB,KAAKimB,IAAID,EAAgB,KACrCkD,EAAajC,EAAYD,EAGzBZ,EAAS,CACXC,MAAO,GAAGZ,2BAAkCD,EAAMjG,eAClDwG,MAAOkB,EACPX,OAAQ4C,EACR3C,MAAO,CAAEF,MAAO,KAChBG,MAAO,CACLH,MAAO,IACPa,YAAa,IACbC,WAAY,GAEdV,OAAQ,CAAE1D,EAAG,GAAIlc,EAAG,GAAIiK,EAAG,GAAIjH,EAAG,IAClCud,UAAW,WAITC,EAAc,CAChBrd,EAAG6d,EACHlX,EAAGmX,EACHR,EAAGiB,EACHjlB,KAAM,UACN6lB,aAAa,EACbC,aAAa,EACb/E,KAAM,CACJkD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRtB,MAAO,YAETjkB,KAAM,+BAGRskB,OAAOC,QAAQjB,EAAW,CAAC2B,GAAcjB,EAAQ,CAAEQ,YAAY,IAC/DvmB,QAAQoK,QAAQ,eACjB,CACH,CAaA,SAASwe,GACPzD,EACAxT,EACAzG,EACA0Q,EACAoN,EACAC,EACApX,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBlc,OAErD,GAAwB,IAApBsS,EAAuB,CAoBzB,MAAMkX,EAAa7V,EAAyB2V,EAAoBC,EAlBjD,CACb,CACEna,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIsN,EAAW9V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOwnB,GACLhE,EACAxT,EACAzG,EACA0Q,EACAsN,EAAWvd,IACXud,EAAWtd,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMkX,EAAa7V,EAAyB2V,EAAoBC,EAlBjD,CACb,CACEna,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIsN,EAAW9V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOwnB,GACLhE,EACAxT,EACAzG,EACA0Q,EACAsN,EAAWvd,IACXud,EAAWtd,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOzR,MAAO,KACjC,CAaA,SAASwnB,GAAsBhE,EAAOxT,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAMpJ,EAAiByC,EAAOzC,eACxBuJ,EAAkBL,EAASvC,IAAI9B,GAAc5N,OAInD,IAGI8mB,EAHA3a,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/C2a,EADElf,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAI2gB,EAA6B,EACjC,IAAK,IAAI/W,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D+W,GACE5C,EAAM7U,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAO+W,CACT,CASA,SAASZ,GAAmB7e,EAAG2G,EAAG+Y,GAChC,IAAIjW,GAAS,EACb,IAAK,IAAI3T,EAAI,EAAGA,EAAI4pB,EAAS3pB,OAAQD,IAAK,CACxC,OAAQ6pB,EAAIC,IAAMC,EAAIC,IAAOJ,EAAS5pB,GACpB8pB,EAAKjZ,GAAMmZ,EAAKnZ,GAAK3G,GAAM6f,EAAKF,IAAOhZ,EAAIiZ,IAAQE,EAAKF,GAAMD,IACjElW,GAAUA,EAC1B,CACD,OAAOA,CACT,CCtbA,IAAIsW,GAAc,KAMlBrf,eAAesf,KACb,GAAID,GAAa,OAAOA,SAClBE,OAAO,kDACb,OACIC,QAASC,IACTD,QAASE,IACTF,QAASG,IACTH,QAASI,IACTJ,QAASK,IACTL,QAASM,IACTN,QAASO,IACTP,QAASQ,IACTR,QAASS,IACTT,QAASU,UACHpmB,QAAQqmB,IAAI,CACpBZ,OAAO,2CACPA,OAAO,2DACPA,OAAO,qEACPA,OAAO,4CACPA,OAAO,iDACPA,OAAO,2DACPA,OAAO,yDACPA,OAAO,4CACPA,OAAO,gDACPA,OAAO,sDAcT,OAZAF,GAAc,CACZI,WACAC,2BACAC,eACAC,eACAC,eACAC,0BACAC,yBACAC,YACAC,cACAC,qBAEKb,EACT,CAEA,MAAMe,GAAgB,IAAI1pB,IAWnB,SAAS2pB,GAAiBpiB,EAAU,IACzC,MAAO,CACLqiB,WAAYriB,EAAQqiB,YAAc,eAClCC,QAAStiB,EAAQsiB,UAAW,EAC5BC,cAAeviB,EAAQuiB,gBAAiB,EACxCC,eAAgBxiB,EAAQwiB,gBAAkB,WAE9C,CAWO,SAASC,GAAyBziB,EAAU,IACjD,MAAO,CACL0iB,QAAS1iB,EAAQ0iB,UAAW,EAC5BC,iBAAkB3iB,EAAQ2iB,kBAAoB,GAC9CxF,MAAOnd,EAAQmd,OAAS,CAAC,IAAM,IAAM,KACrCyF,UAAW5iB,EAAQ4iB,WAAa,EAEpC,CAUO7gB,eAAe8gB,GAAgBhG,EAAOja,EAAQka,EAAUC,EAAW+F,EAAgB,IACxFprB,QAAQ4I,KAAK,gBACb,MAAM2C,EAAgB4Z,EAAM9T,WAAW9F,cACjCoG,EAAWP,EAAY+T,EAAM9T,YAC7Bga,QAAgBC,GAA+BnG,EAAOja,EAAQyG,EAAU,CAC5E6T,KAAwB,OAAlBja,GAAuC,SAAb6Z,EAAsB,OAAS,kBAE3DmG,GAAeF,EAAShG,EAAWF,EAAMjG,aAAckG,EAAUgG,GACvEprB,QAAQoK,QAAQ,eAClB,CAUOC,eAAemhB,GAA4BrG,EAAOja,EAAQka,EAAUC,EAAW+F,EAAgB,IAEpG,GADAprB,QAAQ4I,KAAK,gBAC0B,OAAnCuc,EAAM9T,WAAW9F,eAAuC,YAAb6Z,EAAwB,CAErE,MAAMzT,EAAWP,EAAY+T,EAAM9T,YAC7Bga,QAAgBC,GAA+BnG,EAAOja,EAAQyG,EAAU,CAC5E6T,KAAyC,OAAnCL,EAAM9T,WAAW9F,eAAuC,SAAb6Z,EAAsB,OAAS,YAIlF,aAFMmG,GAAeF,EAAShG,EAAWF,EAAMjG,aAAckG,EAAUgG,QACvEprB,QAAQoK,QAAQ,eAEjB,CACD,MAAMuH,EAAWP,EAAY+T,EAAM9T,YAC7Boa,QAkhBRphB,eAAwC8a,EAAOja,EAAQyG,GACrD,MAAM+Z,QA5GRrhB,eAA2C8a,EAAOja,EAAQyG,GACxD,MAAM7C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClD1L,EAAiB,IAAIvG,EAAe,CACxCC,cAAe4Z,EAAM9T,WAAW9F,cAChCC,aAAc2Z,EAAM9T,WAAW7F,eAGjC,IAAIib,EAAO3X,EAAkB,GACzBrC,EAAOqC,EAAkB,GACzB4X,EAAOhX,EAAkB,GACzB/C,EAAO+C,EAAkB,GAC7B,IAAK,IAAIjQ,EAAI,EAAGA,EAAIqP,EAAkBpP,OAAQD,IAAK,CACjD,MAAMkK,EAAImF,EAAkBrP,GACtB6Q,EAAIZ,EAAkBjQ,GACxBkK,EAAI8c,IAAMA,EAAO9c,GACjBA,EAAI8C,IAAMA,EAAO9C,GACjB2G,EAAIoW,IAAMA,EAAOpW,GACjBA,EAAI3D,IAAMA,EAAO2D,EACtB,CAED,MAAMoX,EAAUjb,EAAOga,EACjBkB,EAAUhb,EAAO+Z,EACjBiF,EAAmB,GAEnB9D,EAAYloB,KAAKsK,IAAI,EAAGtK,KAAKmoB,MAAMJ,EAAUiE,IAC7C5D,EAAYpoB,KAAKsK,IAAI,EAAGtK,KAAKmoB,MAAMH,EAAUgE,IAE7C3c,EAAS0Y,GAAWG,EAAY,GAChCjY,EAAS+X,GAAWI,EAAY,GAEhC6D,EAAgB/D,EAAYE,EAC5BP,EAAsB,IAAIqE,aAAaD,GACvCnE,EAAsB,IAAIoE,aAAaD,GACvC1D,EAAc,IAAI2D,aAAaD,GACrC1D,EAAYtgB,KAAKG,OAAO+jB,KACxB,MAAMC,EAAa,IAAIC,WAAWJ,GAE5BvD,EAAmB9T,EAAoB5C,IACvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAE9D,IAAI2W,EAAoB,EACxB,IAAK,IAAI2D,EAAK,EAAGA,EAAKpE,EAAWoE,IAC/B,IAAK,IAAIC,EAAK,EAAGA,EAAKnE,EAAWmE,IAAM,CACrC,MAAM3D,EAAe0D,EAAKlE,EAAYmE,EAChCviB,EAAI8c,EAAOwF,EAAKjd,EAChBsB,EAAIoW,EAAOwF,EAAKtc,EAKtB,GAHA4X,EAAoBe,GAAgB5e,EACpC8d,EAAoBc,GAAgBjY,GAE/BkY,GAAmB7e,EAAG2G,EAAG+X,GAC5B,SAGF,IAAII,GAAQ,EACZ,IACE,IAAIpW,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIkZ,GAAmB5oB,OACjD2S,IACA,CACA,MAAM6C,EAAkBvD,EAASvC,IAAIkZ,GAAmBjW,GAAkB,EAC1E,IAAK,IAAI8Z,EAAK,EAAGA,EAAK9X,EAAca,GAAkBiX,IAAM,CAC1D,MAAMvQ,EAAiBzH,EAAce,GAAiBiX,GAChDxD,EAAeC,GAAYzD,EAAOxT,EAAUzG,EAAQ0Q,EAAgBjS,EAAG2G,EAAGuB,GAEhF,GAAI8W,EAAavV,OAAQ,CACvBkV,EAAoB1M,EACpBsM,EAAYK,GAAgBI,EAAahnB,MACzCoqB,EAAWxD,GAAgB,EAC3BE,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAED,IAAKA,EACH,IAAK,IAAI7M,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAI1P,OAAQkc,IAAkB,CACnF,MAAM+M,EAAeC,GAAYzD,EAAOxT,EAAUzG,EAAQ0Q,EAAgBjS,EAAG2G,EAAGuB,GAEhF,GAAI8W,EAAavV,OAAQ,CACvBkV,EAAoB1M,EACpBsM,EAAYK,GAAgBI,EAAahnB,MACzCoqB,EAAWxD,GAAgB,EAC3B,KACD,CACF,CAEJ,CAGH,MAAO,CACLV,YACAE,YACAtB,OACAC,OACA1X,SACAY,SACA8X,UACAC,UACAH,sBACAC,sBACAS,cACA6D,aAEJ,CAGqBK,CAA4BjH,EAAOja,EAAQyG,IACxDkW,UACJA,EAASE,UACTA,EAAStB,KACTA,EAAIC,KACJA,EAAI1X,OACJA,EAAMY,OACNA,EAAM4X,oBACNA,EAAmBC,oBACnBA,EAAmBS,YACnBA,EAAW6D,WACXA,GACEL,EAEErH,EAASgI,GAAiB7E,EAAqBC,GAC/C6E,EAoCR,SAAkCC,EAAIC,EAAIT,GACxC,MAAMU,EAAS,GAEf,IAAK,IAAIR,EAAK,EAAGA,EAAKM,EAAK,EAAGN,IAC5B,IAAK,IAAIC,EAAK,EAAGA,EAAKM,EAAK,EAAGN,IAAM,CAClC,MAAMQ,EAAKT,EAAKO,EAAKN,EACfS,GAAMV,EAAK,GAAKO,EAAKN,EACrBU,GAAMX,EAAK,GAAKO,GAAMN,EAAK,GAC3BW,EAAKZ,EAAKO,GAAMN,EAAK,GAEtBH,EAAWW,IAAQX,EAAWY,IAAQZ,EAAWa,IAAQb,EAAWc,IAIzEJ,EAAOhf,KAAK,EAAGif,EAAIC,EAAIC,EAAIC,EAC5B,CAGH,OAAOC,YAAY1Y,KAAKqY,EAC1B,CAvDgBM,CAAyBlF,EAAWE,EAAWgE,GACvDiB,QAAiBC,GAAc5I,EAAQ6D,EAAaoE,EAAO,WAEjE,MAAO,CACLjI,SACA6I,QAAShF,EACToE,QACAU,WACAxH,KAAM,UACN2H,SAAU,CACR5hB,cAAe,KACf6hB,eAAgB/I,EAAO3kB,OAAS,EAChC2tB,cAAeC,GAAiBhB,GAChCiB,kBAAmB,CACjBhB,GAAI1E,EACJ2E,GAAIzE,EACJrlB,OAAQ,CAAC+jB,EAAMC,GACf8G,QAAS,CAACxe,EAAQY,GAClB6d,aAAcC,GAAiCxF,EAAaL,EAAWE,KAI/E,CAxjBoC4F,CAAyBxI,EAAOja,EAAQyG,SACpE4Z,GACJE,EACApG,EACAF,EAAMjG,aACN,GAAGkG,iBACHgG,GAEFprB,QAAQoK,QAAQ,eAClB,CAUOC,eAAeihB,GAA+BnG,EAAOja,EAAQyG,EAAW,KAAMrJ,EAAU,IAC7F,MAAMslB,EAAejc,GAAYP,EAAY+T,EAAM9T,aAC7CvC,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDsQ,EAAgBC,GAAsB5iB,EAAOzC,eAAgBqG,EAAkBpP,QAC/E2kB,EAASgI,GAAiBvd,EAAmBY,GAE7C8V,EAAOld,EAAQkd,MAAQ,UACvB8G,EACK,SAAT9G,EAsQJ,SAAkCuI,GAChC,GAAIA,EAAc,EAAG,OAAO,IAAIjB,YAAY,GAC5C,MAAML,EAAS,IAAIK,YAAgC,GAAnBiB,EAAc,IAC9C,IAAIC,EAAS,EACb,IAAK,IAAIvuB,EAAI,EAAGA,EAAIsuB,EAAc,EAAGtuB,IACnCgtB,EAAOuB,KAAY,EACnBvB,EAAOuB,KAAYvuB,EACnBgtB,EAAOuB,KAAYvuB,EAAI,EAEzB,OAAOgtB,CACT,CA/QQwB,CAAyBnf,EAAkBpP,QAiRnD,SAA+B0P,GAC7B,MAAMqd,EAAS,GACf,IAAK,IAAIhtB,EAAI,EAAGA,EAAI2P,EAAI1P,OAAQD,IAAK,CACnC,MAAMyuB,EAAOC,GAAgC/e,EAAI3P,IACjDgtB,EAAOhf,KAAKygB,EAAKxuB,UAAWwuB,EAC7B,CACD,OAAOpB,YAAY1Y,KAAKqY,EAC1B,CAvRQ2B,CAAsBR,EAAaxe,KAAO,IAIhD,MAAO,CACLiV,SACA6I,QAASW,EACTvB,QACAU,eANqBC,GAAc5I,EAAQwJ,EAAevB,EAAO9G,GAOjEA,OACA2H,SAAU,CACRjO,aAAciG,EAAMjG,aACpB3T,cAAe4Z,EAAM9T,WAAW9F,cAChC6hB,eAAgB/I,EAAO3kB,OAAS,EAChC2tB,cAAeC,GAAiBhB,IAGtC,CAUOjiB,eAAegkB,GAA2BlJ,EAAOja,EAAQyG,EAAW,KAAMrJ,EAAU,IAEzF,OAiVF,SAAwB+iB,GACtB,MAAMiD,aAAEA,EAAYC,QAAEA,GAfxB,SAA6CC,GAC3C,MAAMF,EAAe,GACnBC,EAAU,GACZ,IAAIP,EAAS,EACXS,EAAU,EACZ,KAAOT,EAASQ,EAAY9uB,QAAQ,CAClC,MAAMgvB,EAAOF,EAAYR,KACzB,IAAK,IAAIvuB,EAAI,EAAGA,EAAIivB,EAAMjvB,IAAK6uB,EAAa7gB,KAAK+gB,EAAYR,MAC7DS,GAAWC,EACXH,EAAQ9gB,KAAKghB,EACd,CACD,MAAO,CAAEH,eAAcC,UACzB,CAGoCI,CAAoCtD,EAAQiB,OACxEc,EAAiB/B,EAAQhH,OAAO3kB,OAAS,EACzCkvB,EAA0B,SAAjBvD,EAAQ7F,KACjBqJ,EAAcD,EAAS,QAAU,QACvC,MAAO,CACL,wBACA,oEACA,eACA,8BAA8BxB,uCAAoDwB,EAASL,EAAQ7uB,OAAS,wCAAwCkvB,EAAS,EAAIL,EAAQ7uB,WACzK,uCACA,2FAA2F4H,MAAM8M,KAAKiX,EAAQ6B,SAASjlB,KAAK,mBAC5H,qBACA,iBACA,2EAA2EX,MAAM8M,KAAKiX,EAAQhH,QAAQpc,KAAK,mBAC3G,kBACA,UAAU4mB,KACV,sEAAsEP,EAAarmB,KAAK,mBACxF,iEAAiEsmB,EAAQtmB,KAAK,mBAC9E,WAAW4mB,KACX,eACA,gBACA,cACA5mB,KAAK,KACT,CAzWS6mB,OADexD,GAA+BnG,EAAOja,EAAQyG,EAAUrJ,GAEhF,CAOO,SAASymB,GAAiC7jB,GAC/C,MAAM4D,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClD2P,EAAUY,GAAsB5iB,EAAOzC,eAAgBqG,EAAkBpP,QACzEsvB,EAAW,IAAInD,aAAwC,EAA3B/c,EAAkBpP,QAEpD,IAAK,IAAID,EAAI,EAAGA,EAAIqP,EAAkBpP,OAAQD,IAAK,CACjD,MAAMwvB,EAAW,EAAJxvB,EACbuvB,EAASC,GAAQlnB,OAAO+G,EAAkBrP,KAAO,EACjDuvB,EAASC,EAAO,GAAKlnB,OAAO2H,EAAkBjQ,KAAO,EACrDuvB,EAASC,EAAO,GAAK/B,EAAQztB,EAC9B,CAED,MAAO,CACLuvB,WACAE,cAAe,CAACpgB,EAAkBpP,OAAQ,GAC1CyvB,OAAQjC,EACR7I,OAAQgI,GAAiBvd,EAAmBY,GAEhD,CAIArF,eAAekhB,GAAeF,EAAShG,EAAWnG,EAAckG,EAAUgG,EAAgB,IACxF,GAAwB,oBAAbgE,SAET,YADA/uB,EAAS,uDAGX,MAAMypB,SACJA,EAAQC,yBACRA,EAAwBC,aACxBA,EAAYI,uBACZA,EAAsBC,UACtBA,EAASE,kBACTA,SACQZ,KAEJ0F,EAAYD,SAASE,eAAejK,GAC1C,IAAKgK,EAEH,YADAhvB,EAAS,0CAA0CglB,KAIjDoF,GAAc9J,IAAI0E,KACpBoF,GAAcnlB,IAAI+f,GAAW9f,SAC7BklB,GAAcllB,OAAO8f,IAGvBgK,EAAUE,UAAY,GACtBF,EAAUG,MAAMC,SAAW,WAC3BJ,EAAUG,MAAM9J,MAAQ2J,EAAUG,MAAM9J,OAAS,OACjD2J,EAAUG,MAAMvJ,OAASoJ,EAAUG,MAAMvJ,QAAU,QAEnD,MAAMyJ,EAAsBtF,EAAuBuF,YAAY,CAAEC,WAAY,CAAC,EAAG,EAAG,KACpFF,EAAoBG,aAAaR,GACjCK,EAAoBI,SAEpB,MAAMC,EAAWL,EAAoBM,cAC/BC,EAAeP,EAAoBQ,kBAEnCC,EAAS9F,EAAUsF,cACzBQ,EAAOC,aAAa/E,EAAQ2B,UAC5BmD,EAAOE,8BACPF,EAAOG,2BACPH,EAAOI,qBAAoB,GAE3B,MAAMC,EA+NR,SAAwBtD,GACtB,IAAKA,GAASxtB,OAAQ,MAAO,CAAC,EAAG,GACjC,IAAI+wB,EAAW1oB,OAAO2oB,kBAClBC,EAAW5oB,OAAO6oB,kBACtB,IAAK,IAAInxB,EAAI,EAAGA,EAAIytB,EAAQxtB,OAAQD,IAAK,CACvC,MAAMkC,EAAQurB,EAAQztB,GACjBsI,OAAO8oB,SAASlvB,KACjBA,EAAQ8uB,IAAUA,EAAW9uB,GAC7BA,EAAQgvB,IAAUA,EAAWhvB,GAClC,CACD,OAAKoG,OAAO8oB,SAASJ,IAAc1oB,OAAO8oB,SAASF,GAC/CF,IAAaE,EAAiB,CAACF,EAAW,EAAGE,EAAW,GACrD,CAACF,EAAUE,GAFmD,CAAC,EAAG,EAG3E,CA5OsBG,CAAezF,EAAQ6B,SAC3CiD,EAAOY,eAAeP,EAAY,GAAIA,EAAY,IAElD,MAAMQ,EAAa5F,EAAc4F,YAActG,GAAiB,CAAE,GAC5DuG,EAAclH,EAAyB4F,cAGvCuB,EAoGR,SAA+BC,EAAQvG,GACrC,IAAKA,IAAYuG,GAAQC,WAAW1xB,OAAQ,OAAOyxB,EACnD,MAAME,EAAMF,EAAOC,UACb3K,EAAO4K,EAAI,GACX5kB,EAAO4kB,EAAIA,EAAI3xB,OAAS,GACxB4xB,EAAW,GACjB,IAAK,IAAI7xB,EAAI4xB,EAAI3xB,OAAS,EAAGD,GAAK,EAAGA,GAAK,EACxC6xB,EAAS7jB,KAAKhB,GAAQ4kB,EAAI5xB,GAAKgnB,GAAO4K,EAAI5xB,EAAI,GAAI4xB,EAAI5xB,EAAI,GAAI4xB,EAAI5xB,EAAI,IAExE,MAAO,IAAK0xB,EAAQC,UAAWE,EACjC,CA9GuBC,CADnBvH,EAAawH,gBAAgBR,EAAWrG,aAAeX,EAAawH,gBAAgB,gBACnCR,EAAWpG,SAC9DqG,EAAYQ,cAAcP,GAC1BD,EAAYS,gBAAgBlB,EAAY,GAAIA,EAAY,IACxDS,EAAYU,cACZxB,EAAOyB,eAAeX,GAEtB,MAAMY,EAAQ/H,EAAS6F,cAKvB,GAJAkC,EAAMC,UAAU3B,GACK,SAAjB9E,EAAQ7F,MAAiBqM,EAAME,cAAcC,aAAa,GAC9DjC,EAASkC,SAASJ,GAEdb,EAAWnG,cAAe,CAC5B,MAAMqH,EAAiB3H,EAAkBoF,YAAY,CACnDwC,mBAAmB,EACnBC,cAAgBC,IACd,MAAMC,EAASD,EAAOE,oBACtB,IAAKD,GAAUA,EAAO5yB,OAAS,EAAG,OAClC,MAAO8yB,EAAQC,GAAUH,EAEnBI,GAAQD,EAASD,GAAM,EACvBG,EAAQrrB,MAAM8M,KAAK,CAAE1U,OAFb,IAE8B,CAAC0X,EAAG3X,IAAM+yB,EAAS/yB,EAAIizB,IACnEL,EAAOO,SAASD,GAChBN,EAAOQ,eACLF,EAAMvvB,KAAKgE,IACT,MAAM8C,EAAMvK,KAAKuK,IAAI9C,GACrB,OAAY,IAAR8C,EAAkB,IAClBA,GAAO,KAAQA,EAAM,IAAcga,WAAW9c,EAAE0rB,YAAY,IAAIpsB,WAC7DU,EAAEgW,cAAc,EAAE,IAE5B,IAGL8U,EAAea,iBAAiB,CAAEC,UAAW,UAC7Cd,EAAee,iBAAiB,CAAED,UAAW,UAC7Cd,EAAegB,aAAalC,EAAWlG,gBACvCoH,EAAeiB,mBAAmBlC,GAClClB,EAASqD,WAAWlB,EACrB,CAED,MAAMmB,EAAetI,GAAyBK,EAAciI,cAAgB,CAAErI,SAAS,IACnFqI,EAAarI,SAA4B,SAAjBK,EAAQ7F,YAUtCnb,eAAyC0lB,EAAU1E,EAASmF,EAAa8C,GACvE,MAAMC,EAAWlI,EAAQ8B,UAAUI,kBACnC,IAAKgG,EACH,OAEF,MAAMzJ,SAAEA,EAAQG,aAAEA,EAAYC,aAAEA,EAAYC,wBAAEA,EAAuBE,UAAEA,SAAoBV,KAErF6J,EAAYtJ,EAAayF,cAC/B6D,EAAUC,cAAcF,EAAShH,GAAIgH,EAAS/G,GAAI,GAClDgH,EAAUE,UAAUH,EAAS7wB,OAAO,GAAI6wB,EAAS7wB,OAAO,GAAI,GAC5D8wB,EAAUG,WAAWJ,EAAS/F,QAAQ,GAAI+F,EAAS/F,QAAQ,GAAI,GAE/D,MAAMC,EAAexD,EAAa0F,YAAY,CAC5C5tB,KAAM,WACN6xB,mBAAoB,EACpBC,OAAQN,EAAS9F,eAEnB+F,EAAUM,eAAeC,WAAWtG,GAEpC,MAAMuG,EAAgB7J,EAAwBwF,YAAY,CACxDsE,YAAa,EACbzwB,MAAO,EACP0wB,aAAa,IAEfF,EAAc5D,aAAaoD,GAE3B,MAAM9pB,EAAI/J,KAAKsK,IAAI,EAAGqpB,EAAerI,kBAC/BwF,EAAWD,EAAY,GACvBG,EAAWH,EAAY,GACvBkC,GAAQ/B,EAAWF,IAAa/mB,EAAI,GACpCyqB,EAAgB,GACtB,IAAK,IAAI10B,EAAI,EAAGA,EAAIiK,EAAGjK,IACrB00B,EAAc1mB,KAAKgjB,EAAWhxB,EAAIizB,GAEpCsB,EAAcI,iBAAiBD,GAC/BH,EAAcK,SAEd,MAAMC,EAAgBjK,EAAUsF,cAChC2E,EAAclE,aAAa4D,EAAcO,iBACzCD,EAAc/D,qBAAoB,GAElC,MAAMiE,EAAe1K,EAAS6F,cAC9B6E,EAAa1C,UAAUwC,GACvBE,EAAazC,cAAc0C,YAAYnB,EAAe7N,OACtD+O,EAAazC,cAAcC,aAAasB,EAAepI,WACvD6E,EAASkC,SAASuC,EACpB,CAvDUE,CAA0B3E,EAAU1E,EAASmF,EAAa6C,GAGlEtD,EAAS4E,cACT1E,EAAa2E,SACbnK,GAAczmB,IAAIqhB,EAAWqK,GAC7BL,EAAUrJ,MAAQ,GAAGZ,YAAmBlG,GAC1C,CAkEA7U,eAAe4iB,GAAc5I,EAAQ6I,EAASZ,EAAO9G,EAAO,WAC1D,MAAM8E,YAAEA,EAAWL,aAAEA,SAAuBN,KACtCqD,EAAW1C,EAAYqF,cAC7B3C,EAAS6H,YAAYC,QAAQzQ,EAAQ,GACjCiI,EAAM5sB,OAAS,IACJ,SAAT8lB,EAAiBwH,EAAS+H,WAAWD,QAAQxI,GAC5CU,EAASgI,WAAWF,QAAQxI,IAEnC,MAAM2I,EAAahL,EAAa0F,YAAY,CAC1C5tB,KAAM,WACN6xB,mBAAoB,EACpBC,OAAQ3G,IAGV,OADAF,EAAS8G,eAAeC,WAAWkB,GAC5BjI,CACT,CAEA,SAASX,GAAiBvd,EAAmBY,GAC3C,MAAM2U,EAAS,IAAIwH,aAAwC,EAA3B/c,EAAkBpP,QAClD,IAAK,IAAID,EAAI,EAAGA,EAAIqP,EAAkBpP,OAAQD,IAAK,CACjD,MAAMwvB,EAAW,EAAJxvB,EACb4kB,EAAO4K,GAAQlnB,OAAO+G,EAAkBrP,KAAO,EAC/C4kB,EAAO4K,EAAO,GAAKlnB,OAAO2H,IAAoBjQ,KAAO,EACrD4kB,EAAO4K,EAAO,GAAK,CACpB,CACD,OAAO5K,CACT,CAEA,SAASyJ,GAAsBrlB,EAAgBysB,GAC7C,MAAMhI,EAAU,IAAIrB,aAAaqJ,GACjC,IAAK,IAAIz1B,EAAI,EAAGA,EAAIy1B,EAAgBz1B,IAAK,CACvC,MAAMkC,EAAQ8G,IAAiBhJ,GAC/BytB,EAAQztB,GAAKsI,OAAOT,MAAMiD,QAAQ5I,GAASA,EAAM,GAAKA,IAAU,CACjE,CACD,OAAOurB,CACT,CAuBA,SAASiB,GAAgCgH,GACvC,MAAMC,EAAUD,EAAa/xB,KAAKiyB,GAASA,EAAO,IAC5C3rB,EAAI0rB,EAAQ11B,OAElB,OAAU,IAANgK,GAAiB,IAANA,EACN0rB,EAGC,IAAN1rB,EAMK,CAAC0rB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAAN1rB,EACK,CAAC0rB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAGhC,IAAN1rB,EAKK,CAAC0rB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAAN1rB,EAQK,CAAC0rB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAI/CA,EAAQ5xB,MAAM,EAAG7D,KAAKimB,IAAI,EAAGwP,EAAQ11B,QAC9C,CAiBA,SAAS4tB,GAAiBkB,GACxB,IAAI8G,EAAQ,EACVtH,EAAS,EACX,KAAOA,EAASQ,EAAY9uB,QAC1BsuB,GAAUQ,EAAYR,GAAU,EAChCsH,IAEF,OAAOA,CACT,CAiMA,SAAS5H,GAAiCmG,EAAQtH,EAAIC,GAGpD,MAAM+I,EAAY,IAAI1J,aAAaU,EAAKC,GACxC,IAAK,IAAIN,EAAK,EAAGA,EAAKM,EAAIN,IACxB,IAAK,IAAID,EAAK,EAAGA,EAAKM,EAAIN,IACxBsJ,EAAUtJ,EAAKC,EAAKK,GAAMsH,EAAO5H,EAAKO,EAAKN,GAG/C,OAAOqJ,CACT,CAyBA,SAAS3M,GACPzD,EACAxT,EACAzG,EACA0Q,EACAoN,EACAC,EACApX,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBlc,OAErD,GAAwB,IAApBsS,EAAuB,CACzB,MAmBMkX,EAAa7V,EAAyB2V,EAAoBC,EAnB/C,CACf,CACEna,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIsN,EAAW9V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOwnB,GACLhE,EACAxT,EACAzG,EACA0Q,EACAsN,EAAWvd,IACXud,EAAWtd,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAChC,MAmBMkX,EAAa7V,EAAyB2V,EAAoBC,EAnB/C,CACf,CACEna,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIsN,EAAW9V,OACb,MAAO,CACLA,QAAQ,EACRzR,MAAOwnB,GACLhE,EACAxT,EACAzG,EACA0Q,EACAsN,EAAWvd,IACXud,EAAWtd,IACXiG,GAIP,CAED,MAAO,CAAEuB,QAAQ,EAAOzR,MAAO,KACjC,CAEA,SAASwnB,GAAsBhE,EAAOxT,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAC9E,MAAMpJ,EAAiByC,EAAOzC,eACxBuJ,EAAkBL,EAASvC,IAAI9B,GAAc5N,OAE7CmM,EAD+BgG,EAAenG,kBAAkBC,EAAKC,GACxBC,cAE7C2a,EAAQlf,MAAMiD,QAAQ9B,EAAe,IAAMA,EAAerF,KAAKzB,GAAUA,EAAM,KAAM8G,EAE3F,IAAI+sB,EAAoB,EACxB,IAAK,IAAInjB,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DmjB,GACEhP,EAAM7U,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOmjB,CACT,CAEA,SAAShN,GAAmB7e,EAAG2G,EAAG+Y,GAChC,IAAIjW,GAAS,EACb,IAAK,IAAI3T,EAAI,EAAGA,EAAI4pB,EAAS3pB,OAAQD,IAAK,CACxC,OAAQ6pB,EAAIC,IAAMC,EAAIC,IAAOJ,EAAS5pB,GACpB8pB,EAAKjZ,GAAMmZ,EAAKnZ,GAAK3G,GAAM6f,EAAKF,IAAOhZ,EAAIiZ,IAAQE,EAAKF,GAAMD,IACjElW,GAAUA,EAC1B,CACD,OAAOA,CACT,CC90BO,MAAMqiB,GAKX,WAAAzwB,GACEyG,KAAKd,OAAS,KACdc,KAAKiqB,UAAY,KACjBjqB,KAAKkqB,SAAU,EAEflqB,KAAKmqB,aACN,CAOD,iBAAMA,GACJ,IACEnqB,KAAKd,OAAS,IAAIC,OAAO,IAAIC,IAAI,iCAAkCC,KAAM,CACvE7H,KAAM,WAGRwI,KAAKd,OAAOkrB,QAAWC,IACrB91B,QAAQ6E,MAAM,iCAAkCixB,EAAM,EAExD,MAAMC,EAAgBhrB,EAAaU,KAAKd,QAExCc,KAAKiqB,gBAAkB,IAAIK,EAE3BtqB,KAAKkqB,SAAU,CAChB,CAAC,MAAO9wB,GAEP,MADA7E,QAAQ6E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAMmxB,GACJ,OAAIvqB,KAAKkqB,QAAgBxxB,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAAS6xB,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACIzqB,KAAKkqB,QACPvxB,IACS8xB,GANO,GAOhBD,EAAO,IAAIp0B,MAAM,2CAEjBu0B,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAM/W,CAAeC,GAEnB,aADM5T,KAAKuqB,eACJvqB,KAAKiqB,UAAUtW,eAAeC,EACtC,CAOD,mBAAMC,CAAcjO,GAElB,aADM5F,KAAKuqB,eACJvqB,KAAKiqB,UAAUpW,cAAcjO,EACrC,CAQD,0BAAMkO,CAAqB/J,EAAagK,GAEtC,aADM/T,KAAKuqB,eACJvqB,KAAKiqB,UAAUnW,qBAAqB/J,EAAagK,EACzD,CAOD,qBAAMC,CAAgBtX,GAEpB,aADMsD,KAAKuqB,eACJvqB,KAAKiqB,UAAUjW,gBAAgBtX,EACvC,CAMD,WAAMuX,SACEjU,KAAKuqB,eACOK,YAAYC,MAC9B,MAAMprB,QAAeO,KAAKiqB,UAAUhW,QAEpC,OADgB2W,YAAYC,MACrBprB,CACR,CAMD,kBAAMqrB,GAEJ,aADM9qB,KAAKuqB,eACJvqB,KAAKiqB,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADM/qB,KAAKuqB,eACJvqB,KAAKiqB,UAAUc,MACvB,CAKD,SAAAnrB,GACMI,KAAKd,SACPc,KAAKd,OAAOU,YACZI,KAAKd,OAAS,KACdc,KAAKiqB,UAAY,KACjBjqB,KAAKkqB,SAAU,EAElB,EC1IS,MAACc,GAAe"}
\ No newline at end of file
diff --git a/dist/feascript.umd.js b/dist/feascript.umd.js
index 486b316..6aaa7ba 100644
--- a/dist/feascript.umd.js
+++ b/dist/feascript.umd.js
@@ -1,7 +1,8 @@
-function _loadWasmModule(e,t,n){for(var o=t.length,s="="==t[o-2]?2:"="==t[o-1]?1:0,i=new Uint8Array(3*o/4-s),r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",a=new Uint8Array(130),l=0;l<64;l++)a[r.charCodeAt(l)]=l;for(var d=0,c=0;d<o;d+=4){var u=a[t.charCodeAt(d+1)],m=a[t.charCodeAt(d+2)];i[c++]=a[t.charCodeAt(d)]<<2|u>>4,i[c++]=(15&u)<<4|m>>2,i[c++]=(3&m)<<6|63&a[t.charCodeAt(d+3)]}if(n&&!e)return WebAssembly.instantiate(i,n);if(n||e){var h=new WebAssembly.Module(i);return n?new WebAssembly.Instance(h,n):h}return WebAssembly.compile(i)}!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).FEAScript={})}(this,(function(e){"use strict";function t(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}let n="basic";function o(e){"debug"===n&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function s(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function i(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}function r(e){console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;")}
+function _loadWasmModule(e,t,n){for(var o=t.length,s="="==t[o-2]?2:"="==t[o-1]?1:0,i=new Uint8Array(3*o/4-s),r="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",a=new Uint8Array(130),l=0;l<64;l++)a[r.charCodeAt(l)]=l;for(var d=0,c=0;d<o;d+=4){var u=a[t.charCodeAt(d+1)],m=a[t.charCodeAt(d+2)];i[c++]=a[t.charCodeAt(d)]<<2|u>>4,i[c++]=(15&u)<<4|m>>2,i[c++]=(3&m)<<6|63&a[t.charCodeAt(d+3)]}if(n&&!e)return WebAssembly.instantiate(i,n);if(n||e){var h=new WebAssembly.Module(i);return n?new WebAssembly.Instance(h,n):h}return WebAssembly.compile(i)}!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).FEAScript={})}(this,(function(e){"use strict";function t(e){let t=0;for(let n=0;n<e.length;n++)t+=e[n]*e[n];return t=Math.sqrt(t),t}let n="basic";function o(e){"debug"===n&&console.log("%c[DEBUG] "+e,"color: #2196F3; font-weight: bold;")}function s(e){console.log("%c[INFO] "+e,"color: #4CAF50; font-weight: bold;")}function i(e){console.log("%c[ERROR] "+e,"color: #F44336; font-weight: bold;")}
 /**
    * @license
    * Copyright 2019 Google LLC
    * SPDX-License-Identifier: Apache-2.0
-   */const a=Symbol("Comlink.proxy"),l=Symbol("Comlink.endpoint"),d=Symbol("Comlink.releaseProxy"),c=Symbol("Comlink.finalizer"),u=Symbol("Comlink.thrown"),m=e=>"object"==typeof e&&null!==e||"function"==typeof e,h=new Map([["proxy",{canHandle:e=>m(e)&&e[a],serialize(e){const{port1:t,port2:n}=new MessageChannel;return f(e,t),[n,[n]]},deserialize:e=>(e.start(),g(e))}],["throw",{canHandle:e=>m(e)&&u in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function f(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:r,path:l}=Object.assign({path:[]},s.data),d=(s.data.argumentList||[]).map(F);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(r){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=F(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,d);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[a]:!0})}(new n(...d));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;f(e,n),m=function(e,t){return D.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[u]:0}}Promise.resolve(m).catch((e=>({value:e,[u]:0}))).then((n=>{const[s,a]=$(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),a),"RELEASE"===r&&(t.removeEventListener("message",o),p(t),c in e&&"function"==typeof e[c]&&e[c]())})).catch((e=>{const[n,o]=$({value:new TypeError("Unserializable return value"),[u]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function p(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function g(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),C(e,n,[],t)}function b(e){if(e)throw new Error("Proxy has been released and is not useable")}function y(e){return x(e,new Map,{type:"RELEASE"}).then((()=>{p(e)}))}const E=new WeakMap,v="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(E.get(e)||0)-1;E.set(e,t),0===t&&y(e)}));function C(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(b(s),r===d)return()=>{!function(e){v&&v.unregister(e)}(i),y(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=x(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then(F);return o.then.bind(o)}return C(e,t,[...n,r])},set(o,i,r){b(s);const[a,l]=$(r);return x(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then(F)},apply(o,i,r){b(s);const a=n[n.length-1];if(a===l)return x(e,t,{type:"ENDPOINT"}).then(F);if("bind"===a)return C(e,t,n.slice(0,-1));const[d,c]=M(r);return x(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:d},c).then(F)},construct(o,i){b(s);const[r,a]=M(i);return x(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then(F)}});return function(e,t){const n=(E.get(t)||0)+1;E.set(t,n),v&&v.register(e,t,e)}(i,e),i}function M(e){const t=e.map($);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const D=new WeakMap;function $(e){for(const[t,n]of h)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},D.get(e)||[]]}function F(e){switch(e.type){case"HANDLER":return h.get(e.name).deserialize(e.value);case"RAW":return e.value}}function x(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function A(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let d=[],c=!0,u=0;if(s(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),o=math.slu(e,1,1);let s=math.lusolve(o,n);d=math.squeeze(s).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,n,new Array(n.length).fill(0),{maxIterations:a,tolerance:l});e.converged?o(`Jacobi method converged in ${e.iterations} iterations`):i(`Jacobi method did not converge after ${e.iterations} iterations`),d=e.solutionVector,c=e.converged,u=e.iterations}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s("System solved successfully"),{solutionVector:d,converged:c,iterations:u}}async function w(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;s(`Solving system using ${e}...`),console.time("systemSolving");const d=Array.isArray(t)?t:t?.toArray?.()??t,c=Array.isArray(n)?n:n?.toArray?.()??n;let u,m=null,h=null,f=[],p=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js","undefined"==typeof document&&"undefined"==typeof location?new(require("url").URL)("file:"+__filename).href:"undefined"==typeof document?location.href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.umd.js",document.baseURI).href),{type:"module"}),t=g(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(c.length).fill(0);let t;t=await h.webgpuJacobiSolver(d,c,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,p=t.converged,u=t.iterations,p?o(`Jacobi method converged in ${u} iterations`):i(`Jacobi method did not converge after ${u} iterations`)}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:p,iterations:u}}class N{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],s=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void i("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,s[0]=-1*r(e),s[1]=1*r(e),s[2]=-1*e,s[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function d(e){return 2*e**2-e}function c(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*d(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*d(t),n[6]=d(e)*a(t),n[7]=d(e)*l(t),n[8]=d(e)*d(t),o[0]=c(e)*a(t),o[1]=c(e)*l(t),o[2]=c(e)*d(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*d(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*d(t),s[0]=a(e)*c(t),s[1]=a(e)*u(t),s[2]=a(e)*m(t),s[3]=l(e)*c(t),s[4]=l(e)*u(t),s[5]=l(e)*m(t),s[6]=d(e)*c(t),s[7]=d(e)*u(t),s[8]=d(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:s}}}class O{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=o,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(s("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||i("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,o("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&i("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(o("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const n=t[0],s=t[1];o(`Processing boundary node pair: [${n}, ${s}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const i=this.parsedMesh.nodalNumbering[t];if(4===i.length){if(i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&2===d||2===l&&0===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===d||1===l&&0===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===d||3===l&&1===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===d||3===l&&2===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===i.length&&i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&6===d||6===l&&0===d||0===l&&3===d||3===l&&0===d||3===l&&6===d||6===l&&3===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===d||2===l&&0===d||0===l&&1===d||1===l&&0===d||1===l&&2===d||2===l&&1===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===d||8===l&&2===d||2===l&&5===d||5===l&&2===d||5===l&&8===d||8===l&&5===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===d||8===l&&6===d||6===l&&7===d||7===l&&6===d||7===l&&8===d||8===l&&7===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||i(`Could not find element containing boundary nodes ${n} and ${s}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class V extends O{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||i("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,n;if("linear"===this.elementOrder){t=this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class P extends O{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:s="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:s,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||i("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let n,s,i,r;if("linear"===this.elementOrder){n=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r}}else if("quadratic"===this.elementOrder){n=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i/2,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const o=Math.PI/180,i=Math.tan(this.angleLeft*o),r=Math.tan(this.angleRight*o),a=1e-12;for(let o=0;o<s;o++){const l=t[o],d=Math.abs(i)<a?0:l/i,c=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<n;t++){const i=1===n?0:t/(n-1);e[t*s+o]=d+(c-d)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),o("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:n,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class X{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function S(e){const{meshDimension:t,numElementsX:n,numElementsY:s,maxX:r,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}=e;let m;"1D"===t?m=new V({numElementsX:n,maxX:r,elementOrder:l,parsedMesh:d}):"2D"===t?m=new P({numElementsX:n,maxX:r,numElementsY:s,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}):i("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,E=h.boundaryElements;let v,C;return null!=d?(v=y.length,C=f.length,o(`Using parsed mesh with ${v} elements and ${C} nodes`)):(v=n*("2D"===t?s:1),C=g*("2D"===t?b:1),o(`Using mesh generated from geometry with ${v} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:E,totalElements:v,totalNodes:C,meshDimension:t,elementOrder:l}}function I(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new N({meshDimension:o,elementOrder:s});let l=new X({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function T(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,d=[];for(let e=0;e<i;e++)d[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:d}}function k(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,d=0,c=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],d+=i[r[e]]*t[e],c+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=c*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(c*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:d,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function R(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function Y(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=R(e,t,o),r=R(e,t,s),a=i.inside||r.inside;let l=0,d=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),c=a(o,s),u=a(i,r),m=a(o,i);l=c/(c+u),d=m/(m+a(s,r))}return{inside:a,ksi:l,eta:d}}class B{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,n,s,i,r,a){let l=[],d=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],d[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("convection"===this.boundaryConditions[n][0]){const s=l[n],i=d[n];o(`Boundary ${n}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[n].forEach((([n,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[n][a]-1;o(`  - Applied convection boundary condition to node ${l+1} (element ${n+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((c=>{if("convection"===this.boundaryConditions[c][0]){const u=l[c],m=d[c];o(`Boundary ${c}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[c].forEach((([l,d])=>{if("linear"===this.elementOrder){let c,h,f,p,g;0===d?(c=n[0],h=0,f=0,p=3,g=2):1===d?(c=0,h=n[0],f=0,p=2,g=1):2===d?(c=n[0],h=1,f=1,p=4,g=2):3===d&&(c=1,h=n[0],f=2,p=4,g=1);let b=a.getBasisFunctions(c,h),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[l].length;for(let e=0;e<F;e++){const t=this.nop[l][e]-1;0===d||2===d?(C+=i[t]*E[e],M+=r[t]*E[e]):1!==d&&3!==d||(D+=i[t]*v[e],$+=r[t]*v[e])}let x;x=0===d||2===d?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let n=f;n<p;n+=g){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[0]*x*y[n]*u*m;for(let e=f;e<p;e+=g){let o=this.nop[l][e]-1;t[i][o]+=-s[0]*x*y[n]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let c=0;c<3;c++){let h,f,p,g,b;0===d?(h=n[c],f=0,p=0,g=7,b=3):1===d?(h=0,f=n[c],p=0,g=3,b=1):2===d?(h=n[c],f=1,p=2,g=9,b=3):3===d&&(h=1,f=n[c],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),E=y.basisFunction,v=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,M=0,D=0,$=0,F=0;const x=this.nop[l].length;for(let e=0;e<x;e++){const t=this.nop[l][e]-1;0===d||2===d?(M+=i[t]*v[e],D+=r[t]*v[e]):1!==d&&3!==d||($+=i[t]*C[e],F+=r[t]*C[e])}let A;A=0===d||2===d?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let n=p;n<g;n+=b){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[c]*A*E[n]*u*m;for(let e=p;e<g;e+=b){let o=this.nop[l][e]-1;t[i][o]+=-s[c]*A*E[n]*E[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,n,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const d=this.nop[e].length,c=Array(d).fill().map((()=>Array(d).fill(0))),u=Array(d).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];o(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),o(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,c[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let o,l,m,p,g;0===a?(o=s[0],l=0,m=0,p=3,g=2):1===a?(o=0,l=s[0],m=0,p=2,g=1):2===a?(o=s[0],l=1,m=1,p=4,g=2):3===a&&(o=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(o,l),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta;let C,M=0,D=0,$=0,F=0;for(let o=0;o<d;o++){const s=this.nop[e][o]-1;0===a||2===a?(M+=t[s]*E[o],D+=n[s]*E[o]):1!==a&&3!==a||($+=t[s]*v[o],F+=n[s]*v[o])}C=0===a||2===a?Math.sqrt(M**2+D**2):Math.sqrt($**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let o=0;o<3;o++){let l,d,m,p,g;0===a?(l=s[o],d=0,m=0,p=7,g=3):1===a?(l=0,d=s[o],m=0,p=3,g=1):2===a?(l=s[o],d=1,m=2,p=9,g=3):3===a&&(l=1,d=s[o],m=6,p=9,g=1);let b=r.getBasisFunctions(l,d),y=b.basisFunction,E=b.basisFunctionDerivKsi,v=b.basisFunctionDerivEta,C=0,M=0,D=0,$=0;const F=this.nop[e].length;for(let o=0;o<F;o++){const s=this.nop[e][o]-1;0===a||2===a?(C+=t[s]*E[o],M+=n[s]*E[o]):1!==a&&3!==a||(D+=t[s]*v[o],$+=n[s]*v[o])}let x;x=0===a||2===a?Math.sqrt(C**2+M**2):Math.sqrt(D**2+$**2);for(let e=m;e<p;e+=g){u[e]+=-i[o]*x*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[o]*x*y[e]*y[t]*h}}}}return{localJacobianMatrix:c,localResidualVector:u}}}function q(e,t){s("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:o,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:d}=e,c=I(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=c;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const s=f.getBasisFunctions(p[e],p[t]),i=k({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:o,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new B(t,r,i,l,d);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,o,f),y.imposeConstantTempBoundaryConditions(u,m),s("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function j({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:d,meshDimension:c}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===c)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:d}=T({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(d[t]*d[n])}else if("2D"===c)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=k({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c,nodesXCoordinates:l,nodesYCoordinates:d,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class W{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function G(e,t,n,i){s("Starting front propagation matrix assembly...");let r=1-i+.01;o(`eikonalViscousTerm: ${r}`),o(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:d,boundaryElements:c,totalElements:u,meshDimension:m,elementOrder:h}=e,f=I(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:E,gaussWeights:v,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=d[e][t]-1;for(let e=0;e<E.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(E[e]);const o=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:s,basisFunctionDerivX:i}=o;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=n[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<E.length;t++){let o=y.getBasisFunctions(E[e],E[t]);const s=k({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=s,m=o.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=n[b[e]]*c[e],f+=n[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*v[e]*v[t]*d*c[n]*h+r*v[e]*v[t]*d*u[n]*f,0!==i&&(p[o]+=i*(v[e]*v[t]*d*m[n]*Math.sqrt(h**2+f**2)-v[e]*v[t]*d*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*v[e]*v[t]*d*(c[n]*c[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-d*h*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*c[s]-i*(d*f*m[n]*v[e]*v[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new W(t,c,d,m,h).imposeDirichletBoundaryConditions(p,g),s("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function K({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:d}=s,{nodesXCoordinates:c,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(d).fill().map((()=>Array(d).fill(0))),p=Array(d).fill(0),g=Array(d),b=Array(d);for(let n=0;n<d;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=T({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:c,localToGlobalMap:b,nodesPerElement:d}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<d;e++)l+=i[b[e]]*r[e];for(let e=0;e<d;e++){b[e];for(let e=0;e<d;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:E}=k({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:c,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:d});let v=0,C=0;for(let e=0;e<d;e++)v+=i[b[e]]*y[e],C+=i[b[e]]*E[e];for(let o=0;o<d;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*v+h*l[e]*l[t]*g*E[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(v**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<d;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+E[o]*E[s]),0!==r&&(f[o][s]+=r*(-g*v*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(v**2+C**2+1e-8))*E[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const J={},L={},H={currentElementIndex:0},U={};let _;function z(e,t,n,r={}){const a=I(t),l=t.nodesXCoordinates.length,d=t.totalElements;!function(e,t){J.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),J.nodeConstraintCode=Array(e).fill(0),J.boundaryValues=Array(e).fill(0),J.globalResidualVector=Array(e).fill(0),J.solutionVector=Array(e).fill(0),J.topologyData=Array(t).fill(0),J.lateralData=Array(t).fill(0),L.writeFlag=0,L.totalNodes=e,L.transformationFlag=0,L.nodesPerElement=Array(t).fill(0),L.determinant=1;const n=Math.max(e,2e3);L.globalSolutionVector=Array(n).fill(0),L.frontDataIndex=0,H.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),H.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);U.frontValues=Array(o).fill(0),U.columnHeaders=Array(n).fill(0),U.pivotRow=Array(n).fill(0),U.pivotData=Array(o).fill(0)}(a.nodesPerElement,d),s("Solving system using frontal..."),console.time("systemSolving"),_=new N({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)J.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)J.nodeConstraintCode[e]=0,J.boundaryValues[e]=0;let c;e===j?(c=new B(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantTempBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues)):e===K&&(c=new W(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantValueBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)J.globalResidualVector[e]=0;L.totalNodes=t.nodesXCoordinates.length,L.writeFlag=0,L.transformationFlag=1,L.determinant=1;for(let e=0;e<t.totalElements;e++)L.nodesPerElement[e]=a.nodesPerElement;L.currentSolutionVector=r.solutionVector,L.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,n,s){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,L.globalSolutionVector.length);let d,c=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),E=Array(a).fill(0),v=Array(a).fill(0),C=1;L.writeFlag++;let M=1,D=1;H.currentElementIndex=0;for(let e=0;e<L.totalNodes;e++)y[e]=0,E[e]=0;if(0!==L.transformationFlag){for(let e=0;e<L.totalNodes;e++)v[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<L.nodesPerElement[t];e++){let n=J.nodalNumbering[t][e];0===v[n-1]&&(v[n-1]=1,J.nodalNumbering[t][e]=-J.nodalNumbering[t][e])}}}L.transformationFlag=0;let $=0,F=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,v=0,x=0;if(H.currentElementIndex<r&&(H.currentElementIndex++,a=Q(e,t,n,s)),a){const e=H.currentElementIndex;v=L.nodesPerElement[e-1],x=L.nodesPerElement[e-1];for(let t=0;t<x;t++){let n,o,s=J.nodalNumbering[e-1][t];if(0===$)$++,c[t]=$,U.columnHeaders[$-1]=s;else{for(n=0;n<$&&Math.abs(s)!==Math.abs(U.columnHeaders[n]);n++);n===$?($++,c[t]=$,U.columnHeaders[$-1]=s):(c[t]=n+1,U.columnHeaders[n]=s)}if(0===F)F++,u[t]=F,m[F-1]=s;else{for(o=0;o<F&&Math.abs(s)!==Math.abs(m[o]);o++);o===F?(F++,u[t]=F,m[F-1]=s):(u[t]=o+1,m[o]=s)}}if(F>l||$>l)return void i("Error: systemSize not large enough");for(let e=0;e<x;e++){let t=c[e];for(let n=0;n<v;n++){b[u[n]-1][t-1]+=H.localJacobianMatrix[n][e]}}}let A=0;for(let e=0;e<$;e++)U.columnHeaders[e]<0&&(f[A]=e+1,A++);let w=0,N=0;for(let e=0;e<F;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===J.nodeConstraintCode[n-1]&&(p[w]=e+1,w++,J.nodeConstraintCode[n-1]=2,J.globalResidualVector[n-1]=J.boundaryValues[n-1])}}if(w>0)for(let e=0;e<w;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<$;e++){b[t][e]=0,Math.abs(U.columnHeaders[e])===n&&(b[t][e]=1)}}if(A>D||H.currentElementIndex<r){if(0===A)return void i("Error: no more rows fully summed");let e=h[0],t=f[0],n=b[e-1][t-1];if(Math.abs(n)<1e-4){n=0;for(let o=0;o<A;o++){let s=f[o];for(let o=0;o<N;o++){let i=h[o],r=b[i-1][s-1];Math.abs(r)>Math.abs(n)&&(n=r,t=s,e=i)}}}let s=Math.abs(m[e-1]);d=Math.abs(U.columnHeaders[t-1]);let a=s+d+y[s-1]+E[d-1];L.determinant=L.determinant*n*(-1)**a/Math.abs(n);for(let e=0;e<L.totalNodes;e++)e>=s&&y[e]--,e>=d&&E[e]--;if(Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;for(let t=0;t<$;t++)U.pivotRow[t]=b[e-1][t]/n;let l=J.globalResidualVector[s-1]/n;if(J.globalResidualVector[s-1]=l,g[e-1]=n,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*U.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n][e-1]=b[n][e]-o*U.pivotRow[e];J.globalResidualVector[e-1]-=o*l}if(e<F)for(let n=e;n<F;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*U.pivotRow[e];if(t<$)for(let e=t;e<$;e++)b[n-1][e-1]=b[n][e]-o*U.pivotRow[e];J.globalResidualVector[e-1]-=o*l}for(let e=0;e<F;e++)U.pivotData[M+e-1]=g[e];M+=F;for(let e=0;e<F;e++)U.pivotData[M+e-1]=m[e];M+=F,U.pivotData[M-1]=e,M++;for(let e=0;e<$;e++)U.frontValues[C-1+e]=U.pivotRow[e];C+=$;for(let e=0;e<$;e++)U.frontValues[C-1+e]=U.columnHeaders[e];C+=$,U.frontValues[C-1]=s,U.frontValues[C]=$,U.frontValues[C+1]=t,U.frontValues[C+2]=n,C+=4;for(let e=0;e<F;e++)b[e][$-1]=0;for(let e=0;e<$;e++)b[F-1][e]=0;if($--,t<$+1)for(let e=t-1;e<$;e++)U.columnHeaders[e]=U.columnHeaders[e+1];if(F--,e<F+1)for(let t=e-1;t<F;t++)m[t]=m[t+1];if(F>1||H.currentElementIndex<r)continue;if(d=Math.abs(U.columnHeaders[0]),e=1,n=b[0][0],s=Math.abs(m[0]),t=1,a=s+d+y[s-1]+E[d-1],L.determinant=L.determinant*n*(-1)**a/Math.abs(n),U.pivotRow[0]=1,Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;J.globalResidualVector[s-1]=J.globalResidualVector[s-1]/n,U.frontValues[C-1]=U.pivotRow[0],C++,U.frontValues[C-1]=U.columnHeaders[0],C++,U.frontValues[C-1]=s,U.frontValues[C]=$,U.frontValues[C+1]=t,U.frontValues[C+2]=n,C+=4,U.pivotData[M-1]=g[0],M++,U.pivotData[M-1]=m[0],M++,U.pivotData[M-1]=e,M++,L.frontDataIndex=C,1===L.writeFlag&&o(`total ecs transfer in matrix reduction=${C}`),Z(C);break}}}(t,a,c,e);for(let e=0;e<t.nodesXCoordinates.length;e++)J.solutionVector[e]=L.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?o(`${u[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`):o(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),s("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:J.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function Q(e,t,n,o){const s=H.currentElementIndex-1;if(s<0||s>=e.totalElements)return i(`Skipping out-of-range elementIndex=${s} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:s,nop:J.nodalNumbering,meshData:e,basisFunctions:_,FEAData:t,solutionVector:L.currentSolutionVector,eikonalActivationFlag:L.eikonalActivationFlag});let d=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),c=Array(t.nodesPerElement).fill(0);if(o===j){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===s))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:i}=t,r=n.imposeConvectionBoundaryConditionsFront(s,e.nodesXCoordinates,e.nodesYCoordinates,o,i,_);d=r.localJacobianMatrix,c=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)H.localJacobianMatrix[e][n]=r[e][n]+d[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;J.globalResidualVector[t]+=a[e]+c[e]}return!0}function Z(e){for(let e=0;e<L.totalNodes;e++)L.globalSolutionVector[e]=J.boundaryValues[e];for(let t=1;t<=L.totalNodes;t++){e-=4;let n=U.frontValues[e-1],o=U.frontValues[e],s=U.frontValues[e+1];if(U.frontValues[e+2],1===t)e--,U.columnHeaders[0]=U.frontValues[e-1],e--,U.pivotRow[0]=U.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)U.columnHeaders[t]=U.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)U.pivotRow[t]=U.frontValues[e-1+t]}let i=Math.abs(U.columnHeaders[s-1]);if(J.nodeConstraintCode[i-1]>0)continue;let r=0;U.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=U.pivotRow[e]*L.globalSolutionVector[Math.abs(U.columnHeaders[e])-1];L.globalSolutionVector[i-1]=r+J.globalResidualVector[n-1],J.nodeConstraintCode[i-1]=1}1===L.writeFlag&&o(`value of frontDataCounter after backsubstitution=${e}`)}function ee(e,n={}){let o=0,r=!1,a=0,l=[],d=[],c=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,d[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(d=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<d.length;e++)d[e]=Number(d[e])+Number(l[e]);if("frontal"===n.solverMethod){l=z(K,n.meshData,n.boundaryConditions,{solutionVector:d,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:c,residualVector:u}=e(n.meshData,n.boundaryConditions,d,n.eikonalActivationFlag));l=A(n.solverMethod,c,u).solutionVector}if(o=t(l),s(`Newton-Raphson iteration ${a+1}: Error norm = ${o.toExponential(4)}`),o<=h)r=!0;else if(o>100){i(`Solution not converged. Error norm: ${o}`);break}a++}return{solutionVector:d,converged:r,iterations:a,jacobianMatrix:c,residualVector:u}}class te{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const n=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,o(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];o(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<n;e++)t[s][e]=0;t[s][s]=1,e[s]=0,o("Pinned pressure at first pressure node (p = 0) to remove null space")}}}function ne(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=Y(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:oe(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=Y(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:oe(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function oe(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let d,c=r.getBasisFunctions(s,i).basisFunction;d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function se(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}e.FEAScriptModel=class{constructor(){this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,r("FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE"),s("FEAScriptModel instance created")}setSolverConfig(e,t={}){this.solverConfig=e,r("setSolverConfig() is deprecated. Use setModelConfig() instead"),void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,o("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,o(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,o(`tolerance set to ${this.tolerance}`)),o(`solverConfig set to ${e}`)}setModelConfig(e,t={}){this.setSolverConfig(e,t)}setMeshConfig(e){this.meshConfig=e,o(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,o(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,o(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],n=[],r=[],a=[];s("Preparing mesh...");const l=S(this.meshConfig);s("Mesh preparation completed");const d={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=z(j,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:n}=q(l,this.boundaryConditions));r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let o=0;const s=5,i={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:o,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;o<=1;){i.eikonalActivationFlag=o,r.length>0&&(i.initialSolution=[...r]);const e=ee(G,i);t=e.jacobianMatrix,n=e.residualVector,r=e.solutionVector,o+=1/s}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)i("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:n}=function(e,t,n){s("Starting general form PDE matrix assembly...");const{nodesXCoordinates:o,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,meshDimension:c,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=I(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:E,basisFunctions:v,gaussPoints:C,gaussWeights:M,nodesPerElement:D}=g;if("1D"===c)for(let e=0;e<d;e++){for(let t=0;t<D;t++)E[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=v.getBasisFunctions(C[e]),{detJacobian:s,basisFunctionDerivX:i}=T({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:E,nodesPerElement:D});let r=0;for(let e=0;e<D;e++)r+=o[E[e]]*t[e];const a=m(r),l=h(r),d=f(r),c=p(r);for(let n=0;n<D;n++){const o=E[n];b[o]-=M[e]*s*c*t[n];for(let r=0;r<D;r++){const c=E[r];y[o][c]+=M[e]*s*a*i[n]*i[r],y[o][c]-=M[e]*s*l*i[r]*t[n],y[o][c]-=M[e]*s*d*t[n]*t[r]}}}}else"2D"===c&&i("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new W(t,l,a,c,u).imposeDirichletBoundaryConditions(b,y),s("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){s("Starting creeping flow matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,totalNodes:c,meshDimension:u,elementOrder:m}=e;"2D"!==u&&i("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&i("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=c,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<d;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,E=2*h+y;o(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${E} total DOFs`);let v=[],C=[];for(let e=0;e<E;e++){v[e]=0,C.push([]);for(let t=0;t<E;t++)C[e][t]=0}const M=new N({meshDimension:"2D",elementOrder:"quadratic"}),D=new N({meshDimension:"2D",elementOrder:"linear"});let $=new X({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),F=$.gaussPoints,x=$.gaussWeights;for(let e=0;e<d;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let o=[];for(let t=0;t<4;t++){const n=a[e][f[t]]-1;o[t]=p.get(n)}for(let e=0;e<F.length;e++)for(let s=0;s<F.length;s++){const i=M.getBasisFunctions(F[e],F[s]),a=D.getBasisFunctions(F[e],F[s]),l=k({basisFunction:i.basisFunction,basisFunctionDerivKsi:i.basisFunctionDerivKsi,basisFunctionDerivEta:i.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=l,m=x[e]*x[s]*d;for(let e=0;e<9;e++){let n=t[e],s=n,i=h+n;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(c[e]*c[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let n=2*h+o[t],r=m*a.basisFunction[t]*c[e],l=m*a.basisFunction[t]*u[e];C[s][n]+=r,C[i][n]+=l,C[n][s]+=-r,C[n][i]+=-l}}}}return new te(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(v,C),s("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:v,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,n=a.residualVector;r=A(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:d}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],o=[],r=[];s("Preparing mesh...");const a=S(this.meshConfig);s("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:o}=q(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:s}=await w("jacobi-gpu",n,o,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=s}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}},e.FEAScriptWorker=class{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js","undefined"==typeof document&&"undefined"==typeof location?new(require("url").URL)("file:"+__filename).href:"undefined"==typeof document?location.href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.umd.js",document.baseURI).href),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=g(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}},e.importGmshQuadTri=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const n={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,d=0,c={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},E=null,v=null,C=0,M=0,D=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",v="counts",r++;continue}if("$EndEntities"===e){i="",E=null,v=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const o=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(o[0]),t.ascii="0"===o[1],t.fltBytes=o[2];else if("physicalNames"===i){const e=parseInt(o[0],10),n=parseInt(o[1],10);let s=o.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:n,dimension:e,name:s})}else if("entities"===i)if("counts"===v)E={points:parseInt(o[0],10),curves:parseInt(o[1],10),surfaces:parseInt(o[2],10),volumes:parseInt(o[3],10)},v="points";else if("points"===v)C++,C===E.points&&(v="curves");else if("curves"===v){const e=parseInt(o[0],10),t=parseInt(o[7],10),s=o.slice(8,8+t).map((e=>parseInt(e,10)));n.curves[e]=s,M++,M===E.curves&&(v="surfaces")}else"surfaces"===v&&(D++,D===E.surfaces&&(v="volumes"));else if("nodes"===i){if(0===a)a=parseInt(o[0],10),l=parseInt(o[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(d<a&&0===c.numNodes)c={dim:parseInt(o[0],10),tag:parseInt(o[1],10),parametric:parseInt(o[2],10),numNodes:parseInt(o[3],10)},u=[],m=0,h=0;else if(m<c.numNodes){for(let e of o)if(u.push(parseInt(e,10)),m++,m===c.numNodes)break}else if(h<c.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(o[0]),t.nodesYCoordinates[e]=parseFloat(o[1]),t.totalNodesX++,t.totalNodesY++,h++,h===c.numNodes&&(d++,c={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(o[0],10),parseInt(o[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(o[0],10),tag:parseInt(o[1],10),elementType:parseInt(o[2],10),numElements:parseInt(o[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=o.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=n.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),o(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t},e.logSystem=function(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),n="basic"):(n=e,s(`Log level set to: ${e}`))},e.plotInterpolatedSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=S(e.meshConfig),l=new N({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],d=[],c=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(c*m),f=Math.round(u*m),p=c/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),d[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],d[e]=d[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,d[t]=d[0];for(let e=1;e<f;e++)r[t+e]=r[t],d[t+e]=d[t]+e*g}b=new Array(h*f).fill(null);const y=function(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:d,elementOrder:c}=e;"1D"===d?("linear"===c||"quadratic"===c)&&(t={0:[0],1:[1]}):"2D"===d&&("linear"===c?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===c&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let d=0;d<l[e].length;d++){n[s]=l[e][d],s++;const[c,u]=l[e][d];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[c][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}(a),{nodeNeighbors:E,neighborCount:v}=function(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}(a);let C=0;for(let n=0;n<h*f;n++){if(!se(r[n],d[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<v[i];s++){let c=E[i][s];const u=ne(e,a,t,c,r[n],d[n],l);if(u.inside){C=c,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=ne(e,a,t,s,r[n],d[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let M=Math.min(window.innerWidth,700),D=u/c,$=Math.min(M,600),F=$*D,x={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:$,height:F,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},A={x:r,y:d,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[A],x,{responsive:!0}),console.timeEnd("plottingTime")}},e.plotSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(S(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),d=Math.max(...s),c=Math.min(...i),u=(Math.max(...i)-c)/(d-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}},e.printVersion="0.2.0",Object.defineProperty(e,"__esModule",{value:!0})}));
+   */
+const r=Symbol("Comlink.proxy"),a=Symbol("Comlink.endpoint"),l=Symbol("Comlink.releaseProxy"),d=Symbol("Comlink.finalizer"),c=Symbol("Comlink.thrown"),u=e=>"object"==typeof e&&null!==e||"function"==typeof e,m=new Map([["proxy",{canHandle:e=>u(e)&&e[r],serialize(e){const{port1:t,port2:n}=new MessageChannel;return h(e,t),[n,[n]]},deserialize:e=>(e.start(),p(e))}],["throw",{canHandle:e=>u(e)&&c in e,serialize({value:e}){let t;return t=e instanceof Error?{isError:!0,value:{message:e.message,name:e.name,stack:e.stack}}:{isError:!1,value:e},[t,[]]},deserialize(e){if(e.isError)throw Object.assign(new Error(e.value.message),e.value);throw e.value}}]]);function h(e,t=globalThis,n=["*"]){t.addEventListener("message",(function o(s){if(!s||!s.data)return;if(!function(e,t){for(const n of e){if(t===n||"*"===n)return!0;if(n instanceof RegExp&&n.test(t))return!0}return!1}(n,s.origin))return void console.warn(`Invalid origin '${s.origin}' for comlink proxy`);const{id:i,type:a,path:l}=Object.assign({path:[]},s.data),u=(s.data.argumentList||[]).map(F);let m;try{const t=l.slice(0,-1).reduce(((e,t)=>e[t]),e),n=l.reduce(((e,t)=>e[t]),e);switch(a){case"GET":m=n;break;case"SET":t[l.slice(-1)[0]]=F(s.data.value),m=!0;break;case"APPLY":m=n.apply(t,u);break;case"CONSTRUCT":m=function(e){return Object.assign(e,{[r]:!0})}(new n(...u));break;case"ENDPOINT":{const{port1:t,port2:n}=new MessageChannel;h(e,n),m=function(e,t){return D.set(e,t),e}(t,[t])}break;case"RELEASE":m=void 0;break;default:return}}catch(e){m={value:e,[c]:0}}Promise.resolve(m).catch((e=>({value:e,[c]:0}))).then((n=>{const[s,r]=M(n);t.postMessage(Object.assign(Object.assign({},s),{id:i}),r),"RELEASE"===a&&(t.removeEventListener("message",o),f(t),d in e&&"function"==typeof e[d]&&e[d]())})).catch((e=>{const[n,o]=M({value:new TypeError("Unserializable return value"),[c]:0});t.postMessage(Object.assign(Object.assign({},n),{id:i}),o)}))})),t.start&&t.start()}function f(e){(function(e){return"MessagePort"===e.constructor.name})(e)&&e.close()}function p(e,t){const n=new Map;return e.addEventListener("message",(function(e){const{data:t}=e;if(!t||!t.id)return;const o=n.get(t.id);if(o)try{o(t)}finally{n.delete(t.id)}})),E(e,n,[],t)}function g(e){if(e)throw new Error("Proxy has been released and is not useable")}function b(e){return w(e,new Map,{type:"RELEASE"}).then((()=>{f(e)}))}const y=new WeakMap,v="FinalizationRegistry"in globalThis&&new FinalizationRegistry((e=>{const t=(y.get(e)||0)-1;y.set(e,t),0===t&&b(e)}));function E(e,t,n=[],o=function(){}){let s=!1;const i=new Proxy(o,{get(o,r){if(g(s),r===l)return()=>{!function(e){v&&v.unregister(e)}(i),b(e),t.clear(),s=!0};if("then"===r){if(0===n.length)return{then:()=>i};const o=w(e,t,{type:"GET",path:n.map((e=>e.toString()))}).then(F);return o.then.bind(o)}return E(e,t,[...n,r])},set(o,i,r){g(s);const[a,l]=M(r);return w(e,t,{type:"SET",path:[...n,i].map((e=>e.toString())),value:a},l).then(F)},apply(o,i,r){g(s);const l=n[n.length-1];if(l===a)return w(e,t,{type:"ENDPOINT"}).then(F);if("bind"===l)return E(e,t,n.slice(0,-1));const[d,c]=C(r);return w(e,t,{type:"APPLY",path:n.map((e=>e.toString())),argumentList:d},c).then(F)},construct(o,i){g(s);const[r,a]=C(i);return w(e,t,{type:"CONSTRUCT",path:n.map((e=>e.toString())),argumentList:r},a).then(F)}});return function(e,t){const n=(y.get(t)||0)+1;y.set(t,n),v&&v.register(e,t,e)}(i,e),i}function C(e){const t=e.map(M);return[t.map((e=>e[0])),(n=t.map((e=>e[1])),Array.prototype.concat.apply([],n))];var n}const D=new WeakMap;function M(e){for(const[t,n]of m)if(n.canHandle(e)){const[o,s]=n.serialize(e);return[{type:"HANDLER",name:t,value:o},s]}return[{type:"RAW",value:e},D.get(e)||[]]}function F(e){switch(e.type){case"HANDLER":return m.get(e.name).deserialize(e.value);case"RAW":return e.value}}function w(e,t,n,o){return new Promise((s=>{const i=new Array(4).fill(0).map((()=>Math.floor(Math.random()*Number.MAX_SAFE_INTEGER).toString(16))).join("-");t.set(i,s),e.start&&e.start(),e.postMessage(Object.assign({id:i},n),o)}))}function $(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;let d=[],c=!0,u=0;if(s(`Solving system using ${e}...`),console.time("systemSolving"),"lusolve"===e){const e=math.sparse(t),o=math.slu(e,1,1);let s=math.lusolve(o,n);d=math.squeeze(s).valueOf()}else if("jacobi"===e){const e=function(e,t,n,o={}){const{maxIterations:s,tolerance:i}=o,r=e.length;let a=[...n],l=new Array(r);for(let n=0;n<s;n++){for(let n=0;n<r;n++){let o=0;for(let t=0;t<r;t++)n!==t&&(o+=e[n][t]*a[t]);l[n]=(t[n]-o)/e[n][n]}let o=0;for(let e=0;e<r;e++)o=Math.max(o,Math.abs(l[e]-a[e]));if(a=[...l],o<i)return{solutionVector:a,iterations:n+1,converged:!0}}return{solutionVector:a,iterations:s,converged:!1}}(t,n,new Array(n.length).fill(0),{maxIterations:a,tolerance:l});e.converged?o(`Jacobi method converged in ${e.iterations} iterations`):i(`Jacobi method did not converge after ${e.iterations} iterations`),d=e.solutionVector,c=e.converged,u=e.iterations}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s("System solved successfully"),{solutionVector:d,converged:c,iterations:u}}async function A(e,t,n,r={}){const{maxIterations:a=1e4,tolerance:l=1e-4}=r;s(`Solving system using ${e}...`),console.time("systemSolving");const d=Array.isArray(t)?t:t?.toArray?.()??t,c=Array.isArray(n)?n:n?.toArray?.()??n;let u,m=null,h=null,f=[],g=!0;if("jacobi-gpu"===e){m=await async function(){const e=new Worker(new URL("../workers/webgpuWorkerScript.js","undefined"==typeof document&&"undefined"==typeof location?new(require("url").URL)("file:"+__filename).href:"undefined"==typeof document?location.href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.umd.js",document.baseURI).href),{type:"module"}),t=p(e);return await t.initialize(),{computeEngine:t,worker:e}}(),h=m.computeEngine;const e=new Array(c.length).fill(0);let t;t=await h.webgpuJacobiSolver(d,c,e,{maxIterations:a,tolerance:l}),f=t.solutionVector,g=t.converged,u=t.iterations,g?o(`Jacobi method converged in ${u} iterations`):i(`Jacobi method did not converge after ${u} iterations`)}else i(`Unknown solver method: ${e}`);return console.timeEnd("systemSolving"),s(`System solved successfully (${e})`),m&&(await(h?.destroy?.().catch((()=>{}))),m.worker.terminate()),{solutionVector:f,converged:g,iterations:u}}class x{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getBasisFunctions(e,t=null){let n=[],o=[],s=[];if("1D"===this.meshDimension)"linear"===this.elementOrder?(n[0]=1-e,n[1]=e,o[0]=-1,o[1]=1):"quadratic"===this.elementOrder&&(n[0]=1-3*e+2*e**2,n[1]=4*e-4*e**2,n[2]=2*e**2-e,o[0]=4*e-3,o[1]=4-8*e,o[2]=4*e-1);else if("2D"===this.meshDimension){if(null===t)return void i("Eta coordinate is required for 2D elements");if("linear"===this.elementOrder){function r(e){return 1-e}n[0]=r(e)*r(t),n[1]=r(e)*t,n[2]=e*r(t),n[3]=e*t,o[0]=-1*r(t),o[1]=-1*t,o[2]=1*r(t),o[3]=1*t,s[0]=-1*r(e),s[1]=1*r(e),s[2]=-1*e,s[3]=1*e}else if("quadratic"===this.elementOrder){function a(e){return 2*e**2-3*e+1}function l(e){return-4*e**2+4*e}function d(e){return 2*e**2-e}function c(e){return 4*e-3}function u(e){return-8*e+4}function m(e){return 4*e-1}n[0]=a(e)*a(t),n[1]=a(e)*l(t),n[2]=a(e)*d(t),n[3]=l(e)*a(t),n[4]=l(e)*l(t),n[5]=l(e)*d(t),n[6]=d(e)*a(t),n[7]=d(e)*l(t),n[8]=d(e)*d(t),o[0]=c(e)*a(t),o[1]=c(e)*l(t),o[2]=c(e)*d(t),o[3]=u(e)*a(t),o[4]=u(e)*l(t),o[5]=u(e)*d(t),o[6]=m(e)*a(t),o[7]=m(e)*l(t),o[8]=m(e)*d(t),s[0]=a(e)*c(t),s[1]=a(e)*u(t),s[2]=a(e)*m(t),s[3]=l(e)*c(t),s[4]=l(e)*u(t),s[5]=l(e)*m(t),s[6]=d(e)*c(t),s[7]=d(e)*u(t),s[8]=d(e)*m(t)}}return{basisFunction:n,basisFunctionDerivKsi:o,basisFunctionDerivEta:s}}}class N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,meshDimension:i=null,elementOrder:r="linear",parsedMesh:a=null}){this.numElementsX=e,this.numElementsY=n,this.maxX=t,this.maxY=o,this.meshDimension=i,this.elementOrder=r,this.parsedMesh=a,this.boundaryElementsProcessed=!1,this.parsedMesh&&(s("Using pre-parsed mesh from gmshReader data for mesh generation."),this.parseMeshFromGmsh())}parseMeshFromGmsh(){if(this.parsedMesh.nodalNumbering||i("No valid nodal numbering found in the parsed mesh."),Array.isArray(this.parsedMesh.nodalNumbering))return this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElementsProcessed=!0,this.parsedMesh;if("object"==typeof this.parsedMesh.nodalNumbering&&!Array.isArray(this.parsedMesh.nodalNumbering)){const e=this.parsedMesh.nodalNumbering.quadElements||[];if(this.parsedMesh.nodalNumbering.triangleElements,o("Initial parsed mesh nodal numbering from Gmsh format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.elementTypes[3]||this.parsedMesh.elementTypes[10]){const t=[];for(let n=0;n<e.length;n++){const o=e[n],s=new Array(o.length);4===o.length?(s[0]=o[0],s[1]=o[3],s[2]=o[1],s[3]=o[2]):9===o.length&&(s[0]=o[0],s[1]=o[7],s[2]=o[3],s[3]=o[4],s[4]=o[8],s[5]=o[6],s[6]=o[1],s[7]=o[5],s[8]=o[2]),t.push(s)}this.parsedMesh.nodalNumbering=t}else this.parsedMesh.elementTypes[2]&&i("Element type is neither triangle nor quad; mapping for this type is not implemented yet.");if(o("Nodal numbering after mapping from Gmsh to FEAScript format: "+JSON.stringify(this.parsedMesh.nodalNumbering)),this.parsedMesh.physicalPropMap&&this.parsedMesh.boundaryElements){if(Array.isArray(this.parsedMesh.boundaryElements)&&this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0]){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}if(this.parsedMesh.boundaryNodePairs&&!this.parsedMesh.boundaryElementsProcessed&&(this.parsedMesh.boundaryElements=[],this.parsedMesh.physicalPropMap.forEach((e=>{if(1===e.dimension){const t=this.parsedMesh.boundaryNodePairs[e.tag]||[];t.length>0&&(this.parsedMesh.boundaryElements[e.tag]||(this.parsedMesh.boundaryElements[e.tag]=[]),t.forEach((t=>{const n=t[0],s=t[1];o(`Processing boundary node pair: [${n}, ${s}] for boundary ${e.tag} (${e.name||"unnamed"})`);let r=!1;for(let t=0;t<this.parsedMesh.nodalNumbering.length;t++){const i=this.parsedMesh.nodalNumbering[t];if(4===i.length){if(i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&2===d||2===l&&0===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&1===d||1===l&&0===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):1===l&&3===d||3===l&&1===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(2===l&&3===d||3===l&&2===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}else if(9===i.length&&i.includes(n)&&i.includes(s)){let a;const l=i.indexOf(n),d=i.indexOf(s);o(`  Found element ${t} containing boundary nodes. Element nodes: [${i.join(", ")}]`),o(`  Node ${n} is at index ${l}, Node ${s} is at index ${d} in the element`),0===l&&6===d||6===l&&0===d||0===l&&3===d||3===l&&0===d||3===l&&6===d||6===l&&3===d?(a=0,o(`  These nodes form the BOTTOM side (${a}) of element ${t}`)):0===l&&2===d||2===l&&0===d||0===l&&1===d||1===l&&0===d||1===l&&2===d||2===l&&1===d?(a=1,o(`  These nodes form the LEFT side (${a}) of element ${t}`)):2===l&&8===d||8===l&&2===d||2===l&&5===d||5===l&&2===d||5===l&&8===d||8===l&&5===d?(a=2,o(`  These nodes form the TOP side (${a}) of element ${t}`)):(6===l&&8===d||8===l&&6===d||6===l&&7===d||7===l&&6===d||7===l&&8===d||8===l&&7===d)&&(a=3,o(`  These nodes form the RIGHT side (${a}) of element ${t}`)),this.parsedMesh.boundaryElements[e.tag].push([t,a]),o(`  Added element-side pair [${t}, ${a}] to boundary tag ${e.tag}`),r=!0;break}}r||i(`Could not find element containing boundary nodes ${n} and ${s}. Boundary may be incomplete.`)})))}})),this.boundaryElementsProcessed=!0,this.parsedMesh.boundaryElements.length>0&&void 0===this.parsedMesh.boundaryElements[0])){const e=[];for(let t=1;t<this.parsedMesh.boundaryElements.length;t++)this.parsedMesh.boundaryElements[t]&&e.push(this.parsedMesh.boundaryElements[t]);this.parsedMesh.boundaryElements=e}}}return this.parsedMesh}}class k extends N{constructor({numElementsX:e=null,maxX:t=null,elementOrder:n="linear",parsedMesh:o=null}){super({numElementsX:e,maxX:t,numElementsY:1,maxY:0,meshDimension:"1D",elementOrder:n,parsedMesh:o}),null!==this.numElementsX&&null!==this.maxX||i("numElementsX and maxX are required parameters when generating a 1D mesh from geometry")}generateMesh(){let e=[];let t,n;if("linear"===this.elementOrder){t=this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n}else if("quadratic"===this.elementOrder){t=2*this.numElementsX+1,n=(this.maxX-0)/this.numElementsX,e[0]=0;for(let o=1;o<t;o++)e[o]=e[o-1]+n/2}const s=this.generateNodalNumbering1D(this.numElementsX,t,this.elementOrder),i=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),{nodesXCoordinates:e,totalNodesX:t,nodalNumbering:s,boundaryElements:i}}generateNodalNumbering1D(e,t,n){let o=[];if("linear"===n)for(let t=0;t<e;t++){o[t]=[];for(let e=1;e<=2;e++)o[t][e-1]=t+e}else if("quadratic"===n){let t=0;for(let n=0;n<e;n++){o[n]=[];for(let e=1;e<=3;e++)o[n][e-1]=n+e+t;t+=1}}return o}findBoundaryElements(){const e=[];for(let t=0;t<2;t++)e.push([]);return e[0].push([0,0]),e[1].push([this.numElementsX-1,1]),o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class P extends N{constructor({numElementsX:e=null,maxX:t=null,numElementsY:n=null,maxY:o=null,elementOrder:s="linear",parsedMesh:r=null,angleLeft:a=90,angleRight:l=90}){super({numElementsX:e,maxX:t,numElementsY:n,maxY:o,meshDimension:"2D",elementOrder:s,parsedMesh:r}),this.angleLeft=a,this.angleRight=l,r||null!==this.numElementsX&&null!==this.maxX&&null!==this.numElementsY&&null!==this.maxY||i("numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry")}generateMesh(){let e=[],t=[];let n,s,i,r;if("linear"===this.elementOrder){n=this.numElementsX+1,s=this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r}}else if("quadratic"===this.elementOrder){n=2*this.numElementsX+1,s=2*this.numElementsY+1,i=(this.maxX-0)/this.numElementsX,r=(this.maxY-0)/this.numElementsY,e[0]=0,t[0]=0;for(let n=1;n<s;n++)e[n]=e[0],t[n]=t[0]+n*r/2;for(let o=1;o<n;o++){const n=o*s;e[n]=e[0]+o*i/2,t[n]=t[0];for(let o=1;o<s;o++)e[n+o]=e[n],t[n+o]=t[n]+o*r/2}}if(90!==this.angleLeft||90!==this.angleRight){const o=Math.PI/180,i=Math.tan(this.angleLeft*o),r=Math.tan(this.angleRight*o),a=1e-12;for(let o=0;o<s;o++){const l=t[o],d=Math.abs(i)<a?0:l/i,c=Math.abs(r)<a?this.maxX:this.maxX-l/r;for(let t=0;t<n;t++){const i=1===n?0:t/(n-1);e[t*s+o]=d+(c-d)*i}}}const a=this.generateNodalNumbering2D(this.numElementsX,this.numElementsY,s,this.elementOrder),l=this.findBoundaryElements();return o("Generated node X coordinates: "+JSON.stringify(e)),o("Generated node Y coordinates: "+JSON.stringify(t)),{nodesXCoordinates:e,nodesYCoordinates:t,totalNodesX:n,totalNodesY:s,nodalNumbering:a,boundaryElements:l}}generateNodalNumbering2D(e,t,n,o){let s=0,i=[];if("linear"===o){let n=0,o=2;for(let s=0;s<e*t;s++)n+=1,i[s]=[],i[s][0]=s+o-1,i[s][1]=s+o,i[s][2]=s+o+t,i[s][3]=s+o+t+1,n===t&&(o+=1,n=0)}else if("quadratic"===o)for(let o=1;o<=e;o++)for(let e=1;e<=t;e++){i[s]=[];for(let t=1;t<=3;t++){let r=3*t-2;i[s][r-1]=n*(2*o+t-3)+2*e-1,i[s][r]=i[s][r-1]+1,i[s][r+1]=i[s][r-1]+2}s+=1}return i}findBoundaryElements(){const e=[];for(let t=0;t<4;t++)e.push([]);for(let t=0;t<this.numElementsX;t++)for(let n=0;n<this.numElementsY;n++){const o=t*this.numElementsY+n;0===n&&e[0].push([o,0]),0===t&&e[1].push([o,1]),n===this.numElementsY-1&&e[2].push([o,2]),t===this.numElementsX-1&&e[3].push([o,3])}return o("Identified boundary elements by side: "+JSON.stringify(e)),this.boundaryElementsProcessed=!0,e}}class O{constructor({meshDimension:e,elementOrder:t}){this.meshDimension=e,this.elementOrder=t}getGaussPointsAndWeights(){let e=[],t=[];return"linear"===this.elementOrder?(e[0]=.5,t[0]=1):"quadratic"===this.elementOrder&&(e[0]=(1-Math.sqrt(.6))/2,e[1]=.5,e[2]=(1+Math.sqrt(.6))/2,t[0]=5/18,t[1]=8/18,t[2]=5/18),{gaussPoints:e,gaussWeights:t}}}function S(e){const{meshDimension:t,numElementsX:n,numElementsY:s,maxX:r,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}=e;let m;"1D"===t?m=new k({numElementsX:n,maxX:r,elementOrder:l,parsedMesh:d}):"2D"===t?m=new P({numElementsX:n,maxX:r,numElementsY:s,maxY:a,elementOrder:l,parsedMesh:d,angleLeft:c,angleRight:u}):i("Mesh dimension must be either '1D' or '2D'");const h=m.boundaryElementsProcessed?m.parsedMesh:m.generateMesh();let f=h.nodesXCoordinates,p=h.nodesYCoordinates,g=h.totalNodesX,b=h.totalNodesY,y=h.nodalNumbering,v=h.boundaryElements;let E,C;return null!=d?(E=y.length,C=f.length,o(`Using parsed mesh with ${E} elements and ${C} nodes`)):(E=n*("2D"===t?s:1),C=g*("2D"===t?b:1),o(`Using mesh generated from geometry with ${E} elements and ${C} nodes`)),{nodesXCoordinates:f,nodesYCoordinates:p,totalNodesX:g,totalNodesY:b,nop:y,boundaryElements:v,totalElements:E,totalNodes:C,meshDimension:t,elementOrder:l}}function I(e){const{totalNodes:t,nop:n,meshDimension:o,elementOrder:s}=e;let i=[],r=[];for(let e=0;e<t;e++){i[e]=0,r.push([]);for(let n=0;n<t;n++)r[e][n]=0}const a=new x({meshDimension:o,elementOrder:s});let l=new O({meshDimension:o,elementOrder:s}).getGaussPointsAndWeights();return{residualVector:i,jacobianMatrix:r,localToGlobalMap:[],basisFunctions:a,gaussPoints:l.gaussPoints,gaussWeights:l.gaussWeights,nodesPerElement:n[0].length}}function V(e){const{basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:s,nodesPerElement:i}=e;let r=0,a=0;for(let e=0;e<i;e++)r+=o[s[e]]*t[e],a+=o[s[e]]*n[e];let l=a,d=[];for(let e=0;e<i;e++)d[e]=n[e]/l;return{xCoordinates:r,detJacobian:l,basisFunctionDerivX:d}}function T(e){const{basisFunction:t,basisFunctionDerivKsi:n,basisFunctionDerivEta:o,nodesXCoordinates:s,nodesYCoordinates:i,localToGlobalMap:r,nodesPerElement:a}=e;let l=0,d=0,c=0,u=0,m=0,h=0;for(let e=0;e<a;e++)l+=s[r[e]]*t[e],d+=i[r[e]]*t[e],c+=s[r[e]]*n[e],u+=s[r[e]]*o[e],m+=i[r[e]]*n[e],h+=i[r[e]]*o[e];let f=c*h-u*m,p=[],g=[];for(let e=0;e<a;e++)p[e]=(h*n[e]-m*o[e])/f,g[e]=(c*o[e]-u*n[e])/f;return{xCoordinates:l,yCoordinates:d,detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}}function X(e,t,n){const[o,s,i]=n,r=(s[1]-i[1])*(o[0]-i[0])+(i[0]-s[0])*(o[1]-i[1]),a=((s[1]-i[1])*(e-i[0])+(i[0]-s[0])*(t-i[1]))/r,l=((i[1]-o[1])*(e-i[0])+(o[0]-i[0])*(t-i[1]))/r;return{inside:a>=-1e-12&&l>=-1e-12&&1-a-l>=-1e-12,ksi:a,eta:l}}function R(e,t,n){const[o,s]=function(e){const[t,n,o,s]=e;return[[t,n,s],[t,o,s]]}(n),i=X(e,t,o),r=X(e,t,s),a=i.inside||r.inside;let l=0,d=0;if(a){const[o,s,i,r]=n,a=(n,o)=>Math.abs((o[0]-n[0])*(n[1]-t)-(n[0]-e)*(o[1]-n[1]))/Math.sqrt((o[0]-n[0])**2+(o[1]-n[1])**2),c=a(o,s),u=a(i,r),m=a(o,i);l=c/(c+u),d=m/(m+a(s,r))}return{inside:a,ksi:l,eta:d}}function Y(e){const{nop:t,nodesXCoordinates:n}=e,o=n.length,s=t[0].length,i=Array.from({length:o},(()=>[])),r=Array(o).fill(0);for(let e=0;e<t.length;e++)for(let n=0;n<s;n++){const o=t[e][n]-1;r[o]=r[o]+1,i[o].push(e)}return{nodeNeighbors:i,neighborCount:r}}function j(e){let t,n=[],o=[],s=0;const{nodesXCoordinates:i,nodesYCoordinates:r,nop:a,boundaryElements:l,meshDimension:d,elementOrder:c}=e;"1D"===d?("linear"===c||"quadratic"===c)&&(t={0:[0],1:[1]}):"2D"===d&&("linear"===c?t={0:[0,2],1:[0,1],2:[1,3],3:[2,3]}:"quadratic"===c&&(t={0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]}));for(let e=0;e<l.length;e++)for(let d=0;d<l[e].length;d++){n[s]=l[e][d],s++;const[c,u]=l[e][d];let m=t[u],h=[],f=[];for(let e=0;e<m.length;e++){const t=a[c][m[e]]-1;h.push(i[t]),f.push(r[t])}for(let e=0;e<h.length-1;e++)o.push([[h[e],f[e]],[h[e+1],f[e+1]]])}return o}class B{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeConstantTempBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantTempBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantTemp"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant temperature of ${s} K (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant temperature to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}imposeConvectionBoundaryConditions(e,t,n,s,i,r,a){let l=[],d=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(l[e]=t[1],d[e]=t[2])})),"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("convection"===this.boundaryConditions[n][0]){const s=l[n],i=d[n];o(`Boundary ${n}: Applying convection with heat transfer coefficient h=${s} W/(m²·K) and external temperature T∞=${i} K`),this.boundaryElements[n].forEach((([n,r])=>{let a;"linear"===this.elementOrder?a=0===r?0:1:"quadratic"===this.elementOrder&&(a=0===r?0:2);const l=this.nop[n][a]-1;o(`  - Applied convection boundary condition to node ${l+1} (element ${n+1}, local node ${a+1})`),e[l]+=-s*i,t[l][l]+=s}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((c=>{if("convection"===this.boundaryConditions[c][0]){const u=l[c],m=d[c];o(`Boundary ${c}: Applying convection with heat transfer coefficient h=${u} W/(m²·K) and external temperature T∞=${m} K`),this.boundaryElements[c].forEach((([l,d])=>{if("linear"===this.elementOrder){let c,h,f,p,g;0===d?(c=n[0],h=0,f=0,p=3,g=2):1===d?(c=0,h=n[0],f=0,p=2,g=1):2===d?(c=n[0],h=1,f=1,p=4,g=2):3===d&&(c=1,h=n[0],f=2,p=4,g=1);let b=a.getBasisFunctions(c,h),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const w=this.nop[l].length;for(let e=0;e<w;e++){const t=this.nop[l][e]-1;0===d||2===d?(C+=i[t]*v[e],D+=r[t]*v[e]):1!==d&&3!==d||(M+=i[t]*E[e],F+=r[t]*E[e])}let $;$=0===d||2===d?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let n=f;n<p;n+=g){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[0]*$*y[n]*u*m;for(let e=f;e<p;e+=g){let o=this.nop[l][e]-1;t[i][o]+=-s[0]*$*y[n]*y[e]*u}}}else if("quadratic"===this.elementOrder)for(let c=0;c<3;c++){let h,f,p,g,b;0===d?(h=n[c],f=0,p=0,g=7,b=3):1===d?(h=0,f=n[c],p=0,g=3,b=1):2===d?(h=n[c],f=1,p=2,g=9,b=3):3===d&&(h=1,f=n[c],p=6,g=9,b=1);let y=a.getBasisFunctions(h,f),v=y.basisFunction,E=y.basisFunctionDerivKsi,C=y.basisFunctionDerivEta,D=0,M=0,F=0,w=0;const $=this.nop[l].length;for(let e=0;e<$;e++){const t=this.nop[l][e]-1;0===d||2===d?(D+=i[t]*E[e],M+=r[t]*E[e]):1!==d&&3!==d||(F+=i[t]*C[e],w+=r[t]*C[e])}let A;A=0===d||2===d?Math.sqrt(D**2+M**2):Math.sqrt(F**2+w**2);for(let n=p;n<g;n+=b){let i=this.nop[l][n]-1;o(`  - Applied convection boundary condition to node ${i+1} (element ${l+1}, local node ${n+1})`),e[i]+=-s[c]*A*v[n]*u*m;for(let e=p;e<g;e+=b){let o=this.nop[l][e]-1;t[i][o]+=-s[c]*A*v[n]*v[e]*u}}}}))}}))}imposeConvectionBoundaryConditionsFront(e,t,n,s,i,r){let a=[],l=[];Object.keys(this.boundaryConditions).forEach((e=>{const t=this.boundaryConditions[e];"convection"===t[0]&&(a[e]=t[1],l[e]=t[2])}));const d=this.nop[e].length,c=Array(d).fill().map((()=>Array(d).fill(0))),u=Array(d).fill(0);for(const m in this.boundaryElements)if("convection"===this.boundaryConditions[m]?.[0]){const h=a[m],f=l[m];o(`Boundary ${m}: Applying convection with heat transfer coefficient h=${h} W/(m²·K) and external temperature T∞=${f} K`);const p=this.boundaryElements[m].find((([t,n])=>t===e));if(p){const a=p[1];if("1D"===this.meshDimension){let t;"linear"===this.elementOrder?t=0===a?0:1:"quadratic"===this.elementOrder&&(t=0===a?0:2),o(`  - Applied convection boundary condition to node ${t+1} (element ${e+1}, local node ${t+1})`),u[t]+=-h*f,c[t][t]+=h}else if("2D"===this.meshDimension)if("linear"===this.elementOrder){let o,l,m,p,g;0===a?(o=s[0],l=0,m=0,p=3,g=2):1===a?(o=0,l=s[0],m=0,p=2,g=1):2===a?(o=s[0],l=1,m=1,p=4,g=2):3===a&&(o=1,l=s[0],m=2,p=4,g=1);const b=r.getBasisFunctions(o,l),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta;let C,D=0,M=0,F=0,w=0;for(let o=0;o<d;o++){const s=this.nop[e][o]-1;0===a||2===a?(D+=t[s]*v[o],M+=n[s]*v[o]):1!==a&&3!==a||(F+=t[s]*E[o],w+=n[s]*E[o])}C=0===a||2===a?Math.sqrt(D**2+M**2):Math.sqrt(F**2+w**2);for(let e=m;e<p;e+=g){u[e]+=-i[0]*C*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[0]*C*y[e]*y[t]*h}}else if("quadratic"===this.elementOrder)for(let o=0;o<3;o++){let l,d,m,p,g;0===a?(l=s[o],d=0,m=0,p=7,g=3):1===a?(l=0,d=s[o],m=0,p=3,g=1):2===a?(l=s[o],d=1,m=2,p=9,g=3):3===a&&(l=1,d=s[o],m=6,p=9,g=1);let b=r.getBasisFunctions(l,d),y=b.basisFunction,v=b.basisFunctionDerivKsi,E=b.basisFunctionDerivEta,C=0,D=0,M=0,F=0;const w=this.nop[e].length;for(let o=0;o<w;o++){const s=this.nop[e][o]-1;0===a||2===a?(C+=t[s]*v[o],D+=n[s]*v[o]):1!==a&&3!==a||(M+=t[s]*E[o],F+=n[s]*E[o])}let $;$=0===a||2===a?Math.sqrt(C**2+D**2):Math.sqrt(M**2+F**2);for(let e=m;e<p;e+=g){u[e]+=-i[o]*$*y[e]*h*f;for(let t=m;t<p;t+=g)c[e][t]+=-i[o]*$*y[e]*y[t]*h}}}}return{localJacobianMatrix:c,localResidualVector:u}}}function q(e,t){s("Starting solid heat transfer matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:o,nop:i,boundaryElements:r,totalElements:a,meshDimension:l,elementOrder:d}=e,c=I(e),{residualVector:u,jacobianMatrix:m,localToGlobalMap:h,basisFunctions:f,gaussPoints:p,gaussWeights:g,nodesPerElement:b}=c;for(let e=0;e<a;e++){for(let t=0;t<b;t++)h[t]=i[e][t]-1;for(let e=0;e<p.length;e++)if("1D"===l){const t=f.getBasisFunctions(p[e]),o=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:n,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:s,basisFunctionDerivX:i}=o;for(let t=0;t<b;t++){let n=h[t];for(let o=0;o<b;o++){let r=h[o];m[n][r]+=-g[e]*s*(i[t]*i[o])}}}else if("2D"===l)for(let t=0;t<p.length;t++){const s=f.getBasisFunctions(p[e],p[t]),i=T({basisFunction:s.basisFunction,basisFunctionDerivKsi:s.basisFunctionDerivKsi,basisFunctionDerivEta:s.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:o,localToGlobalMap:h,nodesPerElement:b}),{detJacobian:r,basisFunctionDerivX:a,basisFunctionDerivY:l}=i;for(let n=0;n<b;n++){let o=h[n];for(let s=0;s<b;s++){let i=h[s];m[o][i]+=-g[e]*g[t]*r*(a[n]*a[s]+l[n]*l[s])}}}}const y=new B(t,r,i,l,d);return y.imposeConvectionBoundaryConditions(u,m,p,g,n,o,f),y.imposeConstantTempBoundaryConditions(u,m),s("Solid heat transfer matrix assembly completed"),{jacobianMatrix:m,residualVector:u}}function W({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s}){const{gaussPoints:i,gaussWeights:r,nodesPerElement:a}=s,{nodesXCoordinates:l,nodesYCoordinates:d,meshDimension:c}=n,u=Array(a).fill().map((()=>Array(a).fill(0))),m=Array(a).fill(0),h=Array(a),f=Array(a);for(let n=0;n<a;n++)h[n]=Math.abs(t[e][n]),f[n]=Math.abs(t[e][n])-1;if("1D"===c)for(let e=0;e<i.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=o.getBasisFunctions(i[e]),{detJacobian:s,basisFunctionDerivX:d}=V({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:l,localToGlobalMap:f,nodesPerElement:a});for(let t=0;t<a;t++)for(let n=0;n<a;n++)u[t][n]-=r[e]*s*(d[t]*d[n])}else if("2D"===c)for(let e=0;e<i.length;e++)for(let t=0;t<i.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c}=o.getBasisFunctions(i[e],i[t]),m=h.map((e=>e-1)),{detJacobian:f,basisFunctionDerivX:p,basisFunctionDerivY:g}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:c,nodesXCoordinates:l,nodesYCoordinates:d,localToGlobalMap:m,nodesPerElement:a});for(let n=0;n<a;n++)for(let o=0;o<a;o++)u[n][o]-=r[e]*r[t]*f*(p[n]*p[o]+g[n]*g[o])}return{localJacobianMatrix:u,localResidualVector:m,ngl:h}}class G{constructor(e,t,n,o,s){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s}imposeDirichletBoundaryConditions(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0],1:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=s;for(let n=0;n<e.length;n++)t[r][n]=0;t[r][r]=1}))}}))}}))}imposeConstantValueBoundaryConditionsFront(e,t){"1D"===this.meshDimension?Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0],1:[1]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0],2:[2]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}})):"2D"===this.meshDimension&&Object.keys(this.boundaryConditions).forEach((n=>{if("constantValue"===this.boundaryConditions[n][0]){const s=this.boundaryConditions[n][1];o(`Boundary ${n}: Applying constant value of ${s} (Dirichlet condition)`),this.boundaryElements[n].forEach((([n,i])=>{if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}else if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[i].forEach((i=>{const r=this.nop[n][i]-1;o(`  - Applied constant value to node ${r+1} (element ${n+1}, local node ${i+1})`),e[r]=1,t[r]=s}))}}))}}))}}function L(e,t,n,i){s("Starting front propagation matrix assembly...");let r=1-i+.01;o(`eikonalViscousTerm: ${r}`),o(`eikonalActivationFlag: ${i}`);const{nodesXCoordinates:a,nodesYCoordinates:l,nop:d,boundaryElements:c,totalElements:u,meshDimension:m,elementOrder:h}=e,f=I(e),{residualVector:p,jacobianMatrix:g,localToGlobalMap:b,basisFunctions:y,gaussPoints:v,gaussWeights:E,nodesPerElement:C}=f;for(let e=0;e<u;e++){for(let t=0;t<C;t++)b[t]=d[e][t]-1;for(let e=0;e<v.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=y.getBasisFunctions(v[e]);const o=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:a,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:s,basisFunctionDerivX:i}=o;t.basisFunction;let r=0;for(let e=0;e<C;e++)r+=n[b[e]]*i[e];for(let e=0;e<C;e++){b[e];for(let e=0;e<C;e++)b[e]}}else if("2D"===m)for(let t=0;t<v.length;t++){let o=y.getBasisFunctions(v[e],v[t]);const s=T({basisFunction:o.basisFunction,basisFunctionDerivKsi:o.basisFunctionDerivKsi,basisFunctionDerivEta:o.basisFunctionDerivEta,nodesXCoordinates:a,nodesYCoordinates:l,localToGlobalMap:b,nodesPerElement:C}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=s,m=o.basisFunction;let h=0,f=0;for(let e=0;e<C;e++)h+=n[b[e]]*c[e],f+=n[b[e]]*u[e];for(let n=0;n<C;n++){let o=b[n];p[o]+=r*E[e]*E[t]*d*c[n]*h+r*E[e]*E[t]*d*u[n]*f,0!==i&&(p[o]+=i*(E[e]*E[t]*d*m[n]*Math.sqrt(h**2+f**2)-E[e]*E[t]*d*m[n]));for(let s=0;s<C;s++){let a=b[s];g[o][a]+=-r*E[e]*E[t]*d*(c[n]*c[s]+u[n]*u[s]),0!==i&&(g[o][a]+=i*(-d*h*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*c[s]-i*(d*f*m[n]*E[e]*E[t]/Math.sqrt(h**2+f**2+1e-8))*u[s])}}}}return new G(t,c,d,m,h).imposeDirichletBoundaryConditions(p,g),s("Front propagation matrix assembly completed"),{jacobianMatrix:g,residualVector:p}}function K({elementIndex:e,nop:t,meshData:n,basisFunctions:o,FEAData:s,solutionVector:i,eikonalActivationFlag:r}){const{gaussPoints:a,gaussWeights:l,nodesPerElement:d}=s,{nodesXCoordinates:c,nodesYCoordinates:u,meshDimension:m}=n;let h=1-r+.01;const f=Array(d).fill().map((()=>Array(d).fill(0))),p=Array(d).fill(0),g=Array(d),b=Array(d);for(let n=0;n<d;n++)g[n]=Math.abs(t[e][n]),b[n]=Math.abs(t[e][n])-1;for(let e=0;e<a.length;e++)if("1D"===m){errorLog("1D front propagation is not yet supported");let t=o.getBasisFunctions(a[e]);const n=V({basisFunction:t.basisFunction,basisFunctionDerivKsi:t.basisFunctionDerivKsi,nodesXCoordinates:c,localToGlobalMap:b,nodesPerElement:d}),{detJacobian:s,basisFunctionDerivX:r}=n;t.basisFunction;let l=0;for(let e=0;e<d;e++)l+=i[b[e]]*r[e];for(let e=0;e<d;e++){b[e];for(let e=0;e<d;e++)b[e]}}else if("2D"===m)for(let t=0;t<a.length;t++){const{basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m}=o.getBasisFunctions(a[e],a[t]),{detJacobian:g,basisFunctionDerivX:y,basisFunctionDerivY:v}=T({basisFunction:n,basisFunctionDerivKsi:s,basisFunctionDerivEta:m,nodesXCoordinates:c,nodesYCoordinates:u,localToGlobalMap:b,nodesPerElement:d});let E=0,C=0;for(let e=0;e<d;e++)E+=i[b[e]]*y[e],C+=i[b[e]]*v[e];for(let o=0;o<d;o++){b[o],p[o]+=h*l[e]*l[t]*g*y[o]*E+h*l[e]*l[t]*g*v[o]*C,0!==r&&(p[o]+=r*(l[e]*l[t]*g*n[o]*Math.sqrt(E**2+C**2)-l[e]*l[t]*g*n[o]));for(let s=0;s<d;s++)f[o][s]-=h*l[e]*l[t]*g*(y[o]*y[s]+v[o]*v[s]),0!==r&&(f[o][s]+=r*(-g*E*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*y[s]-r*(g*C*n[o]*l[e]*l[t]/Math.sqrt(E**2+C**2+1e-8))*v[s])}}return{localJacobianMatrix:f,localResidualVector:p,ngl:g}}const J={},U={},H={currentElementIndex:0},_={};let z;function Q(e,t,n,r={}){const a=I(t),l=t.nodesXCoordinates.length,d=t.totalElements;!function(e,t){J.nodalNumbering=Array(t).fill().map((()=>Array(e).fill(0))),J.nodeConstraintCode=Array(e).fill(0),J.boundaryValues=Array(e).fill(0),J.globalResidualVector=Array(e).fill(0),J.solutionVector=Array(e).fill(0),J.topologyData=Array(t).fill(0),J.lateralData=Array(t).fill(0),U.writeFlag=0,U.totalNodes=e,U.transformationFlag=0,U.nodesPerElement=Array(t).fill(0),U.determinant=1;const n=Math.max(e,2e3);U.globalSolutionVector=Array(n).fill(0),U.frontDataIndex=0,H.localJacobianMatrix=Array(e).fill().map((()=>Array(e).fill(0))),H.currentElementIndex=0;const o=function(e,t){const n=Math.max(Math.ceil(Math.sqrt(t))*e,2*e);return n*t}(e,t);_.frontValues=Array(o).fill(0),_.columnHeaders=Array(n).fill(0),_.pivotRow=Array(n).fill(0),_.pivotData=Array(o).fill(0)}(a.nodesPerElement,d),s("Solving system using frontal..."),console.time("systemSolving"),z=new x({meshDimension:t.meshDimension,elementOrder:t.elementOrder});for(let e=0;e<t.totalElements;e++)for(let n=0;n<a.nodesPerElement;n++)J.nodalNumbering[e][n]=t.nop[e][n];for(let e=0;e<t.nodesXCoordinates.length;e++)J.nodeConstraintCode[e]=0,J.boundaryValues[e]=0;let c;e===W?(c=new B(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantTempBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues)):e===K&&(c=new G(n,t.boundaryElements,t.nop,t.meshDimension,t.elementOrder),c.imposeConstantValueBoundaryConditionsFront(J.nodeConstraintCode,J.boundaryValues));for(let e=0;e<t.nodesXCoordinates.length;e++)J.globalResidualVector[e]=0;U.totalNodes=t.nodesXCoordinates.length,U.writeFlag=0,U.transformationFlag=1,U.determinant=1;for(let e=0;e<t.totalElements;e++)U.nodesPerElement[e]=a.nodesPerElement;U.currentSolutionVector=r.solutionVector,U.eikonalActivationFlag=r.eikonalActivationFlag,function(e,t,n,s){const r=e.totalElements,a=e.nodesXCoordinates.length,l=Math.max(a,U.globalSolutionVector.length);let d,c=Array(t.nodesPerElement).fill(0),u=Array(t.nodesPerElement).fill(0),m=Array(l).fill(0),h=Array(l).fill(0),f=Array(l).fill(0),p=Array(l).fill(0),g=Array(l).fill(0),b=Array(l).fill().map((()=>Array(l).fill(0))),y=Array(a).fill(0),v=Array(a).fill(0),E=Array(a).fill(0),C=1;U.writeFlag++;let D=1,M=1;H.currentElementIndex=0;for(let e=0;e<U.totalNodes;e++)y[e]=0,v[e]=0;if(0!==U.transformationFlag){for(let e=0;e<U.totalNodes;e++)E[e]=0;for(let e=0;e<r;e++){let t=r-e-1;for(let e=0;e<U.nodesPerElement[t];e++){let n=J.nodalNumbering[t][e];0===E[n-1]&&(E[n-1]=1,J.nodalNumbering[t][e]=-J.nodalNumbering[t][e])}}}U.transformationFlag=0;let F=0,w=0;for(let e=0;e<l;e++)for(let t=0;t<l;t++)b[t][e]=0;for(;;){let a=!1,E=0,$=0;if(H.currentElementIndex<r&&(H.currentElementIndex++,a=Z(e,t,n,s)),a){const e=H.currentElementIndex;E=U.nodesPerElement[e-1],$=U.nodesPerElement[e-1];for(let t=0;t<$;t++){let n,o,s=J.nodalNumbering[e-1][t];if(0===F)F++,c[t]=F,_.columnHeaders[F-1]=s;else{for(n=0;n<F&&Math.abs(s)!==Math.abs(_.columnHeaders[n]);n++);n===F?(F++,c[t]=F,_.columnHeaders[F-1]=s):(c[t]=n+1,_.columnHeaders[n]=s)}if(0===w)w++,u[t]=w,m[w-1]=s;else{for(o=0;o<w&&Math.abs(s)!==Math.abs(m[o]);o++);o===w?(w++,u[t]=w,m[w-1]=s):(u[t]=o+1,m[o]=s)}}if(w>l||F>l)return void i("Error: systemSize not large enough");for(let e=0;e<$;e++){let t=c[e];for(let n=0;n<E;n++){b[u[n]-1][t-1]+=H.localJacobianMatrix[n][e]}}}let A=0;for(let e=0;e<F;e++)_.columnHeaders[e]<0&&(f[A]=e+1,A++);let x=0,N=0;for(let e=0;e<w;e++){let t=m[e];if(t<0){h[N]=e+1,N++;let n=Math.abs(t);1===J.nodeConstraintCode[n-1]&&(p[x]=e+1,x++,J.nodeConstraintCode[n-1]=2,J.globalResidualVector[n-1]=J.boundaryValues[n-1])}}if(x>0)for(let e=0;e<x;e++){let t=p[e]-1,n=Math.abs(m[t]);for(let e=0;e<F;e++){b[t][e]=0,Math.abs(_.columnHeaders[e])===n&&(b[t][e]=1)}}if(A>M||H.currentElementIndex<r){if(0===A)return void i("Error: no more rows fully summed");let e=h[0],t=f[0],n=b[e-1][t-1];if(Math.abs(n)<1e-4){n=0;for(let o=0;o<A;o++){let s=f[o];for(let o=0;o<N;o++){let i=h[o],r=b[i-1][s-1];Math.abs(r)>Math.abs(n)&&(n=r,t=s,e=i)}}}let s=Math.abs(m[e-1]);d=Math.abs(_.columnHeaders[t-1]);let a=s+d+y[s-1]+v[d-1];U.determinant=U.determinant*n*(-1)**a/Math.abs(n);for(let e=0;e<U.totalNodes;e++)e>=s&&y[e]--,e>=d&&v[e]--;if(Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;for(let t=0;t<F;t++)_.pivotRow[t]=b[e-1][t]/n;let l=J.globalResidualVector[s-1]/n;if(J.globalResidualVector[s-1]=l,g[e-1]=n,e>1)for(let n=0;n<e-1;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1&&0!==o)for(let e=0;e<t-1;e++)b[n][e]-=o*_.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n][e-1]=b[n][e]-o*_.pivotRow[e];J.globalResidualVector[e-1]-=o*l}if(e<w)for(let n=e;n<w;n++){let e=Math.abs(m[n]),o=b[n][t-1];if(g[n]=o,t>1)for(let e=0;e<t-1;e++)b[n-1][e]=b[n][e]-o*_.pivotRow[e];if(t<F)for(let e=t;e<F;e++)b[n-1][e-1]=b[n][e]-o*_.pivotRow[e];J.globalResidualVector[e-1]-=o*l}for(let e=0;e<w;e++)_.pivotData[D+e-1]=g[e];D+=w;for(let e=0;e<w;e++)_.pivotData[D+e-1]=m[e];D+=w,_.pivotData[D-1]=e,D++;for(let e=0;e<F;e++)_.frontValues[C-1+e]=_.pivotRow[e];C+=F;for(let e=0;e<F;e++)_.frontValues[C-1+e]=_.columnHeaders[e];C+=F,_.frontValues[C-1]=s,_.frontValues[C]=F,_.frontValues[C+1]=t,_.frontValues[C+2]=n,C+=4;for(let e=0;e<w;e++)b[e][F-1]=0;for(let e=0;e<F;e++)b[w-1][e]=0;if(F--,t<F+1)for(let e=t-1;e<F;e++)_.columnHeaders[e]=_.columnHeaders[e+1];if(w--,e<w+1)for(let t=e-1;t<w;t++)m[t]=m[t+1];if(w>1||H.currentElementIndex<r)continue;if(d=Math.abs(_.columnHeaders[0]),e=1,n=b[0][0],s=Math.abs(m[0]),t=1,a=s+d+y[s-1]+v[d-1],U.determinant=U.determinant*n*(-1)**a/Math.abs(n),_.pivotRow[0]=1,Math.abs(n)<1e-10&&i(`Matrix singular or ill-conditioned, currentElementIndex=${H.currentElementIndex}, pivotGlobalRowIndex=${s}, pivotColumnGlobalIndex=${d}, pivotValue=${n}`),0===n)return;J.globalResidualVector[s-1]=J.globalResidualVector[s-1]/n,_.frontValues[C-1]=_.pivotRow[0],C++,_.frontValues[C-1]=_.columnHeaders[0],C++,_.frontValues[C-1]=s,_.frontValues[C]=F,_.frontValues[C+1]=t,_.frontValues[C+2]=n,C+=4,_.pivotData[D-1]=g[0],D++,_.pivotData[D-1]=m[0],D++,_.pivotData[D-1]=e,D++,U.frontDataIndex=C,1===U.writeFlag&&o(`total ecs transfer in matrix reduction=${C}`),ee(C);break}}}(t,a,c,e);for(let e=0;e<t.nodesXCoordinates.length;e++)J.solutionVector[e]=U.globalSolutionVector[e];const{nodesXCoordinates:u,nodesYCoordinates:m}=t;for(let e=0;e<t.nodesXCoordinates.length;e++)"1D"===t.meshDimension?o(`${u[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`):o(`${u[e].toExponential(5)}  ${m[e].toExponential(5)}  ${J.solutionVector[e].toExponential(5)}`);console.timeEnd("systemSolving"),s("System solved successfully");const{nodesXCoordinates:h,nodesYCoordinates:f}=t;return{solutionVector:J.solutionVector.slice(0,l),nodesCoordinates:{nodesXCoordinates:h,nodesYCoordinates:f}}}function Z(e,t,n,o){const s=H.currentElementIndex-1;if(s<0||s>=e.totalElements)return i(`Skipping out-of-range elementIndex=${s} (totalElements=${e.totalElements})`),!1;const{localJacobianMatrix:r,localResidualVector:a,ngl:l}=o({elementIndex:s,nop:J.nodalNumbering,meshData:e,basisFunctions:z,FEAData:t,solutionVector:U.currentSolutionVector,eikonalActivationFlag:U.eikonalActivationFlag});let d=Array(t.nodesPerElement).fill().map((()=>Array(t.nodesPerElement).fill(0))),c=Array(t.nodesPerElement).fill(0);if(o===W){let o=!1;for(const t in e.boundaryElements)if("convection"===n.boundaryConditions[t]?.[0]&&e.boundaryElements[t].some((([e,t])=>e===s))){o=!0;break}if(o){const{gaussPoints:o,gaussWeights:i}=t,r=n.imposeConvectionBoundaryConditionsFront(s,e.nodesXCoordinates,e.nodesYCoordinates,o,i,z);d=r.localJacobianMatrix,c=r.localResidualVector}}for(let e=0;e<t.nodesPerElement;e++)for(let n=0;n<t.nodesPerElement;n++)H.localJacobianMatrix[e][n]=r[e][n]+d[e][n];for(let e=0;e<t.nodesPerElement;e++){const t=l[e]-1;J.globalResidualVector[t]+=a[e]+c[e]}return!0}function ee(e){for(let e=0;e<U.totalNodes;e++)U.globalSolutionVector[e]=J.boundaryValues[e];for(let t=1;t<=U.totalNodes;t++){e-=4;let n=_.frontValues[e-1],o=_.frontValues[e],s=_.frontValues[e+1];if(_.frontValues[e+2],1===t)e--,_.columnHeaders[0]=_.frontValues[e-1],e--,_.pivotRow[0]=_.frontValues[e-1];else{e-=o;for(let t=0;t<o;t++)_.columnHeaders[t]=_.frontValues[e-1+t];e-=o;for(let t=0;t<o;t++)_.pivotRow[t]=_.frontValues[e-1+t]}let i=Math.abs(_.columnHeaders[s-1]);if(J.nodeConstraintCode[i-1]>0)continue;let r=0;_.pivotRow[s-1]=0;for(let e=0;e<o;e++)r-=_.pivotRow[e]*U.globalSolutionVector[Math.abs(_.columnHeaders[e])-1];U.globalSolutionVector[i-1]=r+J.globalResidualVector[n-1],J.nodeConstraintCode[i-1]=1}1===U.writeFlag&&o(`value of frontDataCounter after backsubstitution=${e}`)}function te(e,n={}){let o=0,r=!1,a=0,l=[],d=[],c=[],u=[];const{maxIterations:m=100,tolerance:h=1e-4}=n;let f=n.meshData.nodesXCoordinates.length;for(let e=0;e<f;e++)l[e]=0,d[e]=0;for(n.initialSolution&&n.initialSolution.length===f&&(d=[...n.initialSolution]);a<m&&!r;){for(let e=0;e<d.length;e++)d[e]=Number(d[e])+Number(l[e]);if("frontal"===n.solverMethod){l=Q(K,n.meshData,n.boundaryConditions,{solutionVector:d,eikonalActivationFlag:n.eikonalActivationFlag}).solutionVector}else{({jacobianMatrix:c,residualVector:u}=e(n.meshData,n.boundaryConditions,d,n.eikonalActivationFlag));l=$(n.solverMethod,c,u).solutionVector}if(o=t(l),s(`Newton-Raphson iteration ${a+1}: Error norm = ${o.toExponential(4)}`),o<=h)r=!0;else if(o>100){i(`Solution not converged. Error norm: ${o}`);break}a++}return{solutionVector:d,converged:r,iterations:a,jacobianMatrix:c,residualVector:u}}class ne{constructor(e,t,n,o,s,i,r,a){this.boundaryConditions=e,this.boundaryElements=t,this.nop=n,this.meshDimension=o,this.elementOrder=s,this.totalNodesVelocity=i,this.totalNodesPressure=r,this.q2ToPressureMap=a}imposeDirichletBoundaryConditions(e,t){const n=e.length;let s=!1;if("2D"===this.meshDimension&&(Object.keys(this.boundaryConditions).forEach((i=>{const r=this.boundaryConditions[i][0];if("stressFree"===r)s=!0,o(`Boundary ${i}: Applying stress-free condition (natural BC)`);else if("constantVelocity"===r){const s=this.boundaryConditions[i][1],r=this.boundaryConditions[i][2];o(`Boundary ${i}: Applying constant velocity condition (u=${s}, v=${r})`),this.boundaryElements[i].forEach((([i,a])=>{if("quadratic"===this.elementOrder){({0:[0,3,6],1:[0,1,2],2:[2,5,8],3:[6,7,8]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}else if("linear"===this.elementOrder){({0:[0,2],1:[0,1],2:[1,3],3:[2,3]})[a].forEach((a=>{const l=this.nop[i][a]-1,d=l,c=this.totalNodesVelocity+l;o(`  - Applied velocity Dirichlet to node ${l+1} (element ${i+1}, local node ${a+1})`),e[d]=s;for(let e=0;e<n;e++)t[d][e]=0;t[d][d]=1,e[c]=r;for(let e=0;e<n;e++)t[c][e]=0;t[c][c]=1}))}}))}})),!s)){const s=2*this.totalNodesVelocity;for(let e=0;e<n;e++)t[s][e]=0;t[s][s]=1,e[s]=0,o("Pinned pressure at first pressure node (p = 0) to remove null space")}}}function oe(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:se(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:se(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function se(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length;let d,c=r.getBasisFunctions(s,i).basisFunction;d=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=d[t.nop[o][e]-1]*c[e];return u}function ie(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}let re=null;async function ae(){if(re)return re;await import("@kitware/vtk.js/Rendering/Profiles/Geometry.js");const[{default:e},{default:t},{default:n},{default:o},{default:s},{default:i},{default:r},{default:a},{default:l},{default:d}]=await Promise.all([import("@kitware/vtk.js/Rendering/Core/Actor.js"),import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js"),import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js"),import("@kitware/vtk.js/Common/Core/DataArray.js"),import("@kitware/vtk.js/Common/DataModel/ImageData.js"),import("@kitware/vtk.js/Filters/General/ImageMarchingSquares.js"),import("@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js"),import("@kitware/vtk.js/Rendering/Core/Mapper.js"),import("@kitware/vtk.js/Common/DataModel/PolyData.js"),import("@kitware/vtk.js/Rendering/Core/ScalarBarActor.js")]);return re={vtkActor:e,vtkColorTransferFunction:t,vtkColorMaps:n,vtkDataArray:o,vtkImageData:s,vtkImageMarchingSquares:i,vtkGenericRenderWindow:r,vtkMapper:a,vtkPolyData:l,vtkScalarBarActor:d},re}const le=new Map;function de(e={}){return{presetName:e.presetName??"Cool to Warm",reverse:e.reverse??!1,showScalarBar:e.showScalarBar??!0,scalarBarTitle:e.scalarBarTitle??"Solution"}}function ce(e={}){return{enabled:e.enabled??!0,numberOfContours:e.numberOfContours??12,color:e.color??[.15,.15,.15],lineWidth:e.lineWidth??1}}async function ue(e,t,n=null,o={}){const s=n??S(e.meshConfig),{nodesXCoordinates:i,nodesYCoordinates:r}=t.nodesCoordinates,a=pe(t.solutionVector,i.length),l=fe(i,r),d=o.mode??"surface",c="line"===d?function(e){if(e<2)return new Uint32Array(0);const t=new Uint32Array(3*(e-1));let n=0;for(let o=0;o<e-1;o++)t[n++]=2,t[n++]=o,t[n++]=o+1;return t}(i.length):function(e){const t=[];for(let n=0;n<e.length;n++){const o=ge(e[n]);t.push(o.length,...o)}return Uint32Array.from(t)}(s.nop??[]);return{points:l,scalars:a,cells:c,polyData:await he(l,a,c,d),mode:d,metadata:{solverConfig:e.solverConfig,meshDimension:e.meshConfig.meshDimension,numberOfPoints:l.length/3,numberOfCells:be(c)}}}async function me(e,t,n,o,s={}){if("undefined"==typeof document)return void i("vtk.js visualization requires a browser environment");const{vtkActor:r,vtkColorTransferFunction:a,vtkColorMaps:l,vtkGenericRenderWindow:d,vtkMapper:c,vtkScalarBarActor:u}=await ae(),m=document.getElementById(t);if(!m)return void i(`Could not find plot container with id: ${t}`);le.has(t)&&(le.get(t).delete(),le.delete(t)),m.innerHTML="",m.style.position="relative",m.style.width=m.style.width||"100%",m.style.height=m.style.height||"420px";const h=d.newInstance({background:[1,1,1]});h.setContainer(m),h.resize();const f=h.getRenderer(),p=h.getRenderWindow(),g=c.newInstance();g.setInputData(e.polyData),g.setScalarModeToUsePointData(),g.setColorModeToMapScalars(),g.setScalarVisibility(!0);const b=function(e){if(!e?.length)return[0,1];let t=Number.POSITIVE_INFINITY,n=Number.NEGATIVE_INFINITY;for(let o=0;o<e.length;o++){const s=e[o];Number.isFinite(s)&&(s<t&&(t=s),s>n&&(n=s))}return Number.isFinite(t)&&Number.isFinite(n)?t===n?[t-1,n+1]:[t,n]:[0,1]}(e.scalars);g.setScalarRange(b[0],b[1]);const y=s.colorScale??de({}),v=a.newInstance(),E=function(e,t){if(!t||!e?.RGBPoints?.length)return e;const n=e.RGBPoints,o=n[0],s=n[n.length-4],i=[];for(let e=n.length-4;e>=0;e-=4)i.push(s-(n[e]-o),n[e+1],n[e+2],n[e+3]);return{...e,RGBPoints:i}}(l.getPresetByName(y.presetName)??l.getPresetByName("Cool to Warm"),y.reverse);v.applyColorMap(E),v.setMappingRange(b[0],b[1]),v.updateRange(),g.setLookupTable(v);const C=r.newInstance();if(C.setMapper(g),"line"===e.mode&&C.getProperty().setLineWidth(3),f.addActor(C),y.showScalarBar){const e=u.newInstance({drawNanAnnotation:!1,generateTicks:e=>{const t=e.getLastTickBounds();if(!t||t.length<2)return;const[n,o]=t,s=(o-n)/4,i=Array.from({length:5},((e,t)=>n+t*s));e.setTicks(i),e.setTickStrings(i.map((e=>{const t=Math.abs(e);return 0===t?"0":t>=.01&&t<1e4?parseFloat(e.toPrecision(4)).toString():e.toExponential(2)})))}});e.setTickTextStyle({fontColor:"black"}),e.setAxisTextStyle({fontColor:"black"}),e.setAxisLabel(y.scalarBarTitle),e.setScalarsToColors(v),f.addActor2D(e)}const D=ce(s.contourLines??{enabled:!1});D.enabled&&"line"!==e.mode&&await async function(e,t,n,o){const s=t.metadata?.interpolationGrid;if(!s)return;const{vtkActor:i,vtkDataArray:r,vtkImageData:a,vtkImageMarchingSquares:l,vtkMapper:d}=await ae(),c=a.newInstance();c.setDimensions(s.nx,s.ny,1),c.setOrigin(s.origin[0],s.origin[1],0),c.setSpacing(s.spacing[0],s.spacing[1],1);const u=r.newInstance({name:"solution",numberOfComponents:1,values:s.imageScalars});c.getPointData().setScalars(u);const m=l.newInstance({slicingMode:2,slice:0,mergePoints:!0});m.setInputData(c);const h=Math.max(2,o.numberOfContours),f=n[0],p=n[1],g=(p-f)/(h-1),b=[];for(let e=0;e<h;e++)b.push(f+e*g);m.setContourValues(b),m.update();const y=d.newInstance();y.setInputData(m.getOutputData()),y.setScalarVisibility(!1);const v=i.newInstance();v.setMapper(y),v.getProperty().setColor(...o.color),v.getProperty().setLineWidth(o.lineWidth),e.addActor(v)}(f,e,b,D),f.resetCamera(),p.render(),le.set(t,h),m.title=`${o} plot - ${n}`}async function he(e,t,n,o="surface"){const{vtkPolyData:s,vtkDataArray:i}=await ae(),r=s.newInstance();r.getPoints().setData(e,3),n.length>0&&("line"===o?r.getLines().setData(n):r.getPolys().setData(n));const a=i.newInstance({name:"solution",numberOfComponents:1,values:t});return r.getPointData().setScalars(a),r}function fe(e,t){const n=new Float32Array(3*e.length);for(let o=0;o<e.length;o++){const s=3*o;n[s]=Number(e[o])||0,n[s+1]=Number(t?.[o])||0,n[s+2]=0}return n}function pe(e,t){const n=new Float32Array(t);for(let o=0;o<t;o++){const t=e?.[o];n[o]=Number(Array.isArray(t)?t[0]:t)||0}return n}function ge(e){const t=e.map((e=>e-1)),n=t.length;return 2===n||3===n?t:4===n?[t[0],t[2],t[3],t[1]]:6===n?[t[0],t[2],t[5]]:8===n?[t[0],t[4],t[6],t[2]]:9===n?[t[0],t[6],t[8],t[2]]:t.slice(0,Math.min(4,t.length))}function be(e){let t=0,n=0;for(;n<e.length;)n+=e[n]+1,t++;return t}function ye(e,t,n){const o=new Float32Array(t*n);for(let s=0;s<n;s++)for(let i=0;i<t;i++)o[i+s*t]=e[i*n+s];return o}function ve(e,t,n,o,s,i,r){const{nodesXCoordinates:a,nodesYCoordinates:l}=n.nodesCoordinates,d=t.nop[o].length;if(4===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][1]-1],l[t.nop[o][1]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][3]-1],l[t.nop[o][3]-1]]]);if(d.inside)return{inside:!0,value:Ee(e,t,n,o,d.ksi,d.eta,r)}}else if(9===d){const d=R(s,i,[[a[t.nop[o][0]-1],l[t.nop[o][0]-1]],[a[t.nop[o][2]-1],l[t.nop[o][2]-1]],[a[t.nop[o][6]-1],l[t.nop[o][6]-1]],[a[t.nop[o][8]-1],l[t.nop[o][8]-1]]]);if(d.inside)return{inside:!0,value:Ee(e,t,n,o,d.ksi,d.eta,r)}}return{inside:!1,value:null}}function Ee(e,t,n,o,s,i,r){const a=n.solutionVector,l=t.nop[o].length,d=r.getBasisFunctions(s,i).basisFunction,c=Array.isArray(a[0])?a.map((e=>e[0])):a;let u=0;for(let e=0;e<l;e++)u+=c[t.nop[o][e]-1]*d[e];return u}function Ce(e,t,n){let o=!1;for(let s=0;s<n.length;s++){const[[i,r],[a,l]]=n[s];r>t!=l>t&&e<(a-i)*(t-r)/(l-r)+i&&(o=!o)}return o}e.FEAScriptModel=class{constructor(){var e;this.solverConfig=null,this.meshConfig={},this.boundaryConditions={},this.solverMethod="lusolve",this.coefficientFunctions=null,e="FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE",console.log("%c[WARN] "+e,"color: #FF9800; font-weight: bold;"),s("FEAScriptModel instance created")}setModelConfig(e,t={}){this.solverConfig=e,void 0!==t?.coefficientFunctions&&(this.coefficientFunctions=t.coefficientFunctions,o("coefficientFunctions set")),void 0!==t?.maxIterations&&(this.maxIterations=t.maxIterations,o(`maxIterations set to ${this.maxIterations}`)),void 0!==t?.tolerance&&(this.tolerance=t.tolerance,o(`tolerance set to ${this.tolerance}`)),o(`solverConfig set to ${e}`)}setMeshConfig(e){this.meshConfig=e,o(`meshConfig set with dimensions: ${e.meshDimension}`)}addBoundaryCondition(e,t){this.boundaryConditions[e]=t,o(`boundaryConditions added for boundary: ${e}, type: ${t[0]}`)}setSolverMethod(e){this.solverMethod=e,o(`solverMethod set to: ${e}`)}solve(e={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("solverConfig, meshConfig and boundaryConditions must be set before solving");let t=[],n=[],r=[],a=[];s("Preparing mesh...");const l=S(this.meshConfig);s("Mesh preparation completed");const d={nodesXCoordinates:l.nodesXCoordinates,nodesYCoordinates:l.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver ${this.solverConfig}`),"heatConductionScript"===this.solverConfig)if("frontal"===this.solverMethod){r=Q(W,l,this.boundaryConditions).solutionVector}else{({jacobianMatrix:t,residualVector:n}=q(l,this.boundaryConditions));r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("frontPropagationScript"===this.solverConfig){let o=0;const s=5,i={meshData:l,boundaryConditions:this.boundaryConditions,eikonalActivationFlag:o,solverMethod:this.solverMethod,initialSolution:a,maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance};for(;o<=1;){i.eikonalActivationFlag=o,r.length>0&&(i.initialSolution=[...r]);const e=te(L,i);t=e.jacobianMatrix,n=e.residualVector,r=e.solutionVector,o+=1/s}}else if("generalFormPDEScript"===this.solverConfig)if("frontal"===this.solverMethod)i("Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.");else{({jacobianMatrix:t,residualVector:n}=function(e,t,n){s("Starting general form PDE matrix assembly...");const{nodesXCoordinates:o,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,meshDimension:c,elementOrder:u}=e,{A:m,B:h,C:f,D:p}=n,g=I(e),{residualVector:b,jacobianMatrix:y,localToGlobalMap:v,basisFunctions:E,gaussPoints:C,gaussWeights:D,nodesPerElement:M}=g;if("1D"===c)for(let e=0;e<d;e++){for(let t=0;t<M;t++)v[t]=Math.abs(a[e][t])-1;for(let e=0;e<C.length;e++){const{basisFunction:t,basisFunctionDerivKsi:n}=E.getBasisFunctions(C[e]),{detJacobian:s,basisFunctionDerivX:i}=V({basisFunction:t,basisFunctionDerivKsi:n,nodesXCoordinates:o,localToGlobalMap:v,nodesPerElement:M});let r=0;for(let e=0;e<M;e++)r+=o[v[e]]*t[e];const a=m(r),l=h(r),d=f(r),c=p(r);for(let n=0;n<M;n++){const o=v[n];b[o]-=D[e]*s*c*t[n];for(let r=0;r<M;r++){const c=v[r];y[o][c]+=D[e]*s*a*i[n]*i[r],y[o][c]-=D[e]*s*l*i[r]*t[n],y[o][c]-=D[e]*s*d*t[n]*t[r]}}}}else"2D"===c&&i("2D general form PDE is not yet supported in assembleGeneralFormPDEMat.");return new G(t,l,a,c,u).imposeDirichletBoundaryConditions(b,y),s("General form PDE matrix assembly completed"),{jacobianMatrix:y,residualVector:b}}(l,this.boundaryConditions,this.coefficientFunctions));r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector}else if("creepingFlowScript"===this.solverConfig){const a=function(e,t){s("Starting creeping flow matrix assembly...");const{nodesXCoordinates:n,nodesYCoordinates:r,nop:a,boundaryElements:l,totalElements:d,totalNodes:c,meshDimension:u,elementOrder:m}=e;"2D"!==u&&i("Creeping flow solver requires a 2D mesh"),"quadratic"!==m&&i("Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation");const h=c,f=[0,2,6,8],p=new Map,g=[];let b=0;for(let e=0;e<d;e++)for(let t=0;t<f.length;t++){const n=a[e][f[t]]-1;p.has(n)||(p.set(n,b),g.push(n),b++)}const y=b,v=2*h+y;o(`Creeping flow DOFs: ${h} velocity nodes (Q2), ${y} pressure nodes (Q1), ${v} total DOFs`);let E=[],C=[];for(let e=0;e<v;e++){E[e]=0,C.push([]);for(let t=0;t<v;t++)C[e][t]=0}const D=new x({meshDimension:"2D",elementOrder:"quadratic"}),M=new x({meshDimension:"2D",elementOrder:"linear"});let F=new O({meshDimension:"2D",elementOrder:"quadratic"}).getGaussPointsAndWeights(),w=F.gaussPoints,$=F.gaussWeights;for(let e=0;e<d;e++){let t=[];for(let n=0;n<9;n++)t[n]=a[e][n]-1;let o=[];for(let t=0;t<4;t++){const n=a[e][f[t]]-1;o[t]=p.get(n)}for(let e=0;e<w.length;e++)for(let s=0;s<w.length;s++){const i=D.getBasisFunctions(w[e],w[s]),a=M.getBasisFunctions(w[e],w[s]),l=T({basisFunction:i.basisFunction,basisFunctionDerivKsi:i.basisFunctionDerivKsi,basisFunctionDerivEta:i.basisFunctionDerivEta,nodesXCoordinates:n,nodesYCoordinates:r,localToGlobalMap:t,nodesPerElement:9}),{detJacobian:d,basisFunctionDerivX:c,basisFunctionDerivY:u}=l,m=$[e]*$[s]*d;for(let e=0;e<9;e++){let n=t[e],s=n,i=h+n;for(let n=0;n<9;n++){let o=t[n],r=o,a=h+o,l=1*-m*(c[e]*c[n]+u[e]*u[n]);C[s][r]+=l,C[i][a]+=l}for(let t=0;t<4;t++){let n=2*h+o[t],r=m*a.basisFunction[t]*c[e],l=m*a.basisFunction[t]*u[e];C[s][n]+=r,C[i][n]+=l,C[n][s]+=-r,C[n][i]+=-l}}}}return new ne(t,l,a,u,m,h,y,p).imposeDirichletBoundaryConditions(E,C),s("Creeping flow matrix assembly completed"),{jacobianMatrix:C,residualVector:E,totalNodesVelocity:h,totalNodesPressure:y,pressureNodeIndices:g}}(l,this.boundaryConditions);t=a.jacobianMatrix,n=a.residualVector;r=$(this.solverMethod,t,n,{maxIterations:e.maxIterations??this.maxIterations,tolerance:e.tolerance??this.tolerance}).solutionVector,this._creepingFlowMetadata={totalNodesVelocity:a.totalNodesVelocity,totalNodesPressure:a.totalNodesPressure,pressureNodeIndices:a.pressureNodeIndices}}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:d}}async solveAsync(e,t={}){this.solverConfig&&this.meshConfig&&this.boundaryConditions||i("Solver config, mesh config, and boundary conditions must be set before solving.");let n=[],o=[],r=[];s("Preparing mesh...");const a=S(this.meshConfig);s("Mesh preparation completed");const l={nodesXCoordinates:a.nodesXCoordinates,nodesYCoordinates:a.nodesYCoordinates};if(s("Beginning solving process..."),console.time("totalSolvingTime"),s(`Using solver: ${this.solverConfig}`),"heatConductionScript"===this.solverConfig&&(({jacobianMatrix:n,residualVector:o}=q(a,this.boundaryConditions)),"jacobi-gpu"===this.solverMethod)){const{solutionVector:s}=await A("jacobi-gpu",n,o,{computeEngine:e,maxIterations:t.maxIterations??this.maxIterations,tolerance:t.tolerance??this.tolerance});r=s}return console.timeEnd("totalSolvingTime"),s("Solving process completed"),{solutionVector:r,nodesCoordinates:l}}},e.FEAScriptWorker=class{constructor(){this.worker=null,this.feaWorker=null,this.isReady=!1,this._initWorker()}async _initWorker(){try{this.worker=new Worker(new URL("./wrapperScript.js","undefined"==typeof document&&"undefined"==typeof location?new(require("url").URL)("file:"+__filename).href:"undefined"==typeof document?location.href:document.currentScript&&"SCRIPT"===document.currentScript.tagName.toUpperCase()&&document.currentScript.src||new URL("feascript.umd.js",document.baseURI).href),{type:"module"}),this.worker.onerror=e=>{console.error("FEAScriptWorker: Worker error:",e)};const e=p(this.worker);this.feaWorker=await new e,this.isReady=!0}catch(e){throw console.error("Failed to initialize worker",e),e}}async _ensureReady(){return this.isReady?Promise.resolve():new Promise(((e,t)=>{let n=0;const o=()=>{n++,this.isReady?e():n>=50?t(new Error("Timeout waiting for worker to be ready")):setTimeout(o,1e3)};o()}))}async setModelConfig(e){return await this._ensureReady(),this.feaWorker.setModelConfig(e)}async setMeshConfig(e){return await this._ensureReady(),this.feaWorker.setMeshConfig(e)}async addBoundaryCondition(e,t){return await this._ensureReady(),this.feaWorker.addBoundaryCondition(e,t)}async setSolverMethod(e){return await this._ensureReady(),this.feaWorker.setSolverMethod(e)}async solve(){await this._ensureReady(),performance.now();const e=await this.feaWorker.solve();return performance.now(),e}async getModelInfo(){return await this._ensureReady(),this.feaWorker.getModelInfo()}async ping(){return await this._ensureReady(),this.feaWorker.ping()}terminate(){this.worker&&(this.worker.terminate(),this.worker=null,this.feaWorker=null,this.isReady=!1)}},e.createColorScale=de,e.createContourLineOptions=ce,e.importGmshQuadTri=async e=>{let t={nodesXCoordinates:[],nodesYCoordinates:[],nodalNumbering:{quadElements:[],triangleElements:[]},boundaryElements:[],boundaryConditions:[],boundaryNodePairs:{},gmshV:0,ascii:!1,fltBytes:"8",totalNodesX:0,totalNodesY:0,physicalPropMap:[],elementTypes:{}};const n={curves:{}};let s=(await e.text()).split("\n").map((e=>e.trim())).filter((e=>""!==e)),i="",r=0,a=0,l=0,d=0,c={numNodes:0},u=[],m=0,h=0,f=0,p=0,g={numElements:0},b=0,y={},v=null,E=null,C=0,D=0,M=0;for(;r<s.length;){const e=s[r];if("$MeshFormat"===e){i="meshFormat",r++;continue}if("$EndMeshFormat"===e){i="",r++;continue}if("$PhysicalNames"===e){i="physicalNames",r++;continue}if("$EndPhysicalNames"===e){i="",r++;continue}if("$Entities"===e){i="entities",E="counts",r++;continue}if("$EndEntities"===e){i="",v=null,E=null,r++;continue}if("$Nodes"===e){i="nodes",r++;continue}if("$EndNodes"===e){i="",r++;continue}if("$Elements"===e){i="elements",r++;continue}if("$EndElements"===e){i="",r++;continue}const o=e.split(/\s+/);if("meshFormat"===i)t.gmshV=parseFloat(o[0]),t.ascii="0"===o[1],t.fltBytes=o[2];else if("physicalNames"===i){const e=parseInt(o[0],10),n=parseInt(o[1],10);let s=o.slice(2).join(" ").replace(/^"|"$/g,"");t.physicalPropMap.push({tag:n,dimension:e,name:s})}else if("entities"===i)if("counts"===E)v={points:parseInt(o[0],10),curves:parseInt(o[1],10),surfaces:parseInt(o[2],10),volumes:parseInt(o[3],10)},E="points";else if("points"===E)C++,C===v.points&&(E="curves");else if("curves"===E){const e=parseInt(o[0],10),t=parseInt(o[7],10),s=o.slice(8,8+t).map((e=>parseInt(e,10)));n.curves[e]=s,D++,D===v.curves&&(E="surfaces")}else"surfaces"===E&&(M++,M===v.surfaces&&(E="volumes"));else if("nodes"===i){if(0===a)a=parseInt(o[0],10),l=parseInt(o[1],10),t.nodesXCoordinates=new Array(l).fill(0),t.nodesYCoordinates=new Array(l).fill(0);else if(d<a&&0===c.numNodes)c={dim:parseInt(o[0],10),tag:parseInt(o[1],10),parametric:parseInt(o[2],10),numNodes:parseInt(o[3],10)},u=[],m=0,h=0;else if(m<c.numNodes){for(let e of o)if(u.push(parseInt(e,10)),m++,m===c.numNodes)break}else if(h<c.numNodes){const e=u[h]-1;t.nodesXCoordinates[e]=parseFloat(o[0]),t.nodesYCoordinates[e]=parseFloat(o[1]),t.totalNodesX++,t.totalNodesY++,h++,h===c.numNodes&&(d++,c={numNodes:0})}}else if("elements"===i)if(0===f)f=parseInt(o[0],10),parseInt(o[1],10);else if(p<f&&0===g.numElements)g={dim:parseInt(o[0],10),tag:parseInt(o[1],10),elementType:parseInt(o[2],10),numElements:parseInt(o[3],10)},t.elementTypes[g.elementType]=(t.elementTypes[g.elementType]||0)+g.numElements,b=0;else if(b<g.numElements){const e=o.slice(1).map((e=>parseInt(e,10)));let s=g.tag;if(1===g.dim){const e=n.curves[g.tag];e&&e.length>0&&(s=e[0])}1===g.elementType||8===g.elementType?(y[s]||(y[s]=[]),y[s].push(e),t.boundaryNodePairs[s]||(t.boundaryNodePairs[s]=[]),t.boundaryNodePairs[s].push(e)):2===g.elementType?t.nodalNumbering.triangleElements.push(e):3!==g.elementType&&10!==g.elementType||t.nodalNumbering.quadElements.push(e),b++,b===g.numElements&&(p++,g={numElements:0})}r++}return t.physicalPropMap.forEach((e=>{if(1===e.dimension){const n=y[e.tag]||[];n.length>0&&t.boundaryConditions.push({name:e.name,tag:e.tag,nodes:n})}})),o(`Parsed boundary node pairs by physical tag: ${JSON.stringify(t.boundaryNodePairs)}`),t},e.logSystem=function(e){"basic"!==e&&"debug"!==e?(console.log("%c[WARN] Invalid log level: "+e+". Using basic instead.","color: #FFC107; font-weight: bold;"),n="basic"):(n=e,s(`Log level set to: ${e}`))},e.plotInterpolatedSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=e.meshConfig.meshDimension,a=S(e.meshConfig),l=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});if("1D"===r&&"line"===n);else if("2D"===r&&"contour"===n){const r=[],d=[],c=Math.max(...s)-Math.min(...s),u=Math.max(...i)-Math.min(...i),m=50,h=Math.round(c*m),f=Math.round(u*m),p=c/(h-1),g=u/(f-1);let b=[];r[0]=Math.min(...s),d[0]=Math.min(...i);for(let e=1;e<f;e++)r[e]=r[0],d[e]=d[0]+e*g;for(let e=1;e<h;e++){const t=e*f;r[t]=r[0]+e*p,d[t]=d[0];for(let e=1;e<f;e++)r[t+e]=r[t],d[t+e]=d[t]+e*g}b=new Array(h*f).fill(null);const y=j(a),{nodeNeighbors:v,neighborCount:E}=Y(a);let C=0;for(let n=0;n<h*f;n++){if(!ie(r[n],d[n],y))continue;let o=!1;for(let s=0;s<a.nop[C].length;s++){let i=a.nop[C][s]-1;for(let s=0;s<E[i];s++){let c=v[i][s];const u=oe(e,a,t,c,r[n],d[n],l);if(u.inside){C=c,b[n]=u.value,o=!0;break}}if(o)break}if(!o)for(let s=0;s<a.nop.length;s++){const i=oe(e,a,t,s,r[n],d[n],l);if(i.inside){C=s,b[n]=i.value,o=!0;break}}}let D=Math.min(window.innerWidth,700),M=u/c,F=Math.min(D,600),w=F*M,$={title:`${n} plot (interpolated) - ${e.solverConfig}`,width:F,height:w,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},A={x:r,y:d,z:b,type:"contour",connectgaps:!1,hoverongaps:!1,line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Interpolated Solution Field"};Plotly.newPlot(o,[A],$,{responsive:!0}),console.timeEnd("plottingTime")}},e.plotInterpolatedSolutionVtk=async function(e,t,n,o,s={}){if(console.time("plottingTime"),"2D"!==e.meshConfig.meshDimension||"contour"!==n){const i=S(e.meshConfig),r=await ue(e,t,i,{mode:"1D"===e.meshConfig.meshDimension&&"line"===n?"line":"surface"});return await me(r,o,e.solverConfig,n,s),void console.timeEnd("plottingTime")}const i=S(e.meshConfig),r=await async function(e,t,n){const o=await async function(e,t,n){const{nodesXCoordinates:o,nodesYCoordinates:s}=t.nodesCoordinates,i=new x({meshDimension:e.meshConfig.meshDimension,elementOrder:e.meshConfig.elementOrder});let r=o[0],a=o[0],l=s[0],d=s[0];for(let e=1;e<o.length;e++){const t=o[e],n=s[e];t<r&&(r=t),t>a&&(a=t),n<l&&(l=n),n>d&&(d=n)}const c=a-r,u=d-l,m=50,h=Math.max(2,Math.round(c*m)),f=Math.max(2,Math.round(u*m)),p=c/(h-1),g=u/(f-1),b=h*f,y=new Float32Array(b),v=new Float32Array(b),E=new Float32Array(b);E.fill(Number.NaN);const C=new Uint8Array(b),D=j(n),{nodeNeighbors:M,neighborCount:F}=Y(n);let w=0;for(let o=0;o<h;o++)for(let s=0;s<f;s++){const a=o*f+s,d=r+o*p,c=l+s*g;if(y[a]=d,v[a]=c,!Ce(d,c,D))continue;let u=!1;for(let o=0;o<n.nop[w].length;o++){const s=n.nop[w][o]-1;for(let o=0;o<F[s];o++){const r=M[s][o],l=ve(e,n,t,r,d,c,i);if(l.inside){w=r,E[a]=l.value,C[a]=1,u=!0;break}}if(u)break}if(!u)for(let o=0;o<n.nop.length;o++){const s=ve(e,n,t,o,d,c,i);if(s.inside){w=o,E[a]=s.value,C[a]=1;break}}}return{visNodesX:h,visNodesY:f,minX:r,minY:l,deltaX:p,deltaY:g,lengthX:c,lengthY:u,visNodeXCoordinates:y,visNodeYCoordinates:v,visSolution:E,insideMask:C}}(e,t,n),{visNodesX:s,visNodesY:i,minX:r,minY:a,deltaX:l,deltaY:d,visNodeXCoordinates:c,visNodeYCoordinates:u,visSolution:m,insideMask:h}=o,f=fe(c,u),p=function(e,t,n){const o=[];for(let s=0;s<e-1;s++)for(let e=0;e<t-1;e++){const i=s*t+e,r=(s+1)*t+e,a=(s+1)*t+(e+1),l=s*t+(e+1);n[i]&&n[r]&&n[a]&&n[l]&&o.push(4,i,r,a,l)}return Uint32Array.from(o)}(s,i,h),g=await he(f,m,p,"surface");return{points:f,scalars:m,cells:p,polyData:g,mode:"surface",metadata:{meshDimension:"2D",numberOfPoints:f.length/3,numberOfCells:be(p),interpolationGrid:{nx:s,ny:i,origin:[r,a],spacing:[l,d],imageScalars:ye(m,s,i)}}}}(e,t,i);await me(r,o,e.solverConfig,`${n}-interpolated`,s),console.timeEnd("plottingTime")},e.plotSolution=function(e,t,n,o){console.time("plottingTime");const{nodesXCoordinates:s,nodesYCoordinates:i}=t.nodesCoordinates,r=t.solutionVector,a=e.solverConfig,l=e.meshConfig.meshDimension;if(S(e.meshConfig),"1D"===l&&"line"===n){let e;e=r.length>0&&Array.isArray(r[0])?r.map((e=>e[0])):r,Array.from(s);let t={x:s,y:e,mode:"lines",type:"scatter",line:{color:"rgb(219, 64, 82)",width:2},name:"Solution"},n=Math.min(window.innerWidth,700),i={title:`line plot - ${a}`,width:Math.min(n,600),height:300,xaxis:{title:"x"},yaxis:{title:"Solution"},margin:{l:50,r:50,t:50,b:50}};Plotly.newPlot(o,[t],i,{responsive:!0}),console.timeEnd("plottingTime")}else if("2D"===l&&"contour"===n){let e;e=Array.isArray(r[0])?r.map((e=>e[0])):r;let t=Math.min(window.innerWidth,700),l=Math.min(...s),d=Math.max(...s),c=Math.min(...i),u=(Math.max(...i)-c)/(d-l),m=Math.min(t,600),h={title:`${n} plot - ${a}`,width:m,height:m*u,xaxis:{title:"x"},yaxis:{title:"y",scaleanchor:"x",scaleratio:1},margin:{l:50,r:50,t:50,b:50},hovermode:"closest"},f={x:s,y:i,z:e,type:"contour",line:{smoothing:.85},contours:{coloring:"heatmap",showlabels:!1},colorbar:{title:"Solution"},name:"Solution Field"};Plotly.newPlot(o,[f],h,{responsive:!0}),console.timeEnd("plottingTime")}},e.plotSolutionVtk=async function(e,t,n,o,s={}){console.time("plottingTime");const i=e.meshConfig.meshDimension,r=S(e.meshConfig),a=await ue(e,t,r,{mode:"1D"===i&&"line"===n?"line":"surface"});await me(a,o,e.solverConfig,n,s),console.timeEnd("plottingTime")},e.printVersion="0.3.0 (RC)",e.transformSolverOutputToMLBuffers=function(e){const{nodesXCoordinates:t,nodesYCoordinates:n}=e.nodesCoordinates,o=pe(e.solutionVector,t.length),s=new Float32Array(3*t.length);for(let e=0;e<t.length;e++){const i=3*e;s[i]=Number(t[e])||0,s[i+1]=Number(n[e])||0,s[i+2]=o[e]}return{features:s,featuresShape:[t.length,3],labels:o,points:fe(t,n)}},e.transformSolverOutputToVTP=async function(e,t,n=null,o={}){return function(e){const{connectivity:t,offsets:n}=function(e){const t=[],n=[];let o=0,s=0;for(;o<e.length;){const i=e[o++];for(let n=0;n<i;n++)t.push(e[o++]);s+=i,n.push(s)}return{connectivity:t,offsets:n}}(e.cells),o=e.points.length/3,s="line"===e.mode,i=s?"Lines":"Polys";return['<?xml version="1.0"?>','<VTKFile type="PolyData" version="0.1" byte_order="LittleEndian">',"  <PolyData>",`    <Piece NumberOfPoints="${o}" NumberOfVerts="0" NumberOfLines="${s?n.length:0}" NumberOfStrips="0" NumberOfPolys="${s?0:n.length}">`,'      <PointData Scalars="solution">',`        <DataArray type="Float32" Name="solution" NumberOfComponents="1" format="ascii">${Array.from(e.scalars).join(" ")}</DataArray>`,"      </PointData>","      <Points>",`        <DataArray type="Float32" NumberOfComponents="3" format="ascii">${Array.from(e.points).join(" ")}</DataArray>`,"      </Points>",`      <${i}>`,`        <DataArray type="Int32" Name="connectivity" format="ascii">${t.join(" ")}</DataArray>`,`        <DataArray type="Int32" Name="offsets" format="ascii">${n.join(" ")}</DataArray>`,`      </${i}>`,"    </Piece>","  </PolyData>","</VTKFile>"].join("\n")}(await ue(e,t,n,o))},e.transformSolverOutputToVtkData=ue,Object.defineProperty(e,"__esModule",{value:!0})}));
 //# sourceMappingURL=feascript.umd.js.map
diff --git a/dist/feascript.umd.js.map b/dist/feascript.umd.js.map
index 63f32a8..b798613 100644
--- a/dist/feascript.umd.js.map
+++ b/dist/feascript.umd.js.map
@@ -1 +1 @@
-{"version":3,"file":"feascript.umd.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditions.js","../src/visualization/plotSolutionScript.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/workers/workerScript.js","../src/readers/gmshReaderScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\"\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  \n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : jacobianMatrix?.toArray?.() ?? jacobianMatrix;\n  const b = Array.isArray(residualVector) ? residualVector : residualVector?.toArray?.() ?? residualVector;\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => { });\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering)\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \"\n                          )}]`\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\"\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2]\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(Math.ceil(Math.sqrt(numElements)) * nodesPerElement, nodesPerElement * 2);\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex)\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag }\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideTriangle,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\"\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the solver configuration\n   * @param {string} solverConfig - Parameter specifying the type of solver\n   * @param {object} [options] - Optional additional configuration\n   */\n  setSolverConfig(solverConfig, options = {}) {\n    this.solverConfig = solverConfig;\n    warnLog(\"setSolverConfig() is deprecated. Use setModelConfig() instead\");\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${solverConfig}`);\n  }\n\n  // Alias modelConfig to solverConfig (solverConfig is deprecated, use setModelConfig instead)\n  setModelConfig(modelConfig, options = {}) {\n    this.setSolverConfig(modelConfig, options);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as \n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\"\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          }\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex]\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex]\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditions.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.2.0 | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotSolutionScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.2.0\";"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","debugLog","message","console","log","basicLog","errorLog","warnLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","document","location","require","__filename","href","currentScript","tagName","toUpperCase","src","baseURI","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","globalNodeIndex","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","pointSearch","model","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","zData","solutionInterpolationValue","pointInsidePolygon","segments","x1","y1","x2","y2","solverConfig","coefficientFunctions","setSolverConfig","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","has","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseFloat","parseInt","replace","points","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","level","plotType","plotDivId","visNodeXCoordinates","visNodeYCoordinates","lengthX","min","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","k","getBoundarySegments","nodeNeighbors","neighborCount","from","elemIndex","computeNodeNeighbors","lastParentElement","visNodeIndex","found","neighborElementsIndex","searchResult","maxWindowWidth","window","innerWidth","aspectRatio","plotWidth","plotHeight","layout","title","width","height","xaxis","yaxis","scaleanchor","scaleratio","margin","hovermode","contourData","z","connectgaps","hoverongaps","smoothing","contours","coloring","showlabels","colorbar","Plotly","newPlot","responsive","yData","lineData","mode","color","minX","minY"],"mappings":"oyBAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,CCXA,IAAIK,EAAkB,QAuBf,SAASC,EAASC,GACC,UAApBF,GACFG,QAAQC,IAAI,aAAeF,EAAS,qCAExC,CAMO,SAASG,EAASH,GACvBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC,CAMO,SAASI,EAASJ,GACvBC,QAAQC,IAAI,aAAeF,EAAS,qCACtC,CAMO,SAASK,EAAQL,GACtBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC;;;;;KCxDA,MAAMM,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACH3B,QAAS2B,EAAM3B,QACf+B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAM3B,SAAU4B,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADAzC,QAAQ8C,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKvD,OACL,MAAO,CAAE2E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKvD,OAAS,GAChC,GAAImH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAMxD,KAAKiI,MAAMjI,KAAKkI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGxF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHAxI,EAAS,wBAAwBgI,QACjClI,QAAQ2I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC5BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE5J,OACZ,IAAIgK,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAInK,EAAI,EAAGA,EAAIgK,EAAGhK,IAAK,CAC1B,IAAIoK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBrK,IAAMqK,IACRD,GAAOP,EAAE7J,GAAGqK,GAAKJ,EAAEI,IAGvBH,EAAKlK,IAAM8J,EAAE9J,GAAKoK,GAAOP,EAAE7J,GAAGA,EAC/B,CAGD,IAAIsK,EAAU,EACd,IAAK,IAAItK,EAAI,EAAGA,EAAIgK,EAAGhK,IACrBsK,EAAUpK,KAAKqK,IAAID,EAASpK,KAAKsK,IAAIN,EAAKlK,GAAKiK,EAAEjK,KAMnD,GAFAiK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDP+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAe1I,QAAQiI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrB3I,EAAS,8BAA8BuJ,EAAmBX,yBAE1DvI,EAAS,wCAAwCkJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACIvI,EAAS,0BAA0B+H,KAMrC,OAHAlI,QAAQmK,QAAQ,iBAChBjK,EAAS,8BAEF,CAAEsI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAGnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDnI,EAAS,wBAAwBgI,QACjClI,QAAQ2I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAiBA,GAAgBoC,aAAepC,EACpFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAiBA,GAAgBmC,aAAenC,EAE1F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAzCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,mCAAoC,oBAAAC,UAAA,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAA,oBAAAJ,SAAAC,SAAAG,KAAAJ,SAAAK,eAAA,WAAAL,SAAAK,cAAAC,QAAAC,eAAAP,SAAAK,cAAAG,KAAA,IAAAT,IAAA,mBAAAC,SAAAS,SAAAL,MAAkB,CACtFjI,KAAM,WAEFyH,EAAgBc,EAAab,GAEnC,aADMD,EAAce,aACb,CAAEf,gBAAeC,SAC1B,CAkCoBe,GAChBhB,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE7J,QAAQiI,KAAK,GACpC,IAAI+D,EAEJA,QAAejB,EAAckB,mBAAmBrC,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiBkD,EAAOlD,eACxBC,EAAYiD,EAAOjD,UACnBC,EAAagD,EAAOhD,WAGhBD,EACF3I,EAAS,8BAA8B4I,gBAEvCvI,EAAS,wCAAwCuI,eAEvD,MACIvI,EAAS,0BAA0B+H,KAWrC,OARAlI,QAAQmK,QAAQ,iBAChBjK,EAAS,+BAA+BgI,MAEpCsC,UACIC,GAAemB,YAAYxH,OAAM,UACvCoG,EAAQE,OAAOmB,aAGV,CAAErD,iBAAgBC,YAAWC,aACtC,CElIO,MAAMoD,EAMX,WAAA/G,EAAYgH,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADAjM,EAAS,8CAIX,GAA0B,WAAtB8L,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAAhI,EAAYiI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACPlN,EAAS,mEACT+L,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnBpN,EAAS,sDAKPkH,MAAMiD,QAAQ2B,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBlG,MAAMiD,QAAQ2B,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExD3N,EACE,yDACE4N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAa9N,OAAQoO,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAI3G,MAAM0G,EAAUrO,QAGlB,IAArBqO,EAAUrO,QAOZsO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAUrO,SASnBsO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtCzN,EAAS,4FASX,GANAL,EACE,gEACE4N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACE9G,MAAMiD,QAAQ2B,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBzO,OAAS,QACFuE,IAAxCgI,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAI3O,EAAI,EAAGA,EAAIwM,KAAKmB,WAAWe,iBAAiBzO,OAAQD,IACvDwM,KAAKmB,WAAWe,iBAAiB1O,IACnC2O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiB1O,IAGhEwM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAAS7K,IAEvC,GAAuB,IAAnBA,EAAK8K,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkB5K,EAAK+K,MAAQ,GAErEH,EAAkB3O,OAAS,IAExBuM,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,OACzCvC,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExB3O,EACE,mCAAmC4O,MAAUC,mBAAuBlL,EAAK+K,QACvE/K,EAAK3B,MAAQ,cAKjB,IAAI8M,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAe7N,OAC9CoO,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoBnP,QAEtB,GAAImP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C7O,EACE,mBAAmBgO,gDAA2De,EAAoB7G,KAChG,UAGJlI,EACE,UAAU4O,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,uCAAuCiP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,qCAAqCiP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,oCAAoCiP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPjP,EAAS,sCAAsCiP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAKP,KAAK,CAACH,EAAciB,IAC/DjP,EACE,8BAA8BgO,MAAiBiB,sBAAyBtL,EAAK+K,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoBnP,QAGzBmP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C7O,EACE,mBAAmBgO,gDAA2De,EAAoB7G,KAChG,UAGJlI,EACE,UAAU4O,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,uCAAuCiP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,qCAAqCiP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPjP,EAAS,oCAAoCiP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPjP,EAAS,sCAAsCiP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAKP,KAAK,CAACH,EAAciB,IAC/DjP,EACE,8BAA8BgO,MAAiBiB,sBAAyBtL,EAAK+K,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACHzO,EACE,oDAAoDuO,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBzO,OAAS,QACFuE,IAAxCgI,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAI3O,EAAI,EAAGA,EAAIwM,KAAKmB,WAAWe,iBAAiBzO,OAAQD,IACvDwM,KAAKmB,WAAWe,iBAAiB1O,IACnC2O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiB1O,IAGhEwM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAAhI,EAAYiI,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrC9M,EAAS,wFAEZ,CAED,YAAAkP,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHA7P,EAAS,iCAAmC4N,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDlN,EAAS,yCAA2C4N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAAhI,EAAYiI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExFhN,EACE,6GAGL,CAED,YAAAkP,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAW7Q,KAAK8Q,GAAK,IACrBC,EAAU/Q,KAAKgR,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAWjR,KAAKgR,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQpR,KAAKsK,IAAIyG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAASrR,KAAKsK,IAAI2G,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJA7P,EAAS,iCAAmC4N,KAAKC,UAAU2B,IAC3DxP,EAAS,iCAAmC4N,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFAhO,EAAS,yCAA2C4N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAzM,EAAYgH,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAI/R,KAAKC,KAAK,KAAU,EAC1C8R,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAI/R,KAAKC,KAAK,KAAU,EAC1C+R,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGF9P,EAAS,8CAIX,MAAM4R,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAIlQ,OACpBuS,EAAa3C,EAAkB5P,OAC/BI,EAAS,0BAA0BkS,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnErQ,EAAS,2CAA2CkS,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAI/J,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAIsH,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3DrH,EAAeqH,GAAa,EAC5BtH,EAAe8F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5CjK,EAAesH,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACLrJ,iBACAD,iBACAoK,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAGlQ,OAWjC,CAOO,SAAS+S,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoB5J,EAAGoH,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAOhK,EAAIgK,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAO9J,EAAIgK,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyBnK,EAAGoH,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoB5J,EAAGoH,EAAGgD,GACrDK,EAA4Bb,EAAoB5J,EAAGoH,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnB3U,KAAKsK,KAAKqK,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAK3K,IAAM4K,EAAG,GAAKD,EAAG,KACnE1U,KAAKC,MAAM0U,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CC9RO,MAAMsI,EASX,WAAA3P,CAAY4P,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA4I,CAAqCxM,EAAgBD,GACxB,OAAvB8D,KAAKF,cACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDhV,EACE,YAAYgV,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACd/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDhV,EACE,YAAYgV,uCAAiDC,6BAE/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBD,EAElC,IAAK,IAAI3C,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAC,CAA0CC,EAAoBC,GACjC,OAAvBlJ,KAAKF,cACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDhV,EACE,YAAYgV,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,KAE6B,OAAvB9I,KAAKF,eACd/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,iBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAY9I,KAAK0I,mBAAmBG,GAAa,GACvDhV,EACE,YAAYgV,uCAAiDC,6BAG/D9I,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE3D,MAAmB,GAA0B,cAAtB9I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,4CAA4CkV,EAAkB,cAC5DlH,EAAe,iBACD2B,EAAY,MAI9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBD,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAK,CACEhN,EACAD,EACAuJ,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxBtT,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBvJ,KAAKF,cACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClChV,EACE,YAAYgV,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAMiG,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,qDAAqDkV,EAAkB,cACrElH,EAAe,iBACD2B,EAAY,MAE9BrH,EAAe4M,KAAqBS,EAAkBC,EACtDvN,EAAe6M,GAAiBA,IAAoBS,CAAe,GAEtE,KAE6B,OAAvBxJ,KAAKF,eACd/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,eAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClChV,EACE,YAAYgV,2DAAqEW,0CAAwDC,OAE3IzJ,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcpO,OAC/C,IAAK,IAAI+P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMpP,KAAKC,KAAKgT,GAAa,EAAIO,GAAa,GAExCxT,KAAKC,KAAKsT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D/S,EACE,qDAAqDkV,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInCzK,EAAe4M,KACZrD,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjE/N,EAAe6M,GAAiBmB,KAC7BxE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aACd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcpO,OAC/C,IAAK,IAAI+P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMpP,KAAKC,KAAKgT,GAAa,EAAIO,GAAa,GAExCxT,KAAKC,KAAKsT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACA,IAAIf,EAAkB/I,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D/S,EACE,qDAAqDkV,EAAkB,cACrElH,EAAe,iBACD+E,EAAiB,MAInCzK,EAAe4M,KACZrD,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBlK,KAAK2D,IAAI9B,GAAcoI,GAAmB,EACjE/N,EAAe6M,GAAiBmB,KAC7BxE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACEvI,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIgD,EAA2B,GAC3BC,EAAoB,GACxBtT,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASiH,IAC5C,MAAMC,EAAoBvJ,KAAK0I,mBAAmBY,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMhD,EAAkBvG,KAAK2D,IAAI9B,GAAcpO,OACzC4W,EAAsBjP,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC4O,EAAsBlP,MAAMmL,GAAiB7K,KAAK,GAGxD,IAAK,MAAMmN,KAAe7I,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK0I,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMW,EAAkBJ,EAAyBP,GAC3CY,EAAUJ,EAAkBR,GAClChV,EACE,YAAYgV,2DAAqEW,0CAAwDC,OAI3I,MAAMc,EAAkBvK,KAAKkC,iBAAiB2G,GAAa2B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB5I,IAG1D,GAAI0I,EAAiB,CACnB,MAAMzH,EAAOyH,EAAgB,GAE7B,GAA2B,OAAvBvK,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/BjP,EACE,qDAAqD2P,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B8G,EAAoB9G,KAAegG,EAAkBC,EACrDY,EAAoB7G,GAAWA,IAAcgG,CACzD,MAAiB,GAA2B,OAAvBxJ,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI2J,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY,GAC1BkE,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY,GAC1BmE,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAG3D,IAiBI0J,EAjBArD,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAKCwG,EADW,IAATlH,GAAuB,IAATA,EACMpP,KAAKC,KAAKgT,GAAa,EAAIO,GAAa,GAExCxT,KAAKC,KAAKsT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAa,GACdsE,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAa,GACdsE,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBxJ,KAAKD,aAEd,IAAK,IAAIoK,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAAThH,GAEF4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,GAET4G,EAAcjE,EAAY0E,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAAThH,IAET4G,EAAc,EACdC,EAAclE,EAAY0E,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B3D,EAAenG,kBAAkByJ,EAAaC,GAC7EvJ,EAAgB2J,EAA6B3J,cAC7CC,EAAwB0J,EAA6B1J,sBACrDC,EAAwByJ,EAA6BzJ,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcpO,OAC/C,IAAK,IAAI+P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkB0F,GAAmB1I,EAAsBmD,GACxE0D,GAAajD,EAAkB8E,GAAmB1I,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkB0F,GAAmBzI,EAAsBkD,GACxE2D,GAAalD,EAAkB8E,GAAmBzI,EAAsBkD,GAE3E,CAGD,IAAIwG,EAEFA,EADW,IAATlH,GAAuB,IAATA,EACMpP,KAAKC,KAAKgT,GAAa,EAAIO,GAAa,GAExCxT,KAAKC,KAAKsT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBgD,EACrBhD,EAAiBiD,EACjBjD,GAAkBkD,EAClB,CACAQ,EAAoB1D,KACjBlB,EAAayE,GACdH,EACA5J,EAAcwG,GACd4C,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoBzD,GAAgBqD,KACjCvE,EAAayE,GACdH,EACA5J,EAAcwG,GACdxG,EAAc6J,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0BzE,EAAUwC,GAClDzU,EAAS,mDAGT,MAAMoP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B,MAAMiK,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAG5EC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzC/N,EAAe8O,GAAmBC,KAC/BvF,EAAamF,GACdhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYhS,OAAQyX,IAAoB,CAExF,MAAMnB,EAA+B3D,EAAenG,kBAClDwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GACzC/N,EAAe8O,GAAmBC,KAC/BvF,EAAamF,GACdnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAI1C,EACpCC,EACAxG,EACAyB,EACA7D,EACAC,GAkBF,OAdAoL,EAA0BhC,mCACxBhN,EACAD,EACAuJ,EACAC,EACArC,EACAY,EACAmC,GAIF+E,EAA0BxC,qCAAqCxM,EAAgBD,GAC/EjI,EAAS,iDAEF,CACLiI,iBACAC,iBAEJ,CAcO,SAASiP,GAA4BvJ,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcwE,QAAEA,IAEzF,MAAMnF,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DmE,EAAsBjP,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC4O,EAAsBlP,MAAMmL,GAAiB7K,KAAK,GAGlD2P,EAAMjQ,MAAMmL,GACZD,EAAmBlL,MAAMmL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkBlT,KAAKsK,IAAI2F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBlT,KAAKsK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IAAoB,CAExF,MAAMzK,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYoF,KAIRhE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbhE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAGnE,MACI,GAAsB,OAAlBnK,EAET,IAAK,IAAI+K,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAYhS,OAAQyX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,IAGxE5E,EAAmB+E,EAAInU,KAAKoU,GAAgBA,EAAc,KAG1DzE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAC/DI,EAAoBU,GAAiBd,IACnCvE,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAAzS,CAAY4P,EAAoBxG,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAAyL,CAAkCrP,EAAgBD,GACrB,OAAvB8D,KAAKF,cACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMpT,EAAQuK,KAAK0I,mBAAmBG,GAAa,GACnDhV,EAAS,YAAYgV,iCAA2CpT,2BAChEuK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBtT,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBtT,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvB/I,KAAKF,eACd/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMpT,EAAQuK,KAAK0I,mBAAmBG,GAAa,GACnDhV,EAAS,YAAYgV,iCAA2CpT,2BAChEuK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBtT,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtB/I,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAe4M,GAAmBtT,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAe1I,OAAQ0S,IACvDjK,EAAe6M,GAAiB5C,GAAY,EAG9CjK,EAAe6M,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAA0C,CAA2CxC,EAAoBC,GAClC,OAAvBlJ,KAAKF,cACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMpT,EAAQuK,KAAK0I,mBAAmBG,GAAa,GACnDhV,EAAS,YAAYgV,iCAA2CpT,2BAChEuK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBtT,CAAK,GAEvD,MAAmB,GAA0B,cAAtBuK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBtT,CAAK,GAE1C,IAEJ,KAE6B,OAAvBuK,KAAKF,eACd/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,GAAgD,kBAA5C7I,KAAK0I,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMpT,EAAQuK,KAAK0I,mBAAmBG,GAAa,GACnDhV,EAAS,YAAYgV,iCAA2CpT,2BAChEuK,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBtT,CAAK,GAEvD,MAAmB,GAA0B,cAAtBuK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D3P,EACE,sCAAsCkV,EAAkB,cACtDlH,EAAe,iBACD2B,EAAY,MAE9ByF,EAAmBF,GAAmB,EACtCG,EAAeH,GAAmBtT,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASiW,EACdxF,EACAwC,EACAnM,EACAoP,GAEA1X,EAAS,iDAGT,IAAI2X,EAAqB,EAAID,EArBA,IAsB7B9X,EAAS,uBAAuB+X,KAChC/X,EAAS,0BAA0B8X,KAGnC,MAAMtI,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE0E,EAAU3E,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAGJ,IAAK,IAAI/I,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B5L,SAAS,6CAGT,IAAI6V,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACEtP,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CACF,MAEI,GAAsB,OAAlBnK,EACP,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYhS,OAAQyX,IAAoB,CAExF,IAAInB,EAA+B3D,EAAenG,kBAChDwF,EAAYoF,GACZpF,EAAYyF,IAId,MAAMJ,EAAgB/D,EAA8B,CAClD3G,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDC,sBAAuByJ,EAA6BzJ,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAC5D1K,EAAgB2J,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACEtP,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACEvP,EAAe+J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,IAAIC,EAAoB1E,EAAiByE,GAGzC5O,EAAe6O,IACbY,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACFxP,EAAe6O,IACbW,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACdrX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,IAAIgB,EAAoB3E,EAAiB2D,GAGzC/N,EAAe8O,GAAmBC,KAC/BW,EACDlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFzP,EAAe8O,GAAmBC,IAChCU,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbxX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbxX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkCrP,EAAgBD,GAC5EjI,EAAS,+CAEF,CACLiI,iBACAC,iBAEJ,CAgBO,SAAS4P,GAA8BlK,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcwE,QACdA,EAAOrO,eACPA,EAAcoP,sBACdA,IAGA,MAAMlG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBqE,GACjDvH,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI0F,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBjP,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC4O,EAAsBlP,MAAMmL,GAAiB7K,KAAK,GAGlD2P,EAAMjQ,MAAMmL,GACZD,EAAmBlL,MAAMmL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DyE,EAAIzE,GAAkBlT,KAAKsK,IAAI2F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBlT,KAAKsK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIiE,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IAEpE,GAAsB,OAAlB/K,EAAwB,CAE1B5L,SAAS,6CAGT,IAAI6V,EAA+B3D,EAAenG,kBAAkBwF,EAAYoF,IAGhF,MAAMC,EAAgBtE,EAA8B,CAClDpG,cAAe2J,EAA6B3J,cAC5CC,sBAAuB0J,EAA6B1J,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBgE,EACvBf,EAA6B3J,cAGnD,IAAIyL,EAAiB,EACrB,IAAK,IAAIjF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACEtP,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IACvC3D,EAAiB2D,EAI5C,CAEP,MAAW,GAAsB,OAAlBnK,EACT,IAAK,IAAIoL,EAAmB,EAAGA,EAAmBzF,EAAYhS,OAAQyX,IAAoB,CAExF,MAAM9K,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYoF,GAAmBpF,EAAYyF,KAGxErE,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIsF,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAIlF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DiF,GACEtP,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GACzEkF,GACEvP,EAAe+J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAImE,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAC1DzE,EAAiByE,GAEzCT,EAAoBS,IAClBa,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAC,EAAoBiE,GACpBc,EACFD,EACElG,EAAamF,GACbnF,EAAawF,GACbrE,EACAO,EAAoB2D,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACCjG,EAAamF,GACZnF,EAAawF,GACbrE,EACAzG,EAAc2K,GACdrX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,GAClDpG,EAAamF,GACXnF,EAAawF,GACbrE,EACAzG,EAAc2K,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAlG,EAAamF,GACbnF,EAAawF,GACbrE,GACCC,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI9E,EACAgF,EACAzL,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GAEbxX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,EAAI,OACxDhF,EAAoBmD,GACtB0B,GACI9E,EACAiF,EACA1L,EAAc2K,GACdrF,EAAamF,GACbnF,EAAawF,GACbxX,KAAKC,KAAKkY,GAAkB,EAAIC,GAAkB,EAAI,OACxD1E,EAAoB6C,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIhG,EAUG,SAASiG,EAAiBC,EAAepG,EAAUwC,EAAoBtM,EAAU,CAAA,GAEtF,MAAMwO,EAAU3E,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkB5P,OACxC8Y,EAAcrG,EAASH,eA6H/B,SAAiCQ,EAAiBgG,GAEhDP,EAAY1K,eAAiBlG,MAAMmR,GAChC7Q,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACzCsQ,EAAY/C,mBAAqB7N,MAAMmL,GAAiB7K,KAAK,GAC7DsQ,EAAY9C,eAAiB9N,MAAMmL,GAAiB7K,KAAK,GACzDsQ,EAAYQ,qBAAuBpR,MAAMmL,GAAiB7K,KAAK,GAC/DsQ,EAAYzP,eAAiBnB,MAAMmL,GAAiB7K,KAAK,GACzDsQ,EAAYS,aAAerR,MAAMmR,GAAa7Q,KAAK,GACnDsQ,EAAYU,YAActR,MAAMmR,GAAa7Q,KAAK,GAGlDuQ,EAAaU,UAAY,EACzBV,EAAajG,WAAaO,EAC1B0F,EAAaW,mBAAqB,EAClCX,EAAa1F,gBAAkBnL,MAAMmR,GAAa7Q,KAAK,GACvDuQ,EAAaY,YAAc,EAG3B,MAAMC,EAAapZ,KAAKqK,IAAIwI,EAAiB,KAC7C0F,EAAac,qBAAuB3R,MAAM0R,GAAYpR,KAAK,GAC3DuQ,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBjP,MAAMmL,GACrC7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACzCwQ,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B1G,EAAiBgG,GAC1C,MAAMW,EAAqBxZ,KAAKqK,IAAIrK,KAAKyZ,KAAKzZ,KAAKC,KAAK4Y,IAAgBhG,EAAmC,EAAlBA,GACzF,OAAO2G,EAAqBX,CAC9B,CAhBoBa,CAAkB7G,EAAiBgG,GACrDH,EAAaiB,YAAcjS,MAAM6R,GAAWvR,KAAK,GACjD0Q,EAAakB,cAAgBlS,MAAM0R,GAAYpR,KAAK,GACpD0Q,EAAamB,SAAWnS,MAAM0R,GAAYpR,KAAK,GAC/C0Q,EAAaoB,UAAYpS,MAAM6R,GAAWvR,KAAK,EACjD,CA7JE+R,CAHwB7C,EAAQrE,gBAGSgG,GAGzCtY,EAAS,mCACTF,QAAQ2I,KAAK,iBAGb0J,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYoH,EAAQrE,gBAAiB/C,IAC3DwI,EAAY1K,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB5P,OAAQ+P,IACrEwI,EAAY/C,mBAAmBzF,GAAa,EAC5CwI,EAAY9C,eAAe1F,GAAa,EAI1C,IAAIkK,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIjF,EACvCC,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC7C,EACAxC,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX2N,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI1F,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB5P,OAAQ+P,IACrEwI,EAAYQ,qBAAqBhJ,GAAa,EAGhDyI,EAAajG,WAAaE,EAAS7C,kBAAkB5P,OACrDwY,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIhL,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEoK,EAAa1F,gBAAgB1E,GAAgB+I,EAAQrE,gBAIvD0F,EAAa0B,sBAAwBvR,EAAQG,eAC7C0P,EAAaN,sBAAwBvP,EAAQuP,sBAkM/C,SAA6BzF,EAAU0E,EAASO,EAA2BmB,GAEzE,MAAMvG,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkB5P,OAC7CqZ,EAAapZ,KAAKqK,IAAIwI,EAAiB0F,EAAac,qBAAqBtZ,QAC/E,IAaIma,EAbAC,EAAmBzS,MAAMwP,EAAQrE,iBAAiB7K,KAAK,GACvDoS,EAAiB1S,MAAMwP,EAAQrE,iBAAiB7K,KAAK,GACrDqS,EAAa3S,MAAM0R,GAAYpR,KAAK,GACpCsS,EAAkB5S,MAAM0R,GAAYpR,KAAK,GACzCuS,EAAqB7S,MAAM0R,GAAYpR,KAAK,GAC5CwS,EAAe9S,MAAM0R,GAAYpR,KAAK,GACtCyS,EAAc/S,MAAM0R,GAAYpR,KAAK,GACrC0S,EAAchT,MAAM0R,GACrBpR,OACAxE,KAAI,IAAMkE,MAAM0R,GAAYpR,KAAK,KAChC2S,EAAejT,MAAMmL,GAAiB7K,KAAK,GAC3C4S,EAAkBlT,MAAMmL,GAAiB7K,KAAK,GAC9C6S,EAAsBnT,MAAMmL,GAAiB7K,KAAK,GAGlD8S,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI3I,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D6K,EAAa7K,GAAa,EAC1B8K,EAAgB9K,GAAa,EAG/B,GAAwC,IAApCyI,EAAaW,mBAA0B,CAEzC,IAAK,IAAIpJ,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3D+K,EAAoB/K,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI8M,EAAsB5I,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBqF,EAAa1F,gBAAgBoI,GAC9C/H,IACA,CACA,IAAImC,EAAkBiD,EAAY1K,eAAeqN,GAAqB/H,GACrB,IAA7C2H,EAAoBxF,EAAkB,KACxCwF,EAAoBxF,EAAkB,GAAK,EAC3CiD,EAAY1K,eAAeqN,GAAqB/H,IAC7CoF,EAAY1K,eAAeqN,GAAqB/H,GAEtD,CACF,CACF,CAEDqF,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAIrb,EAAI,EAAGA,EAAIsZ,EAAYtZ,IAC9B,IAAK,IAAIqK,EAAI,EAAGA,EAAIiP,EAAYjP,IAC9BuQ,EAAYvQ,GAAGrK,GAAK,EAIxB,OAAa,CAEX,IAAIsb,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBpG,IACpCmG,EAAYC,sBACZ2C,EAAYG,EAA4B/I,EAAU0E,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa1F,gBAAgB2I,EAAiB,GAChEF,EAAoB/C,EAAa1F,gBAAgB2I,EAAiB,GAElE,IAAK,IAAItI,EAAiB,EAAGA,EAAiBoI,EAAmBpI,IAAkB,CACjF,IACIuI,EAqBAC,EAtBArG,EAAkBiD,EAAY1K,eAAe4N,EAAiB,GAAGtI,GAGrE,GAAoB,IAAhBgI,EACFA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,MACzC,CACL,IAAKoG,EAAc,EAAGA,EAAcP,GAC9Blb,KAAKsK,IAAI+K,KAAqBrV,KAAKsK,IAAIoO,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBjH,GAAkBgI,EACnCxC,EAAakB,cAAcsB,EAAc,GAAK7F,IAE9C8E,EAAiBjH,GAAkBuI,EAAc,EACjD/C,EAAakB,cAAc6B,GAAepG,EAE7C,CAGD,GAAiB,IAAb8F,EACFA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,MACtB,CACL,IAAKqG,EAAW,EAAGA,EAAWP,GACxBnb,KAAKsK,IAAI+K,KAAqBrV,KAAKsK,IAAI+P,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAelH,GAAkBiI,EACjCd,EAAWc,EAAW,GAAK9F,IAE3B+E,EAAelH,GAAkBwI,EAAW,EAC5CrB,EAAWqB,GAAYrG,EAE1B,CACF,CAED,GAAI8F,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADA5Y,EAAS,sCAIX,IAAK,IAAImb,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAIrG,EAAkBgF,EAAWqB,GACjC,GAAIrG,EAAkB,EAAG,CACvBiF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoBjc,KAAKsK,IAAI+K,GAC6B,IAA1DiD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5C7G,EAAkBrV,KAAKsK,IAAI+P,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACbzb,KAAKsK,IAAIoO,EAAakB,cAAc6B,MAClCpG,IAAiBqF,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBpG,EAAe,CACxF,GAA6B,IAAzByJ,EAEF,YADAtb,EAAS,oCAIX,IAAI2b,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAIpc,KAAKsK,IAAI+R,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5Dtc,KAAKsK,IAAIkS,GAAaxc,KAAKsK,IAAI+R,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBzc,KAAKsK,IAAI+P,EAAW8B,EAAgB,IAC9DjC,EAAyBla,KAAKsK,IAAIoO,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqB1c,KAAKsK,IAAI+R,GAEjF,IAAK,IAAIvM,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IACvDA,GAAa2M,GAAqB9B,EAAa7K,KAC/CA,GAAaoK,GAAwBU,EAAgB9K,KAS3D,GANI9P,KAAKsK,IAAI+R,GAAc,OACzB7b,EACE,2DAA2DgY,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiB5c,KAAKsK,IAAI+P,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiB5c,KAAKsK,IAAI+P,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAI7c,EAAI,EAAGA,EAAIqb,EAAUrb,IAC5B4Y,EAAaoB,UAAUiB,EAAiBjb,EAAI,GAAK2a,EAAY3a,GAE/Dib,GAAkBI,EAElB,IAAK,IAAIrb,EAAI,EAAGA,EAAIqb,EAAUrb,IAC5B4Y,EAAaoB,UAAUiB,EAAiBjb,EAAI,GAAKua,EAAWva,GAE9Dib,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAIjb,EAAI,EAAGA,EAAIob,EAAapb,IAC/B4Y,EAAaiB,YAAYmB,EAAmB,EAAIhb,GAAK4Y,EAAamB,SAAS/Z,GAE7Egb,GAAoBI,EAEpB,IAAK,IAAIpb,EAAI,EAAGA,EAAIob,EAAapb,IAC/B4Y,EAAaiB,YAAYmB,EAAmB,EAAIhb,GAAK4Y,EAAakB,cAAc9Z,GAElFgb,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBpG,EAAe,SAsBrE,GApBA6H,EAAyBla,KAAKsK,IAAIoO,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBzc,KAAKsK,IAAI+P,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqB1c,KAAKsK,IAAI+R,GAEjF3D,EAAamB,SAAS,GAAK,EACvB7Z,KAAKsK,IAAI+R,GAAc,OACzB7b,EACE,2DAA2DgY,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACf9Y,EAAS,0CAA0C2a,KAGrDgC,EAAwBhC,GACxB,KACD,CACF,CACH,CA1jBEiC,CAAoBvK,EAAU0E,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI9I,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB5P,OAAQ+P,IACrEwI,EAAYzP,eAAeiH,GAAayI,EAAac,qBAAqBvJ,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB5P,OAAQ+P,IACtC,OAA3B0C,EAASpG,cAEXjM,EACE,GAAGwP,EAAkBG,GAAWkN,cAAc,OAAO1E,EAAYzP,eAC/DiH,GACAkN,cAAc,MAIlB7c,EACE,GAAGwP,EAAkBG,GAAWkN,cAAc,OAAOzM,EAAkBT,GAAWkN,cAChF,OACI1E,EAAYzP,eAAeiH,GAAWkN,cAAc,MAKhE3c,QAAQmK,QAAQ,iBAChBjK,EAAS,8BAET,MAAQoP,kBAAmBsN,EAAa1M,kBAAmB2M,GAAgB1K,EAC3E,MAAO,CACL3J,eAAgByP,EAAYzP,eAAejF,MAAM,EAAG0O,GACpD6K,iBAAkB,CAChBxN,kBAAmBsN,EACnB1M,kBAAmB2M,GAGzB,CAqEA,SAAS3B,EAA4B/I,EAAU0E,EAASO,EAA2BmB,GACjF,MAAMzK,EAAeqK,EAAYC,oBAAsB,EAGvD,GAAItK,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADA7R,EAAS,sCAAsC2N,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMsE,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtEzK,eACA8B,IAAKqI,EAAY1K,eACjB4E,WACAE,eAAgBA,EAChBwE,UAEArO,eAAgB0P,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8B1V,MAAMwP,EAAQrE,iBAC7C7K,OACAxE,KAAI,IAAMkE,MAAMwP,EAAQrE,iBAAiB7K,KAAK,KAC7CqV,EAAyB3V,MAAMwP,EAAQrE,iBAAiB7K,KAAK,GAGjE,GAAI4Q,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMnI,KAAe3C,EAAShE,iBACjC,GACqE,eAAnEiJ,EAA0BzC,mBAAmBG,KAAe,IAC5D3C,EAAShE,iBAAiB2G,GAAaoI,MAAK,EAAExG,EAAsBC,KAAOD,IAAyB5I,IACpG,CACAmP,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMvL,YAAEA,EAAWC,aAAEA,GAAiBkF,EAChCnL,EAAS0L,EAA0Bf,wCACvCvI,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF0K,EAA8BrR,EAAO4K,oBACrC0G,EAAyBtR,EAAO6K,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQrE,gBAAiB2K,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQrE,gBAAiB4K,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIvK,EAAiB,EAAGA,EAAiBgE,EAAQrE,gBAAiBK,IAAkB,CACvF,MAAMmC,EAAkBsC,EAAIzE,GAAkB,EAC9CoF,EAAYQ,qBAAqBzD,IAC/BuB,EAAoB1D,GAAkBmK,EAAuBnK,EAChE,CAED,OAAO,CACT,CA0YA,SAAS4J,EAAwBhC,GAC/B,IAAK,IAAIhL,EAAY,EAAGA,EAAYyI,EAAajG,WAAYxC,IAC3DyI,EAAac,qBAAqBvJ,GAAawI,EAAY9C,eAAe1F,GAG5E,IAAK,IAAI4N,EAAiB,EAAGA,GAAkBnF,EAAajG,WAAYoL,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyBla,KAAKsK,IAAIoO,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqBrZ,KAAKsK,IAAIoO,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACf9Y,EAAS,oDAAoD2a,IACjE,CC3sBO,SAAS8C,GAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZjV,GAAY,EACZC,EAAa,EACb8G,EAAS,GACThH,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAASkV,EAGlD,IAAIxL,EAAawL,EAAQtL,SAAS7C,kBAAkB5P,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIwS,EAAYxS,IAC9B+P,EAAO/P,GAAK,EACZ+I,EAAe/I,GAAK,EAQtB,IAJIge,EAAQE,iBAAmBF,EAAQE,gBAAgBje,SAAWuS,IAChEzJ,EAAiB,IAAIiV,EAAQE,kBAGxBjV,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAIhJ,EAAI,EAAGA,EAAI+I,EAAe9I,OAAQD,IACzC+I,EAAe/I,GAAKqI,OAAOU,EAAe/I,IAAMqI,OAAO0H,EAAO/P,IAIhE,GAA6B,YAAzBge,EAAQvV,aAA4B,CAOtCsH,EANsB8I,EACpBN,EACAyF,EAAQtL,SACRsL,EAAQ9I,mBACR,CAAEnM,iBAAgBoP,sBAAuB6F,EAAQ7F,wBAE5BpP,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmBoV,EACpCC,EAAQtL,SACRsL,EAAQ9I,mBACRnM,EACAiV,EAAQ7F,wBAKVpI,EAD2BvH,EAAkBwV,EAAQvV,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALAkV,EAAYpe,EAAckQ,GAG1BtP,EAAS,4BAA4BwI,EAAa,mBAAmBgV,EAAUf,cAAc,MAEzFe,GAAanV,EACfE,GAAY,OACP,GAAIiV,EAAY,IAAK,CAC1Bvd,EAAS,uCAAuCud,KAChD,KACD,CAEDhV,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAMwV,GAYX,WAAA7Y,CACE4P,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAEA9R,KAAK0I,mBAAqBA,EAC1B1I,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK4R,mBAAqBA,EAC1B5R,KAAK6R,mBAAqBA,EAC1B7R,KAAK8R,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkCrP,EAAgBD,GAChD,MAAM6V,EAAY5V,EAAe1I,OACjC,IAAIue,GAAgB,EAEpB,GAA2B,OAAvBhS,KAAKF,gBACP/J,OAAO6S,KAAK5I,KAAK0I,oBAAoBrG,SAASwG,IAC5C,MAAMoJ,EAASjS,KAAK0I,mBAAmBG,GAAa,GAEpD,GAAe,eAAXoJ,EACFD,GAAgB,EAEhBne,EAAS,YAAYgV,uDAChB,GAAe,qBAAXoJ,EAA+B,CACxC,MAAMC,EAASlS,KAAK0I,mBAAmBG,GAAa,GAC9CsJ,EAASnS,KAAK0I,mBAAmBG,GAAa,GACpDhV,EACE,YAAYgV,8CAAwDqJ,QAAaC,MAEnFnS,KAAKkC,iBAAiB2G,GAAaxG,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvClV,EACE,0CAA0CkV,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAeiW,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAekW,GAAMjM,GAAY,EAEnCjK,EAAekW,GAAMA,GAAQ,EAG7BjW,EAAekW,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAemW,GAAMlM,GAAY,EAEnCjK,EAAemW,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBrS,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMuF,EAAkB/I,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD4O,EAAOrJ,EACPsJ,EAAOrS,KAAK4R,mBAAqB7I,EACvClV,EACE,0CAA0CkV,EAAkB,cAC1DlH,EAAe,iBACD2B,EAAY,MAG9BrH,EAAeiW,GAAQF,EACvB,IAAK,IAAI/L,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAekW,GAAMjM,GAAY,EAEnCjK,EAAekW,GAAMA,GAAQ,EAG7BjW,EAAekW,GAAQF,EACvB,IAAK,IAAIhM,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAemW,GAAMlM,GAAY,EAEnCjK,EAAemW,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAItS,KAAK4R,mBACtB,IAAK,IAAIzL,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAeoW,GAAMnM,GAAY,EAEnCjK,EAAeoW,GAAMA,GAAQ,EAC7BnW,EAAemW,GAAQ,EACvBze,EAAS,sEACV,CAEJ,EC8JH,SAAS0e,GACPC,EACAtM,EACAzG,EACAyP,EACAuD,EACAC,EACAtM,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClDtK,EAAkBL,EAASvC,IAAIuL,GAAgBzb,OAErD,GAAwB,IAApB8S,EAAuB,CAoBzB,MAAMoM,EAAa/K,EAAyB6K,EAAoBC,EAlBjD,CACb,CACErP,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIyD,EAAWhL,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOmd,GACLJ,EACAtM,EACAzG,EACAyP,EACAyD,EAAWzS,IACXyS,EAAWxS,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMoM,EAAa/K,EAAyB6K,EAAoBC,EAlBjD,CACb,CACErP,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,IAEtD,CACE7L,EAAkB6C,EAASvC,IAAIuL,GAAgB,GAAK,GACpDjL,EAAkBiC,EAASvC,IAAIuL,GAAgB,GAAK,MAIxD,GAAIyD,EAAWhL,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOmd,GACLJ,EACAtM,EACAzG,EACAyP,EACAyD,EAAWzS,IACXyS,EAAWxS,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOlS,MAAO,KACjC,CAaA,SAASmd,GAAsBJ,EAAOtM,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAM7J,EAAiBkD,EAAOlD,eACxBgK,EAAkBL,EAASvC,IAAI9B,GAAcpO,OAInD,IAGIof,EAHAzS,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/CyS,EADEzX,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIuW,EAA6B,EACjC,IAAK,IAAIlM,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkM,GACED,EAAM3M,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOkM,CACT,CASA,SAASC,GAAmBtV,EAAGoH,EAAGmO,GAChC,IAAIrL,GAAS,EACb,IAAK,IAAInU,EAAI,EAAGA,EAAIwf,EAASvf,OAAQD,IAAK,CACxC,OAAQyf,EAAIC,IAAMC,EAAIC,IAAOJ,EAASxf,GACpB0f,EAAKrO,GAAMuO,EAAKvO,GAAKpH,GAAM0V,EAAKF,IAAOpO,EAAIqO,IAAQE,EAAKF,GAAMD,IACjEtL,GAAUA,EAC1B,CACD,OAAOA,CACT,kBC/aO,MACL,WAAA7O,GACEkH,KAAKqT,aAAe,KACpBrT,KAAK4F,WAAa,GAClB5F,KAAK0I,mBAAqB,GAC1B1I,KAAK/D,aAAe,UACpB+D,KAAKsT,qBAAuB,KAC5Bnf,EACE,0PAEFF,EAAS,kCACV,CAOD,eAAAsf,CAAgBF,EAAcjX,EAAU,IACtC4D,KAAKqT,aAAeA,EACpBlf,EAAQ,sEAG8B6D,IAAlCoE,GAASkX,uBACXtT,KAAKsT,qBAAuBlX,EAAQkX,qBACpCzf,EAAS,kCAGoBmE,IAA3BoE,GAASC,gBACX2D,KAAK3D,cAAgBD,EAAQC,cAC7BxI,EAAS,wBAAwBmM,KAAK3D,uBAEbrE,IAAvBoE,GAASE,YACX0D,KAAK1D,UAAYF,EAAQE,UACzBzI,EAAS,oBAAoBmM,KAAK1D,cAGpCzI,EAAS,uBAAuBwf,IACjC,CAGD,cAAAG,CAAeC,EAAarX,EAAU,IACpC4D,KAAKuT,gBAAgBE,EAAarX,EACnC,CAED,aAAAsX,CAAc9N,GACZ5F,KAAK4F,WAAaA,EAClB/R,EAAS,mCAAmC+R,EAAW9F,gBACxD,CAED,oBAAA6T,CAAqB9K,EAAa+K,GAChC5T,KAAK0I,mBAAmBG,GAAe+K,EACvC/f,EAAS,0CAA0CgV,YAAsB+K,EAAU,KACpF,CAED,eAAAC,CAAgB5X,GACd+D,KAAK/D,aAAeA,EACpBpI,EAAS,wBAAwBoI,IAClC,CAOD,KAAA6X,CAAM1X,EAAU,IACT4D,KAAKqT,cAAiBrT,KAAK4F,YAAe5F,KAAK0I,oBAClDxU,EAAS,8EAYX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjBmV,EAAkB,GAGtBzd,EAAS,qBACT,MAAMiS,EAAWP,EAAY3F,KAAK4F,YAClC3R,EAAS,8BAGT,MAAM4c,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHAhQ,EAAS,gCACTF,QAAQ2I,KAAK,oBACbzI,EAAS,gBAAgB+L,KAAKqT,gBACJ,yBAAtBrT,KAAKqT,aAEP,GAA0B,YAAtBrT,KAAK/D,aAA4B,CAMnCM,EALsB8P,EACpBjB,EACAlF,EACAlG,KAAK0I,oBAEwBnM,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmBwO,EAA0BzE,EAAUlG,KAAK0I,qBAK/EnM,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,cACrC,MACI,GAA0B,2BAAtByD,KAAKqT,aAA2C,CAEzD,IAAI1H,EAAwB,EAC5B,MAAMoI,EAA2B,EAG3BvC,EAAU,CACdtL,SAAUA,EACVwC,mBAAoB1I,KAAK0I,mBACzBiD,sBAAuBA,EACvB1P,aAAc+D,KAAK/D,aACnByV,kBAEArV,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,WAGvC,KAAOqP,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5BpP,EAAe9I,OAAS,IAC1B+d,EAAQE,gBAAkB,IAAInV,IAIhC,MAAMyX,EAAsB1C,GAAc5F,EAA6B8F,GAGvEtV,EAAiB8X,EAAoB9X,eACrCC,EAAiB6X,EAAoB7X,eACrCI,EAAiByX,EAAoBzX,eAGrCoP,GAAyB,EAAIoI,CAC9B,CACP,MAAW,GAA0B,yBAAtB/T,KAAKqT,aAEd,GAA0B,YAAtBrT,KAAK/D,aACP/H,EACE,uGAEG,GAEFgI,iBAAgBC,kBCvKpB,SAAmC+J,EAAUwC,EAAoB4K,GACtErf,EAAS,gDAGT,MAAMoP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGE7I,EAAEA,EAAC4W,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMb,EAGjB1I,EAAU3E,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEqE,EAEJ,GAAsB,OAAlB9K,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBlT,KAAKsK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIuD,EAAkB,EAAGA,EAAkB1E,EAAYhS,OAAQ0W,IAAmB,CAErF,MAAM/J,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY0E,KAIRtD,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAI6N,EAAS,EACb,IAAK,IAAI5gB,EAAI,EAAGA,EAAI+S,EAAiB/S,IACnC4gB,GAAU/Q,EAAkBiD,EAAiB9S,IAAM4M,EAAc5M,GAInE,MAAM6gB,EAAIhX,EAAE+W,GACN9W,EAAI2W,EAAEG,GACN5T,EAAI0T,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIrJ,EAAkB,EAAGA,EAAkBxE,EAAiBwE,IAAmB,CAClF,MAAMwJ,EAAmBjO,EAAiByE,GAG1C5O,EAAeoY,IACb7O,EAAayE,GAAmBtD,EAAcyN,EAAIlU,EAAc2K,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB1D,EAAiB0D,IAAmB,CAClF,MAAMC,EAAmB5D,EAAiB2D,GAG1C/N,EAAeqY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACAwN,EACAvN,EAAoBiE,GACpBjE,EAAoBmD,GAGtB/N,EAAeqY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACAvJ,EACAwJ,EAAoBmD,GACpB7J,EAAc2K,GAGhB7O,EAAeqY,GAAkBrK,IAC/BxE,EAAayE,GACbtD,EACArG,EACAJ,EAAc2K,GACd3K,EAAc6J,EACjB,CACF,CACF,CACF,KAC0B,OAAlBnK,GACT5L,EAAS,0EAkBX,OAbkC,IAAIqX,EACpC7C,EACAxG,EACAyB,EACA7D,EACAC,GAIwByL,kCAAkCrP,EAAgBD,GAE5EjI,EAAS,8CAEF,CACLiI,iBACAC,iBAEJ,CDsC8CqY,CACpCtO,EACAlG,KAAK0I,mBACL1I,KAAKsT,uBAOP/W,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,cACrC,MACI,GAA0B,uBAAtByD,KAAKqT,aAAuC,CAErD,MAAMoB,EEnKL,SAAoCvO,EAAUwC,GACnDzU,EAAS,6CAGT,MAAMoP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACF5L,EAAS,2CAEU,cAAjB6L,GACF7L,EAAS,wFAIX,MAAM0d,EAAqB5L,EAYrB0O,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/B5C,EAAkB,IAAIjd,IACtB8f,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAI/S,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAIgT,EAAc,EAAGA,EAAcH,EAAmBjhB,OAAQohB,IAAe,CAChF,MAAMC,EAAenR,EAAI9B,GAAc6S,EAAmBG,IAAgB,EACrE/C,EAAgBiD,IAAID,KACvBhD,EAAgBha,IAAIgd,EAAcF,GAClCD,EAAoB3S,KAAK8S,GACzBF,IAEH,CAEH,MAAM/C,EAAqB+C,EACrB7C,EAAY,EAAIH,EAAqBC,EAE3Che,EACE,uBAAuB+d,0BAA2CC,0BAA2CE,gBAI/G,IAAI5V,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAIsH,EAAY,EAAGA,EAAYuO,EAAWvO,IAAa,CAC1DrH,EAAeqH,GAAa,EAC5BtH,EAAe8F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW4L,EAAW5L,IAC3CjK,EAAesH,GAAW2C,GAAY,CAEzC,CAGD,MAAM6O,EAAyB,IAAInV,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEVkV,EAAyB,IAAIpV,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIqT,EAAsB,GAC1B,IAAK,IAAItO,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEsO,EAAoBtO,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAIuO,EAAuB,GAC3B,IAAK,IAAIvO,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAMkO,EAAenR,EAAI9B,GAAc6S,EAAmB9N,IAAmB,EAC7EuO,EAAqBvO,GAAkBkL,EAAgB1Y,IAAI0b,EAC5D,CAGD,IAAK,IAAIjK,EAAmB,EAAGA,EAAmBpF,EAAYhS,OAAQoX,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmBzF,EAAYhS,OAAQyX,IAAoB,CAExF,MAAMkK,EAAuCJ,EAAuB/U,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRmK,EAAuCJ,EAAuBhV,kBAClEwF,EAAYoF,GACZpF,EAAYyF,IAIRJ,EAAgB/D,EAA8B,CAClD3G,cAAegV,EAAqChV,cACpDC,sBAAuB+U,EAAqC/U,sBAC5DC,sBAAuB8U,EAAqC9U,sBAC5D+C,oBACAY,oBACAqC,iBAAkB4O,EAClB3O,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB0D,EAG5DwK,EAAe5P,EAAamF,GAAoBnF,EAAawF,GAAoBrE,EAGvF,IAAK,IAAIkE,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAIwK,EAAcL,EAAoBnK,GAClCyK,EAAQD,EACRE,EAAQ7D,EAAqB2D,EAEjC,IAAK,IAAItL,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAIyL,EAAcR,EAAoBjL,GAClC0L,EAAQD,EACRE,EAAQhE,EAAqB8D,EAG7BG,EA9DH,GA+DEP,GAEAxO,EAAoBiE,GAAmBjE,EAAoBmD,GAC1D7C,EAAoB2D,GAAmB3D,EAAoB6C,IAG/D/N,EAAesZ,GAAOG,IAAUE,EAChC3Z,EAAeuZ,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAIxD,EAAO,EAAIV,EAAqBuD,EAAqBW,GAErDC,EACFT,EACAD,EAAqCjV,cAAc0V,GACnDhP,EAAoBiE,GAElBiL,EACFV,EACAD,EAAqCjV,cAAc0V,GACnD1O,EAAoB2D,GAGtB7O,EAAesZ,GAAOlD,IAASyD,EAG/B7Z,EAAeuZ,GAAOnD,IAAS0D,EAG/B9Z,EAAeoW,GAAMkD,KAAWO,EAChC7Z,EAAeoW,GAAMmD,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAIrE,GACjCjJ,EACAxG,EACAyB,EACA7D,EACAC,EACA6R,EACAC,EACAC,GAGqBtG,kCAAkCrP,EAAgBD,GACzEjI,EAAS,2CAEF,CACLiI,iBACAC,iBACAyV,qBACAC,qBACA8C,sBAEJ,CFpDiCsB,CAA2B/P,EAAUlG,KAAK0I,oBACrExM,EAAiBuY,EAAmBvY,eACpCC,EAAiBsY,EAAmBtY,eAMpCI,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,eAGpCyD,KAAKkW,sBAAwB,CAC3BtE,mBAAoB6C,EAAmB7C,mBACvCC,mBAAoB4C,EAAmB5C,mBACvC8C,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHA5gB,QAAQmK,QAAQ,oBAChBjK,EAAS,6BAEF,CAAEsI,iBAAgBsU,mBAC1B,CAQD,gBAAMsF,CAAW3X,EAAepC,EAAU,IACnC4D,KAAKqT,cAAiBrT,KAAK4F,YAAe5F,KAAK0I,oBAClDxU,EAAS,mFAGX,IAAIgI,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBtI,EAAS,qBACT,MAAMiS,EAAWP,EAAY3F,KAAK4F,YAClC3R,EAAS,8BACT,MAAM4c,EAAmB,CACvBxN,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJAhQ,EAAS,gCACTF,QAAQ2I,KAAK,oBAEbzI,EAAS,iBAAiB+L,KAAKqT,gBACL,yBAAtBrT,KAAKqT,iBACJnX,iBAAgBC,kBAAmBwO,EAA0BzE,EAAUlG,KAAK0I,qBAErD,eAAtB1I,KAAK/D,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHA1J,QAAQmK,QAAQ,oBAChBjK,EAAS,6BAEF,CAAEsI,iBAAgBsU,mBAC1B,qBGtQI,MAKL,WAAA/X,GACEkH,KAAKvB,OAAS,KACduB,KAAKoW,UAAY,KACjBpW,KAAKqW,SAAU,EAEfrW,KAAKsW,aACN,CAOD,iBAAMA,GACJ,IACEtW,KAAKvB,OAAS,IAAIC,OAAO,IAAIC,IAAI,qBAAsB,oBAAAC,UAAA,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAA,oBAAAJ,SAAAC,SAAAG,KAAAJ,SAAAK,eAAA,WAAAL,SAAAK,cAAAC,QAAAC,eAAAP,SAAAK,cAAAG,KAAA,IAAAT,IAAA,mBAAAC,SAAAS,SAAAL,MAAkB,CACvEjI,KAAM,WAGRiJ,KAAKvB,OAAO8X,QAAWC,IACrBziB,QAAQ4E,MAAM,iCAAkC6d,EAAM,EAExD,MAAMC,EAAgBnX,EAAaU,KAAKvB,QAExCuB,KAAKoW,gBAAkB,IAAIK,EAE3BzW,KAAKqW,SAAU,CAChB,CAAC,MAAO1d,GAEP,MADA5E,QAAQ4E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAM+d,GACJ,OAAI1W,KAAKqW,QAAgBpe,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAASye,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACI5W,KAAKqW,QACPne,IACS0e,GANO,GAOhBD,EAAO,IAAIhhB,MAAM,2CAEjBmhB,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAMrD,CAAeC,GAEnB,aADMzT,KAAK0W,eACJ1W,KAAKoW,UAAU5C,eAAeC,EACtC,CAOD,mBAAMC,CAAc9N,GAElB,aADM5F,KAAK0W,eACJ1W,KAAKoW,UAAU1C,cAAc9N,EACrC,CAQD,0BAAM+N,CAAqB9K,EAAa+K,GAEtC,aADM5T,KAAK0W,eACJ1W,KAAKoW,UAAUzC,qBAAqB9K,EAAa+K,EACzD,CAOD,qBAAMC,CAAgB5X,GAEpB,aADM+D,KAAK0W,eACJ1W,KAAKoW,UAAUvC,gBAAgB5X,EACvC,CAMD,WAAM6X,SACE9T,KAAK0W,eACOK,YAAYC,MAC9B,MAAMvX,QAAeO,KAAKoW,UAAUtC,QAEpC,OADgBiD,YAAYC,MACrBvX,CACR,CAMD,kBAAMwX,GAEJ,aADMjX,KAAK0W,eACJ1W,KAAKoW,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADMlX,KAAK0W,eACJ1W,KAAKoW,UAAUc,MACvB,CAKD,SAAAtX,GACMI,KAAKvB,SACPuB,KAAKvB,OAAOmB,YACZI,KAAKvB,OAAS,KACduB,KAAKoW,UAAY,KACjBpW,KAAKqW,SAAU,EAElB,uBChJuBlY,MAAOgZ,IAC/B,IAAI1X,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClBwG,mBAAoB,GACpBtG,kBAAmB,CAAE,EACrBgV,MAAO,EACPC,OAAO,EACPC,SAAU,IACVhU,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAM4V,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNzgB,KAAK0gB,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnBjS,EAAa,EACbkS,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAEnM,YAAa,GACrCoM,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAMhkB,QAAQ,CAC/B,MAAMylB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACFtY,EAAO2X,MAAQgC,WAAWD,EAAM,IAChC1Z,EAAO4X,MAAqB,MAAb8B,EAAM,GACrB1Z,EAAO6X,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAMzV,EAAY+W,SAASF,EAAM,GAAI,IAC/B5W,EAAM8W,SAASF,EAAM,GAAI,IAC/B,IAAItjB,EAAOsjB,EAAM7hB,MAAM,GAAGyE,KAAK,KAAKud,QAAQ,SAAU,IAEtD7Z,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWzM,QAC/C,MAGI,GAAgB,aAAZkiB,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbU,OAAQF,SAASF,EAAM,GAAI,IAC3B3B,OAAQ6B,SAASF,EAAM,GAAI,IAC3BK,SAAUH,SAASF,EAAM,GAAI,IAC7BM,QAASJ,SAASF,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAaU,SAAQT,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAMvW,EAAM8W,SAASF,EAAM,GAAI,IACzBO,EAAcL,SAASF,EAAM,GAAI,IACjCQ,EAAWR,EAAM7hB,MAAM,EAAG,EAAIoiB,GAAaxiB,KAAKqD,GAAM8e,SAAS9e,EAAG,MACxEgd,EAAkBC,OAAOjV,GAAOoX,EAChCX,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaW,WAAUV,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBoB,SAASF,EAAM,GAAI,IACtCnT,EAAaqT,SAASF,EAAM,GAAI,IAChC1Z,EAAO4D,kBAAoB,IAAIjI,MAAM4K,GAAYtK,KAAK,GACtD+D,EAAOwE,kBAAoB,IAAI7I,MAAM4K,GAAYtK,KAAK,QACjD,GAAIwc,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjByB,IAAKP,SAASF,EAAM,GAAI,IACxB5W,IAAK8W,SAASF,EAAM,GAAI,IACxBU,WAAYR,SAASF,EAAM,GAAI,IAC/Bf,SAAUiB,SAASF,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAI7d,KAAK4e,EAGZ,GAFAd,EAASrW,KAAKqX,SAAS9e,EAAG,KAC1B+d,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAM0B,EAAUzB,EAASE,GAA4B,EACrD9Y,EAAO4D,kBAAkByW,GAAWV,WAAWD,EAAM,IACrD1Z,EAAOwE,kBAAkB6V,GAAWV,WAAWD,EAAM,IACrD1Z,EAAO6D,cACP7D,EAAOyE,cACPqU,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBa,SAASF,EAAM,GAAI,IACzBE,SAASF,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoBnM,YAC7EmM,EAAsB,CACpBkB,IAAKP,SAASF,EAAM,GAAI,IACxB5W,IAAK8W,SAASF,EAAM,GAAI,IACxBY,YAAaV,SAASF,EAAM,GAAI,IAChC5M,YAAa8M,SAASF,EAAM,GAAI,KAGlC1Z,EAAOkC,aAAa+W,EAAoBqB,cACrCta,EAAOkC,aAAa+W,EAAoBqB,cAAgB,GAAKrB,EAAoBnM,YAEpFoM,EAA2B,OACtB,GAAIA,EAA2BD,EAAoBnM,YAAa,CACrE,MAAMyN,EAAcb,EAAM7hB,MAAM,GAAGJ,KAAKsG,GAAM6b,SAAS7b,EAAG,MAG1D,IAAIyc,EAAcvB,EAAoBnW,IACtC,GAAgC,IAA5BmW,EAAoBkB,IAAW,CACjC,MAAMM,EAAS3C,EAAkBC,OAAOkB,EAAoBnW,KACxD2X,GAAUA,EAAOzmB,OAAS,IAAGwmB,EAAcC,EAAO,GACvD,CAEuC,IAApCxB,EAAoBqB,aAAyD,IAApCrB,EAAoBqB,aAC1DnB,EAAsBqB,KAAcrB,EAAsBqB,GAAe,IAC9ErB,EAAsBqB,GAAajY,KAAKgY,GAEnCva,EAAO2C,kBAAkB6X,KAAcxa,EAAO2C,kBAAkB6X,GAAe,IACpFxa,EAAO2C,kBAAkB6X,GAAajY,KAAKgY,IACE,IAApCtB,EAAoBqB,YAC7Bta,EAAO6B,eAAeE,iBAAiBQ,KAAKgY,GACC,IAApCtB,EAAoBqB,aAAyD,KAApCrB,EAAoBqB,aACtEta,EAAO6B,eAAeC,aAAaS,KAAKgY,GAG1CrB,IACIA,IAA6BD,EAAoBnM,cACnDkM,IACAC,EAAsB,CAAEnM,YAAa,GAExC,CAGHyL,GACD,CAkBD,OAfAvY,EAAOwC,gBAAgBI,SAAS7K,IAC9B,GAAuB,IAAnBA,EAAK8K,UAAiB,CACxB,MAAM6X,EAAQvB,EAAsBphB,EAAK+K,MAAQ,GAC7C4X,EAAM1mB,OAAS,GACjBgM,EAAOiJ,mBAAmB1G,KAAK,CAC7BnM,KAAM2B,EAAK3B,KACX0M,IAAK/K,EAAK+K,IACV4X,SAGL,KAGHtmB,EAAS,+CAA+C4N,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,cpB1QR,SAAmB2a,GACV,UAAVA,GAA+B,UAAVA,GACvBrmB,QAAQC,IACN,+BAAiComB,EAAQ,yBACzC,sCAEFxmB,EAAkB,UAElBA,EAAkBwmB,EAClBnmB,EAAS,qBAAqBmmB,KAElC,6Be+GO,SAAkC5H,EAAO/S,EAAQ4a,EAAUC,GAChEvmB,QAAQ2I,KAAK,gBACb,MAAM2G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClD/Q,EAAgB0S,EAAM5M,WAAW9F,cACjCoG,EAAWP,EAAY6M,EAAM5M,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe0S,EAAM5M,WAAW9F,cAChCC,aAAcyS,EAAM5M,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAbua,QAEvB,GAAsB,OAAlBva,GAAuC,YAAbua,EAAwB,CAC3D,MAAME,EAAsB,GACtBC,EAAsB,GACtBC,EAAU/mB,KAAKqK,OAAOsF,GAAqB3P,KAAKgnB,OAAOrX,GACvDsX,EAAUjnB,KAAKqK,OAAOkG,GAAqBvQ,KAAKgnB,OAAOzW,GACvD2W,EAAkB,GAClBC,EAAYnnB,KAAKonB,MAAML,EAAUG,GACjCG,EAAYrnB,KAAKonB,MAAMH,EAAUC,GACjCI,EAAYP,GAAWI,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBX,EAAoB,GAAK7mB,KAAKgnB,OAAOrX,GACrCmX,EAAoB,GAAK9mB,KAAKgnB,OAAOzW,GAErC,IAAK,IAAIkX,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDZ,EAAoBY,GAAiBZ,EAAoB,GACzDC,EAAoBW,GAAiBX,EAAoB,GAAKW,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAM9W,EAAQ8W,EAAgBL,EAC9BR,EAAoBjW,GAASiW,EAAoB,GAAKa,EAAgBJ,EACtER,EAAoBlW,GAASkW,EAAoB,GAEjD,IAAK,IAAIW,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDZ,EAAoBjW,EAAQ6W,GAAiBZ,EAAoBjW,GACjEkW,EAAoBlW,EAAQ6W,GAAiBX,EAAoBlW,GAAS6W,EAAgBF,CAE7F,CAKDC,EAAc,IAAI9f,MAAMyf,EAAYE,GAAWrf,KAAK,MAGpD,MAAM2f,ERwKH,SAA6BnV,GAClC,IAGIoV,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAMpY,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJTub,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBxb,IACY,WAAjBC,EACFub,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjBvb,IACTub,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBxZ,EAAiBzO,OAAQioB,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4BzZ,EAAiBwZ,GAAejoB,OAC5DkoB,IACA,CACAJ,EAAqBE,GACnBvZ,EAAiBwZ,GAAeC,GAClCF,IAEA,MAAO5Z,EAAciB,GAAQZ,EAAiBwZ,GAAeC,GAC7D,IAAIC,EAA2BN,EAAcxY,GACzC+Y,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyBnoB,OAClDsoB,IACA,CACA,MAAMhT,EAAkBpF,EAAI9B,GAAc+Z,EAAyBG,IAA2B,EAE9FF,EAAqB7Z,KAAKqB,EAAkB0F,IAC5C+S,EAAqB9Z,KAAKiC,EAAkB8E,GAC7C,CAGD,IAAK,IAAIiT,EAAI,EAAGA,EAAIH,EAAqBpoB,OAAS,EAAGuoB,IACnDR,EAAsBxZ,KAAK,CACzB,CAAC6Z,EAAqBG,GAAIF,EAAqBE,IAC/C,CAACH,EAAqBG,EAAI,GAAIF,EAAqBE,EAAI,KAG5D,CAEH,OAAOR,CACT,CQpP6BS,CAAoB/V,IAGvCgW,cAAEA,EAAaC,cAAEA,GRuIpB,SAA8BjW,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkB5P,OAC/B8S,EAAkB5C,EAAI,GAAGlQ,OAGzByoB,EAAgB9gB,MAAMghB,KAAK,CAAE3oB,OAAQuS,IAAc,IAAM,KACzDmW,EAAgB/gB,MAAM4K,GAAYtK,KAAK,GAG7C,IAAK,IAAI2gB,EAAY,EAAGA,EAAY1Y,EAAIlQ,OAAQ4oB,IAC9C,IAAK,IAAIzV,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAI0Y,GAAWzV,GAAkB,EAGnDuV,EAAc3Y,GAAa2Y,EAAc3Y,GAAa,EAGtD0Y,EAAc1Y,GAAWxB,KAAKqa,EAC/B,CAGH,MAAO,CAAEH,gBAAeC,gBAC1B,CQ9J6CG,CAAqBpW,GAC9D,IAAIqW,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAe3B,EAAYE,EAAWyB,IAAgB,CAE/E,IACGzJ,GACCwH,EAAoBiC,GACpBhC,EAAoBgC,GACpBnB,GAGF,SAEF,IAAIoB,GAAQ,EACZ,IACE,IAAI7V,EAAiB,EACrBA,EAAiBV,EAASvC,IAAI4Y,GAAmB9oB,OACjDmT,IACA,CACA,IAAImC,EAAkB7C,EAASvC,IAAI4Y,GAAmB3V,GAAkB,EACxE,IACE,IAAI8V,EAAwB,EAC5BA,EAAwBP,EAAcpT,GACtC2T,IACA,CACA,IAAIxN,EAAiBgN,EAAcnT,GAAiB2T,GACpD,MAAMC,EAAepK,GACnBC,EACAtM,EACAzG,EACAyP,EACAqL,EAAoBiC,GACpBhC,EAAoBgC,GACpBpW,GAGF,GAAIuW,EAAahV,OAAQ,CACvB4U,EAAoBrN,EACpBgM,EAAYsB,GAAgBG,EAAalnB,MACzCgnB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAIvN,EAAiB,EAAGA,EAAiBhJ,EAASvC,IAAIlQ,OAAQyb,IAAkB,CACnF,MAAMyN,EAAepK,GACnBC,EACAtM,EACAzG,EACAyP,EACAqL,EAAoBiC,GACpBhC,EAAoBgC,GACpBpW,GAGF,GAAIuW,EAAahV,OAAQ,CACvB4U,EAAoBrN,EACpBgM,EAAYsB,GAAgBG,EAAalnB,MACzCgnB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAIG,EAAiBlpB,KAAKgnB,IAAImC,OAAOC,WAAY,KAC7CC,EAAcpC,EAAUF,EACxBuC,EAAYtpB,KAAKgnB,IAAIkC,EAAgB,KACrCK,EAAaD,EAAYD,EAGzBG,EAAS,CACXC,MAAO,GAAG9C,2BAAkC7H,EAAMa,eAClD+J,MAAOJ,EACPK,OAAQJ,EACRK,MAAO,CAAEH,MAAO,KAChBI,MAAO,CACLJ,MAAO,IACPK,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAE9F,EAAG,GAAItd,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,IAClCqgB,UAAW,WAITC,EAAc,CAChBngB,EAAG8c,EACH1V,EAAG2V,EACHqD,EAAG3C,EACHnkB,KAAM,UACN+mB,aAAa,EACbC,aAAa,EACb7E,KAAM,CACJ8E,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRjB,MAAO,YAETtnB,KAAM,+BAGRwoB,OAAOC,QAAQhE,EAAW,CAACsD,GAAcV,EAAQ,CAAEqB,YAAY,IAC/DxqB,QAAQmK,QAAQ,eACjB,CACH,iBAvRO,SAAsBsU,EAAO/S,EAAQ4a,EAAUC,GACpDvmB,QAAQ2I,KAAK,gBACb,MAAM2G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOoR,iBAClDtU,EAAiBkD,EAAOlD,eACxB8W,EAAeb,EAAMa,aACrBvT,EAAgB0S,EAAM5M,WAAW9F,cAGvC,GAFiB6F,EAAY6M,EAAM5M,YAEb,OAAlB9F,GAAuC,SAAbua,EAAqB,CAEjD,IAAImE,EAEFA,EADEjiB,EAAe9I,OAAS,GAAK2H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAMghB,KAAK/Y,GAEvB,IAAIob,EAAW,CACbhhB,EAAG4F,EACHwB,EAAG2Z,EACHE,KAAM,QACN3nB,KAAM,UACNmiB,KAAM,CAAEyF,MAAO,mBAAoBvB,MAAO,GAC1CvnB,KAAM,YAGJ+mB,EAAiBlpB,KAAKgnB,IAAImC,OAAOC,WAAY,KAI7CI,EAAS,CACXC,MAAO,eAAe9J,IACtB+J,MALc1pB,KAAKgnB,IAAIkC,EAAgB,KAMvCS,OALe,IAMfC,MAAO,CAAEH,MAAO,KAChBI,MAAO,CAAEJ,MAAO,YAChBO,OAAQ,CAAE9F,EAAG,GAAItd,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,KAGpC+gB,OAAOC,QAAQhE,EAAW,CAACmE,GAAWvB,EAAQ,CAAEqB,YAAY,IAC5DxqB,QAAQmK,QAAQ,eACjB,MAAM,GAAsB,OAAlB4B,GAAuC,YAAbua,EAAwB,CAE3D,IAAIxH,EAEFA,EADEzX,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIqgB,EAAiBlpB,KAAKgnB,IAAImC,OAAOC,WAAY,KAC7C8B,EAAOlrB,KAAKgnB,OAAOrX,GACnBrC,EAAOtN,KAAKqK,OAAOsF,GACnBwb,EAAOnrB,KAAKgnB,OAAOzW,GAInB8Y,GAHOrpB,KAAKqK,OAAOkG,GAEF4a,IADP7d,EAAO4d,GAGjB5B,EAAYtpB,KAAKgnB,IAAIkC,EAAgB,KAIrCM,EAAS,CACXC,MAAO,GAAG9C,YAAmBhH,IAC7B+J,MAAOJ,EACPK,OANeL,EAAYD,EAO3BO,MAAO,CAAEH,MAAO,KAChBI,MAAO,CACLJ,MAAO,IACPK,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAE9F,EAAG,GAAItd,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,IAClCqgB,UAAW,WAITC,EAAc,CAChBngB,EAAG4F,EACHwB,EAAGZ,EACH4Z,EAAGhL,EACH9b,KAAM,UACNmiB,KAAM,CACJ8E,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRjB,MAAO,YAETtnB,KAAM,kBAGRwoB,OAAOC,QAAQhE,EAAW,CAACsD,GAAcV,EAAQ,CAAEqB,YAAY,IAC/DxqB,QAAQmK,QAAQ,eACjB,CACH,iBMnH4B"}
\ No newline at end of file
+{"version":3,"file":"feascript.umd.js","sources":["../src/methods/euclideanNormScript.js","../src/utilities/loggingScript.js","../src/vendor/comlink.mjs","../src/methods/linearSystemSolverScript.js","../src/methods/jacobiSolverScript.js","../src/mesh/basisFunctionsScript.js","../src/mesh/meshGenerationScript.js","../src/methods/numericalIntegrationScript.js","../src/mesh/meshUtilsScript.js","../src/models/thermalBoundaryConditionsScript.js","../src/models/heatConductionScript.js","../src/models/genericBoundaryConditionsScript.js","../src/models/frontPropagationScript.js","../src/methods/frontalSolverScript.js","../src/methods/newtonRaphsonScript.js","../src/models/flowBoundaryConditionsScript.js","../src/visualization/plotlyPlotScript.js","../src/visualization/vtkPlotScript.js","../src/FEAScript.js","../src/models/generalFormPDEScript.js","../src/models/creepingFlowScript.js","../src/workers/workerScript.js","../src/readers/gmshReaderScript.js","../src/index.js"],"sourcesContent":["/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to calculate the Euclidean norm of a vector\n * @param {array} vector - The input vector\n * @returns {number} The Euclidean norm of the vector\n */\nexport function euclideanNorm(vector) {\n  let norm = 0;\n  for (let i = 0; i < vector.length; i++) {\n    norm += vector[i] * vector[i];\n  }\n  norm = Math.sqrt(norm);\n  return norm;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Global logging level\nlet currentLogLevel = \"basic\";\n\n/**\n * Function to set the logging system level\n * @param {string} level - Logging level (basic, debug)\n */\nexport function logSystem(level) {\n  if (level !== \"basic\" && level !== \"debug\") {\n    console.log(\n      \"%c[WARN] Invalid log level: \" + level + \". Using basic instead.\",\n      \"color: #FFC107; font-weight: bold;\",\n    ); // Yellow for warnings\n    currentLogLevel = \"basic\";\n  } else {\n    currentLogLevel = level;\n    basicLog(`Log level set to: ${level}`);\n  }\n}\n\n/**\n * Function to log debug messages - only logs if level is 'debug'\n * @param {string} message - Message to log\n */\nexport function debugLog(message) {\n  if (currentLogLevel === \"debug\") {\n    console.log(\"%c[DEBUG] \" + message, \"color: #2196F3; font-weight: bold;\");\n  }\n}\n\n/**\n * Function to log basic information - always logs\n * @param {string} message - Message to log\n */\nexport function basicLog(message) {\n  console.log(\"%c[INFO] \" + message, \"color: #4CAF50; font-weight: bold;\");\n}\n\n/**\n * Function to log error messages\n * @param {string} message - Message to log\n */\nexport function errorLog(message) {\n  console.log(\"%c[ERROR] \" + message, \"color: #F44336; font-weight: bold;\");\n}\n\n/**\n * Function to log warning messages\n * @param {string} message - Message to log\n */\nexport function warnLog(message) {\n  console.log(\"%c[WARN] \" + message, \"color: #FF9800; font-weight: bold;\");\n}\n\n/**\n * Function to handle version information and fetch the latest update date and release from GitHub\n */\nexport async function printVersionInformation() {\n  basicLog(\"Fetching latest FEAScript version information...\");\n  try {\n    const commitResponse = await fetch(\"https://api.github.com/repos/FEAScript/FEAScript/commits/main\");\n    const commitData = await commitResponse.json();\n    const latestCommitDate = new Date(commitData.commit.committer.date).toLocaleString();\n    basicLog(`Latest FEAScript update: ${latestCommitDate}`);\n    return latestCommitDate;\n  } catch (error) {\n    errorLog(\"Failed to fetch version information: \" + error);\n    return \"Version information unavailable\";\n  }\n}\n","/**\n * @license\n * Copyright 2019 Google LLC\n * SPDX-License-Identifier: Apache-2.0\n */\nconst proxyMarker = Symbol(\"Comlink.proxy\");\nconst createEndpoint = Symbol(\"Comlink.endpoint\");\nconst releaseProxy = Symbol(\"Comlink.releaseProxy\");\nconst finalizer = Symbol(\"Comlink.finalizer\");\nconst throwMarker = Symbol(\"Comlink.thrown\");\nconst isObject = (val) => (typeof val === \"object\" && val !== null) || typeof val === \"function\";\n/**\n * Internal transfer handle to handle objects marked to proxy.\n */\nconst proxyTransferHandler = {\n    canHandle: (val) => isObject(val) && val[proxyMarker],\n    serialize(obj) {\n        const { port1, port2 } = new MessageChannel();\n        expose(obj, port1);\n        return [port2, [port2]];\n    },\n    deserialize(port) {\n        port.start();\n        return wrap(port);\n    },\n};\n/**\n * Internal transfer handler to handle thrown exceptions.\n */\nconst throwTransferHandler = {\n    canHandle: (value) => isObject(value) && throwMarker in value,\n    serialize({ value }) {\n        let serialized;\n        if (value instanceof Error) {\n            serialized = {\n                isError: true,\n                value: {\n                    message: value.message,\n                    name: value.name,\n                    stack: value.stack,\n                },\n            };\n        }\n        else {\n            serialized = { isError: false, value };\n        }\n        return [serialized, []];\n    },\n    deserialize(serialized) {\n        if (serialized.isError) {\n            throw Object.assign(new Error(serialized.value.message), serialized.value);\n        }\n        throw serialized.value;\n    },\n};\n/**\n * Allows customizing the serialization of certain values.\n */\nconst transferHandlers = new Map([\n    [\"proxy\", proxyTransferHandler],\n    [\"throw\", throwTransferHandler],\n]);\nfunction isAllowedOrigin(allowedOrigins, origin) {\n    for (const allowedOrigin of allowedOrigins) {\n        if (origin === allowedOrigin || allowedOrigin === \"*\") {\n            return true;\n        }\n        if (allowedOrigin instanceof RegExp && allowedOrigin.test(origin)) {\n            return true;\n        }\n    }\n    return false;\n}\nfunction expose(obj, ep = globalThis, allowedOrigins = [\"*\"]) {\n    ep.addEventListener(\"message\", function callback(ev) {\n        if (!ev || !ev.data) {\n            return;\n        }\n        if (!isAllowedOrigin(allowedOrigins, ev.origin)) {\n            console.warn(`Invalid origin '${ev.origin}' for comlink proxy`);\n            return;\n        }\n        const { id, type, path } = Object.assign({ path: [] }, ev.data);\n        const argumentList = (ev.data.argumentList || []).map(fromWireValue);\n        let returnValue;\n        try {\n            const parent = path.slice(0, -1).reduce((obj, prop) => obj[prop], obj);\n            const rawValue = path.reduce((obj, prop) => obj[prop], obj);\n            switch (type) {\n                case \"GET\" /* MessageType.GET */:\n                    {\n                        returnValue = rawValue;\n                    }\n                    break;\n                case \"SET\" /* MessageType.SET */:\n                    {\n                        parent[path.slice(-1)[0]] = fromWireValue(ev.data.value);\n                        returnValue = true;\n                    }\n                    break;\n                case \"APPLY\" /* MessageType.APPLY */:\n                    {\n                        returnValue = rawValue.apply(parent, argumentList);\n                    }\n                    break;\n                case \"CONSTRUCT\" /* MessageType.CONSTRUCT */:\n                    {\n                        const value = new rawValue(...argumentList);\n                        returnValue = proxy(value);\n                    }\n                    break;\n                case \"ENDPOINT\" /* MessageType.ENDPOINT */:\n                    {\n                        const { port1, port2 } = new MessageChannel();\n                        expose(obj, port2);\n                        returnValue = transfer(port1, [port1]);\n                    }\n                    break;\n                case \"RELEASE\" /* MessageType.RELEASE */:\n                    {\n                        returnValue = undefined;\n                    }\n                    break;\n                default:\n                    return;\n            }\n        }\n        catch (value) {\n            returnValue = { value, [throwMarker]: 0 };\n        }\n        Promise.resolve(returnValue)\n            .catch((value) => {\n            return { value, [throwMarker]: 0 };\n        })\n            .then((returnValue) => {\n            const [wireValue, transferables] = toWireValue(returnValue);\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n            if (type === \"RELEASE\" /* MessageType.RELEASE */) {\n                // detach and deactive after sending release response above.\n                ep.removeEventListener(\"message\", callback);\n                closeEndPoint(ep);\n                if (finalizer in obj && typeof obj[finalizer] === \"function\") {\n                    obj[finalizer]();\n                }\n            }\n        })\n            .catch((error) => {\n            // Send Serialization Error To Caller\n            const [wireValue, transferables] = toWireValue({\n                value: new TypeError(\"Unserializable return value\"),\n                [throwMarker]: 0,\n            });\n            ep.postMessage(Object.assign(Object.assign({}, wireValue), { id }), transferables);\n        });\n    });\n    if (ep.start) {\n        ep.start();\n    }\n}\nfunction isMessagePort(endpoint) {\n    return endpoint.constructor.name === \"MessagePort\";\n}\nfunction closeEndPoint(endpoint) {\n    if (isMessagePort(endpoint))\n        endpoint.close();\n}\nfunction wrap(ep, target) {\n    const pendingListeners = new Map();\n    ep.addEventListener(\"message\", function handleMessage(ev) {\n        const { data } = ev;\n        if (!data || !data.id) {\n            return;\n        }\n        const resolver = pendingListeners.get(data.id);\n        if (!resolver) {\n            return;\n        }\n        try {\n            resolver(data);\n        }\n        finally {\n            pendingListeners.delete(data.id);\n        }\n    });\n    return createProxy(ep, pendingListeners, [], target);\n}\nfunction throwIfProxyReleased(isReleased) {\n    if (isReleased) {\n        throw new Error(\"Proxy has been released and is not useable\");\n    }\n}\nfunction releaseEndpoint(ep) {\n    return requestResponseMessage(ep, new Map(), {\n        type: \"RELEASE\" /* MessageType.RELEASE */,\n    }).then(() => {\n        closeEndPoint(ep);\n    });\n}\nconst proxyCounter = new WeakMap();\nconst proxyFinalizers = \"FinalizationRegistry\" in globalThis &&\n    new FinalizationRegistry((ep) => {\n        const newCount = (proxyCounter.get(ep) || 0) - 1;\n        proxyCounter.set(ep, newCount);\n        if (newCount === 0) {\n            releaseEndpoint(ep);\n        }\n    });\nfunction registerProxy(proxy, ep) {\n    const newCount = (proxyCounter.get(ep) || 0) + 1;\n    proxyCounter.set(ep, newCount);\n    if (proxyFinalizers) {\n        proxyFinalizers.register(proxy, ep, proxy);\n    }\n}\nfunction unregisterProxy(proxy) {\n    if (proxyFinalizers) {\n        proxyFinalizers.unregister(proxy);\n    }\n}\nfunction createProxy(ep, pendingListeners, path = [], target = function () { }) {\n    let isProxyReleased = false;\n    const proxy = new Proxy(target, {\n        get(_target, prop) {\n            throwIfProxyReleased(isProxyReleased);\n            if (prop === releaseProxy) {\n                return () => {\n                    unregisterProxy(proxy);\n                    releaseEndpoint(ep);\n                    pendingListeners.clear();\n                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, pendingListeners, {\n                    type: \"GET\" /* MessageType.GET */,\n                    path: path.map((p) => p.toString()),\n                }).then(fromWireValue);\n                return r.then.bind(r);\n            }\n            return createProxy(ep, pendingListeners, [...path, prop]);\n        },\n        set(_target, prop, rawValue) {\n            throwIfProxyReleased(isProxyReleased);\n            // FIXME: ES6 Proxy Handler `set` methods are supposed to return a\n            // boolean. To show good will, we return true asynchronously ¯\\_(ツ)_/¯\n            const [value, transferables] = toWireValue(rawValue);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"SET\" /* MessageType.SET */,\n                path: [...path, prop].map((p) => p.toString()),\n                value,\n            }, transferables).then(fromWireValue);\n        },\n        apply(_target, _thisArg, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const last = path[path.length - 1];\n            if (last === createEndpoint) {\n                return requestResponseMessage(ep, pendingListeners, {\n                    type: \"ENDPOINT\" /* MessageType.ENDPOINT */,\n                }).then(fromWireValue);\n            }\n            // We just pretend that `bind()` didn’t happen.\n            if (last === \"bind\") {\n                return createProxy(ep, pendingListeners, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"APPLY\" /* MessageType.APPLY */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n        construct(_target, rawArgumentList) {\n            throwIfProxyReleased(isProxyReleased);\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, pendingListeners, {\n                type: \"CONSTRUCT\" /* MessageType.CONSTRUCT */,\n                path: path.map((p) => p.toString()),\n                argumentList,\n            }, transferables).then(fromWireValue);\n        },\n    });\n    registerProxy(proxy, ep);\n    return proxy;\n}\nfunction myFlat(arr) {\n    return Array.prototype.concat.apply([], arr);\n}\nfunction processArguments(argumentList) {\n    const processed = argumentList.map(toWireValue);\n    return [processed.map((v) => v[0]), myFlat(processed.map((v) => v[1]))];\n}\nconst transferCache = new WeakMap();\nfunction transfer(obj, transfers) {\n    transferCache.set(obj, transfers);\n    return obj;\n}\nfunction proxy(obj) {\n    return Object.assign(obj, { [proxyMarker]: true });\n}\nfunction windowEndpoint(w, context = globalThis, targetOrigin = \"*\") {\n    return {\n        postMessage: (msg, transferables) => w.postMessage(msg, targetOrigin, transferables),\n        addEventListener: context.addEventListener.bind(context),\n        removeEventListener: context.removeEventListener.bind(context),\n    };\n}\nfunction toWireValue(value) {\n    for (const [name, handler] of transferHandlers) {\n        if (handler.canHandle(value)) {\n            const [serializedValue, transferables] = handler.serialize(value);\n            return [\n                {\n                    type: \"HANDLER\" /* WireValueType.HANDLER */,\n                    name,\n                    value: serializedValue,\n                },\n                transferables,\n            ];\n        }\n    }\n    return [\n        {\n            type: \"RAW\" /* WireValueType.RAW */,\n            value,\n        },\n        transferCache.get(value) || [],\n    ];\n}\nfunction fromWireValue(value) {\n    switch (value.type) {\n        case \"HANDLER\" /* WireValueType.HANDLER */:\n            return transferHandlers.get(value.name).deserialize(value.value);\n        case \"RAW\" /* WireValueType.RAW */:\n            return value.value;\n    }\n}\nfunction requestResponseMessage(ep, pendingListeners, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        pendingListeners.set(id, resolve);\n        if (ep.start) {\n            ep.start();\n        }\n        ep.postMessage(Object.assign({ id }, msg), transfers);\n    });\n}\nfunction generateUUID() {\n    return new Array(4)\n        .fill(0)\n        .map(() => Math.floor(Math.random() * Number.MAX_SAFE_INTEGER).toString(16))\n        .join(\"-\");\n}\n\nexport { createEndpoint, expose, finalizer, proxy, proxyMarker, releaseProxy, transfer, transferHandlers, windowEndpoint, wrap };\n//# sourceMappingURL=comlink.mjs.map\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { jacobiSolver } from \"./jacobiSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Function to solve a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (\"lusolve\" or \"jacobi\")\n * @param {Array} jacobianMatrix - The coefficient matrix\n * @param {Array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations = 0;\n\n  // Solve the linear system based on the specified solver method\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  if (solverMethod === \"lusolve\") {\n    // Use LU decomposition method\n    const jacobianMatrixSparse = math.sparse(jacobianMatrix);\n    const luFactorization = math.slu(jacobianMatrixSparse, 1, 1); // order=1, threshold=1 for pivoting\n    let solutionMatrix = math.lusolve(luFactorization, residualVector);\n    solutionVector = math.squeeze(solutionMatrix).valueOf();\n    //solutionVector = math.lusolve(jacobianMatrix, residualVector); // In the case of a dense matrix\n  } else if (solverMethod === \"jacobi\") {\n    // Use Jacobi method\n    const initialGuess = new Array(residualVector.length).fill(0);\n    const jacobiSolverResult = jacobiSolver(jacobianMatrix, residualVector, initialGuess, {\n      maxIterations,\n      tolerance,\n    });\n\n    // Log convergence information\n    if (jacobiSolverResult.converged) {\n      debugLog(`Jacobi method converged in ${jacobiSolverResult.iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${jacobiSolverResult.iterations} iterations`);\n    }\n\n    solutionVector = jacobiSolverResult.solutionVector;\n    converged = jacobiSolverResult.converged;\n    iterations = jacobiSolverResult.iterations;\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  return { solutionVector, converged, iterations };\n}\n\n// Helper to lazily create a default WebGPU compute engine (Comlink + worker)\nasync function createDefaultComputeEngine() {\n  const worker = new Worker(new URL(\"../workers/webgpuWorkerScript.js\", import.meta.url), {\n    type: \"module\",\n  });\n  const computeEngine = Comlink.wrap(worker);\n  await computeEngine.initialize();\n  return { computeEngine, worker };\n}\n\n/**\n * Function to solve asynchronously a system of linear equations using different solver methods\n * @param {string} solverMethod - The solver method to use (e.g., \"jacobi-gpu\")\n * @param {array} jacobianMatrix - The coefficient matrix\n * @param {array} residualVector - The right-hand side vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {Promise<object>} A promise that resolves to an object containing:\n *  - solutionVector: The solution vector\n *  - converged: Boolean indicating whether the method converged (for iterative methods)\n *  - iterations: Number of iterations performed (for iterative methods)\n */\nexport async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {\n  // Extract options\n  const { maxIterations = 10000, tolerance = 1e-4 } = options;\n\n  basicLog(`Solving system using ${solverMethod}...`);\n  console.time(\"systemSolving\");\n\n  // Normalize inputs\n  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : (jacobianMatrix?.toArray?.() ?? jacobianMatrix);\n  const b = Array.isArray(residualVector) ? residualVector : (residualVector?.toArray?.() ?? residualVector);\n\n  let created = null;\n  let computeEngine = null;\n\n  let solutionVector = [];\n  let converged = true;\n  let iterations;\n\n  if (solverMethod === \"jacobi-gpu\") {\n    // Spin up a worker-backed compute engine\n    created = await createDefaultComputeEngine();\n    computeEngine = created.computeEngine;\n\n    const x0 = new Array(b.length).fill(0);\n    let result;\n\n    result = await computeEngine.webgpuJacobiSolver(A, b, x0, { maxIterations, tolerance });\n    solutionVector = result.solutionVector;\n    converged = result.converged;\n    iterations = result.iterations;\n\n    // Log convergence information\n    if (converged) {\n      debugLog(`Jacobi method converged in ${iterations} iterations`);\n    } else {\n      errorLog(`Jacobi method did not converge after ${iterations} iterations`);\n    }\n  } else {\n    errorLog(`Unknown solver method: ${solverMethod}`);\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(`System solved successfully (${solverMethod})`);\n\n  if (created) {\n    await computeEngine?.destroy?.().catch(() => {});\n    created.worker.terminate();\n  }\n\n  return { solutionVector, converged, iterations };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Function to solve a system of linear equations using the Jacobi iterative method (CPU synchronous version)\n * @param {array} A - The system matrix\n * @param {array} b - The right-hand side vector\n * @param {array} x0 - Initial guess for solution vector\n * @param {object} [options] - Optional parameters for the solver, such as `maxIterations` and `tolerance`\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\nexport function jacobiSolver(A, b, x0, options = {}) {\n  // Extract options\n  const { maxIterations, tolerance } = options;\n\n  const n = A.length;\n  let x = [...x0];\n  let xNew = new Array(n);\n\n  // Jacobi update: xNew[i] = (b[i] - sum(A[i][j] * x[j] for j != i)) / A[i][i]\n  for (let iter = 0; iter < maxIterations; iter++) {\n    for (let i = 0; i < n; i++) {\n      let sum = 0;\n      for (let j = 0; j < n; j++) {\n        if (i !== j) {\n          sum += A[i][j] * x[j];\n        }\n      }\n      xNew[i] = (b[i] - sum) / A[i][i];\n    }\n\n    // Check convergence based on maximum difference in solution vector\n    let maxDiff = 0;\n    for (let i = 0; i < n; i++) {\n      maxDiff = Math.max(maxDiff, Math.abs(xNew[i] - x[i]));\n    }\n\n    // Copy new solution for the next iteration\n    x = [...xNew];\n\n    if (maxDiff < tolerance) {\n      return { solutionVector: x, iterations: iter + 1, converged: true };\n    }\n  }\n\n  return { solutionVector: x, iterations: maxIterations, converged: false };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle basis functions and their derivatives based on element configuration\n */\nexport class BasisFunctions {\n  /**\n   * Constructor to initialize the BasisFunctions class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to calculate basis functions and their derivatives based on the dimension and order\n   * @param {number} ksi - Natural coordinate (for both 1D and 2D)\n   * @param {number} [eta] - Second natural coordinate (only for 2D elements)\n   * @returns {object} An object containing:\n   *  - basisFunction: Array of evaluated basis functions\n   *  - basisFunctionDerivKsi: Array of derivatives of basis functions with respect to ksi\n   *  - basisFunctionDerivEta: Array of derivatives of basis functions with respect to eta (only for 2D elements)\n   */\n  getBasisFunctions(ksi, eta = null) {\n    let basisFunction = [];\n    let basisFunctionDerivKsi = [];\n    let basisFunctionDerivEta = [];\n\n    if (this.meshDimension === \"1D\") {\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 1D elements\n        basisFunction[0] = 1 - ksi;\n        basisFunction[1] = ksi;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -1;\n        basisFunctionDerivKsi[1] = 1;\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 1D elements\n        basisFunction[0] = 1 - 3 * ksi + 2 * ksi ** 2;\n        basisFunction[1] = 4 * ksi - 4 * ksi ** 2;\n        basisFunction[2] = -ksi + 2 * ksi ** 2;\n\n        // Derivatives of basis functions with respect to ksi\n        basisFunctionDerivKsi[0] = -3 + 4 * ksi;\n        basisFunctionDerivKsi[1] = 4 - 8 * ksi;\n        basisFunctionDerivKsi[2] = -1 + 4 * ksi;\n      }\n    } else if (this.meshDimension === \"2D\") {\n      if (eta === null) {\n        errorLog(\"Eta coordinate is required for 2D elements\");\n        return;\n      }\n\n      if (this.elementOrder === \"linear\") {\n        // Linear basis functions for 2D elements\n        function l1(c) {\n          return 1 - c;\n        }\n        function l2(c) {\n          return c;\n        }\n        function dl1() {\n          return -1;\n        }\n        function dl2() {\n          return 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l2(ksi) * l1(eta);\n        basisFunction[3] = l2(ksi) * l2(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1() * l1(eta);\n        basisFunctionDerivKsi[1] = dl1() * l2(eta);\n        basisFunctionDerivKsi[2] = dl2() * l1(eta);\n        basisFunctionDerivKsi[3] = dl2() * l2(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1();\n        basisFunctionDerivEta[1] = l1(ksi) * dl2();\n        basisFunctionDerivEta[2] = l2(ksi) * dl1();\n        basisFunctionDerivEta[3] = l2(ksi) * dl2();\n      } else if (this.elementOrder === \"quadratic\") {\n        // Quadratic basis functions for 2D elements\n        function l1(c) {\n          return 2 * c ** 2 - 3 * c + 1;\n        }\n        function l2(c) {\n          return -4 * c ** 2 + 4 * c;\n        }\n        function l3(c) {\n          return 2 * c ** 2 - c;\n        }\n        function dl1(c) {\n          return 4 * c - 3;\n        }\n        function dl2(c) {\n          return -8 * c + 4;\n        }\n        function dl3(c) {\n          return 4 * c - 1;\n        }\n\n        // Evaluate basis functions at (ksi, eta)\n        basisFunction[0] = l1(ksi) * l1(eta);\n        basisFunction[1] = l1(ksi) * l2(eta);\n        basisFunction[2] = l1(ksi) * l3(eta);\n        basisFunction[3] = l2(ksi) * l1(eta);\n        basisFunction[4] = l2(ksi) * l2(eta);\n        basisFunction[5] = l2(ksi) * l3(eta);\n        basisFunction[6] = l3(ksi) * l1(eta);\n        basisFunction[7] = l3(ksi) * l2(eta);\n        basisFunction[8] = l3(ksi) * l3(eta);\n\n        // Derivatives with respect to ksi\n        basisFunctionDerivKsi[0] = dl1(ksi) * l1(eta);\n        basisFunctionDerivKsi[1] = dl1(ksi) * l2(eta);\n        basisFunctionDerivKsi[2] = dl1(ksi) * l3(eta);\n        basisFunctionDerivKsi[3] = dl2(ksi) * l1(eta);\n        basisFunctionDerivKsi[4] = dl2(ksi) * l2(eta);\n        basisFunctionDerivKsi[5] = dl2(ksi) * l3(eta);\n        basisFunctionDerivKsi[6] = dl3(ksi) * l1(eta);\n        basisFunctionDerivKsi[7] = dl3(ksi) * l2(eta);\n        basisFunctionDerivKsi[8] = dl3(ksi) * l3(eta);\n\n        // Derivatives with respect to eta\n        basisFunctionDerivEta[0] = l1(ksi) * dl1(eta);\n        basisFunctionDerivEta[1] = l1(ksi) * dl2(eta);\n        basisFunctionDerivEta[2] = l1(ksi) * dl3(eta);\n        basisFunctionDerivEta[3] = l2(ksi) * dl1(eta);\n        basisFunctionDerivEta[4] = l2(ksi) * dl2(eta);\n        basisFunctionDerivEta[5] = l2(ksi) * dl3(eta);\n        basisFunctionDerivEta[6] = l3(ksi) * dl1(eta);\n        basisFunctionDerivEta[7] = l3(ksi) * dl2(eta);\n        basisFunctionDerivEta[8] = l3(ksi) * dl3(eta);\n      }\n    }\n\n    return { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Basic structure for the mesh\n */\nexport class Mesh {\n  /**\n   * Constructor to initialize the Mesh class\n   * @param {object} config - Configuration object for the mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY=1] - Number of elements along the y-axis (for 1D meshes)\n   * @param {number} [config.maxY=0] - Maximum y-coordinate of the mesh (for 1D meshes)\n   * @param {string} [config.meshDimension='2D'] - The dimension of the mesh, either 1D or 2D\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    meshDimension = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n  }) {\n    this.numElementsX = numElementsX;\n    this.numElementsY = numElementsY;\n    this.maxX = maxX;\n    this.maxY = maxY;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.parsedMesh = parsedMesh;\n\n    this.boundaryElementsProcessed = false;\n\n    if (this.parsedMesh) {\n      basicLog(\"Using pre-parsed mesh from gmshReader data for mesh generation.\");\n      this.parseMeshFromGmsh();\n    }\n  }\n\n  /**\n   * Method to parse the mesh from the Gmsh format to the FEAScript format\n   */\n  parseMeshFromGmsh() {\n    if (!this.parsedMesh.nodalNumbering) {\n      errorLog(\"No valid nodal numbering found in the parsed mesh.\");\n    }\n\n    // If this parsed mesh was already converted in a previous run, don't re-process it.\n    // Just mark this Mesh instance as ready so prepareMesh() doesn't fall back to generateMesh().\n    if (Array.isArray(this.parsedMesh.nodalNumbering)) {\n      this.boundaryElementsProcessed = true;\n      this.parsedMesh.boundaryElementsProcessed = true;\n      return this.parsedMesh;\n    }\n\n    if (\n      typeof this.parsedMesh.nodalNumbering === \"object\" &&\n      !Array.isArray(this.parsedMesh.nodalNumbering)\n    ) {\n      // Store the nodal numbering structure before converting\n      const quadElements = this.parsedMesh.nodalNumbering.quadElements || [];\n      const triangleElements = this.parsedMesh.nodalNumbering.triangleElements || [];\n\n      debugLog(\n        \"Initial parsed mesh nodal numbering from Gmsh format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Check if it has quadElements or triangleElements structure from gmshReader\n      if (this.parsedMesh.elementTypes[3] || this.parsedMesh.elementTypes[10]) {\n        // Map nodal numbering from Gmsh format to FEAScript format for quad elements\n        const mappedNodalNumbering = [];\n\n        for (let elementIndex = 0; elementIndex < quadElements.length; elementIndex++) {\n          const gmshNodes = quadElements[elementIndex];\n          const FEAScriptNodes = new Array(gmshNodes.length);\n\n          // Check for element type based on number of nodes\n          if (gmshNodes.length === 4) {\n            // Simple mapping for linear quad elements (4 nodes)\n            // Gmsh:         FEAScript:\n            // 3 --- 2       1 --- 3\n            // |     |  -->  |     |\n            // 0 --- 1       0 --- 2\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[3]; // 3 -> 1\n            FEAScriptNodes[2] = gmshNodes[1]; // 1 -> 2\n            FEAScriptNodes[3] = gmshNodes[2]; // 2 -> 3\n          } else if (gmshNodes.length === 9) {\n            // Mapping for quadratic quad elements (9 nodes)\n            // Gmsh:         FEAScript:\n            // 3--6--2       2--5--8\n            // |     |       |     |\n            // 7  8  5  -->  1  4  7\n            // |     |       |     |\n            // 0--4--1       0--3--6\n\n            FEAScriptNodes[0] = gmshNodes[0]; // 0 -> 0\n            FEAScriptNodes[1] = gmshNodes[7]; // 7 -> 1\n            FEAScriptNodes[2] = gmshNodes[3]; // 3 -> 2\n            FEAScriptNodes[3] = gmshNodes[4]; // 4 -> 3\n            FEAScriptNodes[4] = gmshNodes[8]; // 8 -> 4\n            FEAScriptNodes[5] = gmshNodes[6]; // 6 -> 5\n            FEAScriptNodes[6] = gmshNodes[1]; // 1 -> 6\n            FEAScriptNodes[7] = gmshNodes[5]; // 5 -> 7\n            FEAScriptNodes[8] = gmshNodes[2]; // 2 -> 8\n          }\n\n          mappedNodalNumbering.push(FEAScriptNodes);\n        }\n\n        this.parsedMesh.nodalNumbering = mappedNodalNumbering;\n      } else if (this.parsedMesh.elementTypes[2]) {\n        errorLog(\"Element type is neither triangle nor quad; mapping for this type is not implemented yet.\");\n      }\n\n      debugLog(\n        \"Nodal numbering after mapping from Gmsh to FEAScript format: \" +\n          JSON.stringify(this.parsedMesh.nodalNumbering),\n      );\n\n      // Process boundary elements if they exist and if physical property mapping exists\n      if (this.parsedMesh.physicalPropMap && this.parsedMesh.boundaryElements) {\n        // Check if boundary elements need to be processed\n        if (\n          Array.isArray(this.parsedMesh.boundaryElements) &&\n          this.parsedMesh.boundaryElements.length > 0 &&\n          this.parsedMesh.boundaryElements[0] === undefined\n        ) {\n          // Create a new array without the empty first element\n          const fixedBoundaryElements = [];\n          for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n            if (this.parsedMesh.boundaryElements[i]) {\n              fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n            }\n          }\n          this.parsedMesh.boundaryElements = fixedBoundaryElements;\n        }\n\n        // If boundary node pairs exist but boundary elements haven't been processed\n        if (this.parsedMesh.boundaryNodePairs && !this.parsedMesh.boundaryElementsProcessed) {\n          // Reset boundary elements array\n          this.parsedMesh.boundaryElements = [];\n\n          // Process each physical property from the Gmsh file\n          this.parsedMesh.physicalPropMap.forEach((prop) => {\n            // Only process 1D physical entities (boundary lines)\n            if (prop.dimension === 1) {\n              // Get all node pairs for this boundary\n              const boundaryNodePairs = this.parsedMesh.boundaryNodePairs[prop.tag] || [];\n\n              if (boundaryNodePairs.length > 0) {\n                // Initialize array for this boundary tag\n                if (!this.parsedMesh.boundaryElements[prop.tag]) {\n                  this.parsedMesh.boundaryElements[prop.tag] = [];\n                }\n\n                // For each boundary line segment (defined by a pair of nodes)\n                boundaryNodePairs.forEach((nodesPair) => {\n                  const node1 = nodesPair[0]; // First node in the pair\n                  const node2 = nodesPair[1]; // Second node in the pair\n\n                  debugLog(\n                    `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${\n                      prop.name || \"unnamed\"\n                    })`,\n                  );\n\n                  // Search through all elements to find which one contains both nodes\n                  let foundElement = false;\n\n                  // Loop through all elements in the mesh\n                  for (\n                    let elementIndex = 0;\n                    elementIndex < this.parsedMesh.nodalNumbering.length;\n                    elementIndex++\n                  ) {\n                    const elementConnectivity = this.parsedMesh.nodalNumbering[elementIndex];\n\n                    // For linear quadrilateral linear elements (4 nodes)\n                    if (elementConnectivity.length === 4) {\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript linear quadrilateral numbering:\n                        // 1 --- 3\n                        // |     |\n                        // 0 --- 2\n\n                        if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0)\n                        ) {\n                          side = 0; // Bottom side\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0)\n                        ) {\n                          side = 1; // Left side\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 1 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 1)\n                        ) {\n                          side = 2; // Top side\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 2)\n                        ) {\n                          side = 3; // Right side\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    } else if (elementConnectivity.length === 9) {\n                      // For quadratic quadrilateral elements (9 nodes)\n                      // Check if both boundary nodes are in this element\n                      if (elementConnectivity.includes(node1) && elementConnectivity.includes(node2)) {\n                        // Find which side of the element these nodes form\n                        let side;\n\n                        const node1Index = elementConnectivity.indexOf(node1);\n                        const node2Index = elementConnectivity.indexOf(node2);\n\n                        debugLog(\n                          `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(\n                            \", \",\n                          )}]`,\n                        );\n                        debugLog(\n                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,\n                        );\n\n                        // Based on FEAScript quadratic quadrilateral numbering:\n                        // 2--5--8\n                        // |     |\n                        // 1  4  7\n                        // |     |\n                        // 0--3--6\n\n                        // TODO: Transform into dictionaries for better readability\n                        if (\n                          (node1Index === 0 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 3) ||\n                          (node1Index === 3 && node2Index === 0) ||\n                          (node1Index === 3 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 3)\n                        ) {\n                          side = 0; // Bottom side (nodes 0, 3, 6)\n                          debugLog(`  These nodes form the BOTTOM side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 0 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 0) ||\n                          (node1Index === 0 && node2Index === 1) ||\n                          (node1Index === 1 && node2Index === 0) ||\n                          (node1Index === 1 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 1)\n                        ) {\n                          side = 1; // Left side (nodes 0, 1, 2)\n                          debugLog(`  These nodes form the LEFT side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 2 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 2) ||\n                          (node1Index === 2 && node2Index === 5) ||\n                          (node1Index === 5 && node2Index === 2) ||\n                          (node1Index === 5 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 5)\n                        ) {\n                          side = 2; // Top side (nodes 2, 5, 8)\n                          debugLog(`  These nodes form the TOP side (${side}) of element ${elementIndex}`);\n                        } else if (\n                          (node1Index === 6 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 6) ||\n                          (node1Index === 6 && node2Index === 7) ||\n                          (node1Index === 7 && node2Index === 6) ||\n                          (node1Index === 7 && node2Index === 8) ||\n                          (node1Index === 8 && node2Index === 7)\n                        ) {\n                          side = 3; // Right side (nodes 6, 7, 8)\n                          debugLog(`  These nodes form the RIGHT side (${side}) of element ${elementIndex}`);\n                        }\n\n                        // Add the element and side to the boundary elements array\n                        this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);\n                        debugLog(\n                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,\n                        );\n                        foundElement = true;\n                        break;\n                      }\n                    }\n                  }\n\n                  if (!foundElement) {\n                    errorLog(\n                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`,\n                    );\n                  }\n                });\n              }\n            }\n          });\n\n          // Mark as processed\n          this.boundaryElementsProcessed = true;\n\n          // Fix boundary elements array - remove undefined entries\n          if (\n            this.parsedMesh.boundaryElements.length > 0 &&\n            this.parsedMesh.boundaryElements[0] === undefined\n          ) {\n            const fixedBoundaryElements = [];\n            for (let i = 1; i < this.parsedMesh.boundaryElements.length; i++) {\n              if (this.parsedMesh.boundaryElements[i]) {\n                fixedBoundaryElements.push(this.parsedMesh.boundaryElements[i]);\n              }\n            }\n            this.parsedMesh.boundaryElements = fixedBoundaryElements;\n          }\n        }\n      }\n    }\n\n    return this.parsedMesh;\n  }\n}\n\nexport class Mesh1D extends Mesh {\n  /**\n   * Constructor to initialize the 1D mesh\n   * @param {object} config - Configuration object for the 1D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   */\n  constructor({ numElementsX = null, maxX = null, elementOrder = \"linear\", parsedMesh = null }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY: 1,\n      maxY: 0,\n      meshDimension: \"1D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    if (this.numElementsX === null || this.maxX === null) {\n      errorLog(\"numElementsX and maxX are required parameters when generating a 1D mesh from geometry\");\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    const xStart = 0;\n    let totalNodesX, deltaX;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX;\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n\n      nodesXCoordinates[0] = xStart;\n      for (let nodeIndex = 1; nodeIndex < totalNodesX; nodeIndex++) {\n        nodesXCoordinates[nodeIndex] = nodesXCoordinates[nodeIndex - 1] + deltaX / 2;\n      }\n    }\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering1D(this.numElementsX, totalNodesX, this.elementOrder);\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n\n    // Return x coordinates of nodes, total nodes, NOP array, and boundary elements\n    return {\n      nodesXCoordinates,\n      totalNodesX,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering1D(numElementsX, totalNodesX, elementOrder) {\n    // TODO: The totalNodesX is not used in the original function. Verify if\n    // there is a multiple calculation on the totalNodes.\n\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear 1D elements with the following nodes representation:\n       *\n       *   1 --- 2\n       *\n       */\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 2; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic 1D elements with the following nodes representation:\n       *\n       *   1--2--3\n       *\n       */\n      let columnCounter = 0;\n      for (let elementIndex = 0; elementIndex < numElementsX; elementIndex++) {\n        nop[elementIndex] = [];\n        for (let nodeIndex = 1; nodeIndex <= 3; nodeIndex++) {\n          nop[elementIndex][nodeIndex - 1] = elementIndex + nodeIndex + columnCounter;\n        }\n        columnCounter += 1;\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of an 1D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Left node of reference element (maps to physical left endpoint)\n   * 1 - Right node of reference element (maps to physical right endpoint)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 2; // Two sides for 1D case (left and right)\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // Left boundary (element 0, side 0)\n    boundaryElements[0].push([0, 0]);\n\n    // Right boundary (last element, side 1)\n    boundaryElements[1].push([this.numElementsX - 1, 1]);\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n\nexport class Mesh2D extends Mesh {\n  /**\n   * Constructor to initialize the 2D mesh\n   * @param {object} config - Configuration object for the 2D mesh\n   * @param {number} [config.numElementsX] - Number of elements along the x-axis (required for geometry-based mesh)\n   * @param {number} [config.maxX] - Maximum x-coordinate of the mesh (required for geometry-based mesh)\n   * @param {number} [config.numElementsY] - Number of elements along the y-axis (required for geometry-based mesh)\n   * @param {number} [config.maxY] - Maximum y-coordinate of the mesh (required for geometry-based mesh)\n   * @param {string} [config.elementOrder='linear'] - The order of elements, either 'linear' or 'quadratic'\n   * @param {object} [config.parsedMesh=null] - Optional pre-parsed mesh data\n   * @param {number} [config.angleLeft=90] - Left side skew angle in degrees (90 = vertical)\n   * @param {number} [config.angleRight=90] - Right side skew angle in degrees (90 = vertical)\n   */\n  constructor({\n    numElementsX = null,\n    maxX = null,\n    numElementsY = null,\n    maxY = null,\n    elementOrder = \"linear\",\n    parsedMesh = null,\n    angleLeft = 90,\n    angleRight = 90,\n  }) {\n    super({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      meshDimension: \"2D\",\n      elementOrder,\n      parsedMesh,\n    });\n\n    this.angleLeft = angleLeft;\n    this.angleRight = angleRight;\n\n    // Validate geometry parameters (when not using a parsed mesh)\n    if (\n      !parsedMesh &&\n      (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)\n    ) {\n      errorLog(\n        \"numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry\",\n      );\n    }\n  }\n\n  generateMesh() {\n    let nodesXCoordinates = [];\n    let nodesYCoordinates = [];\n    const xStart = 0;\n    const yStart = 0;\n    let totalNodesX, totalNodesY, deltaX, deltaY;\n\n    if (this.elementOrder === \"linear\") {\n      totalNodesX = this.numElementsX + 1;\n      totalNodesY = this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + nodeIndexY * deltaY;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + nodeIndexX * deltaX;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + nodeIndexY * deltaY;\n        }\n      }\n    } else if (this.elementOrder === \"quadratic\") {\n      totalNodesX = 2 * this.numElementsX + 1;\n      totalNodesY = 2 * this.numElementsY + 1;\n      deltaX = (this.maxX - xStart) / this.numElementsX;\n      deltaY = (this.maxY - yStart) / this.numElementsY;\n\n      nodesXCoordinates[0] = xStart;\n      nodesYCoordinates[0] = yStart;\n      for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n        nodesXCoordinates[nodeIndexY] = nodesXCoordinates[0];\n        nodesYCoordinates[nodeIndexY] = nodesYCoordinates[0] + (nodeIndexY * deltaY) / 2;\n      }\n      for (let nodeIndexX = 1; nodeIndexX < totalNodesX; nodeIndexX++) {\n        const nnode = nodeIndexX * totalNodesY;\n        nodesXCoordinates[nnode] = nodesXCoordinates[0] + (nodeIndexX * deltaX) / 2;\n        nodesYCoordinates[nnode] = nodesYCoordinates[0];\n        for (let nodeIndexY = 1; nodeIndexY < totalNodesY; nodeIndexY++) {\n          nodesXCoordinates[nnode + nodeIndexY] = nodesXCoordinates[nnode];\n          nodesYCoordinates[nnode + nodeIndexY] = nodesYCoordinates[nnode] + (nodeIndexY * deltaY) / 2;\n        }\n      }\n    }\n\n    // Angles are measured from the positive X-axis:\n    // 90° = vertical sides (rectangle)\n    // angleLeft < 90°  => left side leans right as y increases\n    // angleLeft > 90°  => left side leans left\n    // angleRight < 90° => right side leans left\n    // angleRight > 90° => right side leans right\n    if (this.angleLeft !== 90 || this.angleRight !== 90) {\n      const degToRad = Math.PI / 180;\n      const tanLeft = Math.tan(this.angleLeft * degToRad);\n      const tanRight = Math.tan(this.angleRight * degToRad);\n      const epsilon = 1e-12;\n\n      for (let nodeIndexY = 0; nodeIndexY < totalNodesY; nodeIndexY++) {\n        const rowBaseIndex = nodeIndexY;\n        const y = nodesYCoordinates[rowBaseIndex];\n        const xLeft = Math.abs(tanLeft) < epsilon ? 0 : y / tanLeft;\n        const xRight = Math.abs(tanRight) < epsilon ? this.maxX : this.maxX - y / tanRight;\n\n        for (let nodeIndexX = 0; nodeIndexX < totalNodesX; nodeIndexX++) {\n          const nnode = nodeIndexX * totalNodesY + nodeIndexY;\n          const t = totalNodesX === 1 ? 0 : nodeIndexX / (totalNodesX - 1);\n          nodesXCoordinates[nnode] = xLeft + (xRight - xLeft) * t;\n        }\n      }\n    }\n\n    // Generate nodal numbering (NOP) array\n    const nodalNumbering = this.generateNodalNumbering2D(\n      this.numElementsX,\n      this.numElementsY,\n      totalNodesY,\n      this.elementOrder,\n    );\n\n    // Find boundary elements\n    const boundaryElements = this.findBoundaryElements();\n\n    debugLog(\"Generated node X coordinates: \" + JSON.stringify(nodesXCoordinates));\n    debugLog(\"Generated node Y coordinates: \" + JSON.stringify(nodesYCoordinates));\n\n    // Return statement\n    return {\n      nodesXCoordinates,\n      nodesYCoordinates,\n      totalNodesX,\n      totalNodesY,\n      nodalNumbering,\n      boundaryElements,\n    };\n  }\n\n  /**\n   * Function to generate the nodal numbering (NOP) array for a structured mesh\n   * This array represents the connectivity between elements and their corresponding nodes\n   * @param {number} numElementsX - Number of elements along the x-axis\n   * @param {number} [numElementsY] - Number of elements along the y-axis (optional for 1D)\n   * @param {number} totalNodesX - Total number of nodes along the x-axis\n   * @param {number} [totalNodesY] - Total number of nodes along the y-axis (optional for 1D)\n   * @param {string} elementOrder - The order of elements, either 'linear' or 'quadratic'\n   * @returns {array} NOP - A two-dimensional array which represents the element-to-node connectivity for the entire mesh\n   */\n  generateNodalNumbering2D(numElementsX, numElementsY, totalNodesY, elementOrder) {\n    let elementIndex = 0;\n    let nop = [];\n\n    if (elementOrder === \"linear\") {\n      /**\n       * Linear rectangular elements with the following nodes representation:\n       *\n       *   1 --- 3\n       *   |     |\n       *   0 --- 2\n       *\n       */\n      let rowCounter = 0;\n      let columnCounter = 2;\n      for (let elementIndex = 0; elementIndex < numElementsX * numElementsY; elementIndex++) {\n        rowCounter += 1;\n        nop[elementIndex] = [];\n        nop[elementIndex][0] = elementIndex + columnCounter - 1;\n        nop[elementIndex][1] = elementIndex + columnCounter;\n        nop[elementIndex][2] = elementIndex + columnCounter + numElementsY;\n        nop[elementIndex][3] = elementIndex + columnCounter + numElementsY + 1;\n        if (rowCounter === numElementsY) {\n          columnCounter += 1;\n          rowCounter = 0;\n        }\n      }\n    } else if (elementOrder === \"quadratic\") {\n      /**\n       * Quadratic rectangular elements with the following nodes representation:\n       *\n       *   2--5--8\n       *   |     |\n       *   1  4  7\n       *   |     |\n       *   0--3--6\n       *\n       */\n      for (let elementIndexX = 1; elementIndexX <= numElementsX; elementIndexX++) {\n        for (let elementIndexY = 1; elementIndexY <= numElementsY; elementIndexY++) {\n          nop[elementIndex] = [];\n          for (let nodeIndex1 = 1; nodeIndex1 <= 3; nodeIndex1++) {\n            let nodeIndex2 = 3 * nodeIndex1 - 2;\n            nop[elementIndex][nodeIndex2 - 1] =\n              totalNodesY * (2 * elementIndexX + nodeIndex1 - 3) + 2 * elementIndexY - 1;\n            nop[elementIndex][nodeIndex2] = nop[elementIndex][nodeIndex2 - 1] + 1;\n            nop[elementIndex][nodeIndex2 + 1] = nop[elementIndex][nodeIndex2 - 1] + 2;\n          }\n          elementIndex = elementIndex + 1;\n        }\n      }\n    }\n\n    return nop;\n  }\n\n  /**\n   * Function to find the elements that belong to each boundary of a 2D domain\n   * @returns {array} An array containing arrays of elements and their adjacent boundary side for each boundary\n   * Each element in the array is of the form [elementIndex, side], where 'side' indicates which side\n   * of the reference element is in contact with the physical boundary:\n   * 0 - Bottom side of reference element (maps to physical bottom boundary in the case of a rectangular domain)\n   * 1 - Left side of reference element (maps to physical left boundary in the case of a rectangular domain)\n   * 2 - Top side of reference element (maps to physical top boundary in the case of a rectangular domain)\n   * 3 - Right side of reference element (maps to physical right boundary in the case of a rectangular domain)\n   */\n  findBoundaryElements() {\n    const boundaryElements = [];\n    const maxSides = 4; // Four sides for a rectangle 2D case (left, right, bottom, top)\n\n    for (let sideIndex = 0; sideIndex < maxSides; sideIndex++) {\n      boundaryElements.push([]);\n    }\n\n    // TODO: Why to loop through all elements? Is it not better to loop over only the\n    // elements that are on the boundary? eg: [0, this.numElementsX - 1] on x and\n    // [0, this.numElementsY - 1] on y\n    for (let elementIndexX = 0; elementIndexX < this.numElementsX; elementIndexX++) {\n      for (let elementIndexY = 0; elementIndexY < this.numElementsY; elementIndexY++) {\n        const elementIndex = elementIndexX * this.numElementsY + elementIndexY;\n\n        // Bottom boundary\n        if (elementIndexY === 0) {\n          boundaryElements[0].push([elementIndex, 0]);\n        }\n\n        // Left boundary\n        if (elementIndexX === 0) {\n          boundaryElements[1].push([elementIndex, 1]);\n        }\n\n        // Top boundary\n        if (elementIndexY === this.numElementsY - 1) {\n          boundaryElements[2].push([elementIndex, 2]);\n        }\n\n        // Right boundary\n        if (elementIndexX === this.numElementsX - 1) {\n          boundaryElements[3].push([elementIndex, 3]);\n        }\n      }\n    }\n\n    debugLog(\"Identified boundary elements by side: \" + JSON.stringify(boundaryElements));\n    this.boundaryElementsProcessed = true;\n    return boundaryElements;\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n/**\n * Class to handle numerical integration using Gauss quadrature\n */\nexport class NumericalIntegration {\n  /**\n   * Constructor to initialize the NumericalIntegration class\n   * @param {string} meshDimension - The dimension of the mesh\n   * @param {string} elementOrder - The order of elements\n   */\n  constructor({ meshDimension, elementOrder }) {\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to return Gauss points and weights based on element configuration\n   * @returns {object} An object containing:\n   *  - gaussPoints: Array of Gauss points\n   *  - gaussWeights: Array of Gauss weights\n   */\n  getGaussPointsAndWeights() {\n    let gaussPoints = []; // Gauss points\n    let gaussWeights = []; // Gauss weights\n\n    if (this.elementOrder === \"linear\") {\n      // For linear elements, use 1-point Gauss quadrature\n      gaussPoints[0] = 0.5;\n      gaussWeights[0] = 1;\n    } else if (this.elementOrder === \"quadratic\") {\n      // For quadratic elements, use 3-point Gauss quadrature\n      gaussPoints[0] = (1 - Math.sqrt(3 / 5)) / 2;\n      gaussPoints[1] = 0.5;\n      gaussPoints[2] = (1 + Math.sqrt(3 / 5)) / 2;\n      gaussWeights[0] = 5 / 18;\n      gaussWeights[1] = 8 / 18;\n      gaussWeights[2] = 5 / 18;\n    }\n\n    return { gaussPoints, gaussWeights };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"./basisFunctionsScript.js\";\nimport { Mesh1D, Mesh2D } from \"./meshGenerationScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to prepare the mesh for finite element analysis\n * @param {object} meshConfig - Object containing computational mesh details\n * @returns {object} An object containing all mesh-related data\n */\nexport function prepareMesh(meshConfig) {\n  const {\n    meshDimension,\n    numElementsX,\n    numElementsY,\n    maxX,\n    maxY,\n    elementOrder,\n    parsedMesh,\n    angleLeft,\n    angleRight,\n  } = meshConfig;\n\n  // Create a new instance of the Mesh class\n  let mesh;\n  if (meshDimension === \"1D\") {\n    mesh = new Mesh1D({ numElementsX, maxX, elementOrder, parsedMesh });\n  } else if (meshDimension === \"2D\") {\n    mesh = new Mesh2D({\n      numElementsX,\n      maxX,\n      numElementsY,\n      maxY,\n      elementOrder,\n      parsedMesh,\n      angleLeft,\n      angleRight,\n    });\n  } else {\n    errorLog(\"Mesh dimension must be either '1D' or '2D'\");\n  }\n\n  // Use the parsed mesh (e.g., from a Gmsh .msh import) if provided. Otherwise, generate a structured mesh\n  const nodesCoordinatesAndNumbering = mesh.boundaryElementsProcessed ? mesh.parsedMesh : mesh.generateMesh();\n\n  // Extract nodes coordinates and nodal numbering (NOP) from the mesh data\n  let nodesXCoordinates = nodesCoordinatesAndNumbering.nodesXCoordinates;\n  let nodesYCoordinates = nodesCoordinatesAndNumbering.nodesYCoordinates;\n  let totalNodesX = nodesCoordinatesAndNumbering.totalNodesX;\n  let totalNodesY = nodesCoordinatesAndNumbering.totalNodesY;\n  let nop = nodesCoordinatesAndNumbering.nodalNumbering;\n  let boundaryElements = nodesCoordinatesAndNumbering.boundaryElements;\n\n  // Check the mesh type\n  const isParsedMesh = parsedMesh !== undefined && parsedMesh !== null;\n\n  // Calculate totalElements and totalNodes based on mesh type\n  let totalElements, totalNodes;\n\n  if (isParsedMesh) {\n    totalElements = nop.length; // Number of elements is the length of the nodal numbering array\n    totalNodes = nodesXCoordinates.length; // Number of nodes is the length of the coordinates array\n    debugLog(`Using parsed mesh with ${totalElements} elements and ${totalNodes} nodes`);\n  } else {\n    // For structured mesh, calculate based on dimensions\n    totalElements = numElementsX * (meshDimension === \"2D\" ? numElementsY : 1);\n    totalNodes = totalNodesX * (meshDimension === \"2D\" ? totalNodesY : 1);\n    debugLog(`Using mesh generated from geometry with ${totalElements} elements and ${totalNodes} nodes`);\n  }\n\n  return {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    totalNodesX,\n    totalNodesY,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  };\n}\n\n/**\n * Function to initialize the FEA matrices and numerical tools\n * @param {object} meshData - Object containing mesh data from prepareMesh()\n * @returns {object} An object containing initialized matrices and numerical tools\n */\nexport function initializeFEA(meshData) {\n  const { totalNodes, nop, meshDimension, elementOrder } = meshData;\n\n  // Initialize variables for matrix assembly\n  let residualVector = [];\n  let jacobianMatrix = [];\n  let localToGlobalMap = [];\n\n  // Initialize jacobianMatrix and residualVector arrays\n  for (let nodeIndex = 0; nodeIndex < totalNodes; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalNodes; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize the BasisFunctions class\n  const basisFunctions = new BasisFunctions({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Initialize the NumericalIntegration class\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension,\n    elementOrder,\n  });\n\n  // Calculate Gauss points and weights\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Determine the number of nodes in the reference element based on the first element in the nop array\n  const nodesPerElement = nop[0].length;\n\n  return {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 1D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping1D(params) {\n  const { basisFunction, basisFunctionDerivKsi, nodesXCoordinates, localToGlobalMap, nodesPerElement } =\n    params;\n\n  let xCoordinates = 0;\n  let ksiDerivX = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX;\n\n  // Compute x-derivative of basis functions\n  let basisFunctionDerivX = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    basisFunctionDerivX[localNodeIndex] = basisFunctionDerivKsi[localNodeIndex] / detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n  };\n}\n\n/**\n * Function to perform isoparametric mapping for 2D elements\n * @param {object} params - Parameters for the mapping\n * @returns {object} An object containing the mapped data\n */\nexport function performIsoparametricMapping2D(params) {\n  const {\n    basisFunction,\n    basisFunctionDerivKsi,\n    basisFunctionDerivEta,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    localToGlobalMap,\n    nodesPerElement,\n  } = params;\n\n  let xCoordinates = 0;\n  let yCoordinates = 0;\n  let ksiDerivX = 0;\n  let etaDerivX = 0;\n  let ksiDerivY = 0;\n  let etaDerivY = 0;\n\n  // Isoparametric mapping\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    xCoordinates += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    yCoordinates += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunction[localNodeIndex];\n    ksiDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivX += nodesXCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n    ksiDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivKsi[localNodeIndex];\n    etaDerivY += nodesYCoordinates[localToGlobalMap[localNodeIndex]] * basisFunctionDerivEta[localNodeIndex];\n  }\n  let detJacobian = ksiDerivX * etaDerivY - etaDerivX * ksiDerivY;\n\n  // Compute x-derivative and y-derivative of basis functions\n  let basisFunctionDerivX = [];\n  let basisFunctionDerivY = [];\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    // The x-derivative of the n basis function\n    basisFunctionDerivX[localNodeIndex] =\n      (etaDerivY * basisFunctionDerivKsi[localNodeIndex] -\n        ksiDerivY * basisFunctionDerivEta[localNodeIndex]) /\n      detJacobian;\n    // The y-derivative of the n basis function\n    basisFunctionDerivY[localNodeIndex] =\n      (ksiDerivX * basisFunctionDerivEta[localNodeIndex] -\n        etaDerivX * basisFunctionDerivKsi[localNodeIndex]) /\n      detJacobian;\n  }\n\n  return {\n    xCoordinates,\n    yCoordinates,\n    detJacobian,\n    basisFunctionDerivX,\n    basisFunctionDerivY,\n  };\n}\n\n/**\n * Function to test if a point is inside a triangle using barycentric coordinates,\n * also returning the natural coordinates (ksi, eta).\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Triangle vertices [[x0,y0],[x1,y1],[x2,y2]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideTriangle(x, y, vertices) {\n  const tolerance = 1e-12;\n  const [v0, v1, v2] = vertices;\n\n  const denom = (v1[1] - v2[1]) * (v0[0] - v2[0]) + (v2[0] - v1[0]) * (v0[1] - v2[1]);\n\n  const ksi = ((v1[1] - v2[1]) * (x - v2[0]) + (v2[0] - v1[0]) * (y - v2[1])) / denom;\n  const eta = ((v2[1] - v0[1]) * (x - v2[0]) + (v0[0] - v2[0]) * (y - v2[1])) / denom;\n  const gamma = 1 - ksi - eta;\n\n  const inside = ksi >= -tolerance && eta >= -tolerance && gamma >= -tolerance;\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to test if a point is inside a quadrilateral by spliting it into triangles and using barycentric coordinates\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {object} Object containing inside boolean and natural coordinates {inside, ksi, eta}\n */\nexport function pointInsideQuadrilateral(x, y, vertices) {\n  const [firstTriangleVertices, secondTriangleVertices] = splitQuadrilateral(vertices);\n  const pointInsideFirstTriangle = pointInsideTriangle(x, y, firstTriangleVertices);\n  const pointInsideSecondTriangle = pointInsideTriangle(x, y, secondTriangleVertices);\n\n  const inside = pointInsideFirstTriangle.inside || pointInsideSecondTriangle.inside;\n  let ksi = 0;\n  let eta = 0;\n\n  if (inside) {\n    const [v0, v1, v2, v3] = vertices;\n\n    // Function to calculate distance from point to line segment\n    const getDistanceFromLine = (p1, p2) => {\n      const num = Math.abs((p2[0] - p1[0]) * (p1[1] - y) - (p1[0] - x) * (p2[1] - p1[1]));\n      const den = Math.sqrt((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1]) ** 2);\n      return num / den;\n    };\n\n    // Calculate distances to edges based on vertex order:\n    //   1 (v1) --- 3 (v3)\n    //   |          |\n    //   0 (v0) --- 2 (v2)\n\n    const distLeft = getDistanceFromLine(v0, v1);\n    const distRight = getDistanceFromLine(v2, v3);\n    const distBottom = getDistanceFromLine(v0, v2);\n    const distTop = getDistanceFromLine(v1, v3);\n\n    ksi = distLeft / (distLeft + distRight);\n    eta = distBottom / (distBottom + distTop);\n  }\n\n  return { inside, ksi, eta };\n}\n\n/**\n * Function to split the quadrilateral elements into two triangles\n * @param {array} vertices - Quadrilateral vertices [[x0,y0],[x1,y1],[x2,y2],[x3,y3]]\n * @returns {array} Array of triangle vertices: [[v0,v1,v3], [v0,v2,v3]]\n */\nexport function splitQuadrilateral(vertices) {\n  const [v0, v1, v2, v3] = vertices;\n  // Vertices order:\n  //   1 --- 3\n  //   |     |\n  //   0 --- 2\n  return [\n    [v0, v1, v3],\n    [v0, v2, v3],\n  ];\n}\n\n/**\n * Function that finds the list of adjacent elements for each node in the mesh\n * @param {object} meshData - Object containing nodal numbering (NOP)\n * @returns {object} Object containing:\n *  - nodeNeighbors: Indices of neighboring elements per node\n *  - neighborCount: Total number of neighboring elements per node\n */\nexport function computeNodeNeighbors(meshData) {\n  const { nop, nodesXCoordinates } = meshData;\n  const totalNodes = nodesXCoordinates.length;\n  const nodesPerElement = nop[0].length;\n\n  // Initialize arrays\n  const nodeNeighbors = Array.from({ length: totalNodes }, () => []);\n  const neighborCount = Array(totalNodes).fill(0);\n\n  // Loop through all elements\n  for (let elemIndex = 0; elemIndex < nop.length; elemIndex++) {\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      const nodeIndex = nop[elemIndex][localNodeIndex] - 1;\n\n      // Increment the total number of neighboring elements for this node\n      neighborCount[nodeIndex] = neighborCount[nodeIndex] + 1;\n\n      // Store the element index as a neighbor of this node\n      nodeNeighbors[nodeIndex].push(elemIndex);\n    }\n  }\n\n  return { nodeNeighbors, neighborCount };\n}\n\n/**\n * Function to extracts boundary line segments for ray casting\n * @param {object} meshData - Object containing mesh data\n * @returns {array} Array of segments\n */\nexport function getBoundarySegments(meshData) {\n  let boundaryLineElements = [];\n  let boundaryNodesSegments = [];\n  let boundaryGlobalElementIndex = 0;\n  let boundarySides;\n  const { nodesXCoordinates, nodesYCoordinates, nop, boundaryElements, meshDimension, elementOrder } =\n    meshData;\n\n  if (meshDimension === \"1D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0], // Node at the left side of the reference element\n        1: [1], // Node at the right side of the reference element\n      };\n    }\n  } else if (meshDimension === \"2D\") {\n    if (elementOrder === \"linear\") {\n      boundarySides = {\n        0: [0, 2], // Nodes at the bottom side of the reference element\n        1: [0, 1], // Nodes at the left side of the reference element\n        2: [1, 3], // Nodes at the top side of the reference element\n        3: [2, 3], // Nodes at the right side of the reference element\n      };\n    } else if (elementOrder === \"quadratic\") {\n      boundarySides = {\n        0: [0, 3, 6], // Nodes at the bottom side of the reference element\n        1: [0, 1, 2], // Nodes at the left side of the reference element\n        2: [2, 5, 8], // Nodes at the top side of the reference element\n        3: [6, 7, 8], // Nodes at the right side of the reference element\n      };\n    }\n  }\n\n  // Iterate over all boundaries\n  for (let boundaryIndex = 0; boundaryIndex < boundaryElements.length; boundaryIndex++) {\n    // Iterate over all elements in the current boundary\n    for (\n      let boundaryLocalElementIndex = 0;\n      boundaryLocalElementIndex < boundaryElements[boundaryIndex].length;\n      boundaryLocalElementIndex++\n    ) {\n      boundaryLineElements[boundaryGlobalElementIndex] =\n        boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      boundaryGlobalElementIndex++;\n      // Retrieve the element index and the side\n      const [elementIndex, side] = boundaryElements[boundaryIndex][boundaryLocalElementIndex];\n      let boundaryLocalNodeIndices = boundarySides[side];\n      let currentElementNodesX = [];\n      let currentElementNodesY = [];\n\n      for (\n        let boundaryLocalNodeIndex = 0;\n        boundaryLocalNodeIndex < boundaryLocalNodeIndices.length;\n        boundaryLocalNodeIndex++\n      ) {\n        const globalNodeIndex = nop[elementIndex][boundaryLocalNodeIndices[boundaryLocalNodeIndex]] - 1;\n\n        currentElementNodesX.push(nodesXCoordinates[globalNodeIndex]);\n        currentElementNodesY.push(nodesYCoordinates[globalNodeIndex]);\n      }\n\n      // Create segments for this element\n      for (let k = 0; k < currentElementNodesX.length - 1; k++) {\n        boundaryNodesSegments.push([\n          [currentElementNodesX[k], currentElementNodesY[k]],\n          [currentElementNodesX[k + 1], currentElementNodesY[k + 1]],\n        ]);\n      }\n    }\n  }\n  return boundaryNodesSegments;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle thermal boundary conditions application\n */\nexport class ThermalBoundaryConditions {\n  /**\n   * Constructor to initialize the ThermalBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions (Dirichlet type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the ConstantTemp value\n                residualVector[globalNodeIndex] = tempValue;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant temperature boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantTempBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantTemp\") {\n          const tempValue = this.boundaryConditions[boundaryKey][1];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,\n          );\n\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n\n                // Set boundary condition code and value\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = tempValue;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions (Robin type)\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   */\n  imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 1;\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              if (side === 0) {\n                // Node at the left side of the reference element\n                nodeIndex = 0;\n              } else {\n                // Node at the right side of the reference element\n                nodeIndex = 2;\n              }\n            }\n\n            const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n            debugLog(\n              `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            residualVector[globalNodeIndex] += -convectionCoeff * extTemp;\n            jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"convection\") {\n          const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n          const extTemp = convectionExtTemp[boundaryKey];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              let ksiDerivX = 0;\n              let ksiDerivY = 0;\n              let etaDerivX = 0;\n              let etaDerivY = 0;\n              const nodesPerElement = this.nop[elementIndex].length;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                // For boundaries along Ksi (horizontal), use Ksi derivatives\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                }\n                // For boundaries along Eta (vertical), use Eta derivatives\n                else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute the length of tangent vector\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                debugLog(\n                  `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${localNodeIndex + 1})`,\n                );\n\n                // Apply boundary condition with proper Jacobian for all sides\n                residualVector[globalNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                  jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  let globalNodeIndex = this.nop[elementIndex][localNodeIndex] - 1;\n                  debugLog(\n                    `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${\n                      elementIndex + 1\n                    }, local node ${localNodeIndex + 1})`,\n                  );\n\n                  // Apply boundary condition with proper Jacobian for all sides\n                  residualVector[globalNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    let globalNodeIndex2 = this.nop[elementIndex][localNodeIndex2] - 1;\n                    jacobianMatrix[globalNodeIndex][globalNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose convection boundary conditions for the frontal solver\n   * @param {number} elementIndex - Index of the element being processed\n   * @param {array} nodesXCoordinates - Array of x-coordinates of nodes\n   * @param {array} nodesYCoordinates - Array of y-coordinates of nodes\n   * @param {array} gaussPoints - Array of Gauss points for numerical integration\n   * @param {array} gaussWeights - Array of Gauss weights for numerical integration\n   * @param {object} basisFunctions - Object containing basis functions and their derivatives\n   * @returns {object} An object containing:\n   *  - localJacobianMatrix: Local Jacobian matrix with convection contributions\n   *  - localResidualVector: Residual vector with convection contributions\n   */\n  imposeConvectionBoundaryConditionsFront(\n    elementIndex,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    gaussPoints,\n    gaussWeights,\n    basisFunctions,\n  ) {\n    // Extract convection parameters from boundary conditions\n    let convectionHeatTranfCoeff = [];\n    let convectionExtTemp = [];\n    Object.keys(this.boundaryConditions).forEach((key) => {\n      const boundaryCondition = this.boundaryConditions[key];\n      if (boundaryCondition[0] === \"convection\") {\n        convectionHeatTranfCoeff[key] = boundaryCondition[1];\n        convectionExtTemp[key] = boundaryCondition[2];\n      }\n    });\n\n    // Initialize local Jacobian matrix and local residual vector\n    const nodesPerElement = this.nop[elementIndex].length;\n    const localJacobianMatrix = Array(nodesPerElement)\n      .fill()\n      .map(() => Array(nodesPerElement).fill(0));\n    const localResidualVector = Array(nodesPerElement).fill(0);\n\n    // Check if this element is on a convection boundary\n    for (const boundaryKey in this.boundaryElements) {\n      if (this.boundaryConditions[boundaryKey]?.[0] === \"convection\") {\n        const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];\n        const extTemp = convectionExtTemp[boundaryKey];\n        debugLog(\n          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,\n        );\n\n        // Find if this element is on this boundary and which side\n        const boundaryElement = this.boundaryElements[boundaryKey].find(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        );\n\n        if (boundaryElement) {\n          const side = boundaryElement[1];\n\n          if (this.meshDimension === \"1D\") {\n            // Handle 1D case\n            let nodeIndex;\n            if (this.elementOrder === \"linear\") {\n              nodeIndex = side === 0 ? 0 : 1;\n            } else if (this.elementOrder === \"quadratic\") {\n              nodeIndex = side === 0 ? 0 : 2;\n            }\n\n            // Add contribution to local Jacobian matrix and local residual vector\n            debugLog(\n              `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${\n                elementIndex + 1\n              }, local node ${nodeIndex + 1})`,\n            );\n            localResidualVector[nodeIndex] += -convectionCoeff * extTemp;\n            localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;\n          } else if (this.meshDimension === \"2D\") {\n            // Handle 2D case\n            if (this.elementOrder === \"linear\") {\n              let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n              if (side === 0) {\n                // Nodes at the bottom side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 0;\n                firstNodeIndex = 0;\n                lastNodeIndex = 3;\n                nodeIncrement = 2;\n              } else if (side === 1) {\n                // Nodes at the left side of the reference element\n                gaussPoint1 = 0;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 0;\n                lastNodeIndex = 2;\n                nodeIncrement = 1;\n              } else if (side === 2) {\n                // Nodes at the top side of the reference element\n                gaussPoint1 = gaussPoints[0];\n                gaussPoint2 = 1;\n                firstNodeIndex = 1;\n                lastNodeIndex = 4;\n                nodeIncrement = 2;\n              } else if (side === 3) {\n                // Nodes at the right side of the reference element\n                gaussPoint1 = 1;\n                gaussPoint2 = gaussPoints[0];\n                firstNodeIndex = 2;\n                lastNodeIndex = 4;\n                nodeIncrement = 1;\n              }\n\n              // Get basis functions\n              const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n              const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n              const basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n              const basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n              // Calculate tangent vector components\n              let ksiDerivX = 0,\n                ksiDerivY = 0,\n                etaDerivX = 0,\n                etaDerivY = 0;\n              for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                if (side === 0 || side === 2) {\n                  ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                } else if (side === 1 || side === 3) {\n                  etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                }\n              }\n\n              // Compute tangent vector length\n              let tangentVectorLength;\n              if (side === 0 || side === 2) {\n                tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n              } else {\n                tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n              }\n\n              // Apply boundary conditions to local matrices\n              for (\n                let localNodeIndex = firstNodeIndex;\n                localNodeIndex < lastNodeIndex;\n                localNodeIndex += nodeIncrement\n              ) {\n                localResidualVector[localNodeIndex] +=\n                  -gaussWeights[0] *\n                  tangentVectorLength *\n                  basisFunction[localNodeIndex] *\n                  convectionCoeff *\n                  extTemp;\n\n                for (\n                  let localNodeIndex2 = firstNodeIndex;\n                  localNodeIndex2 < lastNodeIndex;\n                  localNodeIndex2 += nodeIncrement\n                ) {\n                  localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                    -gaussWeights[0] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    basisFunction[localNodeIndex2] *\n                    convectionCoeff;\n                }\n              }\n            } else if (this.elementOrder === \"quadratic\") {\n              // Handle quadratic elements (similar pattern but with more Gauss points)\n              for (let gaussPointIndex = 0; gaussPointIndex < 3; gaussPointIndex++) {\n                let gaussPoint1, gaussPoint2, firstNodeIndex, lastNodeIndex, nodeIncrement;\n\n                if (side === 0) {\n                  // Nodes at the bottom side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 0;\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 7;\n                  nodeIncrement = 3;\n                } else if (side === 1) {\n                  // Nodes at the left side of the reference element\n                  gaussPoint1 = 0;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 0;\n                  lastNodeIndex = 3;\n                  nodeIncrement = 1;\n                } else if (side === 2) {\n                  // Nodes at the top side of the reference element\n                  gaussPoint1 = gaussPoints[gaussPointIndex];\n                  gaussPoint2 = 1;\n                  firstNodeIndex = 2;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 3;\n                } else if (side === 3) {\n                  // Nodes at the right side of the reference element\n                  gaussPoint1 = 1;\n                  gaussPoint2 = gaussPoints[gaussPointIndex];\n                  firstNodeIndex = 6;\n                  lastNodeIndex = 9;\n                  nodeIncrement = 1;\n                }\n                let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoint1, gaussPoint2);\n                let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n                let basisFunctionDerivKsi = basisFunctionsAndDerivatives.basisFunctionDerivKsi;\n                let basisFunctionDerivEta = basisFunctionsAndDerivatives.basisFunctionDerivEta;\n\n                let ksiDerivX = 0;\n                let ksiDerivY = 0;\n                let etaDerivX = 0;\n                let etaDerivY = 0;\n                const nodesPerElement = this.nop[elementIndex].length;\n                for (let nodeIndex = 0; nodeIndex < nodesPerElement; nodeIndex++) {\n                  const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n\n                  // For boundaries along Ksi (horizontal), use Ksi derivatives\n                  if (side === 0 || side === 2) {\n                    ksiDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                    ksiDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivKsi[nodeIndex];\n                  }\n                  // For boundaries along Eta (vertical), use Eta derivatives\n                  else if (side === 1 || side === 3) {\n                    etaDerivX += nodesXCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                    etaDerivY += nodesYCoordinates[globalNodeIndex] * basisFunctionDerivEta[nodeIndex];\n                  }\n                }\n\n                // Compute the length of tangent vector\n                let tangentVectorLength;\n                if (side === 0 || side === 2) {\n                  tangentVectorLength = Math.sqrt(ksiDerivX ** 2 + ksiDerivY ** 2);\n                } else {\n                  tangentVectorLength = Math.sqrt(etaDerivX ** 2 + etaDerivY ** 2);\n                }\n\n                // Apply boundary conditions to local matrices\n                for (\n                  let localNodeIndex = firstNodeIndex;\n                  localNodeIndex < lastNodeIndex;\n                  localNodeIndex += nodeIncrement\n                ) {\n                  localResidualVector[localNodeIndex] +=\n                    -gaussWeights[gaussPointIndex] *\n                    tangentVectorLength *\n                    basisFunction[localNodeIndex] *\n                    convectionCoeff *\n                    extTemp;\n\n                  for (\n                    let localNodeIndex2 = firstNodeIndex;\n                    localNodeIndex2 < lastNodeIndex;\n                    localNodeIndex2 += nodeIncrement\n                  ) {\n                    localJacobianMatrix[localNodeIndex][localNodeIndex2] +=\n                      -gaussWeights[gaussPointIndex] *\n                      tangentVectorLength *\n                      basisFunction[localNodeIndex] *\n                      basisFunction[localNodeIndex2] *\n                      convectionCoeff;\n                  }\n                }\n              }\n            }\n          }\n        }\n      }\n    }\n\n    return { localJacobianMatrix, localResidualVector };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { ThermalBoundaryConditions } from \"./thermalBoundaryConditionsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the solid heat transfer model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleHeatConductionMat(meshData, boundaryConditions) {\n  basicLog(\"Starting solid heat transfer matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D solid heat transfer\n      if (meshDimension === \"1D\") {\n        // Get basis functions for the current Gauss point\n        const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector is zero for this case\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n              -gaussWeights[gaussPointIndex1] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n          }\n        }\n      }\n      // 2D solid heat transfer\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n            // residualVector is zero for this case\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const thermalBoundaryConditions = new ThermalBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Convection boundary conditions\n  thermalBoundaryConditions.imposeConvectionBoundaryConditions(\n    residualVector,\n    jacobianMatrix,\n    gaussPoints,\n    gaussWeights,\n    nodesXCoordinates,\n    nodesYCoordinates,\n    basisFunctions,\n  );\n\n  // Impose ConstantTemp boundary conditions\n  thermalBoundaryConditions.imposeConstantTempBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Solid heat transfer matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the solid heat transfer model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - localResidualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleHeatConductionFront({ elementIndex, nop, meshData, basisFunctions, FEAData }) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  if (meshDimension === \"1D\") {\n    // 1D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex1],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Computation of Galerkin's residuals and local Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex1] *\n            detJacobian *\n            (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2]);\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    // 2D solid heat transfer\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Create mapping from local element space to global mesh (convert to 0-based indexing)\n        const localToGlobalMap = ngl.map((globalIndex) => globalIndex - 1);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle generic boundary conditions application\n */\nexport class GenericBoundaryConditions {\n  /**\n   * Constructor to initialize the GenericBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   */\n  constructor(boundaryConditions, boundaryElements, nop, meshDimension, elementOrder) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n  }\n\n  /**\n   * Function to impose Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Set the residual vector to the value\n                residualVector[globalNodeIndex] = value;\n                // Set the Jacobian matrix row to zero\n                for (let colIndex = 0; colIndex < residualVector.length; colIndex++) {\n                  jacobianMatrix[globalNodeIndex][colIndex] = 0;\n                }\n                // Set the diagonal entry of the Jacobian matrix to one\n                jacobianMatrix[globalNodeIndex][globalNodeIndex] = 1;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n\n  /**\n   * Function to impose constant value (Dirichlet) boundary conditions for the frontal solver\n   * @param {array} nodeConstraintCode - Array indicating boundary condition code for each node\n   * @param {array} boundaryValues - Array containing boundary condition values\n   */\n  imposeConstantValueBoundaryConditionsFront(nodeConstraintCode, boundaryValues) {\n    if (this.meshDimension === \"1D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                1: [1], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0], // Node at the left side of the reference element\n                2: [2], // Node at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    } else if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        if (this.boundaryConditions[boundaryKey][0] === \"constantValue\") {\n          const value = this.boundaryConditions[boundaryKey][1];\n          debugLog(`Boundary ${boundaryKey}: Applying constant value of ${value} (Dirichlet condition)`);\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            } else if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                debugLog(\n                  `  - Applied constant value to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                nodeConstraintCode[globalNodeIndex] = 1;\n                boundaryValues[globalNodeIndex] = value;\n              });\n            }\n          });\n        }\n      });\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport {\n  initializeFEA,\n  performIsoparametricMapping1D,\n  performIsoparametricMapping2D,\n} from \"../mesh/meshUtilsScript.js\";\nimport { basicLog, debugLog } from \"../utilities/loggingScript.js\";\n\n// Base viscous term that remains when eikonal equation is fully activated\nconst baseEikonalViscousTerm = 1e-2;\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the front propagation model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object}  An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleFrontPropagationMat(\n  meshData,\n  boundaryConditions,\n  solutionVector,\n  eikonalActivationFlag,\n) {\n  basicLog(\"Starting front propagation matrix assembly...\");\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n  debugLog(`eikonalViscousTerm: ${eikonalViscousTerm}`);\n  debugLog(`eikonalActivationFlag: ${eikonalActivationFlag}`);\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Map local element nodes to global mesh nodes\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      localToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      // 1D front propagation (eikonal) equation\n      if (meshDimension === \"1D\") {\n        // Unsupported 1D front propagation\n        errorLog(\"1D front propagation is not yet supported\");\n\n        // Get basis functions for the current Gauss point\n        let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n        // Perform isoparametric mapping\n        const mappingResult = performIsoparametricMapping1D({\n          basisFunction: basisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX } = mappingResult;\n        const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n        // Calculate solution derivative\n        let solutionDerivX = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // residualVector\n          // TODO residualVector calculation here\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n            // jacobianMatrix\n            // TODO jacobianMatrix calculation here\n          }\n        }\n      }\n      // 2D front propagation (eikonal) equation\n      else if (meshDimension === \"2D\") {\n        for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n          // Get basis functions for the current Gauss point\n          let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(\n            gaussPoints[gaussPointIndex1],\n            gaussPoints[gaussPointIndex2],\n          );\n\n          // Perform isoparametric mapping\n          const mappingResult = performIsoparametricMapping2D({\n            basisFunction: basisFunctionsAndDerivatives.basisFunction,\n            basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n            basisFunctionDerivEta: basisFunctionsAndDerivatives.basisFunctionDerivEta,\n            nodesXCoordinates,\n            nodesYCoordinates,\n            localToGlobalMap,\n            nodesPerElement,\n          });\n\n          // Extract mapping results\n          const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n          const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n          // Calculate solution derivatives\n          let solutionDerivX = 0;\n          let solutionDerivY = 0;\n          for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n            solutionDerivX +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n            solutionDerivY +=\n              solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n          }\n\n          // Computation of Galerkin's residuals and Jacobian matrix\n          for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n            let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n\n            // residualVector: Viscous term contribution (to stabilize the solution)\n            residualVector[localToGlobalMap1] +=\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivX[localNodeIndex1] *\n                solutionDerivX +\n              eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunctionDerivY[localNodeIndex1] *\n                solutionDerivY;\n\n            // residualVector: Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              residualVector[localToGlobalMap1] +=\n                eikonalActivationFlag *\n                (gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1] *\n                  Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                  gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2] *\n                    detJacobian *\n                    basisFunction[localNodeIndex1]);\n            }\n\n            for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n              let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n\n              // jacobianMatrix: Viscous term contribution\n              jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                -eikonalViscousTerm *\n                gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                  basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n              // jacobianMatrix: Eikonal equation contribution\n              if (eikonalActivationFlag !== 0) {\n                jacobianMatrix[localToGlobalMap1][localToGlobalMap2] +=\n                  eikonalActivationFlag *\n                    (-(\n                      detJacobian *\n                      solutionDerivX *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]\n                    ) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivX[localNodeIndex2] -\n                  eikonalActivationFlag *\n                    ((detJacobian *\n                      solutionDerivY *\n                      basisFunction[localNodeIndex1] *\n                      gaussWeights[gaussPointIndex1] *\n                      gaussWeights[gaussPointIndex2]) /\n                      Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                    basisFunctionDerivY[localNodeIndex2];\n              }\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Impose Dirichlet boundary conditions\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Front propagation matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the local Jacobian matrix and residual vector for the front propagation model when using the frontal system solver\n * @param {number} elementIndex - Index of the element being processed\n * @param {array} nop - Nodal connectivity array (element-to-node mapping)\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} basisFunctions - Object containing basis functions and their derivatives\n * @param {object} FEAData - Object containing FEA-related data\n * @param {array} solutionVector - The solution vector for non-linear equations\n * @param {number} eikonalActivationFlag - Activation parameter for the eikonal equation\n * @returns {object} An object containing:\n *  - localJacobianMatrix: Local Jacobian matrix\n *  - residualVector: Residual vector contributions\n *  - ngl: Array mapping local node indices to global node indices\n */\nexport function assembleFrontPropagationFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  solutionVector,\n  eikonalActivationFlag,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n\n  // Calculate eikonal viscous term\n  let eikonalViscousTerm = 1 - eikonalActivationFlag + baseEikonalViscousTerm; // Viscous term for the front propagation (eikonal) equation\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  // Loop over Gauss points\n  for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n    // 1D front propagation (eikonal) equation\n    if (meshDimension === \"1D\") {\n      // Unsupported 1D front propagation\n      errorLog(\"1D front propagation is not yet supported\");\n\n      // Get basis functions for the current Gauss point\n      let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1]);\n\n      // Perform isoparametric mapping\n      const mappingResult = performIsoparametricMapping1D({\n        basisFunction: basisFunctionsAndDerivatives.basisFunction,\n        basisFunctionDerivKsi: basisFunctionsAndDerivatives.basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Extract mapping results\n      const { detJacobian, basisFunctionDerivX } = mappingResult;\n      const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n      // Calculate solution derivative\n      let solutionDerivX = 0;\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        solutionDerivX +=\n          solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n      }\n\n      // Computation of Galerkin's residuals and Jacobian matrix\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n        // residualVector\n        // TODO residualVector calculation here\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          let localToGlobalMap2 = localToGlobalMap[localNodeIndex2];\n          // localJacobianMatrix\n          // TODO localJacobianMatrix calculation here\n        }\n      }\n      // 2D front propagation (eikonal) equation\n    } else if (meshDimension === \"2D\") {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi, basisFunctionDerivEta } =\n          basisFunctions.getBasisFunctions(gaussPoints[gaussPointIndex1], gaussPoints[gaussPointIndex2]);\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = performIsoparametricMapping2D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate solution derivatives\n        let solutionDerivX = 0;\n        let solutionDerivY = 0;\n        for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n          solutionDerivX +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivX[localNodeIndex];\n          solutionDerivY +=\n            solutionVector[localToGlobalMap[localNodeIndex]] * basisFunctionDerivY[localNodeIndex];\n        }\n\n        // Computation of Galerkin's residuals and Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          let localToGlobalMap1 = localToGlobalMap[localNodeIndex1];\n          // Viscous term contribution\n          localResidualVector[localNodeIndex1] +=\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivX[localNodeIndex1] *\n              solutionDerivX +\n            eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              basisFunctionDerivY[localNodeIndex1] *\n              solutionDerivY;\n\n          // Eikonal equation contribution\n          if (eikonalActivationFlag !== 0) {\n            localResidualVector[localNodeIndex1] +=\n              eikonalActivationFlag *\n              (gaussWeights[gaussPointIndex1] *\n                gaussWeights[gaussPointIndex2] *\n                detJacobian *\n                basisFunction[localNodeIndex1] *\n                Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2) -\n                gaussWeights[gaussPointIndex1] *\n                  gaussWeights[gaussPointIndex2] *\n                  detJacobian *\n                  basisFunction[localNodeIndex1]);\n          }\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            // Viscous term contribution\n            localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n              eikonalViscousTerm *\n              gaussWeights[gaussPointIndex1] *\n              gaussWeights[gaussPointIndex2] *\n              detJacobian *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // Eikonal equation contribution\n            if (eikonalActivationFlag !== 0) {\n              localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n                eikonalActivationFlag *\n                  (-(\n                    detJacobian *\n                    solutionDerivX *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]\n                  ) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivX[localNodeIndex2] -\n                eikonalActivationFlag *\n                  ((detJacobian *\n                    solutionDerivY *\n                    basisFunction[localNodeIndex1] *\n                    gaussWeights[gaussPointIndex1] *\n                    gaussWeights[gaussPointIndex2]) /\n                    Math.sqrt(solutionDerivX ** 2 + solutionDerivY ** 2 + 1e-8)) *\n                  basisFunctionDerivY[localNodeIndex2];\n            }\n          }\n        }\n      }\n    }\n  }\n\n  return { localJacobianMatrix, localResidualVector, ngl };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { initializeFEA } from \"../mesh/meshUtilsScript.js\";\nimport { assembleHeatConductionFront } from \"../models/heatConductionScript.js\";\nimport { ThermalBoundaryConditions } from \"../models/thermalBoundaryConditionsScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\nimport { GenericBoundaryConditions } from \"../models/genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n// Create object templates\nconst frontalData = {};\nconst frontalState = {};\nconst elementData = { currentElementIndex: 0 };\nconst frontStorage = {};\nlet basisFunctions;\n\n/**\n * Function to run the frontal solver and obtain results for plotting\n * @param {function} assembleFront - Matrix assembler based on the physical model\n * @param {object} meshData - Object containing mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} [options] - Additional options for the solver\n * @returns {object} An object containing the solution vector and node coordinates\n */\nexport function runFrontalSolver(assembleFront, meshData, boundaryConditions, options = {}) {\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const totalNodes = meshData.nodesXCoordinates.length;\n  const numElements = meshData.totalElements;\n  const nodesPerElement = FEAData.nodesPerElement;\n\n  // Calculate required array sizes\n  initializeFrontalArrays(nodesPerElement, numElements);\n\n  // Start timing for system solving (frontal algorithm)\n  basicLog(\"Solving system using frontal...\");\n  console.time(\"systemSolving\");\n\n  // Initialize basis functions\n  basisFunctions = new BasisFunctions({\n    meshDimension: meshData.meshDimension,\n    elementOrder: meshData.elementOrder,\n  });\n\n  // Copy node connectivity array into frontalData storage\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    for (let nodeIndex = 0; nodeIndex < FEAData.nodesPerElement; nodeIndex++) {\n      frontalData.nodalNumbering[elementIndex][nodeIndex] = meshData.nop[elementIndex][nodeIndex];\n    }\n  }\n\n  // Apply Dirichlet-type boundary conditions\n  // Initialize all nodes with no boundary condition\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.nodeConstraintCode[nodeIndex] = 0;\n    frontalData.boundaryValues[nodeIndex] = 0;\n  }\n\n  // Handle Dirichlet-type boundary conditions differently based on which solver is being used\n  let dirichletBoundaryConditionsHandler;\n  // Solid heat transfer model (heatConductionScript solver)\n  if (assembleFront === assembleHeatConductionFront) {\n    dirichletBoundaryConditionsHandler = new ThermalBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n    // Front propagation model (frontPropagationScript solver)\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    dirichletBoundaryConditionsHandler = new GenericBoundaryConditions(\n      boundaryConditions,\n      meshData.boundaryElements,\n      meshData.nop,\n      meshData.meshDimension,\n      meshData.elementOrder,\n    );\n\n    dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(\n      frontalData.nodeConstraintCode,\n      frontalData.boundaryValues,\n    );\n  }\n  // Initialize global residual vector\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.globalResidualVector[nodeIndex] = 0;\n  }\n\n  frontalState.totalNodes = meshData.nodesXCoordinates.length;\n  frontalState.writeFlag = 0;\n  frontalState.transformationFlag = 1;\n  frontalState.determinant = 1;\n\n  for (let elementIndex = 0; elementIndex < meshData.totalElements; elementIndex++) {\n    frontalState.nodesPerElement[elementIndex] = FEAData.nodesPerElement;\n  }\n\n  // Parameters for non-linear assemblers\n  frontalState.currentSolutionVector = options.solutionVector;\n  frontalState.eikonalActivationFlag = options.eikonalActivationFlag;\n\n  // Pass assembleFront and dirichletBoundaryConditionsHandler to runFrontalAlgorithm\n  runFrontalAlgorithm(meshData, FEAData, dirichletBoundaryConditionsHandler, assembleFront);\n\n  // Copy solution\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    frontalData.solutionVector[nodeIndex] = frontalState.globalSolutionVector[nodeIndex];\n  }\n\n  // Output results to console for debugging\n  const { nodesXCoordinates, nodesYCoordinates } = meshData;\n  for (let nodeIndex = 0; nodeIndex < meshData.nodesXCoordinates.length; nodeIndex++) {\n    if (meshData.meshDimension === \"1D\") {\n      // 1D case - only output X coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[\n          nodeIndex\n        ].toExponential(5)}`,\n      );\n    } else {\n      // 2D case - output X, Y coordinates and temperature\n      debugLog(\n        `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(\n          5,\n        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`,\n      );\n    }\n  }\n\n  console.timeEnd(\"systemSolving\");\n  basicLog(\"System solved successfully\");\n\n  const { nodesXCoordinates: finalNodesX, nodesYCoordinates: finalNodesY } = meshData;\n  return {\n    solutionVector: frontalData.solutionVector.slice(0, totalNodes),\n    nodesCoordinates: {\n      nodesXCoordinates: finalNodesX,\n      nodesYCoordinates: finalNodesY,\n    },\n  };\n}\n\n/**\n * Function to initialize arrays dynamically based on problem size\n * @param {number} nodesPerElement - Number of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n */\nfunction initializeFrontalArrays(nodesPerElement, numElements) {\n  // Use the actual number of elements from the mesh\n  frontalData.nodalNumbering = Array(numElements)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  frontalData.nodeConstraintCode = Array(nodesPerElement).fill(0);\n  frontalData.boundaryValues = Array(nodesPerElement).fill(0);\n  frontalData.globalResidualVector = Array(nodesPerElement).fill(0);\n  frontalData.solutionVector = Array(nodesPerElement).fill(0);\n  frontalData.topologyData = Array(numElements).fill(0);\n  frontalData.lateralData = Array(numElements).fill(0);\n\n  // Initialize frontalState arrays\n  frontalState.writeFlag = 0;\n  frontalState.totalNodes = nodesPerElement;\n  frontalState.transformationFlag = 0;\n  frontalState.nodesPerElement = Array(numElements).fill(0);\n  frontalState.determinant = 1;\n\n  // For matrix operations, estimate required size based on problem complexity\n  const systemSize = Math.max(nodesPerElement, 2000);\n  frontalState.globalSolutionVector = Array(systemSize).fill(0);\n  frontalState.frontDataIndex = 0;\n\n  // Initialize elementData arrays\n  elementData.localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  elementData.currentElementIndex = 0;\n\n  // Initialize frontStorage arrays\n  const frontSize = estimateFrontSize(nodesPerElement, numElements);\n  frontStorage.frontValues = Array(frontSize).fill(0);\n  frontStorage.columnHeaders = Array(systemSize).fill(0);\n  frontStorage.pivotRow = Array(systemSize).fill(0);\n  frontStorage.pivotData = Array(frontSize).fill(0);\n}\n\n/**\n * Function to estimate the required front size\n * @param {number} nodesPerElement - Number of of nodes per element\n * @param {number} numElements - Number of elements in the mesh\n * @returns {number} Estimated front size\n */\nfunction estimateFrontSize(nodesPerElement, numElements) {\n  const frontWidthEstimate = Math.max(\n    Math.ceil(Math.sqrt(numElements)) * nodesPerElement,\n    nodesPerElement * 2,\n  );\n  return frontWidthEstimate * numElements;\n}\n// Old function to estimate the required front size\n// function estimateFrontSize(nodesPerElement, numElements, nodesPerElement) {\n//   const frontWidthEstimate = Math.ceil(Math.sqrt(numElements) * nodesPerElement * 2);\n//   const frontSize = frontWidthEstimate * nodesPerElement * 4;\n//   return Math.max(frontSize, 10000);\n// }\n\n/**\n * Function to compute local Jacobian matrix and local residual vector\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  const elementIndex = elementData.currentElementIndex - 1;\n\n  // Guard against out-of-range indices\n  if (elementIndex < 0 || elementIndex >= meshData.totalElements) {\n    errorLog(`Skipping out-of-range elementIndex=${elementIndex} (totalElements=${meshData.totalElements})`);\n    return false;\n  }\n\n  // Domain terms\n  const { localJacobianMatrix, localResidualVector, ngl } = assembleFront({\n    elementIndex,\n    nop: frontalData.nodalNumbering,\n    meshData,\n    basisFunctions: basisFunctions,\n    FEAData,\n    // These are ignored by linear assemblers\n    solutionVector: frontalState.currentSolutionVector,\n    eikonalActivationFlag: frontalState.eikonalActivationFlag,\n  });\n\n  // Handle Robin-type boundary conditions differently based on which solver is being used\n  let boundaryLocalJacobianMatrix = Array(FEAData.nodesPerElement)\n    .fill()\n    .map(() => Array(FEAData.nodesPerElement).fill(0));\n  let boundaryResidualVector = Array(FEAData.nodesPerElement).fill(0);\n\n  // heatConductionScript solver\n  if (assembleFront === assembleHeatConductionFront) {\n    // Check if this element is on a Robin-type boundary\n    let isOnRobinTypeBoundary = false;\n    for (const boundaryKey in meshData.boundaryElements) {\n      if (\n        thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === \"convection\" &&\n        meshData.boundaryElements[boundaryKey].some(\n          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,\n        )\n      ) {\n        isOnRobinTypeBoundary = true;\n        break;\n      }\n    }\n\n    // Only calculate Robin-type for elements when required\n    if (isOnRobinTypeBoundary) {\n      const { gaussPoints, gaussWeights } = FEAData;\n      const result = thermalBoundaryConditions.imposeConvectionBoundaryConditionsFront(\n        elementIndex,\n        meshData.nodesXCoordinates,\n        meshData.nodesYCoordinates,\n        gaussPoints,\n        gaussWeights,\n        basisFunctions,\n      );\n      boundaryLocalJacobianMatrix = result.localJacobianMatrix;\n      boundaryResidualVector = result.localResidualVector;\n    }\n  } else if (assembleFront === assembleFrontPropagationFront) {\n    // For now, no Robin-type boundary conditions exist for any other solver\n  }\n\n  // Combine domain and boundary contributions\n  for (let localNodeI = 0; localNodeI < FEAData.nodesPerElement; localNodeI++) {\n    for (let localNodeJ = 0; localNodeJ < FEAData.nodesPerElement; localNodeJ++) {\n      elementData.localJacobianMatrix[localNodeI][localNodeJ] =\n        localJacobianMatrix[localNodeI][localNodeJ] + boundaryLocalJacobianMatrix[localNodeI][localNodeJ];\n    }\n  }\n\n  // Assemble local element residual\n  for (let localNodeIndex = 0; localNodeIndex < FEAData.nodesPerElement; localNodeIndex++) {\n    const globalNodeIndex = ngl[localNodeIndex] - 1;\n    frontalData.globalResidualVector[globalNodeIndex] +=\n      localResidualVector[localNodeIndex] + boundaryResidualVector[localNodeIndex];\n  }\n\n  return true;\n}\n\n/**\n * Function to implement the frontal solver algorithm\n * @param {object} meshData - Object containing mesh data\n * @param {object} FEAData - Object containing FEA-related data\n * @param {object} thermalBoundaryConditions - Object containing thermal boundary conditions\n * @param {function} assembleFront - Matrix assembler based on the physical model\n */\nfunction runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assembleFront) {\n  // Allocate local arrays dynamically\n  const totalElements = meshData.totalElements;\n  const nodesPerElement = meshData.nodesXCoordinates.length;\n  const systemSize = Math.max(nodesPerElement, frontalState.globalSolutionVector.length);\n  let localDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowDestination = Array(FEAData.nodesPerElement).fill(0);\n  let rowHeaders = Array(systemSize).fill(0);\n  let pivotRowIndices = Array(systemSize).fill(0);\n  let pivotColumnIndices = Array(systemSize).fill(0);\n  let modifiedRows = Array(systemSize).fill(0);\n  let pivotColumn = Array(systemSize).fill(0);\n  let frontMatrix = Array(systemSize)\n    .fill()\n    .map(() => Array(systemSize).fill(0));\n  let rowSwapCount = Array(nodesPerElement).fill(0);\n  let columnSwapCount = Array(nodesPerElement).fill(0);\n  let lastAppearanceCheck = Array(nodesPerElement).fill(0);\n  let pivotColumnGlobalIndex; // Pivot column global index\n\n  let frontDataCounter = 1;\n  frontalState.writeFlag++;\n  let pivotDataIndex = 1;\n  let summedRows = 1;\n  elementData.currentElementIndex = 0;\n\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    rowSwapCount[nodeIndex] = 0;\n    columnSwapCount[nodeIndex] = 0;\n  }\n\n  if (frontalState.transformationFlag !== 0) {\n    // Prefront: find last appearance of each node\n    for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n      lastAppearanceCheck[nodeIndex] = 0;\n    }\n\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      let reverseElementIndex = totalElements - elementIndex - 1;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < frontalState.nodesPerElement[reverseElementIndex];\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        if (lastAppearanceCheck[globalNodeIndex - 1] === 0) {\n          lastAppearanceCheck[globalNodeIndex - 1] = 1;\n          frontalData.nodalNumbering[reverseElementIndex][localNodeIndex] =\n            -frontalData.nodalNumbering[reverseElementIndex][localNodeIndex];\n        }\n      }\n    }\n  }\n\n  frontalState.transformationFlag = 0;\n  let columnCount = 0;\n  let rowCount = 0;\n\n  for (let i = 0; i < systemSize; i++) {\n    for (let j = 0; j < systemSize; j++) {\n      frontMatrix[j][i] = 0;\n    }\n  }\n\n  while (true) {\n    // Assemble a new element only while we still have elements\n    let assembled = false;\n    let numElementNodes = 0;\n    let numElementColumns = 0;\n\n    if (elementData.currentElementIndex < totalElements) {\n      elementData.currentElementIndex++;\n      assembled = assembleElementContribution(meshData, FEAData, thermalBoundaryConditions, assembleFront);\n    }\n\n    if (assembled) {\n      const currentElement = elementData.currentElementIndex;\n      numElementNodes = frontalState.nodesPerElement[currentElement - 1];\n      numElementColumns = frontalState.nodesPerElement[currentElement - 1];\n\n      for (let localNodeIndex = 0; localNodeIndex < numElementColumns; localNodeIndex++) {\n        let globalNodeIndex = frontalData.nodalNumbering[currentElement - 1][localNodeIndex];\n        let columnIndex;\n\n        if (columnCount === 0) {\n          columnCount++;\n          localDestination[localNodeIndex] = columnCount;\n          frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n        } else {\n          for (columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(frontStorage.columnHeaders[columnIndex])) break;\n          }\n\n          if (columnIndex === columnCount) {\n            columnCount++;\n            localDestination[localNodeIndex] = columnCount;\n            frontStorage.columnHeaders[columnCount - 1] = globalNodeIndex;\n          } else {\n            localDestination[localNodeIndex] = columnIndex + 1;\n            frontStorage.columnHeaders[columnIndex] = globalNodeIndex;\n          }\n        }\n\n        let rowIndex;\n        if (rowCount === 0) {\n          rowCount++;\n          rowDestination[localNodeIndex] = rowCount;\n          rowHeaders[rowCount - 1] = globalNodeIndex;\n        } else {\n          for (rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n            if (Math.abs(globalNodeIndex) === Math.abs(rowHeaders[rowIndex])) break;\n          }\n\n          if (rowIndex === rowCount) {\n            rowCount++;\n            rowDestination[localNodeIndex] = rowCount;\n            rowHeaders[rowCount - 1] = globalNodeIndex;\n          } else {\n            rowDestination[localNodeIndex] = rowIndex + 1;\n            rowHeaders[rowIndex] = globalNodeIndex;\n          }\n        }\n      }\n\n      if (rowCount > systemSize || columnCount > systemSize) {\n        errorLog(\"Error: systemSize not large enough\");\n        return;\n      }\n\n      for (let localColumnIndex = 0; localColumnIndex < numElementColumns; localColumnIndex++) {\n        let frontColumnIndex = localDestination[localColumnIndex];\n        for (let localRowIndex = 0; localRowIndex < numElementNodes; localRowIndex++) {\n          let frontRowIndex = rowDestination[localRowIndex];\n          frontMatrix[frontRowIndex - 1][frontColumnIndex - 1] +=\n            elementData.localJacobianMatrix[localRowIndex][localColumnIndex];\n        }\n      }\n    }\n\n    // Pivoting/elimination continues whether or not a new element was assembled\n    let availableColumnCount = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      if (frontStorage.columnHeaders[columnIndex] < 0) {\n        pivotColumnIndices[availableColumnCount] = columnIndex + 1;\n        availableColumnCount++;\n      }\n    }\n\n    let constrainedRowCount = 0;\n    let availableRowCount = 0;\n    for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n      let globalNodeIndex = rowHeaders[rowIndex];\n      if (globalNodeIndex < 0) {\n        pivotRowIndices[availableRowCount] = rowIndex + 1;\n        availableRowCount++;\n        let absoluteNodeIndex = Math.abs(globalNodeIndex);\n        if (frontalData.nodeConstraintCode[absoluteNodeIndex - 1] === 1) {\n          modifiedRows[constrainedRowCount] = rowIndex + 1;\n          constrainedRowCount++;\n          frontalData.nodeConstraintCode[absoluteNodeIndex - 1] = 2;\n          frontalData.globalResidualVector[absoluteNodeIndex - 1] =\n            frontalData.boundaryValues[absoluteNodeIndex - 1];\n        }\n      }\n    }\n\n    if (constrainedRowCount > 0) {\n      for (let constrainedIndex = 0; constrainedIndex < constrainedRowCount; constrainedIndex++) {\n        let rowIndex = modifiedRows[constrainedIndex] - 1;\n        let globalNodeIndex = Math.abs(rowHeaders[rowIndex]);\n        for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n          frontMatrix[rowIndex][columnIndex] = 0;\n          let columnGlobalIndex = Math.abs(frontStorage.columnHeaders[columnIndex]);\n          if (columnGlobalIndex === globalNodeIndex) frontMatrix[rowIndex][columnIndex] = 1;\n        }\n      }\n    }\n\n    if (availableColumnCount > summedRows || elementData.currentElementIndex < totalElements) {\n      if (availableColumnCount === 0) {\n        errorLog(\"Error: no more rows fully summed\");\n        return;\n      }\n\n      let pivotRowIndex = pivotRowIndices[0];\n      let pivotColumnIndex = pivotColumnIndices[0];\n      let pivotValue = frontMatrix[pivotRowIndex - 1][pivotColumnIndex - 1];\n\n      if (Math.abs(pivotValue) < 1e-4) {\n        pivotValue = 0;\n        for (let columnIndex = 0; columnIndex < availableColumnCount; columnIndex++) {\n          let testColumnIndex = pivotColumnIndices[columnIndex];\n          for (let rowIndex = 0; rowIndex < availableRowCount; rowIndex++) {\n            let testRowIndex = pivotRowIndices[rowIndex];\n            let testValue = frontMatrix[testRowIndex - 1][testColumnIndex - 1];\n            if (Math.abs(testValue) > Math.abs(pivotValue)) {\n              pivotValue = testValue;\n              pivotColumnIndex = testColumnIndex;\n              pivotRowIndex = testRowIndex;\n            }\n          }\n        }\n      }\n\n      let pivotGlobalRowIndex = Math.abs(rowHeaders[pivotRowIndex - 1]);\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]); // Assign, don't declare\n      let permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n        if (nodeIndex >= pivotGlobalRowIndex) rowSwapCount[nodeIndex]--;\n        if (nodeIndex >= pivotColumnGlobalIndex) columnSwapCount[nodeIndex]--;\n      }\n\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontMatrix[pivotRowIndex - 1][columnIndex] / pivotValue;\n      }\n\n      let rightHandSide = frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] = rightHandSide;\n      pivotColumn[pivotRowIndex - 1] = pivotValue;\n\n      if (pivotRowIndex > 1) {\n        for (let rowIndex = 0; rowIndex < pivotRowIndex - 1; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1 && eliminationFactor !== 0) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex] -= eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      if (pivotRowIndex < rowCount) {\n        for (let rowIndex = pivotRowIndex; rowIndex < rowCount; rowIndex++) {\n          let globalRowIndex = Math.abs(rowHeaders[rowIndex]);\n          let eliminationFactor = frontMatrix[rowIndex][pivotColumnIndex - 1];\n          pivotColumn[rowIndex] = eliminationFactor;\n          if (pivotColumnIndex > 1) {\n            for (let columnIndex = 0; columnIndex < pivotColumnIndex - 1; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          if (pivotColumnIndex < columnCount) {\n            for (let columnIndex = pivotColumnIndex; columnIndex < columnCount; columnIndex++) {\n              frontMatrix[rowIndex - 1][columnIndex - 1] =\n                frontMatrix[rowIndex][columnIndex] - eliminationFactor * frontStorage.pivotRow[columnIndex];\n            }\n          }\n          frontalData.globalResidualVector[globalRowIndex - 1] -= eliminationFactor * rightHandSide;\n        }\n      }\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = pivotColumn[i];\n      }\n      pivotDataIndex += rowCount;\n\n      for (let i = 0; i < rowCount; i++) {\n        frontStorage.pivotData[pivotDataIndex + i - 1] = rowHeaders[i];\n      }\n      pivotDataIndex += rowCount;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.pivotRow[i];\n      }\n      frontDataCounter += columnCount;\n\n      for (let i = 0; i < columnCount; i++) {\n        frontStorage.frontValues[frontDataCounter - 1 + i] = frontStorage.columnHeaders[i];\n      }\n      frontDataCounter += columnCount;\n\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      for (let rowIndex = 0; rowIndex < rowCount; rowIndex++) {\n        frontMatrix[rowIndex][columnCount - 1] = 0;\n      }\n\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontMatrix[rowCount - 1][columnIndex] = 0;\n      }\n\n      columnCount--;\n      if (pivotColumnIndex < columnCount + 1) {\n        for (let columnIndex = pivotColumnIndex - 1; columnIndex < columnCount; columnIndex++) {\n          frontStorage.columnHeaders[columnIndex] = frontStorage.columnHeaders[columnIndex + 1];\n        }\n      }\n\n      rowCount--;\n      if (pivotRowIndex < rowCount + 1) {\n        for (let rowIndex = pivotRowIndex - 1; rowIndex < rowCount; rowIndex++) {\n          rowHeaders[rowIndex] = rowHeaders[rowIndex + 1];\n        }\n      }\n\n      if (rowCount > 1 || elementData.currentElementIndex < totalElements) continue;\n\n      pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[0]); // Assign, don't declare\n      pivotRowIndex = 1;\n      pivotValue = frontMatrix[0][0];\n      pivotGlobalRowIndex = Math.abs(rowHeaders[0]);\n      pivotColumnIndex = 1;\n      permutationHelper =\n        pivotGlobalRowIndex +\n        pivotColumnGlobalIndex +\n        rowSwapCount[pivotGlobalRowIndex - 1] +\n        columnSwapCount[pivotColumnGlobalIndex - 1];\n      frontalState.determinant =\n        (frontalState.determinant * pivotValue * (-1) ** permutationHelper) / Math.abs(pivotValue);\n\n      frontStorage.pivotRow[0] = 1;\n      if (Math.abs(pivotValue) < 1e-10) {\n        errorLog(\n          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,\n        );\n      }\n\n      if (pivotValue === 0) return;\n\n      frontalData.globalResidualVector[pivotGlobalRowIndex - 1] =\n        frontalData.globalResidualVector[pivotGlobalRowIndex - 1] / pivotValue;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.pivotRow[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = frontStorage.columnHeaders[0];\n      frontDataCounter++;\n      frontStorage.frontValues[frontDataCounter - 1] = pivotGlobalRowIndex;\n      frontStorage.frontValues[frontDataCounter] = columnCount;\n      frontStorage.frontValues[frontDataCounter + 1] = pivotColumnIndex;\n      frontStorage.frontValues[frontDataCounter + 2] = pivotValue;\n      frontDataCounter += 4;\n\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotColumn[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = rowHeaders[0];\n      pivotDataIndex++;\n      frontStorage.pivotData[pivotDataIndex - 1] = pivotRowIndex;\n      pivotDataIndex++;\n\n      frontalState.frontDataIndex = frontDataCounter;\n      if (frontalState.writeFlag === 1)\n        debugLog(`total ecs transfer in matrix reduction=${frontDataCounter}`);\n\n      // Back substitution\n      performBackSubstitution(frontDataCounter);\n      break;\n    }\n  }\n}\n\n/**\n * Function to perform back substitution for the frontal solver\n * @param {number} frontDataCounter - Index counter for the element contributions\n */\nfunction performBackSubstitution(frontDataCounter) {\n  for (let nodeIndex = 0; nodeIndex < frontalState.totalNodes; nodeIndex++) {\n    frontalState.globalSolutionVector[nodeIndex] = frontalData.boundaryValues[nodeIndex];\n  }\n\n  for (let iterationIndex = 1; iterationIndex <= frontalState.totalNodes; iterationIndex++) {\n    frontDataCounter -= 4;\n    let pivotGlobalRowIndex = frontStorage.frontValues[frontDataCounter - 1];\n    let columnCount = frontStorage.frontValues[frontDataCounter];\n    let pivotColumnIndex = frontStorage.frontValues[frontDataCounter + 1];\n    let pivotValue = frontStorage.frontValues[frontDataCounter + 2];\n\n    if (iterationIndex === 1) {\n      frontDataCounter--;\n      frontStorage.columnHeaders[0] = frontStorage.frontValues[frontDataCounter - 1];\n      frontDataCounter--;\n      frontStorage.pivotRow[0] = frontStorage.frontValues[frontDataCounter - 1];\n    } else {\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.columnHeaders[columnIndex] =\n          frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n      frontDataCounter -= columnCount;\n      for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n        frontStorage.pivotRow[columnIndex] = frontStorage.frontValues[frontDataCounter - 1 + columnIndex];\n      }\n    }\n\n    let pivotColumnGlobalIndex = Math.abs(frontStorage.columnHeaders[pivotColumnIndex - 1]);\n    if (frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] > 0) continue;\n\n    let accumulatedValue = 0;\n    frontStorage.pivotRow[pivotColumnIndex - 1] = 0;\n    for (let columnIndex = 0; columnIndex < columnCount; columnIndex++) {\n      accumulatedValue -=\n        frontStorage.pivotRow[columnIndex] *\n        frontalState.globalSolutionVector[Math.abs(frontStorage.columnHeaders[columnIndex]) - 1];\n    }\n\n    frontalState.globalSolutionVector[pivotColumnGlobalIndex - 1] =\n      accumulatedValue + frontalData.globalResidualVector[pivotGlobalRowIndex - 1];\n\n    frontalData.nodeConstraintCode[pivotColumnGlobalIndex - 1] = 1;\n  }\n\n  if (frontalState.writeFlag === 1)\n    debugLog(`value of frontDataCounter after backsubstitution=${frontDataCounter}`);\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { euclideanNorm } from \"../methods/euclideanNormScript.js\";\nimport { solveLinearSystem } from \"./linearSystemSolverScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\nimport { runFrontalSolver } from \"./frontalSolverScript.js\";\nimport { assembleFrontPropagationFront } from \"../models/frontPropagationScript.js\";\n\n/**\n * Function to solve a system of non-linear equations using the Newton-Raphson method\n * @param {function} assembleMat - Matrix assembler based on the physical model\n * @param {object} context - Context object containing simulation data and options\n * @returns {object} An object containing:\n *  - solutionVector: The solution vector\n *  - iterations: The number of iterations performed\n *  - converged: Boolean indicating whether the method converged\n */\n\nexport function newtonRaphson(assembleMat, context = {}) {\n  let errorNorm = 0;\n  let converged = false;\n  let iterations = 0;\n  let deltaX = [];\n  let solutionVector = [];\n  let jacobianMatrix = [];\n  let residualVector = [];\n\n  // Extract context\n  const { maxIterations = 100, tolerance = 1e-4 } = context;\n\n  // Calculate system size\n  let totalNodes = context.meshData.nodesXCoordinates.length;\n\n  // Initialize arrays with proper size\n  for (let i = 0; i < totalNodes; i++) {\n    deltaX[i] = 0;\n    solutionVector[i] = 0;\n  }\n\n  // Initialize solution from context if available\n  if (context.initialSolution && context.initialSolution.length === totalNodes) {\n    solutionVector = [...context.initialSolution];\n  }\n\n  while (iterations < maxIterations && !converged) {\n    // Update solution\n    for (let i = 0; i < solutionVector.length; i++) {\n      solutionVector[i] = Number(solutionVector[i]) + Number(deltaX[i]);\n    }\n\n    // Check if using frontal solver\n    if (context.solverMethod === \"frontal\") {\n      const frontalResult = runFrontalSolver(\n        assembleFrontPropagationFront,\n        context.meshData,\n        context.boundaryConditions,\n        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag },\n      );\n      deltaX = frontalResult.solutionVector;\n    } else {\n      // Compute Jacobian and residual matrices\n      ({ jacobianMatrix, residualVector } = assembleMat(\n        context.meshData,\n        context.boundaryConditions,\n        solutionVector, // The solution vector is required in the case of a non-linear equation\n        context.eikonalActivationFlag, // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)\n      ));\n\n      // Solve the linear system based on the specified solver method\n      const linearSystemResult = solveLinearSystem(context.solverMethod, jacobianMatrix, residualVector);\n      deltaX = linearSystemResult.solutionVector;\n    }\n\n    // Check convergence\n    errorNorm = euclideanNorm(deltaX);\n\n    // Norm for each iteration\n    basicLog(`Newton-Raphson iteration ${iterations + 1}: Error norm = ${errorNorm.toExponential(4)}`);\n\n    if (errorNorm <= tolerance) {\n      converged = true;\n    } else if (errorNorm > 1e2) {\n      errorLog(`Solution not converged. Error norm: ${errorNorm}`);\n      break;\n    }\n\n    iterations++;\n  }\n\n  return {\n    solutionVector,\n    converged,\n    iterations,\n    jacobianMatrix,\n    residualVector,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Class to handle flow boundary conditions application for Stokes and Navier-Stokes models\n */\nexport class FlowBoundaryConditions {\n  /**\n   * Constructor to initialize the FlowBoundaryConditions class\n   * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n   * @param {array} boundaryElements - Array containing elements that belong to each boundary\n   * @param {array} nop - Nodal numbering (NOP) array representing the connectivity between elements and nodes\n   * @param {string} meshDimension - The dimension of the mesh (e.g., \"2D\")\n   * @param {string} elementOrder - The order of elements (e.g., \"linear\", \"quadratic\")\n   * @param {number} totalNodesVelocity - Total number of velocity nodes (Q2)\n   * @param {number} totalNodesPressure - Total number of pressure nodes (Q1)\n   * @param {Map} q2ToPressureMap - Map from global Q2 node index to pressure DOF index\n   */\n  constructor(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  ) {\n    this.boundaryConditions = boundaryConditions;\n    this.boundaryElements = boundaryElements;\n    this.nop = nop;\n    this.meshDimension = meshDimension;\n    this.elementOrder = elementOrder;\n    this.totalNodesVelocity = totalNodesVelocity;\n    this.totalNodesPressure = totalNodesPressure;\n    this.q2ToPressureMap = q2ToPressureMap;\n  }\n\n  /**\n   * Function to impose velocity Dirichlet boundary conditions\n   * @param {array} residualVector - The residual vector to be modified\n   * @param {array} jacobianMatrix - The Jacobian matrix to be modified\n   *\n   * For consistency across both linear and nonlinear formulations,\n   * this project always refers to the assembled right-hand side vector\n   * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n   *\n   * In linear problems `jacobianMatrix` is equivalent to the\n   * classic stiffness/conductivity matrix and `residualVector`\n   * corresponds to the traditional load (RHS) vector.\n   *\n   * Supported boundary condition types:\n   *  - \"constantVelocity\": Set velocity components at boundary nodes\n   *    Format: [\"constantVelocity\", uValue, vValue]\n   *  - \"stressFree\": Natural boundary condition (zero traction), no assembly needed\n   *    Format: [\"stressFree\"]\n   */\n  imposeDirichletBoundaryConditions(residualVector, jacobianMatrix) {\n    const totalDOFs = residualVector.length;\n    let hasStressFree = false;\n\n    if (this.meshDimension === \"2D\") {\n      Object.keys(this.boundaryConditions).forEach((boundaryKey) => {\n        const bcType = this.boundaryConditions[boundaryKey][0];\n\n        if (bcType === \"stressFree\") {\n          hasStressFree = true;\n          // Natural boundary condition - no explicit assembly needed\n          debugLog(`Boundary ${boundaryKey}: Applying stress-free condition (natural BC)`);\n        } else if (bcType === \"constantVelocity\") {\n          const uValue = this.boundaryConditions[boundaryKey][1];\n          const vValue = this.boundaryConditions[boundaryKey][2];\n          debugLog(\n            `Boundary ${boundaryKey}: Applying constant velocity condition (u=${uValue}, v=${vValue})`,\n          );\n          this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {\n            if (this.elementOrder === \"quadratic\") {\n              const boundarySides = {\n                0: [0, 3, 6], // Nodes at the bottom side of the reference element\n                1: [0, 1, 2], // Nodes at the left side of the reference element\n                2: [2, 5, 8], // Nodes at the top side of the reference element\n                3: [6, 7, 8], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            } else if (this.elementOrder === \"linear\") {\n              const boundarySides = {\n                0: [0, 2], // Nodes at the bottom side of the reference element\n                1: [0, 1], // Nodes at the left side of the reference element\n                2: [1, 3], // Nodes at the top side of the reference element\n                3: [2, 3], // Nodes at the right side of the reference element\n              };\n              boundarySides[side].forEach((nodeIndex) => {\n                const globalNodeIndex = this.nop[elementIndex][nodeIndex] - 1;\n                const uDOF = globalNodeIndex;\n                const vDOF = this.totalNodesVelocity + globalNodeIndex;\n                debugLog(\n                  `  - Applied velocity Dirichlet to node ${globalNodeIndex + 1} (element ${\n                    elementIndex + 1\n                  }, local node ${nodeIndex + 1})`,\n                );\n                // Apply u-velocity Dirichlet boundary condition\n                residualVector[uDOF] = uValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[uDOF][colIndex] = 0;\n                }\n                jacobianMatrix[uDOF][uDOF] = 1;\n\n                // Apply v-velocity Dirichlet boundary condition\n                residualVector[vDOF] = vValue;\n                for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n                  jacobianMatrix[vDOF][colIndex] = 0;\n                }\n                jacobianMatrix[vDOF][vDOF] = 1;\n              });\n            }\n          });\n        }\n      });\n\n      // If no stress-free boundary exists, pin pressure at one node to remove null space\n      // (pressure is determined only up to a constant for all-Dirichlet velocity problems)\n      if (!hasStressFree) {\n        const pDOF = 2 * this.totalNodesVelocity; // First pressure DOF\n        for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n          jacobianMatrix[pDOF][colIndex] = 0;\n        }\n        jacobianMatrix[pDOF][pDOF] = 1;\n        residualVector[pDOF] = 0;\n        debugLog(\"Pinned pressure at first pressure node (p = 0) to remove null space\");\n      }\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to create plots of the solution vector\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionVector = result.solutionVector;\n  const solverConfig = model.solverConfig;\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // Check if solutionVector is a nested array\n    let yData;\n    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {\n      yData = solutionVector.map((arr) => arr[0]);\n    } else {\n      yData = solutionVector;\n    }\n    let xData = Array.from(nodesXCoordinates);\n\n    let lineData = {\n      x: nodesXCoordinates,\n      y: yData,\n      mode: \"lines\",\n      type: \"scatter\",\n      line: { color: \"rgb(219, 64, 82)\", width: 2 },\n      name: \"Solution\",\n    };\n\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = 300;\n\n    let layout = {\n      title: `line plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: { title: \"Solution\" },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n    };\n\n    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    // Check if solutionVector is a nested array\n    let zData;\n    if (Array.isArray(solutionVector[0])) {\n      zData = solutionVector.map((val) => val[0]);\n    } else {\n      zData = solutionVector;\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let minX = Math.min(...nodesXCoordinates);\n    let maxX = Math.max(...nodesXCoordinates);\n    let minY = Math.min(...nodesYCoordinates);\n    let maxY = Math.max(...nodesYCoordinates);\n    let lengthX = maxX - minX;\n    let lengthY = maxY - minY;\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot - ${solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: nodesXCoordinates,\n      y: nodesYCoordinates,\n      z: zData,\n      type: \"contour\",\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to generate a dense visualization grid and interpolate the FEM solution on it\n * @param {object} result - Object containing solution vector and mesh information\n * @param {object} model - Object containing model properties\n * @param {string} plotType - The type of plot\n * @param {string} plotDivId - The id of the div where the plot will be rendered\n */\nexport function plotInterpolatedSolution(model, result, plotType, plotDivId) {\n  console.time(\"plottingTime\");\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details\n\n  // Initialize BasisFunctions once here to avoid creating it inside the loop\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  if (meshDimension === \"1D\" && plotType === \"line\") {\n    // 1D plot region\n  } else if (meshDimension === \"2D\" && plotType === \"contour\") {\n    const visNodeXCoordinates = [];\n    const visNodeYCoordinates = [];\n    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);\n    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);\n    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid\n    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid\n    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid\n    const deltavisX = lengthX / (visNodesX - 1);\n    const deltavisY = lengthY / (visNodesY - 1);\n    let visSolution = [];\n\n    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);\n    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);\n\n    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];\n      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;\n    }\n\n    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {\n      const nnode = visNodeIndexX * visNodesY;\n      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;\n      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];\n\n      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {\n        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];\n        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;\n      }\n    }\n\n    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };\n\n    // Initialize visSolution with null for all visualization nodes\n    visSolution = new Array(visNodesX * visNodesY).fill(null);\n\n    // Get boundary segments for ray casting\n    const boundarySegments = getBoundarySegments(meshData);\n\n    // Perform adjacency-based search to find which element contains a given point (quick search)\n    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n    let lastParentElement = 0;\n    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {\n      // Ray casting check\n      if (\n        !pointInsidePolygon(\n          visNodeXCoordinates[visNodeIndex],\n          visNodeYCoordinates[visNodeIndex],\n          boundarySegments,\n        )\n      ) {\n        continue;\n      }\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (\n          let neighborElementsIndex = 0;\n          neighborElementsIndex < neighborCount[globalNodeIndex];\n          neighborElementsIndex++\n        ) {\n          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      // Scan all elements to find which element contains a given point (slow search)\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(\n            model,\n            meshData,\n            result,\n            currentElement,\n            visNodeXCoordinates[visNodeIndex],\n            visNodeYCoordinates[visNodeIndex],\n            basisFunctions,\n          );\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            found = true;\n            break;\n          }\n        }\n      }\n    }\n\n    // Plot sizing parameters\n    let maxWindowWidth = Math.min(window.innerWidth, 700);\n    let aspectRatio = lengthY / lengthX;\n    let plotWidth = Math.min(maxWindowWidth, 600);\n    let plotHeight = plotWidth * aspectRatio;\n\n    // Layout properties\n    let layout = {\n      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,\n      width: plotWidth,\n      height: plotHeight,\n      xaxis: { title: \"x\" },\n      yaxis: {\n        title: \"y\",\n        scaleanchor: \"x\",\n        scaleratio: 1,\n      },\n      margin: { l: 50, r: 50, t: 50, b: 50 },\n      hovermode: \"closest\",\n    };\n\n    // Create the plot\n    let contourData = {\n      x: visNodeXCoordinates,\n      y: visNodeYCoordinates,\n      z: visSolution,\n      type: \"contour\",\n      connectgaps: false,\n      hoverongaps: false,\n      line: {\n        smoothing: 0.85,\n      },\n      contours: {\n        coloring: \"heatmap\",\n        showlabels: false,\n      },\n      //colorscale: 'Viridis',\n      colorbar: {\n        title: \"Solution\",\n      },\n      name: \"Interpolated Solution Field\",\n    };\n\n    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });\n    console.timeEnd(\"plottingTime\");\n  }\n}\n\n/**\n * Function to search if a point is inside an element and interpolate the solution\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} currentElement - Index of the element to check\n * @param {number} visNodeXCoordinate - X-coordinate of the point\n * @param {number} visNodeYCoordinate - Y-coordinate of the point\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {object} Object containing inside boolean and interpolated value\n */\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    // Linear quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    // Quadratic quadrilateral element\n    let vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } // TODO: Add also triangular element cases\n  return { inside: false, value: null };\n}\n\n/**\n * Function to interpolate the solution at a specific point (ksi, eta) within an element\n * @param {object} model - Object containing model properties\n * @param {object} meshData - Object containing mesh data\n * @param {object} result - Object containing solution vector and mesh information\n * @param {number} elementIndex - Index of the element containing the point\n * @param {number} ksi - First natural coordinate (ksi)\n * @param {number} eta - Second natural coordinate (eta)\n * @param {object} basisFunctions - Instance of BasisFunctions class\n * @returns {number} Interpolated solution value\n */\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  // Initialize FEA components\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n\n  // Get basis functions for the current point\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  let basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  // Check if solutionVector is a nested array\n  let zData;\n  if (Array.isArray(solutionVector[0])) {\n    zData = solutionVector.map((val) => val[0]);\n  } else {\n    zData = solutionVector;\n  }\n\n  // Interpolate solution\n  let solutionInterpolationValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    solutionInterpolationValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return solutionInterpolationValue;\n}\n\n/**\n * Function to check if a point is inside a polygon using ray casting algorithm\n * @param {number} x - X-coordinate of the point\n * @param {number} y - Y-coordinate of the point\n * @param {array} segments - Array of boundary segments\n * @returns {boolean} True if the point is inside the polygon\n */\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport {\n  prepareMesh,\n  pointInsideQuadrilateral,\n  computeNodeNeighbors,\n  getBoundarySegments,\n} from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { errorLog } from \"../utilities/loggingScript.js\";\n\nlet _vtkModules = null;\n\n/**\n * Lazily loads and caches vtk.js modules required for rendering\n * @returns {Promise<object>} Object containing vtk.js module references\n */\nasync function loadVtkModules() {\n  if (_vtkModules) return _vtkModules;\n  await import(\"@kitware/vtk.js/Rendering/Profiles/Geometry.js\");\n  const [\n    { default: vtkActor },\n    { default: vtkColorTransferFunction },\n    { default: vtkColorMaps },\n    { default: vtkDataArray },\n    { default: vtkImageData },\n    { default: vtkImageMarchingSquares },\n    { default: vtkGenericRenderWindow },\n    { default: vtkMapper },\n    { default: vtkPolyData },\n    { default: vtkScalarBarActor },\n  ] = await Promise.all([\n    import(\"@kitware/vtk.js/Rendering/Core/Actor.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js\"),\n    import(\"@kitware/vtk.js/Common/Core/DataArray.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/ImageData.js\"),\n    import(\"@kitware/vtk.js/Filters/General/ImageMarchingSquares.js\"),\n    import(\"@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/Mapper.js\"),\n    import(\"@kitware/vtk.js/Common/DataModel/PolyData.js\"),\n    import(\"@kitware/vtk.js/Rendering/Core/ScalarBarActor.js\"),\n  ]);\n  _vtkModules = {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkDataArray,\n    vtkImageData,\n    vtkImageMarchingSquares,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkPolyData,\n    vtkScalarBarActor,\n  };\n  return _vtkModules;\n}\n\nconst rendererCache = new Map();\n\n/**\n * Creates a color scale configuration for visualization\n * @param {object} options - Color scale options\n * @param {string} [options.presetName=\"Cool to Warm\"] - Color map preset name\n * @param {boolean} [options.reverse=false] - Whether to reverse the color map\n * @param {boolean} [options.showScalarBar=true] - Whether to display the scalar bar\n * @param {string} [options.scalarBarTitle=\"Solution\"] - Title for the scalar bar\n * @returns {object} Color scale configuration object\n */\nexport function createColorScale(options = {}) {\n  return {\n    presetName: options.presetName ?? \"Cool to Warm\",\n    reverse: options.reverse ?? false,\n    showScalarBar: options.showScalarBar ?? true,\n    scalarBarTitle: options.scalarBarTitle ?? \"Solution\",\n  };\n}\n\n/**\n * Creates contour line options for visualization\n * @param {object} options - Contour line options\n * @param {boolean} [options.enabled=true] - Whether contour lines are enabled\n * @param {number} [options.numberOfContours=12] - Number of contour lines\n * @param {Array<number>} [options.color=[0.15,0.15,0.15]] - RGB color array for contour lines\n * @param {number} [options.lineWidth=1] - Width of contour lines\n * @returns {object} Contour line configuration object\n */\nexport function createContourLineOptions(options = {}) {\n  return {\n    enabled: options.enabled ?? true,\n    numberOfContours: options.numberOfContours ?? 12,\n    color: options.color ?? [0.15, 0.15, 0.15],\n    lineWidth: options.lineWidth ?? 1,\n  };\n}\n\n/**\n * Plots the FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"line\", \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  const meshDimension = model.meshConfig.meshDimension;\n  const meshData = prepareMesh(model.meshConfig);\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n    mode: meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n  });\n  await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Plots an interpolated FEA solution using the VTK.js backend\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {string} plotType - The type of plot (e.g., \"contour\")\n * @param {string} plotDivId - The id of the HTML element for rendering\n * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines\n */\nexport async function plotInterpolatedSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {\n  console.time(\"plottingTime\");\n  if (model.meshConfig.meshDimension !== \"2D\" || plotType !== \"contour\") {\n    // Fallback to non-interpolated for non-2D contour cases\n    const meshData = prepareMesh(model.meshConfig);\n    const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {\n      mode: model.meshConfig.meshDimension === \"1D\" && plotType === \"line\" ? \"line\" : \"surface\",\n    });\n    await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);\n    console.timeEnd(\"plottingTime\");\n    return;\n  }\n  const meshData = prepareMesh(model.meshConfig);\n  const interpolatedVtkData = await buildInterpolatedVtkData(model, result, meshData);\n  await renderVtkScene(\n    interpolatedVtkData,\n    plotDivId,\n    model.solverConfig,\n    `${plotType}-interpolated`,\n    renderOptions,\n  );\n  console.timeEnd(\"plottingTime\");\n}\n\n/**\n * Transforms solver output into VTK-compatible data structures\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<object>} VTK data object with points, scalars, cells, polyData, and metadata\n */\nexport async function transformSolverOutputToVtkData(model, result, meshData = null, options = {}) {\n  const preparedMesh = meshData ?? prepareMesh(model.meshConfig);\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const solutionArray = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const points = buildPointsArray(nodesXCoordinates, nodesYCoordinates);\n\n  const mode = options.mode ?? \"surface\";\n  const cells =\n    mode === \"line\"\n      ? buildLineCellsFromPoints(nodesXCoordinates.length)\n      : buildCellArrayFromNop(preparedMesh.nop ?? []);\n\n  const polyData = await buildPolyData(points, solutionArray, cells, mode);\n\n  return {\n    points,\n    scalars: solutionArray,\n    cells,\n    polyData,\n    mode,\n    metadata: {\n      solverConfig: model.solverConfig,\n      meshDimension: model.meshConfig.meshDimension,\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n    },\n  };\n}\n\n/**\n * Transforms solver output into a VTP (VTK PolyData XML) string\n * @param {object} model - FEAScript model containing mesh and solver configuration\n * @param {object} result - Object containing solution vector and node coordinates\n * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare\n * @param {object} [options={}] - Options including mode (\"surface\" or \"line\")\n * @returns {Promise<string>} VTP XML string\n */\nexport async function transformSolverOutputToVTP(model, result, meshData = null, options = {}) {\n  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, options);\n  return buildVTPString(vtkData);\n}\n\n/**\n * Transforms solver output into typed array buffers suitable for ML pipelines\n * @param {object} result - Object containing solution vector and node coordinates\n * @returns {object} Object with features (Float32Array), featuresShape, labels, and points\n */\nexport function transformSolverOutputToMLBuffers(result) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const scalars = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);\n  const features = new Float32Array(nodesXCoordinates.length * 3);\n\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    features[base] = Number(nodesXCoordinates[i]) || 0;\n    features[base + 1] = Number(nodesYCoordinates[i]) || 0;\n    features[base + 2] = scalars[i];\n  }\n\n  return {\n    features,\n    featuresShape: [nodesXCoordinates.length, 3],\n    labels: scalars,\n    points: buildPointsArray(nodesXCoordinates, nodesYCoordinates),\n  };\n}\n\n// VTK rendering\n\nasync function renderVtkScene(vtkData, plotDivId, solverConfig, plotType, renderOptions = {}) {\n  if (typeof document === \"undefined\") {\n    errorLog(\"vtk.js visualization requires a browser environment\");\n    return;\n  }\n  const {\n    vtkActor,\n    vtkColorTransferFunction,\n    vtkColorMaps,\n    vtkGenericRenderWindow,\n    vtkMapper,\n    vtkScalarBarActor,\n  } = await loadVtkModules();\n\n  const container = document.getElementById(plotDivId);\n  if (!container) {\n    errorLog(`Could not find plot container with id: ${plotDivId}`);\n    return;\n  }\n\n  if (rendererCache.has(plotDivId)) {\n    rendererCache.get(plotDivId).delete();\n    rendererCache.delete(plotDivId);\n  }\n\n  container.innerHTML = \"\";\n  container.style.position = \"relative\";\n  container.style.width = container.style.width || \"100%\";\n  container.style.height = container.style.height || \"420px\";\n\n  const genericRenderWindow = vtkGenericRenderWindow.newInstance({ background: [1, 1, 1] });\n  genericRenderWindow.setContainer(container);\n  genericRenderWindow.resize();\n\n  const renderer = genericRenderWindow.getRenderer();\n  const renderWindow = genericRenderWindow.getRenderWindow();\n\n  const mapper = vtkMapper.newInstance();\n  mapper.setInputData(vtkData.polyData);\n  mapper.setScalarModeToUsePointData();\n  mapper.setColorModeToMapScalars();\n  mapper.setScalarVisibility(true);\n\n  const scalarRange = getScalarRange(vtkData.scalars);\n  mapper.setScalarRange(scalarRange[0], scalarRange[1]);\n\n  const colorScale = renderOptions.colorScale ?? createColorScale({});\n  const lookupTable = vtkColorTransferFunction.newInstance();\n  const preset =\n    vtkColorMaps.getPresetByName(colorScale.presetName) ?? vtkColorMaps.getPresetByName(\"Cool to Warm\");\n  const mappedPreset = reverseColorMapPreset(preset, colorScale.reverse);\n  lookupTable.applyColorMap(mappedPreset);\n  lookupTable.setMappingRange(scalarRange[0], scalarRange[1]);\n  lookupTable.updateRange();\n  mapper.setLookupTable(lookupTable);\n\n  const actor = vtkActor.newInstance();\n  actor.setMapper(mapper);\n  if (vtkData.mode === \"line\") actor.getProperty().setLineWidth(3);\n  renderer.addActor(actor);\n\n  if (colorScale.showScalarBar) {\n    const scalarBarActor = vtkScalarBarActor.newInstance({\n      drawNanAnnotation: false,\n      generateTicks: (helper) => {\n        const bounds = helper.getLastTickBounds();\n        if (!bounds || bounds.length < 2) return;\n        const [minVal, maxVal] = bounds;\n        const count = 5;\n        const step = (maxVal - minVal) / (count - 1);\n        const ticks = Array.from({ length: count }, (_, i) => minVal + i * step);\n        helper.setTicks(ticks);\n        helper.setTickStrings(\n          ticks.map((v) => {\n            const abs = Math.abs(v);\n            if (abs === 0) return \"0\";\n            if (abs >= 0.01 && abs < 10000) return parseFloat(v.toPrecision(4)).toString();\n            return v.toExponential(2);\n          }),\n        );\n      },\n    });\n    scalarBarActor.setTickTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisTextStyle({ fontColor: \"black\" });\n    scalarBarActor.setAxisLabel(colorScale.scalarBarTitle);\n    scalarBarActor.setScalarsToColors(lookupTable);\n    renderer.addActor2D(scalarBarActor);\n  }\n\n  const contourLines = createContourLineOptions(renderOptions.contourLines ?? { enabled: false });\n  if (contourLines.enabled && vtkData.mode !== \"line\") {\n    await addContourLinesToRenderer(renderer, vtkData, scalarRange, contourLines);\n  }\n\n  renderer.resetCamera();\n  renderWindow.render();\n  rendererCache.set(plotDivId, genericRenderWindow);\n  container.title = `${plotType} plot - ${solverConfig}`;\n}\n\nasync function addContourLinesToRenderer(renderer, vtkData, scalarRange, contourOptions) {\n  const gridMeta = vtkData.metadata?.interpolationGrid;\n  if (!gridMeta) {\n    return;\n  }\n  const { vtkActor, vtkDataArray, vtkImageData, vtkImageMarchingSquares, vtkMapper } = await loadVtkModules();\n\n  const imageData = vtkImageData.newInstance();\n  imageData.setDimensions(gridMeta.nx, gridMeta.ny, 1);\n  imageData.setOrigin(gridMeta.origin[0], gridMeta.origin[1], 0);\n  imageData.setSpacing(gridMeta.spacing[0], gridMeta.spacing[1], 1);\n\n  const imageScalars = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: gridMeta.imageScalars,\n  });\n  imageData.getPointData().setScalars(imageScalars);\n\n  const contourFilter = vtkImageMarchingSquares.newInstance({\n    slicingMode: 2,\n    slice: 0,\n    mergePoints: true,\n  });\n  contourFilter.setInputData(imageData);\n\n  const n = Math.max(2, contourOptions.numberOfContours);\n  const minValue = scalarRange[0];\n  const maxValue = scalarRange[1];\n  const step = (maxValue - minValue) / (n - 1);\n  const contourValues = [];\n  for (let i = 0; i < n; i++) {\n    contourValues.push(minValue + i * step);\n  }\n  contourFilter.setContourValues(contourValues);\n  contourFilter.update();\n\n  const contourMapper = vtkMapper.newInstance();\n  contourMapper.setInputData(contourFilter.getOutputData());\n  contourMapper.setScalarVisibility(false);\n\n  const contourActor = vtkActor.newInstance();\n  contourActor.setMapper(contourMapper);\n  contourActor.getProperty().setColor(...contourOptions.color);\n  contourActor.getProperty().setLineWidth(contourOptions.lineWidth);\n  renderer.addActor(contourActor);\n}\n\n// Color map helpers\n\nfunction reverseColorMapPreset(preset, reverse) {\n  if (!reverse || !preset?.RGBPoints?.length) return preset;\n  const rgb = preset.RGBPoints;\n  const minX = rgb[0];\n  const maxX = rgb[rgb.length - 4];\n  const reversed = [];\n  for (let i = rgb.length - 4; i >= 0; i -= 4) {\n    reversed.push(maxX - (rgb[i] - minX), rgb[i + 1], rgb[i + 2], rgb[i + 3]);\n  }\n  return { ...preset, RGBPoints: reversed };\n}\n\n// Data building helpers\n\nasync function buildPolyData(points, scalars, cells, mode = \"surface\") {\n  const { vtkPolyData, vtkDataArray } = await loadVtkModules();\n  const polyData = vtkPolyData.newInstance();\n  polyData.getPoints().setData(points, 3);\n  if (cells.length > 0) {\n    if (mode === \"line\") polyData.getLines().setData(cells);\n    else polyData.getPolys().setData(cells);\n  }\n  const scalarData = vtkDataArray.newInstance({\n    name: \"solution\",\n    numberOfComponents: 1,\n    values: scalars,\n  });\n  polyData.getPointData().setScalars(scalarData);\n  return polyData;\n}\n\nfunction buildPointsArray(nodesXCoordinates, nodesYCoordinates) {\n  const points = new Float32Array(nodesXCoordinates.length * 3);\n  for (let i = 0; i < nodesXCoordinates.length; i++) {\n    const base = i * 3;\n    points[base] = Number(nodesXCoordinates[i]) || 0;\n    points[base + 1] = Number(nodesYCoordinates?.[i]) || 0;\n    points[base + 2] = 0;\n  }\n  return points;\n}\n\nfunction extractScalarSolution(solutionVector, expectedLength) {\n  const scalars = new Float32Array(expectedLength);\n  for (let i = 0; i < expectedLength; i++) {\n    const value = solutionVector?.[i];\n    scalars[i] = Number(Array.isArray(value) ? value[0] : value) || 0;\n  }\n  return scalars;\n}\n\nfunction buildLineCellsFromPoints(totalPoints) {\n  if (totalPoints < 2) return new Uint32Array(0);\n  const packed = new Uint32Array((totalPoints - 1) * 3);\n  let offset = 0;\n  for (let i = 0; i < totalPoints - 1; i++) {\n    packed[offset++] = 2;\n    packed[offset++] = i;\n    packed[offset++] = i + 1;\n  }\n  return packed;\n}\n\nfunction buildCellArrayFromNop(nop) {\n  const packed = [];\n  for (let i = 0; i < nop.length; i++) {\n    const cell = convertElementNodesToLinearCell(nop[i]);\n    packed.push(cell.length, ...cell);\n  }\n  return Uint32Array.from(packed);\n}\n\nfunction convertElementNodesToLinearCell(elementNodes) {\n  const indices = elementNodes.map((node) => node - 1);\n  const n = indices.length;\n\n  if (n === 2 || n === 3) {\n    return indices;\n  }\n\n  if (n === 4) {\n    // FEAScript quad numbering:\n    //   1 --- 3\n    //   |     |\n    //   0 --- 2\n    // Perimeter order for VTK polygon: 0 -> 2 -> 3 -> 1\n    return [indices[0], indices[2], indices[3], indices[1]];\n  }\n\n  if (n === 6) {\n    return [indices[0], indices[2], indices[5]];\n  }\n\n  if (n === 8) {\n    // Perimeter corners for FEAScript serendipity quad:\n    //   2 --- 6\n    //   |     |\n    //   0 --- 4\n    return [indices[0], indices[4], indices[6], indices[2]];\n  }\n\n  if (n === 9) {\n    // FEAScript 9-node quad numbering:\n    //   2 -- 5 -- 8\n    //   |         |\n    //   1 -- 4 -- 7\n    //   |         |\n    //   0 -- 3 -- 6\n    // Corner perimeter order for VTK polygon: 0 -> 6 -> 8 -> 2\n    return [indices[0], indices[6], indices[8], indices[2]];\n  }\n\n  // Generic fallback for polygonal/high-order cells.\n  return indices.slice(0, Math.min(4, indices.length));\n}\n\nfunction getScalarRange(scalars) {\n  if (!scalars?.length) return [0, 1];\n  let minValue = Number.POSITIVE_INFINITY;\n  let maxValue = Number.NEGATIVE_INFINITY;\n  for (let i = 0; i < scalars.length; i++) {\n    const value = scalars[i];\n    if (!Number.isFinite(value)) continue;\n    if (value < minValue) minValue = value;\n    if (value > maxValue) maxValue = value;\n  }\n  if (!Number.isFinite(minValue) || !Number.isFinite(maxValue)) return [0, 1];\n  if (minValue === maxValue) return [minValue - 1, maxValue + 1];\n  return [minValue, maxValue];\n}\n\nfunction countPackedCells(packedCells) {\n  let count = 0,\n    offset = 0;\n  while (offset < packedCells.length) {\n    offset += packedCells[offset] + 1;\n    count++;\n  }\n  return count;\n}\n\n// VTP export\n\nfunction packedCellsToConnectivityAndOffsets(packedCells) {\n  const connectivity = [],\n    offsets = [];\n  let offset = 0,\n    running = 0;\n  while (offset < packedCells.length) {\n    const npts = packedCells[offset++];\n    for (let i = 0; i < npts; i++) connectivity.push(packedCells[offset++]);\n    running += npts;\n    offsets.push(running);\n  }\n  return { connectivity, offsets };\n}\n\nfunction buildVTPString(vtkData) {\n  const { connectivity, offsets } = packedCellsToConnectivityAndOffsets(vtkData.cells);\n  const numberOfPoints = vtkData.points.length / 3;\n  const isLine = vtkData.mode === \"line\";\n  const topologyTag = isLine ? \"Lines\" : \"Polys\";\n  return [\n    '<?xml version=\"1.0\"?>',\n    '<VTKFile type=\"PolyData\" version=\"0.1\" byte_order=\"LittleEndian\">',\n    \"  <PolyData>\",\n    `    <Piece NumberOfPoints=\"${numberOfPoints}\" NumberOfVerts=\"0\" NumberOfLines=\"${isLine ? offsets.length : 0}\" NumberOfStrips=\"0\" NumberOfPolys=\"${isLine ? 0 : offsets.length}\">`,\n    '      <PointData Scalars=\"solution\">',\n    `        <DataArray type=\"Float32\" Name=\"solution\" NumberOfComponents=\"1\" format=\"ascii\">${Array.from(vtkData.scalars).join(\" \")}</DataArray>`,\n    \"      </PointData>\",\n    \"      <Points>\",\n    `        <DataArray type=\"Float32\" NumberOfComponents=\"3\" format=\"ascii\">${Array.from(vtkData.points).join(\" \")}</DataArray>`,\n    \"      </Points>\",\n    `      <${topologyTag}>`,\n    `        <DataArray type=\"Int32\" Name=\"connectivity\" format=\"ascii\">${connectivity.join(\" \")}</DataArray>`,\n    `        <DataArray type=\"Int32\" Name=\"offsets\" format=\"ascii\">${offsets.join(\" \")}</DataArray>`,\n    `      </${topologyTag}>`,\n    \"    </Piece>\",\n    \"  </PolyData>\",\n    \"</VTKFile>\",\n  ].join(\"\\n\");\n}\n\n// Interpolation helpers\n\nasync function buildInterpolatedGridValues(model, result, meshData) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const basisFunctions = new BasisFunctions({\n    meshDimension: model.meshConfig.meshDimension,\n    elementOrder: model.meshConfig.elementOrder,\n  });\n\n  let minX = nodesXCoordinates[0];\n  let maxX = nodesXCoordinates[0];\n  let minY = nodesYCoordinates[0];\n  let maxY = nodesYCoordinates[0];\n  for (let i = 1; i < nodesXCoordinates.length; i++) {\n    const x = nodesXCoordinates[i];\n    const y = nodesYCoordinates[i];\n    if (x < minX) minX = x;\n    if (x > maxX) maxX = x;\n    if (y < minY) minY = y;\n    if (y > maxY) maxY = y;\n  }\n\n  const lengthX = maxX - minX;\n  const lengthY = maxY - minY;\n  const visPointsPerUnit = 50;\n\n  const visNodesX = Math.max(2, Math.round(lengthX * visPointsPerUnit));\n  const visNodesY = Math.max(2, Math.round(lengthY * visPointsPerUnit));\n\n  const deltaX = lengthX / (visNodesX - 1);\n  const deltaY = lengthY / (visNodesY - 1);\n\n  const totalVisNodes = visNodesX * visNodesY;\n  const visNodeXCoordinates = new Float32Array(totalVisNodes);\n  const visNodeYCoordinates = new Float32Array(totalVisNodes);\n  const visSolution = new Float32Array(totalVisNodes);\n  visSolution.fill(Number.NaN);\n  const insideMask = new Uint8Array(totalVisNodes);\n\n  const boundarySegments = getBoundarySegments(meshData);\n  const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);\n\n  let lastParentElement = 0;\n  for (let ix = 0; ix < visNodesX; ix++) {\n    for (let iy = 0; iy < visNodesY; iy++) {\n      const visNodeIndex = ix * visNodesY + iy;\n      const x = minX + ix * deltaX;\n      const y = minY + iy * deltaY;\n\n      visNodeXCoordinates[visNodeIndex] = x;\n      visNodeYCoordinates[visNodeIndex] = y;\n\n      if (!pointInsidePolygon(x, y, boundarySegments)) {\n        continue;\n      }\n\n      let found = false;\n      for (\n        let localNodeIndex = 0;\n        localNodeIndex < meshData.nop[lastParentElement].length;\n        localNodeIndex++\n      ) {\n        const globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;\n        for (let ni = 0; ni < neighborCount[globalNodeIndex]; ni++) {\n          const currentElement = nodeNeighbors[globalNodeIndex][ni];\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            found = true;\n            break;\n          }\n        }\n        if (found) break;\n      }\n\n      if (!found) {\n        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {\n          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);\n\n          if (searchResult.inside) {\n            lastParentElement = currentElement;\n            visSolution[visNodeIndex] = searchResult.value;\n            insideMask[visNodeIndex] = 1;\n            break;\n          }\n        }\n      }\n    }\n  }\n\n  return {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    lengthX,\n    lengthY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  };\n}\n\nasync function buildInterpolatedVtkData(model, result, meshData) {\n  const grid = await buildInterpolatedGridValues(model, result, meshData);\n  const {\n    visNodesX,\n    visNodesY,\n    minX,\n    minY,\n    deltaX,\n    deltaY,\n    visNodeXCoordinates,\n    visNodeYCoordinates,\n    visSolution,\n    insideMask,\n  } = grid;\n\n  const points = buildPointsArray(visNodeXCoordinates, visNodeYCoordinates);\n  const cells = buildStructuredGridCells(visNodesX, visNodesY, insideMask);\n  const polyData = await buildPolyData(points, visSolution, cells, \"surface\");\n\n  return {\n    points,\n    scalars: visSolution,\n    cells,\n    polyData,\n    mode: \"surface\",\n    metadata: {\n      meshDimension: \"2D\",\n      numberOfPoints: points.length / 3,\n      numberOfCells: countPackedCells(cells),\n      interpolationGrid: {\n        nx: visNodesX,\n        ny: visNodesY,\n        origin: [minX, minY],\n        spacing: [deltaX, deltaY],\n        imageScalars: reorderStructuredScalarsForImage(visSolution, visNodesX, visNodesY),\n      },\n    },\n  };\n}\n\nfunction reorderStructuredScalarsForImage(values, nx, ny) {\n  // FEAScript interpolation uses index = ix * ny + iy (y-fast).\n  // vtkImageData expects index = ix + iy * nx (x-fast).\n  const reordered = new Float32Array(nx * ny);\n  for (let iy = 0; iy < ny; iy++) {\n    for (let ix = 0; ix < nx; ix++) {\n      reordered[ix + iy * nx] = values[ix * ny + iy];\n    }\n  }\n  return reordered;\n}\n\nfunction buildStructuredGridCells(nx, ny, insideMask) {\n  const packed = [];\n\n  for (let ix = 0; ix < nx - 1; ix++) {\n    for (let iy = 0; iy < ny - 1; iy++) {\n      const n0 = ix * ny + iy;\n      const n1 = (ix + 1) * ny + iy;\n      const n2 = (ix + 1) * ny + (iy + 1);\n      const n3 = ix * ny + (iy + 1);\n\n      if (!insideMask[n0] || !insideMask[n1] || !insideMask[n2] || !insideMask[n3]) {\n        continue;\n      }\n\n      packed.push(4, n0, n1, n2, n3);\n    }\n  }\n\n  return Uint32Array.from(packed);\n}\n\n// Point search & solution interpolation\n\nfunction pointSearch(\n  model,\n  meshData,\n  result,\n  currentElement,\n  visNodeXCoordinate,\n  visNodeYCoordinate,\n  basisFunctions,\n) {\n  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;\n  const nodesPerElement = meshData.nop[currentElement].length;\n\n  if (nodesPerElement === 4) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][1] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][1] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][3] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][3] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  } else if (nodesPerElement === 9) {\n    const vertices = [\n      [\n        nodesXCoordinates[meshData.nop[currentElement][0] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][0] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][2] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][2] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][6] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][6] - 1],\n      ],\n      [\n        nodesXCoordinates[meshData.nop[currentElement][8] - 1],\n        nodesYCoordinates[meshData.nop[currentElement][8] - 1],\n      ],\n    ];\n\n    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);\n    if (pointCheck.inside) {\n      return {\n        inside: true,\n        value: solutionInterpolation(\n          model,\n          meshData,\n          result,\n          currentElement,\n          pointCheck.ksi,\n          pointCheck.eta,\n          basisFunctions,\n        ),\n      };\n    }\n  }\n\n  return { inside: false, value: null };\n}\n\nfunction solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {\n  const solutionVector = result.solutionVector;\n  const nodesPerElement = meshData.nop[elementIndex].length;\n  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);\n  const basisFunction = basisFunctionsAndDerivatives.basisFunction;\n\n  const zData = Array.isArray(solutionVector[0]) ? solutionVector.map((value) => value[0]) : solutionVector;\n\n  let interpolatedValue = 0;\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    interpolatedValue +=\n      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];\n  }\n\n  return interpolatedValue;\n}\n\nfunction pointInsidePolygon(x, y, segments) {\n  let inside = false;\n  for (let i = 0; i < segments.length; i++) {\n    const [[x1, y1], [x2, y2]] = segments[i];\n    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;\n    if (intersect) inside = !inside;\n  }\n  return inside;\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { newtonRaphson } from \"./methods/newtonRaphsonScript.js\";\nimport { solveLinearSystem } from \"./methods/linearSystemSolverScript.js\";\nimport { solveLinearSystemAsync } from \"./methods/linearSystemSolverScript.js\";\nimport { prepareMesh } from \"./mesh/meshUtilsScript.js\";\nimport { assembleFrontPropagationMat } from \"./models/frontPropagationScript.js\";\nimport { assembleGeneralFormPDEMat, assembleGeneralFormPDEFront } from \"./models/generalFormPDEScript.js\";\nimport { assembleHeatConductionMat, assembleHeatConductionFront } from \"./models/heatConductionScript.js\";\nimport { assembleCreepingFlowMatrix } from \"./models/creepingFlowScript.js\";\nimport { runFrontalSolver } from \"./methods/frontalSolverScript.js\";\nimport { basicLog, debugLog, warnLog, errorLog } from \"./utilities/loggingScript.js\";\n\n/**\n * Class to implement finite element analysis in JavaScript\n * @param {string} solverConfig - Parameter specifying the type of solver\n * @param {object} meshConfig - Object containing computational mesh details\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containifng the solution vector and mesh information\n */\nexport class FEAScriptModel {\n  constructor() {\n    this.solverConfig = null;\n    this.meshConfig = {};\n    this.boundaryConditions = {};\n    this.solverMethod = \"lusolve\"; // Default solver method\n    this.coefficientFunctions = null; // Add storage for coefficient functions\n    warnLog(\n      \"FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE\",\n    );\n    basicLog(\"FEAScriptModel instance created\");\n  }\n\n  /**\n   * Method to set the model configuration\n   * @param {string} modelConfig - Parameter specifying the type of model\n   * @param {object} [options] - Optional additional configuration\n   */\n  setModelConfig(modelConfig, options = {}) {\n    this.solverConfig = modelConfig;\n\n    // Store coefficient functions if provided\n    if (options?.coefficientFunctions !== undefined) {\n      this.coefficientFunctions = options.coefficientFunctions;\n      debugLog(\"coefficientFunctions set\");\n    }\n    // Only update if a value is provided\n    if (options?.maxIterations !== undefined) {\n      this.maxIterations = options.maxIterations;\n      debugLog(`maxIterations set to ${this.maxIterations}`);\n    }\n    if (options?.tolerance !== undefined) {\n      this.tolerance = options.tolerance;\n      debugLog(`tolerance set to ${this.tolerance}`);\n    }\n\n    debugLog(`solverConfig set to ${modelConfig}`);\n  }\n\n  setMeshConfig(meshConfig) {\n    this.meshConfig = meshConfig;\n    debugLog(`meshConfig set with dimensions: ${meshConfig.meshDimension}`);\n  }\n\n  addBoundaryCondition(boundaryKey, condition) {\n    this.boundaryConditions[boundaryKey] = condition;\n    debugLog(`boundaryConditions added for boundary: ${boundaryKey}, type: ${condition[0]}`);\n  }\n\n  setSolverMethod(solverMethod) {\n    this.solverMethod = solverMethod;\n    debugLog(`solverMethod set to: ${solverMethod}`);\n  }\n\n  /**\n   * Method to solve the finite element problem synchronously\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {object} An object containing the solution vector and mesh information\n   */\n  solve(options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"solverConfig, meshConfig and boundaryConditions must be set before solving\");\n    }\n    /**\n     * For consistency across both linear and nonlinear formulations,\n     * we always refer to the assembled right-hand side vector as\n     * `residualVector` and the assembled system matrix as `jacobianMatrix`.\n     *\n     * In linear problems `jacobianMatrix` is equivalent to the\n     * classic stiffness/conductivity matrix and `residualVector`\n     * corresponds to the traditional load (RHS) vector.\n     */\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n    let initialSolution = [];\n\n    // Prepare the mesh\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n\n    // Extract node coordinates and nodal numbering from meshData\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    // Select and execute the appropriate solver based on solverConfig\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n    basicLog(`Using solver ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        const frontalResult = runFrontalSolver(\n          assembleHeatConductionFront,\n          meshData,\n          this.boundaryConditions,\n        );\n        solutionVector = frontalResult.solutionVector;\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"frontPropagationScript\") {\n      // Initialize eikonalActivationFlag\n      let eikonalActivationFlag = 0; // TODO: make activationFlag a generic variable (not only for eikonal)\n      const eikonalExteralIterations = 5; // Number of incremental steps for the eikonal equation\n\n      // Create context object with all necessary properties\n      const context = {\n        meshData: meshData,\n        boundaryConditions: this.boundaryConditions,\n        eikonalActivationFlag: eikonalActivationFlag,\n        solverMethod: this.solverMethod,\n        initialSolution,\n        // TODO: Consider using different maxIterations/tolerance for Newton-Raphson and linear solver\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      };\n\n      while (eikonalActivationFlag <= 1) {\n        // Update the context object with current eikonalActivationFlag\n        context.eikonalActivationFlag = eikonalActivationFlag;\n\n        // Pass the previous solution as initial guess\n        if (solutionVector.length > 0) {\n          context.initialSolution = [...solutionVector];\n        }\n\n        // Solve the assembled non-linear system\n        const newtonRaphsonResult = newtonRaphson(assembleFrontPropagationMat, context);\n\n        // Extract results\n        jacobianMatrix = newtonRaphsonResult.jacobianMatrix;\n        residualVector = newtonRaphsonResult.residualVector;\n        solutionVector = newtonRaphsonResult.solutionVector;\n\n        // Increment eikonalActivationFlag for next iteration\n        eikonalActivationFlag += 1 / eikonalExteralIterations;\n      }\n    } else if (this.solverConfig === \"generalFormPDEScript\") {\n      // Check if using frontal solver\n      if (this.solverMethod === \"frontal\") {\n        errorLog(\n          \"Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.\",\n        );\n      } else {\n        // Use regular linear solver methods\n        ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(\n          meshData,\n          this.boundaryConditions,\n          this.coefficientFunctions,\n        ));\n\n        const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n          maxIterations: options.maxIterations ?? this.maxIterations,\n          tolerance: options.tolerance ?? this.tolerance,\n        });\n        solutionVector = linearSystemResult.solutionVector;\n      }\n    } else if (this.solverConfig === \"creepingFlowScript\") {\n      // Use regular linear solver methods for steady creeping flow\n      const creepingFlowResult = assembleCreepingFlowMatrix(meshData, this.boundaryConditions);\n      jacobianMatrix = creepingFlowResult.jacobianMatrix;\n      residualVector = creepingFlowResult.residualVector;\n\n      const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {\n        maxIterations: options.maxIterations ?? this.maxIterations,\n        tolerance: options.tolerance ?? this.tolerance,\n      });\n      solutionVector = linearSystemResult.solutionVector;\n\n      // Store creeping-flow-specific metadata for solution extraction\n      this._creepingFlowMetadata = {\n        totalNodesVelocity: creepingFlowResult.totalNodesVelocity,\n        totalNodesPressure: creepingFlowResult.totalNodesPressure,\n        pressureNodeIndices: creepingFlowResult.pressureNodeIndices,\n      };\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n\n  /**\n   * Method to solve the finite element problem asynchronously\n   * @param {object} computeEngine - The compute engine to use for the asynchronous solver (e.g., a worker or a WebGPU context)\n   * @param {object} [options] - Additional parameters for the solver, such as `maxIterations` and `tolerance`\n   * @returns {Promise<object>} A promise that resolves to an object containing the solution vector and the coordinates of the mesh nodes\n   */\n  async solveAsync(computeEngine, options = {}) {\n    if (!this.solverConfig || !this.meshConfig || !this.boundaryConditions) {\n      errorLog(\"Solver config, mesh config, and boundary conditions must be set before solving.\");\n    }\n\n    let jacobianMatrix = [];\n    let residualVector = [];\n    let solutionVector = [];\n\n    basicLog(\"Preparing mesh...\");\n    const meshData = prepareMesh(this.meshConfig);\n    basicLog(\"Mesh preparation completed\");\n    const nodesCoordinates = {\n      nodesXCoordinates: meshData.nodesXCoordinates,\n      nodesYCoordinates: meshData.nodesYCoordinates,\n    };\n\n    basicLog(\"Beginning solving process...\");\n    console.time(\"totalSolvingTime\");\n\n    basicLog(`Using solver: ${this.solverConfig}`);\n    if (this.solverConfig === \"heatConductionScript\") {\n      ({ jacobianMatrix, residualVector } = assembleHeatConductionMat(meshData, this.boundaryConditions));\n\n      if (this.solverMethod === \"jacobi-gpu\") {\n        const { solutionVector: x } = await solveLinearSystemAsync(\n          \"jacobi-gpu\",\n          jacobianMatrix,\n          residualVector,\n          {\n            computeEngine,\n            maxIterations: options.maxIterations ?? this.maxIterations,\n            tolerance: options.tolerance ?? this.tolerance,\n          },\n        );\n        solutionVector = x;\n      } else {\n        // Any other async solver\n      }\n    }\n    console.timeEnd(\"totalSolvingTime\");\n    basicLog(\"Solving process completed\");\n\n    return { solutionVector, nodesCoordinates };\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { initializeFEA, performIsoparametricMapping1D } from \"../mesh/meshUtilsScript.js\";\nimport { GenericBoundaryConditions } from \"./genericBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residuals vector for the general form PDE model\n * @param {object} meshData - Object containing prepared mesh data\n * @param {object} boundaryConditions - Object containing boundary conditions\n * @param {object} coefficientFunctions - Functions A(x), B(x), C(x), D(x) for the PDE\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n */\nexport function assembleGeneralFormPDEMat(meshData, boundaryConditions, coefficientFunctions) {\n  basicLog(\"Starting general form PDE matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Extract coefficient functions\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize FEA components\n  const FEAData = initializeFEA(meshData);\n  const {\n    residualVector,\n    jacobianMatrix,\n    localToGlobalMap,\n    basisFunctions,\n    gaussPoints,\n    gaussWeights,\n    nodesPerElement,\n  } = FEAData;\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Matrix assembly\n    for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n      // Map local element nodes to global mesh nodes\n      for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n        // Convert to 0-based indexing\n        localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n      }\n\n      // Loop over Gauss points\n      for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n        // Get basis functions for the current Gauss point\n        const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex],\n        );\n\n        // Perform isoparametric mapping\n        const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n          basisFunction,\n          basisFunctionDerivKsi,\n          nodesXCoordinates,\n          localToGlobalMap,\n          nodesPerElement,\n        });\n\n        // Calculate the physical coordinate for this Gauss point\n        let xCoord = 0;\n        for (let i = 0; i < nodesPerElement; i++) {\n          xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n        }\n\n        // Evaluate coefficient functions at this physical coordinate\n        const a = A(xCoord);\n        const b = B(xCoord);\n        const c = C(xCoord);\n        const d = D(xCoord);\n\n        // Computation of Galerkin's residuals and local Jacobian matrix\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n          const globalNodeIndex1 = localToGlobalMap[localNodeIndex1];\n\n          // Source term contribution to residual vector\n          residualVector[globalNodeIndex1] -=\n            gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n            const globalNodeIndex2 = localToGlobalMap[localNodeIndex2];\n\n            // Diffusion term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] +=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              a *\n              basisFunctionDerivX[localNodeIndex1] *\n              basisFunctionDerivX[localNodeIndex2];\n\n            // Advection term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              b *\n              basisFunctionDerivX[localNodeIndex2] *\n              basisFunction[localNodeIndex1];\n\n            // Reaction term\n            jacobianMatrix[globalNodeIndex1][globalNodeIndex2] -=\n              gaussWeights[gaussPointIndex] *\n              detJacobian *\n              c *\n              basisFunction[localNodeIndex1] *\n              basisFunction[localNodeIndex2];\n          }\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEMat.\");\n    // 2D general form PDE - empty for now\n  }\n\n  // Apply boundary conditions\n  const genericBoundaryConditions = new GenericBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n  );\n\n  // Apply Dirichlet boundary conditions only\n  genericBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n\n  basicLog(\"General form PDE matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n  };\n}\n\n/**\n * Function to assemble the frontal solver matrix for the general form PDE model\n * @param {object} data - Object containing element data for the frontal solver\n * @returns {object} An object containing local Jacobian matrix and residual vector\n */\nexport function assembleGeneralFormPDEFront({\n  elementIndex,\n  nop,\n  meshData,\n  basisFunctions,\n  FEAData,\n  coefficientFunctions,\n}) {\n  // Extract numerical integration parameters and mesh coordinates\n  const { gaussPoints, gaussWeights, nodesPerElement } = FEAData;\n  const { nodesXCoordinates, nodesYCoordinates, meshDimension } = meshData;\n  const { A, B, C, D } = coefficientFunctions;\n\n  // Initialize local Jacobian matrix and local residual vector\n  const localJacobianMatrix = Array(nodesPerElement)\n    .fill()\n    .map(() => Array(nodesPerElement).fill(0));\n  const localResidualVector = Array(nodesPerElement).fill(0);\n\n  // Build the mapping from local node indices to global node indices\n  const ngl = Array(nodesPerElement);\n  const localToGlobalMap = Array(nodesPerElement);\n  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {\n    ngl[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]);\n    localToGlobalMap[localNodeIndex] = Math.abs(nop[elementIndex][localNodeIndex]) - 1;\n  }\n\n  if (meshDimension === \"1D\") {\n    // 1D general form PDE\n\n    // Loop over Gauss points\n    for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {\n      // Get basis functions for the current Gauss point\n      const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(\n        gaussPoints[gaussPointIndex],\n      );\n\n      // Perform isoparametric mapping\n      const { detJacobian, basisFunctionDerivX } = performIsoparametricMapping1D({\n        basisFunction,\n        basisFunctionDerivKsi,\n        nodesXCoordinates,\n        localToGlobalMap,\n        nodesPerElement,\n      });\n\n      // Calculate the physical coordinate for this Gauss point\n      let xCoord = 0;\n      for (let i = 0; i < nodesPerElement; i++) {\n        xCoord += nodesXCoordinates[localToGlobalMap[i]] * basisFunction[i];\n      }\n\n      // Evaluate coefficient functions at this physical coordinate\n      const a = A(xCoord);\n      const b = B(xCoord);\n      const c = C(xCoord);\n      const d = D(xCoord);\n\n      // Computation of local Jacobian matrix and residual vector\n      for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerElement; localNodeIndex1++) {\n        // Source term contribution to local residual vector\n        localResidualVector[localNodeIndex1] -=\n          gaussWeights[gaussPointIndex] * detJacobian * d * basisFunction[localNodeIndex1];\n\n        for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerElement; localNodeIndex2++) {\n          // Diffusion term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] +=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            a *\n            basisFunctionDerivX[localNodeIndex1] *\n            basisFunctionDerivX[localNodeIndex2];\n\n          // Advection term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            b *\n            basisFunctionDerivX[localNodeIndex2] *\n            basisFunction[localNodeIndex1];\n\n          // Reaction term\n          localJacobianMatrix[localNodeIndex1][localNodeIndex2] -=\n            gaussWeights[gaussPointIndex] *\n            detJacobian *\n            c *\n            basisFunction[localNodeIndex1] *\n            basisFunction[localNodeIndex2];\n        }\n      }\n    }\n  } else if (meshDimension === \"2D\") {\n    errorLog(\"2D general form PDE is not yet supported in assembleGeneralFormPDEFront.\");\n    // 2D general form PDE - empty for now\n  }\n\n  return {\n    localJacobianMatrix,\n    localResidualVector,\n    ngl,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { performIsoparametricMapping2D } from \"../mesh/meshUtilsScript.js\";\nimport { BasisFunctions } from \"../mesh/basisFunctionsScript.js\";\nimport { NumericalIntegration } from \"../methods/numericalIntegrationScript.js\";\nimport { FlowBoundaryConditions } from \"./flowBoundaryConditionsScript.js\";\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to assemble the Jacobian matrix and residual vector for the steady creeping flow (Stokes) model\n * using Taylor-Hood (Q2-Q1) mixed finite elements\n *\n * DOF ordering in the assembled system:\n *   [u_0 … u_{N_2−1}, v_0 … v_{N_2−1}, p_0 … p_{N_1−1}]\n * where N_2 = total velocity nodes (Q2) and N_1 = total pressure nodes (Q1)\n *\n * @param {object} meshData - Object containing prepared mesh data (must use quadratic elements)\n * @param {object} boundaryConditions - Object containing boundary conditions for the finite element analysis\n * @returns {object} An object containing:\n *  - jacobianMatrix: The assembled Jacobian matrix\n *  - residualVector: The assembled residual vector\n *  - totalNodesVelocity: Number of velocity nodes (Q2)\n *  - totalNodesPressure: Number of pressure nodes (Q1)\n *  - pressureNodeIndices: Array mapping pressure DOF index to global Q2 node index\n *\n * For consistency across both linear and nonlinear formulations,\n * this project always refers to the assembled right-hand side vector\n * as `residualVector` and the assembled system matrix as `jacobianMatrix`.\n *\n * In linear problems `jacobianMatrix` is equivalent to the\n * classic stiffness/conductivity matrix and `residualVector`\n * corresponds to the traditional load (RHS) vector.\n */\nexport function assembleCreepingFlowMatrix(meshData, boundaryConditions) {\n  basicLog(\"Starting creeping flow matrix assembly...\");\n\n  // Extract mesh data\n  const {\n    nodesXCoordinates,\n    nodesYCoordinates,\n    nop,\n    boundaryElements,\n    totalElements,\n    totalNodes,\n    meshDimension,\n    elementOrder,\n  } = meshData;\n\n  // Validate mesh configuration\n  if (meshDimension !== \"2D\") {\n    errorLog(\"Creeping flow solver requires a 2D mesh\");\n  }\n  if (elementOrder !== \"quadratic\") {\n    errorLog(\"Creeping flow solver requires quadratic elements for Taylor-Hood (Q2-Q1) formulation\");\n  }\n\n  // Number of velocity nodes (Q2) is the total number of nodes in the quadratic mesh\n  const totalNodesVelocity = totalNodes;\n  const nodesPerVelocityElement = 9; // Q2 element has 9 nodes\n  const nodesPerPressureElement = 4; // Q1 element has 4 nodes\n\n  // Local Q2 indices that correspond to Q1 corner nodes\n  // Q2 local numbering:\n  //   2 - 5 - 8\n  //   |       |\n  //   1   4   7\n  //   |       |\n  //   0 - 3 - 6\n  // Corner nodes (Q1): 0, 2, 6, 8\n  const cornerLocalIndices = [0, 2, 6, 8];\n\n  // Build pressure node mapping from Q2 corner nodes\n  const q2ToPressureMap = new Map();\n  const pressureNodeIndices = []; // Maps pressure DOF index to global Q2 node index\n  let pressureNodeCount = 0;\n\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    for (let cornerIndex = 0; cornerIndex < cornerLocalIndices.length; cornerIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[cornerIndex]] - 1; // Convert to 0-based\n      if (!q2ToPressureMap.has(globalQ2Node)) {\n        q2ToPressureMap.set(globalQ2Node, pressureNodeCount);\n        pressureNodeIndices.push(globalQ2Node);\n        pressureNodeCount++;\n      }\n    }\n  }\n  const totalNodesPressure = pressureNodeCount;\n  const totalDOFs = 2 * totalNodesVelocity + totalNodesPressure;\n\n  debugLog(\n    `Creeping flow DOFs: ${totalNodesVelocity} velocity nodes (Q2), ${totalNodesPressure} pressure nodes (Q1), ${totalDOFs} total DOFs`,\n  );\n\n  // Initialize Jacobian matrix and residual vector\n  let residualVector = [];\n  let jacobianMatrix = [];\n  for (let nodeIndex = 0; nodeIndex < totalDOFs; nodeIndex++) {\n    residualVector[nodeIndex] = 0;\n    jacobianMatrix.push([]);\n    for (let colIndex = 0; colIndex < totalDOFs; colIndex++) {\n      jacobianMatrix[nodeIndex][colIndex] = 0;\n    }\n  }\n\n  // Initialize basis functions for velocity (Q2) and pressure (Q1)\n  const velocityBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  const pressureBasisFunctions = new BasisFunctions({\n    meshDimension: \"2D\",\n    elementOrder: \"linear\",\n  });\n\n  // Initialize numerical integration (use quadratic-order Gauss rule)\n  const numericalIntegration = new NumericalIntegration({\n    meshDimension: \"2D\",\n    elementOrder: \"quadratic\",\n  });\n  let gaussPointsAndWeights = numericalIntegration.getGaussPointsAndWeights();\n  let gaussPoints = gaussPointsAndWeights.gaussPoints;\n  let gaussWeights = gaussPointsAndWeights.gaussWeights;\n\n  // Viscosity coefficient\n  const mu = 1.0;\n\n  // Matrix assembly\n  for (let elementIndex = 0; elementIndex < totalElements; elementIndex++) {\n    // Build local-to-global mapping for velocity nodes (Q2)\n    let velLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerVelocityElement; localNodeIndex++) {\n      // Subtract 1 from nop in order to start numbering from 0\n      velLocalToGlobalMap[localNodeIndex] = nop[elementIndex][localNodeIndex] - 1;\n    }\n\n    // Build local-to-global mapping for pressure nodes (Q1)\n    let presLocalToGlobalMap = [];\n    for (let localNodeIndex = 0; localNodeIndex < nodesPerPressureElement; localNodeIndex++) {\n      const globalQ2Node = nop[elementIndex][cornerLocalIndices[localNodeIndex]] - 1;\n      presLocalToGlobalMap[localNodeIndex] = q2ToPressureMap.get(globalQ2Node);\n    }\n\n    // Loop over Gauss points\n    for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {\n      for (let gaussPointIndex2 = 0; gaussPointIndex2 < gaussPoints.length; gaussPointIndex2++) {\n        // Get velocity (Q2) basis functions for the current Gauss point\n        const velocityBasisFunctionsAndDerivatives = velocityBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Get pressure (Q1) basis functions for the current Gauss point\n        const pressureBasisFunctionsAndDerivatives = pressureBasisFunctions.getBasisFunctions(\n          gaussPoints[gaussPointIndex1],\n          gaussPoints[gaussPointIndex2],\n        );\n\n        // Perform isoparametric mapping using Q2 velocity basis functions\n        const mappingResult = performIsoparametricMapping2D({\n          basisFunction: velocityBasisFunctionsAndDerivatives.basisFunction,\n          basisFunctionDerivKsi: velocityBasisFunctionsAndDerivatives.basisFunctionDerivKsi,\n          basisFunctionDerivEta: velocityBasisFunctionsAndDerivatives.basisFunctionDerivEta,\n          nodesXCoordinates,\n          nodesYCoordinates,\n          localToGlobalMap: velLocalToGlobalMap,\n          nodesPerElement: nodesPerVelocityElement,\n        });\n\n        // Extract mapping results\n        const { detJacobian, basisFunctionDerivX, basisFunctionDerivY } = mappingResult;\n\n        // Gauss integration weight factor\n        const weightFactor = gaussWeights[gaussPointIndex1] * gaussWeights[gaussPointIndex2] * detJacobian;\n\n        // Assemble viscous stiffness terms (K block)\n        for (let localNodeIndex1 = 0; localNodeIndex1 < nodesPerVelocityElement; localNodeIndex1++) {\n          let globalNode1 = velLocalToGlobalMap[localNodeIndex1];\n          let uDOF1 = globalNode1; // u-velocity DOF\n          let vDOF1 = totalNodesVelocity + globalNode1; // v-velocity DOF\n\n          for (let localNodeIndex2 = 0; localNodeIndex2 < nodesPerVelocityElement; localNodeIndex2++) {\n            let globalNode2 = velLocalToGlobalMap[localNodeIndex2];\n            let uDOF2 = globalNode2; // u-velocity DOF\n            let vDOF2 = totalNodesVelocity + globalNode2; // v-velocity DOF\n\n            // Viscous stiffness\n            let viscousContribution =\n              -weightFactor *\n              mu *\n              (basisFunctionDerivX[localNodeIndex1] * basisFunctionDerivX[localNodeIndex2] +\n                basisFunctionDerivY[localNodeIndex1] * basisFunctionDerivY[localNodeIndex2]);\n\n            // K appears in both u-u and v-v blocks\n            jacobianMatrix[uDOF1][uDOF2] += viscousContribution;\n            jacobianMatrix[vDOF1][vDOF2] += viscousContribution;\n          }\n\n          // Assemble pressure-velocity coupling terms\n          for (let localPresIndex = 0; localPresIndex < nodesPerPressureElement; localPresIndex++) {\n            let pDOF = 2 * totalNodesVelocity + presLocalToGlobalMap[localPresIndex];\n\n            let bxContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivX[localNodeIndex1];\n\n            let byContribution =\n              weightFactor *\n              pressureBasisFunctionsAndDerivatives.basisFunction[localPresIndex] *\n              basisFunctionDerivY[localNodeIndex1];\n\n            // Pressure gradient in x-momentum\n            jacobianMatrix[uDOF1][pDOF] += bxContribution;\n\n            // Pressure gradient in y-momentum\n            jacobianMatrix[vDOF1][pDOF] += byContribution;\n\n            // Continuity equation\n            jacobianMatrix[pDOF][uDOF1] += -bxContribution;\n            jacobianMatrix[pDOF][vDOF1] += -byContribution;\n          }\n        }\n      }\n    }\n  }\n\n  // Apply boundary conditions\n  const flowBoundaryConditions = new FlowBoundaryConditions(\n    boundaryConditions,\n    boundaryElements,\n    nop,\n    meshDimension,\n    elementOrder,\n    totalNodesVelocity,\n    totalNodesPressure,\n    q2ToPressureMap,\n  );\n\n  flowBoundaryConditions.imposeDirichletBoundaryConditions(residualVector, jacobianMatrix);\n  basicLog(\"Creeping flow matrix assembly completed\");\n\n  return {\n    jacobianMatrix,\n    residualVector,\n    totalNodesVelocity,\n    totalNodesPressure,\n    pressureNodeIndices,\n  };\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// External imports\nimport * as Comlink from \"../vendor/comlink.mjs\";\n\n/**\n * Class to facilitate communication with web workers for FEAScript operations\n */\nexport class FEAScriptWorker {\n  /**\n   * Constructor to initialize the FEAScriptWorker class\n   * Sets up the worker and initializes the workerWrapper.\n   */\n  constructor() {\n    this.worker = null;\n    this.feaWorker = null;\n    this.isReady = false;\n\n    this._initWorker();\n  }\n\n  /**\n   * Function to initialize the web worker and wrap it using Comlink\n   * @private\n   * @throws Will throw an error if the worker fails to initialize\n   */\n  async _initWorker() {\n    try {\n      this.worker = new Worker(new URL(\"./wrapperScript.js\", import.meta.url), {\n        type: \"module\",\n      });\n\n      this.worker.onerror = (event) => {\n        console.error(\"FEAScriptWorker: Worker error:\", event);\n      };\n      const workerWrapper = Comlink.wrap(this.worker);\n\n      this.feaWorker = await new workerWrapper();\n\n      this.isReady = true;\n    } catch (error) {\n      console.error(\"Failed to initialize worker\", error);\n      throw error;\n    }\n  }\n\n  /**\n   * Function to ensure that the worker is ready before performing any operations\n   * @private\n   * @returns {Promise<void>} Resolves when the worker is ready\n   * @throws Will throw an error if the worker is not ready within the timeout period\n   */\n  async _ensureReady() {\n    if (this.isReady) return Promise.resolve();\n\n    return new Promise((resolve, reject) => {\n      let attempts = 0;\n      const maxAttempts = 50; // 5 seconds max\n\n      const checkReady = () => {\n        attempts++;\n        if (this.isReady) {\n          resolve();\n        } else if (attempts >= maxAttempts) {\n          reject(new Error(\"Timeout waiting for worker to be ready\"));\n        } else {\n          setTimeout(checkReady, 1000);\n        }\n      };\n      checkReady();\n    });\n  }\n\n  /**\n   * Function to set the model configuration in the worker\n   * @param {string} modelConfig - The model configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setModelConfig(modelConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setModelConfig(modelConfig);\n  }\n\n  /**\n   * Function to set the mesh configuration in the worker\n   * @param {object} meshConfig - The mesh configuration to set\n   * @returns {Promise<boolean>} Resolves when the configuration is set\n   */\n  async setMeshConfig(meshConfig) {\n    await this._ensureReady();\n    return this.feaWorker.setMeshConfig(meshConfig);\n  }\n\n  /**\n   * Function to add a boundary condition to the worker\n   * @param {string} boundaryKey - The key identifying the boundary\n   * @param {array} condition - The boundary condition to add\n   * @returns {Promise<boolean>} Resolves when the boundary condition is added\n   */\n  async addBoundaryCondition(boundaryKey, condition) {\n    await this._ensureReady();\n    return this.feaWorker.addBoundaryCondition(boundaryKey, condition);\n  }\n\n  /**\n   * Function to set the solver method in the worker\n   * @param {string} solverMethod - The solver method to set\n   * @returns {Promise<boolean>} Resolves when the solver method is set\n   */\n  async setSolverMethod(solverMethod) {\n    await this._ensureReady();\n    return this.feaWorker.setSolverMethod(solverMethod);\n  }\n\n  /**\n   * Function to request the worker to solve the problem\n   * @returns {Promise<object>} Resolves with the solution result\n   */\n  async solve() {\n    await this._ensureReady();\n    const startTime = performance.now();\n    const result = await this.feaWorker.solve();\n    const endTime = performance.now();\n    return result;\n  }\n\n  /**\n   * Function to retrieve model information from the worker\n   * @returns {Promise<object>} Resolves with the model information\n   */\n  async getModelInfo() {\n    await this._ensureReady();\n    return this.feaWorker.getModelInfo();\n  }\n\n  /**\n   * Function to send a ping request to the worker to check its availability\n   * @returns {Promise<boolean>} Resolves if the worker responds\n   */\n  async ping() {\n    await this._ensureReady();\n    return this.feaWorker.ping();\n  }\n\n  /**\n   * Function to terminate the worker and clean up resources\n   */\n  terminate() {\n    if (this.worker) {\n      this.worker.terminate();\n      this.worker = null;\n      this.feaWorker = null;\n      this.isReady = false;\n    }\n  }\n}\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\n// Internal imports\nimport { basicLog, debugLog, errorLog } from \"../utilities/loggingScript.js\";\n\n/**\n * Function to import mesh data from Gmsh (.msh v4.1) containing quadrilateral and triangular elements\n * @param {File} file\n * @returns {object}\n */\nconst importGmshQuadTri = async (file) => {\n  let result = {\n    nodesXCoordinates: [],\n    nodesYCoordinates: [],\n    nodalNumbering: {\n      quadElements: [],\n      triangleElements: [],\n    },\n    boundaryElements: [],\n    boundaryConditions: [],\n    boundaryNodePairs: {},\n    gmshV: 0,\n    ascii: false,\n    fltBytes: \"8\",\n    totalNodesX: 0,\n    totalNodesY: 0,\n    physicalPropMap: [],\n    elementTypes: {},\n  };\n\n  // Entities to physical tags map\n  const entityPhysicalMap = { curves: {} };\n\n  let content = await file.text();\n  let lines = content\n    .split(\"\\n\")\n    .map((l) => l.trim())\n    .filter((l) => l !== \"\");\n\n  let section = \"\";\n  let lineIndex = 0;\n\n  // Nodes\n  let nodeEntityBlocks = 0;\n  let totalNodes = 0;\n  let nodeBlocksProcessed = 0;\n  let currentNodeBlock = { numNodes: 0 };\n  let nodeTags = [];\n  let nodeTagsCollected = 0;\n  let nodeCoordinatesCollected = 0;\n\n  // Elements\n  let elementEntityBlocks = 0;\n  let totalElements = 0;\n  let elementBlocksProcessed = 0;\n  let currentElementBlock = { numElements: 0 };\n  let elementsProcessedInBlock = 0;\n\n  let boundaryElementsByTag = {};\n\n  // Entities helpers\n  let entityCounts = null;\n  let entitiesPhase = null;\n  let processedPoints = 0;\n  let processedCurves = 0;\n  let processedSurfaces = 0;\n  let processedVolumes = 0;\n\n  while (lineIndex < lines.length) {\n    const line = lines[lineIndex];\n\n    // Section switches\n    if (line === \"$MeshFormat\") {\n      section = \"meshFormat\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndMeshFormat\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$PhysicalNames\") {\n      section = \"physicalNames\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndPhysicalNames\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Entities\") {\n      section = \"entities\";\n      entitiesPhase = \"counts\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndEntities\") {\n      section = \"\";\n      entityCounts = null;\n      entitiesPhase = null;\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Nodes\") {\n      section = \"nodes\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndNodes\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$Elements\") {\n      section = \"elements\";\n      lineIndex++;\n      continue;\n    }\n    if (line === \"$EndElements\") {\n      section = \"\";\n      lineIndex++;\n      continue;\n    }\n\n    const parts = line.split(/\\s+/);\n\n    // Mesh format\n    if (section === \"meshFormat\") {\n      result.gmshV = parseFloat(parts[0]);\n      result.ascii = parts[1] === \"0\";\n      result.fltBytes = parts[2];\n    }\n\n    // Physical names\n    else if (section === \"physicalNames\") {\n      const dimension = parseInt(parts[0], 10);\n      const tag = parseInt(parts[1], 10);\n      let name = parts.slice(2).join(\" \").replace(/^\"|\"$/g, \"\");\n\n      result.physicalPropMap.push({ tag, dimension, name });\n    }\n\n    // Entities\n    else if (section === \"entities\") {\n      if (entitiesPhase === \"counts\") {\n        entityCounts = {\n          points: parseInt(parts[0], 10),\n          curves: parseInt(parts[1], 10),\n          surfaces: parseInt(parts[2], 10),\n          volumes: parseInt(parts[3], 10),\n        };\n        entitiesPhase = \"points\";\n      } else if (entitiesPhase === \"points\") {\n        processedPoints++;\n        if (processedPoints === entityCounts.points) entitiesPhase = \"curves\";\n      } else if (entitiesPhase === \"curves\") {\n        const tag = parseInt(parts[0], 10);\n        const numPhysical = parseInt(parts[7], 10);\n        const physTags = parts.slice(8, 8 + numPhysical).map((p) => parseInt(p, 10));\n        entityPhysicalMap.curves[tag] = physTags;\n        processedCurves++;\n        if (processedCurves === entityCounts.curves) entitiesPhase = \"surfaces\";\n      } else if (entitiesPhase === \"surfaces\") {\n        processedSurfaces++;\n        if (processedSurfaces === entityCounts.surfaces) entitiesPhase = \"volumes\";\n      } else if (entitiesPhase === \"volumes\") {\n        processedVolumes++;\n      }\n    }\n\n    // Nodes\n    else if (section === \"nodes\") {\n      if (nodeEntityBlocks === 0) {\n        nodeEntityBlocks = parseInt(parts[0], 10);\n        totalNodes = parseInt(parts[1], 10);\n        result.nodesXCoordinates = new Array(totalNodes).fill(0);\n        result.nodesYCoordinates = new Array(totalNodes).fill(0);\n      } else if (nodeBlocksProcessed < nodeEntityBlocks && currentNodeBlock.numNodes === 0) {\n        currentNodeBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10),\n          parametric: parseInt(parts[2], 10),\n          numNodes: parseInt(parts[3], 10),\n        };\n        nodeTags = [];\n        nodeTagsCollected = 0;\n        nodeCoordinatesCollected = 0;\n      } else if (nodeTagsCollected < currentNodeBlock.numNodes) {\n        for (let p of parts) {\n          nodeTags.push(parseInt(p, 10));\n          nodeTagsCollected++;\n          if (nodeTagsCollected === currentNodeBlock.numNodes) break;\n        }\n      } else if (nodeCoordinatesCollected < currentNodeBlock.numNodes) {\n        const nodeTag = nodeTags[nodeCoordinatesCollected] - 1;\n        result.nodesXCoordinates[nodeTag] = parseFloat(parts[0]);\n        result.nodesYCoordinates[nodeTag] = parseFloat(parts[1]);\n        result.totalNodesX++;\n        result.totalNodesY++;\n        nodeCoordinatesCollected++;\n        if (nodeCoordinatesCollected === currentNodeBlock.numNodes) {\n          nodeBlocksProcessed++;\n          currentNodeBlock = { numNodes: 0 };\n        }\n      }\n    }\n\n    // Elements\n    else if (section === \"elements\") {\n      if (elementEntityBlocks === 0) {\n        elementEntityBlocks = parseInt(parts[0], 10);\n        totalElements = parseInt(parts[1], 10);\n      } else if (elementBlocksProcessed < elementEntityBlocks && currentElementBlock.numElements === 0) {\n        currentElementBlock = {\n          dim: parseInt(parts[0], 10),\n          tag: parseInt(parts[1], 10), // entity tag\n          elementType: parseInt(parts[2], 10),\n          numElements: parseInt(parts[3], 10),\n        };\n\n        result.elementTypes[currentElementBlock.elementType] =\n          (result.elementTypes[currentElementBlock.elementType] || 0) + currentElementBlock.numElements;\n\n        elementsProcessedInBlock = 0;\n      } else if (elementsProcessedInBlock < currentElementBlock.numElements) {\n        const nodeIndices = parts.slice(1).map((n) => parseInt(n, 10));\n\n        // Resolve physical tag via entity → physical map\n        let physicalTag = currentElementBlock.tag;\n        if (currentElementBlock.dim === 1) {\n          const mapped = entityPhysicalMap.curves[currentElementBlock.tag];\n          if (mapped && mapped.length > 0) physicalTag = mapped[0];\n        }\n\n        if (currentElementBlock.elementType === 1 || currentElementBlock.elementType === 8) {\n          if (!boundaryElementsByTag[physicalTag]) boundaryElementsByTag[physicalTag] = [];\n          boundaryElementsByTag[physicalTag].push(nodeIndices);\n\n          if (!result.boundaryNodePairs[physicalTag]) result.boundaryNodePairs[physicalTag] = [];\n          result.boundaryNodePairs[physicalTag].push(nodeIndices);\n        } else if (currentElementBlock.elementType === 2) {\n          result.nodalNumbering.triangleElements.push(nodeIndices);\n        } else if (currentElementBlock.elementType === 3 || currentElementBlock.elementType === 10) {\n          result.nodalNumbering.quadElements.push(nodeIndices);\n        }\n\n        elementsProcessedInBlock++;\n        if (elementsProcessedInBlock === currentElementBlock.numElements) {\n          elementBlocksProcessed++;\n          currentElementBlock = { numElements: 0 };\n        }\n      }\n    }\n\n    lineIndex++;\n  }\n\n  // Boundary conditions\n  result.physicalPropMap.forEach((prop) => {\n    if (prop.dimension === 1) {\n      const nodes = boundaryElementsByTag[prop.tag] || [];\n      if (nodes.length > 0) {\n        result.boundaryConditions.push({\n          name: prop.name,\n          tag: prop.tag,\n          nodes,\n        });\n      }\n    }\n  });\n\n  debugLog(`Parsed boundary node pairs by physical tag: ${JSON.stringify(result.boundaryNodePairs)}`);\n\n  return result;\n};\n\nexport { importGmshQuadTri };\n","/**\n * ════════════════════════════════════════════════════════════════\n *  FEAScript Core Library\n *  Lightweight Finite Element Simulation in JavaScript\n *  Version: 0.3.0 (RC) | https://feascript.com\n *  MIT License © 2023–2026 FEAScript\n * ════════════════════════════════════════════════════════════════\n */\n\nexport { FEAScriptModel } from \"./FEAScript.js\";\nexport { importGmshQuadTri } from \"./readers/gmshReaderScript.js\"; //TODO rename importGmshQuadTri to importGmsh\nexport { logSystem } from \"./utilities/loggingScript.js\";\nexport { plotSolution, plotInterpolatedSolution } from \"./visualization/plotlyPlotScript.js\";\nexport {\n  plotSolutionVtk,\n  plotInterpolatedSolutionVtk,\n  createColorScale,\n  createContourLineOptions,\n  transformSolverOutputToVtkData,\n  transformSolverOutputToVTP,\n  transformSolverOutputToMLBuffers,\n} from \"./visualization/vtkPlotScript.js\";\nexport { FEAScriptWorker } from \"./workers/workerScript.js\";\nexport const printVersion = \"0.3.0 (RC)\";\n"],"names":["euclideanNorm","vector","norm","i","length","Math","sqrt","currentLogLevel","debugLog","message","console","log","basicLog","errorLog","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","Map","canHandle","serialize","obj","port1","port2","MessageChannel","expose","deserialize","port","start","wrap","value","serialized","Error","isError","name","stack","Object","assign","ep","globalThis","allowedOrigins","addEventListener","callback","ev","data","origin","allowedOrigin","RegExp","test","isAllowedOrigin","warn","id","type","path","argumentList","map","fromWireValue","returnValue","parent","slice","reduce","prop","rawValue","apply","proxy","transfers","transferCache","set","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","constructor","isMessagePort","close","target","pendingListeners","resolver","get","delete","createProxy","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","clear","r","p","toString","bind","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","Array","prototype","concat","handler","serializedValue","msg","fill","floor","random","Number","MAX_SAFE_INTEGER","join","solveLinearSystem","solverMethod","jacobianMatrix","residualVector","options","maxIterations","tolerance","solutionVector","converged","iterations","time","jacobianMatrixSparse","math","sparse","luFactorization","slu","solutionMatrix","lusolve","squeeze","valueOf","jacobiSolverResult","A","b","x0","n","x","xNew","iter","sum","j","maxDiff","max","abs","jacobiSolver","timeEnd","async","solveLinearSystemAsync","isArray","toArray","created","computeEngine","worker","Worker","URL","document","location","require","__filename","href","currentScript","tagName","toUpperCase","src","baseURI","Comlink.wrap","initialize","createDefaultComputeEngine","result","webgpuJacobiSolver","destroy","terminate","BasisFunctions","meshDimension","elementOrder","this","getBasisFunctions","ksi","eta","basisFunction","basisFunctionDerivKsi","basisFunctionDerivEta","l1","c","l2","l3","dl1","dl2","dl3","Mesh","numElementsX","maxX","numElementsY","maxY","parsedMesh","boundaryElementsProcessed","parseMeshFromGmsh","nodalNumbering","quadElements","triangleElements","JSON","stringify","elementTypes","mappedNodalNumbering","elementIndex","gmshNodes","FEAScriptNodes","push","physicalPropMap","boundaryElements","fixedBoundaryElements","boundaryNodePairs","forEach","dimension","tag","nodesPair","node1","node2","foundElement","elementConnectivity","includes","side","node1Index","indexOf","node2Index","Mesh1D","super","generateMesh","nodesXCoordinates","totalNodesX","deltaX","nodeIndex","generateNodalNumbering1D","findBoundaryElements","nop","columnCounter","sideIndex","Mesh2D","angleLeft","angleRight","nodesYCoordinates","totalNodesY","deltaY","nodeIndexY","nodeIndexX","nnode","degToRad","PI","tanLeft","tan","tanRight","epsilon","y","xLeft","xRight","t","generateNodalNumbering2D","rowCounter","elementIndexX","elementIndexY","nodeIndex1","nodeIndex2","NumericalIntegration","getGaussPointsAndWeights","gaussPoints","gaussWeights","prepareMesh","meshConfig","mesh","nodesCoordinatesAndNumbering","totalElements","totalNodes","initializeFEA","meshData","colIndex","basisFunctions","gaussPointsAndWeights","localToGlobalMap","nodesPerElement","performIsoparametricMapping1D","params","xCoordinates","ksiDerivX","localNodeIndex","detJacobian","basisFunctionDerivX","performIsoparametricMapping2D","yCoordinates","etaDerivX","ksiDerivY","etaDerivY","basisFunctionDerivY","pointInsideTriangle","vertices","v0","v1","v2","denom","inside","pointInsideQuadrilateral","firstTriangleVertices","secondTriangleVertices","v3","splitQuadrilateral","pointInsideFirstTriangle","pointInsideSecondTriangle","getDistanceFromLine","p1","p2","distLeft","distRight","distBottom","computeNodeNeighbors","nodeNeighbors","from","neighborCount","elemIndex","getBoundarySegments","boundarySides","boundaryLineElements","boundaryNodesSegments","boundaryGlobalElementIndex","boundaryIndex","boundaryLocalElementIndex","boundaryLocalNodeIndices","currentElementNodesX","currentElementNodesY","boundaryLocalNodeIndex","globalNodeIndex","k","ThermalBoundaryConditions","boundaryConditions","imposeConstantTempBoundaryConditions","keys","boundaryKey","tempValue","imposeConstantTempBoundaryConditionsFront","nodeConstraintCode","boundaryValues","imposeConvectionBoundaryConditions","convectionHeatTranfCoeff","convectionExtTemp","key","boundaryCondition","convectionCoeff","extTemp","gaussPoint1","gaussPoint2","firstNodeIndex","lastNodeIndex","nodeIncrement","basisFunctionsAndDerivatives","tangentVectorLength","localNodeIndex2","globalNodeIndex2","gaussPointIndex","imposeConvectionBoundaryConditionsFront","localJacobianMatrix","localResidualVector","boundaryElement","find","boundaryElementIndex","_","assembleHeatConductionMat","FEAData","gaussPointIndex1","mappingResult","localNodeIndex1","localToGlobalMap1","localToGlobalMap2","gaussPointIndex2","thermalBoundaryConditions","assembleHeatConductionFront","ngl","globalIndex","GenericBoundaryConditions","imposeDirichletBoundaryConditions","imposeConstantValueBoundaryConditionsFront","assembleFrontPropagationMat","eikonalActivationFlag","eikonalViscousTerm","solutionDerivX","solutionDerivY","assembleFrontPropagationFront","frontalData","frontalState","elementData","currentElementIndex","frontStorage","runFrontalSolver","assembleFront","numElements","globalResidualVector","topologyData","lateralData","writeFlag","transformationFlag","determinant","systemSize","globalSolutionVector","frontDataIndex","frontSize","frontWidthEstimate","ceil","estimateFrontSize","frontValues","columnHeaders","pivotRow","pivotData","initializeFrontalArrays","dirichletBoundaryConditionsHandler","currentSolutionVector","pivotColumnGlobalIndex","localDestination","rowDestination","rowHeaders","pivotRowIndices","pivotColumnIndices","modifiedRows","pivotColumn","frontMatrix","rowSwapCount","columnSwapCount","lastAppearanceCheck","frontDataCounter","pivotDataIndex","summedRows","reverseElementIndex","columnCount","rowCount","assembled","numElementNodes","numElementColumns","assembleElementContribution","currentElement","columnIndex","rowIndex","localColumnIndex","frontColumnIndex","localRowIndex","availableColumnCount","constrainedRowCount","availableRowCount","absoluteNodeIndex","constrainedIndex","pivotRowIndex","pivotColumnIndex","pivotValue","testColumnIndex","testRowIndex","testValue","pivotGlobalRowIndex","permutationHelper","rightHandSide","globalRowIndex","eliminationFactor","performBackSubstitution","runFrontalAlgorithm","toExponential","finalNodesX","finalNodesY","nodesCoordinates","boundaryLocalJacobianMatrix","boundaryResidualVector","isOnRobinTypeBoundary","some","localNodeI","localNodeJ","iterationIndex","accumulatedValue","newtonRaphson","assembleMat","context","errorNorm","initialSolution","FlowBoundaryConditions","totalNodesVelocity","totalNodesPressure","q2ToPressureMap","totalDOFs","hasStressFree","bcType","uValue","vValue","uDOF","vDOF","pDOF","pointSearch","model","visNodeXCoordinate","visNodeYCoordinate","pointCheck","solutionInterpolation","zData","solutionInterpolationValue","pointInsidePolygon","segments","x1","y1","x2","y2","_vtkModules","loadVtkModules","import","default","vtkActor","vtkColorTransferFunction","vtkColorMaps","vtkDataArray","vtkImageData","vtkImageMarchingSquares","vtkGenericRenderWindow","vtkMapper","vtkPolyData","vtkScalarBarActor","all","rendererCache","createColorScale","presetName","reverse","showScalarBar","scalarBarTitle","createContourLineOptions","enabled","numberOfContours","color","lineWidth","transformSolverOutputToVtkData","preparedMesh","solutionArray","extractScalarSolution","points","buildPointsArray","mode","cells","totalPoints","Uint32Array","packed","offset","buildLineCellsFromPoints","cell","convertElementNodesToLinearCell","buildCellArrayFromNop","scalars","polyData","buildPolyData","metadata","solverConfig","numberOfPoints","numberOfCells","countPackedCells","renderVtkScene","vtkData","plotDivId","plotType","renderOptions","container","getElementById","has","innerHTML","style","position","width","height","genericRenderWindow","newInstance","background","setContainer","resize","renderer","getRenderer","renderWindow","getRenderWindow","mapper","setInputData","setScalarModeToUsePointData","setColorModeToMapScalars","setScalarVisibility","scalarRange","minValue","POSITIVE_INFINITY","maxValue","NEGATIVE_INFINITY","isFinite","getScalarRange","setScalarRange","colorScale","lookupTable","mappedPreset","preset","RGBPoints","rgb","minX","reversed","reverseColorMapPreset","getPresetByName","applyColorMap","setMappingRange","updateRange","setLookupTable","actor","setMapper","getProperty","setLineWidth","addActor","scalarBarActor","drawNanAnnotation","generateTicks","helper","bounds","getLastTickBounds","minVal","maxVal","step","ticks","setTicks","setTickStrings","parseFloat","toPrecision","setTickTextStyle","fontColor","setAxisTextStyle","setAxisLabel","setScalarsToColors","addActor2D","contourLines","contourOptions","gridMeta","interpolationGrid","imageData","setDimensions","nx","ny","setOrigin","setSpacing","spacing","imageScalars","numberOfComponents","values","getPointData","setScalars","contourFilter","slicingMode","mergePoints","contourValues","setContourValues","update","contourMapper","getOutputData","contourActor","setColor","addContourLinesToRenderer","resetCamera","render","title","getPoints","setData","getLines","getPolys","scalarData","Float32Array","base","expectedLength","elementNodes","indices","node","min","packedCells","count","reorderStructuredScalarsForImage","reordered","iy","ix","interpolatedValue","coefficientFunctions","setModelConfig","modelConfig","setMeshConfig","addBoundaryCondition","condition","setSolverMethod","solve","eikonalExteralIterations","newtonRaphsonResult","B","C","D","xCoord","a","d","globalNodeIndex1","assembleGeneralFormPDEMat","creepingFlowResult","cornerLocalIndices","pressureNodeIndices","pressureNodeCount","cornerIndex","globalQ2Node","velocityBasisFunctions","pressureBasisFunctions","velLocalToGlobalMap","presLocalToGlobalMap","velocityBasisFunctionsAndDerivatives","pressureBasisFunctionsAndDerivatives","weightFactor","globalNode1","uDOF1","vDOF1","globalNode2","uDOF2","vDOF2","viscousContribution","localPresIndex","bxContribution","byContribution","assembleCreepingFlowMatrix","_creepingFlowMetadata","solveAsync","feaWorker","isReady","_initWorker","onerror","event","workerWrapper","_ensureReady","reject","attempts","checkReady","setTimeout","performance","now","getModelInfo","ping","file","gmshV","ascii","fltBytes","entityPhysicalMap","curves","lines","text","split","l","trim","filter","section","lineIndex","nodeEntityBlocks","nodeBlocksProcessed","currentNodeBlock","numNodes","nodeTags","nodeTagsCollected","nodeCoordinatesCollected","elementEntityBlocks","elementBlocksProcessed","currentElementBlock","elementsProcessedInBlock","boundaryElementsByTag","entityCounts","entitiesPhase","processedPoints","processedCurves","processedSurfaces","line","parts","parseInt","replace","surfaces","volumes","numPhysical","physTags","dim","parametric","nodeTag","elementType","nodeIndices","physicalTag","mapped","nodes","level","visNodeXCoordinates","visNodeYCoordinates","lengthX","lengthY","visPoinsPerUnit","visNodesX","round","visNodesY","deltavisX","deltavisY","visSolution","visNodeIndexY","visNodeIndexX","boundarySegments","lastParentElement","visNodeIndex","found","neighborElementsIndex","searchResult","maxWindowWidth","window","innerWidth","aspectRatio","plotWidth","plotHeight","layout","xaxis","yaxis","scaleanchor","scaleratio","margin","hovermode","contourData","z","connectgaps","hoverongaps","smoothing","contours","coloring","showlabels","colorbar","Plotly","newPlot","responsive","interpolatedVtkData","grid","minY","visPointsPerUnit","totalVisNodes","NaN","insideMask","Uint8Array","ni","buildInterpolatedGridValues","n0","n1","n2","n3","buildStructuredGridCells","buildInterpolatedVtkData","yData","lineData","features","featuresShape","labels","connectivity","offsets","running","npts","packedCellsToConnectivityAndOffsets","isLine","topologyTag","buildVTPString"],"mappings":"oyBAcO,SAASA,EAAcC,GAC5B,IAAIC,EAAO,EACX,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAOG,OAAQD,IACjCD,GAAQD,EAAOE,GAAKF,EAAOE,GAG7B,OADAD,EAAOG,KAAKC,KAAKJ,GACVA,CACT,CCXA,IAAIK,EAAkB,QAuBf,SAASC,EAASC,GACC,UAApBF,GACFG,QAAQC,IAAI,aAAeF,EAAS,qCAExC,CAMO,SAASG,EAASH,GACvBC,QAAQC,IAAI,YAAcF,EAAS,qCACrC,CAMO,SAASI,EAASJ,GACvBC,QAAQC,IAAI,aAAeF,EAAS,qCACtC;;;;;;AChDA,MAAMK,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIC,IAAI,CAC7B,CAAC,QA7CwB,CACzBC,UAAYH,GAAQD,EAASC,IAAQA,EAAIP,GACzC,SAAAW,CAAUC,GACN,MAAMC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAE7B,OADAC,EAAOJ,EAAKC,GACL,CAACC,EAAO,CAACA,GACnB,EACDG,YAAYC,IACRA,EAAKC,QACEC,EAAKF,MAqChB,CAAC,QA/BwB,CACzBR,UAAYW,GAAUf,EAASe,IAAUhB,KAAegB,EACxD,SAAAV,EAAUU,MAAEA,IACR,IAAIC,EAcJ,OAZIA,EADAD,aAAiBE,MACJ,CACTC,SAAS,EACTH,MAAO,CACH1B,QAAS0B,EAAM1B,QACf8B,KAAMJ,EAAMI,KACZC,MAAOL,EAAMK,QAKR,CAAEF,SAAS,EAAOH,SAE5B,CAACC,EAAY,GACvB,EACD,WAAAL,CAAYK,GACR,GAAIA,EAAWE,QACX,MAAMG,OAAOC,OAAO,IAAIL,MAAMD,EAAWD,MAAM1B,SAAU2B,EAAWD,OAExE,MAAMC,EAAWD,KACpB,MAoBL,SAASL,EAAOJ,EAAKiB,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAASC,EAASC,GAC7C,IAAKA,IAAOA,EAAGC,KACX,OAEJ,IAhBR,SAAyBJ,EAAgBK,GACrC,IAAK,MAAMC,KAAiBN,EAAgB,CACxC,GAAIK,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEd,CACD,OAAO,CACX,CAMaI,CAAgBT,EAAgBG,EAAGE,QAEpC,YADAxC,QAAQ6C,KAAK,mBAAmBP,EAAGE,6BAGvC,MAAMM,GAAEA,EAAEC,KAAEA,EAAIC,KAAEA,GAASjB,OAAOC,OAAO,CAAEgB,KAAM,IAAMV,EAAGC,MACpDU,GAAgBX,EAAGC,KAAKU,cAAgB,IAAIC,IAAIC,GACtD,IAAIC,EACJ,IACI,MAAMC,EAASL,EAAKM,MAAM,GAAI,GAAGC,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GAC5DyC,EAAWT,EAAKO,QAAO,CAACvC,EAAKwC,IAASxC,EAAIwC,IAAOxC,GACvD,OAAQ+B,GACJ,IAAK,MAEGK,EAAcK,EAElB,MACJ,IAAK,MAEGJ,EAAOL,EAAKM,OAAO,GAAG,IAAMH,EAAcb,EAAGC,KAAKd,OAClD2B,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcK,EAASC,MAAML,EAAQJ,GAEzC,MACJ,IAAK,YAGGG,EA+LxB,SAAepC,GACX,OAAOe,OAAOC,OAAOhB,EAAK,CAAEZ,CAACA,IAAc,GAC/C,CAjMsCuD,CADA,IAAIF,KAAYR,IAGlC,MACJ,IAAK,WACD,CACI,MAAMhC,MAAEA,EAAKC,MAAEA,GAAU,IAAIC,eAC7BC,EAAOJ,EAAKE,GACZkC,EAoLxB,SAAkBpC,EAAK4C,GAEnB,OADAC,EAAcC,IAAI9C,EAAK4C,GAChB5C,CACX,CAvLsC+C,CAAS9C,EAAO,CAACA,GAClC,CACD,MACJ,IAAK,UAEGmC,OAAcY,EAElB,MACJ,QACI,OAEX,CACD,MAAOvC,GACH2B,EAAc,CAAE3B,QAAOhB,CAACA,GAAc,EACzC,CACDwD,QAAQC,QAAQd,GACXe,OAAO1C,IACD,CAAEA,QAAOhB,CAACA,GAAc,MAE9B2D,MAAMhB,IACP,MAAOiB,EAAWC,GAAiBC,EAAYnB,GAC/CnB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,GACvD,YAATvB,IAEAd,EAAGwC,oBAAoB,UAAWpC,GAClCqC,EAAczC,GACVzB,KAAaQ,GAAiC,mBAAnBA,EAAIR,IAC/BQ,EAAIR,KAEX,IAEA2D,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3C9C,MAAO,IAAImD,UAAU,+BACrBnE,CAACA,GAAc,IAEnBwB,EAAGuC,YAAYzC,OAAOC,OAAOD,OAAOC,OAAO,GAAIqC,GAAY,CAAEvB,OAAOwB,EAAc,GAE9F,IACQrC,EAAGV,OACHU,EAAGV,OAEX,CAIA,SAASmD,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAASC,YAAYjD,IAChC,EAEQkD,CAAcF,IACdA,EAASG,OACjB,CACA,SAASxD,EAAKS,EAAIgD,GACd,MAAMC,EAAmB,IAAIrE,IAiB7B,OAhBAoB,EAAGG,iBAAiB,WAAW,SAAuBE,GAClD,MAAMC,KAAEA,GAASD,EACjB,IAAKC,IAASA,EAAKO,GACf,OAEJ,MAAMqC,EAAWD,EAAiBE,IAAI7C,EAAKO,IAC3C,GAAKqC,EAGL,IACIA,EAAS5C,EACZ,CACO,QACJ2C,EAAiBG,OAAO9C,EAAKO,GAChC,CACT,IACWwC,EAAYrD,EAAIiD,EAAkB,GAAID,EACjD,CACA,SAASM,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAI7D,MAAM,6CAExB,CACA,SAAS8D,EAAgBxD,GACrB,OAAOyD,EAAuBzD,EAAI,IAAIpB,IAAO,CACzCkC,KAAM,YACPqB,MAAK,KACJM,EAAczC,EAAG,GAEzB,CACA,MAAM0D,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B3D,YAC9C,IAAI4D,sBAAsB7D,IACtB,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACJ,IAAbA,GACAN,EAAgBxD,EACnB,IAcT,SAASqD,EAAYrD,EAAIiD,EAAkBlC,EAAO,GAAIiC,EAAS,cAC3D,IAAIe,GAAkB,EACtB,MAAMrC,EAAQ,IAAIsC,MAAMhB,EAAQ,CAC5B,GAAAG,CAAIc,EAAS1C,GAET,GADA+B,EAAqBS,GACjBxC,IAASjD,EACT,MAAO,MAXvB,SAAyBoD,GACjBkC,GACAA,EAAgBM,WAAWxC,EAEnC,CAQoByC,CAAgBzC,GAChB8B,EAAgBxD,GAChBiD,EAAiBmB,QACjBL,GAAkB,CAAI,EAG9B,GAAa,SAATxC,EAAiB,CACjB,GAAoB,IAAhBR,EAAKtD,OACL,MAAO,CAAE0E,KAAM,IAAMT,GAEzB,MAAM2C,EAAIZ,EAAuBzD,EAAIiD,EAAkB,CACnDnC,KAAM,MACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,eACzBpC,KAAKjB,GACR,OAAOmD,EAAElC,KAAKqC,KAAKH,EACtB,CACD,OAAOhB,EAAYrD,EAAIiD,EAAkB,IAAIlC,EAAMQ,GACtD,EACD,GAAAM,CAAIoC,EAAS1C,EAAMC,GACf8B,EAAqBS,GAGrB,MAAOvE,EAAO6C,GAAiBC,EAAYd,GAC3C,OAAOiC,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,MACNC,KAAM,IAAIA,EAAMQ,GAAMN,KAAKqD,GAAMA,EAAEC,aACnC/E,SACD6C,GAAeF,KAAKjB,EAC1B,EACD,KAAAO,CAAMwC,EAASQ,EAAUC,GACrBpB,EAAqBS,GACrB,MAAMY,EAAO5D,EAAKA,EAAKtD,OAAS,GAChC,GAAIkH,IAAStG,EACT,OAAOoF,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,aACPqB,KAAKjB,GAGZ,GAAa,SAATyD,EACA,OAAOtB,EAAYrD,EAAIiD,EAAkBlC,EAAKM,MAAM,GAAI,IAE5D,MAAOL,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,QACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,EACD,SAAA2D,CAAUZ,EAASS,GACfpB,EAAqBS,GACrB,MAAO/C,EAAcqB,GAAiBuC,EAAiBF,GACvD,OAAOjB,EAAuBzD,EAAIiD,EAAkB,CAChDnC,KAAM,YACNC,KAAMA,EAAKE,KAAKqD,GAAMA,EAAEC,aACxBvD,gBACDqB,GAAeF,KAAKjB,EAC1B,IAGL,OA9EJ,SAAuBQ,EAAO1B,GAC1B,MAAM8D,GAAYJ,EAAaP,IAAInD,IAAO,GAAK,EAC/C0D,EAAa7B,IAAI7B,EAAI8D,GACjBF,GACAA,EAAgBkB,SAASpD,EAAO1B,EAAI0B,EAE5C,CAuEIqD,CAAcrD,EAAO1B,GACd0B,CACX,CAIA,SAASkD,EAAiB5D,GACtB,MAAMgE,EAAYhE,EAAaC,IAAIqB,GACnC,MAAO,CAAC0C,EAAU/D,KAAKgE,GAAMA,EAAE,MALnBC,EAK+BF,EAAU/D,KAAKgE,GAAMA,EAAE,KAJ3DE,MAAMC,UAAUC,OAAO5D,MAAM,GAAIyD,KAD5C,IAAgBA,CAMhB,CACA,MAAMtD,EAAgB,IAAI+B,QAe1B,SAASrB,EAAY9C,GACjB,IAAK,MAAOI,EAAM0F,KAAY3G,EAC1B,GAAI2G,EAAQzG,UAAUW,GAAQ,CAC1B,MAAO+F,EAAiBlD,GAAiBiD,EAAQxG,UAAUU,GAC3D,MAAO,CACH,CACIsB,KAAM,UACNlB,OACAJ,MAAO+F,GAEXlD,EAEP,CAEL,MAAO,CACH,CACIvB,KAAM,MACNtB,SAEJoC,EAAcuB,IAAI3D,IAAU,GAEpC,CACA,SAAS0B,EAAc1B,GACnB,OAAQA,EAAMsB,MACV,IAAK,UACD,OAAOnC,EAAiBwE,IAAI3D,EAAMI,MAAMR,YAAYI,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAASiE,EAAuBzD,EAAIiD,EAAkBuC,EAAK7D,GACvD,OAAO,IAAIK,SAASC,IAChB,MAAMpB,EASH,IAAIsE,MAAM,GACZM,KAAK,GACLxE,KAAI,IAAMvD,KAAKgI,MAAMhI,KAAKiI,SAAWC,OAAOC,kBAAkBtB,SAAS,MACvEuB,KAAK,KAXN7C,EAAiBpB,IAAIhB,EAAIoB,GACrBjC,EAAGV,OACHU,EAAGV,QAEPU,EAAGuC,YAAYzC,OAAOC,OAAO,CAAEc,MAAM2E,GAAM7D,EAAU,GAE7D,CCnUO,SAASoE,EAAkBC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAExF,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpD,IAAIG,EAAiB,GACjBC,GAAY,EACZC,EAAa,EAMjB,GAHAvI,EAAS,wBAAwB+H,QACjCjI,QAAQ0I,KAAK,iBAEQ,YAAjBT,EAA4B,CAE9B,MAAMU,EAAuBC,KAAKC,OAAOX,GACnCY,EAAkBF,KAAKG,IAAIJ,EAAsB,EAAG,GAC1D,IAAIK,EAAiBJ,KAAKK,QAAQH,EAAiBX,GACnDI,EAAiBK,KAAKM,QAAQF,GAAgBG,SAElD,MAAS,GAAqB,WAAjBlB,EAA2B,CAEpC,MACMmB,EC3BH,SAAsBC,EAAGC,EAAGC,EAAInB,EAAU,CAAA,GAE/C,MAAMC,cAAEA,EAAaC,UAAEA,GAAcF,EAE/BoB,EAAIH,EAAE3J,OACZ,IAAI+J,EAAI,IAAIF,GACRG,EAAO,IAAItC,MAAMoC,GAGrB,IAAK,IAAIG,EAAO,EAAGA,EAAOtB,EAAesB,IAAQ,CAC/C,IAAK,IAAIlK,EAAI,EAAGA,EAAI+J,EAAG/J,IAAK,CAC1B,IAAImK,EAAM,EACV,IAAK,IAAIC,EAAI,EAAGA,EAAIL,EAAGK,IACjBpK,IAAMoK,IACRD,GAAOP,EAAE5J,GAAGoK,GAAKJ,EAAEI,IAGvBH,EAAKjK,IAAM6J,EAAE7J,GAAKmK,GAAOP,EAAE5J,GAAGA,EAC/B,CAGD,IAAIqK,EAAU,EACd,IAAK,IAAIrK,EAAI,EAAGA,EAAI+J,EAAG/J,IACrBqK,EAAUnK,KAAKoK,IAAID,EAASnK,KAAKqK,IAAIN,EAAKjK,GAAKgK,EAAEhK,KAMnD,GAFAgK,EAAI,IAAIC,GAEJI,EAAUxB,EACZ,MAAO,CAAEC,eAAgBkB,EAAGhB,WAAYkB,EAAO,EAAGnB,WAAW,EAEhE,CAED,MAAO,CAAED,eAAgBkB,EAAGhB,WAAYJ,EAAeG,WAAW,EACpE,CDR+ByB,CAAa/B,EAAgBC,EADnC,IAAIf,MAAMe,EAAezI,QAAQgI,KAAK,GAC2B,CACpFW,gBACAC,cAIEc,EAAmBZ,UACrB1I,EAAS,8BAA8BsJ,EAAmBX,yBAE1DtI,EAAS,wCAAwCiJ,EAAmBX,yBAGtEF,EAAiBa,EAAmBb,eACpCC,EAAYY,EAAmBZ,UAC/BC,EAAaW,EAAmBX,UACpC,MACItI,EAAS,0BAA0B8H,KAMrC,OAHAjI,QAAQkK,QAAQ,iBAChBhK,EAAS,8BAEF,CAAEqI,iBAAgBC,YAAWC,aACtC,CAuBO0B,eAAeC,EAAuBnC,EAAcC,EAAgBC,EAAgBC,EAAU,CAAA,GAEnG,MAAMC,cAAEA,EAAgB,IAAKC,UAAEA,EAAY,MAASF,EAEpDlI,EAAS,wBAAwB+H,QACjCjI,QAAQ0I,KAAK,iBAGb,MAAMW,EAAIjC,MAAMiD,QAAQnC,GAAkBA,EAAkBA,GAAgBoC,aAAepC,EACrFoB,EAAIlC,MAAMiD,QAAQlC,GAAkBA,EAAkBA,GAAgBmC,aAAenC,EAE3F,IAKIM,EALA8B,EAAU,KACVC,EAAgB,KAEhBjC,EAAiB,GACjBC,GAAY,EAGhB,GAAqB,eAAjBP,EAA+B,CAEjCsC,QAxCJJ,iBACE,MAAMM,EAAS,IAAIC,OAAO,IAAIC,IAAI,mCAAoC,oBAAAC,UAAA,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAA,oBAAAJ,SAAAC,SAAAG,KAAAJ,SAAAK,eAAA,WAAAL,SAAAK,cAAAC,QAAAC,eAAAP,SAAAK,cAAAG,KAAA,IAAAT,IAAA,mBAAAC,SAAAS,SAAAL,MAAkB,CACtFjI,KAAM,WAEFyH,EAAgBc,EAAab,GAEnC,aADMD,EAAce,aACb,CAAEf,gBAAeC,SAC1B,CAiCoBe,GAChBhB,EAAgBD,EAAQC,cAExB,MAAMjB,EAAK,IAAInC,MAAMkC,EAAE5J,QAAQgI,KAAK,GACpC,IAAI+D,EAEJA,QAAejB,EAAckB,mBAAmBrC,EAAGC,EAAGC,EAAI,CAAElB,gBAAeC,cAC3EC,EAAiBkD,EAAOlD,eACxBC,EAAYiD,EAAOjD,UACnBC,EAAagD,EAAOhD,WAGhBD,EACF1I,EAAS,8BAA8B2I,gBAEvCtI,EAAS,wCAAwCsI,eAEvD,MACItI,EAAS,0BAA0B8H,KAWrC,OARAjI,QAAQkK,QAAQ,iBAChBhK,EAAS,+BAA+B+H,MAEpCsC,UACIC,GAAemB,YAAYxH,OAAM,UACvCoG,EAAQE,OAAOmB,aAGV,CAAErD,iBAAgBC,YAAWC,aACtC,CEhIO,MAAMoD,EAMX,WAAA/G,EAAYgH,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAWD,iBAAAE,CAAkBC,EAAKC,EAAM,MAC3B,IAAIC,EAAgB,GAChBC,EAAwB,GACxBC,EAAwB,GAE5B,GAA2B,OAAvBN,KAAKF,cACmB,WAAtBE,KAAKD,cAEPK,EAAc,GAAK,EAAIF,EACvBE,EAAc,GAAKF,EAGnBG,EAAsB,IAAM,EAC5BA,EAAsB,GAAK,GACI,cAAtBL,KAAKD,eAEdK,EAAc,GAAK,EAAI,EAAIF,EAAM,EAAIA,GAAO,EAC5CE,EAAc,GAAK,EAAIF,EAAM,EAAIA,GAAO,EACxCE,EAAc,GAAY,EAAIF,GAAO,EAAjBA,EAGpBG,EAAsB,GAAU,EAAIH,EAAR,EAC5BG,EAAsB,GAAK,EAAI,EAAIH,EACnCG,EAAsB,GAAU,EAAIH,EAAR,QAEzB,GAA2B,OAAvBF,KAAKF,cAAwB,CACtC,GAAY,OAARK,EAEF,YADAhM,EAAS,8CAIX,GAA0B,WAAtB6L,KAAKD,aAA2B,CAElC,SAASQ,EAAGC,GACV,OAAO,EAAIA,CACZ,CAYDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAUC,EAChCC,EAAc,GAAQF,EAAOK,EAAGJ,GAChCC,EAAc,GAAQF,EAAUC,EAGhCE,EAAsB,IAbZ,EAayBE,EAAGJ,GACtCE,EAAsB,IAdZ,EAc4BF,EACtCE,EAAsB,GAZb,EAY0BE,EAAGJ,GACtCE,EAAsB,GAbb,EAa6BF,EAGtCG,EAAsB,IAnBZ,EAmBiBC,EAAGL,GAC9BI,EAAsB,GAjBb,EAiBkBC,EAAGL,GAC9BI,EAAsB,IArBZ,EAqBoBJ,EAC9BI,EAAsB,GAnBb,EAmBqBJ,CACtC,MAAa,GAA0B,cAAtBF,KAAKD,aAA8B,CAE5C,SAASQ,EAAGC,GACV,OAAO,EAAIA,GAAK,EAAI,EAAIA,EAAI,CAC7B,CACD,SAASC,EAAGD,GACV,OAAQ,EAAIA,GAAK,EAAI,EAAIA,CAC1B,CACD,SAASE,EAAGF,GACV,OAAO,EAAIA,GAAK,EAAIA,CACrB,CACD,SAASG,EAAIH,GACX,OAAO,EAAIA,EAAI,CAChB,CACD,SAASI,EAAIJ,GACX,OAAQ,EAAIA,EAAI,CACjB,CACD,SAASK,EAAIL,GACX,OAAO,EAAIA,EAAI,CAChB,CAGDJ,EAAc,GAAKG,EAAGL,GAAOK,EAAGJ,GAChCC,EAAc,GAAKG,EAAGL,GAAOO,EAAGN,GAChCC,EAAc,GAAKG,EAAGL,GAAOQ,EAAGP,GAChCC,EAAc,GAAKK,EAAGP,GAAOK,EAAGJ,GAChCC,EAAc,GAAKK,EAAGP,GAAOO,EAAGN,GAChCC,EAAc,GAAKK,EAAGP,GAAOQ,EAAGP,GAChCC,EAAc,GAAKM,EAAGR,GAAOK,EAAGJ,GAChCC,EAAc,GAAKM,EAAGR,GAAOO,EAAGN,GAChCC,EAAc,GAAKM,EAAGR,GAAOQ,EAAGP,GAGhCE,EAAsB,GAAKM,EAAIT,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKM,EAAIT,GAAOO,EAAGN,GACzCE,EAAsB,GAAKM,EAAIT,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKO,EAAIV,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKO,EAAIV,GAAOO,EAAGN,GACzCE,EAAsB,GAAKO,EAAIV,GAAOQ,EAAGP,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOK,EAAGJ,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOO,EAAGN,GACzCE,EAAsB,GAAKQ,EAAIX,GAAOQ,EAAGP,GAGzCG,EAAsB,GAAKC,EAAGL,GAAOS,EAAIR,GACzCG,EAAsB,GAAKC,EAAGL,GAAOU,EAAIT,GACzCG,EAAsB,GAAKC,EAAGL,GAAOW,EAAIV,GACzCG,EAAsB,GAAKG,EAAGP,GAAOS,EAAIR,GACzCG,EAAsB,GAAKG,EAAGP,GAAOU,EAAIT,GACzCG,EAAsB,GAAKG,EAAGP,GAAOW,EAAIV,GACzCG,EAAsB,GAAKI,EAAGR,GAAOS,EAAIR,GACzCG,EAAsB,GAAKI,EAAGR,GAAOU,EAAIT,GACzCG,EAAsB,GAAKI,EAAGR,GAAOW,EAAIV,EAC1C,CACF,CAED,MAAO,CAAEC,gBAAeC,wBAAuBC,wBAChD,EC5II,MAAMQ,EAYX,WAAAhI,EAAYiI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAIpB,cACXA,EAAgB,KAAIC,aACpBA,EAAe,SAAQoB,WACvBA,EAAa,OAEbnB,KAAKe,aAAeA,EACpBf,KAAKiB,aAAeA,EACpBjB,KAAKgB,KAAOA,EACZhB,KAAKkB,KAAOA,EACZlB,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAKmB,WAAaA,EAElBnB,KAAKoB,2BAA4B,EAE7BpB,KAAKmB,aACPjN,EAAS,mEACT8L,KAAKqB,oBAER,CAKD,iBAAAA,GAOE,GANKrB,KAAKmB,WAAWG,gBACnBnN,EAAS,sDAKPiH,MAAMiD,QAAQ2B,KAAKmB,WAAWG,gBAGhC,OAFAtB,KAAKoB,2BAA4B,EACjCpB,KAAKmB,WAAWC,2BAA4B,EACrCpB,KAAKmB,WAGd,GAC4C,iBAAnCnB,KAAKmB,WAAWG,iBACtBlG,MAAMiD,QAAQ2B,KAAKmB,WAAWG,gBAC/B,CAEA,MAAMC,EAAevB,KAAKmB,WAAWG,eAAeC,cAAgB,GASpE,GARyBvB,KAAKmB,WAAWG,eAAeE,iBAExD1N,EACE,yDACE2N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWQ,aAAa,IAAM3B,KAAKmB,WAAWQ,aAAa,IAAK,CAEvE,MAAMC,EAAuB,GAE7B,IAAK,IAAIC,EAAe,EAAGA,EAAeN,EAAa7N,OAAQmO,IAAgB,CAC7E,MAAMC,EAAYP,EAAaM,GACzBE,EAAiB,IAAI3G,MAAM0G,EAAUpO,QAGlB,IAArBoO,EAAUpO,QAOZqO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IACA,IAArBA,EAAUpO,SASnBqO,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,GAC9BC,EAAe,GAAKD,EAAU,IAGhCF,EAAqBI,KAAKD,EAC3B,CAED/B,KAAKmB,WAAWG,eAAiBM,CAClC,MAAU5B,KAAKmB,WAAWQ,aAAa,IACtCxN,EAAS,4FASX,GANAL,EACE,gEACE2N,KAAKC,UAAU1B,KAAKmB,WAAWG,iBAI/BtB,KAAKmB,WAAWc,iBAAmBjC,KAAKmB,WAAWe,iBAAkB,CAEvE,GACE9G,MAAMiD,QAAQ2B,KAAKmB,WAAWe,mBAC9BlC,KAAKmB,WAAWe,iBAAiBxO,OAAS,QACFsE,IAAxCgI,KAAKmB,WAAWe,iBAAiB,GACjC,CAEA,MAAMC,EAAwB,GAC9B,IAAK,IAAI1O,EAAI,EAAGA,EAAIuM,KAAKmB,WAAWe,iBAAiBxO,OAAQD,IACvDuM,KAAKmB,WAAWe,iBAAiBzO,IACnC0O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBzO,IAGhEuM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAGD,GAAInC,KAAKmB,WAAWiB,oBAAsBpC,KAAKmB,WAAWC,4BAExDpB,KAAKmB,WAAWe,iBAAmB,GAGnClC,KAAKmB,WAAWc,gBAAgBI,SAAS7K,IAEvC,GAAuB,IAAnBA,EAAK8K,UAAiB,CAExB,MAAMF,EAAoBpC,KAAKmB,WAAWiB,kBAAkB5K,EAAK+K,MAAQ,GAErEH,EAAkB1O,OAAS,IAExBsM,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,OACzCvC,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAO,IAI/CH,EAAkBC,SAASG,IACzB,MAAMC,EAAQD,EAAU,GAClBE,EAAQF,EAAU,GAExB1O,EACE,mCAAmC2O,MAAUC,mBAAuBlL,EAAK+K,QACvE/K,EAAK3B,MAAQ,cAKjB,IAAI8M,GAAe,EAGnB,IACE,IAAId,EAAe,EACnBA,EAAe7B,KAAKmB,WAAWG,eAAe5N,OAC9CmO,IACA,CACA,MAAMe,EAAsB5C,KAAKmB,WAAWG,eAAeO,GAG3D,GAAmC,IAA/Be,EAAoBlP,QAEtB,GAAIkP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C5O,EACE,mBAAmB+N,gDAA2De,EAAoB7G,KAChG,UAGJjI,EACE,UAAU2O,iBAAqBM,WAAoBL,iBAAqBO,oBASxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,uCAAuCgP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,qCAAqCgP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,oCAAoCgP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPhP,EAAS,sCAAsCgP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAKP,KAAK,CAACH,EAAciB,IAC/DhP,EACE,8BAA8B+N,MAAiBiB,sBAAyBtL,EAAK+K,OAE/EI,GAAe,EACf,KACD,OACI,GAAmC,IAA/BC,EAAoBlP,QAGzBkP,EAAoBC,SAASJ,IAAUG,EAAoBC,SAASH,GAAQ,CAE9E,IAAII,EAEJ,MAAMC,EAAaH,EAAoBI,QAAQP,GACzCQ,EAAaL,EAAoBI,QAAQN,GAE/C5O,EACE,mBAAmB+N,gDAA2De,EAAoB7G,KAChG,UAGJjI,EACE,UAAU2O,iBAAqBM,WAAoBL,iBAAqBO,oBAYxD,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,uCAAuCgP,iBAAoBjB,MAEpD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,qCAAqCgP,iBAAoBjB,MAElD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GAErBH,EAAO,EACPhP,EAAS,oCAAoCgP,iBAAoBjB,OAEjD,IAAfkB,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,GACL,IAAfF,GAAmC,IAAfE,KAErBH,EAAO,EACPhP,EAAS,sCAAsCgP,iBAAoBjB,MAIrE7B,KAAKmB,WAAWe,iBAAiB1K,EAAK+K,KAAKP,KAAK,CAACH,EAAciB,IAC/DhP,EACE,8BAA8B+N,MAAiBiB,sBAAyBtL,EAAK+K,OAE/EI,GAAe,EACf,KACD,CAEJ,CAEIA,GACHxO,EACE,oDAAoDsO,SAAaC,iCAEpE,IAGN,KAIH1C,KAAKoB,2BAA4B,EAI/BpB,KAAKmB,WAAWe,iBAAiBxO,OAAS,QACFsE,IAAxCgI,KAAKmB,WAAWe,iBAAiB,IACjC,CACA,MAAMC,EAAwB,GAC9B,IAAK,IAAI1O,EAAI,EAAGA,EAAIuM,KAAKmB,WAAWe,iBAAiBxO,OAAQD,IACvDuM,KAAKmB,WAAWe,iBAAiBzO,IACnC0O,EAAsBH,KAAKhC,KAAKmB,WAAWe,iBAAiBzO,IAGhEuM,KAAKmB,WAAWe,iBAAmBC,CACpC,CAEJ,CACF,CAED,OAAOnC,KAAKmB,UACb,EAGI,MAAM+B,UAAepC,EAS1B,WAAAhI,EAAYiI,aAAEA,EAAe,KAAIC,KAAEA,EAAO,KAAIjB,aAAEA,EAAe,SAAQoB,WAAEA,EAAa,OACpFgC,MAAM,CACJpC,eACAC,OACAC,aAAc,EACdC,KAAM,EACNpB,cAAe,KACfC,eACAoB,eAGwB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MACrC7M,EAAS,wFAEZ,CAED,YAAAiP,GACE,IAAIC,EAAoB,GAExB,IAAIC,EAAaC,EAEjB,GAA0B,WAAtBvD,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCwC,GAAUvD,KAAKgB,KALF,GAKmBhB,KAAKe,aAErCsC,EAAkB,GAPL,EAQb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,CAE1E,MAAW,GAA0B,cAAtBvD,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCwC,GAAUvD,KAAKgB,KAbF,GAamBhB,KAAKe,aAErCsC,EAAkB,GAfL,EAgBb,IAAK,IAAIG,EAAY,EAAGA,EAAYF,EAAaE,IAC/CH,EAAkBG,GAAaH,EAAkBG,EAAY,GAAKD,EAAS,CAE9E,CAED,MAAMjC,EAAiBtB,KAAKyD,yBAAyBzD,KAAKe,aAAcuC,EAAatD,KAAKD,cAEpFmC,EAAmBlC,KAAK0D,uBAK9B,OAHA5P,EAAS,iCAAmC2N,KAAKC,UAAU2B,IAGpD,CACLA,oBACAC,cACAhC,iBACAY,mBAEH,CAUD,wBAAAuB,CAAyB1C,EAAcuC,EAAavD,GAKlD,IAAI4D,EAAM,GAEV,GAAqB,WAAjB5D,EAOF,IAAK,IAAI8B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,CAErD,MACI,GAAqB,cAAjBzD,EAA8B,CAOvC,IAAI6D,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAcc,IAAgB,CACtE8B,EAAI9B,GAAgB,GACpB,IAAK,IAAI2B,EAAY,EAAGA,GAAa,EAAGA,IACtCG,EAAI9B,GAAc2B,EAAY,GAAK3B,EAAe2B,EAAYI,EAEhEA,GAAiB,CAClB,CACF,CAED,OAAOD,CACR,CAUD,oBAAAD,GACE,MAAMxB,EAAmB,GAEzB,IAAK,IAAI2B,EAAY,EAAGA,EADP,EAC6BA,IAC5C3B,EAAiBF,KAAK,IAWxB,OAPAE,EAAiB,GAAGF,KAAK,CAAC,EAAG,IAG7BE,EAAiB,GAAGF,KAAK,CAAChC,KAAKe,aAAe,EAAG,IAEjDjN,EAAS,yCAA2C2N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,EAGI,MAAM4B,UAAehD,EAa1B,WAAAhI,EAAYiI,aACVA,EAAe,KAAIC,KACnBA,EAAO,KAAIC,aACXA,EAAe,KAAIC,KACnBA,EAAO,KAAInB,aACXA,EAAe,SAAQoB,WACvBA,EAAa,KAAI4C,UACjBA,EAAY,GAAEC,WACdA,EAAa,KAEbb,MAAM,CACJpC,eACAC,OACAC,eACAC,OACApB,cAAe,KACfC,eACAoB,eAGFnB,KAAK+D,UAAYA,EACjB/D,KAAKgE,WAAaA,EAIf7C,GACsB,OAAtBnB,KAAKe,cAAuC,OAAdf,KAAKgB,MAAuC,OAAtBhB,KAAKiB,cAAuC,OAAdjB,KAAKkB,MAExF/M,EACE,6GAGL,CAED,YAAAiP,GACE,IAAIC,EAAoB,GACpBY,EAAoB,GAGxB,IAAIX,EAAaY,EAAaX,EAAQY,EAEtC,GAA0B,WAAtBnE,KAAKD,aAA2B,CAClCuD,EAActD,KAAKe,aAAe,EAClCmD,EAAclE,KAAKiB,aAAe,EAClCsC,GAAUvD,KAAKgB,KAPF,GAOmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KAPF,GAOmBlB,KAAKiB,aAErCoC,EAAkB,GAVL,EAWbY,EAAkB,GAVL,EAWb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAKG,EAAaD,EAEtE,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAKgB,EAAad,EAC/DU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAASF,EAAaD,CAEnF,CACP,MAAW,GAA0B,cAAtBnE,KAAKD,aAA8B,CAC5CuD,EAAc,EAAItD,KAAKe,aAAe,EACtCmD,EAAc,EAAIlE,KAAKiB,aAAe,EACtCsC,GAAUvD,KAAKgB,KA5BF,GA4BmBhB,KAAKe,aACrCoD,GAAUnE,KAAKkB,KA5BF,GA4BmBlB,KAAKiB,aAErCoC,EAAkB,GA/BL,EAgCbY,EAAkB,GA/BL,EAgCb,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBe,GAAcf,EAAkB,GAClDY,EAAkBG,GAAcH,EAAkB,GAAMG,EAAaD,EAAU,EAEjF,IAAK,IAAIE,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MAAMC,EAAQD,EAAaH,EAC3Bb,EAAkBiB,GAASjB,EAAkB,GAAMgB,EAAad,EAAU,EAC1EU,EAAkBK,GAASL,EAAkB,GAC7C,IAAK,IAAIG,EAAa,EAAGA,EAAaF,EAAaE,IACjDf,EAAkBiB,EAAQF,GAAcf,EAAkBiB,GAC1DL,EAAkBK,EAAQF,GAAcH,EAAkBK,GAAUF,EAAaD,EAAU,CAE9F,CACF,CAQD,GAAuB,KAAnBnE,KAAK+D,WAAwC,KAApB/D,KAAKgE,WAAmB,CACnD,MAAMO,EAAW5Q,KAAK6Q,GAAK,IACrBC,EAAU9Q,KAAK+Q,IAAI1E,KAAK+D,UAAYQ,GACpCI,EAAWhR,KAAK+Q,IAAI1E,KAAKgE,WAAaO,GACtCK,EAAU,MAEhB,IAAK,IAAIR,EAAa,EAAGA,EAAaF,EAAaE,IAAc,CAC/D,MACMS,EAAIZ,EADWG,GAEfU,EAAQnR,KAAKqK,IAAIyG,GAAWG,EAAU,EAAIC,EAAIJ,EAC9CM,EAASpR,KAAKqK,IAAI2G,GAAYC,EAAU5E,KAAKgB,KAAOhB,KAAKgB,KAAO6D,EAAIF,EAE1E,IAAK,IAAIN,EAAa,EAAGA,EAAaf,EAAae,IAAc,CAC/D,MACMW,EAAoB,IAAhB1B,EAAoB,EAAIe,GAAcf,EAAc,GAC9DD,EAFcgB,EAAaH,EAAcE,GAEdU,GAASC,EAASD,GAASE,CACvD,CACF,CACF,CAGD,MAAM1D,EAAiBtB,KAAKiF,yBAC1BjF,KAAKe,aACLf,KAAKiB,aACLiD,EACAlE,KAAKD,cAIDmC,EAAmBlC,KAAK0D,uBAM9B,OAJA5P,EAAS,iCAAmC2N,KAAKC,UAAU2B,IAC3DvP,EAAS,iCAAmC2N,KAAKC,UAAUuC,IAGpD,CACLZ,oBACAY,oBACAX,cACAY,cACA5C,iBACAY,mBAEH,CAYD,wBAAA+C,CAAyBlE,EAAcE,EAAciD,EAAanE,GAChE,IAAI8B,EAAe,EACf8B,EAAM,GAEV,GAAqB,WAAjB5D,EAA2B,CAS7B,IAAImF,EAAa,EACbtB,EAAgB,EACpB,IAAK,IAAI/B,EAAe,EAAGA,EAAed,EAAeE,EAAcY,IACrEqD,GAAc,EACdvB,EAAI9B,GAAgB,GACpB8B,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB,EACtDD,EAAI9B,GAAc,GAAKA,EAAe+B,EACtCD,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EACtD0C,EAAI9B,GAAc,GAAKA,EAAe+B,EAAgB3C,EAAe,EACjEiE,IAAejE,IACjB2C,GAAiB,EACjBsB,EAAa,EAGvB,MAAW,GAAqB,cAAjBnF,EAWT,IAAK,IAAIoF,EAAgB,EAAGA,GAAiBpE,EAAcoE,IACzD,IAAK,IAAIC,EAAgB,EAAGA,GAAiBnE,EAAcmE,IAAiB,CAC1EzB,EAAI9B,GAAgB,GACpB,IAAK,IAAIwD,EAAa,EAAGA,GAAc,EAAGA,IAAc,CACtD,IAAIC,EAAa,EAAID,EAAa,EAClC1B,EAAI9B,GAAcyD,EAAa,GAC7BpB,GAAe,EAAIiB,EAAgBE,EAAa,GAAK,EAAID,EAAgB,EAC3EzB,EAAI9B,GAAcyD,GAAc3B,EAAI9B,GAAcyD,EAAa,GAAK,EACpE3B,EAAI9B,GAAcyD,EAAa,GAAK3B,EAAI9B,GAAcyD,EAAa,GAAK,CACzE,CACDzD,GAA8B,CAC/B,CAIL,OAAO8B,CACR,CAYD,oBAAAD,GACE,MAAMxB,EAAmB,GAGzB,IAAK,IAAI2B,EAAY,EAAGA,EAFP,EAE6BA,IAC5C3B,EAAiBF,KAAK,IAMxB,IAAK,IAAImD,EAAgB,EAAGA,EAAgBnF,KAAKe,aAAcoE,IAC7D,IAAK,IAAIC,EAAgB,EAAGA,EAAgBpF,KAAKiB,aAAcmE,IAAiB,CAC9E,MAAMvD,EAAesD,EAAgBnF,KAAKiB,aAAemE,EAGnC,IAAlBA,GACFlD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAIpB,IAAlBsD,GACFjD,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCuD,IAAkBpF,KAAKiB,aAAe,GACxCiB,EAAiB,GAAGF,KAAK,CAACH,EAAc,IAItCsD,IAAkBnF,KAAKe,aAAe,GACxCmB,EAAiB,GAAGF,KAAK,CAACH,EAAc,GAE3C,CAKH,OAFA/N,EAAS,yCAA2C2N,KAAKC,UAAUQ,IACnElC,KAAKoB,2BAA4B,EAC1Bc,CACR,ECpvBI,MAAMqD,EAMX,WAAAzM,EAAYgH,cAAEA,EAAaC,aAAEA,IAC3BC,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAQD,wBAAAyF,GACE,IAAIC,EAAc,GACdC,EAAe,GAgBnB,MAd0B,WAAtB1F,KAAKD,cAEP0F,EAAY,GAAK,GACjBC,EAAa,GAAK,GACa,cAAtB1F,KAAKD,eAEd0F,EAAY,IAAM,EAAI9R,KAAKC,KAAK,KAAU,EAC1C6R,EAAY,GAAK,GACjBA,EAAY,IAAM,EAAI9R,KAAKC,KAAK,KAAU,EAC1C8R,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,GACtBA,EAAa,GAAK,EAAI,IAGjB,CAAED,cAAaC,eACvB,EC5BI,SAASC,EAAYC,GAC1B,MAAM9F,cACJA,EAAaiB,aACbA,EAAYE,aACZA,EAAYD,KACZA,EAAIE,KACJA,EAAInB,aACJA,EAAYoB,WACZA,EAAU4C,UACVA,EAASC,WACTA,GACE4B,EAGJ,IAAIC,EACkB,OAAlB/F,EACF+F,EAAO,IAAI3C,EAAO,CAAEnC,eAAcC,OAAMjB,eAAcoB,eAC3B,OAAlBrB,EACT+F,EAAO,IAAI/B,EAAO,CAChB/C,eACAC,OACAC,eACAC,OACAnB,eACAoB,aACA4C,YACAC,eAGF7P,EAAS,8CAIX,MAAM2R,EAA+BD,EAAKzE,0BAA4ByE,EAAK1E,WAAa0E,EAAKzC,eAG7F,IAAIC,EAAoByC,EAA6BzC,kBACjDY,EAAoB6B,EAA6B7B,kBACjDX,EAAcwC,EAA6BxC,YAC3CY,EAAc4B,EAA6B5B,YAC3CP,EAAMmC,EAA6BxE,eACnCY,EAAmB4D,EAA6B5D,iBAMpD,IAAI6D,EAAeC,EAanB,OAhBqB7E,SAMnB4E,EAAgBpC,EAAIjQ,OACpBsS,EAAa3C,EAAkB3P,OAC/BI,EAAS,0BAA0BiS,kBAA8BC,aAGjED,EAAgBhF,GAAkC,OAAlBjB,EAAyBmB,EAAe,GACxE+E,EAAa1C,GAAiC,OAAlBxD,EAAyBoE,EAAc,GACnEpQ,EAAS,2CAA2CiS,kBAA8BC,YAG7E,CACL3C,oBACAY,oBACAX,cACAY,cACAP,MACAzB,mBACA6D,gBACAC,aACAlG,gBACAC,eAEJ,CAOO,SAASkG,EAAcC,GAC5B,MAAMF,WAAEA,EAAUrC,IAAEA,EAAG7D,cAAEA,EAAaC,aAAEA,GAAiBmG,EAGzD,IAAI/J,EAAiB,GACjBD,EAAiB,GAIrB,IAAK,IAAIsH,EAAY,EAAGA,EAAYwC,EAAYxC,IAAa,CAC3DrH,EAAeqH,GAAa,EAC5BtH,EAAe8F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAWH,EAAYG,IAC5CjK,EAAesH,GAAW2C,GAAY,CAEzC,CAGD,MAAMC,EAAiB,IAAIvG,EAAe,CACxCC,gBACAC,iBAUF,IAAIsG,EANyB,IAAId,EAAqB,CACpDzF,gBACAC,iBAI+CyF,2BAOjD,MAAO,CACLrJ,iBACAD,iBACAoK,iBAlCqB,GAmCrBF,iBACAX,YAXgBY,EAAsBZ,YAYtCC,aAXiBW,EAAsBX,aAYvCa,gBATsB5C,EAAI,GAAGjQ,OAWjC,CAOO,SAAS8S,EAA8BC,GAC5C,MAAMrG,cAAEA,EAAaC,sBAAEA,EAAqBgD,kBAAEA,EAAiBiD,iBAAEA,EAAgBC,gBAAEA,GACjFE,EAEF,IAAIC,EAAe,EACfC,EAAY,EAGhB,IAAK,IAAIC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GAE3F,IAAIC,EAAcF,EAGdG,EAAsB,GAC1B,IAAK,IAAIF,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DE,EAAoBF,GAAkBvG,EAAsBuG,GAAkBC,EAGhF,MAAO,CACLH,eACAG,cACAC,sBAEJ,CAOO,SAASC,EAA8BN,GAC5C,MAAMrG,cACJA,EAAaC,sBACbA,EAAqBC,sBACrBA,EAAqB+C,kBACrBA,EAAiBY,kBACjBA,EAAiBqC,iBACjBA,EAAgBC,gBAChBA,GACEE,EAEJ,IAAIC,EAAe,EACfM,EAAe,EACfL,EAAY,EACZM,EAAY,EACZC,EAAY,EACZC,EAAY,EAGhB,IAAK,IAAIP,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DF,GAAgBrD,EAAkBiD,EAAiBM,IAAmBxG,EAAcwG,GACpFI,GAAgB/C,EAAkBqC,EAAiBM,IAAmBxG,EAAcwG,GACpFD,GAAatD,EAAkBiD,EAAiBM,IAAmBvG,EAAsBuG,GACzFK,GAAa5D,EAAkBiD,EAAiBM,IAAmBtG,EAAsBsG,GACzFM,GAAajD,EAAkBqC,EAAiBM,IAAmBvG,EAAsBuG,GACzFO,GAAalD,EAAkBqC,EAAiBM,IAAmBtG,EAAsBsG,GAE3F,IAAIC,EAAcF,EAAYQ,EAAYF,EAAYC,EAGlDJ,EAAsB,GACtBM,EAAsB,GAC1B,IAAK,IAAIR,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DE,EAAoBF,IACjBO,EAAY9G,EAAsBuG,GACjCM,EAAY5G,EAAsBsG,IACpCC,EAEFO,EAAoBR,IACjBD,EAAYrG,EAAsBsG,GACjCK,EAAY5G,EAAsBuG,IACpCC,EAGJ,MAAO,CACLH,eACAM,eACAH,cACAC,sBACAM,sBAEJ,CAUO,SAASC,EAAoB5J,EAAGoH,EAAGyC,GACxC,MACOC,EAAIC,EAAIC,GAAMH,EAEfI,GAASF,EAAG,GAAKC,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAOD,EAAG,GAAKE,EAAG,IAE1EvH,IAAQsH,EAAG,GAAKC,EAAG,KAAOhK,EAAIgK,EAAG,KAAOA,EAAG,GAAKD,EAAG,KAAO3C,EAAI4C,EAAG,KAAOC,EACxEvH,IAAQsH,EAAG,GAAKF,EAAG,KAAO9J,EAAIgK,EAAG,KAAOF,EAAG,GAAKE,EAAG,KAAO5C,EAAI4C,EAAG,KAAOC,EAI9E,MAAO,CAAEC,OADMzH,IAAO,OAAcC,IAAO,OAF7B,EAAID,EAAMC,IAE0C,MACjDD,MAAKC,MACxB,CASO,SAASyH,EAAyBnK,EAAGoH,EAAGyC,GAC7C,MAAOO,EAAuBC,GAwCzB,SAA4BR,GACjC,MAAOC,EAAIC,EAAIC,EAAIM,GAAMT,EAKzB,MAAO,CACL,CAACC,EAAIC,EAAIO,GACT,CAACR,EAAIE,EAAIM,GAEb,CAlD0DC,CAAmBV,GACrEW,EAA2BZ,EAAoB5J,EAAGoH,EAAGgD,GACrDK,EAA4Bb,EAAoB5J,EAAGoH,EAAGiD,GAEtDH,EAASM,EAAyBN,QAAUO,EAA0BP,OAC5E,IAAIzH,EAAM,EACNC,EAAM,EAEV,GAAIwH,EAAQ,CACV,MAAOJ,EAAIC,EAAIC,EAAIM,GAAMT,EAGnBa,EAAsB,CAACC,EAAIC,IACnB1U,KAAKqK,KAAKqK,EAAG,GAAKD,EAAG,KAAOA,EAAG,GAAKvD,IAAMuD,EAAG,GAAK3K,IAAM4K,EAAG,GAAKD,EAAG,KACnEzU,KAAKC,MAAMyU,EAAG,GAAKD,EAAG,KAAO,GAAKC,EAAG,GAAKD,EAAG,KAAO,GAS5DE,EAAWH,EAAoBZ,EAAIC,GACnCe,EAAYJ,EAAoBV,EAAIM,GACpCS,EAAaL,EAAoBZ,EAAIE,GAG3CvH,EAAMoI,GAAYA,EAAWC,GAC7BpI,EAAMqI,GAAcA,EAHJL,EAAoBX,EAAIO,GAIzC,CAED,MAAO,CAAEJ,SAAQzH,MAAKC,MACxB,CA0BO,SAASsI,EAAqBvC,GACnC,MAAMvC,IAAEA,EAAGN,kBAAEA,GAAsB6C,EAC7BF,EAAa3C,EAAkB3P,OAC/B6S,EAAkB5C,EAAI,GAAGjQ,OAGzBgV,EAAgBtN,MAAMuN,KAAK,CAAEjV,OAAQsS,IAAc,IAAM,KACzD4C,EAAgBxN,MAAM4K,GAAYtK,KAAK,GAG7C,IAAK,IAAImN,EAAY,EAAGA,EAAYlF,EAAIjQ,OAAQmV,IAC9C,IAAK,IAAIjC,EAAiB,EAAGA,EAAiBL,EAAiBK,IAAkB,CAC/E,MAAMpD,EAAYG,EAAIkF,GAAWjC,GAAkB,EAGnDgC,EAAcpF,GAAaoF,EAAcpF,GAAa,EAGtDkF,EAAclF,GAAWxB,KAAK6G,EAC/B,CAGH,MAAO,CAAEH,gBAAeE,gBAC1B,CAOO,SAASE,EAAoB5C,GAClC,IAGI6C,EAHAC,EAAuB,GACvBC,EAAwB,GACxBC,EAA6B,EAEjC,MAAM7F,kBAAEA,EAAiBY,kBAAEA,EAAiBN,IAAEA,EAAGzB,iBAAEA,EAAgBpC,cAAEA,EAAaC,aAAEA,GAClFmG,EAEoB,OAAlBpG,GACmB,WAAjBC,GAKwB,cAAjBA,KAJTgJ,EAAgB,CACd,EAAG,CAAC,GACJ,EAAG,CAAC,KAQmB,OAAlBjJ,IACY,WAAjBC,EACFgJ,EAAgB,CACd,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,IAEiB,cAAjBhJ,IACTgJ,EAAgB,CACd,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,MAMhB,IAAK,IAAII,EAAgB,EAAGA,EAAgBjH,EAAiBxO,OAAQyV,IAEnE,IACE,IAAIC,EAA4B,EAChCA,EAA4BlH,EAAiBiH,GAAezV,OAC5D0V,IACA,CACAJ,EAAqBE,GACnBhH,EAAiBiH,GAAeC,GAClCF,IAEA,MAAOrH,EAAciB,GAAQZ,EAAiBiH,GAAeC,GAC7D,IAAIC,EAA2BN,EAAcjG,GACzCwG,EAAuB,GACvBC,EAAuB,GAE3B,IACE,IAAIC,EAAyB,EAC7BA,EAAyBH,EAAyB3V,OAClD8V,IACA,CACA,MAAMC,EAAkB9F,EAAI9B,GAAcwH,EAAyBG,IAA2B,EAE9FF,EAAqBtH,KAAKqB,EAAkBoG,IAC5CF,EAAqBvH,KAAKiC,EAAkBwF,GAC7C,CAGD,IAAK,IAAIC,EAAI,EAAGA,EAAIJ,EAAqB5V,OAAS,EAAGgW,IACnDT,EAAsBjH,KAAK,CACzB,CAACsH,EAAqBI,GAAIH,EAAqBG,IAC/C,CAACJ,EAAqBI,EAAI,GAAIH,EAAqBG,EAAI,KAG5D,CAEH,OAAOT,CACT,CClaO,MAAMU,EASX,WAAA7Q,CAAY8Q,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,oCAAA8J,CAAqC1N,EAAgBD,GACxB,OAAvB8D,KAAKF,cACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDjW,EACE,YAAYiW,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACd/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDjW,EACE,YAAYiW,uCAAiDC,6BAE/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBO,EAElC,IAAK,IAAI7D,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,yCAAAQ,CAA0CC,EAAoBC,GACjC,OAAvBnK,KAAKF,cACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDjW,EACE,YAAYiW,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAGQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,KAE6B,OAAvBhK,KAAKF,eACd/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,iBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAuB,CAC9D,MAAMC,EAAYhK,KAAK4J,mBAAmBG,GAAa,GACvDjW,EACE,YAAYiW,uCAAiDC,6BAG/DhK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAGK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE3D,MAAmB,GAA0B,cAAtBhK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAGE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,4CAA4C2V,EAAkB,cAC5D5H,EAAe,iBACD2B,EAAY,MAI9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBO,CAAS,GAE9C,IAEJ,IAGN,CAYD,kCAAAI,CACEjO,EACAD,EACAuJ,EACAC,EACArC,EACAY,EACAmC,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxBvU,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAGwB,OAAvBxK,KAAKF,cACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCjW,EACE,YAAYiW,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,IAAIU,EACsB,WAAtBxD,KAAKD,aAGLyD,EAFW,IAATV,EAEU,EAGA,EAEiB,cAAtB9C,KAAKD,eAGZyD,EAFW,IAATV,EAEU,EAGA,GAIhB,MAAM2G,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,qDAAqD2V,EAAkB,cACrE5H,EAAe,iBACD2B,EAAY,MAE9BrH,EAAesN,KAAqBgB,EAAkBC,EACtDxO,EAAeuN,GAAiBA,IAAoBgB,CAAe,GAEtE,KAE6B,OAAvBzK,KAAKF,eACd/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,eAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAqB,CAC5D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCjW,EACE,YAAYiW,2DAAqEU,0CAAwDC,OAE3I1K,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAGlB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D9S,EACE,qDAAqD2V,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInCzK,EAAesN,KACZ/D,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjEhP,EAAeuN,GAAiB0B,KAC7BzF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aACd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAChD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAGhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACA,IAAItB,EAAkBzJ,KAAK2D,IAAI9B,GAAc+E,GAAkB,EAC/D9S,EACE,qDAAqD2V,EAAkB,cACrE5H,EAAe,iBACD+E,EAAiB,MAInCzK,EAAesN,KACZ/D,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EACnB,CACA,IAAII,EAAmBnL,KAAK2D,IAAI9B,GAAcqJ,GAAmB,EACjEhP,EAAeuN,GAAiB0B,KAC7BzF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CACH,CACF,CACF,CACF,GAEJ,IAGN,CAcD,uCAAAY,CACExJ,EACAwB,EACAY,EACAwB,EACAC,EACAU,GAGA,IAAIiE,EAA2B,GAC3BC,EAAoB,GACxBvU,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAASkI,IAC5C,MAAMC,EAAoBxK,KAAK4J,mBAAmBW,GACrB,eAAzBC,EAAkB,KACpBH,EAAyBE,GAAOC,EAAkB,GAClDF,EAAkBC,GAAOC,EAAkB,GAC5C,IAIH,MAAMjE,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OACzC4X,EAAsBlQ,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC6P,EAAsBnQ,MAAMmL,GAAiB7K,KAAK,GAGxD,IAAK,MAAMqO,KAAe/J,KAAKkC,iBAC7B,GAAkD,eAA9ClC,KAAK4J,mBAAmBG,KAAe,GAAqB,CAC9D,MAAMU,EAAkBJ,EAAyBN,GAC3CW,EAAUJ,EAAkBP,GAClCjW,EACE,YAAYiW,2DAAqEU,0CAAwDC,OAI3I,MAAMc,EAAkBxL,KAAKkC,iBAAiB6H,GAAa0B,MACzD,EAAEC,EAAsBC,KAAOD,IAAyB7J,IAG1D,GAAI2J,EAAiB,CACnB,MAAM1I,EAAO0I,EAAgB,GAE7B,GAA2B,OAAvBxL,KAAKF,cAAwB,CAE/B,IAAI0D,EACsB,WAAtBxD,KAAKD,aACPyD,EAAqB,IAATV,EAAa,EAAI,EACE,cAAtB9C,KAAKD,eACdyD,EAAqB,IAATV,EAAa,EAAI,GAI/BhP,EACE,qDAAqD0P,EAAY,cAC/D3B,EAAe,iBACD2B,EAAY,MAE9B+H,EAAoB/H,KAAeiH,EAAkBC,EACrDY,EAAoB9H,GAAWA,IAAciH,CACzD,MAAiB,GAA2B,OAAvBzK,KAAKF,cAEd,GAA0B,WAAtBE,KAAKD,aAA2B,CAClC,IAAI4K,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY,GAC1BmF,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY,GAC1BoF,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAIlB,MAAMC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAG3D,IAiBI2K,EAjBAtE,EAAY,EACdO,EAAY,EACZD,EAAY,EACZE,EAAY,EACd,IAAK,IAAI3D,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAE/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IACtD,IAATV,GAAuB,IAATA,IACvBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAKCyH,EADW,IAATnI,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa,GACduF,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa,GACduF,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACf,MAAmB,GAA0B,cAAtBzK,KAAKD,aAEd,IAAK,IAAIqL,EAAkB,EAAGA,EAAkB,EAAGA,IAAmB,CACpE,IAAIT,EAAaC,EAAaC,EAAgBC,EAAeC,EAEhD,IAATjI,GAEF6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,GAET6H,EAAclF,EAAY2F,GAC1BR,EAAc,EACdC,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GACE,IAATjI,IAET6H,EAAc,EACdC,EAAcnF,EAAY2F,GAC1BP,EAAiB,EACjBC,EAAgB,EAChBC,EAAgB,GAElB,IAAIC,EAA+B5E,EAAenG,kBAAkB0K,EAAaC,GAC7ExK,EAAgB4K,EAA6B5K,cAC7CC,EAAwB2K,EAA6B3K,sBACrDC,EAAwB0K,EAA6B1K,sBAErDqG,EAAY,EACZO,EAAY,EACZD,EAAY,EACZE,EAAY,EAChB,MAAMZ,EAAkBvG,KAAK2D,IAAI9B,GAAcnO,OAC/C,IAAK,IAAI8P,EAAY,EAAGA,EAAY+C,EAAiB/C,IAAa,CAChE,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAG/C,IAATV,GAAuB,IAATA,GAChB6D,GAAatD,EAAkBoG,GAAmBpJ,EAAsBmD,GACxE0D,GAAajD,EAAkBwF,GAAmBpJ,EAAsBmD,IAGxD,IAATV,GAAuB,IAATA,IACrBmE,GAAa5D,EAAkBoG,GAAmBnJ,EAAsBkD,GACxE2D,GAAalD,EAAkBwF,GAAmBnJ,EAAsBkD,GAE3E,CAGD,IAAIyH,EAEFA,EADW,IAATnI,GAAuB,IAATA,EACMnP,KAAKC,KAAK+S,GAAa,EAAIO,GAAa,GAExCvT,KAAKC,KAAKqT,GAAa,EAAIE,GAAa,GAIhE,IACE,IAAIP,EAAiBiE,EACrBjE,EAAiBkE,EACjBlE,GAAkBmE,EAClB,CACAQ,EAAoB3E,KACjBlB,EAAa0F,GACdH,EACA7K,EAAcwG,GACd6D,EACAC,EAEF,IACE,IAAIQ,EAAkBL,EACtBK,EAAkBJ,EAClBI,GAAmBH,EAEnBO,EAAoB1E,GAAgBsE,KACjCxF,EAAa0F,GACdH,EACA7K,EAAcwG,GACdxG,EAAc8K,GACdT,CAEL,CACF,CAGN,CACF,CAGH,MAAO,CAAEa,sBAAqBC,sBAC/B,ECnxBI,SAASK,EAA0B1F,EAAU0D,GAClD1V,EAAS,mDAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B,MAAMkL,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAG5EC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EAG7C,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzChP,EAAe+P,GAAmBC,KAC/BxG,EAAaoG,GACdjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC/D,CACF,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY/R,OAAQyY,IAAoB,CAExF,MAAMnB,EAA+B5E,EAAenG,kBAClDwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAGlE,IAAK,IAAIC,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GACzChP,EAAe+P,GAAmBC,KAC/BxG,EAAaoG,GACdpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAChE,CACF,CACF,CAGN,CAGD,MAAMkB,EAA4B,IAAIzC,EACpCC,EACA1H,EACAyB,EACA7D,EACAC,GAkBF,OAdAqM,EAA0BhC,mCACxBjO,EACAD,EACAuJ,EACAC,EACArC,EACAY,EACAmC,GAIFgG,EAA0BvC,qCAAqC1N,EAAgBD,GAC/EhI,EAAS,iDAEF,CACLgI,iBACAC,iBAEJ,CAcO,SAASkQ,GAA4BxK,aAAEA,EAAY8B,IAAEA,EAAGuC,SAAEA,EAAQE,eAAEA,EAAcyF,QAAEA,IAEzF,MAAMpG,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAG1DoF,EAAsBlQ,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC6P,EAAsBnQ,MAAMmL,GAAiB7K,KAAK,GAGlD4Q,EAAMlR,MAAMmL,GACZD,EAAmBlL,MAAMmL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkBjT,KAAKqK,IAAI2F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBjT,KAAKqK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,GAAsB,OAAlB9G,EAEF,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IAAoB,CAExF,MAAM1L,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAYqG,KAIRjF,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbjF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAGnE,MACI,GAAsB,OAAlBpL,EAET,IAAK,IAAIgM,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAY/R,OAAQyY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,IAGxE7F,EAAmBgG,EAAIpV,KAAKqV,GAAgBA,EAAc,KAG1D1F,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAK,IAAIyF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAC/D,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAC/DI,EAAoBU,GAAiBd,IACnCxF,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,GAGpE,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CChQO,MAAME,EASX,WAAA1T,CAAY8Q,EAAoB1H,EAAkByB,EAAK7D,EAAeC,GACpEC,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,CACrB,CAeD,iCAAA0M,CAAkCtQ,EAAgBD,GACrB,OAAvB8D,KAAKF,cACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMtU,EAAQuK,KAAK4J,mBAAmBG,GAAa,GACnDjW,EAAS,YAAYiW,iCAA2CtU,2BAChEuK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBhU,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBhU,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,KAE6B,OAAvBzJ,KAAKF,eACd/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMtU,EAAQuK,KAAK4J,mBAAmBG,GAAa,GACnDjW,EAAS,YAAYiW,iCAA2CtU,2BAChEuK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBhU,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEpE,MAAmB,GAA0B,cAAtBzJ,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAesN,GAAmBhU,EAElC,IAAK,IAAI0Q,EAAW,EAAGA,EAAWhK,EAAezI,OAAQyS,IACvDjK,EAAeuN,GAAiBtD,GAAY,EAG9CjK,EAAeuN,GAAiBA,GAAmB,CAAC,GAEvD,IAEJ,IAGN,CAOD,0CAAAiD,CAA2CxC,EAAoBC,GAClC,OAAvBnK,KAAKF,cACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMtU,EAAQuK,KAAK4J,mBAAmBG,GAAa,GACnDjW,EAAS,YAAYiW,iCAA2CtU,2BAChEuK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBhU,CAAK,GAEvD,MAAmB,GAA0B,cAAtBuK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,GACJ,EAAG,CAAC,KAEQ+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBhU,CAAK,GAE1C,IAEJ,KAE6B,OAAvBuK,KAAKF,eACd/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,GAAgD,kBAA5C/J,KAAK4J,mBAAmBG,GAAa,GAAwB,CAC/D,MAAMtU,EAAQuK,KAAK4J,mBAAmBG,GAAa,GACnDjW,EAAS,YAAYiW,iCAA2CtU,2BAChEuK,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,WAAtB9C,KAAKD,aAA2B,EACZ,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBhU,CAAK,GAEvD,MAAmB,GAA0B,cAAtBuK,KAAKD,aAA8B,EACtB,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EAC5D1P,EACE,sCAAsC2V,EAAkB,cACtD5H,EAAe,iBACD2B,EAAY,MAE9B0G,EAAmBT,GAAmB,EACtCU,EAAeV,GAAmBhU,CAAK,GAE1C,IAEJ,IAGN,ECzNI,SAASkX,EACdzG,EACA0D,EACArN,EACAqQ,GAEA1Y,EAAS,iDAGT,IAAI2Y,EAAqB,EAAID,EArBA,IAsB7B9Y,EAAS,uBAAuB+Y,KAChC/Y,EAAS,0BAA0B8Y,KAGnC,MAAMvJ,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,EAGE2F,EAAU5F,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAGJ,IAAK,IAAIhK,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAIzE,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B3L,SAAS,6CAGT,IAAI6W,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEvQ,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CACF,MAEI,GAAsB,OAAlBpL,EACP,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY/R,OAAQyY,IAAoB,CAExF,IAAInB,EAA+B5E,EAAenG,kBAChDwF,EAAYqG,GACZrG,EAAY0G,IAId,MAAMJ,EAAgBhF,EAA8B,CAClD3G,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDC,sBAAuB0K,EAA6B1K,sBACpD+C,oBACAY,oBACAqC,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAC5D3L,EAAgB4K,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEvQ,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACExQ,EAAe+J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,IAAIC,EAAoB3F,EAAiB0F,GAGzC7P,EAAe8P,IACbY,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFzQ,EAAe8P,IACbW,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACdrY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,IAAIgB,EAAoB5F,EAAiB4E,GAGzChP,EAAe+P,GAAmBC,KAC/BW,EACDnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACF1Q,EAAe+P,GAAmBC,IAChCU,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbxY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbxY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAE3B,CACF,CACF,CAGN,CAeD,OAZkC,IAAIsB,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkCtQ,EAAgBD,GAC5EhI,EAAS,+CAEF,CACLgI,iBACAC,iBAEJ,CAgBO,SAAS6Q,GAA8BnL,aAC5CA,EAAY8B,IACZA,EAAGuC,SACHA,EAAQE,eACRA,EAAcyF,QACdA,EAAOtP,eACPA,EAAcqQ,sBACdA,IAGA,MAAMnH,YAAEA,EAAWC,aAAEA,EAAYa,gBAAEA,GAAoBsF,GACjDxI,kBAAEA,EAAiBY,kBAAEA,EAAiBnE,cAAEA,GAAkBoG,EAGhE,IAAI2G,EAAqB,EAAID,EA/PA,IAkQ7B,MAAMtB,EAAsBlQ,MAAMmL,GAC/B7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACnC6P,EAAsBnQ,MAAMmL,GAAiB7K,KAAK,GAGlD4Q,EAAMlR,MAAMmL,GACZD,EAAmBlL,MAAMmL,GAC/B,IAAK,IAAIK,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7D0F,EAAI1F,GAAkBjT,KAAKqK,IAAI2F,EAAI9B,GAAc+E,IACjDN,EAAiBM,GAAkBjT,KAAKqK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIkF,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IAEpE,GAAsB,OAAlBhM,EAAwB,CAE1B3L,SAAS,6CAGT,IAAI6W,EAA+B5E,EAAenG,kBAAkBwF,EAAYqG,IAGhF,MAAMC,EAAgBvF,EAA8B,CAClDpG,cAAe4K,EAA6B5K,cAC5CC,sBAAuB2K,EAA6B3K,sBACpDgD,oBACAiD,mBACAC,qBAIIM,YAAEA,EAAWC,oBAAEA,GAAwBiF,EACvBf,EAA6B5K,cAGnD,IAAI0M,EAAiB,EACrB,IAAK,IAAIlG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEvQ,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAIzC,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IACvC5E,EAAiB4E,EAI5C,CAEP,MAAW,GAAsB,OAAlBpL,EACT,IAAK,IAAIqM,EAAmB,EAAGA,EAAmB1G,EAAY/R,OAAQyY,IAAoB,CAExF,MAAM/L,cAAEA,EAAaC,sBAAEA,EAAqBC,sBAAEA,GAC5C8F,EAAenG,kBAAkBwF,EAAYqG,GAAmBrG,EAAY0G,KAGxEtF,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwBL,EAA8B,CAC9F3G,gBACAC,wBACAC,wBACA+C,oBACAY,oBACAqC,mBACAC,oBAIF,IAAIuG,EAAiB,EACjBC,EAAiB,EACrB,IAAK,IAAInG,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DkG,GACEvQ,EAAe+J,EAAiBM,IAAmBE,EAAoBF,GACzEmG,GACExQ,EAAe+J,EAAiBM,IAAmBQ,EAAoBR,GAI3E,IAAK,IAAIoF,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAC1D1F,EAAiB0F,GAEzCT,EAAoBS,IAClBa,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAC,EAAoBkF,GACpBc,EACFD,EACEnH,EAAaoG,GACbpG,EAAayG,GACbtF,EACAO,EAAoB4E,GACpBe,EAG0B,IAA1BH,IACFrB,EAAoBS,IAClBY,GACClH,EAAaoG,GACZpG,EAAayG,GACbtF,EACAzG,EAAc4L,GACdrY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,GAClDrH,EAAaoG,GACXpG,EAAayG,GACbtF,EACAzG,EAAc4L,KAGtB,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAE/DI,EAAoBU,GAAiBd,IACnC2B,EACAnH,EAAaoG,GACbpG,EAAayG,GACbtF,GACCC,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAGjC,IAA1B0B,IACFtB,EAAoBU,GAAiBd,IACnC0B,IAEI/F,EACAiG,EACA1M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GAEbxY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,EAAI,OACxDjG,EAAoBoE,GACtB0B,GACI/F,EACAkG,EACA3M,EAAc4L,GACdtG,EAAaoG,GACbpG,EAAayG,GACbxY,KAAKC,KAAKkZ,GAAkB,EAAIC,GAAkB,EAAI,OACxD3F,EAAoB8D,GAG7B,CACF,CAIL,MAAO,CAAEI,sBAAqBC,sBAAqBe,MACrD,CC7ZA,MAAMW,EAAc,CAAA,EACdC,EAAe,CAAA,EACfC,EAAc,CAAEC,oBAAqB,GACrCC,EAAe,CAAA,EACrB,IAAIjH,EAUG,SAASkH,EAAiBC,EAAerH,EAAU0D,EAAoBxN,EAAU,CAAA,GAEtF,MAAMyP,EAAU5F,EAAcC,GACxBF,EAAaE,EAAS7C,kBAAkB3P,OACxC8Z,EAActH,EAASH,eA6H/B,SAAiCQ,EAAiBiH,GAEhDP,EAAY3L,eAAiBlG,MAAMoS,GAChC9R,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACzCuR,EAAY/C,mBAAqB9O,MAAMmL,GAAiB7K,KAAK,GAC7DuR,EAAY9C,eAAiB/O,MAAMmL,GAAiB7K,KAAK,GACzDuR,EAAYQ,qBAAuBrS,MAAMmL,GAAiB7K,KAAK,GAC/DuR,EAAY1Q,eAAiBnB,MAAMmL,GAAiB7K,KAAK,GACzDuR,EAAYS,aAAetS,MAAMoS,GAAa9R,KAAK,GACnDuR,EAAYU,YAAcvS,MAAMoS,GAAa9R,KAAK,GAGlDwR,EAAaU,UAAY,EACzBV,EAAalH,WAAaO,EAC1B2G,EAAaW,mBAAqB,EAClCX,EAAa3G,gBAAkBnL,MAAMoS,GAAa9R,KAAK,GACvDwR,EAAaY,YAAc,EAG3B,MAAMC,EAAapa,KAAKoK,IAAIwI,EAAiB,KAC7C2G,EAAac,qBAAuB5S,MAAM2S,GAAYrS,KAAK,GAC3DwR,EAAae,eAAiB,EAG9Bd,EAAY7B,oBAAsBlQ,MAAMmL,GACrC7K,OACAxE,KAAI,IAAMkE,MAAMmL,GAAiB7K,KAAK,KACzCyR,EAAYC,oBAAsB,EAGlC,MAAMc,EAaR,SAA2B3H,EAAiBiH,GAC1C,MAAMW,EAAqBxa,KAAKoK,IAC9BpK,KAAKya,KAAKza,KAAKC,KAAK4Z,IAAgBjH,EAClB,EAAlBA,GAEF,OAAO4H,EAAqBX,CAC9B,CAnBoBa,CAAkB9H,EAAiBiH,GACrDH,EAAaiB,YAAclT,MAAM8S,GAAWxS,KAAK,GACjD2R,EAAakB,cAAgBnT,MAAM2S,GAAYrS,KAAK,GACpD2R,EAAamB,SAAWpT,MAAM2S,GAAYrS,KAAK,GAC/C2R,EAAaoB,UAAYrT,MAAM8S,GAAWxS,KAAK,EACjD,CA7JEgT,CAHwB7C,EAAQtF,gBAGSiH,GAGzCtZ,EAAS,mCACTF,QAAQ0I,KAAK,iBAGb0J,EAAiB,IAAIvG,EAAe,CAClCC,cAAeoG,EAASpG,cACxBC,aAAcmG,EAASnG,eAIzB,IAAK,IAAI8B,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChE,IAAK,IAAI2B,EAAY,EAAGA,EAAYqI,EAAQtF,gBAAiB/C,IAC3DyJ,EAAY3L,eAAeO,GAAc2B,GAAa0C,EAASvC,IAAI9B,GAAc2B,GAMrF,IAAK,IAAIA,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEyJ,EAAY/C,mBAAmB1G,GAAa,EAC5CyJ,EAAY9C,eAAe3G,GAAa,EAI1C,IAAImL,EAEApB,IAAkBlB,GACpBsC,EAAqC,IAAIhF,EACvCC,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmC1E,0CACjCgD,EAAY/C,mBACZ+C,EAAY9C,iBAGLoD,IAAkBP,IAC3B2B,EAAqC,IAAInC,EACvC5C,EACA1D,EAAShE,iBACTgE,EAASvC,IACTuC,EAASpG,cACToG,EAASnG,cAGX4O,EAAmCjC,2CACjCO,EAAY/C,mBACZ+C,EAAY9C,iBAIhB,IAAK,IAAI3G,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEyJ,EAAYQ,qBAAqBjK,GAAa,EAGhD0J,EAAalH,WAAaE,EAAS7C,kBAAkB3P,OACrDwZ,EAAaU,UAAY,EACzBV,EAAaW,mBAAqB,EAClCX,EAAaY,YAAc,EAE3B,IAAK,IAAIjM,EAAe,EAAGA,EAAeqE,EAASH,cAAelE,IAChEqL,EAAa3G,gBAAgB1E,GAAgBgK,EAAQtF,gBAIvD2G,EAAa0B,sBAAwBxS,EAAQG,eAC7C2Q,EAAaN,sBAAwBxQ,EAAQwQ,sBAuM/C,SAA6B1G,EAAU2F,EAASO,EAA2BmB,GAEzE,MAAMxH,EAAgBG,EAASH,cACzBQ,EAAkBL,EAAS7C,kBAAkB3P,OAC7Cqa,EAAapa,KAAKoK,IAAIwI,EAAiB2G,EAAac,qBAAqBta,QAC/E,IAaImb,EAbAC,EAAmB1T,MAAMyQ,EAAQtF,iBAAiB7K,KAAK,GACvDqT,EAAiB3T,MAAMyQ,EAAQtF,iBAAiB7K,KAAK,GACrDsT,EAAa5T,MAAM2S,GAAYrS,KAAK,GACpCuT,EAAkB7T,MAAM2S,GAAYrS,KAAK,GACzCwT,EAAqB9T,MAAM2S,GAAYrS,KAAK,GAC5CyT,EAAe/T,MAAM2S,GAAYrS,KAAK,GACtC0T,EAAchU,MAAM2S,GAAYrS,KAAK,GACrC2T,EAAcjU,MAAM2S,GACrBrS,OACAxE,KAAI,IAAMkE,MAAM2S,GAAYrS,KAAK,KAChC4T,EAAelU,MAAMmL,GAAiB7K,KAAK,GAC3C6T,EAAkBnU,MAAMmL,GAAiB7K,KAAK,GAC9C8T,EAAsBpU,MAAMmL,GAAiB7K,KAAK,GAGlD+T,EAAmB,EACvBvC,EAAaU,YACb,IAAI8B,EAAiB,EACjBC,EAAa,EACjBxC,EAAYC,oBAAsB,EAElC,IAAK,IAAI5J,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D8L,EAAa9L,GAAa,EAC1B+L,EAAgB/L,GAAa,EAG/B,GAAwC,IAApC0J,EAAaW,mBAA0B,CAEzC,IAAK,IAAIrK,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3DgM,EAAoBhM,GAAa,EAGnC,IAAK,IAAI3B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CACvE,IAAI+N,EAAsB7J,EAAgBlE,EAAe,EACzD,IACE,IAAI+E,EAAiB,EACrBA,EAAiBsG,EAAa3G,gBAAgBqJ,GAC9ChJ,IACA,CACA,IAAI6C,EAAkBwD,EAAY3L,eAAesO,GAAqBhJ,GACrB,IAA7C4I,EAAoB/F,EAAkB,KACxC+F,EAAoB/F,EAAkB,GAAK,EAC3CwD,EAAY3L,eAAesO,GAAqBhJ,IAC7CqG,EAAY3L,eAAesO,GAAqBhJ,GAEtD,CACF,CACF,CAEDsG,EAAaW,mBAAqB,EAClC,IAAIgC,EAAc,EACdC,EAAW,EAEf,IAAK,IAAIrc,EAAI,EAAGA,EAAIsa,EAAYta,IAC9B,IAAK,IAAIoK,EAAI,EAAGA,EAAIkQ,EAAYlQ,IAC9BwR,EAAYxR,GAAGpK,GAAK,EAIxB,OAAa,CAEX,IAAIsc,GAAY,EACZC,EAAkB,EAClBC,EAAoB,EAOxB,GALI9C,EAAYC,oBAAsBrH,IACpCoH,EAAYC,sBACZ2C,EAAYG,EAA4BhK,EAAU2F,EAASO,EAA2BmB,IAGpFwC,EAAW,CACb,MAAMI,EAAiBhD,EAAYC,oBACnC4C,EAAkB9C,EAAa3G,gBAAgB4J,EAAiB,GAChEF,EAAoB/C,EAAa3G,gBAAgB4J,EAAiB,GAElE,IAAK,IAAIvJ,EAAiB,EAAGA,EAAiBqJ,EAAmBrJ,IAAkB,CACjF,IACIwJ,EAqBAC,EAtBA5G,EAAkBwD,EAAY3L,eAAe6O,EAAiB,GAAGvJ,GAGrE,GAAoB,IAAhBiJ,EACFA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,MACzC,CACL,IAAK2G,EAAc,EAAGA,EAAcP,GAC9Blc,KAAKqK,IAAIyL,KAAqB9V,KAAKqK,IAAIqP,EAAakB,cAAc6B,IADvBA,KAI7CA,IAAgBP,GAClBA,IACAf,EAAiBlI,GAAkBiJ,EACnCxC,EAAakB,cAAcsB,EAAc,GAAKpG,IAE9CqF,EAAiBlI,GAAkBwJ,EAAc,EACjD/C,EAAakB,cAAc6B,GAAe3G,EAE7C,CAGD,GAAiB,IAAbqG,EACFA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,MACtB,CACL,IAAK4G,EAAW,EAAGA,EAAWP,GACxBnc,KAAKqK,IAAIyL,KAAqB9V,KAAKqK,IAAIgR,EAAWqB,IADhBA,KAIpCA,IAAaP,GACfA,IACAf,EAAenI,GAAkBkJ,EACjCd,EAAWc,EAAW,GAAKrG,IAE3BsF,EAAenI,GAAkByJ,EAAW,EAC5CrB,EAAWqB,GAAY5G,EAE1B,CACF,CAED,GAAIqG,EAAW/B,GAAc8B,EAAc9B,EAEzC,YADA5Z,EAAS,sCAIX,IAAK,IAAImc,EAAmB,EAAGA,EAAmBL,EAAmBK,IAAoB,CACvF,IAAIC,EAAmBzB,EAAiBwB,GACxC,IAAK,IAAIE,EAAgB,EAAGA,EAAgBR,EAAiBQ,IAAiB,CAE5EnB,EADoBN,EAAeyB,GACP,GAAGD,EAAmB,IAChDpD,EAAY7B,oBAAoBkF,GAAeF,EAClD,CACF,CACF,CAGD,IAAIG,EAAuB,EAC3B,IAAK,IAAIL,EAAc,EAAGA,EAAcP,EAAaO,IAC/C/C,EAAakB,cAAc6B,GAAe,IAC5ClB,EAAmBuB,GAAwBL,EAAc,EACzDK,KAIJ,IAAIC,EAAsB,EACtBC,EAAoB,EACxB,IAAK,IAAIN,EAAW,EAAGA,EAAWP,EAAUO,IAAY,CACtD,IAAI5G,EAAkBuF,EAAWqB,GACjC,GAAI5G,EAAkB,EAAG,CACvBwF,EAAgB0B,GAAqBN,EAAW,EAChDM,IACA,IAAIC,EAAoBjd,KAAKqK,IAAIyL,GAC6B,IAA1DwD,EAAY/C,mBAAmB0G,EAAoB,KACrDzB,EAAauB,GAAuBL,EAAW,EAC/CK,IACAzD,EAAY/C,mBAAmB0G,EAAoB,GAAK,EACxD3D,EAAYQ,qBAAqBmD,EAAoB,GACnD3D,EAAY9C,eAAeyG,EAAoB,GAEpD,CACF,CAED,GAAIF,EAAsB,EACxB,IAAK,IAAIG,EAAmB,EAAGA,EAAmBH,EAAqBG,IAAoB,CACzF,IAAIR,EAAWlB,EAAa0B,GAAoB,EAC5CpH,EAAkB9V,KAAKqK,IAAIgR,EAAWqB,IAC1C,IAAK,IAAID,EAAc,EAAGA,EAAcP,EAAaO,IAAe,CAClEf,EAAYgB,GAAUD,GAAe,EACbzc,KAAKqK,IAAIqP,EAAakB,cAAc6B,MAClC3G,IAAiB4F,EAAYgB,GAAUD,GAAe,EACjF,CACF,CAGH,GAAIK,EAAuBd,GAAcxC,EAAYC,oBAAsBrH,EAAe,CACxF,GAA6B,IAAzB0K,EAEF,YADAtc,EAAS,oCAIX,IAAI2c,EAAgB7B,EAAgB,GAChC8B,EAAmB7B,EAAmB,GACtC8B,EAAa3B,EAAYyB,EAAgB,GAAGC,EAAmB,GAEnE,GAAIpd,KAAKqK,IAAIgT,GAAc,KAAM,CAC/BA,EAAa,EACb,IAAK,IAAIZ,EAAc,EAAGA,EAAcK,EAAsBL,IAAe,CAC3E,IAAIa,EAAkB/B,EAAmBkB,GACzC,IAAK,IAAIC,EAAW,EAAGA,EAAWM,EAAmBN,IAAY,CAC/D,IAAIa,EAAejC,EAAgBoB,GAC/Bc,EAAY9B,EAAY6B,EAAe,GAAGD,EAAkB,GAC5Dtd,KAAKqK,IAAImT,GAAaxd,KAAKqK,IAAIgT,KACjCA,EAAaG,EACbJ,EAAmBE,EACnBH,EAAgBI,EAEnB,CACF,CACF,CAED,IAAIE,EAAsBzd,KAAKqK,IAAIgR,EAAW8B,EAAgB,IAC9DjC,EAAyBlb,KAAKqK,IAAIqP,EAAakB,cAAcwC,EAAmB,IAChF,IAAIM,EACFD,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqB1d,KAAKqK,IAAIgT,GAEjF,IAAK,IAAIxN,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IACvDA,GAAa4N,GAAqB9B,EAAa9L,KAC/CA,GAAaqL,GAAwBU,EAAgB/L,KAS3D,GANI7P,KAAKqK,IAAIgT,GAAc,OACzB7c,EACE,2DAA2DgZ,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB,IAAK,IAAIZ,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAef,EAAYyB,EAAgB,GAAGV,GAAeY,EAGrF,IAAIM,EAAgBrE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAIhF,GAHA/D,EAAYQ,qBAAqB2D,EAAsB,GAAKE,EAC5DlC,EAAY0B,EAAgB,GAAKE,EAE7BF,EAAgB,EAClB,IAAK,IAAIT,EAAW,EAAGA,EAAWS,EAAgB,EAAGT,IAAY,CAC/D,IAAIkB,EAAiB5d,KAAKqK,IAAIgR,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,GAA2B,IAAtBS,EAC1B,IAAK,IAAIpB,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,GAAUD,IAAgBoB,EAAoBnE,EAAamB,SAAS4B,GAGpF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,GAAUD,EAAc,GAClCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,GAAIR,EAAgBhB,EAClB,IAAK,IAAIO,EAAWS,EAAeT,EAAWP,EAAUO,IAAY,CAClE,IAAIkB,EAAiB5d,KAAKqK,IAAIgR,EAAWqB,IACrCmB,EAAoBnC,EAAYgB,GAAUU,EAAmB,GAEjE,GADA3B,EAAYiB,GAAYmB,EACpBT,EAAmB,EACrB,IAAK,IAAIX,EAAc,EAAGA,EAAcW,EAAmB,EAAGX,IAC5Df,EAAYgB,EAAW,GAAGD,GACxBf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrF,GAAIW,EAAmBlB,EACrB,IAAK,IAAIO,EAAcW,EAAkBX,EAAcP,EAAaO,IAClEf,EAAYgB,EAAW,GAAGD,EAAc,GACtCf,EAAYgB,GAAUD,GAAeoB,EAAoBnE,EAAamB,SAAS4B,GAGrFnD,EAAYQ,qBAAqB8D,EAAiB,IAAMC,EAAoBF,CAC7E,CAGH,IAAK,IAAI7d,EAAI,EAAGA,EAAIqc,EAAUrc,IAC5B4Z,EAAaoB,UAAUiB,EAAiBjc,EAAI,GAAK2b,EAAY3b,GAE/Dic,GAAkBI,EAElB,IAAK,IAAIrc,EAAI,EAAGA,EAAIqc,EAAUrc,IAC5B4Z,EAAaoB,UAAUiB,EAAiBjc,EAAI,GAAKub,EAAWvb,GAE9Dic,GAAkBI,EAElBzC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEA,IAAK,IAAIjc,EAAI,EAAGA,EAAIoc,EAAapc,IAC/B4Z,EAAaiB,YAAYmB,EAAmB,EAAIhc,GAAK4Z,EAAamB,SAAS/a,GAE7Egc,GAAoBI,EAEpB,IAAK,IAAIpc,EAAI,EAAGA,EAAIoc,EAAapc,IAC/B4Z,EAAaiB,YAAYmB,EAAmB,EAAIhc,GAAK4Z,EAAakB,cAAc9a,GAElFgc,GAAoBI,EAEpBxC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpB,IAAK,IAAIY,EAAW,EAAGA,EAAWP,EAAUO,IAC1ChB,EAAYgB,GAAUR,EAAc,GAAK,EAG3C,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnDf,EAAYS,EAAW,GAAGM,GAAe,EAI3C,GADAP,IACIkB,EAAmBlB,EAAc,EACnC,IAAK,IAAIO,EAAcW,EAAmB,EAAGX,EAAcP,EAAaO,IACtE/C,EAAakB,cAAc6B,GAAe/C,EAAakB,cAAc6B,EAAc,GAKvF,GADAN,IACIgB,EAAgBhB,EAAW,EAC7B,IAAK,IAAIO,EAAWS,EAAgB,EAAGT,EAAWP,EAAUO,IAC1DrB,EAAWqB,GAAYrB,EAAWqB,EAAW,GAIjD,GAAIP,EAAW,GAAK3C,EAAYC,oBAAsBrH,EAAe,SAsBrE,GApBA8I,EAAyBlb,KAAKqK,IAAIqP,EAAakB,cAAc,IAC7DuC,EAAgB,EAChBE,EAAa3B,EAAY,GAAG,GAC5B+B,EAAsBzd,KAAKqK,IAAIgR,EAAW,IAC1C+B,EAAmB,EACnBM,EACED,EACAvC,EACAS,EAAa8B,EAAsB,GACnC7B,EAAgBV,EAAyB,GAC3C3B,EAAaY,YACVZ,EAAaY,YAAckD,IAAe,IAAMK,EAAqB1d,KAAKqK,IAAIgT,GAEjF3D,EAAamB,SAAS,GAAK,EACvB7a,KAAKqK,IAAIgT,GAAc,OACzB7c,EACE,2DAA2DgZ,EAAYC,4CAA4CgE,6BAA+CvC,iBAAsCmC,KAIzL,IAAfA,EAAkB,OAEtB/D,EAAYQ,qBAAqB2D,EAAsB,GACrDnE,EAAYQ,qBAAqB2D,EAAsB,GAAKJ,EAC9D3D,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAamB,SAAS,GACvEiB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAKpC,EAAakB,cAAc,GAC5EkB,IACApC,EAAaiB,YAAYmB,EAAmB,GAAK2B,EACjD/D,EAAaiB,YAAYmB,GAAoBI,EAC7CxC,EAAaiB,YAAYmB,EAAmB,GAAKsB,EACjD1D,EAAaiB,YAAYmB,EAAmB,GAAKuB,EACjDvB,GAAoB,EAEpBpC,EAAaoB,UAAUiB,EAAiB,GAAKN,EAAY,GACzDM,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKV,EAAW,GACxDU,IACArC,EAAaoB,UAAUiB,EAAiB,GAAKoB,EAC7CpB,IAEAxC,EAAae,eAAiBwB,EACC,IAA3BvC,EAAaU,WACf9Z,EAAS,0CAA0C2b,KAGrDgC,GAAwBhC,GACxB,KACD,CACF,CACH,CA/jBEiC,CAAoBxL,EAAU2F,EAAS8C,EAAoCpB,GAG3E,IAAK,IAAI/J,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACrEyJ,EAAY1Q,eAAeiH,GAAa0J,EAAac,qBAAqBxK,GAI5E,MAAMH,kBAAEA,EAAiBY,kBAAEA,GAAsBiC,EACjD,IAAK,IAAI1C,EAAY,EAAGA,EAAY0C,EAAS7C,kBAAkB3P,OAAQ8P,IACtC,OAA3B0C,EAASpG,cAEXhM,EACE,GAAGuP,EAAkBG,GAAWmO,cAAc,OAAO1E,EAAY1Q,eAC/DiH,GACAmO,cAAc,MAIlB7d,EACE,GAAGuP,EAAkBG,GAAWmO,cAAc,OAAO1N,EAAkBT,GAAWmO,cAChF,OACI1E,EAAY1Q,eAAeiH,GAAWmO,cAAc,MAKhE3d,QAAQkK,QAAQ,iBAChBhK,EAAS,8BAET,MAAQmP,kBAAmBuO,EAAa3N,kBAAmB4N,GAAgB3L,EAC3E,MAAO,CACL3J,eAAgB0Q,EAAY1Q,eAAejF,MAAM,EAAG0O,GACpD8L,iBAAkB,CAChBzO,kBAAmBuO,EACnB3N,kBAAmB4N,GAGzB,CAwEA,SAAS3B,EAA4BhK,EAAU2F,EAASO,EAA2BmB,GACjF,MAAM1L,EAAesL,EAAYC,oBAAsB,EAGvD,GAAIvL,EAAe,GAAKA,GAAgBqE,EAASH,cAE/C,OADA5R,EAAS,sCAAsC0N,oBAA+BqE,EAASH,mBAChF,EAIT,MAAMuF,oBAAEA,EAAmBC,oBAAEA,EAAmBe,IAAEA,GAAQiB,EAAc,CACtE1L,eACA8B,IAAKsJ,EAAY3L,eACjB4E,WACAE,eAAgBA,EAChByF,UAEAtP,eAAgB2Q,EAAa0B,sBAC7BhC,sBAAuBM,EAAaN,wBAItC,IAAImF,EAA8B3W,MAAMyQ,EAAQtF,iBAC7C7K,OACAxE,KAAI,IAAMkE,MAAMyQ,EAAQtF,iBAAiB7K,KAAK,KAC7CsW,EAAyB5W,MAAMyQ,EAAQtF,iBAAiB7K,KAAK,GAGjE,GAAI6R,IAAkBlB,EAA6B,CAEjD,IAAI4F,GAAwB,EAC5B,IAAK,MAAMlI,KAAe7D,EAAShE,iBACjC,GACqE,eAAnEkK,EAA0BxC,mBAAmBG,KAAe,IAC5D7D,EAAShE,iBAAiB6H,GAAamI,MACrC,EAAExG,EAAsBC,KAAOD,IAAyB7J,IAE1D,CACAoQ,GAAwB,EACxB,KACD,CAIH,GAAIA,EAAuB,CACzB,MAAMxM,YAAEA,EAAWC,aAAEA,GAAiBmG,EAChCpM,EAAS2M,EAA0Bf,wCACvCxJ,EACAqE,EAAS7C,kBACT6C,EAASjC,kBACTwB,EACAC,EACAU,GAEF2L,EAA8BtS,EAAO6L,oBACrC0G,EAAyBvS,EAAO8L,mBACjC,CAGF,CAGD,IAAK,IAAI4G,EAAa,EAAGA,EAAatG,EAAQtF,gBAAiB4L,IAC7D,IAAK,IAAIC,EAAa,EAAGA,EAAavG,EAAQtF,gBAAiB6L,IAC7DjF,EAAY7B,oBAAoB6G,GAAYC,GAC1C9G,EAAoB6G,GAAYC,GAAcL,EAA4BI,GAAYC,GAK5F,IAAK,IAAIxL,EAAiB,EAAGA,EAAiBiF,EAAQtF,gBAAiBK,IAAkB,CACvF,MAAM6C,EAAkB6C,EAAI1F,GAAkB,EAC9CqG,EAAYQ,qBAAqBhE,IAC/B8B,EAAoB3E,GAAkBoL,EAAuBpL,EAChE,CAED,OAAO,CACT,CA0YA,SAAS6K,GAAwBhC,GAC/B,IAAK,IAAIjM,EAAY,EAAGA,EAAY0J,EAAalH,WAAYxC,IAC3D0J,EAAac,qBAAqBxK,GAAayJ,EAAY9C,eAAe3G,GAG5E,IAAK,IAAI6O,EAAiB,EAAGA,GAAkBnF,EAAalH,WAAYqM,IAAkB,CACxF5C,GAAoB,EACpB,IAAI2B,EAAsB/D,EAAaiB,YAAYmB,EAAmB,GAClEI,EAAcxC,EAAaiB,YAAYmB,GACvCsB,EAAmB1D,EAAaiB,YAAYmB,EAAmB,GAGnE,GAFiBpC,EAAaiB,YAAYmB,EAAmB,GAEtC,IAAnB4C,EACF5C,IACApC,EAAakB,cAAc,GAAKlB,EAAaiB,YAAYmB,EAAmB,GAC5EA,IACApC,EAAamB,SAAS,GAAKnB,EAAaiB,YAAYmB,EAAmB,OAClE,CACLA,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAakB,cAAc6B,GACzB/C,EAAaiB,YAAYmB,EAAmB,EAAIW,GAEpDX,GAAoBI,EACpB,IAAK,IAAIO,EAAc,EAAGA,EAAcP,EAAaO,IACnD/C,EAAamB,SAAS4B,GAAe/C,EAAaiB,YAAYmB,EAAmB,EAAIW,EAExF,CAED,IAAIvB,EAAyBlb,KAAKqK,IAAIqP,EAAakB,cAAcwC,EAAmB,IACpF,GAAI9D,EAAY/C,mBAAmB2E,EAAyB,GAAK,EAAG,SAEpE,IAAIyD,EAAmB,EACvBjF,EAAamB,SAASuC,EAAmB,GAAK,EAC9C,IAAK,IAAIX,EAAc,EAAGA,EAAcP,EAAaO,IACnDkC,GACEjF,EAAamB,SAAS4B,GACtBlD,EAAac,qBAAqBra,KAAKqK,IAAIqP,EAAakB,cAAc6B,IAAgB,GAG1FlD,EAAac,qBAAqBa,EAAyB,GACzDyD,EAAmBrF,EAAYQ,qBAAqB2D,EAAsB,GAE5EnE,EAAY/C,mBAAmB2E,EAAyB,GAAK,CAC9D,CAE8B,IAA3B3B,EAAaU,WACf9Z,EAAS,oDAAoD2b,IACjE,CChtBO,SAAS8C,GAAcC,EAAaC,EAAU,IACnD,IAAIC,EAAY,EACZlW,GAAY,EACZC,EAAa,EACb8G,EAAS,GACThH,EAAiB,GACjBL,EAAiB,GACjBC,EAAiB,GAGrB,MAAME,cAAEA,EAAgB,IAAGC,UAAEA,EAAY,MAASmW,EAGlD,IAAIzM,EAAayM,EAAQvM,SAAS7C,kBAAkB3P,OAGpD,IAAK,IAAID,EAAI,EAAGA,EAAIuS,EAAYvS,IAC9B8P,EAAO9P,GAAK,EACZ8I,EAAe9I,GAAK,EAQtB,IAJIgf,EAAQE,iBAAmBF,EAAQE,gBAAgBjf,SAAWsS,IAChEzJ,EAAiB,IAAIkW,EAAQE,kBAGxBlW,EAAaJ,IAAkBG,GAAW,CAE/C,IAAK,IAAI/I,EAAI,EAAGA,EAAI8I,EAAe7I,OAAQD,IACzC8I,EAAe9I,GAAKoI,OAAOU,EAAe9I,IAAMoI,OAAO0H,EAAO9P,IAIhE,GAA6B,YAAzBgf,EAAQxW,aAA4B,CAOtCsH,EANsB+J,EACpBN,EACAyF,EAAQvM,SACRuM,EAAQ7I,mBACR,CAAErN,iBAAgBqQ,sBAAuB6F,EAAQ7F,wBAE5BrQ,cAC7B,KAAW,GAEFL,iBAAgBC,kBAAmBqW,EACpCC,EAAQvM,SACRuM,EAAQ7I,mBACRrN,EACAkW,EAAQ7F,wBAKVrJ,EAD2BvH,EAAkByW,EAAQxW,aAAcC,EAAgBC,GACvDI,cAC7B,CAQD,GALAmW,EAAYpf,EAAciQ,GAG1BrP,EAAS,4BAA4BuI,EAAa,mBAAmBiW,EAAUf,cAAc,MAEzFe,GAAapW,EACfE,GAAY,OACP,GAAIkW,EAAY,IAAK,CAC1Bve,EAAS,uCAAuCue,KAChD,KACD,CAEDjW,GACD,CAED,MAAO,CACLF,iBACAC,YACAC,aACAP,iBACAC,iBAEJ,CCzFO,MAAMyW,GAYX,WAAA9Z,CACE8Q,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAEA/S,KAAK4J,mBAAqBA,EAC1B5J,KAAKkC,iBAAmBA,EACxBlC,KAAK2D,IAAMA,EACX3D,KAAKF,cAAgBA,EACrBE,KAAKD,aAAeA,EACpBC,KAAK6S,mBAAqBA,EAC1B7S,KAAK8S,mBAAqBA,EAC1B9S,KAAK+S,gBAAkBA,CACxB,CAqBD,iCAAAtG,CAAkCtQ,EAAgBD,GAChD,MAAM8W,EAAY7W,EAAezI,OACjC,IAAIuf,GAAgB,EAEpB,GAA2B,OAAvBjT,KAAKF,gBACP/J,OAAO+T,KAAK9J,KAAK4J,oBAAoBvH,SAAS0H,IAC5C,MAAMmJ,EAASlT,KAAK4J,mBAAmBG,GAAa,GAEpD,GAAe,eAAXmJ,EACFD,GAAgB,EAEhBnf,EAAS,YAAYiW,uDAChB,GAAe,qBAAXmJ,EAA+B,CACxC,MAAMC,EAASnT,KAAK4J,mBAAmBG,GAAa,GAC9CqJ,EAASpT,KAAK4J,mBAAmBG,GAAa,GACpDjW,EACE,YAAYiW,8CAAwDoJ,QAAaC,MAEnFpT,KAAKkC,iBAAiB6H,GAAa1H,SAAQ,EAAER,EAAciB,MACzD,GAA0B,cAAtB9C,KAAKD,aAA8B,EACf,CACpB,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,GACV,EAAG,CAAC,EAAG,EAAG,KAEE+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC3V,EACE,0CAA0C2V,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAekX,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAemX,GAAMlN,GAAY,EAEnCjK,EAAemX,GAAMA,GAAQ,EAG7BlX,EAAemX,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAeoX,GAAMnN,GAAY,EAEnCjK,EAAeoX,GAAMA,GAAQ,CAAC,GAE9C,MAAmB,GAA0B,WAAtBtT,KAAKD,aAA2B,EACnB,CACpB,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,GACP,EAAG,CAAC,EAAG,KAEK+C,GAAMT,SAASmB,IAC3B,MAAMiG,EAAkBzJ,KAAK2D,IAAI9B,GAAc2B,GAAa,EACtD6P,EAAO5J,EACP6J,EAAOtT,KAAK6S,mBAAqBpJ,EACvC3V,EACE,0CAA0C2V,EAAkB,cAC1D5H,EAAe,iBACD2B,EAAY,MAG9BrH,EAAekX,GAAQF,EACvB,IAAK,IAAIhN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAemX,GAAMlN,GAAY,EAEnCjK,EAAemX,GAAMA,GAAQ,EAG7BlX,EAAemX,GAAQF,EACvB,IAAK,IAAIjN,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAeoX,GAAMnN,GAAY,EAEnCjK,EAAeoX,GAAMA,GAAQ,CAAC,GAEjC,IAEJ,MAKEL,GAAe,CAClB,MAAMM,EAAO,EAAIvT,KAAK6S,mBACtB,IAAK,IAAI1M,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAeqX,GAAMpN,GAAY,EAEnCjK,EAAeqX,GAAMA,GAAQ,EAC7BpX,EAAeoX,GAAQ,EACvBzf,EAAS,sEACV,CAEJ,EC4JH,SAAS0f,GACPC,EACAvN,EACAzG,EACA0Q,EACAuD,EACAC,EACAvN,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBzc,OAErD,GAAwB,IAApB6S,EAAuB,CAoBzB,MAAMqN,EAAahM,EAAyB8L,EAAoBC,EAlBjD,CACb,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOoe,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAoBhC,MAAMqN,EAAahM,EAAyB8L,EAAoBC,EAlBjD,CACb,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAIxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOoe,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIP,CACD,MAAO,CAAEuB,QAAQ,EAAOlS,MAAO,KACjC,CAaA,SAASoe,GAAsBJ,EAAOvN,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAE9E,MAAM7J,EAAiBkD,EAAOlD,eACxBgK,EAAkBL,EAASvC,IAAI9B,GAAcnO,OAInD,IAGIogB,EAHA1T,EADiCgG,EAAenG,kBAAkBC,EAAKC,GAC1BC,cAK/C0T,EADE1Y,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAIwX,EAA6B,EACjC,IAAK,IAAInN,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DmN,GACED,EAAM5N,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOmN,CACT,CASA,SAASC,GAAmBvW,EAAGoH,EAAGoP,GAChC,IAAItM,GAAS,EACb,IAAK,IAAIlU,EAAI,EAAGA,EAAIwgB,EAASvgB,OAAQD,IAAK,CACxC,OAAQygB,EAAIC,IAAMC,EAAIC,IAAOJ,EAASxgB,GACpB0gB,EAAKtP,GAAMwP,EAAKxP,GAAKpH,GAAM2W,EAAKF,IAAOrP,EAAIsP,IAAQE,EAAKF,GAAMD,IACjEvM,GAAUA,EAC1B,CACD,OAAOA,CACT,CCtbA,IAAI2M,GAAc,KAMlBnW,eAAeoW,KACb,GAAID,GAAa,OAAOA,SAClBE,OAAO,kDACb,OACIC,QAASC,IACTD,QAASE,IACTF,QAASG,IACTH,QAASI,IACTJ,QAASK,IACTL,QAASM,IACTN,QAASO,IACTP,QAASQ,IACTR,QAASS,IACTT,QAASU,UACHld,QAAQmd,IAAI,CACpBZ,OAAO,2CACPA,OAAO,2DACPA,OAAO,qEACPA,OAAO,4CACPA,OAAO,iDACPA,OAAO,2DACPA,OAAO,yDACPA,OAAO,4CACPA,OAAO,gDACPA,OAAO,sDAcT,OAZAF,GAAc,CACZI,WACAC,2BACAC,eACAC,eACAC,eACAC,0BACAC,yBACAC,YACAC,cACAC,qBAEKb,EACT,CAEA,MAAMe,GAAgB,IAAIxgB,IAWnB,SAASygB,GAAiBlZ,EAAU,IACzC,MAAO,CACLmZ,WAAYnZ,EAAQmZ,YAAc,eAClCC,QAASpZ,EAAQoZ,UAAW,EAC5BC,cAAerZ,EAAQqZ,gBAAiB,EACxCC,eAAgBtZ,EAAQsZ,gBAAkB,WAE9C,CAWO,SAASC,GAAyBvZ,EAAU,IACjD,MAAO,CACLwZ,QAASxZ,EAAQwZ,UAAW,EAC5BC,iBAAkBzZ,EAAQyZ,kBAAoB,GAC9CC,MAAO1Z,EAAQ0Z,OAAS,CAAC,IAAM,IAAM,KACrCC,UAAW3Z,EAAQ2Z,WAAa,EAEpC,CA6DO5X,eAAe6X,GAA+BvC,EAAOhU,EAAQyG,EAAW,KAAM9J,EAAU,IAC7F,MAAM6Z,EAAe/P,GAAYP,EAAY8N,EAAM7N,aAC7CvC,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDoE,EAAgBC,GAAsB1W,EAAOlD,eAAgB8G,EAAkB3P,QAC/E0iB,EAASC,GAAiBhT,EAAmBY,GAE7CqS,EAAOla,EAAQka,MAAQ,UACvBC,EACK,SAATD,EAsQJ,SAAkCE,GAChC,GAAIA,EAAc,EAAG,OAAO,IAAIC,YAAY,GAC5C,MAAMC,EAAS,IAAID,YAAgC,GAAnBD,EAAc,IAC9C,IAAIG,EAAS,EACb,IAAK,IAAIljB,EAAI,EAAGA,EAAI+iB,EAAc,EAAG/iB,IACnCijB,EAAOC,KAAY,EACnBD,EAAOC,KAAYljB,EACnBijB,EAAOC,KAAYljB,EAAI,EAEzB,OAAOijB,CACT,CA/QQE,CAAyBvT,EAAkB3P,QAiRnD,SAA+BiQ,GAC7B,MAAM+S,EAAS,GACf,IAAK,IAAIjjB,EAAI,EAAGA,EAAIkQ,EAAIjQ,OAAQD,IAAK,CACnC,MAAMojB,EAAOC,GAAgCnT,EAAIlQ,IACjDijB,EAAO1U,KAAK6U,EAAKnjB,UAAWmjB,EAC7B,CACD,OAAOJ,YAAY9N,KAAK+N,EAC1B,CAvRQK,CAAsBd,EAAatS,KAAO,IAIhD,MAAO,CACLyS,SACAY,QAASd,EACTK,QACAU,eANqBC,GAAcd,EAAQF,EAAeK,EAAOD,GAOjEA,OACAa,SAAU,CACRC,aAAc3D,EAAM2D,aACpBtX,cAAe2T,EAAM7N,WAAW9F,cAChCuX,eAAgBjB,EAAO1iB,OAAS,EAChC4jB,cAAeC,GAAiBhB,IAGtC,CA0CApY,eAAeqZ,GAAeC,EAASC,EAAWN,EAAcO,EAAUC,EAAgB,IACxF,GAAwB,oBAAbhZ,SAET,YADAzK,EAAS,uDAGX,MAAMugB,SACJA,EAAQC,yBACRA,EAAwBC,aACxBA,EAAYI,uBACZA,EAAsBC,UACtBA,EAASE,kBACTA,SACQZ,KAEJsD,EAAYjZ,SAASkZ,eAAeJ,GAC1C,IAAKG,EAEH,YADA1jB,EAAS,0CAA0CujB,KAIjDrC,GAAc0C,IAAIL,KACpBrC,GAAcjc,IAAIse,GAAWre,SAC7Bgc,GAAchc,OAAOqe,IAGvBG,EAAUG,UAAY,GACtBH,EAAUI,MAAMC,SAAW,WAC3BL,EAAUI,MAAME,MAAQN,EAAUI,MAAME,OAAS,OACjDN,EAAUI,MAAMG,OAASP,EAAUI,MAAMG,QAAU,QAEnD,MAAMC,EAAsBrD,EAAuBsD,YAAY,CAAEC,WAAY,CAAC,EAAG,EAAG,KACpFF,EAAoBG,aAAaX,GACjCQ,EAAoBI,SAEpB,MAAMC,EAAWL,EAAoBM,cAC/BC,EAAeP,EAAoBQ,kBAEnCC,EAAS7D,EAAUqD,cACzBQ,EAAOC,aAAatB,EAAQR,UAC5B6B,EAAOE,8BACPF,EAAOG,2BACPH,EAAOI,qBAAoB,GAE3B,MAAMC,EA+NR,SAAwBnC,GACtB,IAAKA,GAAStjB,OAAQ,MAAO,CAAC,EAAG,GACjC,IAAI0lB,EAAWvd,OAAOwd,kBAClBC,EAAWzd,OAAO0d,kBACtB,IAAK,IAAI9lB,EAAI,EAAGA,EAAIujB,EAAQtjB,OAAQD,IAAK,CACvC,MAAMgC,EAAQuhB,EAAQvjB,GACjBoI,OAAO2d,SAAS/jB,KACjBA,EAAQ2jB,IAAUA,EAAW3jB,GAC7BA,EAAQ6jB,IAAUA,EAAW7jB,GAClC,CACD,OAAKoG,OAAO2d,SAASJ,IAAcvd,OAAO2d,SAASF,GAC/CF,IAAaE,EAAiB,CAACF,EAAW,EAAGE,EAAW,GACrD,CAACF,EAAUE,GAFmD,CAAC,EAAG,EAG3E,CA5OsBG,CAAehC,EAAQT,SAC3C8B,EAAOY,eAAeP,EAAY,GAAIA,EAAY,IAElD,MAAMQ,EAAa/B,EAAc+B,YAAcrE,GAAiB,CAAE,GAC5DsE,EAAcjF,EAAyB2D,cAGvCuB,EAoGR,SAA+BC,EAAQtE,GACrC,IAAKA,IAAYsE,GAAQC,WAAWrmB,OAAQ,OAAOomB,EACnD,MAAME,EAAMF,EAAOC,UACbE,EAAOD,EAAI,GACXhZ,EAAOgZ,EAAIA,EAAItmB,OAAS,GACxBwmB,EAAW,GACjB,IAAK,IAAIzmB,EAAIumB,EAAItmB,OAAS,EAAGD,GAAK,EAAGA,GAAK,EACxCymB,EAASlY,KAAKhB,GAAQgZ,EAAIvmB,GAAKwmB,GAAOD,EAAIvmB,EAAI,GAAIumB,EAAIvmB,EAAI,GAAIumB,EAAIvmB,EAAI,IAExE,MAAO,IAAKqmB,EAAQC,UAAWG,EACjC,CA9GuBC,CADnBvF,EAAawF,gBAAgBT,EAAWpE,aAAeX,EAAawF,gBAAgB,gBACnCT,EAAWnE,SAC9DoE,EAAYS,cAAcR,GAC1BD,EAAYU,gBAAgBnB,EAAY,GAAIA,EAAY,IACxDS,EAAYW,cACZzB,EAAO0B,eAAeZ,GAEtB,MAAMa,EAAQ/F,EAAS4D,cAKvB,GAJAmC,EAAMC,UAAU5B,GACK,SAAjBrB,EAAQnB,MAAiBmE,EAAME,cAAcC,aAAa,GAC9DlC,EAASmC,SAASJ,GAEdd,EAAWlE,cAAe,CAC5B,MAAMqF,EAAiB3F,EAAkBmD,YAAY,CACnDyC,mBAAmB,EACnBC,cAAgBC,IACd,MAAMC,EAASD,EAAOE,oBACtB,IAAKD,GAAUA,EAAOxnB,OAAS,EAAG,OAClC,MAAO0nB,EAAQC,GAAUH,EAEnBI,GAAQD,EAASD,GAAM,EACvBG,EAAQngB,MAAMuN,KAAK,CAAEjV,OAFb,IAE8B,CAACiY,EAAGlY,IAAM2nB,EAAS3nB,EAAI6nB,IACnEL,EAAOO,SAASD,GAChBN,EAAOQ,eACLF,EAAMrkB,KAAKgE,IACT,MAAM8C,EAAMrK,KAAKqK,IAAI9C,GACrB,OAAY,IAAR8C,EAAkB,IAClBA,GAAO,KAAQA,EAAM,IAAc0d,WAAWxgB,EAAEygB,YAAY,IAAInhB,WAC7DU,EAAEyW,cAAc,EAAE,IAE5B,IAGLmJ,EAAec,iBAAiB,CAAEC,UAAW,UAC7Cf,EAAegB,iBAAiB,CAAED,UAAW,UAC7Cf,EAAeiB,aAAapC,EAAWjE,gBACvCoF,EAAekB,mBAAmBpC,GAClClB,EAASuD,WAAWnB,EACrB,CAED,MAAMoB,EAAevG,GAAyBiC,EAAcsE,cAAgB,CAAEtG,SAAS,IACnFsG,EAAatG,SAA4B,SAAjB6B,EAAQnB,YAUtCnY,eAAyCua,EAAUjB,EAAS0B,EAAagD,GACvE,MAAMC,EAAW3E,EAAQN,UAAUkF,kBACnC,IAAKD,EACH,OAEF,MAAM1H,SAAEA,EAAQG,aAAEA,EAAYC,aAAEA,EAAYC,wBAAEA,EAAuBE,UAAEA,SAAoBV,KAErF+H,EAAYxH,EAAawD,cAC/BgE,EAAUC,cAAcH,EAASI,GAAIJ,EAASK,GAAI,GAClDH,EAAUI,UAAUN,EAAS5lB,OAAO,GAAI4lB,EAAS5lB,OAAO,GAAI,GAC5D8lB,EAAUK,WAAWP,EAASQ,QAAQ,GAAIR,EAASQ,QAAQ,GAAI,GAE/D,MAAMC,EAAehI,EAAayD,YAAY,CAC5CziB,KAAM,WACNinB,mBAAoB,EACpBC,OAAQX,EAASS,eAEnBP,EAAUU,eAAeC,WAAWJ,GAEpC,MAAMK,EAAgBnI,EAAwBuD,YAAY,CACxD6E,YAAa,EACb7lB,MAAO,EACP8lB,aAAa,IAEfF,EAAcnE,aAAauD,GAE3B,MAAM9e,EAAI7J,KAAKoK,IAAI,EAAGoe,EAAetG,kBAC/BuD,EAAWD,EAAY,GACvBG,EAAWH,EAAY,GACvBmC,GAAQhC,EAAWF,IAAa5b,EAAI,GACpC6f,EAAgB,GACtB,IAAK,IAAI5pB,EAAI,EAAGA,EAAI+J,EAAG/J,IACrB4pB,EAAcrb,KAAKoX,EAAW3lB,EAAI6nB,GAEpC4B,EAAcI,iBAAiBD,GAC/BH,EAAcK,SAEd,MAAMC,EAAgBvI,EAAUqD,cAChCkF,EAAczE,aAAamE,EAAcO,iBACzCD,EAActE,qBAAoB,GAElC,MAAMwE,EAAehJ,EAAS4D,cAC9BoF,EAAahD,UAAU8C,GACvBE,EAAa/C,cAAcgD,YAAYxB,EAAerG,OACtD4H,EAAa/C,cAAcC,aAAauB,EAAepG,WACvD2C,EAASmC,SAAS6C,EACpB,CAvDUE,CAA0BlF,EAAUjB,EAAS0B,EAAa+C,GAGlExD,EAASmF,cACTjF,EAAakF,SACbzI,GAAcvd,IAAI4f,EAAWW,GAC7BR,EAAUkG,MAAQ,GAAGpG,YAAmBP,GAC1C,CAkEAjZ,eAAe+Y,GAAcd,EAAQY,EAAST,EAAOD,EAAO,WAC1D,MAAMpB,YAAEA,EAAWL,aAAEA,SAAuBN,KACtC0C,EAAW/B,EAAYoD,cAC7BrB,EAAS+G,YAAYC,QAAQ7H,EAAQ,GACjCG,EAAM7iB,OAAS,IACJ,SAAT4iB,EAAiBW,EAASiH,WAAWD,QAAQ1H,GAC5CU,EAASkH,WAAWF,QAAQ1H,IAEnC,MAAM6H,EAAavJ,EAAayD,YAAY,CAC1CziB,KAAM,WACNinB,mBAAoB,EACpBC,OAAQ/F,IAGV,OADAC,EAAS+F,eAAeC,WAAWmB,GAC5BnH,CACT,CAEA,SAASZ,GAAiBhT,EAAmBY,GAC3C,MAAMmS,EAAS,IAAIiI,aAAwC,EAA3Bhb,EAAkB3P,QAClD,IAAK,IAAID,EAAI,EAAGA,EAAI4P,EAAkB3P,OAAQD,IAAK,CACjD,MAAM6qB,EAAW,EAAJ7qB,EACb2iB,EAAOkI,GAAQziB,OAAOwH,EAAkB5P,KAAO,EAC/C2iB,EAAOkI,EAAO,GAAKziB,OAAOoI,IAAoBxQ,KAAO,EACrD2iB,EAAOkI,EAAO,GAAK,CACpB,CACD,OAAOlI,CACT,CAEA,SAASD,GAAsB5Z,EAAgBgiB,GAC7C,MAAMvH,EAAU,IAAIqH,aAAaE,GACjC,IAAK,IAAI9qB,EAAI,EAAGA,EAAI8qB,EAAgB9qB,IAAK,CACvC,MAAMgC,EAAQ8G,IAAiB9I,GAC/BujB,EAAQvjB,GAAKoI,OAAOT,MAAMiD,QAAQ5I,GAASA,EAAM,GAAKA,IAAU,CACjE,CACD,OAAOuhB,CACT,CAuBA,SAASF,GAAgC0H,GACvC,MAAMC,EAAUD,EAAatnB,KAAKwnB,GAASA,EAAO,IAC5ClhB,EAAIihB,EAAQ/qB,OAElB,OAAU,IAAN8J,GAAiB,IAANA,EACNihB,EAGC,IAANjhB,EAMK,CAACihB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAANjhB,EACK,CAACihB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAGhC,IAANjhB,EAKK,CAACihB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAG5C,IAANjhB,EAQK,CAACihB,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,GAAIA,EAAQ,IAI/CA,EAAQnnB,MAAM,EAAG3D,KAAKgrB,IAAI,EAAGF,EAAQ/qB,QAC9C,CAiBA,SAAS6jB,GAAiBqH,GACxB,IAAIC,EAAQ,EACVlI,EAAS,EACX,KAAOA,EAASiI,EAAYlrB,QAC1BijB,GAAUiI,EAAYjI,GAAU,EAChCkI,IAEF,OAAOA,CACT,CAiMA,SAASC,GAAiC/B,EAAQP,EAAIC,GAGpD,MAAMsC,EAAY,IAAIV,aAAa7B,EAAKC,GACxC,IAAK,IAAIuC,EAAK,EAAGA,EAAKvC,EAAIuC,IACxB,IAAK,IAAIC,EAAK,EAAGA,EAAKzC,EAAIyC,IACxBF,EAAUE,EAAKD,EAAKxC,GAAMO,EAAOkC,EAAKxC,EAAKuC,GAG/C,OAAOD,CACT,CAyBA,SAASvL,GACPC,EACAvN,EACAzG,EACA0Q,EACAuD,EACAC,EACAvN,GAEA,MAAM/C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvL,EAAkBL,EAASvC,IAAIwM,GAAgBzc,OAErD,GAAwB,IAApB6S,EAAuB,CACzB,MAmBMqN,EAAahM,EAAyB8L,EAAoBC,EAnB/C,CACf,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOoe,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIV,MAAS,GAAwB,IAApBG,EAAuB,CAChC,MAmBMqN,EAAahM,EAAyB8L,EAAoBC,EAnB/C,CACf,CACEtQ,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,IAEtD,CACE9M,EAAkB6C,EAASvC,IAAIwM,GAAgB,GAAK,GACpDlM,EAAkBiC,EAASvC,IAAIwM,GAAgB,GAAK,MAKxD,GAAIyD,EAAWjM,OACb,MAAO,CACLA,QAAQ,EACRlS,MAAOoe,GACLJ,EACAvN,EACAzG,EACA0Q,EACAyD,EAAW1T,IACX0T,EAAWzT,IACXiG,GAIP,CAED,MAAO,CAAEuB,QAAQ,EAAOlS,MAAO,KACjC,CAEA,SAASoe,GAAsBJ,EAAOvN,EAAUzG,EAAQoC,EAAc3B,EAAKC,EAAKiG,GAC9E,MAAM7J,EAAiBkD,EAAOlD,eACxBgK,EAAkBL,EAASvC,IAAI9B,GAAcnO,OAE7C0M,EAD+BgG,EAAenG,kBAAkBC,EAAKC,GACxBC,cAE7C0T,EAAQ1Y,MAAMiD,QAAQ9B,EAAe,IAAMA,EAAerF,KAAKzB,GAAUA,EAAM,KAAM8G,EAE3F,IAAI2iB,EAAoB,EACxB,IAAK,IAAItY,EAAiB,EAAGA,EAAiBL,EAAiBK,IAC7DsY,GACEpL,EAAM5N,EAASvC,IAAI9B,GAAc+E,GAAkB,GAAKxG,EAAcwG,GAG1E,OAAOsY,CACT,CAEA,SAASlL,GAAmBvW,EAAGoH,EAAGoP,GAChC,IAAItM,GAAS,EACb,IAAK,IAAIlU,EAAI,EAAGA,EAAIwgB,EAASvgB,OAAQD,IAAK,CACxC,OAAQygB,EAAIC,IAAMC,EAAIC,IAAOJ,EAASxgB,GACpB0gB,EAAKtP,GAAMwP,EAAKxP,GAAKpH,GAAM2W,EAAKF,IAAOrP,EAAIsP,IAAQE,EAAKF,GAAMD,IACjEvM,GAAUA,EAC1B,CACD,OAAOA,CACT,kBCj0BO,MACL,WAAA7O,GjB8BK,IAAiB/E,EiB7BpBiM,KAAKoX,aAAe,KACpBpX,KAAK4F,WAAa,GAClB5F,KAAK4J,mBAAqB,GAC1B5J,KAAK/D,aAAe,UACpB+D,KAAKmf,qBAAuB,KjByBRprB,EiBvBlB,yPjBwBJC,QAAQC,IAAI,YAAcF,EAAS,sCiBtBjCG,EAAS,kCACV,CAOD,cAAAkrB,CAAeC,EAAajjB,EAAU,IACpC4D,KAAKoX,aAAeiI,OAGkBrnB,IAAlCoE,GAAS+iB,uBACXnf,KAAKmf,qBAAuB/iB,EAAQ+iB,qBACpCrrB,EAAS,kCAGoBkE,IAA3BoE,GAASC,gBACX2D,KAAK3D,cAAgBD,EAAQC,cAC7BvI,EAAS,wBAAwBkM,KAAK3D,uBAEbrE,IAAvBoE,GAASE,YACX0D,KAAK1D,UAAYF,EAAQE,UACzBxI,EAAS,oBAAoBkM,KAAK1D,cAGpCxI,EAAS,uBAAuBurB,IACjC,CAED,aAAAC,CAAc1Z,GACZ5F,KAAK4F,WAAaA,EAClB9R,EAAS,mCAAmC8R,EAAW9F,gBACxD,CAED,oBAAAyf,CAAqBxV,EAAayV,GAChCxf,KAAK4J,mBAAmBG,GAAeyV,EACvC1rB,EAAS,0CAA0CiW,YAAsByV,EAAU,KACpF,CAED,eAAAC,CAAgBxjB,GACd+D,KAAK/D,aAAeA,EACpBnI,EAAS,wBAAwBmI,IAClC,CAOD,KAAAyjB,CAAMtjB,EAAU,IACT4D,KAAKoX,cAAiBpX,KAAK4F,YAAe5F,KAAK4J,oBAClDzV,EAAS,8EAYX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GACjBoW,EAAkB,GAGtBze,EAAS,qBACT,MAAMgS,EAAWP,EAAY3F,KAAK4F,YAClC1R,EAAS,8BAGT,MAAM4d,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAHA/P,EAAS,gCACTF,QAAQ0I,KAAK,oBACbxI,EAAS,gBAAgB8L,KAAKoX,gBACJ,yBAAtBpX,KAAKoX,aAEP,GAA0B,YAAtBpX,KAAK/D,aAA4B,CAMnCM,EALsB+Q,EACpBjB,EACAnG,EACAlG,KAAK4J,oBAEwBrN,cACvC,KAAa,GAEFL,iBAAgBC,kBAAmByP,EAA0B1F,EAAUlG,KAAK4J,qBAK/ErN,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,cACrC,MACI,GAA0B,2BAAtByD,KAAKoX,aAA2C,CAEzD,IAAIxK,EAAwB,EAC5B,MAAM+S,EAA2B,EAG3BlN,EAAU,CACdvM,SAAUA,EACV0D,mBAAoB5J,KAAK4J,mBACzBgD,sBAAuBA,EACvB3Q,aAAc+D,KAAK/D,aACnB0W,kBAEAtW,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,WAGvC,KAAOsQ,GAAyB,GAAG,CAEjC6F,EAAQ7F,sBAAwBA,EAG5BrQ,EAAe7I,OAAS,IAC1B+e,EAAQE,gBAAkB,IAAIpW,IAIhC,MAAMqjB,EAAsBrN,GAAc5F,EAA6B8F,GAGvEvW,EAAiB0jB,EAAoB1jB,eACrCC,EAAiByjB,EAAoBzjB,eACrCI,EAAiBqjB,EAAoBrjB,eAGrCqQ,GAAyB,EAAI+S,CAC9B,CACP,MAAW,GAA0B,yBAAtB3f,KAAKoX,aAEd,GAA0B,YAAtBpX,KAAK/D,aACP9H,EACE,uGAEG,GAEF+H,iBAAgBC,kBCjKpB,SAAmC+J,EAAU0D,EAAoBuV,GACtEjrB,EAAS,gDAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAajG,cACbA,EAAaC,aACbA,GACEmG,GAGE7I,EAAEA,EAACwiB,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMZ,EAGjBtT,EAAU5F,EAAcC,IACxB/J,eACJA,EAAcD,eACdA,EAAcoK,iBACdA,EAAgBF,eAChBA,EAAcX,YACdA,EAAWC,aACXA,EAAYa,gBACZA,GACEsF,EAEJ,GAAsB,OAAlB/L,EAIF,IAAK,IAAI+B,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAK,IAAI+E,EAAiB,EAAGA,EAAiBL,EAAiBK,IAE7DN,EAAiBM,GAAkBjT,KAAKqK,IAAI2F,EAAI9B,GAAc+E,IAAmB,EAInF,IAAK,IAAIwE,EAAkB,EAAGA,EAAkB3F,EAAY/R,OAAQ0X,IAAmB,CAErF,MAAMhL,cAAEA,EAAaC,sBAAEA,GAA0B+F,EAAenG,kBAC9DwF,EAAY2F,KAIRvE,YAAEA,EAAWC,oBAAEA,GAAwBN,EAA8B,CACzEpG,gBACAC,wBACAgD,oBACAiD,mBACAC,oBAIF,IAAIyZ,EAAS,EACb,IAAK,IAAIvsB,EAAI,EAAGA,EAAI8S,EAAiB9S,IACnCusB,GAAU3c,EAAkBiD,EAAiB7S,IAAM2M,EAAc3M,GAInE,MAAMwsB,EAAI5iB,EAAE2iB,GACN1iB,EAAIuiB,EAAEG,GACNxf,EAAIsf,EAAEE,GACNE,EAAIH,EAAEC,GAGZ,IAAK,IAAIhU,EAAkB,EAAGA,EAAkBzF,EAAiByF,IAAmB,CAClF,MAAMmU,EAAmB7Z,EAAiB0F,GAG1C7P,EAAegkB,IACbza,EAAa0F,GAAmBvE,EAAcqZ,EAAI9f,EAAc4L,GAElE,IAAK,IAAId,EAAkB,EAAGA,EAAkB3E,EAAiB2E,IAAmB,CAClF,MAAMC,EAAmB7E,EAAiB4E,GAG1ChP,EAAeikB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACAoZ,EACAnZ,EAAoBkF,GACpBlF,EAAoBoE,GAGtBhP,EAAeikB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACAvJ,EACAwJ,EAAoBoE,GACpB9K,EAAc4L,GAGhB9P,EAAeikB,GAAkBhV,IAC/BzF,EAAa0F,GACbvE,EACArG,EACAJ,EAAc4L,GACd5L,EAAc8K,EACjB,CACF,CACF,CACF,KAC0B,OAAlBpL,GACT3L,EAAS,0EAkBX,OAbkC,IAAIqY,EACpC5C,EACA1H,EACAyB,EACA7D,EACAC,GAIwB0M,kCAAkCtQ,EAAgBD,GAE5EhI,EAAS,8CAEF,CACLgI,iBACAC,iBAEJ,CDgC8CikB,CACpCla,EACAlG,KAAK4J,mBACL5J,KAAKmf,uBAOP5iB,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,cACrC,MACI,GAA0B,uBAAtByD,KAAKoX,aAAuC,CAErD,MAAMiJ,EE7JL,SAAoCna,EAAU0D,GACnD1V,EAAS,6CAGT,MAAMmP,kBACJA,EAAiBY,kBACjBA,EAAiBN,IACjBA,EAAGzB,iBACHA,EAAgB6D,cAChBA,EAAaC,WACbA,EAAUlG,cACVA,EAAaC,aACbA,GACEmG,EAGkB,OAAlBpG,GACF3L,EAAS,2CAEU,cAAjB4L,GACF5L,EAAS,wFAIX,MAAM0e,EAAqB7M,EAYrBsa,EAAqB,CAAC,EAAG,EAAG,EAAG,GAG/BvN,EAAkB,IAAIle,IACtB0rB,EAAsB,GAC5B,IAAIC,EAAoB,EAExB,IAAK,IAAI3e,EAAe,EAAGA,EAAekE,EAAelE,IACvD,IAAK,IAAI4e,EAAc,EAAGA,EAAcH,EAAmB5sB,OAAQ+sB,IAAe,CAChF,MAAMC,EAAe/c,EAAI9B,GAAcye,EAAmBG,IAAgB,EACrE1N,EAAgBgF,IAAI2I,KACvB3N,EAAgBjb,IAAI4oB,EAAcF,GAClCD,EAAoBve,KAAK0e,GACzBF,IAEH,CAEH,MAAM1N,EAAqB0N,EACrBxN,EAAY,EAAIH,EAAqBC,EAE3Chf,EACE,uBAAuB+e,0BAA2CC,0BAA2CE,gBAI/G,IAAI7W,EAAiB,GACjBD,EAAiB,GACrB,IAAK,IAAIsH,EAAY,EAAGA,EAAYwP,EAAWxP,IAAa,CAC1DrH,EAAeqH,GAAa,EAC5BtH,EAAe8F,KAAK,IACpB,IAAK,IAAImE,EAAW,EAAGA,EAAW6M,EAAW7M,IAC3CjK,EAAesH,GAAW2C,GAAY,CAEzC,CAGD,MAAMwa,EAAyB,IAAI9gB,EAAe,CAChDC,cAAe,KACfC,aAAc,cAEV6gB,EAAyB,IAAI/gB,EAAe,CAChDC,cAAe,KACfC,aAAc,WAQhB,IAAIsG,EAJyB,IAAId,EAAqB,CACpDzF,cAAe,KACfC,aAAc,cAEiCyF,2BAC7CC,EAAcY,EAAsBZ,YACpCC,EAAeW,EAAsBX,aAMzC,IAAK,IAAI7D,EAAe,EAAGA,EAAekE,EAAelE,IAAgB,CAEvE,IAAIgf,EAAsB,GAC1B,IAAK,IAAIja,EAAiB,EAAGA,EAxEC,EAwEyCA,IAErEia,EAAoBja,GAAkBjD,EAAI9B,GAAc+E,GAAkB,EAI5E,IAAIka,EAAuB,GAC3B,IAAK,IAAIla,EAAiB,EAAGA,EA9EC,EA8EyCA,IAAkB,CACvF,MAAM8Z,EAAe/c,EAAI9B,GAAcye,EAAmB1Z,IAAmB,EAC7Eka,EAAqBla,GAAkBmM,EAAgB3Z,IAAIsnB,EAC5D,CAGD,IAAK,IAAI5U,EAAmB,EAAGA,EAAmBrG,EAAY/R,OAAQoY,IACpE,IAAK,IAAIK,EAAmB,EAAGA,EAAmB1G,EAAY/R,OAAQyY,IAAoB,CAExF,MAAM4U,EAAuCJ,EAAuB1gB,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIR6U,EAAuCJ,EAAuB3gB,kBAClEwF,EAAYqG,GACZrG,EAAY0G,IAIRJ,EAAgBhF,EAA8B,CAClD3G,cAAe2gB,EAAqC3gB,cACpDC,sBAAuB0gB,EAAqC1gB,sBAC5DC,sBAAuBygB,EAAqCzgB,sBAC5D+C,oBACAY,oBACAqC,iBAAkBua,EAClBta,gBA3GwB,KA+GpBM,YAAEA,EAAWC,oBAAEA,EAAmBM,oBAAEA,GAAwB2E,EAG5DkV,EAAevb,EAAaoG,GAAoBpG,EAAayG,GAAoBtF,EAGvF,IAAK,IAAImF,EAAkB,EAAGA,EArHJ,EAqH+CA,IAAmB,CAC1F,IAAIkV,EAAcL,EAAoB7U,GAClCmV,EAAQD,EACRE,EAAQvO,EAAqBqO,EAEjC,IAAK,IAAIhW,EAAkB,EAAGA,EA1HN,EA0HiDA,IAAmB,CAC1F,IAAImW,EAAcR,EAAoB3V,GAClCoW,EAAQD,EACRE,EAAQ1O,EAAqBwO,EAG7BG,EA9DH,GA+DEP,GAEAna,EAAoBkF,GAAmBlF,EAAoBoE,GAC1D9D,EAAoB4E,GAAmB5E,EAAoB8D,IAG/DhP,EAAeilB,GAAOG,IAAUE,EAChCtlB,EAAeklB,GAAOG,IAAUC,CACjC,CAGD,IAAK,IAAIC,EAAiB,EAAGA,EA3IL,EA2I+CA,IAAkB,CACvF,IAAIlO,EAAO,EAAIV,EAAqBiO,EAAqBW,GAErDC,EACFT,EACAD,EAAqC5gB,cAAcqhB,GACnD3a,EAAoBkF,GAElB2V,EACFV,EACAD,EAAqC5gB,cAAcqhB,GACnDra,EAAoB4E,GAGtB9P,EAAeilB,GAAO5N,IAASmO,EAG/BxlB,EAAeklB,GAAO7N,IAASoO,EAG/BzlB,EAAeqX,GAAM4N,KAAWO,EAChCxlB,EAAeqX,GAAM6N,KAAWO,CACjC,CACF,CACF,CAEJ,CAiBD,OAd+B,IAAI/O,GACjChJ,EACA1H,EACAyB,EACA7D,EACAC,EACA8S,EACAC,EACAC,GAGqBtG,kCAAkCtQ,EAAgBD,GACzEhI,EAAS,2CAEF,CACLgI,iBACAC,iBACA0W,qBACAC,qBACAyN,sBAEJ,CF1DiCqB,CAA2B1b,EAAUlG,KAAK4J,oBACrE1N,EAAiBmkB,EAAmBnkB,eACpCC,EAAiBkkB,EAAmBlkB,eAMpCI,EAJ2BP,EAAkBgE,KAAK/D,aAAcC,EAAgBC,EAAgB,CAC9FE,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAEHC,eAGpCyD,KAAK6hB,sBAAwB,CAC3BhP,mBAAoBwN,EAAmBxN,mBACvCC,mBAAoBuN,EAAmBvN,mBACvCyN,oBAAqBF,EAAmBE,oBAE3C,CAID,OAHAvsB,QAAQkK,QAAQ,oBAChBhK,EAAS,6BAEF,CAAEqI,iBAAgBuV,mBAC1B,CAQD,gBAAMgQ,CAAWtjB,EAAepC,EAAU,IACnC4D,KAAKoX,cAAiBpX,KAAK4F,YAAe5F,KAAK4J,oBAClDzV,EAAS,mFAGX,IAAI+H,EAAiB,GACjBC,EAAiB,GACjBI,EAAiB,GAErBrI,EAAS,qBACT,MAAMgS,EAAWP,EAAY3F,KAAK4F,YAClC1R,EAAS,8BACT,MAAM4d,EAAmB,CACvBzO,kBAAmB6C,EAAS7C,kBAC5BY,kBAAmBiC,EAASjC,mBAO9B,GAJA/P,EAAS,gCACTF,QAAQ0I,KAAK,oBAEbxI,EAAS,iBAAiB8L,KAAKoX,gBACL,yBAAtBpX,KAAKoX,iBACJlb,iBAAgBC,kBAAmByP,EAA0B1F,EAAUlG,KAAK4J,qBAErD,eAAtB5J,KAAK/D,cAA+B,CACtC,MAAQM,eAAgBkB,SAAYW,EAClC,aACAlC,EACAC,EACA,CACEqC,gBACAnC,cAAeD,EAAQC,eAAiB2D,KAAK3D,cAC7CC,UAAWF,EAAQE,WAAa0D,KAAK1D,YAGzCC,EAAiBkB,CAGlB,CAKH,OAHAzJ,QAAQkK,QAAQ,oBAChBhK,EAAS,6BAEF,CAAEqI,iBAAgBuV,mBAC1B,qBGhQI,MAKL,WAAAhZ,GACEkH,KAAKvB,OAAS,KACduB,KAAK+hB,UAAY,KACjB/hB,KAAKgiB,SAAU,EAEfhiB,KAAKiiB,aACN,CAOD,iBAAMA,GACJ,IACEjiB,KAAKvB,OAAS,IAAIC,OAAO,IAAIC,IAAI,qBAAsB,oBAAAC,UAAA,oBAAAC,SAAA,IAAAC,QAAA,OAAA,KAAA,QAAAC,YAAAC,KAAA,oBAAAJ,SAAAC,SAAAG,KAAAJ,SAAAK,eAAA,WAAAL,SAAAK,cAAAC,QAAAC,eAAAP,SAAAK,cAAAG,KAAA,IAAAT,IAAA,mBAAAC,SAAAS,SAAAL,MAAkB,CACvEjI,KAAM,WAGRiJ,KAAKvB,OAAOyjB,QAAWC,IACrBnuB,QAAQ2E,MAAM,iCAAkCwpB,EAAM,EAExD,MAAMC,EAAgB9iB,EAAaU,KAAKvB,QAExCuB,KAAK+hB,gBAAkB,IAAIK,EAE3BpiB,KAAKgiB,SAAU,CAChB,CAAC,MAAOrpB,GAEP,MADA3E,QAAQ2E,MAAM,8BAA+BA,GACvCA,CACP,CACF,CAQD,kBAAM0pB,GACJ,OAAIriB,KAAKgiB,QAAgB/pB,QAAQC,UAE1B,IAAID,SAAQ,CAACC,EAASoqB,KAC3B,IAAIC,EAAW,EACf,MAEMC,EAAa,KACjBD,IACIviB,KAAKgiB,QACP9pB,IACSqqB,GANO,GAOhBD,EAAO,IAAI3sB,MAAM,2CAEjB8sB,WAAWD,EAAY,IACxB,EAEHA,GAAY,GAEf,CAOD,oBAAMpD,CAAeC,GAEnB,aADMrf,KAAKqiB,eACJriB,KAAK+hB,UAAU3C,eAAeC,EACtC,CAOD,mBAAMC,CAAc1Z,GAElB,aADM5F,KAAKqiB,eACJriB,KAAK+hB,UAAUzC,cAAc1Z,EACrC,CAQD,0BAAM2Z,CAAqBxV,EAAayV,GAEtC,aADMxf,KAAKqiB,eACJriB,KAAK+hB,UAAUxC,qBAAqBxV,EAAayV,EACzD,CAOD,qBAAMC,CAAgBxjB,GAEpB,aADM+D,KAAKqiB,eACJriB,KAAK+hB,UAAUtC,gBAAgBxjB,EACvC,CAMD,WAAMyjB,SACE1f,KAAKqiB,eACOK,YAAYC,MAC9B,MAAMljB,QAAeO,KAAK+hB,UAAUrC,QAEpC,OADgBgD,YAAYC,MACrBljB,CACR,CAMD,kBAAMmjB,GAEJ,aADM5iB,KAAKqiB,eACJriB,KAAK+hB,UAAUa,cACvB,CAMD,UAAMC,GAEJ,aADM7iB,KAAKqiB,eACJriB,KAAK+hB,UAAUc,MACvB,CAKD,SAAAjjB,GACMI,KAAKvB,SACPuB,KAAKvB,OAAOmB,YACZI,KAAKvB,OAAS,KACduB,KAAK+hB,UAAY,KACjB/hB,KAAKgiB,SAAU,EAElB,2EChJuB7jB,MAAO2kB,IAC/B,IAAIrjB,EAAS,CACX4D,kBAAmB,GACnBY,kBAAmB,GACnB3C,eAAgB,CACdC,aAAc,GACdC,iBAAkB,IAEpBU,iBAAkB,GAClB0H,mBAAoB,GACpBxH,kBAAmB,CAAE,EACrB2gB,MAAO,EACPC,OAAO,EACPC,SAAU,IACV3f,YAAa,EACbY,YAAa,EACbjC,gBAAiB,GACjBN,aAAc,CAAE,GAIlB,MAAMuhB,EAAoB,CAAEC,OAAQ,CAAA,GAEpC,IACIC,SADgBN,EAAKO,QAEtBC,MAAM,MACNpsB,KAAKqsB,GAAMA,EAAEC,SACbC,QAAQF,GAAY,KAANA,IAEbG,EAAU,GACVC,EAAY,EAGZC,EAAmB,EACnB5d,EAAa,EACb6d,EAAsB,EACtBC,EAAmB,CAAEC,SAAU,GAC/BC,EAAW,GACXC,EAAoB,EACpBC,EAA2B,EAG3BC,EAAsB,EAEtBC,EAAyB,EACzBC,EAAsB,CAAE7W,YAAa,GACrC8W,EAA2B,EAE3BC,EAAwB,CAAA,EAGxBC,EAAe,KACfC,EAAgB,KAChBC,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EAGxB,KAAOjB,EAAYP,EAAM1vB,QAAQ,CAC/B,MAAMmxB,EAAOzB,EAAMO,GAGnB,GAAa,gBAATkB,EAAwB,CAC1BnB,EAAU,aACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,mBAATkB,EAA2B,CAC7BnB,EAAU,gBACVC,IACA,QACD,CACD,GAAa,sBAATkB,EAA8B,CAChCnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVe,EAAgB,SAChBd,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVc,EAAe,KACfC,EAAgB,KAChBd,IACA,QACD,CACD,GAAa,WAATkB,EAAmB,CACrBnB,EAAU,QACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,GACVC,IACA,QACD,CACD,GAAa,cAATkB,EAAsB,CACxBnB,EAAU,WACVC,IACA,QACD,CACD,GAAa,iBAATkB,EAAyB,CAC3BnB,EAAU,GACVC,IACA,QACD,CAED,MAAMmB,EAAQD,EAAKvB,MAAM,OAGzB,GAAgB,eAAZI,EACFjkB,EAAOsjB,MAAQrH,WAAWoJ,EAAM,IAChCrlB,EAAOujB,MAAqB,MAAb8B,EAAM,GACrBrlB,EAAOwjB,SAAW6B,EAAM,QAIrB,GAAgB,kBAAZpB,EAA6B,CACpC,MAAMphB,EAAYyiB,SAASD,EAAM,GAAI,IAC/BviB,EAAMwiB,SAASD,EAAM,GAAI,IAC/B,IAAIjvB,EAAOivB,EAAMxtB,MAAM,GAAGyE,KAAK,KAAKipB,QAAQ,SAAU,IAEtDvlB,EAAOwC,gBAAgBD,KAAK,CAAEO,MAAKD,YAAWzM,QAC/C,MAGI,GAAgB,aAAZ6tB,EACP,GAAsB,WAAlBe,EACFD,EAAe,CACbpO,OAAQ2O,SAASD,EAAM,GAAI,IAC3B3B,OAAQ4B,SAASD,EAAM,GAAI,IAC3BG,SAAUF,SAASD,EAAM,GAAI,IAC7BI,QAASH,SAASD,EAAM,GAAI,KAE9BL,EAAgB,cACX,GAAsB,WAAlBA,EACTC,IACIA,IAAoBF,EAAapO,SAAQqO,EAAgB,eACxD,GAAsB,WAAlBA,EAA4B,CACrC,MAAMliB,EAAMwiB,SAASD,EAAM,GAAI,IACzBK,EAAcJ,SAASD,EAAM,GAAI,IACjCM,EAAWN,EAAMxtB,MAAM,EAAG,EAAI6tB,GAAajuB,KAAKqD,GAAMwqB,SAASxqB,EAAG,MACxE2oB,EAAkBC,OAAO5gB,GAAO6iB,EAChCT,IACIA,IAAoBH,EAAarB,SAAQsB,EAAgB,WACrE,KAAmC,aAAlBA,IACTG,IACIA,IAAsBJ,EAAaS,WAAUR,EAAgB,iBAOhE,GAAgB,UAAZf,GACP,GAAyB,IAArBE,EACFA,EAAmBmB,SAASD,EAAM,GAAI,IACtC9e,EAAa+e,SAASD,EAAM,GAAI,IAChCrlB,EAAO4D,kBAAoB,IAAIjI,MAAM4K,GAAYtK,KAAK,GACtD+D,EAAOwE,kBAAoB,IAAI7I,MAAM4K,GAAYtK,KAAK,QACjD,GAAImoB,EAAsBD,GAAkD,IAA9BE,EAAiBC,SACpED,EAAmB,CACjBuB,IAAKN,SAASD,EAAM,GAAI,IACxBviB,IAAKwiB,SAASD,EAAM,GAAI,IACxBQ,WAAYP,SAASD,EAAM,GAAI,IAC/Bf,SAAUgB,SAASD,EAAM,GAAI,KAE/Bd,EAAW,GACXC,EAAoB,EACpBC,EAA2B,OACtB,GAAID,EAAoBH,EAAiBC,UAC9C,IAAK,IAAIxpB,KAAKuqB,EAGZ,GAFAd,EAAShiB,KAAK+iB,SAASxqB,EAAG,KAC1B0pB,IACIA,IAAsBH,EAAiBC,SAAU,WAElD,GAAIG,EAA2BJ,EAAiBC,SAAU,CAC/D,MAAMwB,EAAUvB,EAASE,GAA4B,EACrDzkB,EAAO4D,kBAAkBkiB,GAAW7J,WAAWoJ,EAAM,IACrDrlB,EAAOwE,kBAAkBshB,GAAW7J,WAAWoJ,EAAM,IACrDrlB,EAAO6D,cACP7D,EAAOyE,cACPggB,IACIA,IAA6BJ,EAAiBC,WAChDF,IACAC,EAAmB,CAAEC,SAAU,GAElC,OAIE,GAAgB,aAAZL,EACP,GAA4B,IAAxBS,EACFA,EAAsBY,SAASD,EAAM,GAAI,IACzBC,SAASD,EAAM,GAAI,SAC9B,GAAIV,EAAyBD,GAA2D,IAApCE,EAAoB7W,YAC7E6W,EAAsB,CACpBgB,IAAKN,SAASD,EAAM,GAAI,IACxBviB,IAAKwiB,SAASD,EAAM,GAAI,IACxBU,YAAaT,SAASD,EAAM,GAAI,IAChCtX,YAAauX,SAASD,EAAM,GAAI,KAGlCrlB,EAAOkC,aAAa0iB,EAAoBmB,cACrC/lB,EAAOkC,aAAa0iB,EAAoBmB,cAAgB,GAAKnB,EAAoB7W,YAEpF8W,EAA2B,OACtB,GAAIA,EAA2BD,EAAoB7W,YAAa,CACrE,MAAMiY,EAAcX,EAAMxtB,MAAM,GAAGJ,KAAKsG,GAAMunB,SAASvnB,EAAG,MAG1D,IAAIkoB,EAAcrB,EAAoB9hB,IACtC,GAAgC,IAA5B8hB,EAAoBgB,IAAW,CACjC,MAAMM,EAASzC,EAAkBC,OAAOkB,EAAoB9hB,KACxDojB,GAAUA,EAAOjyB,OAAS,IAAGgyB,EAAcC,EAAO,GACvD,CAEuC,IAApCtB,EAAoBmB,aAAyD,IAApCnB,EAAoBmB,aAC1DjB,EAAsBmB,KAAcnB,EAAsBmB,GAAe,IAC9EnB,EAAsBmB,GAAa1jB,KAAKyjB,GAEnChmB,EAAO2C,kBAAkBsjB,KAAcjmB,EAAO2C,kBAAkBsjB,GAAe,IACpFjmB,EAAO2C,kBAAkBsjB,GAAa1jB,KAAKyjB,IACE,IAApCpB,EAAoBmB,YAC7B/lB,EAAO6B,eAAeE,iBAAiBQ,KAAKyjB,GACC,IAApCpB,EAAoBmB,aAAyD,KAApCnB,EAAoBmB,aACtE/lB,EAAO6B,eAAeC,aAAaS,KAAKyjB,GAG1CnB,IACIA,IAA6BD,EAAoB7W,cACnD4W,IACAC,EAAsB,CAAE7W,YAAa,GAExC,CAGHmW,GACD,CAkBD,OAfAlkB,EAAOwC,gBAAgBI,SAAS7K,IAC9B,GAAuB,IAAnBA,EAAK8K,UAAiB,CACxB,MAAMsjB,EAAQrB,EAAsB/sB,EAAK+K,MAAQ,GAC7CqjB,EAAMlyB,OAAS,GACjB+L,EAAOmK,mBAAmB5H,KAAK,CAC7BnM,KAAM2B,EAAK3B,KACX0M,IAAK/K,EAAK+K,IACVqjB,SAGL,KAGH9xB,EAAS,+CAA+C2N,KAAKC,UAAUjC,EAAO2C,sBAEvE3C,CAAM,crB1QR,SAAmBomB,GACV,UAAVA,GAA+B,UAAVA,GACvB7xB,QAAQC,IACN,+BAAiC4xB,EAAQ,yBACzC,sCAEFhyB,EAAkB,UAElBA,EAAkBgyB,EAClB3xB,EAAS,qBAAqB2xB,KAElC,6Be6GO,SAAkCpS,EAAOhU,EAAQkY,EAAUD,GAChE1jB,QAAQ0I,KAAK,gBACb,MAAM2G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDhS,EAAgB2T,EAAM7N,WAAW9F,cACjCoG,EAAWP,EAAY8N,EAAM7N,YAG7BQ,EAAiB,IAAIvG,EAAe,CACxCC,cAAe2T,EAAM7N,WAAW9F,cAChCC,aAAc0T,EAAM7N,WAAW7F,eAGjC,GAAsB,OAAlBD,GAAuC,SAAb6X,QAEvB,GAAsB,OAAlB7X,GAAuC,YAAb6X,EAAwB,CAC3D,MAAMmO,EAAsB,GACtBC,EAAsB,GACtBC,EAAUryB,KAAKoK,OAAOsF,GAAqB1P,KAAKgrB,OAAOtb,GACvD4iB,EAAUtyB,KAAKoK,OAAOkG,GAAqBtQ,KAAKgrB,OAAO1a,GACvDiiB,EAAkB,GAClBC,EAAYxyB,KAAKyyB,MAAMJ,EAAUE,GACjCG,EAAY1yB,KAAKyyB,MAAMH,EAAUC,GACjCI,EAAYN,GAAWG,EAAY,GACnCI,EAAYN,GAAWI,EAAY,GACzC,IAAIG,EAAc,GAElBV,EAAoB,GAAKnyB,KAAKgrB,OAAOtb,GACrC0iB,EAAoB,GAAKpyB,KAAKgrB,OAAO1a,GAErC,IAAK,IAAIwiB,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBW,GAAiBX,EAAoB,GACzDC,EAAoBU,GAAiBV,EAAoB,GAAKU,EAAgBF,EAGhF,IAAK,IAAIG,EAAgB,EAAGA,EAAgBP,EAAWO,IAAiB,CACtE,MAAMpiB,EAAQoiB,EAAgBL,EAC9BP,EAAoBxhB,GAASwhB,EAAoB,GAAKY,EAAgBJ,EACtEP,EAAoBzhB,GAASyhB,EAAoB,GAEjD,IAAK,IAAIU,EAAgB,EAAGA,EAAgBJ,EAAWI,IACrDX,EAAoBxhB,EAAQmiB,GAAiBX,EAAoBxhB,GACjEyhB,EAAoBzhB,EAAQmiB,GAAiBV,EAAoBzhB,GAASmiB,EAAgBF,CAE7F,CAKDC,EAAc,IAAIprB,MAAM+qB,EAAYE,GAAW3qB,KAAK,MAGpD,MAAMirB,EAAmB7d,EAAoB5C,IAGvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAC9D,IAAI0gB,EAAoB,EACxB,IAAK,IAAIC,EAAe,EAAGA,EAAeV,EAAYE,EAAWQ,IAAgB,CAE/E,IACG7S,GACC8R,EAAoBe,GACpBd,EAAoBc,GACpBF,GAGF,SAEF,IAAIG,GAAQ,EACZ,IACE,IAAIlgB,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIijB,GAAmBlzB,OACjDkT,IACA,CACA,IAAI6C,EAAkBvD,EAASvC,IAAIijB,GAAmBhgB,GAAkB,EACxE,IACE,IAAImgB,EAAwB,EAC5BA,EAAwBne,EAAca,GACtCsd,IACA,CACA,IAAI5W,EAAiBzH,EAAce,GAAiBsd,GACpD,MAAMC,EAAexT,GACnBC,EACAvN,EACAzG,EACA0Q,EACA2V,EAAoBe,GACpBd,EAAoBc,GACpBzgB,GAGF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAavxB,MACzCqxB,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAGD,IAAKA,EACH,IAAK,IAAI3W,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAIjQ,OAAQyc,IAAkB,CACnF,MAAM6W,EAAexT,GACnBC,EACAvN,EACAzG,EACA0Q,EACA2V,EAAoBe,GACpBd,EAAoBc,GACpBzgB,GAGF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAavxB,MACzCqxB,GAAQ,EACR,KACD,CACF,CAEJ,CAGD,IAAIG,EAAiBtzB,KAAKgrB,IAAIuI,OAAOC,WAAY,KAC7CC,EAAcnB,EAAUD,EACxBqB,EAAY1zB,KAAKgrB,IAAIsI,EAAgB,KACrCK,EAAaD,EAAYD,EAGzBG,EAAS,CACXxJ,MAAO,GAAGpG,2BAAkClE,EAAM2D,eAClDe,MAAOkP,EACPjP,OAAQkP,EACRE,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CACL1J,MAAO,IACP2J,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAErE,EAAG,GAAIjpB,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,IAClCuqB,UAAW,WAITC,EAAc,CAChBrqB,EAAGqoB,EACHjhB,EAAGkhB,EACHgC,EAAGvB,EACHzvB,KAAM,UACNixB,aAAa,EACbC,aAAa,EACbpD,KAAM,CACJqD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRvK,MAAO,YAETloB,KAAM,+BAGR0yB,OAAOC,QAAQ9Q,EAAW,CAACoQ,GAAcP,EAAQ,CAAEkB,YAAY,IAC/Dz0B,QAAQkK,QAAQ,eACjB,CACH,gCC9KOC,eAA2CsV,EAAOhU,EAAQkY,EAAUD,EAAWE,EAAgB,IAEpG,GADA5jB,QAAQ0I,KAAK,gBAC0B,OAAnC+W,EAAM7N,WAAW9F,eAAuC,YAAb6X,EAAwB,CAErE,MAAMzR,EAAWP,EAAY8N,EAAM7N,YAC7B6R,QAAgBzB,GAA+BvC,EAAOhU,EAAQyG,EAAU,CAC5EoQ,KAAyC,OAAnC7C,EAAM7N,WAAW9F,eAAuC,SAAb6X,EAAsB,OAAS,YAIlF,aAFMH,GAAeC,EAASC,EAAWjE,EAAM2D,aAAcO,EAAUC,QACvE5jB,QAAQkK,QAAQ,eAEjB,CACD,MAAMgI,EAAWP,EAAY8N,EAAM7N,YAC7B8iB,QAkhBRvqB,eAAwCsV,EAAOhU,EAAQyG,GACrD,MAAMyiB,QA5GRxqB,eAA2CsV,EAAOhU,EAAQyG,GACxD,MAAM7C,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClD1L,EAAiB,IAAIvG,EAAe,CACxCC,cAAe2T,EAAM7N,WAAW9F,cAChCC,aAAc0T,EAAM7N,WAAW7F,eAGjC,IAAIka,EAAO5W,EAAkB,GACzBrC,EAAOqC,EAAkB,GACzBulB,EAAO3kB,EAAkB,GACzB/C,EAAO+C,EAAkB,GAC7B,IAAK,IAAIxQ,EAAI,EAAGA,EAAI4P,EAAkB3P,OAAQD,IAAK,CACjD,MAAMgK,EAAI4F,EAAkB5P,GACtBoR,EAAIZ,EAAkBxQ,GACxBgK,EAAIwc,IAAMA,EAAOxc,GACjBA,EAAIuD,IAAMA,EAAOvD,GACjBoH,EAAI+jB,IAAMA,EAAO/jB,GACjBA,EAAI3D,IAAMA,EAAO2D,EACtB,CAED,MAAMmhB,EAAUhlB,EAAOiZ,EACjBgM,EAAU/kB,EAAO0nB,EACjBC,EAAmB,GAEnB1C,EAAYxyB,KAAKoK,IAAI,EAAGpK,KAAKyyB,MAAMJ,EAAU6C,IAC7CxC,EAAY1yB,KAAKoK,IAAI,EAAGpK,KAAKyyB,MAAMH,EAAU4C,IAE7CtlB,EAASyiB,GAAWG,EAAY,GAChChiB,EAAS8hB,GAAWI,EAAY,GAEhCyC,EAAgB3C,EAAYE,EAC5BP,EAAsB,IAAIzH,aAAayK,GACvC/C,EAAsB,IAAI1H,aAAayK,GACvCtC,EAAc,IAAInI,aAAayK,GACrCtC,EAAY9qB,KAAKG,OAAOktB,KACxB,MAAMC,EAAa,IAAIC,WAAWH,GAE5BnC,EAAmB7d,EAAoB5C,IACvCwC,cAAEA,EAAaE,cAAEA,GAAkBH,EAAqBvC,GAE9D,IAAI0gB,EAAoB,EACxB,IAAK,IAAI3H,EAAK,EAAGA,EAAKkH,EAAWlH,IAC/B,IAAK,IAAID,EAAK,EAAGA,EAAKqH,EAAWrH,IAAM,CACrC,MAAM6H,EAAe5H,EAAKoH,EAAYrH,EAChCvhB,EAAIwc,EAAOgF,EAAK1b,EAChBsB,EAAI+jB,EAAO5J,EAAK7a,EAKtB,GAHA2hB,EAAoBe,GAAgBppB,EACpCsoB,EAAoBc,GAAgBhiB,GAE/BmP,GAAmBvW,EAAGoH,EAAG8hB,GAC5B,SAGF,IAAIG,GAAQ,EACZ,IACE,IAAIlgB,EAAiB,EACrBA,EAAiBV,EAASvC,IAAIijB,GAAmBlzB,OACjDkT,IACA,CACA,MAAM6C,EAAkBvD,EAASvC,IAAIijB,GAAmBhgB,GAAkB,EAC1E,IAAK,IAAIsiB,EAAK,EAAGA,EAAKtgB,EAAca,GAAkByf,IAAM,CAC1D,MAAM/Y,EAAiBzH,EAAce,GAAiByf,GAChDlC,EAAexT,GAAYC,EAAOvN,EAAUzG,EAAQ0Q,EAAgB1S,EAAGoH,EAAGuB,GAEhF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAavxB,MACzCuzB,EAAWnC,GAAgB,EAC3BC,GAAQ,EACR,KACD,CACF,CACD,GAAIA,EAAO,KACZ,CAED,IAAKA,EACH,IAAK,IAAI3W,EAAiB,EAAGA,EAAiBjK,EAASvC,IAAIjQ,OAAQyc,IAAkB,CACnF,MAAM6W,EAAexT,GAAYC,EAAOvN,EAAUzG,EAAQ0Q,EAAgB1S,EAAGoH,EAAGuB,GAEhF,GAAI4gB,EAAarf,OAAQ,CACvBif,EAAoBzW,EACpBqW,EAAYK,GAAgBG,EAAavxB,MACzCuzB,EAAWnC,GAAgB,EAC3B,KACD,CACF,CAEJ,CAGH,MAAO,CACLV,YACAE,YACApM,OACA2O,OACArlB,SACAY,SACA6hB,UACAC,UACAH,sBACAC,sBACAS,cACAwC,aAEJ,CAGqBG,CAA4B1V,EAAOhU,EAAQyG,IACxDigB,UACJA,EAASE,UACTA,EAASpM,KACTA,EAAI2O,KACJA,EAAIrlB,OACJA,EAAMY,OACNA,EAAM2hB,oBACNA,EAAmBC,oBACnBA,EAAmBS,YACnBA,EAAWwC,WACXA,GACEL,EAEEvS,EAASC,GAAiByP,EAAqBC,GAC/CxP,EAoCR,SAAkCiG,EAAIC,EAAIuM,GACxC,MAAMtS,EAAS,GAEf,IAAK,IAAIuI,EAAK,EAAGA,EAAKzC,EAAK,EAAGyC,IAC5B,IAAK,IAAID,EAAK,EAAGA,EAAKvC,EAAK,EAAGuC,IAAM,CAClC,MAAMoK,EAAKnK,EAAKxC,EAAKuC,EACfqK,GAAMpK,EAAK,GAAKxC,EAAKuC,EACrBsK,GAAMrK,EAAK,GAAKxC,GAAMuC,EAAK,GAC3BuK,EAAKtK,EAAKxC,GAAMuC,EAAK,GAEtBgK,EAAWI,IAAQJ,EAAWK,IAAQL,EAAWM,IAAQN,EAAWO,IAIzE7S,EAAO1U,KAAK,EAAGonB,EAAIC,EAAIC,EAAIC,EAC5B,CAGH,OAAO9S,YAAY9N,KAAK+N,EAC1B,CAvDgB8S,CAAyBrD,EAAWE,EAAW2C,GACvD/R,QAAiBC,GAAcd,EAAQoQ,EAAajQ,EAAO,WAEjE,MAAO,CACLH,SACAY,QAASwP,EACTjQ,QACAU,WACAX,KAAM,UACNa,SAAU,CACRrX,cAAe,KACfuX,eAAgBjB,EAAO1iB,OAAS,EAChC4jB,cAAeC,GAAiBhB,GAChC8F,kBAAmB,CACjBG,GAAI2J,EACJ1J,GAAI4J,EACJ7vB,OAAQ,CAACyjB,EAAM2O,GACfhM,QAAS,CAACrZ,EAAQY,GAClB0Y,aAAciC,GAAiC0H,EAAaL,EAAWE,KAI/E,CAxjBoCoD,CAAyBhW,EAAOhU,EAAQyG,SACpEsR,GACJkR,EACAhR,EACAjE,EAAM2D,aACN,GAAGO,iBACHC,GAEF5jB,QAAQkK,QAAQ,eAClB,iBD/HO,SAAsBuV,EAAOhU,EAAQkY,EAAUD,GACpD1jB,QAAQ0I,KAAK,gBACb,MAAM2G,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDvV,EAAiBkD,EAAOlD,eACxB6a,EAAe3D,EAAM2D,aACrBtX,EAAgB2T,EAAM7N,WAAW9F,cAGvC,GAFiB6F,EAAY8N,EAAM7N,YAEb,OAAlB9F,GAAuC,SAAb6X,EAAqB,CAEjD,IAAI+R,EAEFA,EADEntB,EAAe7I,OAAS,GAAK0H,MAAMiD,QAAQ9B,EAAe,IACpDA,EAAerF,KAAKiE,GAAQA,EAAI,KAEhCoB,EAEEnB,MAAMuN,KAAKtF,GAEvB,IAAIsmB,EAAW,CACblsB,EAAG4F,EACHwB,EAAG6kB,EACHpT,KAAM,QACNvf,KAAM,UACN8tB,KAAM,CAAE/O,MAAO,mBAAoBqC,MAAO,GAC1CtiB,KAAM,YAGJoxB,EAAiBtzB,KAAKgrB,IAAIuI,OAAOC,WAAY,KAI7CI,EAAS,CACXxJ,MAAO,eAAe3G,IACtBe,MALcxkB,KAAKgrB,IAAIsI,EAAgB,KAMvC7O,OALe,IAMfoP,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CAAE1J,MAAO,YAChB6J,OAAQ,CAAErE,EAAG,GAAIjpB,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,KAGpCirB,OAAOC,QAAQ9Q,EAAW,CAACiS,GAAWpC,EAAQ,CAAEkB,YAAY,IAC5Dz0B,QAAQkK,QAAQ,eACjB,MAAM,GAAsB,OAAlB4B,GAAuC,YAAb6X,EAAwB,CAE3D,IAAI7D,EAEFA,EADE1Y,MAAMiD,QAAQ9B,EAAe,IACvBA,EAAerF,KAAKvC,GAAQA,EAAI,KAEhC4H,EAIV,IAAI0qB,EAAiBtzB,KAAKgrB,IAAIuI,OAAOC,WAAY,KAC7ClN,EAAOtmB,KAAKgrB,OAAOtb,GACnBrC,EAAOrN,KAAKoK,OAAOsF,GACnBulB,EAAOj1B,KAAKgrB,OAAO1a,GAInBmjB,GAHOzzB,KAAKoK,OAAOkG,GAEF2kB,IADP5nB,EAAOiZ,GAGjBoN,EAAY1zB,KAAKgrB,IAAIsI,EAAgB,KAIrCM,EAAS,CACXxJ,MAAO,GAAGpG,YAAmBP,IAC7Be,MAAOkP,EACPjP,OANeiP,EAAYD,EAO3BI,MAAO,CAAEzJ,MAAO,KAChB0J,MAAO,CACL1J,MAAO,IACP2J,YAAa,IACbC,WAAY,GAEdC,OAAQ,CAAErE,EAAG,GAAIjpB,EAAG,GAAI0K,EAAG,GAAI1H,EAAG,IAClCuqB,UAAW,WAITC,EAAc,CAChBrqB,EAAG4F,EACHwB,EAAGZ,EACH8jB,EAAGjU,EACH/c,KAAM,UACN8tB,KAAM,CACJqD,UAAW,KAEbC,SAAU,CACRC,SAAU,UACVC,YAAY,GAGdC,SAAU,CACRvK,MAAO,YAETloB,KAAM,kBAGR0yB,OAAOC,QAAQ9Q,EAAW,CAACoQ,GAAcP,EAAQ,CAAEkB,YAAY,IAC/Dz0B,QAAQkK,QAAQ,eACjB,CACH,oBCfOC,eAA+BsV,EAAOhU,EAAQkY,EAAUD,EAAWE,EAAgB,IACxF5jB,QAAQ0I,KAAK,gBACb,MAAMoD,EAAgB2T,EAAM7N,WAAW9F,cACjCoG,EAAWP,EAAY8N,EAAM7N,YAC7B6R,QAAgBzB,GAA+BvC,EAAOhU,EAAQyG,EAAU,CAC5EoQ,KAAwB,OAAlBxW,GAAuC,SAAb6X,EAAsB,OAAS,kBAE3DH,GAAeC,EAASC,EAAWjE,EAAM2D,aAAcO,EAAUC,GACvE5jB,QAAQkK,QAAQ,eAClB,iBMlG4B,gDN2LrB,SAA0CuB,GAC/C,MAAM4D,kBAAEA,EAAiBY,kBAAEA,GAAsBxE,EAAOqS,iBAClDkF,EAAUb,GAAsB1W,EAAOlD,eAAgB8G,EAAkB3P,QACzEk2B,EAAW,IAAIvL,aAAwC,EAA3Bhb,EAAkB3P,QAEpD,IAAK,IAAID,EAAI,EAAGA,EAAI4P,EAAkB3P,OAAQD,IAAK,CACjD,MAAM6qB,EAAW,EAAJ7qB,EACbm2B,EAAStL,GAAQziB,OAAOwH,EAAkB5P,KAAO,EACjDm2B,EAAStL,EAAO,GAAKziB,OAAOoI,EAAkBxQ,KAAO,EACrDm2B,EAAStL,EAAO,GAAKtH,EAAQvjB,EAC9B,CAED,MAAO,CACLm2B,WACAC,cAAe,CAACxmB,EAAkB3P,OAAQ,GAC1Co2B,OAAQ9S,EACRZ,OAAQC,GAAiBhT,EAAmBY,GAEhD,+BA5BO9F,eAA0CsV,EAAOhU,EAAQyG,EAAW,KAAM9J,EAAU,IAEzF,OAiVF,SAAwBqb,GACtB,MAAMsS,aAAEA,EAAYC,QAAEA,GAfxB,SAA6CpL,GAC3C,MAAMmL,EAAe,GACnBC,EAAU,GACZ,IAAIrT,EAAS,EACXsT,EAAU,EACZ,KAAOtT,EAASiI,EAAYlrB,QAAQ,CAClC,MAAMw2B,EAAOtL,EAAYjI,KACzB,IAAK,IAAIljB,EAAI,EAAGA,EAAIy2B,EAAMz2B,IAAKs2B,EAAa/nB,KAAK4c,EAAYjI,MAC7DsT,GAAWC,EACXF,EAAQhoB,KAAKioB,EACd,CACD,MAAO,CAAEF,eAAcC,UACzB,CAGoCG,CAAoC1S,EAAQlB,OACxEc,EAAiBI,EAAQrB,OAAO1iB,OAAS,EACzC02B,EAA0B,SAAjB3S,EAAQnB,KACjB+T,EAAcD,EAAS,QAAU,QACvC,MAAO,CACL,wBACA,oEACA,eACA,8BAA8B/S,uCAAoD+S,EAASJ,EAAQt2B,OAAS,wCAAwC02B,EAAS,EAAIJ,EAAQt2B,WACzK,uCACA,2FAA2F0H,MAAMuN,KAAK8O,EAAQT,SAASjb,KAAK,mBAC5H,qBACA,iBACA,2EAA2EX,MAAMuN,KAAK8O,EAAQrB,QAAQra,KAAK,mBAC3G,kBACA,UAAUsuB,KACV,sEAAsEN,EAAahuB,KAAK,mBACxF,iEAAiEiuB,EAAQjuB,KAAK,mBAC9E,WAAWsuB,KACX,eACA,gBACA,cACAtuB,KAAK,KACT,CAzWSuuB,OADetU,GAA+BvC,EAAOhU,EAAQyG,EAAU9J,GAEhF"}
\ No newline at end of file
diff --git a/examples/creepingFlowScript/README.md b/examples/creepingFlowScript/README.md
index a7e0d7f..c8410f4 100644
--- a/examples/creepingFlowScript/README.md
+++ b/examples/creepingFlowScript/README.md
@@ -11,10 +11,6 @@ This directory contains Node.js examples demonstrating how to use the FEAScript
 
 This example solves a 2D lid-driven cavity flow using the creeping flow solver with Taylor-Hood (Q2-Q1) elements. For detailed information on the model setup, refer to the corresponding [tutorial](https://feascript.com/tutorials/lid-driven-cavity-2d-creeping-flow.html) on the FEAScript website.
 
-## HTML Examples
-
-Each example also includes an HTML variant (e.g., `lidDrivenCavity2DCreepingFlow.html`) that runs the same simulation in the browser with built-in visualization using Plotly.js. Simply open the HTML file in a web browser to run.
-
 ## Running the Node.js Examples
 
 #### 1. Create package.json with ES module support:
diff --git a/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.html b/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.html
deleted file mode 100644
index 2ce473c..0000000
--- a/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.html
+++ /dev/null
@@ -1,111 +0,0 @@
-<!DOCTYPE html>
-
-<!--
-  ════════════════════════════════════════════════════════════════
-   FEAScript Core Library
-   Lightweight Finite Element Simulation in JavaScript
-   Version: 0.2.0 | https://feascript.com
-   MIT License © 2023–2026 FEAScript
-  ════════════════════════════════════════════════════════════════
--->
-
-<html>
-  <head>
-    <title>FEAScript Example: Lid-Driven Cavity 2D Creeping Flow</title>
-    <meta charset="UTF-8" />
-    <!-- Link to the CSS files -->
-    <link href="https://feascript.com/feascript-website.css" rel="stylesheet" type="text/css" />
-    <link href="https://fonts.googleapis.com/css2?family=Roboto:wght@400;700&display=swap" rel="stylesheet" />
-    <!-- Import the Math.js library for mathematical operations -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjs/11.12.0/math.min.js"></script>
-    <!-- Import the Plotly.js library for plotting -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/plotly.js/2.35.3/plotly.min.js"></script>
-  </head>
-
-  <body>
-    <h2>Lid-Driven Cavity 2D Creeping Flow</h2>
-
-    <h3>Velocity Magnitude</h3>
-    <div id="velocityMagnitudeCanvas"></div>
-
-    <h3>u-Velocity Component</h3>
-    <div id="uVelocityCanvas"></div>
-
-    <h3>v-Velocity Component</h3>
-    <div id="vVelocityCanvas"></div>
-
-    <script type="module">
-      // Import FEAScript library
-      import { FEAScriptModel, plotSolution, printVersion } from "https://core.feascript.com/dist/feascript.esm.js";
-      // import { FEAScriptModel, plotSolution, printVersion } from "../../../src/index.js";
-
-      window.addEventListener("DOMContentLoaded", () => {
-        console.log("FEAScript Version:", printVersion);
-
-        // Create a new FEAScript model
-        const model = new FEAScriptModel();
-
-        // Select physics/PDE
-        model.setModelConfig("creepingFlowScript");
-
-        // Define mesh configuration
-        model.setMeshConfig({
-          meshDimension: "2D",
-          elementOrder: "quadratic",
-          numElementsX: 12,
-          numElementsY: 6,
-          maxX: 4,
-          maxY: 2,
-        });
-
-        // Define boundary conditions
-        model.addBoundaryCondition("0", ["constantVelocity", 0, 0]); // Bottom boundary
-        model.addBoundaryCondition("1", ["constantVelocity", 0, 0]); // Left boundary
-        model.addBoundaryCondition("2", ["constantVelocity", 1, 0]); // Top boundary
-        model.addBoundaryCondition("3", ["constantVelocity", 0, 0]); // Right boundary
-
-        // Set solver method
-        model.setSolverMethod("lusolve");
-
-        // Solve the problem
-        const result = model.solve();
-
-        // Print results to console
-        console.log(`Number of nodes in mesh: ${result.nodesCoordinates.nodesXCoordinates.length}`);
-        console.log("Solution vector:", result.solutionVector);
-
-        // Extract velocity and pressure fields from the solution vector
-        // DOF layout: [u₀…u_{N₂−1}, v₀…v_{N₂−1}, p₀…p_{N₁−1}]
-        const totalNodesVelocity = model._creepingFlowMetadata.totalNodesVelocity;
-        const solutionVector = result.solutionVector;
-        const uVelocity = solutionVector.slice(0, totalNodesVelocity);
-        const vVelocity = solutionVector.slice(totalNodesVelocity, 2 * totalNodesVelocity);
-        const velocityMagnitude = uVelocity.map((u, i) => Math.sqrt(u * u + vVelocity[i] * vVelocity[i]));
-
-        // Plot velocity magnitude as a 2D contour plot
-        plotSolution(
-          model,
-          { solutionVector: velocityMagnitude, nodesCoordinates: result.nodesCoordinates },
-          "contour",
-          "velocityMagnitudeCanvas"
-        );
-
-        // Plot u-velocity component as a 2D contour plot
-        plotSolution(
-          model,
-          { solutionVector: uVelocity, nodesCoordinates: result.nodesCoordinates },
-          "contour",
-          "uVelocityCanvas"
-        );
-
-        // Plot v-velocity component as a 2D contour plot
-        plotSolution(
-          model,
-          { solutionVector: vVelocity, nodesCoordinates: result.nodesCoordinates },
-          "contour",
-          "vVelocityCanvas"
-        );
-      });
-    </script>
-  </body>
-</html>
diff --git a/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.js b/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.js
index 67e0b72..d358640 100644
--- a/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.js
+++ b/examples/creepingFlowScript/lidDrivenCavity2DCreepingFlow/lidDrivenCavity2DCreepingFlow.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/examples/frontPropagationScript/README.md b/examples/frontPropagationScript/README.md
index 1e4998e..d831418 100644
--- a/examples/frontPropagationScript/README.md
+++ b/examples/frontPropagationScript/README.md
@@ -10,10 +10,6 @@ This directory contains Node.js examples demonstrating how to use the FEAScript
 
 This example demonstrates solving an eikonal equation in a 2D domain to track the movement of a solidification interface. For detailed information on the model setup, refer to the corresponding [tutorial](https://feascript.com/tutorials/solidification-front-2d.html) in the FEAScript website.
 
-## HTML Examples
-
-Each example also includes an HTML variant (e.g., `solidificationFront2D.html`) that runs the same simulation in the browser with built-in visualization using Plotly.js. Simply open the HTML file in a web browser to run.
-
 ## Running the Node.js Examples
 
 #### 1. Create package.json with ES module support:
diff --git a/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.html b/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.html
deleted file mode 100644
index f678c32..0000000
--- a/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.html
+++ /dev/null
@@ -1,76 +0,0 @@
-<!DOCTYPE html>
-
-<!--
-  ════════════════════════════════════════════════════════════════
-   FEAScript Core Library
-   Lightweight Finite Element Simulation in JavaScript
-   Version: 0.2.0 | https://feascript.com
-   MIT License © 2023–2026 FEAScript
-  ════════════════════════════════════════════════════════════════
--->
-
-<html>
-  <head>
-    <title>FEAScript Example: Solidification Front 2D</title>
-    <meta charset="UTF-8" />
-    <!-- Link to the CSS files -->
-    <link href="https://feascript.com/feascript-website.css" rel="stylesheet" type="text/css" />
-    <link href="https://fonts.googleapis.com/css2?family=Roboto:wght@400;700&display=swap" rel="stylesheet" />
-    <!-- Import the Math.js library for mathematical operations -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjs/11.12.0/math.min.js"></script>
-    <!-- Import the Plotly.js library for plotting -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/plotly.js/2.35.3/plotly.min.js"></script>
-  </head>
-
-  <body>
-    <h2>Solidification Front 2D</h2>
-
-    <!-- Container element where the solution plot will be rendered -->
-    <div id="resultsCanvas"></div>
-
-    <script type="module">
-      // Import FEAScript library
-      import { FEAScriptModel, plotSolution, printVersion } from "https://core.feascript.com/dist/feascript.esm.js";
-      // import { FEAScriptModel, plotSolution, printVersion } from "../../../src/index.js";
-
-      window.addEventListener("DOMContentLoaded", () => {
-        console.log("FEAScript Version:", printVersion);
-
-        // Create a new FEAScript model
-        const model = new FEAScriptModel();
-
-        // Select physics/PDE
-        model.setModelConfig("frontPropagationScript");
-
-        // Define mesh configuration
-        model.setMeshConfig({
-          meshDimension: "2D",
-          elementOrder: "quadratic",
-          numElementsX: 12,
-          numElementsY: 8,
-          maxX: 4,
-          maxY: 2,
-        });
-
-        // Define boundary conditions
-        model.addBoundaryCondition("0", ["constantValue", 0]); // Bottom boundary
-        model.addBoundaryCondition("1", ["constantValue", 0]); // Left boundary
-        model.addBoundaryCondition("2", ["zeroGradient"]); // Top boundary
-        model.addBoundaryCondition("3", ["constantValue", 0]); // Right boundary
-
-        // Set solver method
-        model.setSolverMethod("lusolve");
-
-        // Solve the problem
-        const result = model.solve();
-
-        // Print results to console
-        console.log(`Number of nodes in mesh: ${result.nodesCoordinates.nodesXCoordinates.length}`);
-        console.log("Solution vector:", result.solutionVector);
-
-        // Plot the solution as a 2D contour plot
-        plotSolution(model, result, "contour", "resultsCanvas");
-      });
-    </script>
-  </body>
-</html>
diff --git a/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.js b/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.js
index d1d511c..c476ab8 100644
--- a/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.js
+++ b/examples/frontPropagationScript/solidificationFront2D/solidificationFront2D.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/examples/generalFormPDEScript/README.md b/examples/generalFormPDEScript/README.md
index 54e062a..7ff59f8 100644
--- a/examples/generalFormPDEScript/README.md
+++ b/examples/generalFormPDEScript/README.md
@@ -10,10 +10,6 @@ This directory contains Node.js examples demonstrating how to use the FEAScript
 
 This example demonstrates solving a one-dimensional advection-diffusion problem with a Gaussian source term. The problem models the transport of a substance under the effects of both diffusion and advection. For detailed information on the model setup, refer to the corresponding [tutorial](https://feascript.com/tutorials/advection-diffusion-1d.html) in the FEAScript website.
 
-## HTML Examples
-
-Each example also includes an HTML variant (e.g., `advectionDiffusion1D.html`) that runs the same simulation in the browser with built-in visualization using Plotly.js. Simply open the HTML file in a web browser to run.
-
 ## Running the Node.js Examples
 
 #### 1. Create package.json with ES module support:
diff --git a/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.html b/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.html
deleted file mode 100644
index f4c1285..0000000
--- a/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.html
+++ /dev/null
@@ -1,80 +0,0 @@
-<!DOCTYPE html>
-
-<!--
-  ════════════════════════════════════════════════════════════════
-   FEAScript Core Library
-   Lightweight Finite Element Simulation in JavaScript
-   Version: 0.2.0 | https://feascript.com
-   MIT License © 2023–2026 FEAScript
-  ════════════════════════════════════════════════════════════════
--->
-
-<html>
-  <head>
-    <title>FEAScript Example: Advection-Diffusion 1D</title>
-    <meta charset="UTF-8" />
-    <!-- Link to the CSS files -->
-    <link href="https://feascript.com/feascript-website.css" rel="stylesheet" type="text/css" />
-    <link href="https://fonts.googleapis.com/css2?family=Roboto:wght@400;700&display=swap" rel="stylesheet" />
-    <!-- Import the Math.js library for mathematical operations -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjs/11.12.0/math.min.js"></script>
-    <!-- Import the Plotly.js library for plotting -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/plotly.js/2.35.3/plotly.min.js"></script>
-  </head>
-
-  <body>
-    <h2>Advection-Diffusion 1D</h2>
-
-    <!-- Container element where the solution plot will be rendered -->
-    <div id="resultsCanvas"></div>
-
-    <script type="module">
-      // Import FEAScript library
-      import { FEAScriptModel, plotSolution, printVersion } from "https://core.feascript.com/dist/feascript.esm.js";
-      // import { FEAScriptModel, plotSolution, printVersion } from "../../../src/index.js";
-
-      window.addEventListener("DOMContentLoaded", () => {
-        console.log("FEAScript Version:", printVersion);
-
-        // Create a new FEAScript model
-        const model = new FEAScriptModel();
-
-        // Select physics/PDE
-        model.setModelConfig("generalFormPDEScript", {
-          coefficientFunctions: {
-            // Equation d²u/dx² - 10 du/dx = 10 * exp(-200 * (x - 0.5)²)
-            A: (x) => 1, // Diffusion coefficient
-            B: (x) => -10, // Advection coefficient
-            C: (x) => 0, // Reaction coefficient
-            D: (x) => 10 * Math.exp(-200 * Math.pow(x - 0.5, 2)), // Source term
-          },
-        });
-
-        // Define mesh configuration
-        model.setMeshConfig({
-          meshDimension: "1D",
-          elementOrder: "quadratic",
-          numElementsX: 20,
-          maxX: 1.0,
-        });
-
-        // Define boundary conditions
-        model.addBoundaryCondition("0", ["constantValue", 1]); // Left boundary
-        model.addBoundaryCondition("1", "zeroGradient"); // Right boundary
-
-        // Set solver method
-        model.setSolverMethod("lusolve");
-
-        // Solve the problem
-        const result = model.solve();
-
-        // Print results to console
-        console.log(`Number of nodes in mesh: ${result.nodesCoordinates.nodesXCoordinates.length}`);
-        console.log("Solution vector:", result.solutionVector);
-
-        // Plot the solution as a 1D line plot
-        plotSolution(model, result, "line", "resultsCanvas");
-      });
-    </script>
-  </body>
-</html>
diff --git a/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.js b/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.js
index edb74fa..2825598 100644
--- a/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.js
+++ b/examples/generalFormPDEScript/advectionDiffusion1D/advectionDiffusion1D.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/examples/heatConductionScript/README.md b/examples/heatConductionScript/README.md
index 8fe27af..5a68193 100644
--- a/examples/heatConductionScript/README.md
+++ b/examples/heatConductionScript/README.md
@@ -28,10 +28,6 @@ Implementation using a Gmsh-generated mesh for a rhomboid domain (the mesh file,
 
 For detailed information on the model setup, refer to the corresponding [tutorial](https://feascript.com/tutorials/heat-conduction-2d-rhom-fin-gmsh.html) in the FEAScript website.
 
-## HTML Examples
-
-Each example also includes an HTML variant (e.g., `heatConduction1DWall.html`, `heatConduction2DFin.html`) that runs the same simulation in the browser with built-in visualization using Plotly.js. Simply open the HTML file in a web browser to run.
-
 ## Running the Node.js Examples
 
 #### 1. Create package.json with ES module support:
diff --git a/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.html b/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.html
deleted file mode 100644
index 7457f25..0000000
--- a/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.html
+++ /dev/null
@@ -1,72 +0,0 @@
-<!DOCTYPE html>
-
-<!--
-  ════════════════════════════════════════════════════════════════
-   FEAScript Core Library
-   Lightweight Finite Element Simulation in JavaScript
-   Version: 0.2.0 | https://feascript.com
-   MIT License © 2023–2026 FEAScript
-  ════════════════════════════════════════════════════════════════
--->
-
-<html>
-  <head>
-    <title>FEAScript Example: Heat Conduction 1D Wall</title>
-    <meta charset="UTF-8" />
-    <!-- Link to the CSS files -->
-    <link href="https://feascript.com/feascript-website.css" rel="stylesheet" type="text/css" />
-    <link href="https://fonts.googleapis.com/css2?family=Roboto:wght@400;700&display=swap" rel="stylesheet" />
-    <!-- Import the Math.js library for mathematical operations -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjs/11.12.0/math.min.js"></script>
-    <!-- Import the Plotly.js library for plotting -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/plotly.js/2.35.3/plotly.min.js"></script>
-  </head>
-
-  <body>
-    <h2>Heat Conduction 1D Wall</h2>
-
-    <!-- Container element where the solution plot will be rendered -->
-    <div id="resultsCanvas"></div>
-
-    <script type="module">
-      // Import FEAScript library
-      import { FEAScriptModel, plotSolution, printVersion } from "https://core.feascript.com/dist/feascript.esm.js";
-      // import { FEAScriptModel, plotSolution, printVersion } from "../../../src/index.js";
-
-      window.addEventListener("DOMContentLoaded", () => {
-        console.log("FEAScript Version:", printVersion);
-
-        // Create a new FEAScript model
-        const model = new FEAScriptModel();
-
-        // Select physics/PDE
-        model.setModelConfig("heatConductionScript");
-
-        // Define mesh configuration
-        model.setMeshConfig({
-          meshDimension: "1D",
-          elementOrder: "linear",
-          numElementsX: 10,
-          maxX: 0.15,
-        });
-
-        // Define boundary conditions
-        model.addBoundaryCondition("0", ["convection", 1, 25]); // Left boundary
-        model.addBoundaryCondition("1", ["constantTemp", 5]); // Right boundary
-
-        // Set solver method
-        model.setSolverMethod("lusolve");
-
-        // Solve the problem
-        const result = model.solve();
-
-        // Print results to console
-        console.log(`Number of nodes: ${result.nodesCoordinates.nodesXCoordinates.length}`);
-        console.log("Solution vector:", result.solutionVector);
-
-        // Plot the solution as a 1D line plot
-        plotSolution(model, result, "line", "resultsCanvas");
-      });
-    </script>
-  </body>
-</html>
diff --git a/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.js b/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.js
index 226968b..eb5eeb3 100644
--- a/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.js
+++ b/examples/heatConductionScript/heatConduction1DWall/heatConduction1DWall.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.html b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.html
deleted file mode 100644
index 5094e23..0000000
--- a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.html
+++ /dev/null
@@ -1,76 +0,0 @@
-<!DOCTYPE html>
-
-<!--
-  ════════════════════════════════════════════════════════════════
-   FEAScript Core Library
-   Lightweight Finite Element Simulation in JavaScript
-   Version: 0.2.0 | https://feascript.com
-   MIT License © 2023–2026 FEAScript
-  ════════════════════════════════════════════════════════════════
--->
-
-<html>
-  <head>
-    <title>FEAScript Example: Heat Conduction 2D Fin</title>
-    <meta charset="UTF-8" />
-    <!-- Link to the CSS files -->
-    <link href="https://feascript.com/feascript-website.css" rel="stylesheet" type="text/css" />
-    <link href="https://fonts.googleapis.com/css2?family=Roboto:wght@400;700&display=swap" rel="stylesheet" />
-    <!-- Import the Math.js library for mathematical operations -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/mathjs/11.12.0/math.min.js"></script>
-    <!-- Import the Plotly.js library for plotting -->
-    <script src="https://cdnjs.cloudflare.com/ajax/libs/plotly.js/2.35.3/plotly.min.js"></script>
-  </head>
-
-  <body>
-    <h2>Heat Conduction 2D Fin</h2>
-
-    <!-- Container element where the solution plot will be rendered -->
-    <div id="resultsCanvas"></div>
-
-    <script type="module">
-      // Import FEAScript library
-      import { FEAScriptModel, plotSolution, printVersion } from "https://core.feascript.com/dist/feascript.esm.js";
-      // import { FEAScriptModel, plotSolution, printVersion } from "../../../src/index.js";
-
-      window.addEventListener("DOMContentLoaded", () => {
-        console.log("FEAScript Version:", printVersion);
-
-        // Create a new FEAScript model
-        const model = new FEAScriptModel();
-
-        // Select physics/PDE
-        model.setModelConfig("heatConductionScript");
-
-        // Define mesh configuration
-        model.setMeshConfig({
-          meshDimension: "2D",
-          elementOrder: "quadratic",
-          numElementsX: 8,
-          numElementsY: 4,
-          maxX: 4,
-          maxY: 2,
-        });
-
-        // Define boundary conditions
-        model.addBoundaryCondition("0", ["constantTemp", 200]); // Bottom boundary
-        model.addBoundaryCondition("1", ["symmetry"]); // Left boundary
-        model.addBoundaryCondition("2", ["convection", 1, 20]); // Top boundary
-        model.addBoundaryCondition("3", ["constantTemp", 200]); // Right boundary
-
-        // Set solver method
-        model.setSolverMethod("lusolve");
-
-        // Solve the problem
-        const result = model.solve();
-
-        // Print results to console
-        console.log(`Number of nodes in mesh: ${result.nodesCoordinates.nodesXCoordinates.length}`);
-        console.log("Solution vector:", result.solutionVector);
-
-        // Plot the solution as a 2D contour plot
-        plotSolution(model, result, "contour", "resultsCanvas");
-      });
-    </script>
-  </body>
-</html>
diff --git a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.js b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.js
index 07da4b6..f33054a 100644
--- a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.js
+++ b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFin.js
@@ -2,14 +2,14 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
 
 // Import Math.js
 import * as math from "mathjs";
-global.math = math;
+globalThis.math = math;
 
 // Import FEAScript library
 import { FEAScriptModel, printVersion } from "feascript";
diff --git a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFinGmsh.js b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFinGmsh.js
index f24041a..3ce6adf 100644
--- a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFinGmsh.js
+++ b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DFinGmsh.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DRhomFinGmsh.js b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DRhomFinGmsh.js
index 570846b..075f9b2 100644
--- a/examples/heatConductionScript/heatConduction2DFin/heatConduction2DRhomFinGmsh.js
+++ b/examples/heatConductionScript/heatConduction2DFin/heatConduction2DRhomFinGmsh.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/package-lock.json b/package-lock.json
index 44beeec..5ebbf7b 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,14 +1,15 @@
 {
   "name": "feascript",
-  "version": "0.2.0 (RC)",
+  "version": "0.3.0-RC",
   "lockfileVersion": 3,
   "requires": true,
   "packages": {
     "": {
       "name": "feascript",
-      "version": "0.2.0 (RC)",
+      "version": "0.3.0-RC",
       "license": "MIT",
       "devDependencies": {
+        "@kitware/vtk.js": "^32.12.0",
         "@rollup/plugin-commonjs": "^28.0.3",
         "@rollup/plugin-node-resolve": "^16.0.1",
         "mathjs": "^11.12.0",
@@ -19,41 +20,1738 @@
         "taichi.js": "^0.0.36"
       },
       "peerDependencies": {
+        "@kitware/vtk.js": "^32.12.0",
         "mathjs": "^11.12.0",
         "plotly.js": "^2.35.3"
+      },
+      "peerDependenciesMeta": {
+        "@kitware/vtk.js": {
+          "optional": true
+        },
+        "plotly.js": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@babel/code-frame": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.29.0.tgz",
+      "integrity": "sha512-9NhCeYjq9+3uxgdtp20LSiJXJvN0FeCtNGpJxuMFZ1Kv3cWUNb6DOhJwUvcVCzKGR66cw4njwM6hrJLqgOwbcw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@babel/helper-validator-identifier": "^7.28.5",
+        "js-tokens": "^4.0.0",
+        "picocolors": "^1.1.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/compat-data": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/compat-data/-/compat-data-7.29.0.tgz",
+      "integrity": "sha512-T1NCJqT/j9+cn8fvkt7jtwbLBfLC/1y1c7NtCeXFRgzGTsafi68MRv8yzkYSapBnFA6L3U2VSc02ciDzoAJhJg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/core": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/core/-/core-7.29.0.tgz",
+      "integrity": "sha512-CGOfOJqWjg2qW/Mb6zNsDm+u5vFQ8DxXfbM09z69p5Z6+mE1ikP2jUXw+j42Pf1XTYED2Rni5f95npYeuwMDQA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/code-frame": "^7.29.0",
+        "@babel/generator": "^7.29.0",
+        "@babel/helper-compilation-targets": "^7.28.6",
+        "@babel/helper-module-transforms": "^7.28.6",
+        "@babel/helpers": "^7.28.6",
+        "@babel/parser": "^7.29.0",
+        "@babel/template": "^7.28.6",
+        "@babel/traverse": "^7.29.0",
+        "@babel/types": "^7.29.0",
+        "@jridgewell/remapping": "^2.3.5",
+        "convert-source-map": "^2.0.0",
+        "debug": "^4.1.0",
+        "gensync": "^1.0.0-beta.2",
+        "json5": "^2.2.3",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/babel"
+      }
+    },
+    "node_modules/@babel/core/node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@babel/core/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/generator": {
+      "version": "7.29.1",
+      "resolved": "https://registry.npmjs.org/@babel/generator/-/generator-7.29.1.tgz",
+      "integrity": "sha512-qsaF+9Qcm2Qv8SRIMMscAvG4O3lJ0F1GuMo5HR/Bp02LopNgnZBC/EkbevHFeGs4ls/oPz9v+Bsmzbkbe+0dUw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/parser": "^7.29.0",
+        "@babel/types": "^7.29.0",
+        "@jridgewell/gen-mapping": "^0.3.12",
+        "@jridgewell/trace-mapping": "^0.3.28",
+        "jsesc": "^3.0.2"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-annotate-as-pure": {
+      "version": "7.27.3",
+      "resolved": "https://registry.npmjs.org/@babel/helper-annotate-as-pure/-/helper-annotate-as-pure-7.27.3.tgz",
+      "integrity": "sha512-fXSwMQqitTGeHLBC08Eq5yXz2m37E4pJX1qAU1+2cNedz/ifv/bVXft90VeSav5nFO61EcNgwr0aJxbyPaWBPg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/types": "^7.27.3"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-compilation-targets": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-compilation-targets/-/helper-compilation-targets-7.28.6.tgz",
+      "integrity": "sha512-JYtls3hqi15fcx5GaSNL7SCTJ2MNmjrkHXg4FSpOA/grxK8KwyZ5bubHsCq8FXCkua6xhuaaBit+3b7+VZRfcA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/compat-data": "^7.28.6",
+        "@babel/helper-validator-option": "^7.27.1",
+        "browserslist": "^4.24.0",
+        "lru-cache": "^5.1.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-compilation-targets/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-create-class-features-plugin": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-create-class-features-plugin/-/helper-create-class-features-plugin-7.28.6.tgz",
+      "integrity": "sha512-dTOdvsjnG3xNT9Y0AUg1wAl38y+4Rl4sf9caSQZOXdNqVn+H+HbbJ4IyyHaIqNR6SW9oJpA/RuRjsjCw2IdIow==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.27.3",
+        "@babel/helper-member-expression-to-functions": "^7.28.5",
+        "@babel/helper-optimise-call-expression": "^7.27.1",
+        "@babel/helper-replace-supers": "^7.28.6",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.27.1",
+        "@babel/traverse": "^7.28.6",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-create-class-features-plugin/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-create-regexp-features-plugin": {
+      "version": "7.28.5",
+      "resolved": "https://registry.npmjs.org/@babel/helper-create-regexp-features-plugin/-/helper-create-regexp-features-plugin-7.28.5.tgz",
+      "integrity": "sha512-N1EhvLtHzOvj7QQOUCCS3NrPJP8c5W6ZXCHDn7Yialuy1iu4r5EmIYkXlKNqT99Ciw+W0mDqWoR6HWMZlFP3hw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.27.3",
+        "regexpu-core": "^6.3.1",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-create-regexp-features-plugin/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/helper-define-polyfill-provider": {
+      "version": "0.6.8",
+      "resolved": "https://registry.npmjs.org/@babel/helper-define-polyfill-provider/-/helper-define-polyfill-provider-0.6.8.tgz",
+      "integrity": "sha512-47UwBLPpQi1NoWzLuHNjRoHlYXMwIJoBf7MFou6viC/sIHWYygpvr0B6IAyh5sBdA2nr2LPIRww8lfaUVQINBA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "debug": "^4.4.3",
+        "lodash.debounce": "^4.0.8",
+        "resolve": "^1.22.11"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/@babel/helper-define-polyfill-provider/node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@babel/helper-globals": {
+      "version": "7.28.0",
+      "resolved": "https://registry.npmjs.org/@babel/helper-globals/-/helper-globals-7.28.0.tgz",
+      "integrity": "sha512-+W6cISkXFa1jXsDEdYA8HeevQT/FULhxzR99pxphltZcVaugps53THCeiWA8SguxxpSp3gKPiuYfSWopkLQ4hw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-member-expression-to-functions": {
+      "version": "7.28.5",
+      "resolved": "https://registry.npmjs.org/@babel/helper-member-expression-to-functions/-/helper-member-expression-to-functions-7.28.5.tgz",
+      "integrity": "sha512-cwM7SBRZcPCLgl8a7cY0soT1SptSzAlMH39vwiRpOQkJlh53r5hdHwLSCZpQdVLT39sZt+CRpNwYG4Y2v77atg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/traverse": "^7.28.5",
+        "@babel/types": "^7.28.5"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-module-imports": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-module-imports/-/helper-module-imports-7.28.6.tgz",
+      "integrity": "sha512-l5XkZK7r7wa9LucGw9LwZyyCUscb4x37JWTPz7swwFE/0FMQAGpiWUZn8u9DzkSBWEcK25jmvubfpw2dnAMdbw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/traverse": "^7.28.6",
+        "@babel/types": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-module-transforms": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-module-transforms/-/helper-module-transforms-7.28.6.tgz",
+      "integrity": "sha512-67oXFAYr2cDLDVGLXTEABjdBJZ6drElUSI7WKp70NrpyISso3plG9SAGEF6y7zbha/wOzUByWWTJvEDVNIUGcA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-imports": "^7.28.6",
+        "@babel/helper-validator-identifier": "^7.28.5",
+        "@babel/traverse": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-optimise-call-expression": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-optimise-call-expression/-/helper-optimise-call-expression-7.27.1.tgz",
+      "integrity": "sha512-URMGH08NzYFhubNSGJrpUEphGKQwMQYBySzat5cAByY1/YgIRkULnIy3tAMeszlL/so2HbeilYloUmSpd7GdVw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/types": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-plugin-utils": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-plugin-utils/-/helper-plugin-utils-7.28.6.tgz",
+      "integrity": "sha512-S9gzZ/bz83GRysI7gAD4wPT/AI3uCnY+9xn+Mx/KPs2JwHJIz1W8PZkg2cqyt3RNOBM8ejcXhV6y8Og7ly/Dug==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-remap-async-to-generator": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-remap-async-to-generator/-/helper-remap-async-to-generator-7.27.1.tgz",
+      "integrity": "sha512-7fiA521aVw8lSPeI4ZOD3vRFkoqkJcS+z4hFo82bFSH/2tNd6eJ5qCVMS5OzDmZh/kaHQeBaeyxK6wljcPtveA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.27.1",
+        "@babel/helper-wrap-function": "^7.27.1",
+        "@babel/traverse": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-replace-supers": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-replace-supers/-/helper-replace-supers-7.28.6.tgz",
+      "integrity": "sha512-mq8e+laIk94/yFec3DxSjCRD2Z0TAjhVbEJY3UQrlwVo15Lmt7C2wAUbK4bjnTs4APkwsYLTahXRraQXhb1WCg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-member-expression-to-functions": "^7.28.5",
+        "@babel/helper-optimise-call-expression": "^7.27.1",
+        "@babel/traverse": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/helper-skip-transparent-expression-wrappers": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-skip-transparent-expression-wrappers/-/helper-skip-transparent-expression-wrappers-7.27.1.tgz",
+      "integrity": "sha512-Tub4ZKEXqbPjXgWLl2+3JpQAYBJ8+ikpQ2Ocj/q/r0LwE3UhENh7EUabyHjz2kCEsrRY83ew2DQdHluuiDQFzg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/traverse": "^7.27.1",
+        "@babel/types": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-string-parser": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-string-parser/-/helper-string-parser-7.27.1.tgz",
+      "integrity": "sha512-qMlSxKbpRlAridDExk92nSobyDdpPijUq2DW6oDnUqd0iOGxmQjyqhMIihI9+zv4LPyZdRje2cavWPbCbWm3eA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-validator-identifier": {
+      "version": "7.28.5",
+      "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.28.5.tgz",
+      "integrity": "sha512-qSs4ifwzKJSV39ucNjsvc6WVHs6b7S03sOh2OcHF9UHfVPqWWALUsNUVzhSBiItjRZoLHx7nIarVjqKVusUZ1Q==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-validator-option": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/helper-validator-option/-/helper-validator-option-7.27.1.tgz",
+      "integrity": "sha512-YvjJow9FxbhFFKDSuFnVCe2WxXk1zWc22fFePVNEaWJEu8IrZVlda6N0uHwzZrUM1il7NC9Mlp4MaJYbYd9JSg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helper-wrap-function": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/helper-wrap-function/-/helper-wrap-function-7.28.6.tgz",
+      "integrity": "sha512-z+PwLziMNBeSQJonizz2AGnndLsP2DeGHIxDAn+wdHOGuo4Fo1x1HBPPXeE9TAOPHNNWQKCSlA2VZyYyyibDnQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/template": "^7.28.6",
+        "@babel/traverse": "^7.28.6",
+        "@babel/types": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/helpers": {
+      "version": "7.29.2",
+      "resolved": "https://registry.npmjs.org/@babel/helpers/-/helpers-7.29.2.tgz",
+      "integrity": "sha512-HoGuUs4sCZNezVEKdVcwqmZN8GoHirLUcLaYVNBK2J0DadGtdcqgr3BCbvH8+XUo4NGjNl3VOtSjEKNzqfFgKw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/template": "^7.28.6",
+        "@babel/types": "^7.29.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@babel/parser": {
+      "version": "7.29.2",
+      "resolved": "https://registry.npmjs.org/@babel/parser/-/parser-7.29.2.tgz",
+      "integrity": "sha512-4GgRzy/+fsBa72/RZVJmGKPmZu9Byn8o4MoLpmNe1m8ZfYnz5emHLQz3U4gLud6Zwl0RZIcgiLD7Uq7ySFuDLA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/types": "^7.29.0"
+      },
+      "bin": {
+        "parser": "bin/babel-parser.js"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-firefox-class-in-computed-class-key": {
+      "version": "7.28.5",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-firefox-class-in-computed-class-key/-/plugin-bugfix-firefox-class-in-computed-class-key-7.28.5.tgz",
+      "integrity": "sha512-87GDMS3tsmMSi/3bWOte1UblL+YUTFMV8SZPZ2eSEL17s74Cw/l63rR6NmGVKMYW2GYi85nE+/d6Hw5N0bEk2Q==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/traverse": "^7.28.5"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-safari-class-field-initializer-scope": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-class-field-initializer-scope/-/plugin-bugfix-safari-class-field-initializer-scope-7.27.1.tgz",
+      "integrity": "sha512-qNeq3bCKnGgLkEXUuFry6dPlGfCdQNZbn7yUAPCInwAJHMU7THJfrBSozkcWq5sNM6RcF3S8XyQL2A52KNR9IA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression/-/plugin-bugfix-safari-id-destructuring-collision-in-function-expression-7.27.1.tgz",
+      "integrity": "sha512-g4L7OYun04N1WyqMNjldFwlfPCLVkgB54A/YCXICZYBsvJJE3kByKv9c9+R/nAfmIfjl2rKYLNyMHboYbZaWaA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining/-/plugin-bugfix-v8-spread-parameters-in-optional-chaining-7.27.1.tgz",
+      "integrity": "sha512-oO02gcONcD5O1iTLi/6frMJBIwWEHceWGSGqrpCmEL8nogiS6J9PBlE48CaK20/Jx1LuRml9aDftLgdjXT8+Cw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.27.1",
+        "@babel/plugin-transform-optional-chaining": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.13.0"
+      }
+    },
+    "node_modules/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly/-/plugin-bugfix-v8-static-class-fields-redefine-readonly-7.28.6.tgz",
+      "integrity": "sha512-a0aBScVTlNaiUe35UtfxAN7A/tehvvG4/ByO6+46VPKTRSlfnAFsgKy0FUh+qAkQrDTmhDkT+IBOKlOoMUxQ0g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/traverse": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-proposal-private-property-in-object": {
+      "version": "7.21.0-placeholder-for-preset-env.2",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-proposal-private-property-in-object/-/plugin-proposal-private-property-in-object-7.21.0-placeholder-for-preset-env.2.tgz",
+      "integrity": "sha512-SOSkfJDddaM7mak6cPEpswyTRnuRltl429hMraQEglW+OkovnCzsiszTmsrlY//qLFjCpQDFRvjdm2wA5pPm9w==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-import-assertions": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-assertions/-/plugin-syntax-import-assertions-7.28.6.tgz",
+      "integrity": "sha512-pSJUpFHdx9z5nqTSirOCMtYVP2wFgoWhP0p3g8ONK/4IHhLIBd0B9NYqAvIUAhq+OkhO4VM1tENCt0cjlsNShw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-import-attributes": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-import-attributes/-/plugin-syntax-import-attributes-7.28.6.tgz",
+      "integrity": "sha512-jiLC0ma9XkQT3TKJ9uYvlakm66Pamywo+qwL+oL8HJOvc6TWdZXVfhqJr8CCzbSGUAbDOzlGHJC1U+vRfLQDvw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-syntax-unicode-sets-regex": {
+      "version": "7.18.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-syntax-unicode-sets-regex/-/plugin-syntax-unicode-sets-regex-7.18.6.tgz",
+      "integrity": "sha512-727YkEAPwSIQTv5im8QHz3upqp92JTWhidIC81Tdx4VJYIte/VndKf1qKrfnnhPLiPghStWfvC/iFaMCQu7Nqg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.18.6",
+        "@babel/helper-plugin-utils": "^7.18.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-arrow-functions": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-arrow-functions/-/plugin-transform-arrow-functions-7.27.1.tgz",
+      "integrity": "sha512-8Z4TGic6xW70FKThA5HYEKKyBpOOsucTOD1DjU3fZxDg+K3zBJcXMFnt/4yQiZnf5+MiOMSXQ9PaEK/Ilh1DeA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-async-generator-functions": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-generator-functions/-/plugin-transform-async-generator-functions-7.29.0.tgz",
+      "integrity": "sha512-va0VdWro4zlBr2JsXC+ofCPB2iG12wPtVGTWFx2WLDOM3nYQZZIGP82qku2eW/JR83sD+k2k+CsNtyEbUqhU6w==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-remap-async-to-generator": "^7.27.1",
+        "@babel/traverse": "^7.29.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-async-to-generator": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-async-to-generator/-/plugin-transform-async-to-generator-7.28.6.tgz",
+      "integrity": "sha512-ilTRcmbuXjsMmcZ3HASTe4caH5Tpo93PkTxF9oG2VZsSWsahydmcEHhix9Ik122RcTnZnUzPbmux4wh1swfv7g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-imports": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-remap-async-to-generator": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-block-scoped-functions": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoped-functions/-/plugin-transform-block-scoped-functions-7.27.1.tgz",
+      "integrity": "sha512-cnqkuOtZLapWYZUYM5rVIdv1nXYuFVIltZ6ZJ7nIj585QsjKM5dhL2Fu/lICXZ1OyIAFc7Qy+bvDAtTXqGrlhg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-block-scoping": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-block-scoping/-/plugin-transform-block-scoping-7.28.6.tgz",
+      "integrity": "sha512-tt/7wOtBmwHPNMPu7ax4pdPz6shjFrmHDghvNC+FG9Qvj7D6mJcoRQIF5dy4njmxR941l6rgtvfSB2zX3VlUIw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-class-properties": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-properties/-/plugin-transform-class-properties-7.28.6.tgz",
+      "integrity": "sha512-dY2wS3I2G7D697VHndN91TJr8/AAfXQNt5ynCTI/MpxMsSzHp+52uNivYT5wCPax3whc47DR8Ba7cmlQMg24bw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-class-static-block": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-class-static-block/-/plugin-transform-class-static-block-7.28.6.tgz",
+      "integrity": "sha512-rfQ++ghVwTWTqQ7w8qyDxL1XGihjBss4CmTgGRCTAC9RIbhVpyp4fOeZtta0Lbf+dTNIVJer6ych2ibHwkZqsQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.12.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-classes": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-classes/-/plugin-transform-classes-7.28.6.tgz",
+      "integrity": "sha512-EF5KONAqC5zAqT783iMGuM2ZtmEBy+mJMOKl2BCvPZ2lVrwvXnB6o+OBWCS+CoeCCpVRF2sA2RBKUxvT8tQT5Q==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.27.3",
+        "@babel/helper-compilation-targets": "^7.28.6",
+        "@babel/helper-globals": "^7.28.0",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-replace-supers": "^7.28.6",
+        "@babel/traverse": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-computed-properties": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-computed-properties/-/plugin-transform-computed-properties-7.28.6.tgz",
+      "integrity": "sha512-bcc3k0ijhHbc2lEfpFHgx7eYw9KNXqOerKWfzbxEHUGKnS3sz9C4CNL9OiFN1297bDNfUiSO7DaLzbvHQQQ1BQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/template": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-destructuring": {
+      "version": "7.28.5",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-destructuring/-/plugin-transform-destructuring-7.28.5.tgz",
+      "integrity": "sha512-Kl9Bc6D0zTUcFUvkNuQh4eGXPKKNDOJQXVyyM4ZAQPMveniJdxi8XMJwLo+xSoW3MIq81bD33lcUe9kZpl0MCw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/traverse": "^7.28.5"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-dotall-regex": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dotall-regex/-/plugin-transform-dotall-regex-7.28.6.tgz",
+      "integrity": "sha512-SljjowuNKB7q5Oayv4FoPzeB74g3QgLt8IVJw9ADvWy3QnUb/01aw8I4AVv8wYnPvQz2GDDZ/g3GhcNyDBI4Bg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-duplicate-keys": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-keys/-/plugin-transform-duplicate-keys-7.27.1.tgz",
+      "integrity": "sha512-MTyJk98sHvSs+cvZ4nOauwTTG1JeonDjSGvGGUNHreGQns+Mpt6WX/dVzWBHgg+dYZhkC4X+zTDfkTU+Vy9y7Q==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-duplicate-named-capturing-groups-regex": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-duplicate-named-capturing-groups-regex/-/plugin-transform-duplicate-named-capturing-groups-regex-7.29.0.tgz",
+      "integrity": "sha512-zBPcW2lFGxdiD8PUnPwJjag2J9otbcLQzvbiOzDxpYXyCuYX9agOwMPGn1prVH0a4qzhCKu24rlH4c1f7yA8rw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-dynamic-import": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-dynamic-import/-/plugin-transform-dynamic-import-7.27.1.tgz",
+      "integrity": "sha512-MHzkWQcEmjzzVW9j2q8LGjwGWpG2mjwaaB0BNQwst3FIjqsg8Ct/mIZlvSPJvfi9y2AC8mi/ktxbFVL9pZ1I4A==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-explicit-resource-management": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-explicit-resource-management/-/plugin-transform-explicit-resource-management-7.28.6.tgz",
+      "integrity": "sha512-Iao5Konzx2b6g7EPqTy40UZbcdXE126tTxVFr/nAIj+WItNxjKSYTEw3RC+A2/ZetmdJsgueL1KhaMCQHkLPIg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/plugin-transform-destructuring": "^7.28.5"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-exponentiation-operator": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-exponentiation-operator/-/plugin-transform-exponentiation-operator-7.28.6.tgz",
+      "integrity": "sha512-WitabqiGjV/vJ0aPOLSFfNY1u9U3R7W36B03r5I2KoNix+a3sOhJ3pKFB3R5It9/UiK78NiO0KE9P21cMhlPkw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-export-namespace-from": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-export-namespace-from/-/plugin-transform-export-namespace-from-7.27.1.tgz",
+      "integrity": "sha512-tQvHWSZ3/jH2xuq/vZDy0jNn+ZdXJeM8gHvX4lnJmsc3+50yPlWdZXIc5ay+umX+2/tJIqHqiEqcJvxlmIvRvQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-for-of": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-for-of/-/plugin-transform-for-of-7.27.1.tgz",
+      "integrity": "sha512-BfbWFFEJFQzLCQ5N8VocnCtA8J1CLkNTe2Ms2wocj75dd6VpiqS5Z5quTYcUoo4Yq+DN0rtikODccuv7RU81sw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-function-name": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-function-name/-/plugin-transform-function-name-7.27.1.tgz",
+      "integrity": "sha512-1bQeydJF9Nr1eBCMMbC+hdwmRlsv5XYOMu03YSWFwNs0HsAmtSxxF1fyuYPqemVldVyFmlCU7w8UE14LupUSZQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.27.1",
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/traverse": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-json-strings": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-json-strings/-/plugin-transform-json-strings-7.28.6.tgz",
+      "integrity": "sha512-Nr+hEN+0geQkzhbdgQVPoqr47lZbm+5fCUmO70722xJZd0Mvb59+33QLImGj6F+DkK3xgDi1YVysP8whD6FQAw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-literals": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-literals/-/plugin-transform-literals-7.27.1.tgz",
+      "integrity": "sha512-0HCFSepIpLTkLcsi86GG3mTUzxV5jpmbv97hTETW3yzrAij8aqlD36toB1D0daVFJM8NK6GvKO0gslVQmm+zZA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-logical-assignment-operators": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-logical-assignment-operators/-/plugin-transform-logical-assignment-operators-7.28.6.tgz",
+      "integrity": "sha512-+anKKair6gpi8VsM/95kmomGNMD0eLz1NQ8+Pfw5sAwWH9fGYXT50E55ZpV0pHUHWf6IUTWPM+f/7AAff+wr9A==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-member-expression-literals": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-member-expression-literals/-/plugin-transform-member-expression-literals-7.27.1.tgz",
+      "integrity": "sha512-hqoBX4dcZ1I33jCSWcXrP+1Ku7kdqXf1oeah7ooKOIiAdKQ+uqftgCFNOSzA5AMS2XIHEYeGFg4cKRCdpxzVOQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-amd": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-amd/-/plugin-transform-modules-amd-7.27.1.tgz",
+      "integrity": "sha512-iCsytMg/N9/oFq6n+gFTvUYDZQOMK5kEdeYxmxt91fcJGycfxVP9CnrxoliM0oumFERba2i8ZtwRUCMhvP1LnA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.27.1",
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-commonjs": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-commonjs/-/plugin-transform-modules-commonjs-7.28.6.tgz",
+      "integrity": "sha512-jppVbf8IV9iWWwWTQIxJMAJCWBuuKx71475wHwYytrRGQ2CWiDvYlADQno3tcYpS/T2UUWFQp3nVtYfK/YBQrA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-systemjs": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-systemjs/-/plugin-transform-modules-systemjs-7.29.0.tgz",
+      "integrity": "sha512-PrujnVFbOdUpw4UHiVwKvKRLMMic8+eC0CuNlxjsyZUiBjhFdPsewdXCkveh2KqBA9/waD0W1b4hXSOBQJezpQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-validator-identifier": "^7.28.5",
+        "@babel/traverse": "^7.29.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-modules-umd": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-modules-umd/-/plugin-transform-modules-umd-7.27.1.tgz",
+      "integrity": "sha512-iQBE/xC5BV1OxJbp6WG7jq9IWiD+xxlZhLrdwpPkTX3ydmXdvoCpyfJN7acaIBZaOqTfr76pgzqBJflNbeRK+w==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-module-transforms": "^7.27.1",
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-named-capturing-groups-regex": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-named-capturing-groups-regex/-/plugin-transform-named-capturing-groups-regex-7.29.0.tgz",
+      "integrity": "sha512-1CZQA5KNAD6ZYQLPw7oi5ewtDNxH/2vuCh+6SmvgDfhumForvs8a1o9n0UrEoBD8HU4djO2yWngTQlXl1NDVEQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-new-target": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-new-target/-/plugin-transform-new-target-7.27.1.tgz",
+      "integrity": "sha512-f6PiYeqXQ05lYq3TIfIDu/MtliKUbNwkGApPUvyo6+tc7uaR4cPjPe7DFPr15Uyycg2lZU6btZ575CuQoYh7MQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-nullish-coalescing-operator": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-nullish-coalescing-operator/-/plugin-transform-nullish-coalescing-operator-7.28.6.tgz",
+      "integrity": "sha512-3wKbRgmzYbw24mDJXT7N+ADXw8BC/imU9yo9c9X9NKaLF1fW+e5H1U5QjMUBe4Qo4Ox/o++IyUkl1sVCLgevKg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-numeric-separator": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-numeric-separator/-/plugin-transform-numeric-separator-7.28.6.tgz",
+      "integrity": "sha512-SJR8hPynj8outz+SlStQSwvziMN4+Bq99it4tMIf5/Caq+3iOc0JtKyse8puvyXkk3eFRIA5ID/XfunGgO5i6w==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-object-rest-spread": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-rest-spread/-/plugin-transform-object-rest-spread-7.28.6.tgz",
+      "integrity": "sha512-5rh+JR4JBC4pGkXLAcYdLHZjXudVxWMXbB6u6+E9lRL5TrGVbHt1TjxGbZ8CkmYw9zjkB7jutzOROArsqtncEA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-compilation-targets": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/plugin-transform-destructuring": "^7.28.5",
+        "@babel/plugin-transform-parameters": "^7.27.7",
+        "@babel/traverse": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-object-super": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-object-super/-/plugin-transform-object-super-7.27.1.tgz",
+      "integrity": "sha512-SFy8S9plRPbIcxlJ8A6mT/CxFdJx/c04JEctz4jf8YZaVS2px34j7NXRrlGlHkN/M2gnpL37ZpGRGVFLd3l8Ng==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1",
+        "@babel/helper-replace-supers": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-optional-catch-binding": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-catch-binding/-/plugin-transform-optional-catch-binding-7.28.6.tgz",
+      "integrity": "sha512-R8ja/Pyrv0OGAvAXQhSTmWyPJPml+0TMqXlO5w+AsMEiwb2fg3WkOvob7UxFSL3OIttFSGSRFKQsOhJ/X6HQdQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-optional-chaining": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-optional-chaining/-/plugin-transform-optional-chaining-7.28.6.tgz",
+      "integrity": "sha512-A4zobikRGJTsX9uqVFdafzGkqD30t26ck2LmOzAuLL8b2x6k3TIqRiT2xVvA9fNmFeTX484VpsdgmKNA0bS23w==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-parameters": {
+      "version": "7.27.7",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-parameters/-/plugin-transform-parameters-7.27.7.tgz",
+      "integrity": "sha512-qBkYTYCb76RRxUM6CcZA5KRu8K4SM8ajzVeUgVdMVO9NN9uI/GaVmBg/WKJJGnNokV9SY8FxNOVWGXzqzUidBg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-private-methods": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-methods/-/plugin-transform-private-methods-7.28.6.tgz",
+      "integrity": "sha512-piiuapX9CRv7+0st8lmuUlRSmX6mBcVeNQ1b4AYzJxfCMuBfB0vBXDiGSmm03pKJw1v6cZ8KSeM+oUnM6yAExg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-class-features-plugin": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-private-property-in-object": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-private-property-in-object/-/plugin-transform-private-property-in-object-7.28.6.tgz",
+      "integrity": "sha512-b97jvNSOb5+ehyQmBpmhOCiUC5oVK4PMnpRvO7+ymFBoqYjeDHIU9jnrNUuwHOiL9RpGDoKBpSViarV+BU+eVA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-annotate-as-pure": "^7.27.3",
+        "@babel/helper-create-class-features-plugin": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-property-literals": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-property-literals/-/plugin-transform-property-literals-7.27.1.tgz",
+      "integrity": "sha512-oThy3BCuCha8kDZ8ZkgOg2exvPYUlprMukKQXI1r1pJ47NCvxfkEy8vK+r/hT9nF0Aa4H1WUPZZjHTFtAhGfmQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-regenerator": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regenerator/-/plugin-transform-regenerator-7.29.0.tgz",
+      "integrity": "sha512-FijqlqMA7DmRdg/aINBSs04y8XNTYw/lr1gJ2WsmBnnaNw1iS43EPkJW+zK7z65auG3AWRFXWj+NcTQwYptUog==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-regexp-modifiers": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-regexp-modifiers/-/plugin-transform-regexp-modifiers-7.28.6.tgz",
+      "integrity": "sha512-QGWAepm9qxpaIs7UM9FvUSnCGlb8Ua1RhyM4/veAxLwt3gMat/LSGrZixyuj4I6+Kn9iwvqCyPTtbdxanYoWYg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-reserved-words": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-reserved-words/-/plugin-transform-reserved-words-7.27.1.tgz",
+      "integrity": "sha512-V2ABPHIJX4kC7HegLkYoDpfg9PVmuWy/i6vUM5eGK22bx4YVFD3M5F0QQnWQoDs6AGsUWTVOopBiMFQgHaSkVw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-shorthand-properties": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-shorthand-properties/-/plugin-transform-shorthand-properties-7.27.1.tgz",
+      "integrity": "sha512-N/wH1vcn4oYawbJ13Y/FxcQrWk63jhfNa7jef0ih7PHSIHX2LB7GWE1rkPrOnka9kwMxb6hMl19p7lidA+EHmQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-spread": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-spread/-/plugin-transform-spread-7.28.6.tgz",
+      "integrity": "sha512-9U4QObUC0FtJl05AsUcodau/RWDytrU6uKgkxu09mLR9HLDAtUMoPuuskm5huQsoktmsYpI+bGmq+iapDcriKA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-skip-transparent-expression-wrappers": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-sticky-regex": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-sticky-regex/-/plugin-transform-sticky-regex-7.27.1.tgz",
+      "integrity": "sha512-lhInBO5bi/Kowe2/aLdBAawijx+q1pQzicSgnkB6dUPc1+RC8QmJHKf2OjvU+NZWitguJHEaEmbV6VWEouT58g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-template-literals": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-template-literals/-/plugin-transform-template-literals-7.27.1.tgz",
+      "integrity": "sha512-fBJKiV7F2DxZUkg5EtHKXQdbsbURW3DZKQUWphDum0uRP6eHGGa/He9mc0mypL680pb+e/lDIthRohlv8NCHkg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-typeof-symbol": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-typeof-symbol/-/plugin-transform-typeof-symbol-7.27.1.tgz",
+      "integrity": "sha512-RiSILC+nRJM7FY5srIyc4/fGIwUhyDuuBSdWn4y6yT6gm652DpCHZjIipgn6B7MQ1ITOUnAKWixEUjQRIBIcLw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-escapes": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-escapes/-/plugin-transform-unicode-escapes-7.27.1.tgz",
+      "integrity": "sha512-Ysg4v6AmF26k9vpfFuTZg8HRfVWzsh1kVfowA23y9j/Gu6dOuahdUVhkLqpObp3JIv27MLSii6noRnuKN8H0Mg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-property-regex": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-property-regex/-/plugin-transform-unicode-property-regex-7.28.6.tgz",
+      "integrity": "sha512-4Wlbdl/sIZjzi/8St0evF0gEZrgOswVO6aOzqxh1kDZOl9WmLrHq2HtGhnOJZmHZYKP8WZ1MDLCt5DAWwRo57A==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-regex": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-regex/-/plugin-transform-unicode-regex-7.27.1.tgz",
+      "integrity": "sha512-xvINq24TRojDuyt6JGtHmkVkrfVV3FPT16uytxImLeBZqW3/H52yN+kM1MGuyPkIQxrzKwPHs5U/MP3qKyzkGw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.27.1",
+        "@babel/helper-plugin-utils": "^7.27.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/plugin-transform-unicode-sets-regex": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/plugin-transform-unicode-sets-regex/-/plugin-transform-unicode-sets-regex-7.28.6.tgz",
+      "integrity": "sha512-/wHc/paTUmsDYN7SZkpWxogTOBNnlx7nBQYfy6JJlCT7G3mVhltk3e++N7zV0XfgGsrqBxd4rJQt9H16I21Y1Q==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-create-regexp-features-plugin": "^7.28.5",
+        "@babel/helper-plugin-utils": "^7.28.6"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0"
+      }
+    },
+    "node_modules/@babel/preset-env": {
+      "version": "7.29.2",
+      "resolved": "https://registry.npmjs.org/@babel/preset-env/-/preset-env-7.29.2.tgz",
+      "integrity": "sha512-DYD23veRYGvBFhcTY1iUvJnDNpuqNd/BzBwCvzOTKUnJjKg5kpUBh3/u9585Agdkgj+QuygG7jLfOPWMa2KVNw==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/compat-data": "^7.29.0",
+        "@babel/helper-compilation-targets": "^7.28.6",
+        "@babel/helper-plugin-utils": "^7.28.6",
+        "@babel/helper-validator-option": "^7.27.1",
+        "@babel/plugin-bugfix-firefox-class-in-computed-class-key": "^7.28.5",
+        "@babel/plugin-bugfix-safari-class-field-initializer-scope": "^7.27.1",
+        "@babel/plugin-bugfix-safari-id-destructuring-collision-in-function-expression": "^7.27.1",
+        "@babel/plugin-bugfix-v8-spread-parameters-in-optional-chaining": "^7.27.1",
+        "@babel/plugin-bugfix-v8-static-class-fields-redefine-readonly": "^7.28.6",
+        "@babel/plugin-proposal-private-property-in-object": "7.21.0-placeholder-for-preset-env.2",
+        "@babel/plugin-syntax-import-assertions": "^7.28.6",
+        "@babel/plugin-syntax-import-attributes": "^7.28.6",
+        "@babel/plugin-syntax-unicode-sets-regex": "^7.18.6",
+        "@babel/plugin-transform-arrow-functions": "^7.27.1",
+        "@babel/plugin-transform-async-generator-functions": "^7.29.0",
+        "@babel/plugin-transform-async-to-generator": "^7.28.6",
+        "@babel/plugin-transform-block-scoped-functions": "^7.27.1",
+        "@babel/plugin-transform-block-scoping": "^7.28.6",
+        "@babel/plugin-transform-class-properties": "^7.28.6",
+        "@babel/plugin-transform-class-static-block": "^7.28.6",
+        "@babel/plugin-transform-classes": "^7.28.6",
+        "@babel/plugin-transform-computed-properties": "^7.28.6",
+        "@babel/plugin-transform-destructuring": "^7.28.5",
+        "@babel/plugin-transform-dotall-regex": "^7.28.6",
+        "@babel/plugin-transform-duplicate-keys": "^7.27.1",
+        "@babel/plugin-transform-duplicate-named-capturing-groups-regex": "^7.29.0",
+        "@babel/plugin-transform-dynamic-import": "^7.27.1",
+        "@babel/plugin-transform-explicit-resource-management": "^7.28.6",
+        "@babel/plugin-transform-exponentiation-operator": "^7.28.6",
+        "@babel/plugin-transform-export-namespace-from": "^7.27.1",
+        "@babel/plugin-transform-for-of": "^7.27.1",
+        "@babel/plugin-transform-function-name": "^7.27.1",
+        "@babel/plugin-transform-json-strings": "^7.28.6",
+        "@babel/plugin-transform-literals": "^7.27.1",
+        "@babel/plugin-transform-logical-assignment-operators": "^7.28.6",
+        "@babel/plugin-transform-member-expression-literals": "^7.27.1",
+        "@babel/plugin-transform-modules-amd": "^7.27.1",
+        "@babel/plugin-transform-modules-commonjs": "^7.28.6",
+        "@babel/plugin-transform-modules-systemjs": "^7.29.0",
+        "@babel/plugin-transform-modules-umd": "^7.27.1",
+        "@babel/plugin-transform-named-capturing-groups-regex": "^7.29.0",
+        "@babel/plugin-transform-new-target": "^7.27.1",
+        "@babel/plugin-transform-nullish-coalescing-operator": "^7.28.6",
+        "@babel/plugin-transform-numeric-separator": "^7.28.6",
+        "@babel/plugin-transform-object-rest-spread": "^7.28.6",
+        "@babel/plugin-transform-object-super": "^7.27.1",
+        "@babel/plugin-transform-optional-catch-binding": "^7.28.6",
+        "@babel/plugin-transform-optional-chaining": "^7.28.6",
+        "@babel/plugin-transform-parameters": "^7.27.7",
+        "@babel/plugin-transform-private-methods": "^7.28.6",
+        "@babel/plugin-transform-private-property-in-object": "^7.28.6",
+        "@babel/plugin-transform-property-literals": "^7.27.1",
+        "@babel/plugin-transform-regenerator": "^7.29.0",
+        "@babel/plugin-transform-regexp-modifiers": "^7.28.6",
+        "@babel/plugin-transform-reserved-words": "^7.27.1",
+        "@babel/plugin-transform-shorthand-properties": "^7.27.1",
+        "@babel/plugin-transform-spread": "^7.28.6",
+        "@babel/plugin-transform-sticky-regex": "^7.27.1",
+        "@babel/plugin-transform-template-literals": "^7.27.1",
+        "@babel/plugin-transform-typeof-symbol": "^7.27.1",
+        "@babel/plugin-transform-unicode-escapes": "^7.27.1",
+        "@babel/plugin-transform-unicode-property-regex": "^7.28.6",
+        "@babel/plugin-transform-unicode-regex": "^7.27.1",
+        "@babel/plugin-transform-unicode-sets-regex": "^7.28.6",
+        "@babel/preset-modules": "0.1.6-no-external-plugins",
+        "babel-plugin-polyfill-corejs2": "^0.4.15",
+        "babel-plugin-polyfill-corejs3": "^0.14.0",
+        "babel-plugin-polyfill-regenerator": "^0.6.6",
+        "core-js-compat": "^3.48.0",
+        "semver": "^6.3.1"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0"
+      }
+    },
+    "node_modules/@babel/preset-env/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
+      }
+    },
+    "node_modules/@babel/preset-modules": {
+      "version": "0.1.6-no-external-plugins",
+      "resolved": "https://registry.npmjs.org/@babel/preset-modules/-/preset-modules-0.1.6-no-external-plugins.tgz",
+      "integrity": "sha512-HrcgcIESLm9aIR842yhJ5RWan/gebQUJ6E/E5+rf0y9o6oj7w0Br+sWuL6kEQ/o/AdfvR1Je9jG18/gnpwjEyA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-plugin-utils": "^7.0.0",
+        "@babel/types": "^7.4.4",
+        "esutils": "^2.0.2"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.0.0-0 || ^8.0.0-0 <8.0.0"
+      }
+    },
+    "node_modules/@babel/runtime": {
+      "version": "7.27.1",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.27.1.tgz",
+      "integrity": "sha512-1x3D2xEk2fRo3PAhwQwu5UubzgiVWSXTBfWpVd2Mx2AzRqJuDJCsgaDVZ7HB5iGzDW1Hl1sWN2mFyKjmR9uAog==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6.9.0"
       }
     },
-    "node_modules/@babel/code-frame": {
-      "version": "7.27.1",
-      "resolved": "https://registry.npmjs.org/@babel/code-frame/-/code-frame-7.27.1.tgz",
-      "integrity": "sha512-cjQ7ZlQ0Mv3b47hABuTevyTuYN4i+loJKGeV9flcCgIK37cCXRh+L1bd3iBHlynerhQ7BhCkn2BPbQUL+rGqFg==",
+    "node_modules/@babel/template": {
+      "version": "7.28.6",
+      "resolved": "https://registry.npmjs.org/@babel/template/-/template-7.28.6.tgz",
+      "integrity": "sha512-YA6Ma2KsCdGb+WC6UpBVFJGXL58MDA6oyONbjyF/+5sBgxY/dwkhLogbMT2GXXyU84/IhRw/2D1Os1B/giz+BQ==",
       "dev": true,
       "license": "MIT",
+      "peer": true,
       "dependencies": {
-        "@babel/helper-validator-identifier": "^7.27.1",
-        "js-tokens": "^4.0.0",
-        "picocolors": "^1.1.1"
+        "@babel/code-frame": "^7.28.6",
+        "@babel/parser": "^7.28.6",
+        "@babel/types": "^7.28.6"
       },
       "engines": {
         "node": ">=6.9.0"
       }
     },
-    "node_modules/@babel/helper-validator-identifier": {
-      "version": "7.27.1",
-      "resolved": "https://registry.npmjs.org/@babel/helper-validator-identifier/-/helper-validator-identifier-7.27.1.tgz",
-      "integrity": "sha512-D2hP9eA+Sqx1kBZgzxZh0y1trbuU+JoDkiEwqhQ36nodYqJwyEIhPSdMNd7lOm/4io72luTPWH20Yda0xOuUow==",
+    "node_modules/@babel/traverse": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/traverse/-/traverse-7.29.0.tgz",
+      "integrity": "sha512-4HPiQr0X7+waHfyXPZpWPfWL/J7dcN1mx9gL6WdQVMbPnF3+ZhSMs8tCxN7oHddJE9fhNE7+lxdnlyemKfJRuA==",
       "dev": true,
       "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/code-frame": "^7.29.0",
+        "@babel/generator": "^7.29.0",
+        "@babel/helper-globals": "^7.28.0",
+        "@babel/parser": "^7.29.0",
+        "@babel/template": "^7.28.6",
+        "@babel/types": "^7.29.0",
+        "debug": "^4.3.1"
+      },
       "engines": {
         "node": ">=6.9.0"
       }
     },
-    "node_modules/@babel/runtime": {
-      "version": "7.27.1",
-      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.27.1.tgz",
-      "integrity": "sha512-1x3D2xEk2fRo3PAhwQwu5UubzgiVWSXTBfWpVd2Mx2AzRqJuDJCsgaDVZ7HB5iGzDW1Hl1sWN2mFyKjmR9uAog==",
+    "node_modules/@babel/traverse/node_modules/debug": {
+      "version": "4.4.3",
+      "resolved": "https://registry.npmjs.org/debug/-/debug-4.4.3.tgz",
+      "integrity": "sha512-RGwwWnwQvkVfavKVt22FGLw+xYSdzARwm0ru6DhTVA3umU5hZc28V3kO4stgYryrTlLpuvgI9GiijltAjNbcqA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "ms": "^2.1.3"
+      },
+      "engines": {
+        "node": ">=6.0"
+      },
+      "peerDependenciesMeta": {
+        "supports-color": {
+          "optional": true
+        }
+      }
+    },
+    "node_modules/@babel/types": {
+      "version": "7.29.0",
+      "resolved": "https://registry.npmjs.org/@babel/types/-/types-7.29.0.tgz",
+      "integrity": "sha512-LwdZHpScM4Qz8Xw2iKSzS+cfglZzJGvofQICy7W7v4caru4EaAmyUuO6BGrbyQ2mYV11W0U8j5mBhd14dd3B0A==",
       "dev": true,
       "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@babel/helper-string-parser": "^7.27.1",
+        "@babel/helper-validator-identifier": "^7.28.5"
+      },
       "engines": {
         "node": ">=6.9.0"
       }
@@ -63,6 +1761,7 @@
       "resolved": "https://registry.npmjs.org/@choojs/findup/-/findup-0.2.1.tgz",
       "integrity": "sha512-YstAqNb0MCN8PjdLCDfRsBcGVRN41f3vgLvaI0IrIcBp4AqILRSS0DeWNGkicC+f/zRIPJLc+9RURVSepwvfBw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "commander": "^2.15.1"
@@ -72,32 +1771,33 @@
       }
     },
     "node_modules/@jridgewell/gen-mapping": {
-      "version": "0.3.8",
-      "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.8.tgz",
-      "integrity": "sha512-imAbBGkb+ebQyxKgzv5Hu2nmROxoDOXHh80evxdoXNOrvAnVx7zimzc1Oo5h9RlfV4vPXaE2iM5pOFbvOCClWA==",
+      "version": "0.3.13",
+      "resolved": "https://registry.npmjs.org/@jridgewell/gen-mapping/-/gen-mapping-0.3.13.tgz",
+      "integrity": "sha512-2kkt/7niJ6MgEPxF0bYdQ6etZaA+fQvDcLKckhy1yIQOzaoKjBBjSj63/aLVjYE3qhRt5dvM+uUyfCg6UKCBbA==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
-        "@jridgewell/set-array": "^1.2.1",
-        "@jridgewell/sourcemap-codec": "^1.4.10",
+        "@jridgewell/sourcemap-codec": "^1.5.0",
+        "@jridgewell/trace-mapping": "^0.3.24"
+      }
+    },
+    "node_modules/@jridgewell/remapping": {
+      "version": "2.3.5",
+      "resolved": "https://registry.npmjs.org/@jridgewell/remapping/-/remapping-2.3.5.tgz",
+      "integrity": "sha512-LI9u/+laYG4Ds1TDKSJW2YPrIlcVYOwi2fUC6xB43lueCjgxV4lffOCZCtYFiH6TNOX+tQKXx97T4IKHbhyHEQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "@jridgewell/gen-mapping": "^0.3.5",
         "@jridgewell/trace-mapping": "^0.3.24"
-      },
-      "engines": {
-        "node": ">=6.0.0"
       }
     },
     "node_modules/@jridgewell/resolve-uri": {
       "version": "3.1.2",
       "resolved": "https://registry.npmjs.org/@jridgewell/resolve-uri/-/resolve-uri-3.1.2.tgz",
       "integrity": "sha512-bRISgCIjP20/tbWSPWMEi54QVPRZExkuD9lJL+UIxUKtwVJA8wW1Trb1jMs1RFXo1CBTNZ/5hpC9QvmKWdopKw==",
-      "license": "MIT",
-      "engines": {
-        "node": ">=6.0.0"
-      }
-    },
-    "node_modules/@jridgewell/set-array": {
-      "version": "1.2.1",
-      "resolved": "https://registry.npmjs.org/@jridgewell/set-array/-/set-array-1.2.1.tgz",
-      "integrity": "sha512-R8gLRTZeyp03ymzP/6Lil/28tGeGEzhx1q2k703KGWRAI1VdvPIXdG70VJc2pAMw3NA6JKL5hhFu1sJX0Mnn/A==",
+      "devOptional": true,
       "license": "MIT",
       "engines": {
         "node": ">=6.0.0"
@@ -107,6 +1807,7 @@
       "version": "0.3.6",
       "resolved": "https://registry.npmjs.org/@jridgewell/source-map/-/source-map-0.3.6.tgz",
       "integrity": "sha512-1ZJTZebgqllO79ue2bm3rIGud/bOe0pP5BjSRCRxxYkEZS8STV7zN84UBbiYu7jy+eCKSnVIUgoWWE/tt+shMQ==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "@jridgewell/gen-mapping": "^0.3.5",
@@ -117,18 +1818,78 @@
       "version": "1.5.0",
       "resolved": "https://registry.npmjs.org/@jridgewell/sourcemap-codec/-/sourcemap-codec-1.5.0.tgz",
       "integrity": "sha512-gv3ZRaISU3fjPAgNsriBRqGWQL6quFx04YMPW/zD8XMLsU32mhCCbfbO6KZFLjvYpCZ8zyDEgqsgf+PwPaM7GQ==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/@jridgewell/trace-mapping": {
-      "version": "0.3.25",
-      "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.25.tgz",
-      "integrity": "sha512-vNk6aEwybGtawWmy/PzwnGDOjCkLWSD2wqvjGGAgOAwCGWySYXfYoxt00IJkTF+8Lb57DwOb3Aa0o9CApepiYQ==",
+      "version": "0.3.31",
+      "resolved": "https://registry.npmjs.org/@jridgewell/trace-mapping/-/trace-mapping-0.3.31.tgz",
+      "integrity": "sha512-zzNR+SdQSDJzc8joaeP8QQoCQr8NuYx2dIIytl1QeBEZHJ9uW6hebsrYgbz8hJwUQao3TWCMtmfV8Nu1twOLAw==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "@jridgewell/resolve-uri": "^3.1.0",
         "@jridgewell/sourcemap-codec": "^1.4.14"
       }
     },
+    "node_modules/@kitware/vtk.js": {
+      "version": "32.14.0",
+      "resolved": "https://registry.npmjs.org/@kitware/vtk.js/-/vtk.js-32.14.0.tgz",
+      "integrity": "sha512-yIJkJrpeuMNSvFL9Nxcl7g4u3F6AwZqd2MBtpLilOrF0JmR4Ek5SnjJWsaKMcwKnp2eWuu0mflLHfs4Kd9hDxA==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "@babel/runtime": "7.22.11",
+        "@types/webxr": "^0.5.5",
+        "commander": "9.2.0",
+        "d3-scale": "4.0.2",
+        "fast-deep-equal": "^3.1.3",
+        "fflate": "0.7.3",
+        "gl-matrix": "3.4.3",
+        "globalthis": "1.0.3",
+        "seedrandom": "3.0.5",
+        "shader-loader": "1.3.1",
+        "shelljs": "0.8.5",
+        "spark-md5": "3.0.2",
+        "stream-browserify": "3.0.0",
+        "utif": "3.1.0",
+        "webworker-promise": "0.5.0",
+        "worker-loader": "3.0.8",
+        "xmlbuilder2": "3.0.2"
+      },
+      "bin": {
+        "vtkDataConverter": "Utilities/DataGenerator/convert-cli.js",
+        "xml2json": "Utilities/XMLConverter/xml2json-cli.js"
+      },
+      "peerDependencies": {
+        "@babel/preset-env": "^7.17.10",
+        "autoprefixer": "^10.4.7",
+        "wslink": ">=1.1.0 || ^2.0.0"
+      }
+    },
+    "node_modules/@kitware/vtk.js/node_modules/@babel/runtime": {
+      "version": "7.22.11",
+      "resolved": "https://registry.npmjs.org/@babel/runtime/-/runtime-7.22.11.tgz",
+      "integrity": "sha512-ee7jVNlWN09+KftVOu9n7S8gQzD/Z6hN/I8VBRXW4P1+Xe7kJGXMwu8vds4aGIMHZnNbdpSWCfZZtinytpcAvA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "regenerator-runtime": "^0.14.0"
+      },
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
+    "node_modules/@kitware/vtk.js/node_modules/commander": {
+      "version": "9.2.0",
+      "resolved": "https://registry.npmjs.org/commander/-/commander-9.2.0.tgz",
+      "integrity": "sha512-e2i4wANQiSXgnrBlIatyHtP1odfUp0BbV5Y5nEGbxtIrStkEOAAzCUirvLBNXHLr7kwLvJl6V+4V3XV9x7Wd9w==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "^12.20.0 || >=14"
+      }
+    },
     "node_modules/@loaders.gl/core": {
       "version": "3.4.15",
       "resolved": "https://registry.npmjs.org/@loaders.gl/core/-/core-3.4.15.tgz",
@@ -232,6 +1993,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/geojson-rewind/-/geojson-rewind-0.5.2.tgz",
       "integrity": "sha512-tJaT+RbYGJYStt7wI3cq4Nl4SXxG8W7JDG5DMJu97V25RnbNg3QtQtf+KD+VLjNpWKYsRvXDNmNrBgEETr1ifA==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "get-stream": "^6.0.1",
@@ -246,12 +2008,14 @@
       "resolved": "https://registry.npmjs.org/@mapbox/geojson-types/-/geojson-types-1.0.2.tgz",
       "integrity": "sha512-e9EBqHHv3EORHrSfbR9DqecPNn+AmuAoQxV6aL8Xu30bJMJR1o8PZLZzpk1Wq7/NfCbuhmakHTPYRhoqLsXRnw==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/@mapbox/jsonlint-lines-primitives": {
       "version": "2.0.2",
       "resolved": "https://registry.npmjs.org/@mapbox/jsonlint-lines-primitives/-/jsonlint-lines-primitives-2.0.2.tgz",
       "integrity": "sha512-rY0o9A5ECsTQRVhv7tL/OyDpGAoUB4tTvLiW1DSzQGq4bvTPhNw1VpSNjDJc5GFZ2XuyOtSWSVN05qOtcD71qQ==",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">= 0.6"
@@ -262,6 +2026,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/mapbox-gl-supported/-/mapbox-gl-supported-1.5.0.tgz",
       "integrity": "sha512-/PT1P6DNf7vjEEiPkVIRJkvibbqWtqnyGaBz3nfRdcxclNSnSdaLU5tfAgcD7I8Yt5i+L19s406YLl1koLnLbg==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "peerDependencies": {
         "mapbox-gl": ">=0.32.1 <2.0.0"
@@ -272,6 +2037,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/point-geometry/-/point-geometry-0.1.0.tgz",
       "integrity": "sha512-6j56HdLTwWGO0fJPlrZtdU/B13q8Uwmo18Ck2GnGgN9PCFyKTZ3UbXeEdRFh18i9XQ92eH2VdtpJHpBD3aripQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/@mapbox/tiny-sdf": {
@@ -279,6 +2045,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/tiny-sdf/-/tiny-sdf-1.2.5.tgz",
       "integrity": "sha512-cD8A/zJlm6fdJOk6DqPUV8mcpyJkRz2x2R+/fYcWDYG3oWbG7/L7Yl/WqQ1VZCjnL9OTIMAn6c+BC5Eru4sQEw==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/@mapbox/unitbezier": {
@@ -286,6 +2053,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/unitbezier/-/unitbezier-0.0.0.tgz",
       "integrity": "sha512-HPnRdYO0WjFjRTSwO3frz1wKaU649OBFPX3Zo/2WZvuRi6zMiRGui8SnPQiQABgqCf8YikDe5t3HViTVw1WUzA==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/@mapbox/vector-tile": {
@@ -293,6 +2061,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/vector-tile/-/vector-tile-1.3.1.tgz",
       "integrity": "sha512-MCEddb8u44/xfQ3oD+Srl/tNcQoqTw3goGk2oLsrFxOTc3dUp+kAnby3PvAeeBYSMSjSPD1nd1AJA6W49WnoUw==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/point-geometry": "~0.1.0"
@@ -303,6 +2072,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/whoots-js/-/whoots-js-3.1.0.tgz",
       "integrity": "sha512-Es6WcD0nO5l+2BOQS4uLfNPYQaNDfbot3X1XUoloz+x0mPDS3eeORZJl06HXjwBG1fOGwCRnzK88LMdxKRrd6Q==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=6.0.0"
@@ -313,6 +2083,7 @@
       "resolved": "https://registry.npmjs.org/@maplibre/maplibre-gl-style-spec/-/maplibre-gl-style-spec-20.4.0.tgz",
       "integrity": "sha512-AzBy3095fTFPjDjmWpR2w6HVRAZJ6hQZUCwk5Plz6EyfnfuQW1odeW5i2Ai47Y6TBA2hQnC+azscjBSALpaWgw==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/jsonlint-lines-primitives": "~2.0.2",
@@ -334,6 +2105,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/unitbezier/-/unitbezier-0.0.1.tgz",
       "integrity": "sha512-nMkuDXFv60aBr9soUG5q+GvZYL+2KZHVvsqFCzqnkGEf46U2fvmytHaEVc1/YZbiLn8X+eR3QzX1+dwDO1lxlw==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/@maplibre/maplibre-gl-style-spec/node_modules/tinyqueue": {
@@ -341,6 +2113,7 @@
       "resolved": "https://registry.npmjs.org/tinyqueue/-/tinyqueue-3.0.0.tgz",
       "integrity": "sha512-gRa9gwYU3ECmQYv3lslts5hxuIa90veaEcxDYuu3QGOIAEM2mOZkVHp48ANJuu1CURtRdHKUBY5Lm1tHV+sD4g==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/@math.gl/core": {
@@ -362,11 +2135,75 @@
       "dev": true,
       "license": "MIT"
     },
+    "node_modules/@msgpack/msgpack": {
+      "version": "2.8.0",
+      "resolved": "https://registry.npmjs.org/@msgpack/msgpack/-/msgpack-2.8.0.tgz",
+      "integrity": "sha512-h9u4u/jiIRKbq25PM+zymTyW6bhTzELvOoUd+AvYriWOAKpLGnIamaET3pnHYoI5iYphAHBI4ayx0MehR+VVPQ==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "engines": {
+        "node": ">= 10"
+      }
+    },
+    "node_modules/@oozcitak/dom": {
+      "version": "1.15.10",
+      "resolved": "https://registry.npmjs.org/@oozcitak/dom/-/dom-1.15.10.tgz",
+      "integrity": "sha512-0JT29/LaxVgRcGKvHmSrUTEvZ8BXvZhGl2LASRUgHqDTC1M5g1pLmVv56IYNyt3bG2CUjDkc67wnyZC14pbQrQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@oozcitak/infra": "1.0.8",
+        "@oozcitak/url": "1.0.4",
+        "@oozcitak/util": "8.3.8"
+      },
+      "engines": {
+        "node": ">=8.0"
+      }
+    },
+    "node_modules/@oozcitak/infra": {
+      "version": "1.0.8",
+      "resolved": "https://registry.npmjs.org/@oozcitak/infra/-/infra-1.0.8.tgz",
+      "integrity": "sha512-JRAUc9VR6IGHOL7OGF+yrvs0LO8SlqGnPAMqyzOuFZPSZSXI7Xf2O9+awQPSMXgIWGtgUf/dA6Hs6X6ySEaWTg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@oozcitak/util": "8.3.8"
+      },
+      "engines": {
+        "node": ">=6.0"
+      }
+    },
+    "node_modules/@oozcitak/url": {
+      "version": "1.0.4",
+      "resolved": "https://registry.npmjs.org/@oozcitak/url/-/url-1.0.4.tgz",
+      "integrity": "sha512-kDcD8y+y3FCSOvnBI6HJgl00viO/nGbQoCINmQ0h98OhnGITrWR3bOGfwYCthgcrV8AnTJz8MzslTQbC3SOAmw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@oozcitak/infra": "1.0.8",
+        "@oozcitak/util": "8.3.8"
+      },
+      "engines": {
+        "node": ">=8.0"
+      }
+    },
+    "node_modules/@oozcitak/util": {
+      "version": "8.3.8",
+      "resolved": "https://registry.npmjs.org/@oozcitak/util/-/util-8.3.8.tgz",
+      "integrity": "sha512-T8TbSnGsxo6TDBJx/Sgv/BlVJL3tshxZP7Aq5R1mSnM5OcHY2dQaxLMu2+E8u3gN0MLOzdjurqN4ZRVuzQycOQ==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=8.0"
+      }
+    },
     "node_modules/@plotly/d3": {
       "version": "3.8.2",
       "resolved": "https://registry.npmjs.org/@plotly/d3/-/d3-3.8.2.tgz",
       "integrity": "sha512-wvsNmh1GYjyJfyEBPKJLTMzgf2c2bEbSIL50lmqVUi+o1NHaLPi1Lb4v7VxXXJn043BhNyrxUrWI85Q+zmjOVA==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/@plotly/d3-sankey": {
@@ -374,6 +2211,7 @@
       "resolved": "https://registry.npmjs.org/@plotly/d3-sankey/-/d3-sankey-0.7.2.tgz",
       "integrity": "sha512-2jdVos1N3mMp3QW0k2q1ph7Gd6j5PY1YihBrwpkFnKqO+cqtZq3AdEYUeSGXMeLsBDQYiqTVcihYfk8vr5tqhw==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d3-array": "1",
@@ -386,6 +2224,7 @@
       "resolved": "https://registry.npmjs.org/@plotly/d3-sankey-circular/-/d3-sankey-circular-0.33.1.tgz",
       "integrity": "sha512-FgBV1HEvCr3DV7RHhDsPXyryknucxtfnLwPtCKKxdolKyTFYoLX/ibEfX39iFYIL7DYbVeRtP43dbFcrHNE+KQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d3-array": "^1.2.1",
@@ -399,6 +2238,7 @@
       "resolved": "https://registry.npmjs.org/@plotly/mapbox-gl/-/mapbox-gl-1.13.4.tgz",
       "integrity": "sha512-sR3/Pe5LqT/fhYgp4rT4aSFf1rTsxMbGiH6Hojc7PH36ny5Bn17iVFUjpzycafETURuFbLZUfjODO8LvSI+5zQ==",
       "license": "SEE LICENSE IN LICENSE.txt",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/geojson-rewind": "^0.5.2",
@@ -433,6 +2273,7 @@
       "resolved": "https://registry.npmjs.org/@plotly/point-cluster/-/point-cluster-3.1.9.tgz",
       "integrity": "sha512-MwaI6g9scKf68Orpr1pHZ597pYx9uP8UEFXLPbsCmuw3a84obwz6pnMXGc90VhgDNeNiLEdlmuK7CPo+5PIxXw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "array-bounds": "^1.0.1",
@@ -558,6 +2399,7 @@
       "resolved": "https://registry.npmjs.org/@turf/area/-/area-7.2.0.tgz",
       "integrity": "sha512-zuTTdQ4eoTI9nSSjerIy4QwgvxqwJVciQJ8tOPuMHbXJ9N/dNjI7bU8tasjhxas/Cx3NE9NxVHtNpYHL0FSzoA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@turf/helpers": "^7.2.0",
@@ -574,6 +2416,7 @@
       "resolved": "https://registry.npmjs.org/@turf/bbox/-/bbox-7.2.0.tgz",
       "integrity": "sha512-wzHEjCXlYZiDludDbXkpBSmv8Zu6tPGLmJ1sXQ6qDwpLE1Ew3mcWqt8AaxfTP5QwDNQa3sf2vvgTEzNbPQkCiA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@turf/helpers": "^7.2.0",
@@ -590,6 +2433,7 @@
       "resolved": "https://registry.npmjs.org/@turf/centroid/-/centroid-7.2.0.tgz",
       "integrity": "sha512-yJqDSw25T7P48au5KjvYqbDVZ7qVnipziVfZ9aSo7P2/jTE7d4BP21w0/XLi3T/9bry/t9PR1GDDDQljN4KfDw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@turf/helpers": "^7.2.0",
@@ -606,6 +2450,7 @@
       "resolved": "https://registry.npmjs.org/@turf/helpers/-/helpers-7.2.0.tgz",
       "integrity": "sha512-cXo7bKNZoa7aC7ydLmUR02oB3IgDe7MxiPuRz3cCtYQHn+BJ6h1tihmamYDWWUlPHgSNF0i3ATc4WmDECZafKw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@types/geojson": "^7946.0.10",
@@ -620,6 +2465,7 @@
       "resolved": "https://registry.npmjs.org/@turf/meta/-/meta-7.2.0.tgz",
       "integrity": "sha512-igzTdHsQc8TV1RhPuOLVo74Px/hyPrVgVOTgjWQZzt3J9BVseCdpfY/0cJBdlSRI4S/yTmmHl7gAqjhpYH5Yaw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@turf/helpers": "^7.2.0",
@@ -633,6 +2479,7 @@
       "version": "9.6.1",
       "resolved": "https://registry.npmjs.org/@types/eslint/-/eslint-9.6.1.tgz",
       "integrity": "sha512-FXx2pKgId/WyYo2jXw63kk7/+TY7u7AziEJxJAnSFzHlqTAS3Ync6SvgYAN/k4/PQpnnVuzoMuVnByKK2qp0ag==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -644,6 +2491,7 @@
       "version": "3.7.7",
       "resolved": "https://registry.npmjs.org/@types/eslint-scope/-/eslint-scope-3.7.7.tgz",
       "integrity": "sha512-MzMFlSLBqNF2gcHWO0G1vP/YQyfvrxZ0bF+u7mzUdZ1/xK4A4sru+nraZz5i3iEIk1l1uyicaDVTB4QbbEkAYg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -654,12 +2502,14 @@
     "node_modules/@types/estree": {
       "version": "1.0.8",
       "resolved": "https://registry.npmjs.org/@types/estree/-/estree-1.0.8.tgz",
-      "integrity": "sha512-dWHzHa2WqEXI/O1E9OjrocMTKJl2mSrEolh1Iomrv6U+JuNwaHXsXx9bLu5gG7BUWFIN0skIQJQ/L1rIex4X6w=="
+      "integrity": "sha512-dWHzHa2WqEXI/O1E9OjrocMTKJl2mSrEolh1Iomrv6U+JuNwaHXsXx9bLu5gG7BUWFIN0skIQJQ/L1rIex4X6w==",
+      "devOptional": true
     },
     "node_modules/@types/geojson": {
       "version": "7946.0.16",
       "resolved": "https://registry.npmjs.org/@types/geojson/-/geojson-7946.0.16.tgz",
       "integrity": "sha512-6C8nqWur3j98U6+lXDfTUWIfgvZU+EumvpHKcYjujKH7woYyLj2sUmff0tRhrqM7BohUw7Pz3ZB1jj2gW9Fvmg==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/@types/geojson-vt": {
@@ -667,6 +2517,7 @@
       "resolved": "https://registry.npmjs.org/@types/geojson-vt/-/geojson-vt-3.2.5.tgz",
       "integrity": "sha512-qDO7wqtprzlpe8FfQ//ClPV9xiuoh2nkIgiouIptON9w5jvD/fA4szvP9GBlDVdJ5dldAl0kX/sy3URbWwLx0g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@types/geojson": "*"
@@ -676,14 +2527,15 @@
       "version": "7.0.15",
       "resolved": "https://registry.npmjs.org/@types/json-schema/-/json-schema-7.0.15.tgz",
       "integrity": "sha512-5+fP8P8MFNC+AyZCDxrB2pkZFPGzqQWUzpSeuuVLvm8VMcorNYavBqoFcxK8bQz4Qsbn4oUEEem4wDLfcysGHA==",
-      "license": "MIT",
-      "peer": true
+      "devOptional": true,
+      "license": "MIT"
     },
     "node_modules/@types/mapbox__point-geometry": {
       "version": "0.1.4",
       "resolved": "https://registry.npmjs.org/@types/mapbox__point-geometry/-/mapbox__point-geometry-0.1.4.tgz",
       "integrity": "sha512-mUWlSxAmYLfwnRBmgYV86tgYmMIICX4kza8YnE/eIlywGe2XoOxlpVnXWwir92xRLjwyarqwpu2EJKD2pk0IUA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/@types/mapbox__vector-tile": {
@@ -691,6 +2543,7 @@
       "resolved": "https://registry.npmjs.org/@types/mapbox__vector-tile/-/mapbox__vector-tile-1.3.4.tgz",
       "integrity": "sha512-bpd8dRn9pr6xKvuEBQup8pwQfD4VUyqO/2deGjfpe6AwC8YRlyEipvefyRJUSiCJTZuCb8Pl1ciVV5ekqJ96Bg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@types/geojson": "*",
@@ -702,6 +2555,7 @@
       "version": "22.15.21",
       "resolved": "https://registry.npmjs.org/@types/node/-/node-22.15.21.tgz",
       "integrity": "sha512-EV/37Td6c+MgKAbkcLG6vqZ2zEYHD7bvSrzqqs2RIhbA6w3x+Dqz8MZM3sP6kGTeLrdoOgKZe+Xja7tUB2DNkQ==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "undici-types": "~6.21.0"
@@ -712,6 +2566,7 @@
       "resolved": "https://registry.npmjs.org/@types/pbf/-/pbf-3.0.5.tgz",
       "integrity": "sha512-j3pOPiEcWZ34R6a6mN07mUkM4o4Lwf6hPNt8eilOeZhTFbxFXmKhvXl9Y28jotFPaI1bpPDJsbCprUoNke6OrA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/@types/resolve": {
@@ -726,15 +2581,24 @@
       "resolved": "https://registry.npmjs.org/@types/supercluster/-/supercluster-7.1.3.tgz",
       "integrity": "sha512-Z0pOY34GDFl3Q6hUFYf3HkTwKEE02e7QgtJppBt+beEAxnyOpJua+voGFvxINBHa06GwLFFym7gRPY2SiKIfIA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@types/geojson": "*"
       }
     },
+    "node_modules/@types/webxr": {
+      "version": "0.5.24",
+      "resolved": "https://registry.npmjs.org/@types/webxr/-/webxr-0.5.24.tgz",
+      "integrity": "sha512-h8fgEd/DpoS9CBrjEQXR+dIDraopAEfu4wYVNY2tEPwk60stPWhvZMf4Foo5FakuQ7HFZoa8WceaWFervK2Ovg==",
+      "dev": true,
+      "license": "MIT"
+    },
     "node_modules/@webassemblyjs/ast": {
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/ast/-/ast-1.14.1.tgz",
       "integrity": "sha512-nuBEDgQfm1ccRp/8bCQrx1frohyufl4JlbMMZ4P1wpeOfDhF6FQkxZJ1b/e+PLwr6X1Nhw6OLme5usuBWYBvuQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -746,6 +2610,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/floating-point-hex-parser/-/floating-point-hex-parser-1.13.2.tgz",
       "integrity": "sha512-6oXyTOzbKxGH4steLbLNOu71Oj+C8Lg34n6CqRvqfS2O71BxY6ByfMDRhBytzknj9yGUPVJ1qIKhRlAwO1AovA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -753,6 +2618,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-api-error/-/helper-api-error-1.13.2.tgz",
       "integrity": "sha512-U56GMYxy4ZQCbDZd6JuvvNV/WFildOjsaWD3Tzzvmw/mas3cXzRJPMjP83JqEsgSbyrmaGjBfDtV7KDXV9UzFQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -760,6 +2626,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-buffer/-/helper-buffer-1.14.1.tgz",
       "integrity": "sha512-jyH7wtcHiKssDtFPRB+iQdxlDf96m0E39yb0k5uJVhFGleZFoNw1c4aeIcVUPPbXUVJ94wwnMOAqUHyzoEPVMA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -767,6 +2634,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-numbers/-/helper-numbers-1.13.2.tgz",
       "integrity": "sha512-FE8aCmS5Q6eQYcV3gI35O4J789wlQA+7JrqTTpJqn5emA4U2hvwJmvFRC0HODS+3Ye6WioDklgd6scJ3+PLnEA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -779,6 +2647,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-bytecode/-/helper-wasm-bytecode-1.13.2.tgz",
       "integrity": "sha512-3QbLKy93F0EAIXLh0ogEVR6rOubA9AoZ+WRYhNbFyuB70j3dRdwH9g+qXhLAO0kiYGlg3TxDV+I4rQTr/YNXkA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -786,6 +2655,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/helper-wasm-section/-/helper-wasm-section-1.14.1.tgz",
       "integrity": "sha512-ds5mXEqTJ6oxRoqjhWDU83OgzAYjwsCV8Lo/N+oRsNDmx/ZDpqalmrtgOMkHwxsG0iI//3BwWAErYRHtgn0dZw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -799,6 +2669,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/ieee754/-/ieee754-1.13.2.tgz",
       "integrity": "sha512-4LtOzh58S/5lX4ITKxnAK2USuNEvpdVV9AlgGQb8rJDHaLeHciwG4zlGr0j/SNWlr7x3vO1lDEsuePvtcDNCkw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -809,6 +2680,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/leb128/-/leb128-1.13.2.tgz",
       "integrity": "sha512-Lde1oNoIdzVzdkNEAWZ1dZ5orIbff80YPdHx20mrHwHrVNNTjNr8E3xz9BdpcGqRQbAEa+fkrCb+fRFTl/6sQw==",
+      "devOptional": true,
       "license": "Apache-2.0",
       "peer": true,
       "dependencies": {
@@ -819,6 +2691,7 @@
       "version": "1.13.2",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/utf8/-/utf8-1.13.2.tgz",
       "integrity": "sha512-3NQWGjKTASY1xV5m7Hr0iPeXD9+RDobLll3T9d2AO+g3my8xy5peVyjSag4I50mR1bBSN/Ct12lo+R9tJk0NZQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -826,6 +2699,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-edit/-/wasm-edit-1.14.1.tgz",
       "integrity": "sha512-RNJUIQH/J8iA/1NzlE4N7KtyZNHi3w7at7hDjvRNm5rcUXa00z1vRz3glZoULfJ5mpvYhLybmVcwcjGrC1pRrQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -843,6 +2717,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-gen/-/wasm-gen-1.14.1.tgz",
       "integrity": "sha512-AmomSIjP8ZbfGQhumkNvgC33AY7qtMCXnN6bL2u2Js4gVCg8fp735aEiMSBbDR7UQIj90n4wKAFUSEd0QN2Ukg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -857,6 +2732,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-opt/-/wasm-opt-1.14.1.tgz",
       "integrity": "sha512-PTcKLUNvBqnY2U6E5bdOQcSM+oVP/PmrDY9NzowJjislEjwP/C4an2303MCVS2Mg9d3AJpIGdUFIQQWbPds0Sw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -870,6 +2746,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/wasm-parser/-/wasm-parser-1.14.1.tgz",
       "integrity": "sha512-JLBl+KZ0R5qB7mCnud/yyX08jWFw5MsoalJ1pQ4EdFlgj9VdXKGuENGsiCIjegI1W7p91rUlcB/LB5yRJKNTcQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -885,6 +2762,7 @@
       "version": "1.14.1",
       "resolved": "https://registry.npmjs.org/@webassemblyjs/wast-printer/-/wast-printer-1.14.1.tgz",
       "integrity": "sha512-kPSSXE6De1XOR820C90RIo2ogvZG+c3KiHzqUoO/F34Y2shGzesfqv7o57xrxovZJH/MetF5UjroJ/R/3isoiw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -903,6 +2781,7 @@
       "version": "1.2.0",
       "resolved": "https://registry.npmjs.org/@xtuc/ieee754/-/ieee754-1.2.0.tgz",
       "integrity": "sha512-DX8nKgqcGwsc0eJSqYt5lwP4DH5FlHnmuWWBRy7X0NcaGR0ZtuyeESgMwTYVEtxmsNGY+qit4QYT/MIYTOTPeA==",
+      "devOptional": true,
       "license": "BSD-3-Clause",
       "peer": true
     },
@@ -910,6 +2789,7 @@
       "version": "4.2.2",
       "resolved": "https://registry.npmjs.org/@xtuc/long/-/long-4.2.2.tgz",
       "integrity": "sha512-NuHqBY1PB/D8xU6s/thBgOAiAP7HOYDQ32+BFZILJ8ivkUkAHQnWfn6WhL79Owj1qmUnoN/YPhktdIoucipkAQ==",
+      "devOptional": true,
       "license": "Apache-2.0",
       "peer": true
     },
@@ -918,12 +2798,14 @@
       "resolved": "https://registry.npmjs.org/abs-svg-path/-/abs-svg-path-0.1.1.tgz",
       "integrity": "sha512-d8XPSGjfyzlXC3Xx891DJRyZfqk5JU0BJrDQcsWomFIV1/BIzPW5HDH5iDdWpqWaav0YVIEzT1RHTwWr0FFshA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/acorn": {
       "version": "8.15.0",
       "resolved": "https://registry.npmjs.org/acorn/-/acorn-8.15.0.tgz",
       "integrity": "sha512-NZyJarBfL7nWwIq+FDL6Zp/yHEhePMNnnJ0y3qfieCrmNvYct8uvtiV41UvlSe6apAfk0fY1FbWx+NwfmpvtTg==",
+      "devOptional": true,
       "bin": {
         "acorn": "bin/acorn"
       },
@@ -935,6 +2817,7 @@
       "version": "1.0.4",
       "resolved": "https://registry.npmjs.org/acorn-import-phases/-/acorn-import-phases-1.0.4.tgz",
       "integrity": "sha512-wKmbr/DDiIXzEOiWrTTUcDm24kQ2vGfZQvM2fwg2vXqR5uW6aapr7ObPtj1th32b9u90/Pf4AItvdTh42fBmVQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -948,6 +2831,7 @@
       "version": "8.17.1",
       "resolved": "https://registry.npmjs.org/ajv/-/ajv-8.17.1.tgz",
       "integrity": "sha512-B/gBuNg5SiMTrPkC+A2+cW0RszwxYmn6VYxB/inlBStS5nx6xHIt/ehKRhIMhqusl7a8LjQoZnjCs5vhwxOQ1g==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -965,6 +2849,7 @@
       "version": "2.1.1",
       "resolved": "https://registry.npmjs.org/ajv-formats/-/ajv-formats-2.1.1.tgz",
       "integrity": "sha512-Wx0Kx52hxE7C18hkMEggYlEifqWZtYaRgouJor+WMdPnQyEK13vgEWyVNup7SoeeoLMsr4kf5h6dOW11I15MUA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -983,91 +2868,229 @@
       "version": "5.1.0",
       "resolved": "https://registry.npmjs.org/ajv-keywords/-/ajv-keywords-5.1.0.tgz",
       "integrity": "sha512-YCS/JNFAUyr5vAuhk1DWm1CBxRHW9LbJ2ozWeemrIqpbsqKjHVxYPyi5GC0rjZIT5JxJ3virVTS8wk4i/Z+krw==",
+      "devOptional": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "fast-deep-equal": "^3.1.3"
+      },
+      "peerDependencies": {
+        "ajv": "^8.8.2"
+      }
+    },
+    "node_modules/almost-equal": {
+      "version": "1.1.0",
+      "resolved": "https://registry.npmjs.org/almost-equal/-/almost-equal-1.1.0.tgz",
+      "integrity": "sha512-0V/PkoculFl5+0Lp47JoxUcO0xSxhIBvm+BxHdD/OgXNmdRpRHCFnKVuUoWyS9EzQP+otSGv0m9Lb4yVkQBn2A==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true
+    },
+    "node_modules/argparse": {
+      "version": "1.0.10",
+      "resolved": "https://registry.npmjs.org/argparse/-/argparse-1.0.10.tgz",
+      "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "sprintf-js": "~1.0.2"
+      }
+    },
+    "node_modules/array-bounds": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/array-bounds/-/array-bounds-1.0.1.tgz",
+      "integrity": "sha512-8wdW3ZGk6UjMPJx/glyEt0sLzzwAE1bhToPsO1W2pbpR2gULyxe3BjSiuJFheP50T/GgODVPz2fuMUmIywt8cQ==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true
+    },
+    "node_modules/array-find-index": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/array-find-index/-/array-find-index-1.0.2.tgz",
+      "integrity": "sha512-M1HQyIXcBGtVywBt8WVdim+lrNaK7VHp99Qt5pSNziXznKHViIBbXWtfRTpEFpF/c4FdfxNAsCCwPp5phBYJtw==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true,
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
+    "node_modules/array-normalize": {
+      "version": "1.1.4",
+      "resolved": "https://registry.npmjs.org/array-normalize/-/array-normalize-1.1.4.tgz",
+      "integrity": "sha512-fCp0wKFLjvSPmCn4F5Tiw4M3lpMZoHlCjfcs7nNzuj3vqQQ1/a8cgB9DXcpDSn18c+coLnaW7rqfcYCvKbyJXg==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true,
+      "dependencies": {
+        "array-bounds": "^1.0.0"
+      }
+    },
+    "node_modules/array-range": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/array-range/-/array-range-1.0.1.tgz",
+      "integrity": "sha512-shdaI1zT3CVNL2hnx9c0JMc0ZogGaxDs5e85akgHWKYa0yVbIyp06Ind3dVkTj/uuFrzaHBOyqFzo+VV6aXgtA==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true
+    },
+    "node_modules/array-rearrange": {
+      "version": "2.2.2",
+      "resolved": "https://registry.npmjs.org/array-rearrange/-/array-rearrange-2.2.2.tgz",
+      "integrity": "sha512-UfobP5N12Qm4Qu4fwLDIi2v6+wZsSf6snYSxAMeKhrh37YGnNWZPRmVEKc/2wfms53TLQnzfpG8wCx2Y/6NG1w==",
+      "license": "MIT",
+      "optional": true,
+      "peer": true
+    },
+    "node_modules/autoprefixer": {
+      "version": "10.4.27",
+      "resolved": "https://registry.npmjs.org/autoprefixer/-/autoprefixer-10.4.27.tgz",
+      "integrity": "sha512-NP9APE+tO+LuJGn7/9+cohklunJsXWiaWEfV3si4Gi/XHDwVNgkwr1J3RQYFIvPy76GmJ9/bW8vyoU1LcxwKHA==",
+      "dev": true,
+      "funding": [
+        {
+          "type": "opencollective",
+          "url": "https://opencollective.com/postcss/"
+        },
+        {
+          "type": "tidelift",
+          "url": "https://tidelift.com/funding/github/npm/autoprefixer"
+        },
+        {
+          "type": "github",
+          "url": "https://github.com/sponsors/ai"
+        }
+      ],
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "browserslist": "^4.28.1",
+        "caniuse-lite": "^1.0.30001774",
+        "fraction.js": "^5.3.4",
+        "picocolors": "^1.1.1",
+        "postcss-value-parser": "^4.2.0"
+      },
+      "bin": {
+        "autoprefixer": "bin/autoprefixer"
+      },
+      "engines": {
+        "node": "^10 || ^12 || >=14"
+      },
+      "peerDependencies": {
+        "postcss": "^8.1.0"
+      }
+    },
+    "node_modules/autoprefixer/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==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/rawify"
+      }
+    },
+    "node_modules/babel-plugin-polyfill-corejs2": {
+      "version": "0.4.17",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs2/-/babel-plugin-polyfill-corejs2-0.4.17.tgz",
+      "integrity": "sha512-aTyf30K/rqAsNwN76zYrdtx8obu0E4KoUME29B1xj+B3WxgvWkp943vYQ+z8Mv3lw9xHXMHpvSPOBxzAkIa94w==",
+      "dev": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
-        "fast-deep-equal": "^3.1.3"
+        "@babel/compat-data": "^7.28.6",
+        "@babel/helper-define-polyfill-provider": "^0.6.8",
+        "semver": "^6.3.1"
       },
       "peerDependencies": {
-        "ajv": "^8.8.2"
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
       }
     },
-    "node_modules/almost-equal": {
-      "version": "1.1.0",
-      "resolved": "https://registry.npmjs.org/almost-equal/-/almost-equal-1.1.0.tgz",
-      "integrity": "sha512-0V/PkoculFl5+0Lp47JoxUcO0xSxhIBvm+BxHdD/OgXNmdRpRHCFnKVuUoWyS9EzQP+otSGv0m9Lb4yVkQBn2A==",
-      "license": "MIT",
-      "peer": true
-    },
-    "node_modules/argparse": {
-      "version": "1.0.10",
-      "resolved": "https://registry.npmjs.org/argparse/-/argparse-1.0.10.tgz",
-      "integrity": "sha512-o5Roy6tNG4SL/FOkCAN6RzjiakZS25RLYFrcMttJqbdd8BWrnA+fGz57iN5Pb06pvBGvl5gQ0B48dJlslXvoTg==",
+    "node_modules/babel-plugin-polyfill-corejs2/node_modules/semver": {
+      "version": "6.3.1",
+      "resolved": "https://registry.npmjs.org/semver/-/semver-6.3.1.tgz",
+      "integrity": "sha512-BR7VvDCVHO+q2xBEWskxS6DJE1qRnb7DxzUrogb71CWoSficBxYsiAGd+Kl0mmq/MprG9yArRkyrQxTO6XjMzA==",
       "dev": true,
-      "license": "MIT",
-      "dependencies": {
-        "sprintf-js": "~1.0.2"
+      "license": "ISC",
+      "peer": true,
+      "bin": {
+        "semver": "bin/semver.js"
       }
     },
-    "node_modules/array-bounds": {
-      "version": "1.0.1",
-      "resolved": "https://registry.npmjs.org/array-bounds/-/array-bounds-1.0.1.tgz",
-      "integrity": "sha512-8wdW3ZGk6UjMPJx/glyEt0sLzzwAE1bhToPsO1W2pbpR2gULyxe3BjSiuJFheP50T/GgODVPz2fuMUmIywt8cQ==",
-      "license": "MIT",
-      "peer": true
-    },
-    "node_modules/array-find-index": {
-      "version": "1.0.2",
-      "resolved": "https://registry.npmjs.org/array-find-index/-/array-find-index-1.0.2.tgz",
-      "integrity": "sha512-M1HQyIXcBGtVywBt8WVdim+lrNaK7VHp99Qt5pSNziXznKHViIBbXWtfRTpEFpF/c4FdfxNAsCCwPp5phBYJtw==",
+    "node_modules/babel-plugin-polyfill-corejs3": {
+      "version": "0.14.2",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-corejs3/-/babel-plugin-polyfill-corejs3-0.14.2.tgz",
+      "integrity": "sha512-coWpDLJ410R781Npmn/SIBZEsAetR4xVi0SxLMXPaMO4lSf1MwnkGYMtkFxew0Dn8B3/CpbpYxN0JCgg8mn67g==",
+      "dev": true,
       "license": "MIT",
       "peer": true,
-      "engines": {
-        "node": ">=0.10.0"
+      "dependencies": {
+        "@babel/helper-define-polyfill-provider": "^0.6.8",
+        "core-js-compat": "^3.48.0"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
       }
     },
-    "node_modules/array-normalize": {
-      "version": "1.1.4",
-      "resolved": "https://registry.npmjs.org/array-normalize/-/array-normalize-1.1.4.tgz",
-      "integrity": "sha512-fCp0wKFLjvSPmCn4F5Tiw4M3lpMZoHlCjfcs7nNzuj3vqQQ1/a8cgB9DXcpDSn18c+coLnaW7rqfcYCvKbyJXg==",
+    "node_modules/babel-plugin-polyfill-regenerator": {
+      "version": "0.6.8",
+      "resolved": "https://registry.npmjs.org/babel-plugin-polyfill-regenerator/-/babel-plugin-polyfill-regenerator-0.6.8.tgz",
+      "integrity": "sha512-M762rNHfSF1EV3SLtnCJXFoQbbIIz0OyRwnCmV0KPC7qosSfCO0QLTSuJX3ayAebubhE6oYBAYPrBA5ljowaZg==",
+      "dev": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
-        "array-bounds": "^1.0.0"
+        "@babel/helper-define-polyfill-provider": "^0.6.8"
+      },
+      "peerDependencies": {
+        "@babel/core": "^7.4.0 || ^8.0.0-0 <8.0.0"
       }
     },
-    "node_modules/array-range": {
-      "version": "1.0.1",
-      "resolved": "https://registry.npmjs.org/array-range/-/array-range-1.0.1.tgz",
-      "integrity": "sha512-shdaI1zT3CVNL2hnx9c0JMc0ZogGaxDs5e85akgHWKYa0yVbIyp06Ind3dVkTj/uuFrzaHBOyqFzo+VV6aXgtA==",
-      "license": "MIT",
-      "peer": true
-    },
-    "node_modules/array-rearrange": {
-      "version": "2.2.2",
-      "resolved": "https://registry.npmjs.org/array-rearrange/-/array-rearrange-2.2.2.tgz",
-      "integrity": "sha512-UfobP5N12Qm4Qu4fwLDIi2v6+wZsSf6snYSxAMeKhrh37YGnNWZPRmVEKc/2wfms53TLQnzfpG8wCx2Y/6NG1w==",
-      "license": "MIT",
-      "peer": true
+    "node_modules/balanced-match": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/balanced-match/-/balanced-match-1.0.2.tgz",
+      "integrity": "sha512-3oSeUO0TMV67hN1AmbXsK4yaqU7tjiHlbxRDZOpH0KW9+CeX4bRAaX0Anxt0tx2MrpRpWwQaPwIlISEJhYU5Pw==",
+      "dev": true,
+      "license": "MIT"
     },
     "node_modules/base64-arraybuffer": {
       "version": "1.0.2",
       "resolved": "https://registry.npmjs.org/base64-arraybuffer/-/base64-arraybuffer-1.0.2.tgz",
       "integrity": "sha512-I3yl4r9QB5ZRY3XuJVEPfc2XhZO6YweFPI+UovAzn+8/hb3oJ6lnysaFcjVpkCPfVWFUDvoZ8kmVDP7WyRtYtQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">= 0.6.0"
       }
     },
     "node_modules/baseline-browser-mapping": {
-      "version": "2.8.21",
-      "resolved": "https://registry.npmjs.org/baseline-browser-mapping/-/baseline-browser-mapping-2.8.21.tgz",
-      "integrity": "sha512-JU0h5APyQNsHOlAM7HnQnPToSDQoEBZqzu/YBlqDnEeymPnZDREeXJA3KBMQee+dKteAxZ2AtvQEvVYdZf241Q==",
+      "version": "2.10.10",
+      "resolved": "https://registry.npmjs.org/baseline-browser-mapping/-/baseline-browser-mapping-2.10.10.tgz",
+      "integrity": "sha512-sUoJ3IMxx4AyRqO4MLeHlnGDkyXRoUG0/AI9fjK+vS72ekpV0yWVY7O0BVjmBcRtkNcsAO2QDZ4tdKKGoI6YaQ==",
+      "devOptional": true,
       "license": "Apache-2.0",
       "peer": true,
       "bin": {
-        "baseline-browser-mapping": "dist/cli.js"
+        "baseline-browser-mapping": "dist/cli.cjs"
+      },
+      "engines": {
+        "node": ">=6.0.0"
+      }
+    },
+    "node_modules/big.js": {
+      "version": "5.2.2",
+      "resolved": "https://registry.npmjs.org/big.js/-/big.js-5.2.2.tgz",
+      "integrity": "sha512-vyL2OymJxmarO8gxMr0mhChsO9QGwhynfuu4+MHTAW6czfq9humCB7rKpUjDd9YUiDPU4mzpyupFSvOClAwbmQ==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": "*"
       }
     },
     "node_modules/binary-search-bounds": {
@@ -1075,6 +3098,7 @@
       "resolved": "https://registry.npmjs.org/binary-search-bounds/-/binary-search-bounds-2.0.5.tgz",
       "integrity": "sha512-H0ea4Fd3lS1+sTEB2TgcLoK21lLhwEJzlQv3IN47pJS976Gx4zoWe0ak3q+uYh60ppQxg9F16Ri4tS1sfD4+jA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/bit-twiddle": {
@@ -1082,6 +3106,7 @@
       "resolved": "https://registry.npmjs.org/bit-twiddle/-/bit-twiddle-1.0.2.tgz",
       "integrity": "sha512-B9UhK0DKFZhoTFcfvAzhqsjStvGJp9vYWf3+6SNTtdSQnvIgfkHbgHrg/e4+TH71N2GDu8tpmCVoyfrL1d7ntA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/bitmap-sdf": {
@@ -1089,6 +3114,7 @@
       "resolved": "https://registry.npmjs.org/bitmap-sdf/-/bitmap-sdf-1.0.4.tgz",
       "integrity": "sha512-1G3U4n5JE6RAiALMxu0p1XmeZkTeCwGKykzsLTCqVzfSDaN6S7fKnkIkfejogz+iwqBWc0UYAIKnKHNN7pSfDg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/bl": {
@@ -1096,16 +3122,29 @@
       "resolved": "https://registry.npmjs.org/bl/-/bl-2.2.1.tgz",
       "integrity": "sha512-6Pesp1w0DEX1N550i/uGV/TqucVL4AM/pgThFSN/Qq9si1/DF9aIHs1BxD8V/QU0HoeHO6cQRTAuYnLPKq1e4g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "readable-stream": "^2.3.5",
         "safe-buffer": "^5.1.1"
       }
     },
+    "node_modules/brace-expansion": {
+      "version": "1.1.12",
+      "resolved": "https://registry.npmjs.org/brace-expansion/-/brace-expansion-1.1.12.tgz",
+      "integrity": "sha512-9T9UjW3r0UW5c1Q7GTwllptXwhvYmEzFhzMfZ9H7FQWt+uZePjZPjBP/W1ZEyZ1twGWom5/56TF4lPcqjnDHcg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "balanced-match": "^1.0.0",
+        "concat-map": "0.0.1"
+      }
+    },
     "node_modules/browserslist": {
-      "version": "4.27.0",
-      "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.27.0.tgz",
-      "integrity": "sha512-AXVQwdhot1eqLihwasPElhX2tAZiBjWdJ9i/Zcj2S6QYIjkx62OKSfnobkriB81C3l4w0rVy3Nt4jaTBltYEpw==",
+      "version": "4.28.1",
+      "resolved": "https://registry.npmjs.org/browserslist/-/browserslist-4.28.1.tgz",
+      "integrity": "sha512-ZC5Bd0LgJXgwGqUknZY/vkUQ04r8NXnJZ3yYi4vDmSiZmC/pdSN0NbNRPxZpbtO4uAfDUAFffO8IZoM3Gj8IkA==",
+      "devOptional": true,
       "funding": [
         {
           "type": "opencollective",
@@ -1123,11 +3162,11 @@
       "license": "MIT",
       "peer": true,
       "dependencies": {
-        "baseline-browser-mapping": "^2.8.19",
-        "caniuse-lite": "^1.0.30001751",
-        "electron-to-chromium": "^1.5.238",
-        "node-releases": "^2.0.26",
-        "update-browserslist-db": "^1.1.4"
+        "baseline-browser-mapping": "^2.9.0",
+        "caniuse-lite": "^1.0.30001759",
+        "electron-to-chromium": "^1.5.263",
+        "node-releases": "^2.0.27",
+        "update-browserslist-db": "^1.2.0"
       },
       "bin": {
         "browserslist": "cli.js"
@@ -1140,12 +3179,14 @@
       "version": "1.1.2",
       "resolved": "https://registry.npmjs.org/buffer-from/-/buffer-from-1.1.2.tgz",
       "integrity": "sha512-E+XQCRwSbaaiChtv6k6Dwgc+bx+Bs6vuKJHHl5kox/BaKbhiXzqQOwK4cO22yElGp2OCmjwVhT3HmxgyPGnJfQ==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/caniuse-lite": {
-      "version": "1.0.30001751",
-      "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001751.tgz",
-      "integrity": "sha512-A0QJhug0Ly64Ii3eIqHu5X51ebln3k4yTUkY1j8drqpWHVreg/VLijN48cZ1bYPiqOQuqpkIKnzr/Ul8V+p6Cw==",
+      "version": "1.0.30001781",
+      "resolved": "https://registry.npmjs.org/caniuse-lite/-/caniuse-lite-1.0.30001781.tgz",
+      "integrity": "sha512-RdwNCyMsNBftLjW6w01z8bKEvT6e/5tpPVEgtn22TiLGlstHOVecsX2KHFkD5e/vRnIE4EGzpuIODb3mtswtkw==",
+      "devOptional": true,
       "funding": [
         {
           "type": "opencollective",
@@ -1168,6 +3209,7 @@
       "resolved": "https://registry.npmjs.org/canvas-fit/-/canvas-fit-1.5.0.tgz",
       "integrity": "sha512-onIcjRpz69/Hx5bB5HGbYKUF2uC6QT6Gp+pfpGm3A7mPfcluSLV5v4Zu+oflDUwLdUw0rLIBhUbi0v8hM4FJQQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "element-size": "^1.1.1"
@@ -1177,6 +3219,7 @@
       "version": "1.0.4",
       "resolved": "https://registry.npmjs.org/chrome-trace-event/-/chrome-trace-event-1.0.4.tgz",
       "integrity": "sha512-rNjApaLzuwaOTjCiT8lSDdGN1APCiqkChLMJxJPWLunPAt5fy8xgU9/jNOchV84wfIxrA0lRQB7oCT8jrn/wrQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -1188,6 +3231,7 @@
       "resolved": "https://registry.npmjs.org/clamp/-/clamp-1.0.1.tgz",
       "integrity": "sha512-kgMuFyE78OC6Dyu3Dy7vcx4uy97EIbVxJB/B0eJ3bUNAkwdNcxYzgKltnyADiYwsR7SEqkkUPsEUT//OVS6XMA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/color-alpha": {
@@ -1195,6 +3239,7 @@
       "resolved": "https://registry.npmjs.org/color-alpha/-/color-alpha-1.0.4.tgz",
       "integrity": "sha512-lr8/t5NPozTSqli+duAN+x+no/2WaKTeWvxhHGN+aXT6AJ8vPlzLa7UriyjWak0pSC2jHol9JgjBYnnHsGha9A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "color-parse": "^1.3.8"
@@ -1205,6 +3250,7 @@
       "resolved": "https://registry.npmjs.org/color-parse/-/color-parse-1.4.3.tgz",
       "integrity": "sha512-BADfVl/FHkQkyo8sRBwMYBqemqsgnu7JZAwUgvBvuwwuNUZAhSvLTbsEErS5bQXzOjDR0dWzJ4vXN2Q+QoPx0A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "color-name": "^1.0.0"
@@ -1215,6 +3261,7 @@
       "resolved": "https://registry.npmjs.org/color-id/-/color-id-1.1.0.tgz",
       "integrity": "sha512-2iRtAn6dC/6/G7bBIo0uupVrIne1NsQJvJxZOBCzQOfk7jRq97feaDZ3RdzuHakRXXnHGNwglto3pqtRx1sX0g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "clamp": "^1.0.1"
@@ -1225,6 +3272,7 @@
       "resolved": "https://registry.npmjs.org/color-name/-/color-name-1.1.4.tgz",
       "integrity": "sha512-dOy+3AuW3a2wNbZHIuMZpTcgjGuLU/uBL/ubcZF9OXbDo8ff4O8yVp5Bf0efS8uEoYo5q4Fx7dY9OgQGXgAsQA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/color-normalize": {
@@ -1232,6 +3280,7 @@
       "resolved": "https://registry.npmjs.org/color-normalize/-/color-normalize-1.5.0.tgz",
       "integrity": "sha512-rUT/HDXMr6RFffrR53oX3HGWkDOP9goSAQGBkUaAYKjOE2JxozccdGyufageWDlInRAjm/jYPrf/Y38oa+7obw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "clamp": "^1.0.1",
@@ -1244,6 +3293,7 @@
       "resolved": "https://registry.npmjs.org/color-parse/-/color-parse-2.0.0.tgz",
       "integrity": "sha512-g2Z+QnWsdHLppAbrpcFWo629kLOnOPtpxYV69GCqm92gqSgyXbzlfyN3MXs0412fPBkFmiuS+rXposgBgBa6Kg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "color-name": "^1.0.0"
@@ -1254,6 +3304,7 @@
       "resolved": "https://registry.npmjs.org/color-rgba/-/color-rgba-2.1.1.tgz",
       "integrity": "sha512-VaX97wsqrMwLSOR6H7rU1Doa2zyVdmShabKrPEIFywLlHoibgD3QW9Dw6fSqM4+H/LfjprDNAUUW31qEQcGzNw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "clamp": "^1.0.1",
@@ -1266,6 +3317,7 @@
       "resolved": "https://registry.npmjs.org/color-parse/-/color-parse-1.4.3.tgz",
       "integrity": "sha512-BADfVl/FHkQkyo8sRBwMYBqemqsgnu7JZAwUgvBvuwwuNUZAhSvLTbsEErS5bQXzOjDR0dWzJ4vXN2Q+QoPx0A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "color-name": "^1.0.0"
@@ -1276,6 +3328,7 @@
       "resolved": "https://registry.npmjs.org/color-space/-/color-space-1.16.0.tgz",
       "integrity": "sha512-A6WMiFzunQ8KEPFmj02OnnoUnqhmSaHaZ/0LVFcPTdlvm8+3aMJ5x1HRHy3bDHPkovkf4sS0f4wsVvwk71fKkg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "hsluv": "^0.0.3",
@@ -1286,6 +3339,7 @@
       "version": "2.20.3",
       "resolved": "https://registry.npmjs.org/commander/-/commander-2.20.3.tgz",
       "integrity": "sha512-GpVkmM8vF2vQUkj2LvZmD35JxeJOLCwJ9cUkugyk2nuhbv3+mJvpLYYt+0+USMxE+oj+ey/lJEnhZw75x/OMcQ==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/commondir": {
@@ -1308,6 +3362,13 @@
         "url": "https://github.com/sponsors/rawify"
       }
     },
+    "node_modules/concat-map": {
+      "version": "0.0.1",
+      "resolved": "https://registry.npmjs.org/concat-map/-/concat-map-0.0.1.tgz",
+      "integrity": "sha512-/Srv4dswyQNBfohGpz9o6Yb3Gz3SrUDqBH5rTuhGR7ahtlbYKnVxw2bCFMRljaA7EXHaXZ8wsHdodFvbkhKmqg==",
+      "dev": true,
+      "license": "MIT"
+    },
     "node_modules/concat-stream": {
       "version": "1.6.2",
       "resolved": "https://registry.npmjs.org/concat-stream/-/concat-stream-1.6.2.tgz",
@@ -1316,6 +3377,7 @@
         "node >= 0.8"
       ],
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "buffer-from": "^1.0.0",
@@ -1324,11 +3386,35 @@
         "typedarray": "^0.0.6"
       }
     },
+    "node_modules/convert-source-map": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/convert-source-map/-/convert-source-map-2.0.0.tgz",
+      "integrity": "sha512-Kvp459HrV2FEJ1CAsi1Ku+MY3kasH19TFykTz2xWmMeq6bk2NU3XXvfJ+Q61m0xktWwt+1HSYf3JZsTms3aRJg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true
+    },
+    "node_modules/core-js-compat": {
+      "version": "3.49.0",
+      "resolved": "https://registry.npmjs.org/core-js-compat/-/core-js-compat-3.49.0.tgz",
+      "integrity": "sha512-VQXt1jr9cBz03b331DFDCCP90b3fanciLkgiOoy8SBHy06gNf+vQ1A3WFLqG7I8TipYIKeYK9wxd0tUrvHcOZA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "browserslist": "^4.28.1"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/core-js"
+      }
+    },
     "node_modules/core-util-is": {
       "version": "1.0.3",
       "resolved": "https://registry.npmjs.org/core-util-is/-/core-util-is-1.0.3.tgz",
       "integrity": "sha512-ZQBvi1DcpJ4GDqanjucZ2Hj3wEO5pZDS89BWbkcrvdxksJorwUDDZamX9ldFkp9aw2lmBDLgkObEA4DWNJ9FYQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/country-regex": {
@@ -1336,6 +3422,7 @@
       "resolved": "https://registry.npmjs.org/country-regex/-/country-regex-1.1.0.tgz",
       "integrity": "sha512-iSPlClZP8vX7MC3/u6s3lrDuoQyhQukh5LyABJ3hvfzbQ3Yyayd4fp04zjLnfi267B/B2FkumcWWgrbban7sSA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-font": {
@@ -1343,6 +3430,7 @@
       "resolved": "https://registry.npmjs.org/css-font/-/css-font-1.2.0.tgz",
       "integrity": "sha512-V4U4Wps4dPDACJ4WpgofJ2RT5Yqwe1lEH6wlOOaIxMi0gTjdIijsc5FmxQlZ7ZZyKQkkutqqvULOp07l9c7ssA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "css-font-size-keywords": "^1.0.0",
@@ -1361,6 +3449,7 @@
       "resolved": "https://registry.npmjs.org/css-font-size-keywords/-/css-font-size-keywords-1.0.0.tgz",
       "integrity": "sha512-Q+svMDbMlelgCfH/RVDKtTDaf5021O486ZThQPIpahnIjUkMUslC+WuOQSWTgGSrNCH08Y7tYNEmmy0hkfMI8Q==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-font-stretch-keywords": {
@@ -1368,6 +3457,7 @@
       "resolved": "https://registry.npmjs.org/css-font-stretch-keywords/-/css-font-stretch-keywords-1.0.1.tgz",
       "integrity": "sha512-KmugPO2BNqoyp9zmBIUGwt58UQSfyk1X5DbOlkb2pckDXFSAfjsD5wenb88fNrD6fvS+vu90a/tsPpb9vb0SLg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-font-style-keywords": {
@@ -1375,6 +3465,7 @@
       "resolved": "https://registry.npmjs.org/css-font-style-keywords/-/css-font-style-keywords-1.0.1.tgz",
       "integrity": "sha512-0Fn0aTpcDktnR1RzaBYorIxQily85M2KXRpzmxQPgh8pxUN9Fcn00I8u9I3grNr1QXVgCl9T5Imx0ZwKU973Vg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-font-weight-keywords": {
@@ -1382,6 +3473,7 @@
       "resolved": "https://registry.npmjs.org/css-font-weight-keywords/-/css-font-weight-keywords-1.0.0.tgz",
       "integrity": "sha512-5So8/NH+oDD+EzsnF4iaG4ZFHQ3vaViePkL1ZbZ5iC/KrsCY+WHq/lvOgrtmuOQ9pBBZ1ADGpaf+A4lj1Z9eYA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-global-keywords": {
@@ -1389,6 +3481,7 @@
       "resolved": "https://registry.npmjs.org/css-global-keywords/-/css-global-keywords-1.0.1.tgz",
       "integrity": "sha512-X1xgQhkZ9n94WDwntqst5D/FKkmiU0GlJSFZSV3kLvyJ1WC5VeyoXDOuleUD+SIuH9C7W05is++0Woh0CGfKjQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/css-loader": {
@@ -1396,6 +3489,7 @@
       "resolved": "https://registry.npmjs.org/css-loader/-/css-loader-7.1.2.tgz",
       "integrity": "sha512-6WvYYn7l/XEGN8Xu2vWFt9nVzrCn39vKyTEFf/ExEyoksJjjSZV/0/35XPlMbpnr6VGhZIUg5yJrL8tGfes/FA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "icss-utils": "^5.1.0",
@@ -1432,6 +3526,7 @@
       "resolved": "https://registry.npmjs.org/css-system-font-keywords/-/css-system-font-keywords-1.0.0.tgz",
       "integrity": "sha512-1umTtVd/fXS25ftfjB71eASCrYhilmEsvDEI6wG/QplnmlfmVM5HkZ/ZX46DT5K3eblFPgLUHt5BRCb0YXkSFA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/csscolorparser": {
@@ -1439,6 +3534,7 @@
       "resolved": "https://registry.npmjs.org/csscolorparser/-/csscolorparser-1.0.3.tgz",
       "integrity": "sha512-umPSgYwZkdFoUrH5hIq5kf0wPSXiro51nPw0j2K/c83KflkPSTBGMz6NJvMB+07VlL0y7VPo6QJcDjcgKTTm3w==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/cssesc": {
@@ -1446,6 +3542,7 @@
       "resolved": "https://registry.npmjs.org/cssesc/-/cssesc-3.0.0.tgz",
       "integrity": "sha512-/Tb/JcjK111nNScGob5MNtsntNM1aCNUDipB/TkwZFhyDrrE47SOx/18wF2bbjgc3ZzCSKW1T5nt5EbFoAz/Vg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "bin": {
         "cssesc": "bin/cssesc"
@@ -1459,6 +3556,7 @@
       "resolved": "https://registry.npmjs.org/d/-/d-1.0.2.tgz",
       "integrity": "sha512-MOqHvMWF9/9MX6nza0KgvFH4HpMU0EF5uUDXqX/BtxtU8NfB0QzRtJ8Oe/6SuS4kbhyzVJwjd97EA4PKrzJ8bw==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "es5-ext": "^0.10.64",
@@ -1473,6 +3571,7 @@
       "resolved": "https://registry.npmjs.org/d3-array/-/d3-array-1.2.4.tgz",
       "integrity": "sha512-KHW6M86R+FUPYGb3R5XiYjXPq7VzwxZ22buHhAEVG5ztoEcZZMLov530mmccaqA1GghZArjQV46fuc8kUqhhHw==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/d3-collection": {
@@ -1480,14 +3579,15 @@
       "resolved": "https://registry.npmjs.org/d3-collection/-/d3-collection-1.0.7.tgz",
       "integrity": "sha512-ii0/r5f4sjKNTfh84Di+DpztYwqKhEyUlKoPrzUFfeSkWxjW49xU2QzO9qrPrNkpdI0XJkfzvmTu8V2Zylln6A==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/d3-color": {
       "version": "3.1.0",
       "resolved": "https://registry.npmjs.org/d3-color/-/d3-color-3.1.0.tgz",
       "integrity": "sha512-zg/chbXyeBtMQ1LbD/WSoW2DpC3I0mpmPdW+ynRTj/x2DAWYrIY7qeZIHidozwV24m4iavr15lNwIwLxRmOxhA==",
+      "devOptional": true,
       "license": "ISC",
-      "peer": true,
       "engines": {
         "node": ">=12"
       }
@@ -1497,6 +3597,7 @@
       "resolved": "https://registry.npmjs.org/d3-dispatch/-/d3-dispatch-1.0.6.tgz",
       "integrity": "sha512-fVjoElzjhCEy+Hbn8KygnmMS7Or0a9sI2UzGwoB7cCtvI1XpVN9GpoYlnb3xt2YV66oXYb1fLJ8GMvP4hdU1RA==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/d3-force": {
@@ -1504,6 +3605,7 @@
       "resolved": "https://registry.npmjs.org/d3-force/-/d3-force-1.2.1.tgz",
       "integrity": "sha512-HHvehyaiUlVo5CxBJ0yF/xny4xoaxFxDnBXNvNcfW9adORGZfyNF1dj6DGLKyk4Yh3brP/1h3rnDzdIAwL08zg==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d3-collection": "1",
@@ -1516,14 +3618,15 @@
       "version": "1.4.5",
       "resolved": "https://registry.npmjs.org/d3-format/-/d3-format-1.4.5.tgz",
       "integrity": "sha512-J0piedu6Z8iB6TbIGfZgDzfXxUFN3qQRMofy2oPdXzQibYGqPB/9iMcxr/TGalU+2RsyDO+U4f33id8tbnSRMQ==",
-      "license": "BSD-3-Clause",
-      "peer": true
+      "devOptional": true,
+      "license": "BSD-3-Clause"
     },
     "node_modules/d3-geo": {
       "version": "1.12.1",
       "resolved": "https://registry.npmjs.org/d3-geo/-/d3-geo-1.12.1.tgz",
       "integrity": "sha512-XG4d1c/UJSEX9NfU02KwBL6BYPj8YKHxgBEw5om2ZnTRSbIcego6dhHwcxuSR3clxh0EpE38os1DVPOmnYtTPg==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d3-array": "1"
@@ -1534,6 +3637,7 @@
       "resolved": "https://registry.npmjs.org/d3-geo-projection/-/d3-geo-projection-2.9.0.tgz",
       "integrity": "sha512-ZULvK/zBn87of5rWAfFMc9mJOipeSo57O+BBitsKIXmU4rTVAnX1kSsJkE0R+TxY8pGNoM1nbyRRE7GYHhdOEQ==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "commander": "2",
@@ -1554,14 +3658,15 @@
       "resolved": "https://registry.npmjs.org/d3-hierarchy/-/d3-hierarchy-1.1.9.tgz",
       "integrity": "sha512-j8tPxlqh1srJHAtxfvOUwKNYJkQuBFdM1+JAUfq6xqH5eAqf93L7oG1NVqDa4CpFZNvnNKtCYEUC8KY9yEn9lQ==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/d3-interpolate": {
       "version": "3.0.1",
       "resolved": "https://registry.npmjs.org/d3-interpolate/-/d3-interpolate-3.0.1.tgz",
       "integrity": "sha512-3bYs1rOD33uo8aqJfKP3JWPAibgw8Zm2+L9vBKEHJ2Rg+viTR7o5Mmv5mZcieN+FRYaAOWX5SJATX6k1PWz72g==",
+      "devOptional": true,
       "license": "ISC",
-      "peer": true,
       "dependencies": {
         "d3-color": "1 - 3"
       },
@@ -1574,6 +3679,7 @@
       "resolved": "https://registry.npmjs.org/d3-path/-/d3-path-1.0.9.tgz",
       "integrity": "sha512-VLaYcn81dtHVTjEHd8B+pbe9yHWpXKZUC87PzoFmsFrJqgFwDe/qxfp5MlfsfM1V5E/iVt0MmEbWQ7FVIXh/bg==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/d3-quadtree": {
@@ -1581,13 +3687,58 @@
       "resolved": "https://registry.npmjs.org/d3-quadtree/-/d3-quadtree-1.0.7.tgz",
       "integrity": "sha512-RKPAeXnkC59IDGD0Wu5mANy0Q2V28L+fNe65pOCXVdVuTJS3WPKaJlFHer32Rbh9gIo9qMuJXio8ra4+YmIymA==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
+    "node_modules/d3-scale": {
+      "version": "4.0.2",
+      "resolved": "https://registry.npmjs.org/d3-scale/-/d3-scale-4.0.2.tgz",
+      "integrity": "sha512-GZW464g1SH7ag3Y7hXjf8RoUuAFIqklOAq3MRl4OaWabTFJY9PN/E1YklhXLh+OQ3fM9yS2nOkCoS+WLZ6kvxQ==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "d3-array": "2.10.0 - 3",
+        "d3-format": "1 - 3",
+        "d3-interpolate": "1.2.0 - 3",
+        "d3-time": "2.1.1 - 3",
+        "d3-time-format": "2 - 4"
+      },
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/d3-scale/node_modules/d3-array": {
+      "version": "3.2.4",
+      "resolved": "https://registry.npmjs.org/d3-array/-/d3-array-3.2.4.tgz",
+      "integrity": "sha512-tdQAmyA18i4J7wprpYq8ClcxZy3SC31QMeByyCFyRt7BVHdREQZ5lpzoe5mFEYZUWe+oq8HBvk9JjpibyEV4Jg==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "internmap": "1 - 2"
+      },
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/d3-scale/node_modules/d3-time": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/d3-time/-/d3-time-3.1.0.tgz",
+      "integrity": "sha512-VqKjzBLejbSMT4IgbmVgDjpkYrNWUYJnbCGo874u7MMKIWsILRX+OpX/gTk8MqjpT1A/c6HY2dCA77ZN0lkQ2Q==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "d3-array": "2 - 3"
+      },
+      "engines": {
+        "node": ">=12"
+      }
+    },
     "node_modules/d3-shape": {
       "version": "1.3.7",
       "resolved": "https://registry.npmjs.org/d3-shape/-/d3-shape-1.3.7.tgz",
       "integrity": "sha512-EUkvKjqPFUAZyOlhY5gzCxCeI0Aep04LwIRpsZ/mLFelJiUfnK56jo5JMDSE7yyP2kLSb6LtF+S5chMk7uqPqw==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d3-path": "1"
@@ -1597,15 +3748,15 @@
       "version": "1.1.0",
       "resolved": "https://registry.npmjs.org/d3-time/-/d3-time-1.1.0.tgz",
       "integrity": "sha512-Xh0isrZ5rPYYdqhAVk8VLnMEidhz5aP7htAADH6MfzgmmicPkTo8LhkLxci61/lCB7n7UmE3bN0leRt+qvkLxA==",
-      "license": "BSD-3-Clause",
-      "peer": true
+      "devOptional": true,
+      "license": "BSD-3-Clause"
     },
     "node_modules/d3-time-format": {
       "version": "2.3.0",
       "resolved": "https://registry.npmjs.org/d3-time-format/-/d3-time-format-2.3.0.tgz",
       "integrity": "sha512-guv6b2H37s2Uq/GefleCDtbe0XZAuy7Wa49VGkPVPMfLL9qObgBST3lEHJBMUp8S7NdLQAGIvr2KXk8Hc98iKQ==",
+      "devOptional": true,
       "license": "BSD-3-Clause",
-      "peer": true,
       "dependencies": {
         "d3-time": "1"
       }
@@ -1615,6 +3766,7 @@
       "resolved": "https://registry.npmjs.org/d3-timer/-/d3-timer-1.0.10.tgz",
       "integrity": "sha512-B1JDm0XDaQC+uvo4DT79H0XmBskgS3l6Ve+1SBCfxgmtIb1AVrPIoqd+nPSv+loMX8szQ0sVUhGngL7D5QPiXw==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/debug": {
@@ -1622,6 +3774,7 @@
       "resolved": "https://registry.npmjs.org/debug/-/debug-3.2.7.tgz",
       "integrity": "sha512-CFjzYYAi4ThfiQvizrFQevTTXHtnCqWfe7x1AhgEscTz6ZbLbfoLRLPugTQyBth6f8ZERVUSyWHFD/7Wu4t1XQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "ms": "^2.1.1"
@@ -1643,11 +3796,48 @@
         "node": ">=0.10.0"
       }
     },
+    "node_modules/define-data-property": {
+      "version": "1.1.4",
+      "resolved": "https://registry.npmjs.org/define-data-property/-/define-data-property-1.1.4.tgz",
+      "integrity": "sha512-rBMvIzlpA8v6E+SJZoo++HAYqsLrkg7MSfIinMPFhmkorw7X+dOXVJQs+QT69zGkzMyfDnIMN2Wid1+NbL3T+A==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "es-define-property": "^1.0.0",
+        "es-errors": "^1.3.0",
+        "gopd": "^1.0.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
+    "node_modules/define-properties": {
+      "version": "1.2.1",
+      "resolved": "https://registry.npmjs.org/define-properties/-/define-properties-1.2.1.tgz",
+      "integrity": "sha512-8QmQKqEASLd5nx0U1B1okLElbUuuttJ/AnYmRXbbbGDWh6uS208EjD4Xqq/I9wK7u0v6O08XhTWnt5XtEbR6Dg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "define-data-property": "^1.0.1",
+        "has-property-descriptors": "^1.0.0",
+        "object-keys": "^1.1.1"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
     "node_modules/defined": {
       "version": "1.0.1",
       "resolved": "https://registry.npmjs.org/defined/-/defined-1.0.1.tgz",
       "integrity": "sha512-hsBd2qSVCRE+5PmNdHt1uzyrFu5d3RwmFDKzyNZMFq/EwDNJF7Ee5+D5oEKF0hU6LhtoUF1macFvOe4AskQC1Q==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "funding": {
         "url": "https://github.com/sponsors/ljharb"
@@ -1658,6 +3848,7 @@
       "resolved": "https://registry.npmjs.org/detect-kerning/-/detect-kerning-2.1.2.tgz",
       "integrity": "sha512-I3JIbrnKPAntNLl1I6TpSQQdQ4AutYzv/sKMFKbepawV/hlH0GmYKhUoOEMd4xqaUHT+Bm0f4127lh5qs1m1tw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/draco3d": {
@@ -1672,6 +3863,7 @@
       "resolved": "https://registry.npmjs.org/draw-svg-path/-/draw-svg-path-1.0.0.tgz",
       "integrity": "sha512-P8j3IHxcgRMcY6sDzr0QvJDLzBnJJqpTG33UZ2Pvp8rw0apCHhJCWqYprqrXjrgHnJ6tuhP1iTJSAodPDHxwkg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "abs-svg-path": "~0.1.1",
@@ -1683,6 +3875,7 @@
       "resolved": "https://registry.npmjs.org/dtype/-/dtype-2.0.0.tgz",
       "integrity": "sha512-s2YVcLKdFGS0hpFqJaTwscsyt0E8nNFdmo73Ocd81xNPj4URI4rj6D60A+vFMIw7BXWlb4yRkEwfBqcZzPGiZg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">= 0.8.0"
@@ -1693,6 +3886,7 @@
       "resolved": "https://registry.npmjs.org/dup/-/dup-1.0.0.tgz",
       "integrity": "sha512-Bz5jxMMC0wgp23Zm15ip1x8IhYRqJvF3nFC0UInJUDkN1z4uNPk9jTnfCUJXbOGiQ1JbXLQsiV41Fb+HXcj5BA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/duplexify": {
@@ -1700,6 +3894,7 @@
       "resolved": "https://registry.npmjs.org/duplexify/-/duplexify-3.7.1.tgz",
       "integrity": "sha512-07z8uv2wMyS51kKhD1KsdXJg5WQ6t93RneqRxUHnskXVtlYYkLqM0gqStQZ3pj073g687jPCHrqNfCzawLYh5g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "end-of-stream": "^1.0.0",
@@ -1713,12 +3908,14 @@
       "resolved": "https://registry.npmjs.org/earcut/-/earcut-2.2.4.tgz",
       "integrity": "sha512-/pjZsA1b4RPHbeWZQn66SWS8nZZWLQQ23oE3Eam7aroEFGEvwKAsJfZ9ytiEMycfzXWpca4FA9QIOehf7PocBQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/electron-to-chromium": {
-      "version": "1.5.243",
-      "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.5.243.tgz",
-      "integrity": "sha512-ZCphxFW3Q1TVhcgS9blfut1PX8lusVi2SvXQgmEEnK4TCmE1JhH2JkjJN+DNt0pJJwfBri5AROBnz2b/C+YU9g==",
+      "version": "1.5.322",
+      "resolved": "https://registry.npmjs.org/electron-to-chromium/-/electron-to-chromium-1.5.322.tgz",
+      "integrity": "sha512-vFU34OcrvMcH66T+dYC3G4nURmgfDVewMIu6Q2urXpumAPSMmzvcn04KVVV8Opikq8Vs5nUbO/8laNhNRqSzYw==",
+      "devOptional": true,
       "license": "ISC",
       "peer": true
     },
@@ -1727,6 +3924,7 @@
       "resolved": "https://registry.npmjs.org/element-size/-/element-size-1.1.1.tgz",
       "integrity": "sha512-eaN+GMOq/Q+BIWy0ybsgpcYImjGIdNLyjLFJU4XsLHXYQao5jCNb36GyN6C2qwmDDYSfIBmKpPpr4VnBdLCsPQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/elementary-circuits-directed-graph": {
@@ -1734,16 +3932,28 @@
       "resolved": "https://registry.npmjs.org/elementary-circuits-directed-graph/-/elementary-circuits-directed-graph-1.3.1.tgz",
       "integrity": "sha512-ZEiB5qkn2adYmpXGnJKkxT8uJHlW/mxmBpmeqawEHzPxh9HkLD4/1mFYX5l0On+f6rcPIt8/EWlRU2Vo3fX6dQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "strongly-connected-components": "^1.0.1"
       }
     },
+    "node_modules/emojis-list": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/emojis-list/-/emojis-list-3.0.0.tgz",
+      "integrity": "sha512-/kyM18EfinwXZbno9FyUGeFh87KC8HRQBQGildHZbEuRyWFOmv1U10o9BBp8XVZDVNNuQKyIGIu5ZYAAXJ0V2Q==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 4"
+      }
+    },
     "node_modules/end-of-stream": {
       "version": "1.4.5",
       "resolved": "https://registry.npmjs.org/end-of-stream/-/end-of-stream-1.4.5.tgz",
       "integrity": "sha512-ooEGc6HP26xXq/N+GCGOT0JKCLDGrq2bQUZrQ7gyrJiZANJ/8YDTxTpQBXGMn+WbIQXNVpyWymm7KYVICQnyOg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "once": "^1.4.0"
@@ -1753,6 +3963,7 @@
       "version": "5.18.3",
       "resolved": "https://registry.npmjs.org/enhanced-resolve/-/enhanced-resolve-5.18.3.tgz",
       "integrity": "sha512-d4lC8xfavMeBjzGr2vECC3fsGXziXZQyJxD868h2M/mBI3PwAuODxAkLkq5HYuvrPYcUtiLzsTo8U3PgX3Ocww==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -1763,10 +3974,31 @@
         "node": ">=10.13.0"
       }
     },
+    "node_modules/es-define-property": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/es-define-property/-/es-define-property-1.0.1.tgz",
+      "integrity": "sha512-e3nRfgfUZ4rNGL232gUgX06QNyyez04KdjFrF+LTRoOXmrOgFKDg4BCdsjW8EnT69eqdYGmRpJwiPVYNrCaW3g==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
+    "node_modules/es-errors": {
+      "version": "1.3.0",
+      "resolved": "https://registry.npmjs.org/es-errors/-/es-errors-1.3.0.tgz",
+      "integrity": "sha512-Zf5H2Kxt2xjTvbJvP2ZWLEICxA6j+hAmMzIlypy4xcBg1vKVnx89Wy0GbS+kf5cwCVFFzdCFh2XSCFNULS6csw==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
     "node_modules/es-module-lexer": {
       "version": "1.7.0",
       "resolved": "https://registry.npmjs.org/es-module-lexer/-/es-module-lexer-1.7.0.tgz",
       "integrity": "sha512-jEQoCwk8hyb2AZziIOLhDqpm5+2ww5uIE6lkO/6jcOCusfk6LhMHpXXfBLXTZ7Ydyt0j4VoUQv6uGNYbdW+kBA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -1776,6 +4008,7 @@
       "integrity": "sha512-p2snDhiLaXe6dahss1LddxqEm+SkuDvV8dnIQG0MWjyHpcMNfXKPE+/Cc0y+PhxJX3A4xGNeFCj5oc0BUh6deg==",
       "hasInstallScript": true,
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "es6-iterator": "^2.0.3",
@@ -1792,6 +4025,7 @@
       "resolved": "https://registry.npmjs.org/es6-iterator/-/es6-iterator-2.0.3.tgz",
       "integrity": "sha512-zw4SRzoUkd+cl+ZoE15A9o1oQd920Bb0iOJMQkQhl3jNc03YqVjAhG7scf9C5KWRU/R13Orf588uCC6525o02g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d": "1",
@@ -1804,6 +4038,7 @@
       "resolved": "https://registry.npmjs.org/es6-symbol/-/es6-symbol-3.1.4.tgz",
       "integrity": "sha512-U9bFFjX8tFiATgtkJ1zg25+KviIXpgRvRHS8sau3GfhVzThRQrOeksPeT0BWW2MNZs1OEWJ1DPXOQMn0KKRkvg==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d": "^1.0.2",
@@ -1818,6 +4053,7 @@
       "resolved": "https://registry.npmjs.org/es6-weak-map/-/es6-weak-map-2.0.3.tgz",
       "integrity": "sha512-p5um32HOTO1kP+w7PRnB+5lQ43Z6muuMuIMffvDN8ZB4GcnjLBV6zGStpbASIMk4DCAvEaamhe2zhyCb/QXXsA==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d": "1",
@@ -1830,6 +4066,7 @@
       "version": "3.2.0",
       "resolved": "https://registry.npmjs.org/escalade/-/escalade-3.2.0.tgz",
       "integrity": "sha512-WUj2qlxaQtO4g6Pq5c29GTcWGDyd8itL8zTlipgECz3JesAiiOKotd8JU6otB3PACgG6xkJUyVhboMS+bje/jA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -1847,6 +4084,7 @@
       "resolved": "https://registry.npmjs.org/escodegen/-/escodegen-2.1.0.tgz",
       "integrity": "sha512-2NlIDTwUWJN0mRPQOdtQBzbUHvdGY2P1VXSyU83Q3xKxM7WHX2Ql8dKq782Q9TgQUNOLEzEYu9bzLNj1q88I5w==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "esprima": "^4.0.1",
@@ -1868,6 +4106,7 @@
       "version": "5.1.1",
       "resolved": "https://registry.npmjs.org/eslint-scope/-/eslint-scope-5.1.1.tgz",
       "integrity": "sha512-2NxwbF/hZ0KpepYN0cNbo+FN6XoK7GaHlQhgx/hIZl6Va0bF45RQOOwhLIy8lQDbuCiadSLCBnH2CFYquit5bw==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true,
       "dependencies": {
@@ -1882,6 +4121,7 @@
       "version": "4.3.0",
       "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-4.3.0.tgz",
       "integrity": "sha512-39nnKffWz8xN1BU/2c79n9nB9HDzo0niYUqx6xyqUnyoAnQyyWpOTdZEeiCch8BBu515t4wp9ZmgVfVhn9EBpw==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true,
       "engines": {
@@ -1893,6 +4133,7 @@
       "resolved": "https://registry.npmjs.org/esniff/-/esniff-2.0.1.tgz",
       "integrity": "sha512-kTUIGKQ/mDPFoJ0oVfcmyJn4iBDRptjNVIzwIFR7tqWXdVI9xfA2RMwY/gbSpJG3lkdWNEjLap/NqVHZiJsdfg==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d": "^1.0.1",
@@ -1908,8 +4149,8 @@
       "version": "4.0.1",
       "resolved": "https://registry.npmjs.org/esprima/-/esprima-4.0.1.tgz",
       "integrity": "sha512-eGuFFw7Upda+g4p+QHvnW0RyTX/SVeJBDM/gCtMARO0cLuT2HcEKnTPvhjV6aGeqrCB/sbNop0Kszm0jsaWU4A==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
-      "peer": true,
       "bin": {
         "esparse": "bin/esparse.js",
         "esvalidate": "bin/esvalidate.js"
@@ -1922,6 +4163,7 @@
       "version": "4.3.0",
       "resolved": "https://registry.npmjs.org/esrecurse/-/esrecurse-4.3.0.tgz",
       "integrity": "sha512-KmfKL3b6G+RXvP8N1vr3Tq1kL/oCFgn2NYXEtqP8/L3pKapUA4G8cFVaoF3SU323CD4XypR/ffioHmkti6/Tag==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true,
       "dependencies": {
@@ -1935,6 +4177,7 @@
       "version": "5.3.0",
       "resolved": "https://registry.npmjs.org/estraverse/-/estraverse-5.3.0.tgz",
       "integrity": "sha512-MMdARuVEQziNTeJD8DgMqmhwR11BRQ/cBP+pLtYdSTnf3MIO8fFeiINEbX36ZdNlfU/7A9f3gUw49B3oQsvwBA==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true,
       "engines": {
@@ -1952,6 +4195,7 @@
       "version": "2.0.3",
       "resolved": "https://registry.npmjs.org/esutils/-/esutils-2.0.3.tgz",
       "integrity": "sha512-kVscqXk4OCp68SZ0dkgEKVi6/8ij300KBWTJq32P/dYeWTSwK41WyTxalN1eRmA5Z9UU/LX9D7FWSmV9SAYx6g==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true,
       "engines": {
@@ -1963,6 +4207,7 @@
       "resolved": "https://registry.npmjs.org/event-emitter/-/event-emitter-0.3.5.tgz",
       "integrity": "sha512-D9rRn9y7kLPnJ+hMq7S/nhvoKwwvVJahBi2BPmx3bvbsEdK3W9ii8cBSGjP+72/LnM4n6fo3+dkCX5FeTQruXA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "d": "1",
@@ -1973,6 +4218,7 @@
       "version": "3.3.0",
       "resolved": "https://registry.npmjs.org/events/-/events-3.3.0.tgz",
       "integrity": "sha512-mQw+2fkQbALzQ7V0MY0IqdnXNOeTtP4r0lN9z7AAawCXgqea7bDii20AYrIBrFd/Hx0M2Ocz6S111CaFkUcb0Q==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -1984,6 +4230,7 @@
       "resolved": "https://registry.npmjs.org/ext/-/ext-1.7.0.tgz",
       "integrity": "sha512-6hxeJYaL110a9b5TEJSj0gojyHQAmA2ch5Os+ySCiA1QGdS697XWY1pzsrSjqA9LDEEgdB/KypIlR59RcLuHYw==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "type": "^2.7.2"
@@ -1994,6 +4241,7 @@
       "resolved": "https://registry.npmjs.org/falafel/-/falafel-2.2.5.tgz",
       "integrity": "sha512-HuC1qF9iTnHDnML9YZAdCDQwT0yKl/U55K4XSUXqGAA2GLoafFgWRqdAbhWJxXaYD4pyoVxAJ8wH670jMpI9DQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "acorn": "^7.1.1",
@@ -2008,6 +4256,7 @@
       "resolved": "https://registry.npmjs.org/acorn/-/acorn-7.4.1.tgz",
       "integrity": "sha512-nQyp0o1/mNdbTO1PO6kHkwSrmgZ0MT/jCCpNiwbUjGoRN4dlBhqJtoQuCnEOKzgTVwg0ZWiCoQy6SxMebQVh8A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "bin": {
         "acorn": "bin/acorn"
@@ -2020,23 +4269,32 @@
       "version": "3.1.3",
       "resolved": "https://registry.npmjs.org/fast-deep-equal/-/fast-deep-equal-3.1.3.tgz",
       "integrity": "sha512-f3qQ9oQy9j2AhBe/H9VC91wLmKBCCU/gDOnKNAYG5hswO7BLKj09Hc5HYNz9cGI++xlpDCIgDaitVs03ATR84Q==",
-      "license": "MIT",
-      "peer": true
+      "devOptional": true,
+      "license": "MIT"
     },
     "node_modules/fast-isnumeric": {
       "version": "1.1.4",
       "resolved": "https://registry.npmjs.org/fast-isnumeric/-/fast-isnumeric-1.1.4.tgz",
       "integrity": "sha512-1mM8qOr2LYz8zGaUdmiqRDiuue00Dxjgcb1NQR7TnhLVh6sQyngP9xvLo7Sl7LZpP/sk5eb+bcyWXw530NTBZw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "is-string-blank": "^1.0.1"
       }
     },
+    "node_modules/fast-json-stable-stringify": {
+      "version": "2.1.0",
+      "resolved": "https://registry.npmjs.org/fast-json-stable-stringify/-/fast-json-stable-stringify-2.1.0.tgz",
+      "integrity": "sha512-lhd/wF+Lk98HZoTCtlVraHtfh5XYijIjalXck7saUtuanSDyLMxnHhSXEDJqHxD7msR8D0uCmqlkwjCV8xvwHw==",
+      "dev": true,
+      "license": "MIT"
+    },
     "node_modules/fast-uri": {
       "version": "3.1.0",
       "resolved": "https://registry.npmjs.org/fast-uri/-/fast-uri-3.1.0.tgz",
       "integrity": "sha512-iPeeDKJSWf4IEOasVVrknXpaBV0IApz/gp7S2bb7Z4Lljbl2MGJRqInZiUrQwV16cpzw/D3S5j5Julj/gT52AA==",
+      "devOptional": true,
       "funding": [
         {
           "type": "github",
@@ -2065,6 +4323,13 @@
         }
       }
     },
+    "node_modules/fflate": {
+      "version": "0.7.3",
+      "resolved": "https://registry.npmjs.org/fflate/-/fflate-0.7.3.tgz",
+      "integrity": "sha512-0Zz1jOzJWERhyhsimS54VTqOteCNwRtIlh8isdL0AXLo0g7xNTfTL7oWrkmCnPhZGocKIkWHBistBrrpoNH3aw==",
+      "dev": true,
+      "license": "MIT"
+    },
     "node_modules/find-cache-dir": {
       "version": "3.3.2",
       "resolved": "https://registry.npmjs.org/find-cache-dir/-/find-cache-dir-3.3.2.tgz",
@@ -2102,6 +4367,7 @@
       "resolved": "https://registry.npmjs.org/flatten-vertex-data/-/flatten-vertex-data-1.0.2.tgz",
       "integrity": "sha512-BvCBFK2NZqerFTdMDgqfHBwxYWnxeCkwONsw6PvBMcUXqo8U/KDWwmXhqx1x2kLIg7DqIsJfOaJFOmlua3Lxuw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "dtype": "^2.0.0"
@@ -2112,6 +4378,7 @@
       "resolved": "https://registry.npmjs.org/font-atlas/-/font-atlas-2.1.0.tgz",
       "integrity": "sha512-kP3AmvX+HJpW4w3d+PiPR2X6E1yvsBXt2yhuCw+yReO9F1WYhvZwx3c95DGZGwg9xYzDGrgJYa885xmVA+28Cg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "css-font": "^1.0.0"
@@ -2122,6 +4389,7 @@
       "resolved": "https://registry.npmjs.org/font-measure/-/font-measure-1.2.2.tgz",
       "integrity": "sha512-mRLEpdrWzKe9hbfaF3Qpr06TAjquuBVP5cHy4b3hyeNdjc9i0PO6HniGsX5vjL5OWv7+Bd++NiooNpT/s8BvIA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "css-font": "^1.2.0"
@@ -2145,6 +4413,7 @@
       "resolved": "https://registry.npmjs.org/from2/-/from2-2.3.0.tgz",
       "integrity": "sha512-OMcX/4IC/uqEPVgGeyfN22LJk6AZrMkRZHxcHBMBvHScDGgwTm2GT2Wkgtocyd3JfZffjj2kYUDXXII0Fk9W0g==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "inherits": "^2.0.1",
@@ -2166,6 +4435,13 @@
         "node": ">=12"
       }
     },
+    "node_modules/fs.realpath": {
+      "version": "1.0.0",
+      "resolved": "https://registry.npmjs.org/fs.realpath/-/fs.realpath-1.0.0.tgz",
+      "integrity": "sha512-OO0pH2lK6a0hZnAdau5ItzHPI6pUlvI7jMVnxUQRtw4owF2wk8lOSabtGDCTP4Ggrg2MbGnWO9X8K1t4+fGMDw==",
+      "dev": true,
+      "license": "ISC"
+    },
     "node_modules/fsevents": {
       "version": "2.3.3",
       "resolved": "https://registry.npmjs.org/fsevents/-/fsevents-2.3.3.tgz",
@@ -2185,16 +4461,29 @@
       "version": "1.1.2",
       "resolved": "https://registry.npmjs.org/function-bind/-/function-bind-1.1.2.tgz",
       "integrity": "sha512-7XHNxH7qX9xG5mIwxkhumTox/MIRNcOgDrxWsMt2pAr23WHp6MrRlN7FBSFpCpr+oVO0F744iUgR82nJMfG2SA==",
+      "devOptional": true,
       "license": "MIT",
       "funding": {
         "url": "https://github.com/sponsors/ljharb"
       }
     },
+    "node_modules/gensync": {
+      "version": "1.0.0-beta.2",
+      "resolved": "https://registry.npmjs.org/gensync/-/gensync-1.0.0-beta.2.tgz",
+      "integrity": "sha512-3hN7NaskYvMDLQY55gnW3NQ+mesEAepTqlg+VEbj7zzqEMBVNhzcGYYeqFo/TlYz6eQiFcp1HcsCZO+nGgS8zg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=6.9.0"
+      }
+    },
     "node_modules/geojson-vt": {
       "version": "3.2.1",
       "resolved": "https://registry.npmjs.org/geojson-vt/-/geojson-vt-3.2.1.tgz",
       "integrity": "sha512-EvGQQi/zPrDA6zr6BnJD/YhwAkBP8nnJ9emh3EnHQKVMfg/MRVtPbMYdgVy/IaEmn4UfagD2a6fafPDL5hbtwg==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/get-canvas-context": {
@@ -2202,6 +4491,7 @@
       "resolved": "https://registry.npmjs.org/get-canvas-context/-/get-canvas-context-1.0.2.tgz",
       "integrity": "sha512-LnpfLf/TNzr9zVOGiIY6aKCz8EKuXmlYNV7CM2pUjBa/B+c2I15tS7KLySep75+FuerJdmArvJLcsAXWEy2H0A==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/get-stream": {
@@ -2209,6 +4499,7 @@
       "resolved": "https://registry.npmjs.org/get-stream/-/get-stream-6.0.1.tgz",
       "integrity": "sha512-ts6Wi+2j3jQjqi70w5AlN8DFnkSwC+MqmxEzdEALB2qXZYV3X/b1CTfgPLGJNMeAWxdPfU8FO1ms3NUfaHCPYg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=10"
@@ -2222,12 +4513,14 @@
       "resolved": "https://registry.npmjs.org/gl-mat4/-/gl-mat4-1.2.0.tgz",
       "integrity": "sha512-sT5C0pwB1/e9G9AvAoLsoaJtbMGjfd/jfxo8jMCKqYYEnjZuFvqV5rehqar0538EmssjdDeiEWnKyBSTw7quoA==",
       "license": "Zlib",
+      "optional": true,
       "peer": true
     },
     "node_modules/gl-matrix": {
       "version": "3.4.3",
       "resolved": "https://registry.npmjs.org/gl-matrix/-/gl-matrix-3.4.3.tgz",
       "integrity": "sha512-wcCp8vu8FT22BnvKVPjXa/ICBWRq/zjFfdofZy1WSpQZpphblv12/bOQLBC1rMM7SGOFS9ltVmKOHil5+Ml7gA==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/gl-text": {
@@ -2235,6 +4528,7 @@
       "resolved": "https://registry.npmjs.org/gl-text/-/gl-text-1.4.0.tgz",
       "integrity": "sha512-o47+XBqLCj1efmuNyCHt7/UEJmB9l66ql7pnobD6p+sgmBUdzfMZXIF0zD2+KRfpd99DJN+QXdvTFAGCKCVSmQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "bit-twiddle": "^1.0.2",
@@ -2261,6 +4555,7 @@
       "resolved": "https://registry.npmjs.org/gl-util/-/gl-util-3.1.3.tgz",
       "integrity": "sha512-dvRTggw5MSkJnCbh74jZzSoTOGnVYK+Bt+Ckqm39CVcl6+zSsxqWk4lr5NKhkqXHL6qvZAU9h17ZF8mIskY9mA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "is-browser": "^2.0.1",
@@ -2272,10 +4567,33 @@
         "weak-map": "^1.0.5"
       }
     },
+    "node_modules/glob": {
+      "version": "7.2.3",
+      "resolved": "https://registry.npmjs.org/glob/-/glob-7.2.3.tgz",
+      "integrity": "sha512-nFR0zLpU2YCaRxwoCJvL6UvCH2JFyFVIvwTLsIf21AuHlMskA1hhTdk+LlYJtOlYt9v6dvszD2BGRqBL+iQK9Q==",
+      "deprecated": "Old versions of glob are not supported, and contain widely publicized security vulnerabilities, which have been fixed in the current version. Please update. Support for old versions may be purchased (at exorbitant rates) by contacting i@izs.me",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "fs.realpath": "^1.0.0",
+        "inflight": "^1.0.4",
+        "inherits": "2",
+        "minimatch": "^3.1.1",
+        "once": "^1.3.0",
+        "path-is-absolute": "^1.0.0"
+      },
+      "engines": {
+        "node": "*"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/isaacs"
+      }
+    },
     "node_modules/glob-to-regexp": {
       "version": "0.4.1",
       "resolved": "https://registry.npmjs.org/glob-to-regexp/-/glob-to-regexp-0.4.1.tgz",
       "integrity": "sha512-lkX1HJXwyMcprw/5YUZc2s7DrpAiHB21/V+E1rHUrVNokkvB6bqMzT0VfV6/86ZNabt1k14YOIaT7nDvOX3Iiw==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "peer": true
     },
@@ -2284,6 +4602,7 @@
       "resolved": "https://registry.npmjs.org/global-prefix/-/global-prefix-4.0.0.tgz",
       "integrity": "sha512-w0Uf9Y9/nyHinEk5vMJKRie+wa4kR5hmDbEhGGds/kG1PwGLLHKRoNMeJOyCQjjBkANlnScqgzcFwGHgmgLkVA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "ini": "^4.1.3",
@@ -2294,11 +4613,28 @@
         "node": ">=16"
       }
     },
+    "node_modules/globalthis": {
+      "version": "1.0.3",
+      "resolved": "https://registry.npmjs.org/globalthis/-/globalthis-1.0.3.tgz",
+      "integrity": "sha512-sFdI5LyBiNTHjRd7cGPWapiHWMOXKyuBNX/cWJ3NfzrZQVa8GI/8cofCl74AOVqq9W5kNmguTIzJ/1s2gyI9wA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "define-properties": "^1.1.3"
+      },
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
     "node_modules/glsl-inject-defines": {
       "version": "1.0.3",
       "resolved": "https://registry.npmjs.org/glsl-inject-defines/-/glsl-inject-defines-1.0.3.tgz",
       "integrity": "sha512-W49jIhuDtF6w+7wCMcClk27a2hq8znvHtlGnrYkSWEr8tHe9eA2dcnohlcAmxLYBSpSSdzOkRdyPTrx9fw49+A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "glsl-token-inject-block": "^1.0.0",
@@ -2311,6 +4647,7 @@
       "resolved": "https://registry.npmjs.org/glsl-resolve/-/glsl-resolve-0.0.1.tgz",
       "integrity": "sha512-xxFNsfnhZTK9NBhzJjSBGX6IOqYpvBHxxmo+4vapiljyGNCY0Bekzn0firQkQrazK59c1hYxMDxYS8MDlhw4gA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "resolve": "^0.6.1",
@@ -2322,12 +4659,14 @@
       "resolved": "https://registry.npmjs.org/resolve/-/resolve-0.6.3.tgz",
       "integrity": "sha512-UHBY3viPlJKf85YijDUcikKX6tmF4SokIDp518ZDVT92JNDcG5uKIthaT/owt3Sar0lwtOafsQuwrg22/v2Dwg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-resolve/node_modules/xtend": {
       "version": "2.2.0",
       "resolved": "https://registry.npmjs.org/xtend/-/xtend-2.2.0.tgz",
       "integrity": "sha512-SLt5uylT+4aoXxXuwtQp5ZnMMzhDb1Xkg4pEqc00WUJCQifPfV9Ub1VrNhp9kXkrjZD2I2Hl8WnjP37jzZLPZw==",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.4"
@@ -2338,6 +4677,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-assignments/-/glsl-token-assignments-2.0.2.tgz",
       "integrity": "sha512-OwXrxixCyHzzA0U2g4btSNAyB2Dx8XrztY5aVUCjRSh4/D0WoJn8Qdps7Xub3sz6zE73W3szLrmWtQ7QMpeHEQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-defines": {
@@ -2345,6 +4685,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-defines/-/glsl-token-defines-1.0.0.tgz",
       "integrity": "sha512-Vb5QMVeLjmOwvvOJuPNg3vnRlffscq2/qvIuTpMzuO/7s5kT+63iL6Dfo2FYLWbzuiycWpbC0/KV0biqFwHxaQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "glsl-tokenizer": "^2.0.0"
@@ -2355,6 +4696,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-depth/-/glsl-token-depth-1.1.2.tgz",
       "integrity": "sha512-eQnIBLc7vFf8axF9aoi/xW37LSWd2hCQr/3sZui8aBJnksq9C7zMeUYHVJWMhFzXrBU7fgIqni4EhXVW4/krpg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-descope": {
@@ -2362,6 +4704,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-descope/-/glsl-token-descope-1.0.2.tgz",
       "integrity": "sha512-kS2PTWkvi/YOeicVjXGgX5j7+8N7e56srNDEHDTVZ1dcESmbmpmgrnpjPcjxJjMxh56mSXYoFdZqb90gXkGjQw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "glsl-token-assignments": "^2.0.0",
@@ -2375,6 +4718,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-inject-block/-/glsl-token-inject-block-1.1.0.tgz",
       "integrity": "sha512-q/m+ukdUBuHCOtLhSr0uFb/qYQr4/oKrPSdIK2C4TD+qLaJvqM9wfXIF/OOBjuSA3pUoYHurVRNao6LTVVUPWA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-properties": {
@@ -2382,6 +4726,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-properties/-/glsl-token-properties-1.0.1.tgz",
       "integrity": "sha512-dSeW1cOIzbuUoYH0y+nxzwK9S9O3wsjttkq5ij9ZGw0OS41BirKJzzH48VLm8qLg+au6b0sINxGC0IrGwtQUcA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-scope": {
@@ -2389,6 +4734,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-scope/-/glsl-token-scope-1.1.2.tgz",
       "integrity": "sha512-YKyOMk1B/tz9BwYUdfDoHvMIYTGtVv2vbDSLh94PT4+f87z21FVdou1KNKgF+nECBTo0fJ20dpm0B1vZB1Q03A==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-string": {
@@ -2396,6 +4742,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-string/-/glsl-token-string-1.0.1.tgz",
       "integrity": "sha512-1mtQ47Uxd47wrovl+T6RshKGkRRCYWhnELmkEcUAPALWGTFe2XZpH3r45XAwL2B6v+l0KNsCnoaZCSnhzKEksg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-token-whitespace-trim": {
@@ -2403,6 +4750,7 @@
       "resolved": "https://registry.npmjs.org/glsl-token-whitespace-trim/-/glsl-token-whitespace-trim-1.0.0.tgz",
       "integrity": "sha512-ZJtsPut/aDaUdLUNtmBYhaCmhIjpKNg7IgZSfX5wFReMc2vnj8zok+gB/3Quqs0TsBSX/fGnqUUYZDqyuc2xLQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-tokenizer": {
@@ -2410,6 +4758,7 @@
       "resolved": "https://registry.npmjs.org/glsl-tokenizer/-/glsl-tokenizer-2.1.5.tgz",
       "integrity": "sha512-XSZEJ/i4dmz3Pmbnpsy3cKh7cotvFlBiZnDOwnj/05EwNp2XrhQ4XKJxT7/pDt4kp4YcpRSKz8eTV7S+mwV6MA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "through2": "^0.6.3"
@@ -2420,6 +4769,7 @@
       "resolved": "https://registry.npmjs.org/isarray/-/isarray-0.0.1.tgz",
       "integrity": "sha512-D2S+3GLxWH+uhrNEcoh/fnmYeP8E8/zHl644d/jdA0g2uyXvy3sb0qxotE+ne0LtccHknQzWwZEzhak7oJ0COQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-tokenizer/node_modules/readable-stream": {
@@ -2427,6 +4777,7 @@
       "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-1.0.34.tgz",
       "integrity": "sha512-ok1qVCJuRkNmvebYikljxJA/UEsKwLl2nI1OmaqAu4/UE+h0wKCHok4XkL/gvi39OacXvw59RJUOFUkDib2rHg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "core-util-is": "~1.0.0",
@@ -2440,6 +4791,7 @@
       "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-0.10.31.tgz",
       "integrity": "sha512-ev2QzSzWPYmy9GuqfIVildA4OdcGLeFZQrq5ys6RtiuF+RQQiZWr8TZNyAcuVXyQRYfEO+MsoB/1BuQVhOJuoQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/glsl-tokenizer/node_modules/through2": {
@@ -2447,6 +4799,7 @@
       "resolved": "https://registry.npmjs.org/through2/-/through2-0.6.5.tgz",
       "integrity": "sha512-RkK/CCESdTKQZHdmKICijdKKsCRVHs5KsLZ6pACAmF/1GPUQhonHSXWNERctxEp7RmvjdNbZTL5z9V7nSCXKcg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "readable-stream": ">=1.0.33-1 <1.1.0-0",
@@ -2458,6 +4811,7 @@
       "resolved": "https://registry.npmjs.org/glslify/-/glslify-7.1.1.tgz",
       "integrity": "sha512-bud98CJ6kGZcP9Yxcsi7Iz647wuDz3oN+IZsjCRi5X1PI7t/xPKeL0mOwXJjo+CRZMqvq0CkSJiywCcY7kVYog==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "bl": "^2.2.1",
@@ -2485,6 +4839,7 @@
       "resolved": "https://registry.npmjs.org/glslify-bundle/-/glslify-bundle-5.1.1.tgz",
       "integrity": "sha512-plaAOQPv62M1r3OsWf2UbjN0hUYAB7Aph5bfH58VxJZJhloRNbxOL9tl/7H71K7OLJoSJ2ZqWOKk3ttQ6wy24A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "glsl-inject-defines": "^1.0.1",
@@ -2504,6 +4859,7 @@
       "resolved": "https://registry.npmjs.org/glslify-deps/-/glslify-deps-1.3.2.tgz",
       "integrity": "sha512-7S7IkHWygJRjcawveXQjRXLO2FTjijPDYC7QfZyAQanY+yGLCFHYnPtsGT9bdyHiwPTw/5a1m1M9hamT2aBpag==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@choojs/findup": "^0.2.0",
@@ -2516,10 +4872,24 @@
         "resolve": "^1.0.0"
       }
     },
+    "node_modules/gopd": {
+      "version": "1.2.0",
+      "resolved": "https://registry.npmjs.org/gopd/-/gopd-1.2.0.tgz",
+      "integrity": "sha512-ZUKRh6/kUFoAiTAtTYPZJ3hw9wNxx+BIBOijnlG9PnrJsCcSjs1wyyD6vJpaYtgnzDrKYRSqf3OO6Rfa93xsRg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
     "node_modules/graceful-fs": {
       "version": "4.2.11",
       "resolved": "https://registry.npmjs.org/graceful-fs/-/graceful-fs-4.2.11.tgz",
       "integrity": "sha512-RbJ5/jmFcNNCcDV5o9eTnBLJ/HszWV0P73bc+Ff4nS/rJj+YaS6IGyiOL0VoBYX+l1Wrl3k63h/KrH+nhJ0XvQ==",
+      "devOptional": true,
       "license": "ISC"
     },
     "node_modules/grid-index": {
@@ -2527,12 +4897,14 @@
       "resolved": "https://registry.npmjs.org/grid-index/-/grid-index-1.1.0.tgz",
       "integrity": "sha512-HZRwumpOGUrHyxO5bqKZL0B0GlUpwtCAzZ42sgxUPniu33R1LSFH5yrIcBCHjkctCAh3mtWKcKd9J4vDDdeVHA==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/has-flag": {
       "version": "4.0.0",
       "resolved": "https://registry.npmjs.org/has-flag/-/has-flag-4.0.0.tgz",
       "integrity": "sha512-EykJT/Q1KjTWctppgIAgfSO0tKVuZUjhgMr17kqTumMl6Afv3EISleU7qZUzoXDFTAHTDC4NOoG/ZxU3EvlMPQ==",
+      "devOptional": true,
       "license": "MIT",
       "engines": {
         "node": ">=8"
@@ -2543,6 +4915,7 @@
       "resolved": "https://registry.npmjs.org/has-hover/-/has-hover-1.0.1.tgz",
       "integrity": "sha512-0G6w7LnlcpyDzpeGUTuT0CEw05+QlMuGVk1IHNAlHrGJITGodjZu3x8BNDUMfKJSZXNB2ZAclqc1bvrd+uUpfg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "is-browser": "^2.0.1"
@@ -2553,15 +4926,30 @@
       "resolved": "https://registry.npmjs.org/has-passive-events/-/has-passive-events-1.0.0.tgz",
       "integrity": "sha512-2vSj6IeIsgvsRMyeQ0JaCX5Q3lX4zMn5HpoVc7MEhQ6pv8Iq9rsXjsp+E5ZwaT7T0xhMT0KmU8gtt1EFVdbJiw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "is-browser": "^2.0.1"
       }
     },
+    "node_modules/has-property-descriptors": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/has-property-descriptors/-/has-property-descriptors-1.0.2.tgz",
+      "integrity": "sha512-55JNKuIW+vq4Ke1BjOTjM2YctQIvCT7GFzHwmfZPGo5wnrgkid0YQtnAleFSqumZm4az3n2BS+erby5ipJdgrg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "es-define-property": "^1.0.0"
+      },
+      "funding": {
+        "url": "https://github.com/sponsors/ljharb"
+      }
+    },
     "node_modules/hasown": {
       "version": "2.0.2",
       "resolved": "https://registry.npmjs.org/hasown/-/hasown-2.0.2.tgz",
       "integrity": "sha512-0hJU9SCPvmMzIBdZFqNPXWa6dqh7WdH0cII9y+CyS8rG3nL48Bclra9HmKhVVUHyPWNH5Y7xDwAB7bfgSjkUMQ==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "function-bind": "^1.1.2"
@@ -2575,6 +4963,7 @@
       "resolved": "https://registry.npmjs.org/hsluv/-/hsluv-0.0.3.tgz",
       "integrity": "sha512-08iL2VyCRbkQKBySkSh6m8zMUa3sADAxGVWs3Z1aPcUkTJeK0ETG4Fc27tEmQBGUAXZjIsXOZqBvacuVNSC/fQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/iconv-lite": {
@@ -2582,6 +4971,7 @@
       "resolved": "https://registry.npmjs.org/iconv-lite/-/iconv-lite-0.4.24.tgz",
       "integrity": "sha512-v3MXnZAcvnywkTUEZomIActle7RXXeedOR31wwl7VlyoXO4Qi9arvSenNQWne1TcRwhCL1HwLI21bEqdpj8/rA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "safer-buffer": ">= 2.1.2 < 3"
@@ -2595,6 +4985,7 @@
       "resolved": "https://registry.npmjs.org/icss-utils/-/icss-utils-5.1.0.tgz",
       "integrity": "sha512-soFhflCVWLfRNOPU3iv5Z9VUdT44xFRbzjLsEzSr5AQmgqPMTHdU3PMT1Cf1ssx8fLNJDA1juftYl+PUcv3MqA==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": "^10 || ^12 || >= 14"
@@ -2622,6 +5013,7 @@
         }
       ],
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/image-size": {
@@ -2637,34 +5029,69 @@
         "node": ">=6.9.0"
       }
     },
+    "node_modules/inflight": {
+      "version": "1.0.6",
+      "resolved": "https://registry.npmjs.org/inflight/-/inflight-1.0.6.tgz",
+      "integrity": "sha512-k92I/b08q4wvFscXCLvqfsHCrjrF7yiXsQuIVvVE7N82W3+aqpzuUdBbfhWcy/FZR3/4IgflMgKLOsvPDrGCJA==",
+      "deprecated": "This module is not supported, and leaks memory. Do not use it. Check out lru-cache if you want a good and tested way to coalesce async requests by a key value, which is much more comprehensive and powerful.",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "once": "^1.3.0",
+        "wrappy": "1"
+      }
+    },
     "node_modules/inherits": {
       "version": "2.0.4",
       "resolved": "https://registry.npmjs.org/inherits/-/inherits-2.0.4.tgz",
       "integrity": "sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==",
-      "license": "ISC",
-      "peer": true
+      "devOptional": true,
+      "license": "ISC"
     },
     "node_modules/ini": {
       "version": "4.1.3",
       "resolved": "https://registry.npmjs.org/ini/-/ini-4.1.3.tgz",
       "integrity": "sha512-X7rqawQBvfdjS10YU1y1YVreA3SsLrW9dX2CewP2EbBJM4ypVNLDkO5y04gejPwKIY9lR+7r9gn3rFPt/kmWFg==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": "^14.17.0 || ^16.13.0 || >=18.0.0"
       }
     },
+    "node_modules/internmap": {
+      "version": "2.0.3",
+      "resolved": "https://registry.npmjs.org/internmap/-/internmap-2.0.3.tgz",
+      "integrity": "sha512-5Hh7Y1wQbvY5ooGgPbDaL5iYLAPzMTUrjMulskHLH6wnv/A+1q5rgEaiuqEjB+oxGXIVZs1FF+R/KPN3ZSQYYg==",
+      "dev": true,
+      "license": "ISC",
+      "engines": {
+        "node": ">=12"
+      }
+    },
+    "node_modules/interpret": {
+      "version": "1.4.0",
+      "resolved": "https://registry.npmjs.org/interpret/-/interpret-1.4.0.tgz",
+      "integrity": "sha512-agE4QfB2Lkp9uICn7BAqoscw4SZP9kTE2hxiFI3jBPmXJfdqiahTbUuKGsMoN2GtqL9AxhYioAcVvgsb1HvRbA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
     "node_modules/is-browser": {
       "version": "2.1.0",
       "resolved": "https://registry.npmjs.org/is-browser/-/is-browser-2.1.0.tgz",
       "integrity": "sha512-F5rTJxDQ2sW81fcfOR1GnCXT6sVJC104fCyfj+mjpwNEwaPYSn5fte5jiHmBg3DHsIoL/l8Kvw5VN5SsTRcRFQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/is-core-module": {
       "version": "2.16.1",
       "resolved": "https://registry.npmjs.org/is-core-module/-/is-core-module-2.16.1.tgz",
       "integrity": "sha512-UfoeMA6fIJ8wTYFEUjelnaGI67v6+N7qXJEvQuIGa99l4xsCruSYOVSQ0uPANn4dAzm8lkYPaKLrrijLq7x23w==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "hasown": "^2.0.2"
@@ -2681,6 +5108,7 @@
       "resolved": "https://registry.npmjs.org/is-finite/-/is-finite-1.1.0.tgz",
       "integrity": "sha512-cdyMtqX/BOqqNBBiKlIVkytNHm49MtMlYyn1zxzvJKWmFMlGzm+ry5BBfYyeY9YmNKbRSo/o7OX9w9ale0wg3w==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2694,6 +5122,7 @@
       "resolved": "https://registry.npmjs.org/is-firefox/-/is-firefox-1.0.3.tgz",
       "integrity": "sha512-6Q9ITjvWIm0Xdqv+5U12wgOKEM2KoBw4Y926m0OFkvlCxnbG94HKAsVz8w3fWcfAS5YA2fJORXX1dLrkprCCxA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2704,6 +5133,7 @@
       "resolved": "https://registry.npmjs.org/is-iexplorer/-/is-iexplorer-1.0.0.tgz",
       "integrity": "sha512-YeLzceuwg3K6O0MLM3UyUUjKAlyULetwryFp1mHy1I5PfArK0AEqlfa+MR4gkJjcbuJXoDJCvXbyqZVf5CR2Sg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2714,6 +5144,7 @@
       "resolved": "https://registry.npmjs.org/is-mobile/-/is-mobile-4.0.0.tgz",
       "integrity": "sha512-mlcHZA84t1qLSuWkt2v0I2l61PYdyQDt4aG1mLIXF5FDMm4+haBCxCPYSr/uwqQNRk1MiTizn0ypEuRAOLRAew==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/is-module": {
@@ -2728,6 +5159,7 @@
       "resolved": "https://registry.npmjs.org/is-obj/-/is-obj-1.0.1.tgz",
       "integrity": "sha512-l4RyHgRqGN4Y3+9JHVrNqO+tN0rV5My76uW5/nuO4K1b6vw5G8d/cmFjP9tRfEsdhZNt0IFdZuK/c2Vr4Nb+Qg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2738,6 +5170,7 @@
       "resolved": "https://registry.npmjs.org/is-plain-obj/-/is-plain-obj-1.1.0.tgz",
       "integrity": "sha512-yvkRyxmFKEOQ4pNXCmJG5AEQNlXJS5LaONXo5/cLdTZdWvsZ1ioJEonLGAosKlMWE8lwUy/bJzMjcw8az73+Fg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2758,6 +5191,7 @@
       "resolved": "https://registry.npmjs.org/is-string-blank/-/is-string-blank-1.0.1.tgz",
       "integrity": "sha512-9H+ZBCVs3L9OYqv8nuUAzpcT9OTgMD1yAWrG7ihlnibdkbtB850heAmYWxHuXc4CHy4lKeK69tN+ny1K7gBIrw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/is-svg-path": {
@@ -2765,6 +5199,7 @@
       "resolved": "https://registry.npmjs.org/is-svg-path/-/is-svg-path-1.0.2.tgz",
       "integrity": "sha512-Lj4vePmqpPR1ZnRctHv8ltSh1OrSxHkhUkd7wi+VQdcdP15/KvQFyk7LhNuM7ZW0EVbJz8kZLVmL9quLrfq4Kg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/isarray": {
@@ -2772,6 +5207,7 @@
       "resolved": "https://registry.npmjs.org/isarray/-/isarray-2.0.5.tgz",
       "integrity": "sha512-xHjhDr3cNBK0BzdUJSPXZntQUx/mwMS5Rw4A7lPJ90XGAO6ISP/ePDNuo0vhqOZU+UD5JoodwCAAoZQd3FeAKw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/isexe": {
@@ -2779,6 +5215,7 @@
       "resolved": "https://registry.npmjs.org/isexe/-/isexe-3.1.1.tgz",
       "integrity": "sha512-LpB/54B+/2J5hqQ7imZHfdU31OlgQqx7ZicVlkm9kzg9/w8GKLEcFfJl/t7DCEDueOyBAD6zCCwTO6Fzs0NoEQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=16"
@@ -2812,10 +5249,39 @@
       "dev": true,
       "license": "MIT"
     },
+    "node_modules/js-yaml": {
+      "version": "3.14.0",
+      "resolved": "https://registry.npmjs.org/js-yaml/-/js-yaml-3.14.0.tgz",
+      "integrity": "sha512-/4IbIeHcD9VMHFqDR/gQ7EdZdLimOvW2DdcxFjdyyZ9NsbS+ccrXqVWDtab/lRl5AlUqmpBx8EhPaWR+OtY17A==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "argparse": "^1.0.7",
+        "esprima": "^4.0.0"
+      },
+      "bin": {
+        "js-yaml": "bin/js-yaml.js"
+      }
+    },
+    "node_modules/jsesc": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/jsesc/-/jsesc-3.1.0.tgz",
+      "integrity": "sha512-/sM3dO2FOzXjKQhJuo0Q173wf2KOo8t4I8vHy6lF9poUp7bKT0/NHE8fPX23PwfhnykfqnC2xRxOnVw5XuGIaA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "bin": {
+        "jsesc": "bin/jsesc"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
     "node_modules/json-parse-even-better-errors": {
       "version": "2.3.1",
       "resolved": "https://registry.npmjs.org/json-parse-even-better-errors/-/json-parse-even-better-errors-2.3.1.tgz",
       "integrity": "sha512-xyFwyhro/JEof6Ghe2iz2NcXoj2sloNsWr/XsERDK/oiPCfaNhl5ONfp+jQdAZRQQ0IJWNzH9zIZF7li91kh2w==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -2823,6 +5289,7 @@
       "version": "1.0.0",
       "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-1.0.0.tgz",
       "integrity": "sha512-NM8/P9n3XjXhIZn1lLhkFaACTOURQXjWhV4BA/RnOv8xvgqtqpAX9IO4mRQxSx1Rlo4tqzeqb0sOlruaOy3dug==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -2831,8 +5298,22 @@
       "resolved": "https://registry.npmjs.org/json-stringify-pretty-compact/-/json-stringify-pretty-compact-4.0.0.tgz",
       "integrity": "sha512-3CNZ2DnrpByG9Nqj6Xo8vqbjT4F6N+tb4Gb28ESAZjYZ5yqvmc56J+/kuIwkaAMOyblTQhUW7PxMkUb8Q36N3Q==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
+    "node_modules/json5": {
+      "version": "2.2.3",
+      "resolved": "https://registry.npmjs.org/json5/-/json5-2.2.3.tgz",
+      "integrity": "sha512-XmOWe7eyHYH14cLdVPoyg+GOH3rYX++KpzrylJwSW98t3Nk+U8XOl8FWKOgwtzdb8lXGf6zYwDUzeHMWfxasyg==",
+      "dev": true,
+      "license": "MIT",
+      "bin": {
+        "json5": "lib/cli.js"
+      },
+      "engines": {
+        "node": ">=6"
+      }
+    },
     "node_modules/jsonfile": {
       "version": "6.2.0",
       "resolved": "https://registry.npmjs.org/jsonfile/-/jsonfile-6.2.0.tgz",
@@ -2851,6 +5332,7 @@
       "resolved": "https://registry.npmjs.org/kdbush/-/kdbush-4.0.2.tgz",
       "integrity": "sha512-WbCVYJ27Sz8zi9Q7Q0xHC+05iwkm3Znipc2XTlrnJbsHMYktW4hPhXUE8Ys1engBrvffoSCqbil1JQAa7clRpA==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/kind-of": {
@@ -2858,6 +5340,7 @@
       "resolved": "https://registry.npmjs.org/kind-of/-/kind-of-6.0.3.tgz",
       "integrity": "sha512-dcS1ul+9tmeD95T+x28/ehLgd9mENa3LsvDTtzm3vyBEO7RPptvAD+t44WVXaUjTBRcrpFeFlC8WCruUR456hw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -2874,6 +5357,7 @@
       "version": "4.3.1",
       "resolved": "https://registry.npmjs.org/loader-runner/-/loader-runner-4.3.1.tgz",
       "integrity": "sha512-IWqP2SCPhyVFTBtRcgMHdzlf9ul25NwaFx4wCEH/KjAXuuHY4yNjvPXsBokp8jCB936PyWRaPKUNh8NvylLp2Q==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -2884,6 +5368,34 @@
         "url": "https://opencollective.com/webpack"
       }
     },
+    "node_modules/loader-utils": {
+      "version": "1.4.2",
+      "resolved": "https://registry.npmjs.org/loader-utils/-/loader-utils-1.4.2.tgz",
+      "integrity": "sha512-I5d00Pd/jwMD2QCduo657+YM/6L3KZu++pmX9VFncxaxvHcru9jx1lBaFft+r4Mt2jK0Yhp41XlRAihzPxHNCg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "big.js": "^5.2.2",
+        "emojis-list": "^3.0.0",
+        "json5": "^1.0.1"
+      },
+      "engines": {
+        "node": ">=4.0.0"
+      }
+    },
+    "node_modules/loader-utils/node_modules/json5": {
+      "version": "1.0.2",
+      "resolved": "https://registry.npmjs.org/json5/-/json5-1.0.2.tgz",
+      "integrity": "sha512-g1MWMLBiz8FKi1e4w0UyVL3w+iJceWAFBAaBnnGKOpNa5f8TLktkbre1+s6oICydWAm+HRUGTmI+//xv2hvXYA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "minimist": "^1.2.0"
+      },
+      "bin": {
+        "json5": "lib/cli.js"
+      }
+    },
     "node_modules/locate-path": {
       "version": "5.0.0",
       "resolved": "https://registry.npmjs.org/locate-path/-/locate-path-5.0.0.tgz",
@@ -2897,13 +5409,33 @@
         "node": ">=8"
       }
     },
+    "node_modules/lodash.debounce": {
+      "version": "4.0.8",
+      "resolved": "https://registry.npmjs.org/lodash.debounce/-/lodash.debounce-4.0.8.tgz",
+      "integrity": "sha512-FT1yDzDYEoYWhnSGnpE/4Kj1fLZkDFyqRb7fNt6FdYOSxlUWAtp42Eh6Wb0rGIv/m9Bgo7x4GhQbm5Ys4SG5ow==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true
+    },
     "node_modules/lodash.merge": {
       "version": "4.6.2",
       "resolved": "https://registry.npmjs.org/lodash.merge/-/lodash.merge-4.6.2.tgz",
       "integrity": "sha512-0KpjqXRVvrYyCsX1swR/XTK0va6VQkQM6MNo7PqW77ByjAhoARA8EfrP1N4+KlKj8YS0ZUCtRT/YUuhyYDujIQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
+    "node_modules/lru-cache": {
+      "version": "5.1.1",
+      "resolved": "https://registry.npmjs.org/lru-cache/-/lru-cache-5.1.1.tgz",
+      "integrity": "sha512-KpNARQA3Iwv+jTA0utUVVbrh+Jlrr1Fv0e56GGzAFOXN7dk/FviaDW8LHmK52DlcH4WP2n6gI8vN1aesBFgo9w==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true,
+      "dependencies": {
+        "yallist": "^3.0.2"
+      }
+    },
     "node_modules/magic-string": {
       "version": "0.30.17",
       "resolved": "https://registry.npmjs.org/magic-string/-/magic-string-0.30.17.tgz",
@@ -2945,6 +5477,7 @@
       "resolved": "https://registry.npmjs.org/map-limit/-/map-limit-0.0.1.tgz",
       "integrity": "sha512-pJpcfLPnIF/Sk3taPW21G/RQsEEirGaFpCW3oXRwH9dnFHPHNGjNyvh++rdmC2fNqEaTw2MhYJraoJWAHx8kEg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "once": "~1.3.0"
@@ -2955,6 +5488,7 @@
       "resolved": "https://registry.npmjs.org/once/-/once-1.3.3.tgz",
       "integrity": "sha512-6vaNInhu+CHxtONf3zw3vq4SP2DOQhjBvIa3rNcG0+P7eKWlYH6Peu7rHizSloRU2EwMz6GraLieis9Ac9+p1w==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "wrappy": "1"
@@ -2965,6 +5499,7 @@
       "resolved": "https://registry.npmjs.org/mapbox-gl/-/mapbox-gl-1.13.3.tgz",
       "integrity": "sha512-p8lJFEiqmEQlyv+DQxFAOG/XPWN0Wp7j/Psq93Zywz7qt9CcUKFYDBOoOEKzqe6gudHVJY8/Bhqw6VDpX2lSBg==",
       "license": "SEE LICENSE IN LICENSE.txt",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/geojson-rewind": "^0.5.2",
@@ -2999,6 +5534,7 @@
       "resolved": "https://registry.npmjs.org/maplibre-gl/-/maplibre-gl-4.7.1.tgz",
       "integrity": "sha512-lgL7XpIwsgICiL82ITplfS7IGwrB1OJIw/pCvprDp2dhmSSEBgmPzYRvwYYYvJGJD7fxUv1Tvpih4nZ6VrLuaA==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/geojson-rewind": "^0.5.2",
@@ -3041,6 +5577,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/tiny-sdf/-/tiny-sdf-2.0.7.tgz",
       "integrity": "sha512-25gQLQMcpivjOSA40g3gO6qgiFPDpWRoMfd+G/GoppPIeP6JDaMMkMrEJnMZhKyyS6iKwVt5YKu02vCUyJM3Ug==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/@mapbox/unitbezier": {
@@ -3048,6 +5585,7 @@
       "resolved": "https://registry.npmjs.org/@mapbox/unitbezier/-/unitbezier-0.0.1.tgz",
       "integrity": "sha512-nMkuDXFv60aBr9soUG5q+GvZYL+2KZHVvsqFCzqnkGEf46U2fvmytHaEVc1/YZbiLn8X+eR3QzX1+dwDO1lxlw==",
       "license": "BSD-2-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/earcut": {
@@ -3055,6 +5593,7 @@
       "resolved": "https://registry.npmjs.org/earcut/-/earcut-3.0.2.tgz",
       "integrity": "sha512-X7hshQbLyMJ/3RPhyObLARM2sNxxmRALLKx1+NVFFnQ9gKzmCrxm9+uLIAdBcvc8FNLpctqlQ2V6AE92Ol9UDQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/geojson-vt": {
@@ -3062,6 +5601,7 @@
       "resolved": "https://registry.npmjs.org/geojson-vt/-/geojson-vt-4.0.2.tgz",
       "integrity": "sha512-AV9ROqlNqoZEIJGfm1ncNjEXfkz2hdFlZf0qkVfmkwdKa8vj7H16YUOT81rJw1rdFhyEDlN2Tds91p/glzbl5A==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/potpack": {
@@ -3069,6 +5609,7 @@
       "resolved": "https://registry.npmjs.org/potpack/-/potpack-2.1.0.tgz",
       "integrity": "sha512-pcaShQc1Shq0y+E7GqJqvZj8DTthWV1KeHGdi0Z6IAin2Oi3JnLCOfwnCo84qc+HAp52wT9nK9H7FAJp5a44GQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/quickselect": {
@@ -3076,6 +5617,7 @@
       "resolved": "https://registry.npmjs.org/quickselect/-/quickselect-3.0.0.tgz",
       "integrity": "sha512-XdjUArbK4Bm5fLLvlm5KpTFOiOThgfWWI4axAZDWg4E/0mKdZyI9tNEfds27qCi1ze/vwTR16kvmmGhRra3c2g==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/maplibre-gl/node_modules/supercluster": {
@@ -3083,6 +5625,7 @@
       "resolved": "https://registry.npmjs.org/supercluster/-/supercluster-8.0.1.tgz",
       "integrity": "sha512-IiOea5kJ9iqzD2t7QJq/cREyLHTtSmUT6gQsweojg9WH2sYJqZK9SswTu6jrscO6D1G5v5vYZ9ru/eq85lXeZQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "kdbush": "^4.0.2"
@@ -3093,6 +5636,7 @@
       "resolved": "https://registry.npmjs.org/tinyqueue/-/tinyqueue-3.0.0.tgz",
       "integrity": "sha512-gRa9gwYU3ECmQYv3lslts5hxuIa90veaEcxDYuu3QGOIAEM2mOZkVHp48ANJuu1CURtRdHKUBY5Lm1tHV+sD4g==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/math-log2": {
@@ -3100,6 +5644,7 @@
       "resolved": "https://registry.npmjs.org/math-log2/-/math-log2-1.0.1.tgz",
       "integrity": "sha512-9W0yGtkaMAkf74XGYVy4Dqw3YUMnTNB2eeiw9aQbUl4A3KmuCEHTt2DgAB07ENzOYAjsYSAYufkAq0Zd+jU7zA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
@@ -3132,12 +5677,14 @@
       "version": "2.0.0",
       "resolved": "https://registry.npmjs.org/merge-stream/-/merge-stream-2.0.0.tgz",
       "integrity": "sha512-abv/qOcuPfk3URPfDzmZU1LKmuw8kT+0nIHvKrKgFrwifol/doWcdA4ZqsWQ8ENrFKkd67Mfpo/LovbIUsbt3w==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/mime-db": {
       "version": "1.52.0",
       "resolved": "https://registry.npmjs.org/mime-db/-/mime-db-1.52.0.tgz",
       "integrity": "sha512-sPU4uV7dYlvtWJxwwxHD0PuihVNiE7TyAbQ5SWxDCB9mUYvOgroQOwYQQOKPJ8CIbE+1ETVlOoK1UC2nU3gYvg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -3148,6 +5695,7 @@
       "version": "2.1.35",
       "resolved": "https://registry.npmjs.org/mime-types/-/mime-types-2.1.35.tgz",
       "integrity": "sha512-ZDY+bPm5zTTF+YpCrAU9nK0UgICYPT0QtT1NZWFv4s++TNkcgVaT0g6+4R2uI4MjQjzysHB1zxuWL50hzaeXiw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -3157,12 +5705,25 @@
         "node": ">= 0.6"
       }
     },
+    "node_modules/minimatch": {
+      "version": "3.1.5",
+      "resolved": "https://registry.npmjs.org/minimatch/-/minimatch-3.1.5.tgz",
+      "integrity": "sha512-VgjWUsnnT6n+NUk6eZq77zeFdpW2LWDzP6zFGrCbHXiYNul5Dzqk2HHQ5uFH2DNW5Xbp8+jVzaeNt94ssEEl4w==",
+      "dev": true,
+      "license": "ISC",
+      "dependencies": {
+        "brace-expansion": "^1.1.7"
+      },
+      "engines": {
+        "node": "*"
+      }
+    },
     "node_modules/minimist": {
       "version": "1.2.8",
       "resolved": "https://registry.npmjs.org/minimist/-/minimist-1.2.8.tgz",
       "integrity": "sha512-2yyAR8qBkN3YuheJanUpWC5U3bb5osDywNB8RzDVlDwDHbocAJveqqj1u8+SVD7jkWT4yvsHCpWqqWqAxb0zCA==",
+      "devOptional": true,
       "license": "MIT",
-      "peer": true,
       "funding": {
         "url": "https://github.com/sponsors/ljharb"
       }
@@ -3172,6 +5733,7 @@
       "resolved": "https://registry.npmjs.org/mouse-change/-/mouse-change-1.4.0.tgz",
       "integrity": "sha512-vpN0s+zLL2ykyyUDh+fayu9Xkor5v/zRD9jhSqjRS1cJTGS0+oakVZzNm5n19JvvEj0you+MXlYTpNxUDQUjkQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "mouse-event": "^1.0.0"
@@ -3182,6 +5744,7 @@
       "resolved": "https://registry.npmjs.org/mouse-event/-/mouse-event-1.0.5.tgz",
       "integrity": "sha512-ItUxtL2IkeSKSp9cyaX2JLUuKk2uMoxBg4bbOWVd29+CskYJR9BGsUqtXenNzKbnDshvupjUewDIYVrOB6NmGw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/mouse-event-offset": {
@@ -3189,6 +5752,7 @@
       "resolved": "https://registry.npmjs.org/mouse-event-offset/-/mouse-event-offset-3.0.2.tgz",
       "integrity": "sha512-s9sqOs5B1Ykox3Xo8b3Ss2IQju4UwlW6LSR+Q5FXWpprJ5fzMLefIIItr3PH8RwzfGy6gxs/4GAmiNuZScE25w==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/mouse-wheel": {
@@ -3196,6 +5760,7 @@
       "resolved": "https://registry.npmjs.org/mouse-wheel/-/mouse-wheel-1.2.0.tgz",
       "integrity": "sha512-+OfYBiUOCTWcTECES49neZwL5AoGkXE+lFjIvzwNCnYRlso+EnfvovcBxGoyQ0yQt806eSPjS675K0EwWknXmw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "right-now": "^1.0.0",
@@ -3207,6 +5772,7 @@
       "version": "2.1.3",
       "resolved": "https://registry.npmjs.org/ms/-/ms-2.1.3.tgz",
       "integrity": "sha512-6FlzubTLZG3J2a/NVCAleEhjzq5oxgHyaCU9yYXvcLsvoVaHJq/s5xXI6/XXP6tz7R9xAOtHnSO/tXtF3WRTlA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -3216,6 +5782,7 @@
       "integrity": "sha512-VAFIOG6rsxoc7q/IaY3jdjmrsuX9f15KlRLYTHmixASBZkZEKC1IFqE2BC5CdhXmK6WLM1Re33z//AGmeRI6FA==",
       "deprecated": "Redundant dependency in your project.",
       "license": "Unlicense",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "almost-equal": "^1.1.0"
@@ -3226,12 +5793,14 @@
       "resolved": "https://registry.npmjs.org/murmurhash-js/-/murmurhash-js-1.0.0.tgz",
       "integrity": "sha512-TvmkNhkv8yct0SVBSy+o8wYzXjE4Zz3PCesbfs8HiCXXdcTuocApFv11UWlNFWKYsP2okqrhb7JNlSm9InBhIw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/nanoid": {
       "version": "3.3.11",
       "resolved": "https://registry.npmjs.org/nanoid/-/nanoid-3.3.11.tgz",
       "integrity": "sha512-N8SpfPUnUp1bK+PMYW8qSWdl9U+wwNWI4QKxOYDy9JAro3WMX7p2OeVRF9v+347pnakNevPmiHhNmZ2HbFA76w==",
+      "devOptional": true,
       "funding": [
         {
           "type": "github",
@@ -3252,6 +5821,7 @@
       "resolved": "https://registry.npmjs.org/native-promise-only/-/native-promise-only-0.8.1.tgz",
       "integrity": "sha512-zkVhZUA3y8mbz652WrL5x0fB0ehrBkulWT3TomAQ9iDtyXZvzKeEA6GPxAItBYeNYl5yngKRX612qHOhvMkDeg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/needle": {
@@ -3259,6 +5829,7 @@
       "resolved": "https://registry.npmjs.org/needle/-/needle-2.9.1.tgz",
       "integrity": "sha512-6R9fqJ5Zcmf+uYaFgdIHmLwNldn5HbK8L5ybn7Uz+ylX/rnOsSp1AHcvQSrCaFN+qNM1wpymHqD7mVasEOlHGQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "debug": "^3.2.6",
@@ -3276,6 +5847,7 @@
       "version": "2.6.2",
       "resolved": "https://registry.npmjs.org/neo-async/-/neo-async-2.6.2.tgz",
       "integrity": "sha512-Yd3UES5mWCSqR+qNT93S3UoYUkqAZ9lLg8a7g9rimsWmYGK8cVToA4/sF3RrshdyV3sAGMXVUmpMYOw+dLpOuw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -3284,12 +5856,14 @@
       "resolved": "https://registry.npmjs.org/next-tick/-/next-tick-1.1.0.tgz",
       "integrity": "sha512-CXdUiJembsNjuToQvxayPZF9Vqht7hewsvy2sOWafLvi2awflj9mOC6bHIg50orX8IJvWKY9wYQ/zB2kogPslQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/node-releases": {
       "version": "2.0.27",
       "resolved": "https://registry.npmjs.org/node-releases/-/node-releases-2.0.27.tgz",
       "integrity": "sha512-nmh3lCkYZ3grZvqcCH+fjmQ7X+H0OeZgP40OierEaAptX4XofMh5kwNbWh7lBduUzCcV/8kZ+NDLCwm2iorIlA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -3298,6 +5872,7 @@
       "resolved": "https://registry.npmjs.org/normalize-svg-path/-/normalize-svg-path-0.1.0.tgz",
       "integrity": "sha512-1/kmYej2iedi5+ROxkRESL/pI02pkg0OBnaR4hJkSIX6+ORzepwbuUXfrdZaPjysTsJInj0Rj5NuX027+dMBvA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/number-is-integer": {
@@ -3305,6 +5880,7 @@
       "resolved": "https://registry.npmjs.org/number-is-integer/-/number-is-integer-1.0.1.tgz",
       "integrity": "sha512-Dq3iuiFBkrbmuQjGFFF3zckXNCQoSD37/SdSbgcBailUx6knDvDwb5CympBgcoWHy36sfS12u74MHYkXyHq6bg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "is-finite": "^1.0.1"
@@ -3318,17 +5894,28 @@
       "resolved": "https://registry.npmjs.org/object-assign/-/object-assign-4.1.1.tgz",
       "integrity": "sha512-rJgTQnkUnH1sFw8yT6VSU3zD3sWmu6sZhIseY8VX+GRu3P6F7Fu+JNDoXfklElbLJSnc3FUQHVe4cU5hj+BcUg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.10.0"
       }
     },
+    "node_modules/object-keys": {
+      "version": "1.1.1",
+      "resolved": "https://registry.npmjs.org/object-keys/-/object-keys-1.1.1.tgz",
+      "integrity": "sha512-NuAESUOUMrlIXOfHKzD6bpPu3tYt3xvjNdRIQ+FeT0lNb4K8WR70CaDxhuNguS2XG+GjkyMwOzsN5ZktImfhLA==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">= 0.4"
+      }
+    },
     "node_modules/once": {
       "version": "1.4.0",
       "resolved": "https://registry.npmjs.org/once/-/once-1.4.0.tgz",
       "integrity": "sha512-lNaJgI+2Q5URQBkccEKHTQOPaXdUxnZZElQTZY0MFUAuaEqe1E+Nyvgdz/aIyNi6Z9MzO5dv1H8n58/GELp3+w==",
+      "devOptional": true,
       "license": "ISC",
-      "peer": true,
       "dependencies": {
         "wrappy": "1"
       }
@@ -3372,11 +5959,19 @@
         "node": ">=6"
       }
     },
+    "node_modules/pako": {
+      "version": "1.0.11",
+      "resolved": "https://registry.npmjs.org/pako/-/pako-1.0.11.tgz",
+      "integrity": "sha512-4hLB8Py4zZce5s4yd9XzopqwVv/yGNhV1Bl8NTmCq1763HeK2+EwVTv+leGeL13Dnh2wfbqowVPXCIO0z4taYw==",
+      "dev": true,
+      "license": "(MIT AND Zlib)"
+    },
     "node_modules/parenthesis": {
       "version": "3.1.8",
       "resolved": "https://registry.npmjs.org/parenthesis/-/parenthesis-3.1.8.tgz",
       "integrity": "sha512-KF/U8tk54BgQewkJPvB4s/US3VQY68BRDpH638+7O/n58TpnwiwnOtGIOsT2/i+M78s61BBpeC83STB88d8sqw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/parse-rect": {
@@ -3384,6 +5979,7 @@
       "resolved": "https://registry.npmjs.org/parse-rect/-/parse-rect-1.2.0.tgz",
       "integrity": "sha512-4QZ6KYbnE6RTwg9E0HpLchUM9EZt6DnDxajFZZDSV4p/12ZJEvPO702DZpGvRYEPo00yKDys7jASi+/w7aO8LA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "pick-by-alias": "^1.2.0"
@@ -3394,6 +5990,7 @@
       "resolved": "https://registry.npmjs.org/parse-svg-path/-/parse-svg-path-0.1.2.tgz",
       "integrity": "sha512-JyPSBnkTJ0AI8GGJLfMXvKq42cj5c006fnLz6fXy6zfoVjJizi8BNTpu8on8ziI1cKy9d9DGNuY17Ce7wuejpQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/parse-unit": {
@@ -3401,6 +5998,7 @@
       "resolved": "https://registry.npmjs.org/parse-unit/-/parse-unit-1.0.1.tgz",
       "integrity": "sha512-hrqldJHokR3Qj88EIlV/kAyAi/G5R2+R56TBANxNMy0uPlYcttx0jnMW6Yx5KsKPSbC3KddM/7qQm3+0wEXKxg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/path-exists": {
@@ -3413,10 +6011,21 @@
         "node": ">=8"
       }
     },
+    "node_modules/path-is-absolute": {
+      "version": "1.0.1",
+      "resolved": "https://registry.npmjs.org/path-is-absolute/-/path-is-absolute-1.0.1.tgz",
+      "integrity": "sha512-AVbw3UJ2e9bq64vSaS9Am0fje1Pa8pbGqTTsmXfaIiMpnr5DlDhfJOuLj9Sf95ZPVDAUerDfEk88MPmPe7UCQg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=0.10.0"
+      }
+    },
     "node_modules/path-parse": {
       "version": "1.0.7",
       "resolved": "https://registry.npmjs.org/path-parse/-/path-parse-1.0.7.tgz",
       "integrity": "sha512-LDJzPVEEEPR+y48z93A0Ed0yXb8pAByGWo/k5YYdYgpY2/2EsOsksJrq7lOHxryrVOn1ejG6oAp8ahvOIQD8sw==",
+      "devOptional": true,
       "license": "MIT"
     },
     "node_modules/pbf": {
@@ -3424,6 +6033,7 @@
       "resolved": "https://registry.npmjs.org/pbf/-/pbf-3.3.0.tgz",
       "integrity": "sha512-XDF38WCH3z5OV/OVa8GKUNtLAyneuzbCisx7QUCF8Q6Nutx0WnJrQe5O+kOtBlLfRNUws98Y58Lblp+NJG5T4Q==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "ieee754": "^1.1.12",
@@ -3438,6 +6048,7 @@
       "resolved": "https://registry.npmjs.org/performance-now/-/performance-now-2.1.0.tgz",
       "integrity": "sha512-7EAHlyLHI56VEIdK57uwHdHKIaAGbnXPiw0yWbarQZOKaKpvUIgW0jWRVLiatnM+XXlSwsanIBH/hzGMJulMow==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/pick-by-alias": {
@@ -3445,12 +6056,14 @@
       "resolved": "https://registry.npmjs.org/pick-by-alias/-/pick-by-alias-1.2.0.tgz",
       "integrity": "sha512-ESj2+eBxhGrcA1azgHs7lARG5+5iLakc/6nlfbpjcLl00HuuUOIuORhYXN4D1HfvMSKuVtFQjAlnwi1JHEeDIw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/picocolors": {
       "version": "1.1.1",
       "resolved": "https://registry.npmjs.org/picocolors/-/picocolors-1.1.1.tgz",
       "integrity": "sha512-xceH2snhtb5M9liqDsmEw56le376mTZkEX/jEb/RxNFyegNul7eNslCXP9FDj/Lcu0X8KEyMceP2ntpaHrDEVA==",
+      "devOptional": true,
       "license": "ISC"
     },
     "node_modules/picomatch": {
@@ -3484,6 +6097,7 @@
       "resolved": "https://registry.npmjs.org/plotly.js/-/plotly.js-2.35.3.tgz",
       "integrity": "sha512-7RaC6FxmCUhpD6H4MpD+QLUu3hCn76I11rotRefrh3m1iDvWqGnVqVk9dSaKmRAhFD3vsNsYea0OxnR1rc2IzQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@plotly/d3": "3.8.2",
@@ -3545,6 +6159,7 @@
       "resolved": "https://registry.npmjs.org/point-in-polygon/-/point-in-polygon-1.1.0.tgz",
       "integrity": "sha512-3ojrFwjnnw8Q9242TzgXuTD+eKiutbzyslcq1ydfu82Db2y+Ogbmyrkpv0Hgj31qwT3lbS9+QAAO/pIQM35XRw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/polybooljs": {
@@ -3552,12 +6167,14 @@
       "resolved": "https://registry.npmjs.org/polybooljs/-/polybooljs-1.2.2.tgz",
       "integrity": "sha512-ziHW/02J0XuNuUtmidBc6GXE8YohYydp3DWPWXYsd7O721TjcmN+k6ezjdwkDqep+gnWnFY+yqZHvzElra2oCg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/postcss": {
       "version": "8.5.6",
       "resolved": "https://registry.npmjs.org/postcss/-/postcss-8.5.6.tgz",
       "integrity": "sha512-3Ybi1tAuwAP9s0r1UQ2J4n5Y0G05bJkpUIO0/bI9MhwmD70S5aTWbXGBwxHrelT+XM1k6dM0pk+SwNkpTRN7Pg==",
+      "devOptional": true,
       "funding": [
         {
           "type": "opencollective",
@@ -3588,6 +6205,7 @@
       "resolved": "https://registry.npmjs.org/postcss-modules-extract-imports/-/postcss-modules-extract-imports-3.1.0.tgz",
       "integrity": "sha512-k3kNe0aNFQDAZGbin48pL2VNidTF0w4/eASDsxlyspobzU3wZQLOGj7L9gfRe0Jo9/4uud09DsjFNH7winGv8Q==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": "^10 || ^12 || >= 14"
@@ -3601,6 +6219,7 @@
       "resolved": "https://registry.npmjs.org/postcss-modules-local-by-default/-/postcss-modules-local-by-default-4.2.0.tgz",
       "integrity": "sha512-5kcJm/zk+GJDSfw+V/42fJ5fhjL5YbFDl8nVdXkJPLLW+Vf9mTD5Xe0wqIaDnLuL2U6cDNpTr+UQ+v2HWIBhzw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "icss-utils": "^5.0.0",
@@ -3619,6 +6238,7 @@
       "resolved": "https://registry.npmjs.org/postcss-modules-scope/-/postcss-modules-scope-3.2.1.tgz",
       "integrity": "sha512-m9jZstCVaqGjTAuny8MdgE88scJnCiQSlSrOWcTQgM2t32UBe+MUmFSO5t7VMSfAf/FJKImAxBav8ooCHJXCJA==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "postcss-selector-parser": "^7.0.0"
@@ -3635,6 +6255,7 @@
       "resolved": "https://registry.npmjs.org/postcss-modules-values/-/postcss-modules-values-4.0.0.tgz",
       "integrity": "sha512-RDxHkAiEGI78gS2ofyvCsu7iycRv7oqw5xMWn9iMoR0N/7mf9D50ecQqUo5BZ9Zh2vH4bCUR/ktCqbB9m8vJjQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "icss-utils": "^5.0.0"
@@ -3651,6 +6272,7 @@
       "resolved": "https://registry.npmjs.org/postcss-selector-parser/-/postcss-selector-parser-7.1.0.tgz",
       "integrity": "sha512-8sLjZwK0R+JlxlYcTuVnyT2v+htpdrjDOKuMcOVdYjt52Lh8hWRYpxBPoKx/Zg+bcjc3wx6fmQevMmUztS/ccA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "cssesc": "^3.0.0",
@@ -3664,6 +6286,7 @@
       "version": "4.2.0",
       "resolved": "https://registry.npmjs.org/postcss-value-parser/-/postcss-value-parser-4.2.0.tgz",
       "integrity": "sha512-1NNCs6uurfkVbeXG4S8JFT9t19m45ICnif8zWLd5oPSZ50QnwMfK+H3jv408d4jw/7Bttv5axS5IiHoLaVNHeQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true
     },
@@ -3672,6 +6295,7 @@
       "resolved": "https://registry.npmjs.org/potpack/-/potpack-1.0.2.tgz",
       "integrity": "sha512-choctRBIV9EMT9WGAZHn3V7t0Z2pMQyl0EZE6pFc/6ml3ssw7Dlf/oAOvFwjm1HVsqfQN8GfeFyJ+d8tRzqueQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/probe-image-size": {
@@ -3679,6 +6303,7 @@
       "resolved": "https://registry.npmjs.org/probe-image-size/-/probe-image-size-7.2.3.tgz",
       "integrity": "sha512-HubhG4Rb2UH8YtV4ba0Vp5bQ7L78RTONYu/ujmCu5nBI8wGv24s4E9xSKBi0N1MowRpxk76pFCpJtW0KPzOK0w==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "lodash.merge": "^4.6.2",
@@ -3691,6 +6316,7 @@
       "resolved": "https://registry.npmjs.org/process-nextick-args/-/process-nextick-args-2.0.1.tgz",
       "integrity": "sha512-3ouUOpQhtgrbOa17J7+uxOTpITYWaGP7/AhoR3+A+/1e9skrzelGi/dXzEYyvbxubEF6Wn2ypscTKiKJFFn1ag==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/protocol-buffers-schema": {
@@ -3698,13 +6324,25 @@
       "resolved": "https://registry.npmjs.org/protocol-buffers-schema/-/protocol-buffers-schema-3.6.0.tgz",
       "integrity": "sha512-TdDRD+/QNdrCGCE7v8340QyuXd4kIWIgapsE2+n/SaGiSSbomYl4TjHlvIoCWRpE7wFt02EpB35VVA2ImcBVqw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
+    "node_modules/punycode": {
+      "version": "2.3.1",
+      "resolved": "https://registry.npmjs.org/punycode/-/punycode-2.3.1.tgz",
+      "integrity": "sha512-vYt7UD1U9Wg6138shLtLOvdAu+8DsC/ilFtEVHcH+wydcSpNE20AfSOduf6MkRFahL5FY7X1oU7nKVZFtfq8Fg==",
+      "dev": true,
+      "license": "MIT",
+      "engines": {
+        "node": ">=6"
+      }
+    },
     "node_modules/quickselect": {
       "version": "2.0.0",
       "resolved": "https://registry.npmjs.org/quickselect/-/quickselect-2.0.0.tgz",
       "integrity": "sha512-RKJ22hX8mHe3Y6wH/N3wCM6BWtjaxIyyUIkpHOvfFnxdI4yD4tBXEBKSbriGujF6jnSVkJrffuo6vxACiSSxIw==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/raf": {
@@ -3712,6 +6350,7 @@
       "resolved": "https://registry.npmjs.org/raf/-/raf-3.4.1.tgz",
       "integrity": "sha512-Sq4CW4QhwOHE8ucn6J34MqtZCeWFP2aQSmrlroYgqAV1PjStIhJXxYuTgUIfkEk7zTLjmIjLmU5q+fbD1NnOJA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "performance-now": "^2.1.0"
@@ -3721,6 +6360,7 @@
       "version": "2.1.0",
       "resolved": "https://registry.npmjs.org/randombytes/-/randombytes-2.1.0.tgz",
       "integrity": "sha512-vYl3iOX+4CKUWuxGi9Ukhie6fsqXqS9FE2Zaic4tNFD2N2QQaXOMFbuKK4QmDHC0JO6B1Zp41J0LpT0oR68amQ==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "safe-buffer": "^5.1.0"
@@ -3731,6 +6371,7 @@
       "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-2.3.8.tgz",
       "integrity": "sha512-8p0AUk4XODgIewSi0l8Epjs+EVnWiK7NoDIEGU0HhE7+ZyY8D1IMY7odu5lRrFXGg71L15KG8QrPmum45RTtdA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "core-util-is": "~1.0.0",
@@ -3747,6 +6388,7 @@
       "resolved": "https://registry.npmjs.org/isarray/-/isarray-1.0.0.tgz",
       "integrity": "sha512-VLghIWNM6ELQzo7zwmcg0NmTVyWKYjvIeM83yjp0wRDTmUnrM678fQbcKBo6n2CJEF0szoG//ytg+TKla89ALQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/readable-stream/node_modules/safe-buffer": {
@@ -3754,14 +6396,98 @@
       "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
       "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
       "license": "MIT",
+      "optional": true,
+      "peer": true
+    },
+    "node_modules/rechoir": {
+      "version": "0.6.2",
+      "resolved": "https://registry.npmjs.org/rechoir/-/rechoir-0.6.2.tgz",
+      "integrity": "sha512-HFM8rkZ+i3zrV+4LQjwQ0W+ez98pApMGM3HUrN04j3CqzPOzl9nmP15Y8YXNm8QHGv/eacOVEjqhmWpkRV0NAw==",
+      "dev": true,
+      "dependencies": {
+        "resolve": "^1.1.6"
+      },
+      "engines": {
+        "node": ">= 0.10"
+      }
+    },
+    "node_modules/regenerate": {
+      "version": "1.4.2",
+      "resolved": "https://registry.npmjs.org/regenerate/-/regenerate-1.4.2.tgz",
+      "integrity": "sha512-zrceR/XhGYU/d/opr2EKO7aRHUeiBI8qjtfHqADTwZd6Szfy16la6kqD0MIUs5z5hx6AaKa+PixpPrR289+I0A==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true
+    },
+    "node_modules/regenerate-unicode-properties": {
+      "version": "10.2.2",
+      "resolved": "https://registry.npmjs.org/regenerate-unicode-properties/-/regenerate-unicode-properties-10.2.2.tgz",
+      "integrity": "sha512-m03P+zhBeQd1RGnYxrGyDAPpWX/epKirLrp8e3qevZdVkKtnCrjjWczIbYc8+xd6vcTStVlqfycTx1KR4LOr0g==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "regenerate": "^1.4.2"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/regenerator-runtime": {
+      "version": "0.14.1",
+      "resolved": "https://registry.npmjs.org/regenerator-runtime/-/regenerator-runtime-0.14.1.tgz",
+      "integrity": "sha512-dYnhHh0nJoMfnkZs6GmmhFknAGRrLznOu5nc9ML+EJxGvrx6H7teuevqVqCuPcPK//3eDrrjQhehXVx9cnkGdw==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/regexpu-core": {
+      "version": "6.4.0",
+      "resolved": "https://registry.npmjs.org/regexpu-core/-/regexpu-core-6.4.0.tgz",
+      "integrity": "sha512-0ghuzq67LI9bLXpOX/ISfve/Mq33a4aFRzoQYhnnok1JOFpmE/A2TBGkNVenOGEeSBCjIiWcc6MVOG5HEQv0sA==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "regenerate": "^1.4.2",
+        "regenerate-unicode-properties": "^10.2.2",
+        "regjsgen": "^0.8.0",
+        "regjsparser": "^0.13.0",
+        "unicode-match-property-ecmascript": "^2.0.0",
+        "unicode-match-property-value-ecmascript": "^2.2.1"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/regjsgen": {
+      "version": "0.8.0",
+      "resolved": "https://registry.npmjs.org/regjsgen/-/regjsgen-0.8.0.tgz",
+      "integrity": "sha512-RvwtGe3d7LvWiDQXeQw8p5asZUmfU1G/l6WbUXeHta7Y2PEIvBTwH6E2EfmYUK8pxcxEdEmaomqyp0vZZ7C+3Q==",
+      "dev": true,
+      "license": "MIT",
       "peer": true
     },
+    "node_modules/regjsparser": {
+      "version": "0.13.0",
+      "resolved": "https://registry.npmjs.org/regjsparser/-/regjsparser-0.13.0.tgz",
+      "integrity": "sha512-NZQZdC5wOE/H3UT28fVGL+ikOZcEzfMGk/c3iN9UGxzWHMa1op7274oyiUVrAG4B2EuFhus8SvkaYnhvW92p9Q==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "peer": true,
+      "dependencies": {
+        "jsesc": "~3.1.0"
+      },
+      "bin": {
+        "regjsparser": "bin/parser"
+      }
+    },
     "node_modules/regl": {
       "name": "@plotly/regl",
       "version": "2.1.2",
       "resolved": "https://registry.npmjs.org/@plotly/regl/-/regl-2.1.2.tgz",
       "integrity": "sha512-Mdk+vUACbQvjd0m/1JJjOOafmkp/EpmHjISsopEz5Av44CBq7rPC05HHNbYGKVyNUF2zmEoBS/TT0pd0SPFFyw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/regl-error2d": {
@@ -3769,6 +6495,7 @@
       "resolved": "https://registry.npmjs.org/regl-error2d/-/regl-error2d-2.0.12.tgz",
       "integrity": "sha512-r7BUprZoPO9AbyqM5qlJesrSRkl+hZnVKWKsVp7YhOl/3RIpi4UDGASGJY0puQ96u5fBYw/OlqV24IGcgJ0McA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "array-bounds": "^1.0.1",
@@ -3785,6 +6512,7 @@
       "resolved": "https://registry.npmjs.org/regl-line2d/-/regl-line2d-3.1.3.tgz",
       "integrity": "sha512-fkgzW+tTn4QUQLpFKsUIE0sgWdCmXAM3ctXcCgoGBZTSX5FE2A0M7aynz7nrZT5baaftLrk9te54B+MEq4QcSA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "array-bounds": "^1.0.1",
@@ -3805,6 +6533,7 @@
       "resolved": "https://registry.npmjs.org/regl-scatter2d/-/regl-scatter2d-3.3.1.tgz",
       "integrity": "sha512-seOmMIVwaCwemSYz/y4WE0dbSO9svNFSqtTh5RE57I7PjGo3tcUYKtH0MTSoshcAsreoqN8HoCtnn8wfHXXfKQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@plotly/point-cluster": "^3.1.9",
@@ -3829,6 +6558,7 @@
       "resolved": "https://registry.npmjs.org/regl-splom/-/regl-splom-1.0.14.tgz",
       "integrity": "sha512-OiLqjmPRYbd7kDlHC6/zDf6L8lxgDC65BhC8JirhP4ykrK4x22ZyS+BnY8EUinXKDeMgmpRwCvUmk7BK4Nweuw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "array-bounds": "^1.0.1",
@@ -3845,6 +6575,7 @@
       "version": "2.0.2",
       "resolved": "https://registry.npmjs.org/require-from-string/-/require-from-string-2.0.2.tgz",
       "integrity": "sha512-Xf0nWe6RseziFMu+Ap9biiUbmplq6S9/p+7w7YXP/JBHhrUDDUhwa+vANyubuqfZWTveU//DYVGsDG7RKL/vEw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -3852,12 +6583,13 @@
       }
     },
     "node_modules/resolve": {
-      "version": "1.22.10",
-      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.22.10.tgz",
-      "integrity": "sha512-NPRy+/ncIMeDlTAsuqwKIiferiawhefFJtkNSW0qZJEqMEb+qBt/77B/jGeeek+F0uOeN05CDa6HXbbIgtVX4w==",
+      "version": "1.22.11",
+      "resolved": "https://registry.npmjs.org/resolve/-/resolve-1.22.11.tgz",
+      "integrity": "sha512-RfqAvLnMl313r7c9oclB1HhUEAezcpLjz95wFH4LVuhk9JF/r22qmVP9AMmOU4vMX7Q8pN8jwNg/CSpdFnMjTQ==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
-        "is-core-module": "^2.16.0",
+        "is-core-module": "^2.16.1",
         "path-parse": "^1.0.7",
         "supports-preserve-symlinks-flag": "^1.0.0"
       },
@@ -3876,6 +6608,7 @@
       "resolved": "https://registry.npmjs.org/resolve-protobuf-schema/-/resolve-protobuf-schema-2.1.0.tgz",
       "integrity": "sha512-kI5ffTiZWmJaS/huM8wZfEMer1eRd7oJQhDuxeCLe3t7N7mX3z94CN0xPxBQxFYQTSNz9T0i+v6inKqSdK8xrQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "protocol-buffers-schema": "^3.3.1"
@@ -3886,6 +6619,7 @@
       "resolved": "https://registry.npmjs.org/right-now/-/right-now-1.0.0.tgz",
       "integrity": "sha512-DA8+YS+sMIVpbsuKgy+Z67L9Lxb1p05mNxRpDPNksPDEFir4vmBlUtuN9jkTGn9YMMdlBuK7XQgFiz6ws+yhSg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/rollup": {
@@ -3979,12 +6713,14 @@
       "resolved": "https://registry.npmjs.org/rw/-/rw-1.3.3.tgz",
       "integrity": "sha512-PdhdWy89SiZogBLaw42zdeqtRJ//zFd2PgQavcICDUgJT5oW10QCRKbJ6bg4r0/UY2M6BWd5tkxuGFRvCkgfHQ==",
       "license": "BSD-3-Clause",
+      "optional": true,
       "peer": true
     },
     "node_modules/safe-buffer": {
       "version": "5.2.1",
       "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.2.1.tgz",
       "integrity": "sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==",
+      "devOptional": true,
       "funding": [
         {
           "type": "github",
@@ -4006,6 +6742,7 @@
       "resolved": "https://registry.npmjs.org/safer-buffer/-/safer-buffer-2.1.2.tgz",
       "integrity": "sha512-YZo3K82SD7Riyi0E1EQPojLz7kpepnSQI9IyPbHHg1XXXevb5dJI7tpyN2ADxGcQbHG7vcyRHk0cbwqcQriUtg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/sax": {
@@ -4013,12 +6750,14 @@
       "resolved": "https://registry.npmjs.org/sax/-/sax-1.4.1.tgz",
       "integrity": "sha512-+aWOz7yVScEGoKNd4PA10LZ8sk0A/z5+nXQG5giUO5rprX9jgYsTdov9qCchZiPIZezbZH+jRut8nPodFAX4Jg==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/schema-utils": {
       "version": "4.3.3",
       "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-4.3.3.tgz",
       "integrity": "sha512-eflK8wEtyOE6+hsaRVPxvUKYCpRgzLqDTb8krvAsRIwOGlHoSgYLgBXoubGgLd2fT41/OUYdb48v4k4WWHQurA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4045,6 +6784,7 @@
       "version": "7.7.2",
       "resolved": "https://registry.npmjs.org/semver/-/semver-7.7.2.tgz",
       "integrity": "sha512-RF0Fw+rO5AMf9MAyaRXI4AV0Ulj5lMHqVxxdSgiVbixSCXoEmmX/jk0CuJw4+3SqroYO9VoUh+HcuJivvtJemA==",
+      "devOptional": true,
       "license": "ISC",
       "bin": {
         "semver": "bin/semver.js"
@@ -4063,24 +6803,55 @@
         "randombytes": "^2.1.0"
       }
     },
+    "node_modules/shader-loader": {
+      "version": "1.3.1",
+      "resolved": "https://registry.npmjs.org/shader-loader/-/shader-loader-1.3.1.tgz",
+      "integrity": "sha512-dt8F9K0x4rjmaFyHh7rNDfpt4LUiR64zhNIEwp2WbE99B3z4ALuvvmhftkElg93dUD6sTmv/aXa/z9SJiEddcA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "loader-utils": "^1.1.0"
+      }
+    },
     "node_modules/shallow-copy": {
       "version": "0.0.1",
       "resolved": "https://registry.npmjs.org/shallow-copy/-/shallow-copy-0.0.1.tgz",
       "integrity": "sha512-b6i4ZpVuUxB9h5gfCxPiusKYkqTMOjEbBs4wMaFbkfia4yFv92UKZ6Df8WXcKbn08JNL/abvg3FnMAOfakDvUw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
+    "node_modules/shelljs": {
+      "version": "0.8.5",
+      "resolved": "https://registry.npmjs.org/shelljs/-/shelljs-0.8.5.tgz",
+      "integrity": "sha512-TiwcRcrkhHvbrZbnRcFYMLl30Dfov3HKqzp5tO5b4pt6G/SezKcYhmDg15zXVBswHmctSAQKznqNW2LO5tTDow==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "dependencies": {
+        "glob": "^7.0.0",
+        "interpret": "^1.0.0",
+        "rechoir": "^0.6.2"
+      },
+      "bin": {
+        "shjs": "bin/shjs"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
     "node_modules/signum": {
       "version": "1.0.0",
       "resolved": "https://registry.npmjs.org/signum/-/signum-1.0.0.tgz",
       "integrity": "sha512-yodFGwcyt59XRh7w5W3jPcIQb3Bwi21suEfT7MAWnBX3iCdklJpgDgvGT9o04UonglZN5SNMfJFkHIR/jO8GHw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/source-map": {
       "version": "0.6.1",
       "resolved": "https://registry.npmjs.org/source-map/-/source-map-0.6.1.tgz",
       "integrity": "sha512-UjgapumWlbMhkBgzT7Ykc5YXUT46F0iKu8SGXq0bcwP5dz/h0Plj6enJqjz1Zbq2l5WaqYnrVbwWOWMyF3F47g==",
+      "devOptional": true,
       "license": "BSD-3-Clause",
       "engines": {
         "node": ">=0.10.0"
@@ -4090,6 +6861,7 @@
       "version": "1.2.1",
       "resolved": "https://registry.npmjs.org/source-map-js/-/source-map-js-1.2.1.tgz",
       "integrity": "sha512-UXWMKhLOwVKb728IUtQPXxfYU+usdybtUrK/8uGE8CQMvrhOpwvzDBwj0QhSL7MQc7vIsISBG8VQ8+IDQxpfQA==",
+      "devOptional": true,
       "license": "BSD-3-Clause",
       "peer": true,
       "engines": {
@@ -4100,12 +6872,20 @@
       "version": "0.5.21",
       "resolved": "https://registry.npmjs.org/source-map-support/-/source-map-support-0.5.21.tgz",
       "integrity": "sha512-uBHU3L3czsIyYXKX88fdrGovxdSCoTGDRZ6SYXtSRxLZUzHg5P/66Ht6uoUlHu9EZod+inXhKo3qQgwXUT/y1w==",
+      "devOptional": true,
       "license": "MIT",
       "dependencies": {
         "buffer-from": "^1.0.0",
         "source-map": "^0.6.0"
       }
     },
+    "node_modules/spark-md5": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/spark-md5/-/spark-md5-3.0.2.tgz",
+      "integrity": "sha512-wcFzz9cDfbuqe0FZzfi2or1sgyIrsDwmPwfZC4hiNidPdPINjeUwNfv5kldczoEAcjl9Y1L3SM7Uz2PUEQzxQw==",
+      "dev": true,
+      "license": "(WTFPL OR MIT)"
+    },
     "node_modules/sprintf-js": {
       "version": "1.0.3",
       "resolved": "https://registry.npmjs.org/sprintf-js/-/sprintf-js-1.0.3.tgz",
@@ -4117,6 +6897,7 @@
       "version": "0.0.9",
       "resolved": "https://registry.npmjs.org/stack-trace/-/stack-trace-0.0.9.tgz",
       "integrity": "sha512-vjUc6sfgtgY0dxCdnc40mK6Oftjo9+2K8H/NG81TMhgL392FtiPA9tn9RLyTxXmTLPJPjF3VyzFp6bsWFLisMQ==",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": "*"
@@ -4127,16 +6908,44 @@
       "resolved": "https://registry.npmjs.org/static-eval/-/static-eval-2.1.1.tgz",
       "integrity": "sha512-MgWpQ/ZjGieSVB3eOJVs4OA2LT/q1vx98KPCTTQPzq/aLr0YUXTsgryTXr4SLfR0ZfUUCiedM9n/ABeDIyy4mA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "escodegen": "^2.1.0"
       }
     },
+    "node_modules/stream-browserify": {
+      "version": "3.0.0",
+      "resolved": "https://registry.npmjs.org/stream-browserify/-/stream-browserify-3.0.0.tgz",
+      "integrity": "sha512-H73RAHsVBapbim0tU2JwwOiXUj+fikfiaoYAKHF3VJfA0pe2BCzkhAHBlLG6REzE+2WNZcxOXjK7lkso+9euLA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "inherits": "~2.0.4",
+        "readable-stream": "^3.5.0"
+      }
+    },
+    "node_modules/stream-browserify/node_modules/readable-stream": {
+      "version": "3.6.2",
+      "resolved": "https://registry.npmjs.org/readable-stream/-/readable-stream-3.6.2.tgz",
+      "integrity": "sha512-9u/sniCrY3D5WdsERHzHE4G2YCXqoG5FTHUiCC4SIbr6XcLZBY05ya9EKjYek9O5xOAwjGq+1JdGBAS7Q9ScoA==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "inherits": "^2.0.3",
+        "string_decoder": "^1.1.1",
+        "util-deprecate": "^1.0.1"
+      },
+      "engines": {
+        "node": ">= 6"
+      }
+    },
     "node_modules/stream-parser": {
       "version": "0.3.1",
       "resolved": "https://registry.npmjs.org/stream-parser/-/stream-parser-0.3.1.tgz",
       "integrity": "sha512-bJ/HgKq41nlKvlhccD5kaCr/P+Hu0wPNKPJOH7en+YrJu/9EgqUF+88w5Jb6KNcjOFMhfX4B2asfeAtIGuHObQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "debug": "2"
@@ -4147,6 +6956,7 @@
       "resolved": "https://registry.npmjs.org/debug/-/debug-2.6.9.tgz",
       "integrity": "sha512-bC7ElrdJaJnPbAP+1EotYvqZsb3ecl5wi6Bfi6BJTUcNowp6cvspg0jXznRTKDjm/E7AdgFBVeAPVMNcKGsHMA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "ms": "2.0.0"
@@ -4157,6 +6967,7 @@
       "resolved": "https://registry.npmjs.org/ms/-/ms-2.0.0.tgz",
       "integrity": "sha512-Tpp60P6IUJDTuOq/5Z8cdskzJujfwqfOTkrwIwj7IRISpnkJnT6SyJ4PCPnGMoFjC9ddhal5KVIYtAt97ix05A==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/stream-shift": {
@@ -4164,14 +6975,15 @@
       "resolved": "https://registry.npmjs.org/stream-shift/-/stream-shift-1.0.3.tgz",
       "integrity": "sha512-76ORR0DO1o1hlKwTbi/DM3EXWGf3ZJYO8cXX5RJwnul2DEg2oyoZyjLNoQM8WsvZiFKCRfC1O0J7iCvie3RZmQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/string_decoder": {
       "version": "1.1.1",
       "resolved": "https://registry.npmjs.org/string_decoder/-/string_decoder-1.1.1.tgz",
       "integrity": "sha512-n/ShnvDi6FHbbVfviro+WojiFzv+s8MPMHBczVePfUpDJLwoLT0ht1l4YwBCbi8pJAveEEdnkHyPyTP/mzRfwg==",
+      "devOptional": true,
       "license": "MIT",
-      "peer": true,
       "dependencies": {
         "safe-buffer": "~5.1.0"
       }
@@ -4180,14 +6992,15 @@
       "version": "5.1.2",
       "resolved": "https://registry.npmjs.org/safe-buffer/-/safe-buffer-5.1.2.tgz",
       "integrity": "sha512-Gd2UZBJDkXlY7GbJxfsE8/nvKkUEU1G38c1siN6QP6a9PT9MmHB8GnpscSmMJSoF8LOIrt8ud/wPtojys4G6+g==",
-      "license": "MIT",
-      "peer": true
+      "devOptional": true,
+      "license": "MIT"
     },
     "node_modules/string-split-by": {
       "version": "1.0.0",
       "resolved": "https://registry.npmjs.org/string-split-by/-/string-split-by-1.0.0.tgz",
       "integrity": "sha512-KaJKY+hfpzNyet/emP81PJA9hTVSfxNLS9SFTWxdCnnW1/zOOwiV248+EfoX7IQFcBaOp4G5YE6xTJMF+pLg6A==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "parenthesis": "^3.1.5"
@@ -4198,6 +7011,7 @@
       "resolved": "https://registry.npmjs.org/strongly-connected-components/-/strongly-connected-components-1.0.1.tgz",
       "integrity": "sha512-i0TFx4wPcO0FwX+4RkLJi1MxmcTv90jNZgxMu9XRnMXMeFUY1VJlIoXpZunPUvUUqbCT1pg5PEkFqqpcaElNaA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/style-loader": {
@@ -4205,6 +7019,7 @@
       "resolved": "https://registry.npmjs.org/style-loader/-/style-loader-4.0.0.tgz",
       "integrity": "sha512-1V4WqhhZZgjVAVJyt7TdDPZoPBPNHbekX4fWnCJL1yQukhCeZhJySUL+gL9y6sNdN95uEOS83Y55SqHcP7MzLA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">= 18.12.0"
@@ -4222,6 +7037,7 @@
       "resolved": "https://registry.npmjs.org/supercluster/-/supercluster-7.1.5.tgz",
       "integrity": "sha512-EulshI3pGUM66o6ZdH3ReiFcvHpM3vAigyK+vcxdjpJyEbIIrtbmBdY23mGgnI24uXiGFvrGq9Gkum/8U7vJWg==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "kdbush": "^3.0.0"
@@ -4232,6 +7048,7 @@
       "resolved": "https://registry.npmjs.org/kdbush/-/kdbush-3.0.0.tgz",
       "integrity": "sha512-hRkd6/XW4HTsA9vjVpY9tuXJYLSlelnkTmVFu4M9/7MIYQtFcHpbugAU7UbOfjOiVSVYl2fqgBuJ32JUmRo5Ew==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/superscript-text": {
@@ -4239,6 +7056,7 @@
       "resolved": "https://registry.npmjs.org/superscript-text/-/superscript-text-1.0.0.tgz",
       "integrity": "sha512-gwu8l5MtRZ6koO0icVTlmN5pm7Dhh1+Xpe9O4x6ObMAsW+3jPbW14d1DsBq1F4wiI+WOFjXF35pslgec/G8yCQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/supports-color": {
@@ -4258,6 +7076,7 @@
       "version": "1.0.0",
       "resolved": "https://registry.npmjs.org/supports-preserve-symlinks-flag/-/supports-preserve-symlinks-flag-1.0.0.tgz",
       "integrity": "sha512-ot0WnXS9fgdkgIcePe6RHNk1WA8+muPa6cSjeR3V8K27q9BB1rTE3R1p7Hv0z1ZyAc8s6Vvv8DIyWf681MAt0w==",
+      "devOptional": true,
       "license": "MIT",
       "engines": {
         "node": ">= 0.4"
@@ -4271,6 +7090,7 @@
       "resolved": "https://registry.npmjs.org/svg-arc-to-cubic-bezier/-/svg-arc-to-cubic-bezier-3.2.0.tgz",
       "integrity": "sha512-djbJ/vZKZO+gPoSDThGNpKDO+o+bAeA4XQKovvkNCqnIS2t+S4qnLAGQhyyrulhCFRl1WWzAp0wUDV8PpTVU3g==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/svg-path-bounds": {
@@ -4278,6 +7098,7 @@
       "resolved": "https://registry.npmjs.org/svg-path-bounds/-/svg-path-bounds-1.0.2.tgz",
       "integrity": "sha512-H4/uAgLWrppIC0kHsb2/dWUYSmb4GE5UqH06uqWBcg6LBjX2fu0A8+JrO2/FJPZiSsNOKZAhyFFgsLTdYUvSqQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "abs-svg-path": "^0.1.1",
@@ -4291,6 +7112,7 @@
       "resolved": "https://registry.npmjs.org/normalize-svg-path/-/normalize-svg-path-1.1.0.tgz",
       "integrity": "sha512-r9KHKG2UUeB5LoTouwDzBy2VxXlHsiM6fyLQvnJa0S5hrhzqElH/CH7TUGhT1fVvIYBIKf3OpY4YJ4CK+iaqHg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "svg-arc-to-cubic-bezier": "^3.0.0"
@@ -4301,6 +7123,7 @@
       "resolved": "https://registry.npmjs.org/svg-path-sdf/-/svg-path-sdf-1.1.3.tgz",
       "integrity": "sha512-vJJjVq/R5lSr2KLfVXVAStktfcfa1pNFjFOgyJnzZFXlO/fDZ5DmM8FpnSKKzLPfEYTVeXuVBTHF296TpxuJVg==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "bitmap-sdf": "^1.0.0",
@@ -4327,6 +7150,7 @@
       "version": "2.3.0",
       "resolved": "https://registry.npmjs.org/tapable/-/tapable-2.3.0.tgz",
       "integrity": "sha512-g9ljZiwki/LfxmQADO3dEY1CbpmXT5Hm2fJ+QaGKwSXUylMybePR7/67YW7jOrrvjEgL1Fmz5kzyAjWVWLlucg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
@@ -4341,6 +7165,7 @@
       "version": "5.39.2",
       "resolved": "https://registry.npmjs.org/terser/-/terser-5.39.2.tgz",
       "integrity": "sha512-yEPUmWve+VA78bI71BW70Dh0TuV4HHd+I5SHOAfS1+QBOmvmCiiffgjR8ryyEd3KIfvPGFqoADt8LdQ6XpXIvg==",
+      "devOptional": true,
       "license": "BSD-2-Clause",
       "dependencies": {
         "@jridgewell/source-map": "^0.3.3",
@@ -4359,6 +7184,7 @@
       "version": "5.3.14",
       "resolved": "https://registry.npmjs.org/terser-webpack-plugin/-/terser-webpack-plugin-5.3.14.tgz",
       "integrity": "sha512-vkZjpUjb6OMS7dhV+tILUW6BhpDR7P2L/aQSAv+Uwk+m8KATX9EccViHTJR2qDtACKPIYndLGCyl3FMo+r2LMw==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4394,6 +7220,7 @@
       "version": "27.5.1",
       "resolved": "https://registry.npmjs.org/jest-worker/-/jest-worker-27.5.1.tgz",
       "integrity": "sha512-7vuh85V5cdDofPyxn58nrPjBktZo0u9x1g8WtjQol+jZDaE+fhN+cIvTj11GndBnMnyfrUOG1sZQxCdjKh+DKg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4409,6 +7236,7 @@
       "version": "6.0.2",
       "resolved": "https://registry.npmjs.org/serialize-javascript/-/serialize-javascript-6.0.2.tgz",
       "integrity": "sha512-Saa1xPByTTq2gdeFZYLLo+RFE35NHZkAbqZeWNd3BpzppeVisAqpDjcp8dyf6uIvEqJRd46jemmyA4iFIeVk8g==",
+      "devOptional": true,
       "license": "BSD-3-Clause",
       "peer": true,
       "dependencies": {
@@ -4419,6 +7247,7 @@
       "version": "8.1.1",
       "resolved": "https://registry.npmjs.org/supports-color/-/supports-color-8.1.1.tgz",
       "integrity": "sha512-MpUEN2OodtUzxvKQl72cUF7RQ5EiHsGvSsVG0ia9c5RbWGL2CI4C7EpPS8UTBIplnlzZiNuV56w+FuNxy3ty2Q==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4450,6 +7279,7 @@
       "resolved": "https://registry.npmjs.org/through2/-/through2-2.0.5.tgz",
       "integrity": "sha512-/mrRod8xqpA+IHSLyGCQ2s8SPHiCDEeQJSep1jqLYeEUClOFG2Qsh+4FU6G9VeqpZnGW/Su8LQGc4YKni5rYSQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "readable-stream": "~2.3.6",
@@ -4467,6 +7297,7 @@
       "resolved": "https://registry.npmjs.org/tinycolor2/-/tinycolor2-1.6.0.tgz",
       "integrity": "sha512-XPaBkWQJdsf3pLKJV9p4qN/S+fm2Oj8AIPo1BTUhg5oxkvm9+SVEGFdhyOz7tTdUTfvxMiAs4sp6/eZO2Ew+pw==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/tinyqueue": {
@@ -4474,6 +7305,7 @@
       "resolved": "https://registry.npmjs.org/tinyqueue/-/tinyqueue-2.0.3.tgz",
       "integrity": "sha512-ppJZNDuKGgxzkHihX8v9v9G5f+18gzaTfrukGrq6ueg0lmH4nqVnA2IPG0AEH3jKEk2GRJCUhDoqpoiw3PHLBA==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/to-float32": {
@@ -4481,6 +7313,7 @@
       "resolved": "https://registry.npmjs.org/to-float32/-/to-float32-1.1.0.tgz",
       "integrity": "sha512-keDnAusn/vc+R3iEiSDw8TOF7gPiTLdK1ArvWtYbJQiVfmRg6i/CAvbKq3uIS0vWroAC7ZecN3DjQKw3aSklUg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/to-px": {
@@ -4488,6 +7321,7 @@
       "resolved": "https://registry.npmjs.org/to-px/-/to-px-1.0.1.tgz",
       "integrity": "sha512-2y3LjBeIZYL19e5gczp14/uRWFDtDUErJPVN3VU9a7SJO+RjGRtYR47aMN2bZgGlxvW4ZcEz2ddUPVHXcMfuXw==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "parse-unit": "^1.0.1"
@@ -4498,6 +7332,7 @@
       "resolved": "https://registry.npmjs.org/topojson-client/-/topojson-client-3.1.0.tgz",
       "integrity": "sha512-605uxS6bcYxGXw9qi62XyrV6Q3xwbndjachmNxu8HWTtVPxZfEJN9fd/SZS1Q54Sn2y0TMyMxFj/cJINqGHrKw==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "commander": "2"
@@ -4512,6 +7347,7 @@
       "version": "2.8.1",
       "resolved": "https://registry.npmjs.org/tslib/-/tslib-2.8.1.tgz",
       "integrity": "sha512-oJFu94HQb+KVduSUQL7wnpmqnfmLsOA/nAh6b6EH0wCEoK0/mPeXU6c3wKDV83MkOuHPRHtSXKKU99IBazS/2w==",
+      "devOptional": true,
       "license": "0BSD"
     },
     "node_modules/type": {
@@ -4519,6 +7355,7 @@
       "resolved": "https://registry.npmjs.org/type/-/type-2.7.3.tgz",
       "integrity": "sha512-8j+1QmAbPvLZow5Qpi6NCaN8FB60p/6x8/vfNqOk/hC+HuvFZhL4+WfekuhQLiqFZXOgQdrs3B+XxEmCc6b3FQ==",
       "license": "ISC",
+      "optional": true,
       "peer": true
     },
     "node_modules/typed-function": {
@@ -4535,6 +7372,7 @@
       "resolved": "https://registry.npmjs.org/typedarray/-/typedarray-0.0.6.tgz",
       "integrity": "sha512-/aCDEGatGvZ2BIk+HmLf4ifCJFwvKFNb9/JeZPMulfgFracn9QFcAf5GO8B/mweUjSoblS5In0cWhqpfs/5PQA==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/typedarray-pool": {
@@ -4542,6 +7380,7 @@
       "resolved": "https://registry.npmjs.org/typedarray-pool/-/typedarray-pool-1.2.0.tgz",
       "integrity": "sha512-YTSQbzX43yvtpfRtIDAYygoYtgT+Rpjuxy9iOpczrjpXLgGoyG7aS5USJXV2d3nn8uHTeb9rXDvzS27zUg5KYQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "bit-twiddle": "^1.0.0",
@@ -4567,8 +7406,57 @@
       "version": "6.21.0",
       "resolved": "https://registry.npmjs.org/undici-types/-/undici-types-6.21.0.tgz",
       "integrity": "sha512-iwDZqg0QAGrg9Rav5H4n0M64c3mkR59cJ6wQp+7C4nI0gsmExaedaYLNO44eT4AtBBwjbTiGPMlt2Md0T9H9JQ==",
+      "devOptional": true,
       "license": "MIT"
     },
+    "node_modules/unicode-canonical-property-names-ecmascript": {
+      "version": "2.0.1",
+      "resolved": "https://registry.npmjs.org/unicode-canonical-property-names-ecmascript/-/unicode-canonical-property-names-ecmascript-2.0.1.tgz",
+      "integrity": "sha512-dA8WbNeb2a6oQzAQ55YlT5vQAWGV9WXOsi3SskE3bcCdM0P4SDd+24zS/OCacdRq5BkdsRj9q3Pg6YyQoxIGqg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-match-property-ecmascript": {
+      "version": "2.0.0",
+      "resolved": "https://registry.npmjs.org/unicode-match-property-ecmascript/-/unicode-match-property-ecmascript-2.0.0.tgz",
+      "integrity": "sha512-5kaZCrbp5mmbz5ulBkDkbY0SsPOjKqVS35VpL9ulMPfSl0J0Xsm+9Evphv9CoIZFwre7aJoa94AY6seMKGVN5Q==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "dependencies": {
+        "unicode-canonical-property-names-ecmascript": "^2.0.0",
+        "unicode-property-aliases-ecmascript": "^2.0.0"
+      },
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-match-property-value-ecmascript": {
+      "version": "2.2.1",
+      "resolved": "https://registry.npmjs.org/unicode-match-property-value-ecmascript/-/unicode-match-property-value-ecmascript-2.2.1.tgz",
+      "integrity": "sha512-JQ84qTuMg4nVkx8ga4A16a1epI9H6uTXAknqxkGF/aFfRLw1xC/Bp24HNLaZhHSkWd3+84t8iXnp1J0kYcZHhg==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=4"
+      }
+    },
+    "node_modules/unicode-property-aliases-ecmascript": {
+      "version": "2.2.0",
+      "resolved": "https://registry.npmjs.org/unicode-property-aliases-ecmascript/-/unicode-property-aliases-ecmascript-2.2.0.tgz",
+      "integrity": "sha512-hpbDzxUY9BFwX+UeBnxv3Sh1q7HFxj48DTmXchNgRa46lO8uj3/1iEn3MiNUYTg1g9ctIqXCCERn8gYZhHC5lQ==",
+      "dev": true,
+      "license": "MIT",
+      "peer": true,
+      "engines": {
+        "node": ">=4"
+      }
+    },
     "node_modules/universalify": {
       "version": "2.0.1",
       "resolved": "https://registry.npmjs.org/universalify/-/universalify-2.0.1.tgz",
@@ -4584,12 +7472,14 @@
       "resolved": "https://registry.npmjs.org/unquote/-/unquote-1.1.1.tgz",
       "integrity": "sha512-vRCqFv6UhXpWxZPyGDh/F3ZpNv8/qo7w6iufLpQg9aKnQ71qM4B5KiI7Mia9COcjEhrO9LueHpMYjYzsWH3OIg==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
     "node_modules/update-browserslist-db": {
-      "version": "1.1.4",
-      "resolved": "https://registry.npmjs.org/update-browserslist-db/-/update-browserslist-db-1.1.4.tgz",
-      "integrity": "sha512-q0SPT4xyU84saUX+tomz1WLkxUbuaJnR1xWt17M7fJtEJigJeWUNGUqrauFXsHnqev9y9JTRGwk13tFBuKby4A==",
+      "version": "1.2.3",
+      "resolved": "https://registry.npmjs.org/update-browserslist-db/-/update-browserslist-db-1.2.3.tgz",
+      "integrity": "sha512-Js0m9cx+qOgDxo0eMiFGEueWztz+d4+M3rGlmKPT+T4IS/jP4ylw3Nwpu6cpTTP8R1MAC1kF4VbdLt3ARf209w==",
+      "devOptional": true,
       "funding": [
         {
           "type": "opencollective",
@@ -4622,20 +7512,42 @@
       "resolved": "https://registry.npmjs.org/update-diff/-/update-diff-1.1.0.tgz",
       "integrity": "sha512-rCiBPiHxZwT4+sBhEbChzpO5hYHjm91kScWgdHf4Qeafs6Ba7MBl+d9GlGv72bcTZQO0sLmtQS1pHSWoCLtN/A==",
       "license": "MIT",
+      "optional": true,
       "peer": true
     },
+    "node_modules/uri-js": {
+      "version": "4.4.1",
+      "resolved": "https://registry.npmjs.org/uri-js/-/uri-js-4.4.1.tgz",
+      "integrity": "sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==",
+      "dev": true,
+      "license": "BSD-2-Clause",
+      "dependencies": {
+        "punycode": "^2.1.0"
+      }
+    },
+    "node_modules/utif": {
+      "version": "3.1.0",
+      "resolved": "https://registry.npmjs.org/utif/-/utif-3.1.0.tgz",
+      "integrity": "sha512-WEo4D/xOvFW53K5f5QTaTbbiORcm2/pCL9P6qmJnup+17eYfKaEhDeX9PeQkuyEoIxlbGklDuGl8xwuXYMrrXQ==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "pako": "^1.0.5"
+      }
+    },
     "node_modules/util-deprecate": {
       "version": "1.0.2",
       "resolved": "https://registry.npmjs.org/util-deprecate/-/util-deprecate-1.0.2.tgz",
       "integrity": "sha512-EPD5q1uXyFxJpCrLnCc1nHnq3gOa6DZBocAIiI2TaSCA7VCJ1UJDMagCzIkXNsUYfD1daK//LTEQ8xiIbrHtcw==",
-      "license": "MIT",
-      "peer": true
+      "devOptional": true,
+      "license": "MIT"
     },
     "node_modules/vt-pbf": {
       "version": "3.1.3",
       "resolved": "https://registry.npmjs.org/vt-pbf/-/vt-pbf-3.1.3.tgz",
       "integrity": "sha512-2LzDFzt0mZKZ9IpVF2r69G9bXaP2Q2sArJCmcCgvfTdCCZzSyz4aCLoQyUilu37Ll56tCblIZrXFIjNUpGIlmA==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "@mapbox/point-geometry": "0.1.0",
@@ -4647,6 +7559,7 @@
       "version": "2.4.4",
       "resolved": "https://registry.npmjs.org/watchpack/-/watchpack-2.4.4.tgz",
       "integrity": "sha512-c5EGNOiyxxV5qmTtAB7rbiXxi1ooX1pQKMLX/MIabJjRA0SJBQOjKF+KSVfHkr9U1cADPon0mRiVe/riyaiDUA==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4662,6 +7575,7 @@
       "resolved": "https://registry.npmjs.org/weak-map/-/weak-map-1.0.8.tgz",
       "integrity": "sha512-lNR9aAefbGPpHO7AEnY0hCFjz1eTkWCXYvkTRrTHs9qv8zJp+SkVYpzfLIFXQQiG3tVvbNFQgVg2bQS8YGgxyw==",
       "license": "Apache-2.0",
+      "optional": true,
       "peer": true
     },
     "node_modules/webgl-context": {
@@ -4669,6 +7583,7 @@
       "resolved": "https://registry.npmjs.org/webgl-context/-/webgl-context-2.2.0.tgz",
       "integrity": "sha512-q/fGIivtqTT7PEoF07axFIlHNk/XCPaYpq64btnepopSWvKNFkoORlQYgqDigBIuGA1ExnFd/GnSUnBNEPQY7Q==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "get-canvas-context": "^1.0.1"
@@ -4678,6 +7593,7 @@
       "version": "5.102.1",
       "resolved": "https://registry.npmjs.org/webpack/-/webpack-5.102.1.tgz",
       "integrity": "sha512-7h/weGm9d/ywQ6qzJ+Xy+r9n/3qgp/thalBbpOi5i223dPXKi04IBtqPN9nTd+jBc7QKfvDbaBnFipYp4sJAUQ==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "dependencies": {
@@ -4727,17 +7643,26 @@
       "version": "3.3.3",
       "resolved": "https://registry.npmjs.org/webpack-sources/-/webpack-sources-3.3.3.tgz",
       "integrity": "sha512-yd1RBzSGanHkitROoPFd6qsrxt+oFhg/129YzheDGqeustzX0vTZJZsSsQjVQC4yzBQ56K55XU8gaNCtIzOnTg==",
+      "devOptional": true,
       "license": "MIT",
       "peer": true,
       "engines": {
         "node": ">=10.13.0"
       }
     },
+    "node_modules/webworker-promise": {
+      "version": "0.5.0",
+      "resolved": "https://registry.npmjs.org/webworker-promise/-/webworker-promise-0.5.0.tgz",
+      "integrity": "sha512-14iR79jHAV7ozwvbfif+3wCaApT3I1g8Lo0rJZrwAu6wxZGx/08Y8KXz6as6ZLNUEEufeiEBBYrqyDBClXOsEw==",
+      "dev": true,
+      "license": "MIT"
+    },
     "node_modules/which": {
       "version": "4.0.0",
       "resolved": "https://registry.npmjs.org/which/-/which-4.0.0.tgz",
       "integrity": "sha512-GlaYyEb07DPxYCKhKzplCWBJtvxZcZMrL+4UkrTSJHHPyZU4mYYTv3qaOe77H7EODLSSopAUFAc6W8U4yqvscg==",
       "license": "ISC",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "isexe": "^3.1.1"
@@ -4749,11 +7674,101 @@
         "node": "^16.13.0 || >=18.0.0"
       }
     },
+    "node_modules/worker-loader": {
+      "version": "3.0.8",
+      "resolved": "https://registry.npmjs.org/worker-loader/-/worker-loader-3.0.8.tgz",
+      "integrity": "sha512-XQyQkIFeRVC7f7uRhFdNMe/iJOdO6zxAaR3EWbDp45v3mDhrTi+++oswKNxShUNjPC/1xUp5DB29YKLhFo129g==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "loader-utils": "^2.0.0",
+        "schema-utils": "^3.0.0"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      },
+      "peerDependencies": {
+        "webpack": "^4.0.0 || ^5.0.0"
+      }
+    },
+    "node_modules/worker-loader/node_modules/ajv": {
+      "version": "6.14.0",
+      "resolved": "https://registry.npmjs.org/ajv/-/ajv-6.14.0.tgz",
+      "integrity": "sha512-IWrosm/yrn43eiKqkfkHis7QioDleaXQHdDVPKg0FSwwd/DuvyX79TZnFOnYpB7dcsFAMmtFztZuXPDvSePkFw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "fast-deep-equal": "^3.1.1",
+        "fast-json-stable-stringify": "^2.0.0",
+        "json-schema-traverse": "^0.4.1",
+        "uri-js": "^4.2.2"
+      },
+      "funding": {
+        "type": "github",
+        "url": "https://github.com/sponsors/epoberezkin"
+      }
+    },
+    "node_modules/worker-loader/node_modules/ajv-keywords": {
+      "version": "3.5.2",
+      "resolved": "https://registry.npmjs.org/ajv-keywords/-/ajv-keywords-3.5.2.tgz",
+      "integrity": "sha512-5p6WTN0DdTGVQk6VjcEju19IgaHudalcfabD7yhDGeA6bcQnmL+CpveLJq/3hvfwd1aof6L386Ougkx6RfyMIQ==",
+      "dev": true,
+      "license": "MIT",
+      "peerDependencies": {
+        "ajv": "^6.9.1"
+      }
+    },
+    "node_modules/worker-loader/node_modules/json-schema-traverse": {
+      "version": "0.4.1",
+      "resolved": "https://registry.npmjs.org/json-schema-traverse/-/json-schema-traverse-0.4.1.tgz",
+      "integrity": "sha512-xbbCH5dCYU5T8LcEhhuh7HJ88HXuW3qsI3Y0zOZFKfZEHcpWiHU/Jxzk629Brsab/mMiHQti9wMP+845RPe3Vg==",
+      "dev": true,
+      "license": "MIT"
+    },
+    "node_modules/worker-loader/node_modules/loader-utils": {
+      "version": "2.0.4",
+      "resolved": "https://registry.npmjs.org/loader-utils/-/loader-utils-2.0.4.tgz",
+      "integrity": "sha512-xXqpXoINfFhgua9xiqD8fPFHgkoq1mmmpE92WlDbm9rNRd/EbRb+Gqf908T2DMfuHjjJlksiK2RbHVOdD/MqSw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "big.js": "^5.2.2",
+        "emojis-list": "^3.0.0",
+        "json5": "^2.1.2"
+      },
+      "engines": {
+        "node": ">=8.9.0"
+      }
+    },
+    "node_modules/worker-loader/node_modules/schema-utils": {
+      "version": "3.3.0",
+      "resolved": "https://registry.npmjs.org/schema-utils/-/schema-utils-3.3.0.tgz",
+      "integrity": "sha512-pN/yOAvcC+5rQ5nERGuwrjLlYvLTbCibnZ1I7B1LaiAz9BRBlE9GMgE/eqV30P7aJQUf7Ddimy/RsbYO/GrVGg==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@types/json-schema": "^7.0.8",
+        "ajv": "^6.12.5",
+        "ajv-keywords": "^3.5.2"
+      },
+      "engines": {
+        "node": ">= 10.13.0"
+      },
+      "funding": {
+        "type": "opencollective",
+        "url": "https://opencollective.com/webpack"
+      }
+    },
     "node_modules/world-calendars": {
       "version": "1.0.4",
       "resolved": "https://registry.npmjs.org/world-calendars/-/world-calendars-1.0.4.tgz",
       "integrity": "sha512-VGRnLJS+xJmGDPodgJRnGIDwGu0s+Cr9V2HB3EzlDZ5n0qb8h5SJtGUEkjrphZYAglEiXZ6kiXdmk0H/h/uu/w==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "dependencies": {
         "object-assign": "^4.1.0"
@@ -4763,18 +7778,55 @@
       "version": "1.0.2",
       "resolved": "https://registry.npmjs.org/wrappy/-/wrappy-1.0.2.tgz",
       "integrity": "sha512-l4Sp/DRseor9wL6EvV2+TuQn63dMkPjZ/sp9XkghTEbV9KlPS1xUsZ3u7/IQO4wxtcFB4bgpQPRcR3QCvezPcQ==",
-      "license": "ISC",
-      "peer": true
+      "devOptional": true,
+      "license": "ISC"
+    },
+    "node_modules/wslink": {
+      "version": "2.5.0",
+      "resolved": "https://registry.npmjs.org/wslink/-/wslink-2.5.0.tgz",
+      "integrity": "sha512-+m7GWH9G3Y2iAN9CP8M5z/Re2u/Q1KEXvUZ2ISGle7CF6T07z2jS8sWfgp4Y8ZRUbUCHp6IJnEL1xkbzeNn18Q==",
+      "dev": true,
+      "license": "BSD-3-Clause",
+      "peer": true,
+      "dependencies": {
+        "@msgpack/msgpack": "^2.8.0"
+      }
+    },
+    "node_modules/xmlbuilder2": {
+      "version": "3.0.2",
+      "resolved": "https://registry.npmjs.org/xmlbuilder2/-/xmlbuilder2-3.0.2.tgz",
+      "integrity": "sha512-h4MUawGY21CTdhV4xm3DG9dgsqyhDkZvVJBx88beqX8wJs3VgyGQgAn5VreHuae6unTQxh115aMK5InCVmOIKw==",
+      "dev": true,
+      "license": "MIT",
+      "dependencies": {
+        "@oozcitak/dom": "1.15.10",
+        "@oozcitak/infra": "1.0.8",
+        "@oozcitak/util": "8.3.8",
+        "@types/node": "*",
+        "js-yaml": "3.14.0"
+      },
+      "engines": {
+        "node": ">=12.0"
+      }
     },
     "node_modules/xtend": {
       "version": "4.0.2",
       "resolved": "https://registry.npmjs.org/xtend/-/xtend-4.0.2.tgz",
       "integrity": "sha512-LKYU1iAXJXUgAXn9URjiu+MWhyUXHsvfp7mcuYm9dSUKK0/CjtrUwFAxD82/mCWbtLsGjFIad0wIsod4zrTAEQ==",
       "license": "MIT",
+      "optional": true,
       "peer": true,
       "engines": {
         "node": ">=0.4"
       }
+    },
+    "node_modules/yallist": {
+      "version": "3.1.1",
+      "resolved": "https://registry.npmjs.org/yallist/-/yallist-3.1.1.tgz",
+      "integrity": "sha512-a4UGQaWPH59mOXUYnAG2ewncQS4i4F43Tv3JoAM+s2VDAmS9NsK8GpDMLrCHPksFT7h3K6TOoUNn2pb7RoXx4g==",
+      "dev": true,
+      "license": "ISC",
+      "peer": true
     }
   }
 }
diff --git a/package.json b/package.json
index 1f438ba..cc826ea 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "feascript",
-  "version": "0.2.0",
+  "version": "0.3.0-RC",
   "description": "Lightweight finite element simulation library built in JavaScript",
   "main": "dist/feascript.cjs.js",
   "module": "dist/feascript.esm.js",
@@ -18,7 +18,9 @@
   },
   "scripts": {
     "build": "rollup -c",
+    "prepare": "npm run build",
     "prepublishOnly": "npm run build",
+    "pretest": "npm run build",
     "test": "for file in $(find examples -name '*.js' -type f | sort); do echo 'Running' \"$file\"; if node \"$file\" > /dev/null 2>&1; then echo 'Success'; else echo 'Failed'; fi; done"
   },
   "repository": {
@@ -64,9 +66,15 @@
   },
   "peerDependencies": {
     "mathjs": "^11.12.0",
+    "@kitware/vtk.js": "^32.12.0",
     "plotly.js": "^2.35.3"
   },
+  "peerDependenciesMeta": {
+    "@kitware/vtk.js": { "optional": true },
+    "plotly.js": { "optional": true }
+  },
   "devDependencies": {
+    "@kitware/vtk.js": "^32.12.0",
     "@rollup/plugin-commonjs": "^28.0.3",
     "@rollup/plugin-node-resolve": "^16.0.1",
     "mathjs": "^11.12.0",
diff --git a/rollup.config.js b/rollup.config.js
index 5b61ecf..bc98b12 100644
--- a/rollup.config.js
+++ b/rollup.config.js
@@ -39,5 +39,5 @@ export default {
     }),
     terser(),
   ],
-  external: [],
+  external: (id) => id === "@kitware/vtk.js" || id.startsWith("@kitware/vtk.js/") || id === "plotly.js",
 };
diff --git a/src/FEAScript.js b/src/FEAScript.js
index f5eea00..4660903 100644
--- a/src/FEAScript.js
+++ b/src/FEAScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -34,19 +34,18 @@ export class FEAScriptModel {
     this.solverMethod = "lusolve"; // Default solver method
     this.coefficientFunctions = null; // Add storage for coefficient functions
     warnLog(
-      "FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE"
+      "FEAScript is provided “as is” without any warranty. The authors are not responsible for any damages or losses that may result from using the software. See the license for more details: https://github.com/FEAScript/FEAScript-core/blob/main/LICENSE",
     );
     basicLog("FEAScriptModel instance created");
   }
 
   /**
-   * Method to set the solver configuration
-   * @param {string} solverConfig - Parameter specifying the type of solver
+   * Method to set the model configuration
+   * @param {string} modelConfig - Parameter specifying the type of model
    * @param {object} [options] - Optional additional configuration
    */
-  setSolverConfig(solverConfig, options = {}) {
-    this.solverConfig = solverConfig;
-    warnLog("setSolverConfig() is deprecated. Use setModelConfig() instead");
+  setModelConfig(modelConfig, options = {}) {
+    this.solverConfig = modelConfig;
 
     // Store coefficient functions if provided
     if (options?.coefficientFunctions !== undefined) {
@@ -63,12 +62,7 @@ export class FEAScriptModel {
       debugLog(`tolerance set to ${this.tolerance}`);
     }
 
-    debugLog(`solverConfig set to ${solverConfig}`);
-  }
-
-  // Alias modelConfig to solverConfig (solverConfig is deprecated, use setModelConfig instead)
-  setModelConfig(modelConfig, options = {}) {
-    this.setSolverConfig(modelConfig, options);
+    debugLog(`solverConfig set to ${modelConfig}`);
   }
 
   setMeshConfig(meshConfig) {
@@ -97,7 +91,7 @@ export class FEAScriptModel {
     }
     /**
      * For consistency across both linear and nonlinear formulations,
-     * we always refer to the assembled right-hand side vector as 
+     * we always refer to the assembled right-hand side vector as
      * `residualVector` and the assembled system matrix as `jacobianMatrix`.
      *
      * In linear problems `jacobianMatrix` is equivalent to the
@@ -131,7 +125,7 @@ export class FEAScriptModel {
         const frontalResult = runFrontalSolver(
           assembleHeatConductionFront,
           meshData,
-          this.boundaryConditions
+          this.boundaryConditions,
         );
         solutionVector = frontalResult.solutionVector;
       } else {
@@ -184,14 +178,14 @@ export class FEAScriptModel {
       // Check if using frontal solver
       if (this.solverMethod === "frontal") {
         errorLog(
-          "Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'."
+          "Frontal solver is not yet supported for generalFormPDEScript. Please use 'lusolve' or 'jacobi'.",
         );
       } else {
         // Use regular linear solver methods
         ({ jacobianMatrix, residualVector } = assembleGeneralFormPDEMat(
           meshData,
           this.boundaryConditions,
-          this.coefficientFunctions
+          this.coefficientFunctions,
         ));
 
         const linearSystemResult = solveLinearSystem(this.solverMethod, jacobianMatrix, residualVector, {
@@ -264,7 +258,7 @@ export class FEAScriptModel {
             computeEngine,
             maxIterations: options.maxIterations ?? this.maxIterations,
             tolerance: options.tolerance ?? this.tolerance,
-          }
+          },
         );
         solutionVector = x;
       } else {
diff --git a/src/index.js b/src/index.js
index e576722..e24cd88 100644
--- a/src/index.js
+++ b/src/index.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -10,6 +10,15 @@
 export { FEAScriptModel } from "./FEAScript.js";
 export { importGmshQuadTri } from "./readers/gmshReaderScript.js"; //TODO rename importGmshQuadTri to importGmsh
 export { logSystem } from "./utilities/loggingScript.js";
-export { plotSolution, plotInterpolatedSolution } from "./visualization/plotSolutionScript.js";
+export { plotSolution, plotInterpolatedSolution } from "./visualization/plotlyPlotScript.js";
+export {
+  plotSolutionVtk,
+  plotInterpolatedSolutionVtk,
+  createColorScale,
+  createContourLineOptions,
+  transformSolverOutputToVtkData,
+  transformSolverOutputToVTP,
+  transformSolverOutputToMLBuffers,
+} from "./visualization/vtkPlotScript.js";
 export { FEAScriptWorker } from "./workers/workerScript.js";
-export const printVersion = "0.2.0";
\ No newline at end of file
+export const printVersion = "0.3.0 (RC)";
diff --git a/src/mesh/basisFunctionsScript.js b/src/mesh/basisFunctionsScript.js
index 5eea19e..807d48c 100644
--- a/src/mesh/basisFunctionsScript.js
+++ b/src/mesh/basisFunctionsScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/mesh/meshGenerationScript.js b/src/mesh/meshGenerationScript.js
index 37856fb..f2ab299 100644
--- a/src/mesh/meshGenerationScript.js
+++ b/src/mesh/meshGenerationScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -76,7 +76,7 @@ export class Mesh {
 
       debugLog(
         "Initial parsed mesh nodal numbering from Gmsh format: " +
-          JSON.stringify(this.parsedMesh.nodalNumbering)
+          JSON.stringify(this.parsedMesh.nodalNumbering),
       );
 
       // Check if it has quadElements or triangleElements structure from gmshReader
@@ -130,7 +130,7 @@ export class Mesh {
 
       debugLog(
         "Nodal numbering after mapping from Gmsh to FEAScript format: " +
-          JSON.stringify(this.parsedMesh.nodalNumbering)
+          JSON.stringify(this.parsedMesh.nodalNumbering),
       );
 
       // Process boundary elements if they exist and if physical property mapping exists
@@ -177,7 +177,7 @@ export class Mesh {
                   debugLog(
                     `Processing boundary node pair: [${node1}, ${node2}] for boundary ${prop.tag} (${
                       prop.name || "unnamed"
-                    })`
+                    })`,
                   );
 
                   // Search through all elements to find which one contains both nodes
@@ -203,11 +203,11 @@ export class Mesh {
 
                         debugLog(
                           `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(
-                            ", "
-                          )}]`
+                            ", ",
+                          )}]`,
                         );
                         debugLog(
-                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`
+                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,
                         );
 
                         // Based on FEAScript linear quadrilateral numbering:
@@ -244,7 +244,7 @@ export class Mesh {
                         // Add the element and side to the boundary elements array
                         this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);
                         debugLog(
-                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`
+                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,
                         );
                         foundElement = true;
                         break;
@@ -261,11 +261,11 @@ export class Mesh {
 
                         debugLog(
                           `  Found element ${elementIndex} containing boundary nodes. Element nodes: [${elementConnectivity.join(
-                            ", "
-                          )}]`
+                            ", ",
+                          )}]`,
                         );
                         debugLog(
-                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`
+                          `  Node ${node1} is at index ${node1Index}, Node ${node2} is at index ${node2Index} in the element`,
                         );
 
                         // Based on FEAScript quadratic quadrilateral numbering:
@@ -321,7 +321,7 @@ export class Mesh {
                         // Add the element and side to the boundary elements array
                         this.parsedMesh.boundaryElements[prop.tag].push([elementIndex, side]);
                         debugLog(
-                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`
+                          `  Added element-side pair [${elementIndex}, ${side}] to boundary tag ${prop.tag}`,
                         );
                         foundElement = true;
                         break;
@@ -331,7 +331,7 @@ export class Mesh {
 
                   if (!foundElement) {
                     errorLog(
-                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`
+                      `Could not find element containing boundary nodes ${node1} and ${node2}. Boundary may be incomplete.`,
                     );
                   }
                 });
@@ -543,7 +543,7 @@ export class Mesh2D extends Mesh {
       (this.numElementsX === null || this.maxX === null || this.numElementsY === null || this.maxY === null)
     ) {
       errorLog(
-        "numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry"
+        "numElementsX, maxX, numElementsY, and maxY are required parameters when generating a 2D mesh from geometry",
       );
     }
   }
@@ -630,7 +630,7 @@ export class Mesh2D extends Mesh {
       this.numElementsX,
       this.numElementsY,
       totalNodesY,
-      this.elementOrder
+      this.elementOrder,
     );
 
     // Find boundary elements
diff --git a/src/mesh/meshUtilsScript.js b/src/mesh/meshUtilsScript.js
index ba1c9ec..22f3e42 100644
--- a/src/mesh/meshUtilsScript.js
+++ b/src/mesh/meshUtilsScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/methods/euclideanNormScript.js b/src/methods/euclideanNormScript.js
index 5bd0d9e..6077fda 100644
--- a/src/methods/euclideanNormScript.js
+++ b/src/methods/euclideanNormScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/methods/frontalSolverScript.js b/src/methods/frontalSolverScript.js
index ab761d7..68952d0 100644
--- a/src/methods/frontalSolverScript.js
+++ b/src/methods/frontalSolverScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -74,12 +74,12 @@ export function runFrontalSolver(assembleFront, meshData, boundaryConditions, op
       meshData.boundaryElements,
       meshData.nop,
       meshData.meshDimension,
-      meshData.elementOrder
+      meshData.elementOrder,
     );
 
     dirichletBoundaryConditionsHandler.imposeConstantTempBoundaryConditionsFront(
       frontalData.nodeConstraintCode,
-      frontalData.boundaryValues
+      frontalData.boundaryValues,
     );
     // Front propagation model (frontPropagationScript solver)
   } else if (assembleFront === assembleFrontPropagationFront) {
@@ -88,12 +88,12 @@ export function runFrontalSolver(assembleFront, meshData, boundaryConditions, op
       meshData.boundaryElements,
       meshData.nop,
       meshData.meshDimension,
-      meshData.elementOrder
+      meshData.elementOrder,
     );
 
     dirichletBoundaryConditionsHandler.imposeConstantValueBoundaryConditionsFront(
       frontalData.nodeConstraintCode,
-      frontalData.boundaryValues
+      frontalData.boundaryValues,
     );
   }
   // Initialize global residual vector
@@ -130,14 +130,14 @@ export function runFrontalSolver(assembleFront, meshData, boundaryConditions, op
       debugLog(
         `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${frontalData.solutionVector[
           nodeIndex
-        ].toExponential(5)}`
+        ].toExponential(5)}`,
       );
     } else {
       // 2D case - output X, Y coordinates and temperature
       debugLog(
         `${nodesXCoordinates[nodeIndex].toExponential(5)}  ${nodesYCoordinates[nodeIndex].toExponential(
-          5
-        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`
+          5,
+        )}  ${frontalData.solutionVector[nodeIndex].toExponential(5)}`,
       );
     }
   }
@@ -205,7 +205,10 @@ function initializeFrontalArrays(nodesPerElement, numElements) {
  * @returns {number} Estimated front size
  */
 function estimateFrontSize(nodesPerElement, numElements) {
-  const frontWidthEstimate = Math.max(Math.ceil(Math.sqrt(numElements)) * nodesPerElement, nodesPerElement * 2);
+  const frontWidthEstimate = Math.max(
+    Math.ceil(Math.sqrt(numElements)) * nodesPerElement,
+    nodesPerElement * 2,
+  );
   return frontWidthEstimate * numElements;
 }
 // Old function to estimate the required front size
@@ -256,7 +259,9 @@ function assembleElementContribution(meshData, FEAData, thermalBoundaryCondition
     for (const boundaryKey in meshData.boundaryElements) {
       if (
         thermalBoundaryConditions.boundaryConditions[boundaryKey]?.[0] === "convection" &&
-        meshData.boundaryElements[boundaryKey].some(([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex)
+        meshData.boundaryElements[boundaryKey].some(
+          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,
+        )
       ) {
         isOnRobinTypeBoundary = true;
         break;
@@ -272,7 +277,7 @@ function assembleElementContribution(meshData, FEAData, thermalBoundaryCondition
         meshData.nodesYCoordinates,
         gaussPoints,
         gaussWeights,
-        basisFunctions
+        basisFunctions,
       );
       boundaryLocalJacobianMatrix = result.localJacobianMatrix;
       boundaryResidualVector = result.localResidualVector;
@@ -527,7 +532,7 @@ function runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assem
 
       if (Math.abs(pivotValue) < 1e-10) {
         errorLog(
-          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`
+          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,
         );
       }
 
@@ -651,7 +656,7 @@ function runFrontalAlgorithm(meshData, FEAData, thermalBoundaryConditions, assem
       frontStorage.pivotRow[0] = 1;
       if (Math.abs(pivotValue) < 1e-10) {
         errorLog(
-          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`
+          `Matrix singular or ill-conditioned, currentElementIndex=${elementData.currentElementIndex}, pivotGlobalRowIndex=${pivotGlobalRowIndex}, pivotColumnGlobalIndex=${pivotColumnGlobalIndex}, pivotValue=${pivotValue}`,
         );
       }
 
diff --git a/src/methods/jacobiSolverScript.js b/src/methods/jacobiSolverScript.js
index 8cbebe5..bcef447 100644
--- a/src/methods/jacobiSolverScript.js
+++ b/src/methods/jacobiSolverScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/methods/linearSystemSolverScript.js b/src/methods/linearSystemSolverScript.js
index 486b6a8..7226a46 100644
--- a/src/methods/linearSystemSolverScript.js
+++ b/src/methods/linearSystemSolverScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -24,7 +24,6 @@ import * as Comlink from "../vendor/comlink.mjs";
  *  - iterations: Number of iterations performed (for iterative methods)
  */
 export function solveLinearSystem(solverMethod, jacobianMatrix, residualVector, options = {}) {
-
   // Extract options
   const { maxIterations = 10000, tolerance = 1e-4 } = options;
 
@@ -93,7 +92,6 @@ async function createDefaultComputeEngine() {
  *  - iterations: Number of iterations performed (for iterative methods)
  */
 export async function solveLinearSystemAsync(solverMethod, jacobianMatrix, residualVector, options = {}) {
-  
   // Extract options
   const { maxIterations = 10000, tolerance = 1e-4 } = options;
 
@@ -101,8 +99,8 @@ export async function solveLinearSystemAsync(solverMethod, jacobianMatrix, resid
   console.time("systemSolving");
 
   // Normalize inputs
-  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : jacobianMatrix?.toArray?.() ?? jacobianMatrix;
-  const b = Array.isArray(residualVector) ? residualVector : residualVector?.toArray?.() ?? residualVector;
+  const A = Array.isArray(jacobianMatrix) ? jacobianMatrix : (jacobianMatrix?.toArray?.() ?? jacobianMatrix);
+  const b = Array.isArray(residualVector) ? residualVector : (residualVector?.toArray?.() ?? residualVector);
 
   let created = null;
   let computeEngine = null;
@@ -138,7 +136,7 @@ export async function solveLinearSystemAsync(solverMethod, jacobianMatrix, resid
   basicLog(`System solved successfully (${solverMethod})`);
 
   if (created) {
-    await computeEngine?.destroy?.().catch(() => { });
+    await computeEngine?.destroy?.().catch(() => {});
     created.worker.terminate();
   }
 
diff --git a/src/methods/newtonRaphsonScript.js b/src/methods/newtonRaphsonScript.js
index eaa2803..eb60ccd 100644
--- a/src/methods/newtonRaphsonScript.js
+++ b/src/methods/newtonRaphsonScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -62,7 +62,7 @@ export function newtonRaphson(assembleMat, context = {}) {
         assembleFrontPropagationFront,
         context.meshData,
         context.boundaryConditions,
-        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag }
+        { solutionVector, eikonalActivationFlag: context.eikonalActivationFlag },
       );
       deltaX = frontalResult.solutionVector;
     } else {
@@ -71,7 +71,7 @@ export function newtonRaphson(assembleMat, context = {}) {
         context.meshData,
         context.boundaryConditions,
         solutionVector, // The solution vector is required in the case of a non-linear equation
-        context.eikonalActivationFlag // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)
+        context.eikonalActivationFlag, // Currently used only in the front propagation solver (TODO refactor in case of a solver not needing it)
       ));
 
       // Solve the linear system based on the specified solver method
diff --git a/src/methods/numericalIntegrationScript.js b/src/methods/numericalIntegrationScript.js
index 54d6459..3f05c0a 100644
--- a/src/methods/numericalIntegrationScript.js
+++ b/src/methods/numericalIntegrationScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/methods/webgpuJacobiSolverScript.js b/src/methods/webgpuJacobiSolverScript.js
index 39e3ca4..86777f0 100644
--- a/src/methods/webgpuJacobiSolverScript.js
+++ b/src/methods/webgpuJacobiSolverScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/models/creepingFlowScript.js b/src/models/creepingFlowScript.js
index c82eae3..e6538f0 100644
--- a/src/models/creepingFlowScript.js
+++ b/src/models/creepingFlowScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -11,7 +11,7 @@
 import { performIsoparametricMapping2D } from "../mesh/meshUtilsScript.js";
 import { BasisFunctions } from "../mesh/basisFunctionsScript.js";
 import { NumericalIntegration } from "../methods/numericalIntegrationScript.js";
-import { FlowBoundaryConditions } from "./flowBoundaryConditions.js";
+import { FlowBoundaryConditions } from "./flowBoundaryConditionsScript.js";
 import { basicLog, debugLog, errorLog } from "../utilities/loggingScript.js";
 
 /**
diff --git a/src/models/flowBoundaryConditions.js b/src/models/flowBoundaryConditionsScript.js
similarity index 99%
rename from src/models/flowBoundaryConditions.js
rename to src/models/flowBoundaryConditionsScript.js
index 12b224e..bd99084 100644
--- a/src/models/flowBoundaryConditions.js
+++ b/src/models/flowBoundaryConditionsScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/models/frontPropagationScript.js b/src/models/frontPropagationScript.js
index bdcf59c..71c97e8 100644
--- a/src/models/frontPropagationScript.js
+++ b/src/models/frontPropagationScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -33,7 +33,7 @@ export function assembleFrontPropagationMat(
   meshData,
   boundaryConditions,
   solutionVector,
-  eikonalActivationFlag
+  eikonalActivationFlag,
 ) {
   basicLog("Starting front propagation matrix assembly...");
 
@@ -122,7 +122,7 @@ export function assembleFrontPropagationMat(
           // Get basis functions for the current Gauss point
           let basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(
             gaussPoints[gaussPointIndex1],
-            gaussPoints[gaussPointIndex2]
+            gaussPoints[gaussPointIndex2],
           );
 
           // Perform isoparametric mapping
@@ -231,7 +231,7 @@ export function assembleFrontPropagationMat(
     boundaryElements,
     nop,
     meshDimension,
-    elementOrder
+    elementOrder,
   );
 
   // Impose Dirichlet boundary conditions
diff --git a/src/models/generalFormPDEScript.js b/src/models/generalFormPDEScript.js
index d30f983..d47d365 100644
--- a/src/models/generalFormPDEScript.js
+++ b/src/models/generalFormPDEScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -65,7 +65,7 @@ export function assembleGeneralFormPDEMat(meshData, boundaryConditions, coeffici
       for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {
         // Get basis functions for the current Gauss point
         const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(
-          gaussPoints[gaussPointIndex]
+          gaussPoints[gaussPointIndex],
         );
 
         // Perform isoparametric mapping
@@ -138,7 +138,7 @@ export function assembleGeneralFormPDEMat(meshData, boundaryConditions, coeffici
     boundaryElements,
     nop,
     meshDimension,
-    elementOrder
+    elementOrder,
   );
 
   // Apply Dirichlet boundary conditions only
@@ -191,7 +191,7 @@ export function assembleGeneralFormPDEFront({
     for (let gaussPointIndex = 0; gaussPointIndex < gaussPoints.length; gaussPointIndex++) {
       // Get basis functions for the current Gauss point
       const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(
-        gaussPoints[gaussPointIndex]
+        gaussPoints[gaussPointIndex],
       );
 
       // Perform isoparametric mapping
diff --git a/src/models/genericBoundaryConditionsScript.js b/src/models/genericBoundaryConditionsScript.js
index 17ab69d..8eb1a87 100644
--- a/src/models/genericBoundaryConditionsScript.js
+++ b/src/models/genericBoundaryConditionsScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -60,7 +60,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the value
                 residualVector[globalNodeIndex] = value;
@@ -81,7 +81,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the value
                 residualVector[globalNodeIndex] = value;
@@ -114,7 +114,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the value
                 residualVector[globalNodeIndex] = value;
@@ -137,7 +137,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the value
                 residualVector[globalNodeIndex] = value;
@@ -177,7 +177,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 nodeConstraintCode[globalNodeIndex] = 1;
                 boundaryValues[globalNodeIndex] = value;
@@ -192,7 +192,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 nodeConstraintCode[globalNodeIndex] = 1;
                 boundaryValues[globalNodeIndex] = value;
@@ -219,7 +219,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 nodeConstraintCode[globalNodeIndex] = 1;
                 boundaryValues[globalNodeIndex] = value;
@@ -236,7 +236,7 @@ export class GenericBoundaryConditions {
                 debugLog(
                   `  - Applied constant value to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 nodeConstraintCode[globalNodeIndex] = 1;
                 boundaryValues[globalNodeIndex] = value;
diff --git a/src/models/heatConductionScript.js b/src/models/heatConductionScript.js
index 4013b14..430426f 100644
--- a/src/models/heatConductionScript.js
+++ b/src/models/heatConductionScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -105,7 +105,7 @@ export function assembleHeatConductionMat(meshData, boundaryConditions) {
           // Get basis functions for the current Gauss point
           const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(
             gaussPoints[gaussPointIndex1],
-            gaussPoints[gaussPointIndex2]
+            gaussPoints[gaussPointIndex2],
           );
 
           // Perform isoparametric mapping
@@ -148,7 +148,7 @@ export function assembleHeatConductionMat(meshData, boundaryConditions) {
     boundaryElements,
     nop,
     meshDimension,
-    elementOrder
+    elementOrder,
   );
 
   // Impose Convection boundary conditions
@@ -159,7 +159,7 @@ export function assembleHeatConductionMat(meshData, boundaryConditions) {
     gaussWeights,
     nodesXCoordinates,
     nodesYCoordinates,
-    basisFunctions
+    basisFunctions,
   );
 
   // Impose ConstantTemp boundary conditions
@@ -209,7 +209,7 @@ export function assembleHeatConductionFront({ elementIndex, nop, meshData, basis
     for (let gaussPointIndex1 = 0; gaussPointIndex1 < gaussPoints.length; gaussPointIndex1++) {
       // Get basis functions for the current Gauss point
       const { basisFunction, basisFunctionDerivKsi } = basisFunctions.getBasisFunctions(
-        gaussPoints[gaussPointIndex1]
+        gaussPoints[gaussPointIndex1],
       );
 
       // Perform isoparametric mapping
diff --git a/src/models/thermalBoundaryConditionsScript.js b/src/models/thermalBoundaryConditionsScript.js
index df8a08a..4bb8d5f 100644
--- a/src/models/thermalBoundaryConditionsScript.js
+++ b/src/models/thermalBoundaryConditionsScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -49,7 +49,7 @@ export class ThermalBoundaryConditions {
         if (this.boundaryConditions[boundaryKey][0] === "constantTemp") {
           const tempValue = this.boundaryConditions[boundaryKey][1];
           debugLog(
-            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`
+            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,
           );
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
             if (this.elementOrder === "linear") {
@@ -62,7 +62,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the ConstantTemp value
                 residualVector[globalNodeIndex] = tempValue;
@@ -83,7 +83,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the ConstantTemp value
                 residualVector[globalNodeIndex] = tempValue;
@@ -103,7 +103,7 @@ export class ThermalBoundaryConditions {
         if (this.boundaryConditions[boundaryKey][0] === "constantTemp") {
           const tempValue = this.boundaryConditions[boundaryKey][1];
           debugLog(
-            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`
+            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,
           );
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
             if (this.elementOrder === "linear") {
@@ -118,7 +118,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the ConstantTemp value
                 residualVector[globalNodeIndex] = tempValue;
@@ -141,7 +141,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
                 // Set the residual vector to the ConstantTemp value
                 residualVector[globalNodeIndex] = tempValue;
@@ -170,7 +170,7 @@ export class ThermalBoundaryConditions {
         if (this.boundaryConditions[boundaryKey][0] === "constantTemp") {
           const tempValue = this.boundaryConditions[boundaryKey][1];
           debugLog(
-            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`
+            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,
           );
 
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
@@ -185,7 +185,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
 
                 // Set boundary condition code and value
@@ -203,7 +203,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
 
                 // Set boundary condition code and value
@@ -219,7 +219,7 @@ export class ThermalBoundaryConditions {
         if (this.boundaryConditions[boundaryKey][0] === "constantTemp") {
           const tempValue = this.boundaryConditions[boundaryKey][1];
           debugLog(
-            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`
+            `Boundary ${boundaryKey}: Applying constant temperature of ${tempValue} K (Dirichlet condition)`,
           );
 
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
@@ -236,7 +236,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
 
                 // Set boundary condition code and value
@@ -256,7 +256,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied constant temperature to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${nodeIndex + 1})`
+                  }, local node ${nodeIndex + 1})`,
                 );
 
                 // Set boundary condition code and value
@@ -287,7 +287,7 @@ export class ThermalBoundaryConditions {
     gaussWeights,
     nodesXCoordinates,
     nodesYCoordinates,
-    basisFunctions
+    basisFunctions,
   ) {
     // Extract convection parameters from boundary conditions
     let convectionHeatTranfCoeff = [];
@@ -306,7 +306,7 @@ export class ThermalBoundaryConditions {
           const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];
           const extTemp = convectionExtTemp[boundaryKey];
           debugLog(
-            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`
+            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,
           );
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
             let nodeIndex;
@@ -332,7 +332,7 @@ export class ThermalBoundaryConditions {
             debugLog(
               `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${
                 elementIndex + 1
-              }, local node ${nodeIndex + 1})`
+              }, local node ${nodeIndex + 1})`,
             );
             residualVector[globalNodeIndex] += -convectionCoeff * extTemp;
             jacobianMatrix[globalNodeIndex][globalNodeIndex] += convectionCoeff;
@@ -345,7 +345,7 @@ export class ThermalBoundaryConditions {
           const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];
           const extTemp = convectionExtTemp[boundaryKey];
           debugLog(
-            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`
+            `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,
           );
           this.boundaryElements[boundaryKey].forEach(([elementIndex, side]) => {
             if (this.elementOrder === "linear") {
@@ -422,7 +422,7 @@ export class ThermalBoundaryConditions {
                 debugLog(
                   `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${
                     elementIndex + 1
-                  }, local node ${localNodeIndex + 1})`
+                  }, local node ${localNodeIndex + 1})`,
                 );
 
                 // Apply boundary condition with proper Jacobian for all sides
@@ -521,7 +521,7 @@ export class ThermalBoundaryConditions {
                   debugLog(
                     `  - Applied convection boundary condition to node ${globalNodeIndex + 1} (element ${
                       elementIndex + 1
-                    }, local node ${localNodeIndex + 1})`
+                    }, local node ${localNodeIndex + 1})`,
                   );
 
                   // Apply boundary condition with proper Jacobian for all sides
@@ -572,7 +572,7 @@ export class ThermalBoundaryConditions {
     nodesYCoordinates,
     gaussPoints,
     gaussWeights,
-    basisFunctions
+    basisFunctions,
   ) {
     // Extract convection parameters from boundary conditions
     let convectionHeatTranfCoeff = [];
@@ -598,12 +598,12 @@ export class ThermalBoundaryConditions {
         const convectionCoeff = convectionHeatTranfCoeff[boundaryKey];
         const extTemp = convectionExtTemp[boundaryKey];
         debugLog(
-          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`
+          `Boundary ${boundaryKey}: Applying convection with heat transfer coefficient h=${convectionCoeff} W/(m²·K) and external temperature T∞=${extTemp} K`,
         );
 
         // Find if this element is on this boundary and which side
         const boundaryElement = this.boundaryElements[boundaryKey].find(
-          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex
+          ([boundaryElementIndex, _]) => boundaryElementIndex === elementIndex,
         );
 
         if (boundaryElement) {
@@ -622,7 +622,7 @@ export class ThermalBoundaryConditions {
             debugLog(
               `  - Applied convection boundary condition to node ${nodeIndex + 1} (element ${
                 elementIndex + 1
-              }, local node ${nodeIndex + 1})`
+              }, local node ${nodeIndex + 1})`,
             );
             localResidualVector[nodeIndex] += -convectionCoeff * extTemp;
             localJacobianMatrix[nodeIndex][nodeIndex] += convectionCoeff;
diff --git a/src/readers/gmshReaderScript.js b/src/readers/gmshReaderScript.js
index c81455c..91f0f3a 100644
--- a/src/readers/gmshReaderScript.js
+++ b/src/readers/gmshReaderScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/utilities/loggingScript.js b/src/utilities/loggingScript.js
index 93dd977..b413e7e 100644
--- a/src/utilities/loggingScript.js
+++ b/src/utilities/loggingScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -18,7 +18,7 @@ export function logSystem(level) {
   if (level !== "basic" && level !== "debug") {
     console.log(
       "%c[WARN] Invalid log level: " + level + ". Using basic instead.",
-      "color: #FFC107; font-weight: bold;"
+      "color: #FFC107; font-weight: bold;",
     ); // Yellow for warnings
     currentLogLevel = "basic";
   } else {
diff --git a/src/visualization/plotSolutionScript.js b/src/visualization/plotSolutionScript.js
index 8bd7d86..6dabdd2 100644
--- a/src/visualization/plotSolutionScript.js
+++ b/src/visualization/plotSolutionScript.js
@@ -2,459 +2,24 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
 
-// Internal imports
-import {
-  prepareMesh,
-  pointInsideTriangle,
-  pointInsideQuadrilateral,
-  computeNodeNeighbors,
-  getBoundarySegments,
-} from "../mesh/meshUtilsScript.js";
-import { BasisFunctions } from "../mesh/basisFunctionsScript.js";
-import { initializeFEA } from "../mesh/meshUtilsScript.js";
-import { basicLog, debugLog, errorLog } from "../utilities/loggingScript.js";
-
-/**
- * Function to create plots of the solution vector
- * @param {object} result - Object containing solution vector and mesh information
- * @param {object} model - Object containing model properties
- * @param {string} plotType - The type of plot
- * @param {string} plotDivId - The id of the div where the plot will be rendered
- */
-export function plotSolution(model, result, plotType, plotDivId) {
-  console.time("plottingTime");
-  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
-  const solutionVector = result.solutionVector;
-  const solverConfig = model.solverConfig;
-  const meshDimension = model.meshConfig.meshDimension;
-  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)
-
-  if (meshDimension === "1D" && plotType === "line") {
-    // Check if solutionVector is a nested array
-    let yData;
-    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {
-      yData = solutionVector.map((arr) => arr[0]);
-    } else {
-      yData = solutionVector;
-    }
-    let xData = Array.from(nodesXCoordinates);
-
-    let lineData = {
-      x: nodesXCoordinates,
-      y: yData,
-      mode: "lines",
-      type: "scatter",
-      line: { color: "rgb(219, 64, 82)", width: 2 },
-      name: "Solution",
-    };
-
-    let maxWindowWidth = Math.min(window.innerWidth, 700);
-    let plotWidth = Math.min(maxWindowWidth, 600);
-    let plotHeight = 300;
-
-    let layout = {
-      title: `line plot - ${solverConfig}`,
-      width: plotWidth,
-      height: plotHeight,
-      xaxis: { title: "x" },
-      yaxis: { title: "Solution" },
-      margin: { l: 50, r: 50, t: 50, b: 50 },
-    };
-
-    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });
-    console.timeEnd("plottingTime");
-  } else if (meshDimension === "2D" && plotType === "contour") {
-    // Check if solutionVector is a nested array
-    let zData;
-    if (Array.isArray(solutionVector[0])) {
-      zData = solutionVector.map((val) => val[0]);
-    } else {
-      zData = solutionVector;
-    }
-
-    // Plot sizing parameters
-    let maxWindowWidth = Math.min(window.innerWidth, 700);
-    let minX = Math.min(...nodesXCoordinates);
-    let maxX = Math.max(...nodesXCoordinates);
-    let minY = Math.min(...nodesYCoordinates);
-    let maxY = Math.max(...nodesYCoordinates);
-    let lengthX = maxX - minX;
-    let lengthY = maxY - minY;
-    let aspectRatio = lengthY / lengthX;
-    let plotWidth = Math.min(maxWindowWidth, 600);
-    let plotHeight = plotWidth * aspectRatio;
-
-    // Layout properties
-    let layout = {
-      title: `${plotType} plot - ${solverConfig}`,
-      width: plotWidth,
-      height: plotHeight,
-      xaxis: { title: "x" },
-      yaxis: {
-        title: "y",
-        scaleanchor: "x",
-        scaleratio: 1,
-      },
-      margin: { l: 50, r: 50, t: 50, b: 50 },
-      hovermode: "closest",
-    };
-
-    // Create the plot
-    let contourData = {
-      x: nodesXCoordinates,
-      y: nodesYCoordinates,
-      z: zData,
-      type: "contour",
-      line: {
-        smoothing: 0.85,
-      },
-      contours: {
-        coloring: "heatmap",
-        showlabels: false,
-      },
-      //colorscale: 'Viridis',
-      colorbar: {
-        title: "Solution",
-      },
-      name: "Solution Field",
-    };
-
-    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });
-    console.timeEnd("plottingTime");
-  }
-}
-
 /**
- * Function to generate a dense visualization grid and interpolate the FEM solution on it
- * @param {object} result - Object containing solution vector and mesh information
- * @param {object} model - Object containing model properties
- * @param {string} plotType - The type of plot
- * @param {string} plotDivId - The id of the div where the plot will be rendered
+ * Plotly-based plotting functions are provided by plotlyPlotScript.js
+ * VTK.js-based plotting and data transformation functions are provided by vtkPlotScript.js
  */
-export function plotInterpolatedSolution(model, result, plotType, plotDivId) {
-  console.time("plottingTime");
-  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block
-  const meshDimension = model.meshConfig.meshDimension;
-  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details
-
-  // Initialize BasisFunctions once here to avoid creating it inside the loop
-  const basisFunctions = new BasisFunctions({
-    meshDimension: model.meshConfig.meshDimension,
-    elementOrder: model.meshConfig.elementOrder,
-  });
-
-  if (meshDimension === "1D" && plotType === "line") {
-    // 1D plot region
-  } else if (meshDimension === "2D" && plotType === "contour") {
-    const visNodeXCoordinates = [];
-    const visNodeYCoordinates = [];
-    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);
-    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);
-    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid
-    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid
-    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid
-    const deltavisX = lengthX / (visNodesX - 1);
-    const deltavisY = lengthY / (visNodesY - 1);
-    let visSolution = [];
-
-    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);
-    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);
-
-    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {
-      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];
-      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;
-    }
-
-    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {
-      const nnode = visNodeIndexX * visNodesY;
-      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;
-      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];
-
-      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {
-        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];
-        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;
-      }
-    }
-
-    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };
-
-    // Initialize visSolution with null for all visualization nodes
-    visSolution = new Array(visNodesX * visNodesY).fill(null);
-
-    // Get boundary segments for ray casting
-    const boundarySegments = getBoundarySegments(meshData);
 
-    // Perform adjacency-based search to find which element contains a given point (quick search)
-    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);
-    let lastParentElement = 0;
-    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {
-      // Ray casting check
-      if (
-        !pointInsidePolygon(
-          visNodeXCoordinates[visNodeIndex],
-          visNodeYCoordinates[visNodeIndex],
-          boundarySegments
-        )
-      ) {
-        continue;
-      }
-      let found = false;
-      for (
-        let localNodeIndex = 0;
-        localNodeIndex < meshData.nop[lastParentElement].length;
-        localNodeIndex++
-      ) {
-        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;
-        for (
-          let neighborElementsIndex = 0;
-          neighborElementsIndex < neighborCount[globalNodeIndex];
-          neighborElementsIndex++
-        ) {
-          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];
-          const searchResult = pointSearch(
-            model,
-            meshData,
-            result,
-            currentElement,
-            visNodeXCoordinates[visNodeIndex],
-            visNodeYCoordinates[visNodeIndex],
-            basisFunctions
-          );
-
-          if (searchResult.inside) {
-            lastParentElement = currentElement;
-            visSolution[visNodeIndex] = searchResult.value;
-            found = true;
-            break;
-          }
-        }
-        if (found) break;
-      }
-
-      // Scan all elements to find which element contains a given point (slow search)
-      if (!found) {
-        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {
-          const searchResult = pointSearch(
-            model,
-            meshData,
-            result,
-            currentElement,
-            visNodeXCoordinates[visNodeIndex],
-            visNodeYCoordinates[visNodeIndex],
-            basisFunctions
-          );
-
-          if (searchResult.inside) {
-            lastParentElement = currentElement;
-            visSolution[visNodeIndex] = searchResult.value;
-            found = true;
-            break;
-          }
-        }
-      }
-    }
-
-    // Plot sizing parameters
-    let maxWindowWidth = Math.min(window.innerWidth, 700);
-    let aspectRatio = lengthY / lengthX;
-    let plotWidth = Math.min(maxWindowWidth, 600);
-    let plotHeight = plotWidth * aspectRatio;
-
-    // Layout properties
-    let layout = {
-      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,
-      width: plotWidth,
-      height: plotHeight,
-      xaxis: { title: "x" },
-      yaxis: {
-        title: "y",
-        scaleanchor: "x",
-        scaleratio: 1,
-      },
-      margin: { l: 50, r: 50, t: 50, b: 50 },
-      hovermode: "closest",
-    };
-
-    // Create the plot
-    let contourData = {
-      x: visNodeXCoordinates,
-      y: visNodeYCoordinates,
-      z: visSolution,
-      type: "contour",
-      connectgaps: false,
-      hoverongaps: false,
-      line: {
-        smoothing: 0.85,
-      },
-      contours: {
-        coloring: "heatmap",
-        showlabels: false,
-      },
-      //colorscale: 'Viridis',
-      colorbar: {
-        title: "Solution",
-      },
-      name: "Interpolated Solution Field",
-    };
-
-    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });
-    console.timeEnd("plottingTime");
-  }
-}
-
-/**
- * Function to search if a point is inside an element and interpolate the solution
- * @param {object} model - Object containing model properties
- * @param {object} meshData - Object containing mesh data
- * @param {object} result - Object containing solution vector and mesh information
- * @param {number} currentElement - Index of the element to check
- * @param {number} visNodeXCoordinate - X-coordinate of the point
- * @param {number} visNodeYCoordinate - Y-coordinate of the point
- * @param {object} basisFunctions - Instance of BasisFunctions class
- * @returns {object} Object containing inside boolean and interpolated value
- */
-function pointSearch(
-  model,
-  meshData,
-  result,
-  currentElement,
-  visNodeXCoordinate,
-  visNodeYCoordinate,
-  basisFunctions
-) {
-  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
-  const nodesPerElement = meshData.nop[currentElement].length;
-
-  if (nodesPerElement === 4) {
-    // Linear quadrilateral element
-    let vertices = [
-      [
-        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][1] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][1] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][3] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][3] - 1],
-      ],
-    ];
-    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
-    if (pointCheck.inside) {
-      return {
-        inside: true,
-        value: solutionInterpolation(
-          model,
-          meshData,
-          result,
-          currentElement,
-          pointCheck.ksi,
-          pointCheck.eta,
-          basisFunctions
-        ),
-      };
-    }
-  } else if (nodesPerElement === 9) {
-    // Quadratic quadrilateral element
-    let vertices = [
-      [
-        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][6] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][6] - 1],
-      ],
-      [
-        nodesXCoordinates[meshData.nop[currentElement][8] - 1],
-        nodesYCoordinates[meshData.nop[currentElement][8] - 1],
-      ],
-    ];
-    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
-    if (pointCheck.inside) {
-      return {
-        inside: true,
-        value: solutionInterpolation(
-          model,
-          meshData,
-          result,
-          currentElement,
-          pointCheck.ksi,
-          pointCheck.eta,
-          basisFunctions
-        ),
-      };
-    }
-  } // TODO: Add also triangular element cases
-  return { inside: false, value: null };
-}
-
-/**
- * Function to interpolate the solution at a specific point (ksi, eta) within an element
- * @param {object} model - Object containing model properties
- * @param {object} meshData - Object containing mesh data
- * @param {object} result - Object containing solution vector and mesh information
- * @param {number} elementIndex - Index of the element containing the point
- * @param {number} ksi - First natural coordinate (ksi)
- * @param {number} eta - Second natural coordinate (eta)
- * @param {object} basisFunctions - Instance of BasisFunctions class
- * @returns {number} Interpolated solution value
- */
-function solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {
-  // Initialize FEA components
-  const solutionVector = result.solutionVector;
-  const nodesPerElement = meshData.nop[elementIndex].length;
-
-  // Get basis functions for the current point
-  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);
-  let basisFunction = basisFunctionsAndDerivatives.basisFunction;
-
-  // Check if solutionVector is a nested array
-  let zData;
-  if (Array.isArray(solutionVector[0])) {
-    zData = solutionVector.map((val) => val[0]);
-  } else {
-    zData = solutionVector;
-  }
-
-  // Interpolate solution
-  let solutionInterpolationValue = 0;
-  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {
-    solutionInterpolationValue +=
-      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];
-  }
-
-  return solutionInterpolationValue;
-}
-
-/**
- * Function to check if a point is inside a polygon using ray casting algorithm
- * @param {number} x - X-coordinate of the point
- * @param {number} y - Y-coordinate of the point
- * @param {array} segments - Array of boundary segments
- * @returns {boolean} True if the point is inside the polygon
- */
-function pointInsidePolygon(x, y, segments) {
-  let inside = false;
-  for (let i = 0; i < segments.length; i++) {
-    const [[x1, y1], [x2, y2]] = segments[i];
-    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;
-    if (intersect) inside = !inside;
-  }
-  return inside;
-}
+export { plotSolution, plotInterpolatedSolution } from "./plotlyPlotScript.js";
+
+export {
+  plotSolutionVtk,
+  plotInterpolatedSolutionVtk,
+  createColorScale,
+  createContourLineOptions,
+  transformSolverOutputToVtkData,
+  transformSolverOutputToVTP,
+  transformSolverOutputToMLBuffers,
+} from "./vtkPlotScript.js";
diff --git a/src/visualization/plotlyPlotScript.js b/src/visualization/plotlyPlotScript.js
new file mode 100644
index 0000000..6e3f438
--- /dev/null
+++ b/src/visualization/plotlyPlotScript.js
@@ -0,0 +1,458 @@
+/**
+ * ════════════════════════════════════════════════════════════════
+ *  FEAScript Core Library
+ *  Lightweight Finite Element Simulation in JavaScript
+ *  Version: 0.3.0 (RC) | https://feascript.com
+ *  MIT License © 2023–2026 FEAScript
+ * ════════════════════════════════════════════════════════════════
+ */
+
+// Internal imports
+import {
+  prepareMesh,
+  pointInsideQuadrilateral,
+  computeNodeNeighbors,
+  getBoundarySegments,
+} from "../mesh/meshUtilsScript.js";
+import { BasisFunctions } from "../mesh/basisFunctionsScript.js";
+import { basicLog, debugLog, errorLog } from "../utilities/loggingScript.js";
+
+/**
+ * Function to create plots of the solution vector
+ * @param {object} result - Object containing solution vector and mesh information
+ * @param {object} model - Object containing model properties
+ * @param {string} plotType - The type of plot
+ * @param {string} plotDivId - The id of the div where the plot will be rendered
+ */
+export function plotSolution(model, result, plotType, plotDivId) {
+  console.time("plottingTime");
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const solutionVector = result.solutionVector;
+  const solverConfig = model.solverConfig;
+  const meshDimension = model.meshConfig.meshDimension;
+  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details (used in splitQuadrilateral)
+
+  if (meshDimension === "1D" && plotType === "line") {
+    // Check if solutionVector is a nested array
+    let yData;
+    if (solutionVector.length > 0 && Array.isArray(solutionVector[0])) {
+      yData = solutionVector.map((arr) => arr[0]);
+    } else {
+      yData = solutionVector;
+    }
+    let xData = Array.from(nodesXCoordinates);
+
+    let lineData = {
+      x: nodesXCoordinates,
+      y: yData,
+      mode: "lines",
+      type: "scatter",
+      line: { color: "rgb(219, 64, 82)", width: 2 },
+      name: "Solution",
+    };
+
+    let maxWindowWidth = Math.min(window.innerWidth, 700);
+    let plotWidth = Math.min(maxWindowWidth, 600);
+    let plotHeight = 300;
+
+    let layout = {
+      title: `line plot - ${solverConfig}`,
+      width: plotWidth,
+      height: plotHeight,
+      xaxis: { title: "x" },
+      yaxis: { title: "Solution" },
+      margin: { l: 50, r: 50, t: 50, b: 50 },
+    };
+
+    Plotly.newPlot(plotDivId, [lineData], layout, { responsive: true });
+    console.timeEnd("plottingTime");
+  } else if (meshDimension === "2D" && plotType === "contour") {
+    // Check if solutionVector is a nested array
+    let zData;
+    if (Array.isArray(solutionVector[0])) {
+      zData = solutionVector.map((val) => val[0]);
+    } else {
+      zData = solutionVector;
+    }
+
+    // Plot sizing parameters
+    let maxWindowWidth = Math.min(window.innerWidth, 700);
+    let minX = Math.min(...nodesXCoordinates);
+    let maxX = Math.max(...nodesXCoordinates);
+    let minY = Math.min(...nodesYCoordinates);
+    let maxY = Math.max(...nodesYCoordinates);
+    let lengthX = maxX - minX;
+    let lengthY = maxY - minY;
+    let aspectRatio = lengthY / lengthX;
+    let plotWidth = Math.min(maxWindowWidth, 600);
+    let plotHeight = plotWidth * aspectRatio;
+
+    // Layout properties
+    let layout = {
+      title: `${plotType} plot - ${solverConfig}`,
+      width: plotWidth,
+      height: plotHeight,
+      xaxis: { title: "x" },
+      yaxis: {
+        title: "y",
+        scaleanchor: "x",
+        scaleratio: 1,
+      },
+      margin: { l: 50, r: 50, t: 50, b: 50 },
+      hovermode: "closest",
+    };
+
+    // Create the plot
+    let contourData = {
+      x: nodesXCoordinates,
+      y: nodesYCoordinates,
+      z: zData,
+      type: "contour",
+      line: {
+        smoothing: 0.85,
+      },
+      contours: {
+        coloring: "heatmap",
+        showlabels: false,
+      },
+      //colorscale: 'Viridis',
+      colorbar: {
+        title: "Solution",
+      },
+      name: "Solution Field",
+    };
+
+    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });
+    console.timeEnd("plottingTime");
+  }
+}
+
+/**
+ * Function to generate a dense visualization grid and interpolate the FEM solution on it
+ * @param {object} result - Object containing solution vector and mesh information
+ * @param {object} model - Object containing model properties
+ * @param {string} plotType - The type of plot
+ * @param {string} plotDivId - The id of the div where the plot will be rendered
+ */
+export function plotInterpolatedSolution(model, result, plotType, plotDivId) {
+  console.time("plottingTime");
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates; // TODO: Check if we should place it inside the 2D block
+  const meshDimension = model.meshConfig.meshDimension;
+  const meshData = prepareMesh(model.meshConfig); // Retrieve mesh connectivity details
+
+  // Initialize BasisFunctions once here to avoid creating it inside the loop
+  const basisFunctions = new BasisFunctions({
+    meshDimension: model.meshConfig.meshDimension,
+    elementOrder: model.meshConfig.elementOrder,
+  });
+
+  if (meshDimension === "1D" && plotType === "line") {
+    // 1D plot region
+  } else if (meshDimension === "2D" && plotType === "contour") {
+    const visNodeXCoordinates = [];
+    const visNodeYCoordinates = [];
+    const lengthX = Math.max(...nodesXCoordinates) - Math.min(...nodesXCoordinates);
+    const lengthY = Math.max(...nodesYCoordinates) - Math.min(...nodesYCoordinates);
+    const visPoinsPerUnit = 50; // Number of nodes per one length unit of the visualization grid
+    const visNodesX = Math.round(lengthX * visPoinsPerUnit); // Number of nodes along the x-axis of the visualization grid
+    const visNodesY = Math.round(lengthY * visPoinsPerUnit); // Number of nodes along the y-axis of the visualization grid
+    const deltavisX = lengthX / (visNodesX - 1);
+    const deltavisY = lengthY / (visNodesY - 1);
+    let visSolution = [];
+
+    visNodeXCoordinates[0] = Math.min(...nodesXCoordinates);
+    visNodeYCoordinates[0] = Math.min(...nodesYCoordinates);
+
+    for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {
+      visNodeXCoordinates[visNodeIndexY] = visNodeXCoordinates[0];
+      visNodeYCoordinates[visNodeIndexY] = visNodeYCoordinates[0] + visNodeIndexY * deltavisY;
+    }
+
+    for (let visNodeIndexX = 1; visNodeIndexX < visNodesX; visNodeIndexX++) {
+      const nnode = visNodeIndexX * visNodesY;
+      visNodeXCoordinates[nnode] = visNodeXCoordinates[0] + visNodeIndexX * deltavisX;
+      visNodeYCoordinates[nnode] = visNodeYCoordinates[0];
+
+      for (let visNodeIndexY = 1; visNodeIndexY < visNodesY; visNodeIndexY++) {
+        visNodeXCoordinates[nnode + visNodeIndexY] = visNodeXCoordinates[nnode];
+        visNodeYCoordinates[nnode + visNodeIndexY] = visNodeYCoordinates[nnode] + visNodeIndexY * deltavisY;
+      }
+    }
+
+    const visNodeCoordinates = { visNodeXCoordinates, visNodeYCoordinates };
+
+    // Initialize visSolution with null for all visualization nodes
+    visSolution = new Array(visNodesX * visNodesY).fill(null);
+
+    // Get boundary segments for ray casting
+    const boundarySegments = getBoundarySegments(meshData);
+
+    // Perform adjacency-based search to find which element contains a given point (quick search)
+    const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);
+    let lastParentElement = 0;
+    for (let visNodeIndex = 0; visNodeIndex < visNodesX * visNodesY; visNodeIndex++) {
+      // Ray casting check
+      if (
+        !pointInsidePolygon(
+          visNodeXCoordinates[visNodeIndex],
+          visNodeYCoordinates[visNodeIndex],
+          boundarySegments,
+        )
+      ) {
+        continue;
+      }
+      let found = false;
+      for (
+        let localNodeIndex = 0;
+        localNodeIndex < meshData.nop[lastParentElement].length;
+        localNodeIndex++
+      ) {
+        let globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;
+        for (
+          let neighborElementsIndex = 0;
+          neighborElementsIndex < neighborCount[globalNodeIndex];
+          neighborElementsIndex++
+        ) {
+          let currentElement = nodeNeighbors[globalNodeIndex][neighborElementsIndex];
+          const searchResult = pointSearch(
+            model,
+            meshData,
+            result,
+            currentElement,
+            visNodeXCoordinates[visNodeIndex],
+            visNodeYCoordinates[visNodeIndex],
+            basisFunctions,
+          );
+
+          if (searchResult.inside) {
+            lastParentElement = currentElement;
+            visSolution[visNodeIndex] = searchResult.value;
+            found = true;
+            break;
+          }
+        }
+        if (found) break;
+      }
+
+      // Scan all elements to find which element contains a given point (slow search)
+      if (!found) {
+        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {
+          const searchResult = pointSearch(
+            model,
+            meshData,
+            result,
+            currentElement,
+            visNodeXCoordinates[visNodeIndex],
+            visNodeYCoordinates[visNodeIndex],
+            basisFunctions,
+          );
+
+          if (searchResult.inside) {
+            lastParentElement = currentElement;
+            visSolution[visNodeIndex] = searchResult.value;
+            found = true;
+            break;
+          }
+        }
+      }
+    }
+
+    // Plot sizing parameters
+    let maxWindowWidth = Math.min(window.innerWidth, 700);
+    let aspectRatio = lengthY / lengthX;
+    let plotWidth = Math.min(maxWindowWidth, 600);
+    let plotHeight = plotWidth * aspectRatio;
+
+    // Layout properties
+    let layout = {
+      title: `${plotType} plot (interpolated) - ${model.solverConfig}`,
+      width: plotWidth,
+      height: plotHeight,
+      xaxis: { title: "x" },
+      yaxis: {
+        title: "y",
+        scaleanchor: "x",
+        scaleratio: 1,
+      },
+      margin: { l: 50, r: 50, t: 50, b: 50 },
+      hovermode: "closest",
+    };
+
+    // Create the plot
+    let contourData = {
+      x: visNodeXCoordinates,
+      y: visNodeYCoordinates,
+      z: visSolution,
+      type: "contour",
+      connectgaps: false,
+      hoverongaps: false,
+      line: {
+        smoothing: 0.85,
+      },
+      contours: {
+        coloring: "heatmap",
+        showlabels: false,
+      },
+      //colorscale: 'Viridis',
+      colorbar: {
+        title: "Solution",
+      },
+      name: "Interpolated Solution Field",
+    };
+
+    Plotly.newPlot(plotDivId, [contourData], layout, { responsive: true });
+    console.timeEnd("plottingTime");
+  }
+}
+
+/**
+ * Function to search if a point is inside an element and interpolate the solution
+ * @param {object} model - Object containing model properties
+ * @param {object} meshData - Object containing mesh data
+ * @param {object} result - Object containing solution vector and mesh information
+ * @param {number} currentElement - Index of the element to check
+ * @param {number} visNodeXCoordinate - X-coordinate of the point
+ * @param {number} visNodeYCoordinate - Y-coordinate of the point
+ * @param {object} basisFunctions - Instance of BasisFunctions class
+ * @returns {object} Object containing inside boolean and interpolated value
+ */
+function pointSearch(
+  model,
+  meshData,
+  result,
+  currentElement,
+  visNodeXCoordinate,
+  visNodeYCoordinate,
+  basisFunctions,
+) {
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const nodesPerElement = meshData.nop[currentElement].length;
+
+  if (nodesPerElement === 4) {
+    // Linear quadrilateral element
+    let vertices = [
+      [
+        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][1] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][1] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][3] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][3] - 1],
+      ],
+    ];
+    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
+    if (pointCheck.inside) {
+      return {
+        inside: true,
+        value: solutionInterpolation(
+          model,
+          meshData,
+          result,
+          currentElement,
+          pointCheck.ksi,
+          pointCheck.eta,
+          basisFunctions,
+        ),
+      };
+    }
+  } else if (nodesPerElement === 9) {
+    // Quadratic quadrilateral element
+    let vertices = [
+      [
+        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][6] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][6] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][8] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][8] - 1],
+      ],
+    ];
+    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
+    if (pointCheck.inside) {
+      return {
+        inside: true,
+        value: solutionInterpolation(
+          model,
+          meshData,
+          result,
+          currentElement,
+          pointCheck.ksi,
+          pointCheck.eta,
+          basisFunctions,
+        ),
+      };
+    }
+  } // TODO: Add also triangular element cases
+  return { inside: false, value: null };
+}
+
+/**
+ * Function to interpolate the solution at a specific point (ksi, eta) within an element
+ * @param {object} model - Object containing model properties
+ * @param {object} meshData - Object containing mesh data
+ * @param {object} result - Object containing solution vector and mesh information
+ * @param {number} elementIndex - Index of the element containing the point
+ * @param {number} ksi - First natural coordinate (ksi)
+ * @param {number} eta - Second natural coordinate (eta)
+ * @param {object} basisFunctions - Instance of BasisFunctions class
+ * @returns {number} Interpolated solution value
+ */
+function solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {
+  // Initialize FEA components
+  const solutionVector = result.solutionVector;
+  const nodesPerElement = meshData.nop[elementIndex].length;
+
+  // Get basis functions for the current point
+  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);
+  let basisFunction = basisFunctionsAndDerivatives.basisFunction;
+
+  // Check if solutionVector is a nested array
+  let zData;
+  if (Array.isArray(solutionVector[0])) {
+    zData = solutionVector.map((val) => val[0]);
+  } else {
+    zData = solutionVector;
+  }
+
+  // Interpolate solution
+  let solutionInterpolationValue = 0;
+  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {
+    solutionInterpolationValue +=
+      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];
+  }
+
+  return solutionInterpolationValue;
+}
+
+/**
+ * Function to check if a point is inside a polygon using ray casting algorithm
+ * @param {number} x - X-coordinate of the point
+ * @param {number} y - Y-coordinate of the point
+ * @param {array} segments - Array of boundary segments
+ * @returns {boolean} True if the point is inside the polygon
+ */
+function pointInsidePolygon(x, y, segments) {
+  let inside = false;
+  for (let i = 0; i < segments.length; i++) {
+    const [[x1, y1], [x2, y2]] = segments[i];
+    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;
+    if (intersect) inside = !inside;
+  }
+  return inside;
+}
diff --git a/src/visualization/vtkPlotScript.js b/src/visualization/vtkPlotScript.js
new file mode 100644
index 0000000..4774af7
--- /dev/null
+++ b/src/visualization/vtkPlotScript.js
@@ -0,0 +1,862 @@
+/**
+ * ════════════════════════════════════════════════════════════════
+ *  FEAScript Core Library
+ *  Lightweight Finite Element Simulation in JavaScript
+ *  Version: 0.3.0 (RC) | https://feascript.com
+ *  MIT License © 2023–2026 FEAScript
+ * ════════════════════════════════════════════════════════════════
+ */
+
+// Internal imports
+import {
+  prepareMesh,
+  pointInsideQuadrilateral,
+  computeNodeNeighbors,
+  getBoundarySegments,
+} from "../mesh/meshUtilsScript.js";
+import { BasisFunctions } from "../mesh/basisFunctionsScript.js";
+import { errorLog } from "../utilities/loggingScript.js";
+
+let _vtkModules = null;
+
+/**
+ * Lazily loads and caches vtk.js modules required for rendering
+ * @returns {Promise<object>} Object containing vtk.js module references
+ */
+async function loadVtkModules() {
+  if (_vtkModules) return _vtkModules;
+  await import("@kitware/vtk.js/Rendering/Profiles/Geometry.js");
+  const [
+    { default: vtkActor },
+    { default: vtkColorTransferFunction },
+    { default: vtkColorMaps },
+    { default: vtkDataArray },
+    { default: vtkImageData },
+    { default: vtkImageMarchingSquares },
+    { default: vtkGenericRenderWindow },
+    { default: vtkMapper },
+    { default: vtkPolyData },
+    { default: vtkScalarBarActor },
+  ] = await Promise.all([
+    import("@kitware/vtk.js/Rendering/Core/Actor.js"),
+    import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction.js"),
+    import("@kitware/vtk.js/Rendering/Core/ColorTransferFunction/ColorMaps.js"),
+    import("@kitware/vtk.js/Common/Core/DataArray.js"),
+    import("@kitware/vtk.js/Common/DataModel/ImageData.js"),
+    import("@kitware/vtk.js/Filters/General/ImageMarchingSquares.js"),
+    import("@kitware/vtk.js/Rendering/Misc/GenericRenderWindow.js"),
+    import("@kitware/vtk.js/Rendering/Core/Mapper.js"),
+    import("@kitware/vtk.js/Common/DataModel/PolyData.js"),
+    import("@kitware/vtk.js/Rendering/Core/ScalarBarActor.js"),
+  ]);
+  _vtkModules = {
+    vtkActor,
+    vtkColorTransferFunction,
+    vtkColorMaps,
+    vtkDataArray,
+    vtkImageData,
+    vtkImageMarchingSquares,
+    vtkGenericRenderWindow,
+    vtkMapper,
+    vtkPolyData,
+    vtkScalarBarActor,
+  };
+  return _vtkModules;
+}
+
+const rendererCache = new Map();
+
+/**
+ * Creates a color scale configuration for visualization
+ * @param {object} options - Color scale options
+ * @param {string} [options.presetName="Cool to Warm"] - Color map preset name
+ * @param {boolean} [options.reverse=false] - Whether to reverse the color map
+ * @param {boolean} [options.showScalarBar=true] - Whether to display the scalar bar
+ * @param {string} [options.scalarBarTitle="Solution"] - Title for the scalar bar
+ * @returns {object} Color scale configuration object
+ */
+export function createColorScale(options = {}) {
+  return {
+    presetName: options.presetName ?? "Cool to Warm",
+    reverse: options.reverse ?? false,
+    showScalarBar: options.showScalarBar ?? true,
+    scalarBarTitle: options.scalarBarTitle ?? "Solution",
+  };
+}
+
+/**
+ * Creates contour line options for visualization
+ * @param {object} options - Contour line options
+ * @param {boolean} [options.enabled=true] - Whether contour lines are enabled
+ * @param {number} [options.numberOfContours=12] - Number of contour lines
+ * @param {Array<number>} [options.color=[0.15,0.15,0.15]] - RGB color array for contour lines
+ * @param {number} [options.lineWidth=1] - Width of contour lines
+ * @returns {object} Contour line configuration object
+ */
+export function createContourLineOptions(options = {}) {
+  return {
+    enabled: options.enabled ?? true,
+    numberOfContours: options.numberOfContours ?? 12,
+    color: options.color ?? [0.15, 0.15, 0.15],
+    lineWidth: options.lineWidth ?? 1,
+  };
+}
+
+/**
+ * Plots the FEA solution using the VTK.js backend
+ * @param {object} model - FEAScript model containing mesh and solver configuration
+ * @param {object} result - Object containing solution vector and node coordinates
+ * @param {string} plotType - The type of plot (e.g., "line", "contour")
+ * @param {string} plotDivId - The id of the HTML element for rendering
+ * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines
+ */
+export async function plotSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {
+  console.time("plottingTime");
+  const meshDimension = model.meshConfig.meshDimension;
+  const meshData = prepareMesh(model.meshConfig);
+  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {
+    mode: meshDimension === "1D" && plotType === "line" ? "line" : "surface",
+  });
+  await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);
+  console.timeEnd("plottingTime");
+}
+
+/**
+ * Plots an interpolated FEA solution using the VTK.js backend
+ * @param {object} model - FEAScript model containing mesh and solver configuration
+ * @param {object} result - Object containing solution vector and node coordinates
+ * @param {string} plotType - The type of plot (e.g., "contour")
+ * @param {string} plotDivId - The id of the HTML element for rendering
+ * @param {object} [renderOptions={}] - Rendering options including colorScale, contourLines
+ */
+export async function plotInterpolatedSolutionVtk(model, result, plotType, plotDivId, renderOptions = {}) {
+  console.time("plottingTime");
+  if (model.meshConfig.meshDimension !== "2D" || plotType !== "contour") {
+    // Fallback to non-interpolated for non-2D contour cases
+    const meshData = prepareMesh(model.meshConfig);
+    const vtkData = await transformSolverOutputToVtkData(model, result, meshData, {
+      mode: model.meshConfig.meshDimension === "1D" && plotType === "line" ? "line" : "surface",
+    });
+    await renderVtkScene(vtkData, plotDivId, model.solverConfig, plotType, renderOptions);
+    console.timeEnd("plottingTime");
+    return;
+  }
+  const meshData = prepareMesh(model.meshConfig);
+  const interpolatedVtkData = await buildInterpolatedVtkData(model, result, meshData);
+  await renderVtkScene(
+    interpolatedVtkData,
+    plotDivId,
+    model.solverConfig,
+    `${plotType}-interpolated`,
+    renderOptions,
+  );
+  console.timeEnd("plottingTime");
+}
+
+/**
+ * Transforms solver output into VTK-compatible data structures
+ * @param {object} model - FEAScript model containing mesh and solver configuration
+ * @param {object} result - Object containing solution vector and node coordinates
+ * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare
+ * @param {object} [options={}] - Options including mode ("surface" or "line")
+ * @returns {Promise<object>} VTK data object with points, scalars, cells, polyData, and metadata
+ */
+export async function transformSolverOutputToVtkData(model, result, meshData = null, options = {}) {
+  const preparedMesh = meshData ?? prepareMesh(model.meshConfig);
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const solutionArray = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);
+  const points = buildPointsArray(nodesXCoordinates, nodesYCoordinates);
+
+  const mode = options.mode ?? "surface";
+  const cells =
+    mode === "line"
+      ? buildLineCellsFromPoints(nodesXCoordinates.length)
+      : buildCellArrayFromNop(preparedMesh.nop ?? []);
+
+  const polyData = await buildPolyData(points, solutionArray, cells, mode);
+
+  return {
+    points,
+    scalars: solutionArray,
+    cells,
+    polyData,
+    mode,
+    metadata: {
+      solverConfig: model.solverConfig,
+      meshDimension: model.meshConfig.meshDimension,
+      numberOfPoints: points.length / 3,
+      numberOfCells: countPackedCells(cells),
+    },
+  };
+}
+
+/**
+ * Transforms solver output into a VTP (VTK PolyData XML) string
+ * @param {object} model - FEAScript model containing mesh and solver configuration
+ * @param {object} result - Object containing solution vector and node coordinates
+ * @param {object|null} [meshData=null] - Pre-prepared mesh data, or null to auto-prepare
+ * @param {object} [options={}] - Options including mode ("surface" or "line")
+ * @returns {Promise<string>} VTP XML string
+ */
+export async function transformSolverOutputToVTP(model, result, meshData = null, options = {}) {
+  const vtkData = await transformSolverOutputToVtkData(model, result, meshData, options);
+  return buildVTPString(vtkData);
+}
+
+/**
+ * Transforms solver output into typed array buffers suitable for ML pipelines
+ * @param {object} result - Object containing solution vector and node coordinates
+ * @returns {object} Object with features (Float32Array), featuresShape, labels, and points
+ */
+export function transformSolverOutputToMLBuffers(result) {
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const scalars = extractScalarSolution(result.solutionVector, nodesXCoordinates.length);
+  const features = new Float32Array(nodesXCoordinates.length * 3);
+
+  for (let i = 0; i < nodesXCoordinates.length; i++) {
+    const base = i * 3;
+    features[base] = Number(nodesXCoordinates[i]) || 0;
+    features[base + 1] = Number(nodesYCoordinates[i]) || 0;
+    features[base + 2] = scalars[i];
+  }
+
+  return {
+    features,
+    featuresShape: [nodesXCoordinates.length, 3],
+    labels: scalars,
+    points: buildPointsArray(nodesXCoordinates, nodesYCoordinates),
+  };
+}
+
+// VTK rendering
+
+async function renderVtkScene(vtkData, plotDivId, solverConfig, plotType, renderOptions = {}) {
+  if (typeof document === "undefined") {
+    errorLog("vtk.js visualization requires a browser environment");
+    return;
+  }
+  const {
+    vtkActor,
+    vtkColorTransferFunction,
+    vtkColorMaps,
+    vtkGenericRenderWindow,
+    vtkMapper,
+    vtkScalarBarActor,
+  } = await loadVtkModules();
+
+  const container = document.getElementById(plotDivId);
+  if (!container) {
+    errorLog(`Could not find plot container with id: ${plotDivId}`);
+    return;
+  }
+
+  if (rendererCache.has(plotDivId)) {
+    rendererCache.get(plotDivId).delete();
+    rendererCache.delete(plotDivId);
+  }
+
+  container.innerHTML = "";
+  container.style.position = "relative";
+  container.style.width = container.style.width || "100%";
+  container.style.height = container.style.height || "420px";
+
+  const genericRenderWindow = vtkGenericRenderWindow.newInstance({ background: [1, 1, 1] });
+  genericRenderWindow.setContainer(container);
+  genericRenderWindow.resize();
+
+  const renderer = genericRenderWindow.getRenderer();
+  const renderWindow = genericRenderWindow.getRenderWindow();
+
+  const mapper = vtkMapper.newInstance();
+  mapper.setInputData(vtkData.polyData);
+  mapper.setScalarModeToUsePointData();
+  mapper.setColorModeToMapScalars();
+  mapper.setScalarVisibility(true);
+
+  const scalarRange = getScalarRange(vtkData.scalars);
+  mapper.setScalarRange(scalarRange[0], scalarRange[1]);
+
+  const colorScale = renderOptions.colorScale ?? createColorScale({});
+  const lookupTable = vtkColorTransferFunction.newInstance();
+  const preset =
+    vtkColorMaps.getPresetByName(colorScale.presetName) ?? vtkColorMaps.getPresetByName("Cool to Warm");
+  const mappedPreset = reverseColorMapPreset(preset, colorScale.reverse);
+  lookupTable.applyColorMap(mappedPreset);
+  lookupTable.setMappingRange(scalarRange[0], scalarRange[1]);
+  lookupTable.updateRange();
+  mapper.setLookupTable(lookupTable);
+
+  const actor = vtkActor.newInstance();
+  actor.setMapper(mapper);
+  if (vtkData.mode === "line") actor.getProperty().setLineWidth(3);
+  renderer.addActor(actor);
+
+  if (colorScale.showScalarBar) {
+    const scalarBarActor = vtkScalarBarActor.newInstance({
+      drawNanAnnotation: false,
+      generateTicks: (helper) => {
+        const bounds = helper.getLastTickBounds();
+        if (!bounds || bounds.length < 2) return;
+        const [minVal, maxVal] = bounds;
+        const count = 5;
+        const step = (maxVal - minVal) / (count - 1);
+        const ticks = Array.from({ length: count }, (_, i) => minVal + i * step);
+        helper.setTicks(ticks);
+        helper.setTickStrings(
+          ticks.map((v) => {
+            const abs = Math.abs(v);
+            if (abs === 0) return "0";
+            if (abs >= 0.01 && abs < 10000) return parseFloat(v.toPrecision(4)).toString();
+            return v.toExponential(2);
+          }),
+        );
+      },
+    });
+    scalarBarActor.setTickTextStyle({ fontColor: "black" });
+    scalarBarActor.setAxisTextStyle({ fontColor: "black" });
+    scalarBarActor.setAxisLabel(colorScale.scalarBarTitle);
+    scalarBarActor.setScalarsToColors(lookupTable);
+    renderer.addActor2D(scalarBarActor);
+  }
+
+  const contourLines = createContourLineOptions(renderOptions.contourLines ?? { enabled: false });
+  if (contourLines.enabled && vtkData.mode !== "line") {
+    await addContourLinesToRenderer(renderer, vtkData, scalarRange, contourLines);
+  }
+
+  renderer.resetCamera();
+  renderWindow.render();
+  rendererCache.set(plotDivId, genericRenderWindow);
+  container.title = `${plotType} plot - ${solverConfig}`;
+}
+
+async function addContourLinesToRenderer(renderer, vtkData, scalarRange, contourOptions) {
+  const gridMeta = vtkData.metadata?.interpolationGrid;
+  if (!gridMeta) {
+    return;
+  }
+  const { vtkActor, vtkDataArray, vtkImageData, vtkImageMarchingSquares, vtkMapper } = await loadVtkModules();
+
+  const imageData = vtkImageData.newInstance();
+  imageData.setDimensions(gridMeta.nx, gridMeta.ny, 1);
+  imageData.setOrigin(gridMeta.origin[0], gridMeta.origin[1], 0);
+  imageData.setSpacing(gridMeta.spacing[0], gridMeta.spacing[1], 1);
+
+  const imageScalars = vtkDataArray.newInstance({
+    name: "solution",
+    numberOfComponents: 1,
+    values: gridMeta.imageScalars,
+  });
+  imageData.getPointData().setScalars(imageScalars);
+
+  const contourFilter = vtkImageMarchingSquares.newInstance({
+    slicingMode: 2,
+    slice: 0,
+    mergePoints: true,
+  });
+  contourFilter.setInputData(imageData);
+
+  const n = Math.max(2, contourOptions.numberOfContours);
+  const minValue = scalarRange[0];
+  const maxValue = scalarRange[1];
+  const step = (maxValue - minValue) / (n - 1);
+  const contourValues = [];
+  for (let i = 0; i < n; i++) {
+    contourValues.push(minValue + i * step);
+  }
+  contourFilter.setContourValues(contourValues);
+  contourFilter.update();
+
+  const contourMapper = vtkMapper.newInstance();
+  contourMapper.setInputData(contourFilter.getOutputData());
+  contourMapper.setScalarVisibility(false);
+
+  const contourActor = vtkActor.newInstance();
+  contourActor.setMapper(contourMapper);
+  contourActor.getProperty().setColor(...contourOptions.color);
+  contourActor.getProperty().setLineWidth(contourOptions.lineWidth);
+  renderer.addActor(contourActor);
+}
+
+// Color map helpers
+
+function reverseColorMapPreset(preset, reverse) {
+  if (!reverse || !preset?.RGBPoints?.length) return preset;
+  const rgb = preset.RGBPoints;
+  const minX = rgb[0];
+  const maxX = rgb[rgb.length - 4];
+  const reversed = [];
+  for (let i = rgb.length - 4; i >= 0; i -= 4) {
+    reversed.push(maxX - (rgb[i] - minX), rgb[i + 1], rgb[i + 2], rgb[i + 3]);
+  }
+  return { ...preset, RGBPoints: reversed };
+}
+
+// Data building helpers
+
+async function buildPolyData(points, scalars, cells, mode = "surface") {
+  const { vtkPolyData, vtkDataArray } = await loadVtkModules();
+  const polyData = vtkPolyData.newInstance();
+  polyData.getPoints().setData(points, 3);
+  if (cells.length > 0) {
+    if (mode === "line") polyData.getLines().setData(cells);
+    else polyData.getPolys().setData(cells);
+  }
+  const scalarData = vtkDataArray.newInstance({
+    name: "solution",
+    numberOfComponents: 1,
+    values: scalars,
+  });
+  polyData.getPointData().setScalars(scalarData);
+  return polyData;
+}
+
+function buildPointsArray(nodesXCoordinates, nodesYCoordinates) {
+  const points = new Float32Array(nodesXCoordinates.length * 3);
+  for (let i = 0; i < nodesXCoordinates.length; i++) {
+    const base = i * 3;
+    points[base] = Number(nodesXCoordinates[i]) || 0;
+    points[base + 1] = Number(nodesYCoordinates?.[i]) || 0;
+    points[base + 2] = 0;
+  }
+  return points;
+}
+
+function extractScalarSolution(solutionVector, expectedLength) {
+  const scalars = new Float32Array(expectedLength);
+  for (let i = 0; i < expectedLength; i++) {
+    const value = solutionVector?.[i];
+    scalars[i] = Number(Array.isArray(value) ? value[0] : value) || 0;
+  }
+  return scalars;
+}
+
+function buildLineCellsFromPoints(totalPoints) {
+  if (totalPoints < 2) return new Uint32Array(0);
+  const packed = new Uint32Array((totalPoints - 1) * 3);
+  let offset = 0;
+  for (let i = 0; i < totalPoints - 1; i++) {
+    packed[offset++] = 2;
+    packed[offset++] = i;
+    packed[offset++] = i + 1;
+  }
+  return packed;
+}
+
+function buildCellArrayFromNop(nop) {
+  const packed = [];
+  for (let i = 0; i < nop.length; i++) {
+    const cell = convertElementNodesToLinearCell(nop[i]);
+    packed.push(cell.length, ...cell);
+  }
+  return Uint32Array.from(packed);
+}
+
+function convertElementNodesToLinearCell(elementNodes) {
+  const indices = elementNodes.map((node) => node - 1);
+  const n = indices.length;
+
+  if (n === 2 || n === 3) {
+    return indices;
+  }
+
+  if (n === 4) {
+    // FEAScript quad numbering:
+    //   1 --- 3
+    //   |     |
+    //   0 --- 2
+    // Perimeter order for VTK polygon: 0 -> 2 -> 3 -> 1
+    return [indices[0], indices[2], indices[3], indices[1]];
+  }
+
+  if (n === 6) {
+    return [indices[0], indices[2], indices[5]];
+  }
+
+  if (n === 8) {
+    // Perimeter corners for FEAScript serendipity quad:
+    //   2 --- 6
+    //   |     |
+    //   0 --- 4
+    return [indices[0], indices[4], indices[6], indices[2]];
+  }
+
+  if (n === 9) {
+    // FEAScript 9-node quad numbering:
+    //   2 -- 5 -- 8
+    //   |         |
+    //   1 -- 4 -- 7
+    //   |         |
+    //   0 -- 3 -- 6
+    // Corner perimeter order for VTK polygon: 0 -> 6 -> 8 -> 2
+    return [indices[0], indices[6], indices[8], indices[2]];
+  }
+
+  // Generic fallback for polygonal/high-order cells.
+  return indices.slice(0, Math.min(4, indices.length));
+}
+
+function getScalarRange(scalars) {
+  if (!scalars?.length) return [0, 1];
+  let minValue = Number.POSITIVE_INFINITY;
+  let maxValue = Number.NEGATIVE_INFINITY;
+  for (let i = 0; i < scalars.length; i++) {
+    const value = scalars[i];
+    if (!Number.isFinite(value)) continue;
+    if (value < minValue) minValue = value;
+    if (value > maxValue) maxValue = value;
+  }
+  if (!Number.isFinite(minValue) || !Number.isFinite(maxValue)) return [0, 1];
+  if (minValue === maxValue) return [minValue - 1, maxValue + 1];
+  return [minValue, maxValue];
+}
+
+function countPackedCells(packedCells) {
+  let count = 0,
+    offset = 0;
+  while (offset < packedCells.length) {
+    offset += packedCells[offset] + 1;
+    count++;
+  }
+  return count;
+}
+
+// VTP export
+
+function packedCellsToConnectivityAndOffsets(packedCells) {
+  const connectivity = [],
+    offsets = [];
+  let offset = 0,
+    running = 0;
+  while (offset < packedCells.length) {
+    const npts = packedCells[offset++];
+    for (let i = 0; i < npts; i++) connectivity.push(packedCells[offset++]);
+    running += npts;
+    offsets.push(running);
+  }
+  return { connectivity, offsets };
+}
+
+function buildVTPString(vtkData) {
+  const { connectivity, offsets } = packedCellsToConnectivityAndOffsets(vtkData.cells);
+  const numberOfPoints = vtkData.points.length / 3;
+  const isLine = vtkData.mode === "line";
+  const topologyTag = isLine ? "Lines" : "Polys";
+  return [
+    '<?xml version="1.0"?>',
+    '<VTKFile type="PolyData" version="0.1" byte_order="LittleEndian">',
+    "  <PolyData>",
+    `    <Piece NumberOfPoints="${numberOfPoints}" NumberOfVerts="0" NumberOfLines="${isLine ? offsets.length : 0}" NumberOfStrips="0" NumberOfPolys="${isLine ? 0 : offsets.length}">`,
+    '      <PointData Scalars="solution">',
+    `        <DataArray type="Float32" Name="solution" NumberOfComponents="1" format="ascii">${Array.from(vtkData.scalars).join(" ")}</DataArray>`,
+    "      </PointData>",
+    "      <Points>",
+    `        <DataArray type="Float32" NumberOfComponents="3" format="ascii">${Array.from(vtkData.points).join(" ")}</DataArray>`,
+    "      </Points>",
+    `      <${topologyTag}>`,
+    `        <DataArray type="Int32" Name="connectivity" format="ascii">${connectivity.join(" ")}</DataArray>`,
+    `        <DataArray type="Int32" Name="offsets" format="ascii">${offsets.join(" ")}</DataArray>`,
+    `      </${topologyTag}>`,
+    "    </Piece>",
+    "  </PolyData>",
+    "</VTKFile>",
+  ].join("\n");
+}
+
+// Interpolation helpers
+
+async function buildInterpolatedGridValues(model, result, meshData) {
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const basisFunctions = new BasisFunctions({
+    meshDimension: model.meshConfig.meshDimension,
+    elementOrder: model.meshConfig.elementOrder,
+  });
+
+  let minX = nodesXCoordinates[0];
+  let maxX = nodesXCoordinates[0];
+  let minY = nodesYCoordinates[0];
+  let maxY = nodesYCoordinates[0];
+  for (let i = 1; i < nodesXCoordinates.length; i++) {
+    const x = nodesXCoordinates[i];
+    const y = nodesYCoordinates[i];
+    if (x < minX) minX = x;
+    if (x > maxX) maxX = x;
+    if (y < minY) minY = y;
+    if (y > maxY) maxY = y;
+  }
+
+  const lengthX = maxX - minX;
+  const lengthY = maxY - minY;
+  const visPointsPerUnit = 50;
+
+  const visNodesX = Math.max(2, Math.round(lengthX * visPointsPerUnit));
+  const visNodesY = Math.max(2, Math.round(lengthY * visPointsPerUnit));
+
+  const deltaX = lengthX / (visNodesX - 1);
+  const deltaY = lengthY / (visNodesY - 1);
+
+  const totalVisNodes = visNodesX * visNodesY;
+  const visNodeXCoordinates = new Float32Array(totalVisNodes);
+  const visNodeYCoordinates = new Float32Array(totalVisNodes);
+  const visSolution = new Float32Array(totalVisNodes);
+  visSolution.fill(Number.NaN);
+  const insideMask = new Uint8Array(totalVisNodes);
+
+  const boundarySegments = getBoundarySegments(meshData);
+  const { nodeNeighbors, neighborCount } = computeNodeNeighbors(meshData);
+
+  let lastParentElement = 0;
+  for (let ix = 0; ix < visNodesX; ix++) {
+    for (let iy = 0; iy < visNodesY; iy++) {
+      const visNodeIndex = ix * visNodesY + iy;
+      const x = minX + ix * deltaX;
+      const y = minY + iy * deltaY;
+
+      visNodeXCoordinates[visNodeIndex] = x;
+      visNodeYCoordinates[visNodeIndex] = y;
+
+      if (!pointInsidePolygon(x, y, boundarySegments)) {
+        continue;
+      }
+
+      let found = false;
+      for (
+        let localNodeIndex = 0;
+        localNodeIndex < meshData.nop[lastParentElement].length;
+        localNodeIndex++
+      ) {
+        const globalNodeIndex = meshData.nop[lastParentElement][localNodeIndex] - 1;
+        for (let ni = 0; ni < neighborCount[globalNodeIndex]; ni++) {
+          const currentElement = nodeNeighbors[globalNodeIndex][ni];
+          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);
+
+          if (searchResult.inside) {
+            lastParentElement = currentElement;
+            visSolution[visNodeIndex] = searchResult.value;
+            insideMask[visNodeIndex] = 1;
+            found = true;
+            break;
+          }
+        }
+        if (found) break;
+      }
+
+      if (!found) {
+        for (let currentElement = 0; currentElement < meshData.nop.length; currentElement++) {
+          const searchResult = pointSearch(model, meshData, result, currentElement, x, y, basisFunctions);
+
+          if (searchResult.inside) {
+            lastParentElement = currentElement;
+            visSolution[visNodeIndex] = searchResult.value;
+            insideMask[visNodeIndex] = 1;
+            break;
+          }
+        }
+      }
+    }
+  }
+
+  return {
+    visNodesX,
+    visNodesY,
+    minX,
+    minY,
+    deltaX,
+    deltaY,
+    lengthX,
+    lengthY,
+    visNodeXCoordinates,
+    visNodeYCoordinates,
+    visSolution,
+    insideMask,
+  };
+}
+
+async function buildInterpolatedVtkData(model, result, meshData) {
+  const grid = await buildInterpolatedGridValues(model, result, meshData);
+  const {
+    visNodesX,
+    visNodesY,
+    minX,
+    minY,
+    deltaX,
+    deltaY,
+    visNodeXCoordinates,
+    visNodeYCoordinates,
+    visSolution,
+    insideMask,
+  } = grid;
+
+  const points = buildPointsArray(visNodeXCoordinates, visNodeYCoordinates);
+  const cells = buildStructuredGridCells(visNodesX, visNodesY, insideMask);
+  const polyData = await buildPolyData(points, visSolution, cells, "surface");
+
+  return {
+    points,
+    scalars: visSolution,
+    cells,
+    polyData,
+    mode: "surface",
+    metadata: {
+      meshDimension: "2D",
+      numberOfPoints: points.length / 3,
+      numberOfCells: countPackedCells(cells),
+      interpolationGrid: {
+        nx: visNodesX,
+        ny: visNodesY,
+        origin: [minX, minY],
+        spacing: [deltaX, deltaY],
+        imageScalars: reorderStructuredScalarsForImage(visSolution, visNodesX, visNodesY),
+      },
+    },
+  };
+}
+
+function reorderStructuredScalarsForImage(values, nx, ny) {
+  // FEAScript interpolation uses index = ix * ny + iy (y-fast).
+  // vtkImageData expects index = ix + iy * nx (x-fast).
+  const reordered = new Float32Array(nx * ny);
+  for (let iy = 0; iy < ny; iy++) {
+    for (let ix = 0; ix < nx; ix++) {
+      reordered[ix + iy * nx] = values[ix * ny + iy];
+    }
+  }
+  return reordered;
+}
+
+function buildStructuredGridCells(nx, ny, insideMask) {
+  const packed = [];
+
+  for (let ix = 0; ix < nx - 1; ix++) {
+    for (let iy = 0; iy < ny - 1; iy++) {
+      const n0 = ix * ny + iy;
+      const n1 = (ix + 1) * ny + iy;
+      const n2 = (ix + 1) * ny + (iy + 1);
+      const n3 = ix * ny + (iy + 1);
+
+      if (!insideMask[n0] || !insideMask[n1] || !insideMask[n2] || !insideMask[n3]) {
+        continue;
+      }
+
+      packed.push(4, n0, n1, n2, n3);
+    }
+  }
+
+  return Uint32Array.from(packed);
+}
+
+// Point search & solution interpolation
+
+function pointSearch(
+  model,
+  meshData,
+  result,
+  currentElement,
+  visNodeXCoordinate,
+  visNodeYCoordinate,
+  basisFunctions,
+) {
+  const { nodesXCoordinates, nodesYCoordinates } = result.nodesCoordinates;
+  const nodesPerElement = meshData.nop[currentElement].length;
+
+  if (nodesPerElement === 4) {
+    const vertices = [
+      [
+        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][1] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][1] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][3] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][3] - 1],
+      ],
+    ];
+
+    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
+    if (pointCheck.inside) {
+      return {
+        inside: true,
+        value: solutionInterpolation(
+          model,
+          meshData,
+          result,
+          currentElement,
+          pointCheck.ksi,
+          pointCheck.eta,
+          basisFunctions,
+        ),
+      };
+    }
+  } else if (nodesPerElement === 9) {
+    const vertices = [
+      [
+        nodesXCoordinates[meshData.nop[currentElement][0] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][0] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][2] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][2] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][6] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][6] - 1],
+      ],
+      [
+        nodesXCoordinates[meshData.nop[currentElement][8] - 1],
+        nodesYCoordinates[meshData.nop[currentElement][8] - 1],
+      ],
+    ];
+
+    const pointCheck = pointInsideQuadrilateral(visNodeXCoordinate, visNodeYCoordinate, vertices);
+    if (pointCheck.inside) {
+      return {
+        inside: true,
+        value: solutionInterpolation(
+          model,
+          meshData,
+          result,
+          currentElement,
+          pointCheck.ksi,
+          pointCheck.eta,
+          basisFunctions,
+        ),
+      };
+    }
+  }
+
+  return { inside: false, value: null };
+}
+
+function solutionInterpolation(model, meshData, result, elementIndex, ksi, eta, basisFunctions) {
+  const solutionVector = result.solutionVector;
+  const nodesPerElement = meshData.nop[elementIndex].length;
+  const basisFunctionsAndDerivatives = basisFunctions.getBasisFunctions(ksi, eta);
+  const basisFunction = basisFunctionsAndDerivatives.basisFunction;
+
+  const zData = Array.isArray(solutionVector[0]) ? solutionVector.map((value) => value[0]) : solutionVector;
+
+  let interpolatedValue = 0;
+  for (let localNodeIndex = 0; localNodeIndex < nodesPerElement; localNodeIndex++) {
+    interpolatedValue +=
+      zData[meshData.nop[elementIndex][localNodeIndex] - 1] * basisFunction[localNodeIndex];
+  }
+
+  return interpolatedValue;
+}
+
+function pointInsidePolygon(x, y, segments) {
+  let inside = false;
+  for (let i = 0; i < segments.length; i++) {
+    const [[x1, y1], [x2, y2]] = segments[i];
+    const intersect = y1 > y !== y2 > y && x < ((x2 - x1) * (y - y1)) / (y2 - y1) + x1;
+    if (intersect) inside = !inside;
+  }
+  return inside;
+}
diff --git a/src/workers/webgpuWorkerScript.js b/src/workers/webgpuWorkerScript.js
index 6b762f3..78639e4 100644
--- a/src/workers/webgpuWorkerScript.js
+++ b/src/workers/webgpuWorkerScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
@@ -30,7 +30,7 @@ class webgpuFEAScriptWorker {
    * Function to initialize the WebGPU worker and compute engine
    * @param {string} [powerPreference='high-performance'] - The power preference for the GPU adapter
    */
-  async initialize(powerPreference = 'high-performance') {
+  async initialize(powerPreference = "high-performance") {
     if (!this.initialized) {
       const originalRequestAdapter = navigator.gpu.requestAdapter.bind(navigator.gpu);
       navigator.gpu.requestAdapter = async (options = {}) => {
@@ -71,4 +71,4 @@ class webgpuFEAScriptWorker {
   }
 }
 
-Comlink.expose(new webgpuFEAScriptWorker());
\ No newline at end of file
+Comlink.expose(new webgpuFEAScriptWorker());
diff --git a/src/workers/workerScript.js b/src/workers/workerScript.js
index b0682a7..46ce96f 100644
--- a/src/workers/workerScript.js
+++ b/src/workers/workerScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */
diff --git a/src/workers/wrapperScript.js b/src/workers/wrapperScript.js
index d6dfeca..b8a539a 100644
--- a/src/workers/wrapperScript.js
+++ b/src/workers/wrapperScript.js
@@ -2,7 +2,7 @@
  * ════════════════════════════════════════════════════════════════
  *  FEAScript Core Library
  *  Lightweight Finite Element Simulation in JavaScript
- *  Version: 0.2.0 | https://feascript.com
+ *  Version: 0.3.0 (RC) | https://feascript.com
  *  MIT License © 2023–2026 FEAScript
  * ════════════════════════════════════════════════════════════════
  */