@antv/layout 1.1.0 → 1.2.1

package/dist/435.index.min.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["webpack://Layout/../node_modules/.pnpm/@antv+event-emitter@0.1.3/node_modules/@antv/event-emitter/esm/index.js","webpack://Layout/../node_modules/.pnpm/@antv+graphlib@2.0.0/node_modules/@antv/graphlib/esm/graph.js","webpack://Layout/../node_modules/.pnpm/@antv+graphlib@2.0.0/node_modules/@antv/graphlib/esm/utils/traverse.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/clone.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-array.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-function.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-nil.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-number.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-object.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-string.js","webpack://Layout/../node_modules/.pnpm/@antv+util@3.3.2/node_modules/@antv/util/esm/lodash/is-type.js","webpack://Layout/../node_modules/.pnpm/comlink@4.4.1/node_modules/comlink/dist/esm/comlink.mjs","webpack://Layout/../node_modules/.pnpm/d3-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/center.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/collide.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/constant.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/jiggle.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/lcg.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/link.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/manyBody.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/simulation.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/x.js","webpack://Layout/../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/y.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/add.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/cover.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/data.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/extent.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/find.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octant.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octree.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/remove.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/root.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/size.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visit.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visitAfter.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/x.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/y.js","webpack://Layout/../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/z.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/add.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/cover.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/data.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/extent.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/find.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quad.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quadtree.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/remove.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/root.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/size.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visit.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visitAfter.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/x.js","webpack://Layout/../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/y.js","webpack://Layout/../node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timer.js","webpack://Layout/../node_modules/.pnpm/is-any-array@2.0.1/node_modules/is-any-array/lib-esm/index.js","webpack://Layout/../node_modules/.pnpm/ml-array-max@1.2.4/node_modules/ml-array-max/lib-es6/index.js","webpack://Layout/../node_modules/.pnpm/ml-array-min@1.2.3/node_modules/ml-array-min/lib-es6/index.js","webpack://Layout/../node_modules/.pnpm/ml-array-rescale@1.3.7/node_modules/ml-array-rescale/lib-es6/index.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/dc/svd.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/dc/util.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/inspect.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/mathOperations.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/matrix.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/stat.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/util.js","webpack://Layout/../node_modules/.pnpm/ml-matrix@6.10.4/node_modules/ml-matrix/src/wrap/WrapperMatrix2D.js","webpack://Layout/../node_modules/.pnpm/tslib@2.5.0/node_modules/tslib/tslib.es6.js"],"names":["EventEmitter","this","_events","prototype","on","evt","callback","once","push","emit","_this","args","_i","arguments","length","events","wildcardEvents","doEmit","es","i","_a","splice","apply","off","length_1","getEvents","Graph","nodeMap","Map","edgeMap","inEdgesMap","outEdgesMap","bothEdgesMap","treeIndices","changes","batchCount","onChanged","constructor","options","super","nodes","addNodes","edges","addEdges","tree","addTree","batch","fn","commit","event","graph","reduceChanges","mergedChanges","forEach","change","type","isNewlyAdded","filter","pastChange","sameId","value","id","nodeId","existingChange","find","propertyName","newValue","treeKey","newParentId","checkNodeExistence","getNode","hasNode","has","areNeighbors","firstNodeId","secondNodeId","getNeighbors","some","neighbor","node","get","Error","getRelatedEdges","direction","inEdges","Array","from","outEdges","bothEdges","getDegree","getSuccessors","targets","map","edge","target","Set","getPredecessors","sources","source","predecessors","successors","doAddNode","set","childrenMap","addNode","doRemoveNode","doRemoveEdge","delete","child","parentMap","removeNodes","idList","removeNode","updateNodeDataProperty","oldValue","data","mergeNodeData","patch","Object","entries","updateNodeData","update","checkEdgeExistence","hasEdge","getEdge","getEdgeDetail","doAddEdge","bothEdgesOfSource","bothEdgesOfTarget","add","addEdge","removeEdges","removeEdge","updateEdgeSource","oldSource","newSource","updateEdgeTarget","oldTarget","newTarget","updateEdgeDataProperty","updateEdgeData","mergeEdgeData","checkTreeExistence","hasTreeStructure","attachTreeStructure","detachTreeStructure","stack","isArray","shift","children","parent","setParent","getRoots","getAllNodes","getParent","getChildren","getAncestors","ancestors","current","oldParent","newParent","oldParentId","dfsTree","bfsTree","values","getAllEdges","bfs","navigator","in","bind","out","both","dfs","clone","newNodes","oldNode","newEdges","oldEdge","newGraph","oldParentMap","oldChildrenMap","key","n","toJSON","JSON","stringify","doBFS","queue","visited","doDFS","obj","rst","l","k","str","toString","call","proxyMarker","Symbol","createEndpoint","releaseProxy","finalizer","throwMarker","isObject","val","transferHandlers","canHandle","serialize","port1","port2","MessageChannel","expose","deserialize","port","start","createProxy","serialized","isError","message","name","assign","ep","globalThis","allowedOrigins","addEventListener","ev","origin","allowedOrigin","RegExp","test","isAllowedOrigin","console","warn","path","argumentList","fromWireValue","returnValue","slice","reduce","prop","rawValue","proxy","transfers","transferCache","transfer","undefined","Promise","resolve","catch","then","wireValue","transferables","toWireValue","postMessage","removeEventListener","closeEndPoint","error","TypeError","endpoint","isMessagePort","close","throwIfProxyReleased","isReleased","releaseEndpoint","requestResponseMessage","proxyCounter","WeakMap","proxyFinalizers","FinalizationRegistry","newCount","isProxyReleased","Proxy","_target","unregister","unregisterProxy","r","p","_thisArg","rawArgumentList","last","processArguments","construct","register","registerProxy","processed","v","arr","concat","handler","serializedValue","msg","fill","Math","floor","random","Number","MAX_SAFE_INTEGER","join","noop","dispatch","t","_","Dispatch","c","typename","types","T","trim","split","indexOf","hasOwnProperty","copy","that","x","y","strength","force","sx","sy","initialize","d","vx","vy","radius","radii","iterations","xi","yi","ri","ri2","visitAfter","prepare","index","visit","quad","x0","y0","x1","y1","rj","sqrt","_nodes","_random","a","m","s","nodeById","links","strengths","distances","count","bias","link","min","distance","alpha","b","initializeStrength","initializeDistance","distanceMin2","distanceMax2","Infinity","theta2","accumulate","q","weight","abs","next","x2","w","distanceMin","distanceMax","theta","initialRadius","initialAngle","PI","simulation","alphaMin","alphaDecay","pow","alphaTarget","velocityDecay","forces","stepper","step","tick","stop","fx","fy","initializeNodes","isNaN","angle","cos","sin","initializeForce","restart","randomSource","dx","dy","d2","closest","xz","yz","_x","_y","z","_z","cover","xm","ym","zm","xp","yp","zp","right","bottom","deep","j","_root","leaf","_x0","_y0","z0","_z0","_x1","_y1","z1","_z1","addAll","Float64Array","zz","y2","z2","x3","y3","z3","octs","pop","dz","octree","Octree","NaN","leaf_copy","treeProto","extent","remove","removeAll","root","size","retainer","previous","defaultX","defaultY","defaultZ","quads","quadtree","Quadtree","taskHead","taskTail","frame","timeout","interval","pokeDelay","clockLast","clockNow","clockSkew","clock","performance","now","Date","setFrame","window","requestAnimationFrame","f","setTimeout","clearNow","Timer","_call","_time","_next","timer","delay","time","wake","e","timerFlush","t0","t2","t1","sleep","nap","poke","clearTimeout","clearInterval","setInterval","isAnyArray","tag","endsWith","includes","max","input","_options$fromIndex","fromIndex","_options$toIndex","toIndex","isInteger","maxValue","minValue","rescale","output","currentMin","currentMax","RangeError","_options$min","autoMinMax","_options$max","factor","SingularValueDecomposition","isEmpty","rows","columns","computeLeftSingularVectors","computeRightSingularVectors","autoTranspose","wantu","Boolean","wantv","swapped","transpose","aux","nu","ni","U","V","work","si","nct","nrt","mrc","pp","iter","eps","EPSILON","kase","MIN_VALUE","ks","cs","sn","scale","sp","spm1","epm1","sk","ek","g","tmp","solve","Y","threshold","scols","Ls","rightSingularVectors","VL","mmul","vrows","urows","VLU","sum","solveForDiagonal","inverse","vcols","X","ucols","condition","norm2","rank","tol","ii","diagonal","leftSingularVectors","diagonalMatrix","hypotenuse","indent","repeat","indentData","inspectMatrix","inspectMatrixWithOptions","matrix","maxRows","maxColumns","maxNumSize","padMinus","maxI","maxJ","result","loop","line","formatNumber","inspectData","num","formatNumber2","padEnd","len","fix","toFixed","startsWith","exp","toExponential","installMathOperations","AbstractMatrix","Matrix","addS","addM","checkMatrix","sub","subS","subM","subtract","subtractS","subtractM","mul","mulS","mulM","multiply","multiplyS","multiplyM","div","divS","divM","divide","divideS","divideM","mod","modS","modM","modulus","modulusS","modulusM","and","andS","andM","or","orS","orM","xor","xorS","xorM","leftShift","leftShiftS","leftShiftM","signPropagatingRightShift","signPropagatingRightShiftS","signPropagatingRightShiftM","rightShift","rightShiftS","rightShiftM","zeroFillRightShift","zeroFillRightShiftS","zeroFillRightShiftM","not","acos","acosh","asin","asinh","atan","atanh","cbrt","ceil","clz32","cosh","expm1","fround","log","log1p","log10","log2","round","sign","sinh","tan","tanh","trunc","arg0","powS","powM","static","newRows","newColumns","newData","newMatrix","row","column","vector","zeros","matrix1","matrix2","isMatrix","klass","to1DArray","array","to2DArray","isRowVector","isColumnVector","isVector","isSquare","isSymmetric","isEchelonForm","previousColumn","checked","isReducedEchelonForm","echelonForm","h","iMax","swapRows","reducedEchelonForm","maxRow","pivot","setSubMatrix","neg","getRow","getRowVector","rowVector","setRow","row1","row2","temp","getColumn","getColumnVector","columnVector","setColumn","swapColumns","column1","column2","addRowVector","subRowVector","mulRowVector","divRowVector","addColumnVector","subColumnVector","mulColumnVector","divColumnVector","mulRow","mulColumn","by","NEGATIVE_INFINITY","maxIndex","idx","POSITIVE_INFINITY","minIndex","maxRowIndex","minRow","minRowIndex","maxColumn","maxColumnIndex","minColumn","minColumnIndex","diag","norm","cumulativeSum","dot","vector2","vector1","other","Bcolj","strassen2x2","a11","b11","a12","b12","a21","b21","a22","b22","m1","m2","m3","m4","m5","c00","c01","c10","c11","strassen3x3","a00","a01","a02","a10","a20","b00","b01","b02","b10","b20","m6","m7","m8","m9","m12","m13","m14","m15","m16","m17","m18","c02","c12","c20","c21","c22","mmulStrassen","r1","c1","r2","c2","embed","mat","cols","resultat","blockMult","halfRows","parseInt","halfCols","subMatrix","scaleRows","isFinite","scaleColumns","flipRows","middle","first","flipColumns","kroneckerProduct","kroneckerSum","AxI","eye","IxB","sortRows","compareFunction","compareNumbers","sort","sortColumns","startRow","endRow","startColumn","endColumn","subMatrixRow","indices","subMatrixColumn","selection","rowIndices","columnIndices","rowIndex","columnIndex","trace","product","mean","variance","unbiased","standardDeviation","center","for","rand","randomInt","randInt","identity","negate","tensorProduct","nRows","nColumns","arrayData","every","element","removeRow","addRow","removeColumn","newRow","addColumn","sumByRow","sumByColumn","sumAll","productByRow","productByColumn","productAll","varianceByRow","sum1","sum2","varianceByColumn","varianceAll","centerByRow","centerByColumn","centerAll","getScaleByRow","scaleByRow","getScaleByColumn","scaleByColumn","getScaleAll","divider","scaleAll","checkRowIndex","outer","checkColumnIndex","checkRowVector","checkColumnVector","checkRowIndices","checkColumnIndices","checkRange","checkNumber","newArray","checkNonEmpty","WrapperMatrix2D","extendStatics","setPrototypeOf","__proto__","__extends","String","__","create","__assign","__rest","getOwnPropertySymbols","propertyIsEnumerable","__awaiter","thisArg","_arguments","P","generator","reject","fulfilled","rejected","done","__generator","body","label","sent","trys","ops","verb","iterator","op","__read","o","ar","__spreadArray","to","pack"],"mappings":";gHAwGA,QAtGkC,WAC9B,SAASA,IACLC,KAAKC,QAAU,CAAC,CACpB,CAiGA,OA1FAF,EAAaG,UAAUC,GAAK,SAAUC,EAAKC,EAAUC,GAQjD,OAPKN,KAAKC,QAAQG,KACdJ,KAAKC,QAAQG,GAAO,IAExBJ,KAAKC,QAAQG,GAAKG,KAAK,CACnBF,SAAUA,EACVC,OAAQA,IAELN,IACX,EAMAD,EAAaG,UAAUI,KAAO,SAAUF,EAAKC,GACzC,OAAOL,KAAKG,GAAGC,EAAKC,GAAU,EAClC,EAMAN,EAAaG,UAAUM,KAAO,SAAUJ,GAGpC,IAFA,IAAIK,EAAQT,KACRU,EAAO,GACFC,EAAK,EAAGA,EAAKC,UAAUC,OAAQF,IACpCD,EAAKC,EAAK,GAAKC,UAAUD,GAE7B,IAAIG,EAASd,KAAKC,QAAQG,IAAQ,GAC9BW,EAAiBf,KAAKC,QA1CnB,MA0CwC,GAE3Ce,EAAS,SAAUC,GAEnB,IADA,IAAIJ,EAASI,EAAGJ,OACPK,EAAI,EAAGA,EAAIL,EAAQK,IACxB,GAAKD,EAAGC,GAAR,CAGA,IAAIC,EAAKF,EAAGC,GAAIb,EAAWc,EAAGd,SAAiBc,EAAGb,OAE9CW,EAAGG,OAAOF,EAAG,GACK,IAAdD,EAAGJ,eACIJ,EAAMR,QAAQG,GAEzBS,IACAK,KAEJb,EAASgB,MAAMZ,EAAOC,EAVtB,CAYR,EACAM,EAAOF,GACPE,EAAOD,EACX,EAMAhB,EAAaG,UAAUoB,IAAM,SAAUlB,EAAKC,GACxC,GAAKD,EAKD,GAAKC,EAIA,CAID,IAFA,IAAIS,EAASd,KAAKC,QAAQG,IAAQ,GAC9BmB,EAAWT,EAAOD,OACbK,EAAI,EAAGA,EAAIK,EAAUL,IACtBJ,EAAOI,GAAGb,WAAaA,IACvBS,EAAOM,OAAOF,EAAG,GACjBK,IACAL,KAGc,IAAlBJ,EAAOD,eACAb,KAAKC,QAAQG,EAE5B,aAhBWJ,KAAKC,QAAQG,QALxBJ,KAAKC,QAAU,CAAC,EAuBpB,OAAOD,IACX,EAEAD,EAAaG,UAAUsB,UAAY,WAC/B,OAAOxB,KAAKC,OAChB,EACOF,CACX,CArGiC,E,uECA1B,MAAM0B,UAAc,IACvBC,QAAU,IAAIC,IACdC,QAAU,IAAID,IACdE,WAAa,IAAIF,IACjBG,YAAc,IAAIH,IAClBI,aAAe,IAAIJ,IACnBK,YAAc,IAAIL,IAClBM,QAAU,GACVC,WAAa,EAMbC,UAAY,OA0BZC,YAAYC,GACRC,QACKD,IAEDA,EAAQE,OACRvC,KAAKwC,SAASH,EAAQE,OACtBF,EAAQI,OACRzC,KAAK0C,SAASL,EAAQI,OACtBJ,EAAQM,MACR3C,KAAK4C,QAAQP,EAAQM,MACrBN,EAAQF,YACRnC,KAAKmC,UAAYE,EAAQF,WACjC,CAsBAU,MAASC,IACL9C,KAAKkC,YAAc,EACnBY,IACA9C,KAAKkC,YAAc,EACdlC,KAAKkC,YACNlC,KAAK+C,QACT,EAKJA,SACI,MAAMd,EAAUjC,KAAKiC,QACrBjC,KAAKiC,QAAU,GACf,MAAMe,EAAQ,CACVC,MAAOjD,KACPiC,WAEJjC,KAAKQ,KAAK,UAAWwC,GACrBhD,KAAKmC,UAAUa,EACnB,CA0BAE,cAAcjB,GACV,IAAIkB,EAAgB,GA8GpB,OA7GAlB,EAAQmB,SAASC,IACb,OAAQA,EAAOC,MACX,IAAK,cAAe,CAKhB,IAAIC,GAAe,EACnBJ,EAAgBA,EAAcK,QAAQC,IAClC,GAAwB,cAApBA,EAAWH,KAAsB,CACjC,MAAMI,EAASD,EAAWE,MAAMC,KAAOP,EAAOM,MAAMC,GAIpD,OAHIF,IACAH,GAAe,IAEXG,CACZ,CACK,MAAwB,oBAApBD,EAAWH,KACTG,EAAWG,KAAOP,EAAOM,MAAMC,GAEb,yBAApBH,EAAWH,MACTG,EAAWI,SAAWR,EAAOM,MAAMC,EAEnC,IAEVL,GACDJ,EAAc5C,KAAK8C,GAEvB,KACJ,CACA,IAAK,cAAe,CAKhB,IAAIE,GAAe,EACnBJ,EAAgBA,EAAcK,QAAQC,IAClC,GAAwB,cAApBA,EAAWH,KAAsB,CACjC,MAAMI,EAASD,EAAWE,MAAMC,KAAOP,EAAOM,MAAMC,GAIpD,OAHIF,IACAH,GAAe,IAEXG,CACZ,CACK,MAAwB,oBAApBD,EAAWH,MACI,gBAApBG,EAAWH,MACJG,EAAWG,KAAOP,EAAOM,MAAMC,EAE/B,IAEVL,GACDJ,EAAc5C,KAAK8C,GAEvB,KACJ,CACA,IAAK,kBACL,IAAK,kBACL,IAAK,cAAe,CAIhB,MAAMS,EAAiBX,EAAcY,MAAMN,GAC/BA,EAAWH,OAASD,EAAOC,MAC/BG,EAAWG,KAAOP,EAAOO,IACzBH,EAAWO,eAAiBX,EAAOW,eAEvCF,EACAA,EAAeG,SAAWZ,EAAOY,SAGjCd,EAAc5C,KAAK8C,GAEvB,KACJ,CACA,IAAK,wBAIDF,EAAgBA,EAAcK,QAAQC,GACV,0BAApBA,EAAWH,KACJG,EAAWS,UAAYb,EAAOa,QAEZ,yBAApBT,EAAWH,MACTG,EAAWS,UAAYb,EAAOa,UAI7Cf,EAAc5C,KAAK8C,GACnB,MAEJ,IAAK,uBAAwB,CACzB,MAAMS,EAAiBX,EAAcY,MAAMN,GACX,yBAApBA,EAAWH,MACfG,EAAWS,UAAYb,EAAOa,SAC9BT,EAAWI,SAAWR,EAAOQ,SAEjCC,EACAA,EAAeK,YACXd,EAAOc,YAGXhB,EAAc5C,KAAK8C,GAEvB,KACJ,CACA,QACIF,EAAc5C,KAAK8C,GAE3B,IAEGF,CACX,CAEAiB,mBAAmBR,GACf5D,KAAKqE,QAAQT,EACjB,CAKAU,QAAQV,GACJ,OAAO5D,KAAK0B,QAAQ6C,IAAIX,EAC5B,CAKAY,aAAaC,EAAaC,GACtB,OAAO1E,KAAK2E,aAAaD,GAAcE,MAAMC,GAAaA,EAASjB,KAAOa,GAC9E,CAKAJ,QAAQT,GACJ,MAAMkB,EAAO9E,KAAK0B,QAAQqD,IAAInB,GAC9B,IAAKkB,EACD,MAAM,IAAIE,MAAM,0BAA4BpB,GAEhD,OAAOkB,CACX,CAOAG,gBAAgBrB,EAAIsB,GAEhB,GADAlF,KAAKoE,mBAAmBR,GACN,OAAdsB,EAAoB,CACpB,MAAMC,EAAUnF,KAAK6B,WAAWkD,IAAInB,GACpC,OAAOwB,MAAMC,KAAKF,EACtB,CACK,GAAkB,QAAdD,EAAqB,CAC1B,MAAMI,EAAWtF,KAAK8B,YAAYiD,IAAInB,GACtC,OAAOwB,MAAMC,KAAKC,EACtB,CACK,CACD,MAAMC,EAAYvF,KAAK+B,aAAagD,IAAInB,GACxC,OAAOwB,MAAMC,KAAKE,EACtB,CACJ,CAKAC,UAAU5B,EAAIsB,GACV,OAAOlF,KAAKiF,gBAAgBrB,EAAIsB,GAAWrE,MAC/C,CAIA4E,cAAc7B,GACV,MACM8B,EADW1F,KAAKiF,gBAAgBrB,EAAI,OACjB+B,KAAKC,GAAS5F,KAAKqE,QAAQuB,EAAKC,UACzD,OAAOT,MAAMC,KAAK,IAAIS,IAAIJ,GAC9B,CAIAK,gBAAgBnC,GACZ,MACMoC,EADUhG,KAAKiF,gBAAgBrB,EAAI,MACjB+B,KAAKC,GAAS5F,KAAKqE,QAAQuB,EAAKK,UACxD,OAAOb,MAAMC,KAAK,IAAIS,IAAIE,GAC9B,CAMArB,aAAaf,GACT,MAAMsC,EAAelG,KAAK+F,gBAAgBnC,GACpCuC,EAAanG,KAAKyF,cAAc7B,GACtC,OAAOwB,MAAMC,KAAK,IAAIS,IAAI,IAAII,KAAiBC,IACnD,CACAC,UAAUtB,GACN,GAAI9E,KAAKsE,QAAQQ,EAAKlB,IAClB,MAAM,IAAIoB,MAAM,wBAA0BF,EAAKlB,IAEnD5D,KAAK0B,QAAQ2E,IAAIvB,EAAKlB,GAAIkB,GAC1B9E,KAAK6B,WAAWwE,IAAIvB,EAAKlB,GAAI,IAAIkC,KACjC9F,KAAK8B,YAAYuE,IAAIvB,EAAKlB,GAAI,IAAIkC,KAClC9F,KAAK+B,aAAasE,IAAIvB,EAAKlB,GAAI,IAAIkC,KACnC9F,KAAKgC,YAAYoB,SAAST,IACtBA,EAAK2D,YAAYD,IAAIvB,EAAKlB,GAAI,IAAIkC,IAAM,IAE5C9F,KAAKiC,QAAQ1B,KAAK,CAAE+C,KAAM,YAAaK,MAAOmB,GAClD,CAKAtC,SAASD,GACLvC,KAAK6C,OAAM,KACP,IAAK,MAAMiC,KAAQvC,EACfvC,KAAKoG,UAAUtB,EACnB,GAER,CAKAyB,QAAQzB,GACJ9E,KAAKwC,SAAS,CAACsC,GACnB,CACA0B,aAAa5C,GACT,MAAMkB,EAAO9E,KAAKqE,QAAQT,GACpB2B,EAAYvF,KAAK+B,aAAagD,IAAInB,GACxC2B,GAAWnC,SAASwC,GAAS5F,KAAKyG,aAAab,EAAKhC,MACpD5D,KAAK0B,QAAQgF,OAAO9C,GACpB5D,KAAKgC,YAAYoB,SAAST,IACtBA,EAAK2D,YAAYvB,IAAInB,IAAKR,SAASuD,IAC/BhE,EAAKiE,UAAUF,OAAOC,EAAM/C,GAAG,IAEnCjB,EAAKiE,UAAUF,OAAO9C,GACtBjB,EAAK2D,YAAYI,OAAO9C,EAAG,IAE/B5D,KAAKiC,QAAQ1B,KAAK,CAAE+C,KAAM,cAAeK,MAAOmB,GACpD,CAKA+B,YAAYC,GACR9G,KAAK6C,OAAM,KACPiE,EAAO1D,SAASQ,GAAO5D,KAAKwG,aAAa5C,IAAI,GAErD,CAKAmD,WAAWnD,GACP5D,KAAK6G,YAAY,CAACjD,GACtB,CACAoD,uBAAuBpD,EAAII,EAAcL,GACrC,MAAMmB,EAAO9E,KAAKqE,QAAQT,GAC1B5D,KAAK6C,OAAM,KACP,MAAMoE,EAAWnC,EAAKoC,KAAKlD,GACrBC,EAAWN,EACjBmB,EAAKoC,KAAKlD,GAAgBC,EAC1BjE,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,kBACNM,KACAI,eACAiD,WACAhD,YACF,GAEV,CAMAkD,cAAcvD,EAAIwD,GACdpH,KAAK6C,OAAM,KACPwE,OAAOC,QAAQF,GAAOhE,SAAQ,EAAEY,EAAcL,MAC1C3D,KAAKgH,uBAAuBpD,EAAII,EAAcL,EAAM,GACtD,GAEV,CACA4D,kBAAkB7G,GACd,MAAMkD,EAAKlD,EAAK,GACVoE,EAAO9E,KAAKqE,QAAQT,GAC1B,GAAuB,iBAAZlD,EAAK,GAGZ,YADAV,KAAKgH,uBAAuBpD,EAAIlD,EAAK,GAAIA,EAAK,IAGlD,IAAIwG,EACJ,GAAuB,mBAAZxG,EAAK,GAAmB,CAE/B,MAAM8G,EAAS9G,EAAK,GACpBwG,EAAOM,EAAO1C,EAAKoC,KACvB,KAC4B,iBAAZxG,EAAK,KAEjBwG,EAAOxG,EAAK,IAEhBV,KAAK6C,OAAM,KACP,MAAMoE,EAAWnC,EAAKoC,KAChBjD,EAAWiD,EACjBpC,EAAKoC,KAAOA,EACZlH,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,kBACNM,KACAqD,WACAhD,YACF,GAEV,CAEAwD,mBAAmB7D,GACf,IAAK5D,KAAK0H,QAAQ9D,GACd,MAAM,IAAIoB,MAAM,0BAA4BpB,EAEpD,CAKA8D,QAAQ9D,GACJ,OAAO5D,KAAK4B,QAAQ2C,IAAIX,EAC5B,CAKA+D,QAAQ/D,GAEJ,OADA5D,KAAKyH,mBAAmB7D,GACjB5D,KAAK4B,QAAQmD,IAAInB,EAC5B,CAKAgE,cAAchE,GACV,MAAMgC,EAAO5F,KAAK2H,QAAQ/D,GAC1B,MAAO,CACHgC,OACAK,OAAQjG,KAAKqE,QAAQuB,EAAKK,QAC1BJ,OAAQ7F,KAAKqE,QAAQuB,EAAKC,QAElC,CACAgC,UAAUjC,GACN,GAAI5F,KAAK0H,QAAQ9B,EAAKhC,IAClB,MAAM,IAAIoB,MAAM,wBAA0BY,EAAKhC,IAEnD5D,KAAKoE,mBAAmBwB,EAAKK,QAC7BjG,KAAKoE,mBAAmBwB,EAAKC,QAC7B7F,KAAK4B,QAAQyE,IAAIT,EAAKhC,GAAIgC,GAC1B,MAAMT,EAAUnF,KAAK6B,WAAWkD,IAAIa,EAAKC,QACnCP,EAAWtF,KAAK8B,YAAYiD,IAAIa,EAAKK,QACrC6B,EAAoB9H,KAAK+B,aAAagD,IAAIa,EAAKK,QAC/C8B,EAAoB/H,KAAK+B,aAAagD,IAAIa,EAAKC,QACrDV,EAAQ6C,IAAIpC,GACZN,EAAS0C,IAAIpC,GACbkC,EAAkBE,IAAIpC,GACtBmC,EAAkBC,IAAIpC,GACtB5F,KAAKiC,QAAQ1B,KAAK,CAAE+C,KAAM,YAAaK,MAAOiC,GAClD,CAKAlD,SAASD,GACLzC,KAAK6C,OAAM,KACP,IAAK,MAAM+C,KAAQnD,EACfzC,KAAK6H,UAAUjC,EACnB,GAER,CAaAqC,QAAQrC,GACJ5F,KAAK0C,SAAS,CAACkD,GACnB,CACAa,aAAa7C,GACT,MAAMgC,EAAO5F,KAAK2H,QAAQ/D,GACpB0B,EAAWtF,KAAK8B,YAAYiD,IAAIa,EAAKK,QACrCd,EAAUnF,KAAK6B,WAAWkD,IAAIa,EAAKC,QACnCiC,EAAoB9H,KAAK+B,aAAagD,IAAIa,EAAKK,QAC/C8B,EAAoB/H,KAAK+B,aAAagD,IAAIa,EAAKC,QACrDP,EAASoB,OAAOd,GAChBT,EAAQuB,OAAOd,GACfkC,EAAkBpB,OAAOd,GACzBmC,EAAkBrB,OAAOd,GACzB5F,KAAK4B,QAAQ8E,OAAO9C,GACpB5D,KAAKiC,QAAQ1B,KAAK,CAAE+C,KAAM,cAAeK,MAAOiC,GACpD,CAKAsC,YAAYpB,GACR9G,KAAK6C,OAAM,KACPiE,EAAO1D,SAASQ,GAAO5D,KAAKyG,aAAa7C,IAAI,GAErD,CAKAuE,WAAWvE,GACP5D,KAAKkI,YAAY,CAACtE,GACtB,CAKAwE,iBAAiBxE,EAAIqC,GACjB,MAAML,EAAO5F,KAAK2H,QAAQ/D,GAC1B5D,KAAKoE,mBAAmB6B,GACxB,MAAMoC,EAAYzC,EAAKK,OACjBqC,EAAYrC,EAClBjG,KAAK8B,YAAYiD,IAAIsD,GAAW3B,OAAOd,GACvC5F,KAAK+B,aAAagD,IAAIsD,GAAW3B,OAAOd,GACxC5F,KAAK8B,YAAYiD,IAAIuD,GAAWN,IAAIpC,GACpC5F,KAAK+B,aAAagD,IAAIuD,GAAWN,IAAIpC,GACrCA,EAAKK,OAASA,EACdjG,KAAK6C,OAAM,KACP7C,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,cACNM,KACAI,aAAc,SACdiD,SAAUoB,EACVpE,SAAUqE,GACZ,GAEV,CAKAC,iBAAiB3E,EAAIiC,GACjB,MAAMD,EAAO5F,KAAK2H,QAAQ/D,GAC1B5D,KAAKoE,mBAAmByB,GACxB,MAAM2C,EAAY5C,EAAKC,OACjB4C,EAAY5C,EAClB7F,KAAK6B,WAAWkD,IAAIyD,GAAW9B,OAAOd,GACtC5F,KAAK+B,aAAagD,IAAIyD,GAAW9B,OAAOd,GACxC5F,KAAK6B,WAAWkD,IAAI0D,GAAWT,IAAIpC,GACnC5F,KAAK+B,aAAagD,IAAI0D,GAAWT,IAAIpC,GACrCA,EAAKC,OAASA,EACd7F,KAAK6C,OAAM,KACP7C,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,cACNM,KACAI,aAAc,SACdiD,SAAUuB,EACVvE,SAAUwE,GACZ,GAEV,CACAC,uBAAuB9E,EAAII,EAAcL,GACrC,MAAMiC,EAAO5F,KAAK2H,QAAQ/D,GAC1B5D,KAAK6C,OAAM,KACP,MAAMoE,EAAWrB,EAAKsB,KAAKlD,GACrBC,EAAWN,EACjBiC,EAAKsB,KAAKlD,GAAgBC,EAC1BjE,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,kBACNM,KACAI,eACAiD,WACAhD,YACF,GAEV,CACA0E,kBAAkBjI,GACd,MAAMkD,EAAKlD,EAAK,GACVkF,EAAO5F,KAAK2H,QAAQ/D,GAC1B,GAAuB,iBAAZlD,EAAK,GAGZ,YADAV,KAAK0I,uBAAuB9E,EAAIlD,EAAK,GAAIA,EAAK,IAGlD,IAAIwG,EACJ,GAAuB,mBAAZxG,EAAK,GAAmB,CAE/B,MAAM8G,EAAS9G,EAAK,GACpBwG,EAAOM,EAAO5B,EAAKsB,KACvB,KAC4B,iBAAZxG,EAAK,KAEjBwG,EAAOxG,EAAK,IAEhBV,KAAK6C,OAAM,KACP,MAAMoE,EAAWrB,EAAKsB,KAChBjD,EAAWiD,EACjBtB,EAAKsB,KAAOA,EACZlH,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,kBACNM,KACAqD,WACAhD,YACF,GAEV,CAIA2E,cAAchF,EAAIwD,GACdpH,KAAK6C,OAAM,KACPwE,OAAOC,QAAQF,GAAOhE,SAAQ,EAAEY,EAAcL,MAC1C3D,KAAK0I,uBAAuB9E,EAAII,EAAcL,EAAM,GACtD,GAEV,CAEAkF,mBAAmB3E,GACf,IAAKlE,KAAK8I,iBAAiB5E,GACvB,MAAM,IAAIc,MAAM,yCAA2Cd,EAEnE,CACA4E,iBAAiB5E,GACb,OAAOlE,KAAKgC,YAAYuC,IAAIL,EAChC,CAiBA6E,oBAAoB7E,GACZlE,KAAKgC,YAAYuC,IAAIL,KAIzBlE,KAAKgC,YAAYqE,IAAInC,EAAS,CAC1B0C,UAAW,IAAIjF,IACf2E,YAAa,IAAI3E,MAErB3B,KAAK6C,OAAM,KACP7C,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,wBACNY,WACF,IAEV,CAUA8E,oBAAoB9E,GAChBlE,KAAK6I,mBAAmB3E,GACxBlE,KAAKgC,YAAY0E,OAAOxC,GACxBlE,KAAK6C,OAAM,KACP7C,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,wBACNY,WACF,GAEV,CAmBAtB,QAAQD,EAAMuB,GACVlE,KAAK6C,OAAM,KACP7C,KAAK+I,oBAAoB7E,GAEzB,MAAM3B,EAAQ,GACR0G,EAAQ7D,MAAM8D,QAAQvG,GAAQA,EAAO,CAACA,GAC5C,KAAOsG,EAAMpI,QAAQ,CACjB,MAAMiE,EAAOmE,EAAME,QACnB5G,EAAMhC,KAAKuE,GACPA,EAAKsE,UACLH,EAAM1I,QAAQuE,EAAKsE,SAE3B,CACApJ,KAAKwC,SAASD,GAEdA,EAAMa,SAASiG,IACXA,EAAOD,UAAUhG,SAASuD,IACtB3G,KAAKsJ,UAAU3C,EAAM/C,GAAIyF,EAAOzF,GAAIM,EAAQ,GAC9C,GACJ,GAEV,CA0DAqF,SAASrF,GAEL,OADAlE,KAAK6I,mBAAmB3E,GACjBlE,KAAKwJ,cAAchG,QAAQsB,IAAU9E,KAAKyJ,UAAU3E,EAAKlB,GAAIM,IACxE,CAKAwF,YAAY9F,EAAIM,GACZlE,KAAKoE,mBAAmBR,GACxB5D,KAAK6I,mBAAmB3E,GACxB,MACMkF,EADOpJ,KAAKgC,YAAY+C,IAAIb,GACZoC,YAAYvB,IAAInB,GACtC,OAAOwB,MAAMC,KAAK+D,GAAY,GAClC,CAMAK,UAAU7F,EAAIM,GAIV,OAHAlE,KAAKoE,mBAAmBR,GACxB5D,KAAK6I,mBAAmB3E,GACXlE,KAAKgC,YAAY+C,IAAIb,GACtB0C,UAAU7B,IAAInB,IAAO,IACrC,CAIA+F,aAAa/F,EAAIM,GACb,MAAM0F,EAAY,GAClB,IACIP,EADAQ,EAAU7J,KAAKqE,QAAQT,GAE3B,KAAOyF,EAASrJ,KAAKyJ,UAAUI,EAAQjG,GAAIM,IACvC0F,EAAUrJ,KAAK8I,GACfQ,EAAUR,EAEd,OAAOO,CACX,CAQAN,UAAU1F,EAAIyF,EAAQnF,GAClBlE,KAAK6I,mBAAmB3E,GACxB,MAAMvB,EAAO3C,KAAKgC,YAAY+C,IAAIb,GAC5BY,EAAO9E,KAAKqE,QAAQT,GACpBkG,EAAYnH,EAAKiE,UAAU7B,IAAInB,GAC/BmG,EAAY/J,KAAKqE,QAAQgF,GAE/B1G,EAAKiE,UAAUP,IAAIzC,EAAImG,GAEnBD,GACAnH,EAAK2D,YAAYvB,IAAI+E,EAAUlG,KAAK8C,OAAO5B,GAE/C,IAAIsE,EAAWzG,EAAK2D,YAAYvB,IAAIgF,EAAUnG,IACzCwF,IACDA,EAAW,IAAItD,IACfnD,EAAK2D,YAAYD,IAAI0D,EAAUnG,GAAIwF,IAEvCA,EAASpB,IAAIlD,GACb9E,KAAK6C,OAAM,KACP7C,KAAKiC,QAAQ1B,KAAK,CACd+C,KAAM,uBACNY,UACAL,OAAQD,EACRoG,YAAaF,GAAWlG,GACxBO,YAAa4F,EAAUnG,IACzB,GAEV,CACAqG,QAAQrG,EAAId,EAAIoB,GAEZ,OAAO,OAAMlE,KAAKqE,QAAQT,GAAK,IAAIkC,IAAOhD,GADvBe,GAAW7D,KAAK0J,YAAY7F,EAAQK,IAE3D,CACAgG,QAAQtG,EAAId,EAAIoB,GAEZ,OAAO,OAAM,CAAClE,KAAKqE,QAAQT,IAAM,IAAIkC,IAAOhD,GADzBe,GAAW7D,KAAK0J,YAAY7F,EAAQK,IAE3D,CAKAsF,cACI,OAAOpE,MAAMC,KAAKrF,KAAK0B,QAAQyI,SACnC,CAIAC,cACI,OAAOhF,MAAMC,KAAKrF,KAAK4B,QAAQuI,SACnC,CACAE,IAAIzG,EAAId,EAAIoC,EAAY,OACpB,MAAMoF,EAAY,CACdC,GAAIvK,KAAK+F,gBAAgByE,KAAKxK,MAC9ByK,IAAKzK,KAAKyF,cAAc+E,KAAKxK,MAC7B0K,KAAM1K,KAAK2E,aAAa6F,KAAKxK,OAC/BkF,GACF,OAAO,OAAM,CAAClF,KAAKqE,QAAQT,IAAM,IAAIkC,IAAOhD,EAAIwH,EACpD,CACAK,IAAI/G,EAAId,EAAIoC,EAAY,OACpB,MAAMoF,EAAY,CACdC,GAAIvK,KAAK+F,gBAAgByE,KAAKxK,MAC9ByK,IAAKzK,KAAKyF,cAAc+E,KAAKxK,MAC7B0K,KAAM1K,KAAK2E,aAAa6F,KAAKxK,OAC/BkF,GACF,OAAO,OAAMlF,KAAKqE,QAAQT,GAAK,IAAIkC,IAAOhD,EAAIwH,EAClD,CACAM,QAEI,MAAMC,EAAW7K,KAAKwJ,cAAc7D,KAAKmF,IAC9B,IAAKA,EAAS5D,KAAM,IAAK4D,EAAQ5D,UAEtC6D,EAAW/K,KAAKoK,cAAczE,KAAKqF,IAC9B,IAAKA,EAAS9D,KAAM,IAAK8D,EAAQ9D,UAGtC+D,EAAW,IAAIxJ,EAAM,CACvBc,MAAOsI,EACPpI,MAAOsI,IAiBX,OAdA/K,KAAKgC,YAAYoB,SAAQ,EAAGwD,UAAWsE,EAAc5E,YAAa6E,GAAkBjH,KAChF,MAAM0C,EAAY,IAAIjF,IACtBuJ,EAAa9H,SAAQ,CAACiG,EAAQ+B,KAC1BxE,EAAUP,IAAI+E,EAAKH,EAAS5G,QAAQgF,EAAOzF,IAAI,IAEnD,MAAM0C,EAAc,IAAI3E,IACxBwJ,EAAe/H,SAAQ,CAACgG,EAAUgC,KAC9B9E,EAAYD,IAAI+E,EAAK,IAAItF,IAAIV,MAAMC,KAAK+D,GAAUzD,KAAK0F,GAAMJ,EAAS5G,QAAQgH,EAAEzH,OAAM,IAE1FqH,EAASjJ,YAAYqE,IAAInC,EAAS,CAC9B0C,UAAWA,EACXN,YAAaA,GACf,IAEC2E,CACX,CACAK,SACI,OAAOC,KAAKC,UAAU,CAClBjJ,MAAOvC,KAAKwJ,cACZ/G,MAAOzC,KAAKoK,eAGpB,E,8BCp7BG,SAASqB,EAAMC,EAAOC,EAAS7I,EAAIwH,GACtC,KAAOoB,EAAM7K,QAAQ,CACjB,MAAMiE,EAAO4G,EAAMvC,QAEnB,GADcrG,EAAGgC,GAEb,OAAO,EAEX6G,EAAQ3D,IAAIlD,EAAKlB,IACjB0G,EAAUxF,EAAKlB,IAAIR,SAASiI,IACnBM,EAAQpH,IAAI8G,EAAEzH,MACf+H,EAAQ3D,IAAIqD,EAAEzH,IACd8H,EAAMnL,KAAK8K,GACf,GAER,CACA,OAAO,CACX,CACO,SAASO,EAAM9G,EAAM6G,EAAS7I,EAAIwH,GAErC,GADcxH,EAAGgC,GAEb,OAAO,EAEX6G,EAAQ3D,IAAIlD,EAAKlB,IACjB,IAAK,MAAMyH,KAAKf,EAAUxF,EAAKlB,IAC3B,IAAK+H,EAAQpH,IAAI8G,EAAEzH,KACXgI,EAAMP,EAAGM,EAAS7I,EAAIwH,GACtB,OAAO,EAInB,OAAO,CACX,C,qFC9BIM,EAAQ,SAAUiB,GAClB,GAAmB,iBAARA,GAA4B,OAARA,EAC3B,OAAOA,EAEX,IAAIC,EACJ,IAAI,OAAQD,GAAM,CACdC,EAAM,GACN,IAAK,IAAI5K,EAAI,EAAG6K,EAAIF,EAAIhL,OAAQK,EAAI6K,EAAG7K,IACb,iBAAX2K,EAAI3K,IAA6B,MAAV2K,EAAI3K,GAClC4K,EAAI5K,GAAK0J,EAAMiB,EAAI3K,IAGnB4K,EAAI5K,GAAK2K,EAAI3K,EAGzB,MAGI,IAAK,IAAI8K,KADTF,EAAM,CAAC,EACOD,EACY,iBAAXA,EAAIG,IAA6B,MAAVH,EAAIG,GAClCF,EAAIE,GAAKpB,EAAMiB,EAAIG,IAGnBF,EAAIE,GAAKH,EAAIG,GAIzB,OAAOF,CACX,EACA,S,6DC7BA,iBAA0BnI,GACtB,OAAOyB,MAAM8D,QAAU9D,MAAM8D,QAAQvF,IAAS,OAAOA,EAAO,QAC/D,C,+CCAD,iBAA0BA,GACtB,MAAwB,mBAAVA,CACjB,C,+CCGD,QAPY,SAAUA,GAKlB,OAAOA,OACX,C,6DCCA,QAHe,SAAUA,GACrB,OAAO,OAAOA,EAAO,SACzB,C,+CCPA,iBAA0BA,GAOtB,IAAIL,SAAcK,EAClB,OAAkB,OAAVA,GAA2B,WAATL,GAA+B,aAATA,CACnD,C,6DCRD,iBAA0B2I,GACtB,OAAO,OAAOA,EAAK,SACtB,C,+CCHD,IAAIC,EAAW,CAAC,EAAEA,SAElB,QADa,SAAUvI,EAAOL,GAAQ,OAAO4I,EAASC,KAAKxI,KAAW,WAAaL,EAAO,GAAK,C,gDCI/F,MAAM8I,EAAcC,OAAO,iBACrBC,EAAiBD,OAAO,oBACxBE,EAAeF,OAAO,wBACtBG,EAAYH,OAAO,qBACnBI,EAAcJ,OAAO,kBACrBK,EAAYC,GAAwB,iBAARA,GAA4B,OAARA,GAAgC,mBAARA,EAgDxEC,EAAmB,IAAIjL,IAAI,CAC7B,CAAC,QA7CwB,CACzBkL,UAAYF,GAAQD,EAASC,IAAQA,EAAIP,GACzCU,UAAUjB,GACN,MAAM,MAAEkB,EAAK,MAAEC,GAAU,IAAIC,eAE7B,OADAC,EAAOrB,EAAKkB,GACL,CAACC,EAAO,CAACA,GACpB,EACAG,YAAYC,IACRA,EAAKC,QAiJFC,EAhJSF,EAgJO,GADTvH,cA1Gd,CAAC,QA/BwB,CACzBgH,UAAYlJ,GAAU+I,EAAS/I,IAAU8I,KAAe9I,EACxDmJ,WAAU,MAAEnJ,IACR,IAAI4J,EAcJ,OAZIA,EADA5J,aAAiBqB,MACJ,CACTwI,SAAS,EACT7J,MAAO,CACH8J,QAAS9J,EAAM8J,QACfC,KAAM/J,EAAM+J,KACZzE,MAAOtF,EAAMsF,QAKR,CAAEuE,SAAS,EAAO7J,SAE5B,CAAC4J,EAAY,GACxB,EACAJ,YAAYI,GACR,GAAIA,EAAWC,QACX,MAAMnG,OAAOsG,OAAO,IAAI3I,MAAMuI,EAAW5J,MAAM8J,SAAUF,EAAW5J,OAExE,MAAM4J,EAAW5J,KACrB,MAoBJ,SAASuJ,EAAOrB,EAAK+B,EAAKC,WAAYC,EAAiB,CAAC,MACpDF,EAAGG,iBAAiB,WAAW,SAAS1N,EAAS2N,GAC7C,IAAKA,IAAOA,EAAG9G,KACX,OAEJ,IAhBR,SAAyB4G,EAAgBG,GACrC,IAAK,MAAMC,KAAiBJ,EAAgB,CACxC,GAAIG,IAAWC,GAAmC,MAAlBA,EAC5B,OAAO,EAEX,GAAIA,aAAyBC,QAAUD,EAAcE,KAAKH,GACtD,OAAO,CAEf,CACA,OAAO,CACX,CAMaI,CAAgBP,EAAgBE,EAAGC,QAEpC,YADAK,QAAQC,KAAK,mBAAmBP,EAAGC,6BAGvC,MAAM,GAAErK,EAAE,KAAEN,EAAI,KAAEkL,GAASnH,OAAOsG,OAAO,CAAEa,KAAM,IAAMR,EAAG9G,MACpDuH,GAAgBT,EAAG9G,KAAKuH,cAAgB,IAAI9I,IAAI+I,GACtD,IAAIC,EACJ,IACI,MAAMtF,EAASmF,EAAKI,MAAM,GAAI,GAAGC,QAAO,CAAChD,EAAKiD,IAASjD,EAAIiD,IAAOjD,GAC5DkD,EAAWP,EAAKK,QAAO,CAAChD,EAAKiD,IAASjD,EAAIiD,IAAOjD,GACvD,OAAQvI,GACJ,IAAK,MAEGqL,EAAcI,EAElB,MACJ,IAAK,MAEG1F,EAAOmF,EAAKI,OAAO,GAAG,IAAMF,EAAcV,EAAG9G,KAAKvD,OAClDgL,GAAc,EAElB,MACJ,IAAK,QAEGA,EAAcI,EAAS1N,MAAMgI,EAAQoF,GAEzC,MACJ,IAAK,YAGGE,EA6KxB,SAAe9C,GACX,OAAOxE,OAAOsG,OAAO9B,EAAK,CAAE,CAACO,IAAc,GAC/C,CA/KsC4C,CADA,IAAID,KAAYN,IAGlC,MACJ,IAAK,WACD,CACI,MAAM,MAAE1B,EAAK,MAAEC,GAAU,IAAIC,eAC7BC,EAAOrB,EAAKmB,GACZ2B,EAkKxB,SAAkB9C,EAAKoD,GAEnB,OADAC,EAAc7I,IAAIwF,EAAKoD,GAChBpD,CACX,CArKsCsD,CAASpC,EAAO,CAACA,GACnC,CACA,MACJ,IAAK,UAEG4B,OAAcS,EAElB,MACJ,QACI,OAEZ,CACA,MAAOzL,GACHgL,EAAc,CAAEhL,QAAO,CAAC8I,GAAc,EAC1C,CACA4C,QAAQC,QAAQX,GACXY,OAAO5L,IACD,CAAEA,QAAO,CAAC8I,GAAc,MAE9B+C,MAAMb,IACP,MAAOc,EAAWC,GAAiBC,EAAYhB,GAC/Cf,EAAGgC,YAAYvI,OAAOsG,OAAOtG,OAAOsG,OAAO,CAAC,EAAG8B,GAAY,CAAE7L,OAAO8L,GACvD,YAATpM,IAEAsK,EAAGiC,oBAAoB,UAAWxP,GAClCyP,EAAclC,GACVpB,KAAaX,GAAiC,mBAAnBA,EAAIW,IAC/BX,EAAIW,KAEZ,IAEC+C,OAAOQ,IAER,MAAON,EAAWC,GAAiBC,EAAY,CAC3ChM,MAAO,IAAIqM,UAAU,+BACrB,CAACvD,GAAc,IAEnBmB,EAAGgC,YAAYvI,OAAOsG,OAAOtG,OAAOsG,OAAO,CAAC,EAAG8B,GAAY,CAAE7L,OAAO8L,EAAc,GAE1F,IACI9B,EAAGP,OACHO,EAAGP,OAEX,CAIA,SAASyC,EAAcG,IAHvB,SAAuBA,GACnB,MAAqC,gBAA9BA,EAAS7N,YAAYsL,IAChC,EAEQwC,CAAcD,IACdA,EAASE,OACjB,CAIA,SAASC,EAAqBC,GAC1B,GAAIA,EACA,MAAM,IAAIrL,MAAM,6CAExB,CACA,SAASsL,EAAgB1C,GACrB,OAAO2C,EAAuB3C,EAAI,CAC9BtK,KAAM,YACPkM,MAAK,KACJM,EAAclC,EAAG,GAEzB,CACA,MAAM4C,EAAe,IAAIC,QACnBC,EAAkB,yBAA0B7C,YAC9C,IAAI8C,sBAAsB/C,IACtB,MAAMgD,GAAYJ,EAAazL,IAAI6I,IAAO,GAAK,EAC/C4C,EAAanK,IAAIuH,EAAIgD,GACJ,IAAbA,GACAN,EAAgB1C,EACpB,IAcR,SAASN,EAAYM,EAAIY,EAAO,GAAI3I,EAAS,WAAc,GACvD,IAAIgL,GAAkB,EACtB,MAAM7B,EAAQ,IAAI8B,MAAMjL,EAAQ,CAC5Bd,IAAIgM,EAASjC,GAET,GADAsB,EAAqBS,GACjB/B,IAASvC,EACT,MAAO,MAXvB,SAAyByC,GACjB0B,GACAA,EAAgBM,WAAWhC,EAEnC,CAQoBiC,CAAgBjC,GAChBsB,EAAgB1C,GAChBiD,GAAkB,CAAI,EAG9B,GAAa,SAAT/B,EAAiB,CACjB,GAAoB,IAAhBN,EAAK3N,OACL,MAAO,CAAE2O,KAAM,IAAMR,GAEzB,MAAMkC,EAAIX,EAAuB3C,EAAI,CACjCtK,KAAM,MACNkL,KAAMA,EAAK7I,KAAKwL,GAAMA,EAAEjF,eACzBsD,KAAKd,GACR,OAAOwC,EAAE1B,KAAKhF,KAAK0G,EACvB,CACA,OAAO5D,EAAYM,EAAI,IAAIY,EAAMM,GACrC,EACAzI,IAAI0K,EAASjC,EAAMC,GACfqB,EAAqBS,GAGrB,MAAOlN,EAAO+L,GAAiBC,EAAYZ,GAC3C,OAAOwB,EAAuB3C,EAAI,CAC9BtK,KAAM,MACNkL,KAAM,IAAIA,EAAMM,GAAMnJ,KAAKwL,GAAMA,EAAEjF,aACnCvI,SACD+L,GAAeF,KAAKd,EAC3B,EACArN,MAAM0P,EAASK,EAAUC,GACrBjB,EAAqBS,GACrB,MAAMS,EAAO9C,EAAKA,EAAK3N,OAAS,GAChC,GAAIyQ,IAAShF,EACT,OAAOiE,EAAuB3C,EAAI,CAC9BtK,KAAM,aACPkM,KAAKd,GAGZ,GAAa,SAAT4C,EACA,OAAOhE,EAAYM,EAAIY,EAAKI,MAAM,GAAI,IAE1C,MAAOH,EAAciB,GAAiB6B,EAAiBF,GACvD,OAAOd,EAAuB3C,EAAI,CAC9BtK,KAAM,QACNkL,KAAMA,EAAK7I,KAAKwL,GAAMA,EAAEjF,aACxBuC,gBACDiB,GAAeF,KAAKd,EAC3B,EACA8C,UAAUT,EAASM,GACfjB,EAAqBS,GACrB,MAAOpC,EAAciB,GAAiB6B,EAAiBF,GACvD,OAAOd,EAAuB3C,EAAI,CAC9BtK,KAAM,YACNkL,KAAMA,EAAK7I,KAAKwL,GAAMA,EAAEjF,aACxBuC,gBACDiB,GAAeF,KAAKd,EAC3B,IAGJ,OA7EJ,SAAuBM,EAAOpB,GAC1B,MAAMgD,GAAYJ,EAAazL,IAAI6I,IAAO,GAAK,EAC/C4C,EAAanK,IAAIuH,EAAIgD,GACjBF,GACAA,EAAgBe,SAASzC,EAAOpB,EAAIoB,EAE5C,CAsEI0C,CAAc1C,EAAOpB,GACdoB,CACX,CAIA,SAASuC,EAAiB9C,GACtB,MAAMkD,EAAYlD,EAAa9I,IAAIgK,GACnC,MAAO,CAACgC,EAAUhM,KAAKiM,GAAMA,EAAE,MALnBC,EAK+BF,EAAUhM,KAAKiM,GAAMA,EAAE,KAJ3DxM,MAAMlF,UAAU4R,OAAOzQ,MAAM,GAAIwQ,KAD5C,IAAgBA,CAMhB,CACA,MAAM3C,EAAgB,IAAIuB,QAe1B,SAASd,EAAYhM,GACjB,IAAK,MAAO+J,EAAMqE,KAAYnF,EAC1B,GAAImF,EAAQlF,UAAUlJ,GAAQ,CAC1B,MAAOqO,EAAiBtC,GAAiBqC,EAAQjF,UAAUnJ,GAC3D,MAAO,CACH,CACIL,KAAM,UACNoK,OACA/J,MAAOqO,GAEXtC,EAER,CAEJ,MAAO,CACH,CACIpM,KAAM,MACNK,SAEJuL,EAAcnK,IAAIpB,IAAU,GAEpC,CACA,SAAS+K,EAAc/K,GACnB,OAAQA,EAAML,MACV,IAAK,UACD,OAAOsJ,EAAiB7H,IAAIpB,EAAM+J,MAAMP,YAAYxJ,EAAMA,OAC9D,IAAK,MACD,OAAOA,EAAMA,MAEzB,CACA,SAAS4M,EAAuB3C,EAAIqE,EAAKhD,GACrC,OAAO,IAAII,SAASC,IAChB,MAAM1L,EAeH,IAAIwB,MAAM,GACZ8M,KAAK,GACLvM,KAAI,IAAMwM,KAAKC,MAAMD,KAAKE,SAAWC,OAAOC,kBAAkBrG,SAAS,MACvEsG,KAAK,KAjBN5E,EAAGG,iBAAiB,WAAW,SAAShC,EAAEiC,GACjCA,EAAG9G,MAAS8G,EAAG9G,KAAKtD,IAAMoK,EAAG9G,KAAKtD,KAAOA,IAG9CgK,EAAGiC,oBAAoB,UAAW9D,GAClCuD,EAAQtB,EAAG9G,MACf,IACI0G,EAAGP,OACHO,EAAGP,QAEPO,EAAGgC,YAAYvI,OAAOsG,OAAO,CAAE/J,MAAMqO,GAAMhD,EAAU,GAE7D,C,+CChVA,IAAIwD,EAAO,CAAC9O,MAAO,QAEnB,SAAS+O,IACP,IAAK,IAAyCC,EAArCzR,EAAI,EAAGmK,EAAIzK,UAAUC,OAAQ+R,EAAI,CAAC,EAAM1R,EAAImK,IAAKnK,EAAG,CAC3D,KAAMyR,EAAI/R,UAAUM,GAAK,KAAQyR,KAAKC,GAAM,QAAQxE,KAAKuE,GAAI,MAAM,IAAI3N,MAAM,iBAAmB2N,GAChGC,EAAED,GAAK,EACT,CACA,OAAO,IAAIE,EAASD,EACtB,CAEA,SAASC,EAASD,GAChB5S,KAAK4S,EAAIA,CACX,CAoDA,SAAS7N,EAAIzB,EAAMoK,GACjB,IAAK,IAA4BoF,EAAxB5R,EAAI,EAAGmK,EAAI/H,EAAKzC,OAAWK,EAAImK,IAAKnK,EAC3C,IAAK4R,EAAIxP,EAAKpC,IAAIwM,OAASA,EACzB,OAAOoF,EAAEnP,KAGf,CAEA,SAAS0C,EAAI/C,EAAMoK,EAAMrN,GACvB,IAAK,IAAIa,EAAI,EAAGmK,EAAI/H,EAAKzC,OAAQK,EAAImK,IAAKnK,EACxC,GAAIoC,EAAKpC,GAAGwM,OAASA,EAAM,CACzBpK,EAAKpC,GAAKuR,EAAMnP,EAAOA,EAAKsL,MAAM,EAAG1N,GAAG4Q,OAAOxO,EAAKsL,MAAM1N,EAAI,IAC9D,KACF,CAGF,OADgB,MAAZb,GAAkBiD,EAAK/C,KAAK,CAACmN,KAAMA,EAAM/J,MAAOtD,IAC7CiD,CACT,CA1DAuP,EAAS3S,UAAYwS,EAASxS,UAAY,CACxCkC,YAAayQ,EACb1S,GAAI,SAAS4S,EAAU1S,GACrB,IAEIsS,EAd2BK,EAY3BJ,EAAI5S,KAAK4S,EACTK,GAb2BD,EAaOJ,GAAfG,EAAW,IAZnBG,OAAOC,MAAM,SAASxN,KAAI,SAASgN,GAClD,IAAIjF,EAAO,GAAIxM,EAAIyR,EAAES,QAAQ,KAE7B,GADIlS,GAAK,IAAGwM,EAAOiF,EAAE/D,MAAM1N,EAAI,GAAIyR,EAAIA,EAAE/D,MAAM,EAAG1N,IAC9CyR,IAAMK,EAAMK,eAAeV,GAAI,MAAM,IAAI3N,MAAM,iBAAmB2N,GACtE,MAAO,CAACrP,KAAMqP,EAAGjF,KAAMA,EACzB,KASMxM,GAAK,EACLmK,EAAI4H,EAAEpS,OAGV,KAAID,UAAUC,OAAS,GAAvB,CAOA,GAAgB,MAAZR,GAAwC,mBAAbA,EAAyB,MAAM,IAAI2E,MAAM,qBAAuB3E,GAC/F,OAASa,EAAImK,GACX,GAAIsH,GAAKI,EAAWE,EAAE/R,IAAIoC,KAAMsP,EAAED,GAAKtM,EAAIuM,EAAED,GAAII,EAASrF,KAAMrN,QAC3D,GAAgB,MAAZA,EAAkB,IAAKsS,KAAKC,EAAGA,EAAED,GAAKtM,EAAIuM,EAAED,GAAII,EAASrF,KAAM,MAG1E,OAAO1N,IAVP,CAFE,OAASkB,EAAImK,OAAQsH,GAAKI,EAAWE,EAAE/R,IAAIoC,QAAUqP,EAAI5N,EAAI6N,EAAED,GAAII,EAASrF,OAAQ,OAAOiF,CAa/F,EACAW,KAAM,WACJ,IAAIA,EAAO,CAAC,EAAGV,EAAI5S,KAAK4S,EACxB,IAAK,IAAID,KAAKC,EAAGU,EAAKX,GAAKC,EAAED,GAAG/D,QAChC,OAAO,IAAIiE,EAASS,EACtB,EACAnH,KAAM,SAAS7I,EAAMiQ,GACnB,IAAKlI,EAAIzK,UAAUC,OAAS,GAAK,EAAG,IAAK,IAAgCwK,EAAGsH,EAA/BjS,EAAO,IAAI0E,MAAMiG,GAAInK,EAAI,EAASA,EAAImK,IAAKnK,EAAGR,EAAKQ,GAAKN,UAAUM,EAAI,GACnH,IAAKlB,KAAK4S,EAAES,eAAe/P,GAAO,MAAM,IAAI0B,MAAM,iBAAmB1B,GACrE,IAAuBpC,EAAI,EAAGmK,GAAzBsH,EAAI3S,KAAK4S,EAAEtP,IAAoBzC,OAAQK,EAAImK,IAAKnK,EAAGyR,EAAEzR,GAAGyC,MAAMtC,MAAMkS,EAAM7S,EACjF,EACAW,MAAO,SAASiC,EAAMiQ,EAAM7S,GAC1B,IAAKV,KAAK4S,EAAES,eAAe/P,GAAO,MAAM,IAAI0B,MAAM,iBAAmB1B,GACrE,IAAK,IAAIqP,EAAI3S,KAAK4S,EAAEtP,GAAOpC,EAAI,EAAGmK,EAAIsH,EAAE9R,OAAQK,EAAImK,IAAKnK,EAAGyR,EAAEzR,GAAGyC,MAAMtC,MAAMkS,EAAM7S,EACrF,GAsBF,S,8BCnFe,WAAS8S,EAAGC,GACzB,IAAIlR,EAAOmR,EAAW,EAKtB,SAASC,IACP,IAAIzS,EAEA4D,EADAuG,EAAI9I,EAAM1B,OAEV+S,EAAK,EACLC,EAAK,EAET,IAAK3S,EAAI,EAAGA,EAAImK,IAAKnK,EACF0S,IAAjB9O,EAAOvC,EAAMrB,IAAesS,EAAGK,GAAM/O,EAAK2O,EAG5C,IAAKG,GAAMA,EAAKvI,EAAImI,GAAKE,EAAUG,GAAMA,EAAKxI,EAAIoI,GAAKC,EAAUxS,EAAI,EAAGA,EAAImK,IAAKnK,GAC/E4D,EAAOvC,EAAMrB,IAASsS,GAAKI,EAAI9O,EAAK2O,GAAKI,CAE7C,CAkBA,OAnCS,MAALL,IAAWA,EAAI,GACV,MAALC,IAAWA,EAAI,GAkBnBE,EAAMG,WAAa,SAASlB,GAC1BrQ,EAAQqQ,CACV,EAEAe,EAAMH,EAAI,SAASZ,GACjB,OAAOhS,UAAUC,QAAU2S,GAAKZ,EAAGe,GAASH,CAC9C,EAEAG,EAAMF,EAAI,SAASb,GACjB,OAAOhS,UAAUC,QAAU4S,GAAKb,EAAGe,GAASF,CAC9C,EAEAE,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,GAAYd,EAAGe,GAASD,CACrD,EAEOC,CACT,C,gGCnCA,SAASH,EAAEO,GACT,OAAOA,EAAEP,EAAIO,EAAEC,EACjB,CAEA,SAASP,EAAEM,GACT,OAAOA,EAAEN,EAAIM,EAAEE,EACjB,CAEe,WAASC,GACtB,IAAI3R,EACA4R,EACA9B,EACAqB,EAAW,EACXU,EAAa,EAIjB,SAAST,IASP,IARA,IAAIzS,EACAyB,EACAmC,EACAuP,EACAC,EACAC,EACAC,EANGnJ,EAAI9I,EAAM1B,OAQRmL,EAAI,EAAGA,EAAIoI,IAAcpI,EAEhC,IADArJ,GAAO,OAASJ,EAAOiR,EAAGC,GAAGgB,WAAWC,GACnCxT,EAAI,EAAGA,EAAImK,IAAKnK,EACnB4D,EAAOvC,EAAMrB,GACbqT,EAAKJ,EAAMrP,EAAK6P,OAAQH,EAAMD,EAAKA,EACnCF,EAAKvP,EAAK0O,EAAI1O,EAAKkP,GACnBM,EAAKxP,EAAK2O,EAAI3O,EAAKmP,GACnBtR,EAAKiS,MAAMvT,GAIf,SAASA,EAAMwT,EAAMC,EAAIC,EAAIC,EAAIC,GAC/B,IAAI/N,EAAO2N,EAAK3N,KAAMgO,EAAKL,EAAK3D,EAAGA,EAAIqD,EAAKW,EAC5C,IAAIhO,EAiBJ,OAAO4N,EAAKT,EAAKnD,GAAK8D,EAAKX,EAAKnD,GAAK6D,EAAKT,EAAKpD,GAAK+D,EAAKX,EAAKpD,EAhB5D,GAAIhK,EAAKyN,MAAQ7P,EAAK6P,MAAO,CAC3B,IAAInB,EAAIa,EAAKnN,EAAKsM,EAAItM,EAAK8M,GACvBP,EAAIa,EAAKpN,EAAKuM,EAAIvM,EAAK+M,GACvBlI,EAAIyH,EAAIA,EAAIC,EAAIA,EAChB1H,EAAImF,EAAIA,IACA,IAANsC,IAA6BzH,IAApByH,GAAI,OAAOnB,IAAkBmB,GAChC,IAANC,IAA6B1H,IAApB0H,GAAI,OAAOpB,IAAkBoB,GAC1C1H,GAAKmF,GAAKnF,EAAIoG,KAAKgD,KAAKpJ,KAAOA,EAAI2H,EACnC5O,EAAKkP,KAAOR,GAAKzH,IAAMmF,GAAKgE,GAAMA,IAAOV,EAAMU,IAC/CpQ,EAAKmP,KAAOR,GAAK1H,GAAKmF,EACtBhK,EAAK8M,IAAMR,GAAKtC,EAAI,EAAIA,GACxBhK,EAAK+M,IAAMR,EAAIvC,EAEnB,CAIJ,CACF,CAEA,SAASwD,EAAQG,GACf,GAAIA,EAAK3N,KAAM,OAAO2N,EAAK3D,EAAIiD,EAAMU,EAAK3N,KAAKyN,OAC/C,IAAK,IAAIzT,EAAI2T,EAAK3D,EAAI,EAAGhQ,EAAI,IAAKA,EAC5B2T,EAAK3T,IAAM2T,EAAK3T,GAAGgQ,EAAI2D,EAAK3D,IAC9B2D,EAAK3D,EAAI2D,EAAK3T,GAAGgQ,EAGvB,CAEA,SAAS4C,IACP,GAAKvR,EAAL,CACA,IAAIrB,EAAqB4D,EAAlBuG,EAAI9I,EAAM1B,OAEjB,IADAsT,EAAQ,IAAI/O,MAAMiG,GACbnK,EAAI,EAAGA,EAAImK,IAAKnK,EAAG4D,EAAOvC,EAAMrB,GAAIiT,EAAMrP,EAAK6P,QAAUT,EAAOpP,EAAM5D,EAAGqB,EAH5D,CAIpB,CAoBA,MA/EsB,mBAAX2R,IAAuBA,GAAS,OAAmB,MAAVA,EAAiB,GAAKA,IA6D1EP,EAAMG,WAAa,SAASsB,EAAQC,GAClC9S,EAAQ6S,EACR/C,EAASgD,EACTvB,GACF,EAEAH,EAAMS,WAAa,SAASxB,GAC1B,OAAOhS,UAAUC,QAAUuT,GAAcxB,EAAGe,GAASS,CACvD,EAEAT,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,GAAYd,EAAGe,GAASD,CACrD,EAEAC,EAAMO,OAAS,SAAStB,GACtB,OAAOhS,UAAUC,QAAUqT,EAAsB,mBAANtB,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASO,CACzG,EAEOP,CACT,C,8BCnGe,WAASH,GACtB,OAAO,WACL,OAAOA,CACT,CACF,C,8CCJe,WAASnB,GACtB,OAA0B,MAAlBA,IAAW,GACrB,C,+DCDA,MAAMiD,EAAI,QACJxC,EAAI,WACJyC,EAAI,WAEK,aACb,IAAIC,EAAI,EACR,MAAO,KAAOA,GAAKF,EAAIE,EAAI1C,GAAKyC,GAAKA,CACvC,C,uECLA,SAASZ,EAAMZ,GACb,OAAOA,EAAEY,KACX,CAEA,SAAS5Q,EAAK0R,EAAU5R,GACtB,IAAIiB,EAAO2Q,EAAS1Q,IAAIlB,GACxB,IAAKiB,EAAM,MAAM,IAAIE,MAAM,mBAAqBnB,GAChD,OAAOiB,CACT,CAEe,WAAS4Q,GACtB,IAEIC,EAEAC,EACArT,EACAsT,EACAC,EACAzD,EARAzO,EAAK+Q,EACLjB,EAYJ,SAAyBqC,GACvB,OAAO,EAAI5D,KAAK6D,IAAIH,EAAME,EAAK9P,OAAO0O,OAAQkB,EAAME,EAAKlQ,OAAO8O,OAClE,EAZIsB,GAAW,OAAS,IAMpB7B,EAAa,EAQjB,SAAST,EAAMuC,GACb,IAAK,IAAIlK,EAAI,EAAGX,EAAIqK,EAAM7U,OAAQmL,EAAIoI,IAAcpI,EAClD,IAAK,IAAW+J,EAAM9P,EAAQJ,EAAQ2N,EAAGC,EAAG1H,EAAGoK,EAAtCjV,EAAI,EAAqCA,EAAImK,IAAKnK,EACxC+E,GAAjB8P,EAAOL,EAAMxU,IAAkB+E,OAC/BuN,GADuC3N,EAASkQ,EAAKlQ,QAC1C2N,EAAI3N,EAAOmO,GAAK/N,EAAOuN,EAAIvN,EAAO+N,KAAM,OAAO3B,GAC1DoB,EAAI5N,EAAO4N,EAAI5N,EAAOoO,GAAKhO,EAAOwN,EAAIxN,EAAOgO,KAAM,OAAO5B,GAG1DmB,GADAzH,IADAA,EAAIoG,KAAKgD,KAAK3B,EAAIA,EAAIC,EAAIA,IACjBmC,EAAU1U,IAAM6K,EAAImK,EAAQP,EAAUzU,GACvCuS,GAAK1H,EACblG,EAAOmO,IAAMR,GAAK2C,EAAIL,EAAK5U,IAC3B2E,EAAOoO,IAAMR,EAAI0C,EACjBlQ,EAAO+N,IAAMR,GAAK2C,EAAI,EAAIA,GAC1BlQ,EAAOgO,IAAMR,EAAI0C,CAGvB,CAEA,SAASrC,IACP,GAAKvR,EAAL,CAEA,IAAIrB,EAIA6U,EAHA1K,EAAI9I,EAAM1B,OACV0U,EAAIG,EAAM7U,OACV4U,EAAW,IAAI9T,IAAIY,EAAMoD,KAAI,CAACoO,EAAG7S,IAAM,CAAC0C,EAAGmQ,EAAG7S,EAAGqB,GAAQwR,MAG7D,IAAK7S,EAAI,EAAG2U,EAAQ,IAAIzQ,MAAMiG,GAAInK,EAAIqU,IAAKrU,GACzC6U,EAAOL,EAAMxU,IAASyT,MAAQzT,EACH,iBAAhB6U,EAAK9P,SAAqB8P,EAAK9P,OAASlC,EAAK0R,EAAUM,EAAK9P,SAC5C,iBAAhB8P,EAAKlQ,SAAqBkQ,EAAKlQ,OAAS9B,EAAK0R,EAAUM,EAAKlQ,SACvEgQ,EAAME,EAAK9P,OAAO0O,QAAUkB,EAAME,EAAK9P,OAAO0O,QAAU,GAAK,EAC7DkB,EAAME,EAAKlQ,OAAO8O,QAAUkB,EAAME,EAAKlQ,OAAO8O,QAAU,GAAK,EAG/D,IAAKzT,EAAI,EAAG4U,EAAO,IAAI1Q,MAAMmQ,GAAIrU,EAAIqU,IAAKrU,EACxC6U,EAAOL,EAAMxU,GAAI4U,EAAK5U,GAAK2U,EAAME,EAAK9P,OAAO0O,QAAUkB,EAAME,EAAK9P,OAAO0O,OAASkB,EAAME,EAAKlQ,OAAO8O,QAGtGgB,EAAY,IAAIvQ,MAAMmQ,GAAIa,IAC1BR,EAAY,IAAIxQ,MAAMmQ,GAAIc,GArBR,CAsBpB,CAEA,SAASD,IACP,GAAK7T,EAEL,IAAK,IAAIrB,EAAI,EAAGmK,EAAIqK,EAAM7U,OAAQK,EAAImK,IAAKnK,EACzCyU,EAAUzU,IAAMwS,EAASgC,EAAMxU,GAAIA,EAAGwU,EAE1C,CAEA,SAASW,IACP,GAAK9T,EAEL,IAAK,IAAIrB,EAAI,EAAGmK,EAAIqK,EAAM7U,OAAQK,EAAImK,IAAKnK,EACzC0U,EAAU1U,IAAM+U,EAASP,EAAMxU,GAAIA,EAAGwU,EAE1C,CA4BA,OA1Fa,MAATA,IAAeA,EAAQ,IAgE3B/B,EAAMG,WAAa,SAASsB,EAAQC,GAClC9S,EAAQ6S,EACR/C,EAASgD,EACTvB,GACF,EAEAH,EAAM+B,MAAQ,SAAS9C,GACrB,OAAOhS,UAAUC,QAAU6U,EAAQ9C,EAAGkB,IAAcH,GAAS+B,CAC/D,EAEA/B,EAAM/P,GAAK,SAASgP,GAClB,OAAOhS,UAAUC,QAAU+C,EAAKgP,EAAGe,GAAS/P,CAC9C,EAEA+P,EAAMS,WAAa,SAASxB,GAC1B,OAAOhS,UAAUC,QAAUuT,GAAcxB,EAAGe,GAASS,CACvD,EAEAT,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,EAAwB,mBAANd,EAAmBA,GAAI,QAAUA,GAAIwD,IAAsBzC,GAASD,CACnH,EAEAC,EAAMsC,SAAW,SAASrD,GACxB,OAAOhS,UAAUC,QAAUoV,EAAwB,mBAANrD,EAAmBA,GAAI,QAAUA,GAAIyD,IAAsB1C,GAASsC,CACnH,EAEOtC,CACT,C,0FC/Ge,aACb,IAAIpR,EACAuC,EACAuN,EACA6D,EAEAP,EADAjC,GAAW,QAAU,IAErB4C,EAAe,EACfC,EAAeC,IACfC,EAAS,IAEb,SAAS9C,EAAMf,GACb,IAAI1R,EAAGmK,EAAI9I,EAAM1B,OAAQ8B,GAAO,OAASJ,EAAO,EAAAiR,EAAG,EAAAC,GAAGgB,WAAWiC,GACjE,IAAKR,EAAQtD,EAAG1R,EAAI,EAAGA,EAAImK,IAAKnK,EAAG4D,EAAOvC,EAAMrB,GAAIyB,EAAKiS,MAAMvT,EACjE,CAEA,SAASyS,IACP,GAAKvR,EAAL,CACA,IAAIrB,EAAqB4D,EAAlBuG,EAAI9I,EAAM1B,OAEjB,IADA8U,EAAY,IAAIvQ,MAAMiG,GACjBnK,EAAI,EAAGA,EAAImK,IAAKnK,EAAG4D,EAAOvC,EAAMrB,GAAIyU,EAAU7Q,EAAK6P,QAAUjB,EAAS5O,EAAM5D,EAAGqB,EAHlE,CAIpB,CAEA,SAASmU,EAAW7B,GAClB,IAAkB8B,EAAG7D,EAAeU,EAAGC,EAAGvS,EAAtCwS,EAAW,EAASkD,EAAS,EAGjC,GAAI/B,EAAKhU,OAAQ,CACf,IAAK2S,EAAIC,EAAIvS,EAAI,EAAGA,EAAI,IAAKA,GACtByV,EAAI9B,EAAK3T,MAAQ4R,EAAIX,KAAK0E,IAAIF,EAAEhT,UACnC+P,GAAYiD,EAAEhT,MAAOiT,GAAU9D,EAAGU,GAAKV,EAAI6D,EAAEnD,EAAGC,GAAKX,EAAI6D,EAAElD,GAG/DoB,EAAKrB,EAAIA,EAAIoD,EACb/B,EAAKpB,EAAIA,EAAImD,CACf,KAGK,EACHD,EAAI9B,GACFrB,EAAImD,EAAEzP,KAAKsM,EACbmD,EAAElD,EAAIkD,EAAEzP,KAAKuM,EACb,GAAGC,GAAYiC,EAAUgB,EAAEzP,KAAKyN,aACzBgC,EAAIA,EAAEG,KACf,CAEAjC,EAAKlR,MAAQ+P,CACf,CAEA,SAASrS,EAAMwT,EAAMG,EAAIpC,EAAGmE,GAC1B,IAAKlC,EAAKlR,MAAO,OAAO,EAExB,IAAI6P,EAAIqB,EAAKrB,EAAI1O,EAAK0O,EAClBC,EAAIoB,EAAKpB,EAAI3O,EAAK2O,EAClBuD,EAAID,EAAK/B,EACTjJ,EAAIyH,EAAIA,EAAIC,EAAIA,EAIpB,GAAIuD,EAAIA,EAAIP,EAAS1K,EAQnB,OAPIA,EAAIwK,IACI,IAAN/C,IAA6BzH,IAApByH,GAAI,OAAOnB,IAAkBmB,GAChC,IAANC,IAA6B1H,IAApB0H,GAAI,OAAOpB,IAAkBoB,GACtC1H,EAAIuK,IAAcvK,EAAIoG,KAAKgD,KAAKmB,EAAevK,IACnDjH,EAAKkP,IAAMR,EAAIqB,EAAKlR,MAAQuS,EAAQnK,EACpCjH,EAAKmP,IAAMR,EAAIoB,EAAKlR,MAAQuS,EAAQnK,IAE/B,EAIJ,KAAI8I,EAAKhU,QAAUkL,GAAKwK,GAAxB,EAGD1B,EAAK3N,OAASpC,GAAQ+P,EAAKiC,QACnB,IAANtD,IAA6BzH,IAApByH,GAAI,OAAOnB,IAAkBmB,GAChC,IAANC,IAA6B1H,IAApB0H,GAAI,OAAOpB,IAAkBoB,GACtC1H,EAAIuK,IAAcvK,EAAIoG,KAAKgD,KAAKmB,EAAevK,KAGrD,GAAO8I,EAAK3N,OAASpC,IACnBkS,EAAIrB,EAAUd,EAAK3N,KAAKyN,OAASuB,EAAQnK,EACzCjH,EAAKkP,IAAMR,EAAIwD,EACflS,EAAKmP,IAAMR,EAAIuD,SACRnC,EAAOA,EAAKiC,KAb4B,CAcnD,CAwBA,OAtBAnD,EAAMG,WAAa,SAASsB,EAAQC,GAClC9S,EAAQ6S,EACR/C,EAASgD,EACTvB,GACF,EAEAH,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,EAAwB,mBAANd,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASD,CAC3G,EAEAC,EAAMsD,YAAc,SAASrE,GAC3B,OAAOhS,UAAUC,QAAUyV,EAAe1D,EAAIA,EAAGe,GAASxB,KAAKgD,KAAKmB,EACtE,EAEA3C,EAAMuD,YAAc,SAAStE,GAC3B,OAAOhS,UAAUC,QAAU0V,EAAe3D,EAAIA,EAAGe,GAASxB,KAAKgD,KAAKoB,EACtE,EAEA5C,EAAMwD,MAAQ,SAASvE,GACrB,OAAOhS,UAAUC,QAAU4V,EAAS7D,EAAIA,EAAGe,GAASxB,KAAKgD,KAAKsB,EAChE,EAEO9C,CACT,C,iGC/GO,SAASH,EAAEO,GAChB,OAAOA,EAAEP,CACX,CAEO,SAASC,EAAEM,GAChB,OAAOA,EAAEN,CACX,CAEA,IAAI2D,EAAgB,GAChBC,EAAelF,KAAKmF,IAAM,EAAInF,KAAKgD,KAAK,IAE7B,WAAS5S,GACtB,IAAIgV,EACArB,EAAQ,EACRsB,EAAW,KACXC,EAAa,EAAItF,KAAKuF,IAAIF,EAAU,EAAI,KACxCG,EAAc,EACdC,EAAgB,GAChBC,EAAS,IAAIlW,IACbmW,GAAU,QAAMC,GAChB/U,GAAQ,OAAS,OAAQ,OACzBqP,GAAS,SAIb,SAAS0F,IACPC,IACAhV,EAAMmJ,KAAK,OAAQoL,GACfrB,EAAQsB,IACVM,EAAQG,OACRjV,EAAMmJ,KAAK,MAAOoL,GAEtB,CAEA,SAASS,EAAK5D,GACZ,IAAIlT,EAAqB4D,EAAlBuG,EAAI9I,EAAM1B,YAEEuO,IAAfgF,IAA0BA,EAAa,GAE3C,IAAK,IAAIpI,EAAI,EAAGA,EAAIoI,IAAcpI,EAOhC,IANAkK,IAAUyB,EAAczB,GAASuB,EAEjCI,EAAOzU,SAAQ,SAASuQ,GACtBA,EAAMuC,EACR,IAEKhV,EAAI,EAAGA,EAAImK,IAAKnK,EAEJ,OADf4D,EAAOvC,EAAMrB,IACJgX,GAAYpT,EAAK0O,GAAK1O,EAAKkP,IAAM4D,GACrC9S,EAAK0O,EAAI1O,EAAKoT,GAAIpT,EAAKkP,GAAK,GAClB,MAAXlP,EAAKqT,GAAYrT,EAAK2O,GAAK3O,EAAKmP,IAAM2D,GACrC9S,EAAK2O,EAAI3O,EAAKqT,GAAIrT,EAAKmP,GAAK,GAIrC,OAAOsD,CACT,CAEA,SAASa,IACP,IAAK,IAA6BtT,EAAzB5D,EAAI,EAAGmK,EAAI9I,EAAM1B,OAAcK,EAAImK,IAAKnK,EAAG,CAIlD,IAHA4D,EAAOvC,EAAMrB,IAASyT,MAAQzT,EACf,MAAX4D,EAAKoT,KAAYpT,EAAK0O,EAAI1O,EAAKoT,IACpB,MAAXpT,EAAKqT,KAAYrT,EAAK2O,EAAI3O,EAAKqT,IAC/BE,MAAMvT,EAAK0O,IAAM6E,MAAMvT,EAAK2O,GAAI,CAClC,IAAIS,EAASkD,EAAgBjF,KAAKgD,KAAK,GAAMjU,GAAIoX,EAAQpX,EAAImW,EAC7DvS,EAAK0O,EAAIU,EAAS/B,KAAKoG,IAAID,GAC3BxT,EAAK2O,EAAIS,EAAS/B,KAAKqG,IAAIF,EAC7B,EACID,MAAMvT,EAAKkP,KAAOqE,MAAMvT,EAAKmP,OAC/BnP,EAAKkP,GAAKlP,EAAKmP,GAAK,EAExB,CACF,CAEA,SAASwE,EAAgB9E,GAEvB,OADIA,EAAMG,YAAYH,EAAMG,WAAWvR,EAAO8P,GACvCsB,CACT,CAIA,OA1Da,MAATpR,IAAeA,EAAQ,IAwD3B6V,IAEOb,EAAa,CAClBS,KAAMA,EAENU,QAAS,WACP,OAAOZ,EAAQY,QAAQX,GAAOR,CAChC,EAEAU,KAAM,WACJ,OAAOH,EAAQG,OAAQV,CACzB,EAEAhV,MAAO,SAASqQ,GACd,OAAOhS,UAAUC,QAAU0B,EAAQqQ,EAAGwF,IAAmBP,EAAOzU,QAAQqV,GAAkBlB,GAAchV,CAC1G,EAEA2T,MAAO,SAAStD,GACd,OAAOhS,UAAUC,QAAUqV,GAAStD,EAAG2E,GAAcrB,CACvD,EAEAsB,SAAU,SAAS5E,GACjB,OAAOhS,UAAUC,QAAU2W,GAAY5E,EAAG2E,GAAcC,CAC1D,EAEAC,WAAY,SAAS7E,GACnB,OAAOhS,UAAUC,QAAU4W,GAAc7E,EAAG2E,IAAeE,CAC7D,EAEAE,YAAa,SAAS/E,GACpB,OAAOhS,UAAUC,QAAU8W,GAAe/E,EAAG2E,GAAcI,CAC7D,EAEAC,cAAe,SAAShF,GACtB,OAAOhS,UAAUC,QAAU+W,EAAgB,EAAIhF,EAAG2E,GAAc,EAAIK,CACtE,EAEAe,aAAc,SAAS/F,GACrB,OAAOhS,UAAUC,QAAUwR,EAASO,EAAGiF,EAAOzU,QAAQqV,GAAkBlB,GAAclF,CACxF,EAEAsB,MAAO,SAASjG,EAAMkF,GACpB,OAAOhS,UAAUC,OAAS,GAAW,MAAL+R,EAAYiF,EAAOnR,OAAOgH,GAAQmK,EAAOxR,IAAIqH,EAAM+K,EAAgB7F,IAAM2E,GAAcM,EAAO9S,IAAI2I,EACpI,EAEA3J,KAAM,SAASyP,EAAGC,EAAGS,GACnB,IAEI0E,EACAC,EACAC,EACAhU,EACAiU,EANA7X,EAAI,EACJmK,EAAI9I,EAAM1B,OAUd,IAHc,MAAVqT,EAAgBA,EAASsC,IACxBtC,GAAUA,EAEVhT,EAAI,EAAGA,EAAImK,IAAKnK,GAInB4X,GAFAF,EAAKpF,GADL1O,EAAOvC,EAAMrB,IACCsS,GAEJoF,GADVC,EAAKpF,EAAI3O,EAAK2O,GACMoF,GACX3E,IAAQ6E,EAAUjU,EAAMoP,EAAS4E,GAG5C,OAAOC,CACT,EAEA5Y,GAAI,SAASuN,EAAMkF,GACjB,OAAOhS,UAAUC,OAAS,GAAKmC,EAAM7C,GAAGuN,EAAMkF,GAAI2E,GAAcvU,EAAM7C,GAAGuN,EAC3E,EAEJ,C,6DCzJe,WAAS8F,GACtB,IACIjR,EACAoT,EACAqD,EAHAtF,GAAW,OAAS,IAOxB,SAASC,EAAMuC,GACb,IAAK,IAA6BpR,EAAzB5D,EAAI,EAAGmK,EAAI9I,EAAM1B,OAAcK,EAAImK,IAAKnK,GAC/C4D,EAAOvC,EAAMrB,IAAS8S,KAAOgF,EAAG9X,GAAK4D,EAAK0O,GAAKmC,EAAUzU,GAAKgV,CAElE,CAEA,SAASpC,IACP,GAAKvR,EAAL,CACA,IAAIrB,EAAGmK,EAAI9I,EAAM1B,OAGjB,IAFA8U,EAAY,IAAIvQ,MAAMiG,GACtB2N,EAAK,IAAI5T,MAAMiG,GACVnK,EAAI,EAAGA,EAAImK,IAAKnK,EACnByU,EAAUzU,GAAKmX,MAAMW,EAAG9X,IAAMsS,EAAEjR,EAAMrB,GAAIA,EAAGqB,IAAU,GAAKmR,EAASnR,EAAMrB,GAAIA,EAAGqB,EALlE,CAOpB,CAeA,MA/BiB,mBAANiR,IAAkBA,GAAI,OAAc,MAALA,EAAY,GAAKA,IAkB3DG,EAAMG,WAAa,SAASlB,GAC1BrQ,EAAQqQ,EACRkB,GACF,EAEAH,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,EAAwB,mBAANd,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASD,CAC3G,EAEAC,EAAMH,EAAI,SAASZ,GACjB,OAAOhS,UAAUC,QAAU2S,EAAiB,mBAANZ,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASH,CACpG,EAEOG,CACT,C,6DCtCe,WAASF,GACtB,IACIlR,EACAoT,EACAsD,EAHAvF,GAAW,OAAS,IAOxB,SAASC,EAAMuC,GACb,IAAK,IAA6BpR,EAAzB5D,EAAI,EAAGmK,EAAI9I,EAAM1B,OAAcK,EAAImK,IAAKnK,GAC/C4D,EAAOvC,EAAMrB,IAAS+S,KAAOgF,EAAG/X,GAAK4D,EAAK2O,GAAKkC,EAAUzU,GAAKgV,CAElE,CAEA,SAASpC,IACP,GAAKvR,EAAL,CACA,IAAIrB,EAAGmK,EAAI9I,EAAM1B,OAGjB,IAFA8U,EAAY,IAAIvQ,MAAMiG,GACtB4N,EAAK,IAAI7T,MAAMiG,GACVnK,EAAI,EAAGA,EAAImK,IAAKnK,EACnByU,EAAUzU,GAAKmX,MAAMY,EAAG/X,IAAMuS,EAAElR,EAAMrB,GAAIA,EAAGqB,IAAU,GAAKmR,EAASnR,EAAMrB,GAAIA,EAAGqB,EALlE,CAOpB,CAeA,MA/BiB,mBAANkR,IAAkBA,GAAI,OAAc,MAALA,EAAY,GAAKA,IAkB3DE,EAAMG,WAAa,SAASlB,GAC1BrQ,EAAQqQ,EACRkB,GACF,EAEAH,EAAMD,SAAW,SAASd,GACxB,OAAOhS,UAAUC,QAAU6S,EAAwB,mBAANd,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASD,CAC3G,EAEAC,EAAMF,EAAI,SAASb,GACjB,OAAOhS,UAAUC,QAAU4S,EAAiB,mBAANb,EAAmBA,GAAI,QAAUA,GAAIkB,IAAcH,GAASF,CACpG,EAEOE,CACT,C,8BCxCe,WAASI,GACtB,MAAMP,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,GAC1BN,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,GACxBqF,GAAKpZ,KAAKqZ,GAAGlN,KAAK,KAAM4H,GAC5B,OAAO/L,EAAIhI,KAAKsZ,MAAM9F,EAAGC,EAAG2F,GAAI5F,EAAGC,EAAG2F,EAAGrF,EAC3C,CAEA,SAAS/L,EAAIrF,EAAM6Q,EAAGC,EAAG2F,EAAGrF,GAC1B,GAAIsE,MAAM7E,IAAM6E,MAAM5E,IAAM4E,MAAMe,GAAI,OAAOzW,EAE7C,IAAI0G,EASAkQ,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACA7Y,EACA8Y,EAlBAlV,EAAOnC,EAAKsX,MACZC,EAAO,CAAChT,KAAM6M,GACde,EAAKnS,EAAKwX,IACVpF,EAAKpS,EAAKyX,IACVC,EAAK1X,EAAK2X,IACVtF,EAAKrS,EAAK4X,IACVtF,EAAKtS,EAAK6X,IACVC,EAAK9X,EAAK+X,IAcd,IAAK5V,EAAM,OAAOnC,EAAKsX,MAAQC,EAAMvX,EAGrC,KAAOmC,EAAKjE,QAIV,IAHIgZ,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACvDO,EAAOX,IAAMK,GAAMY,EAAKI,GAAM,IAAIJ,EAAKZ,EAASgB,EAAKhB,EACrDpQ,EAASvE,IAAQA,EAAOA,EAAK5D,EAAI6Y,GAAQ,EAAID,GAAU,EAAID,IAAS,OAAOxQ,EAAOnI,GAAKgZ,EAAMvX,EAOnG,GAHA+W,GAAM/W,EAAKuW,GAAG/M,KAAK,KAAMrH,EAAKoC,MAC9ByS,GAAMhX,EAAKwW,GAAGhN,KAAK,KAAMrH,EAAKoC,MAC9B0S,GAAMjX,EAAK0W,GAAGlN,KAAK,KAAMrH,EAAKoC,MAC1BsM,IAAMkG,GAAMjG,IAAMkG,GAAMP,IAAMQ,EAAI,OAAOM,EAAKpD,KAAOhS,EAAMuE,EAASA,EAAOnI,GAAKgZ,EAAOvX,EAAKsX,MAAQC,EAAMvX,EAG9G,GACE0G,EAASA,EAASA,EAAOnI,GAAK,IAAIkE,MAAM,GAAKzC,EAAKsX,MAAQ,IAAI7U,MAAM,IAChEyU,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACvDO,EAAOX,IAAMK,GAAMY,EAAKI,GAAM,IAAIJ,EAAKZ,EAASgB,EAAKhB,SACjDvY,EAAI6Y,GAAQ,EAAID,GAAU,EAAID,KAAYG,GAAKJ,GAAMH,IAAO,GAAKE,GAAMH,IAAO,EAAKE,GAAMH,IACnG,OAAOlQ,EAAO2Q,GAAKlV,EAAMuE,EAAOnI,GAAKgZ,EAAMvX,CAC7C,CAEO,SAASgY,EAAOzT,GAChB9B,MAAM8D,QAAQhC,KAAOA,EAAO9B,MAAMC,KAAK6B,IAC5C,MAAMmE,EAAInE,EAAKrG,OACTmY,EAAK,IAAI4B,aAAavP,GACtB4N,EAAK,IAAI2B,aAAavP,GACtBwP,EAAK,IAAID,aAAavP,GAC5B,IAAIyJ,EAAK0B,IACLzB,EAAKyB,IACL6D,EAAK7D,IACLxB,GAAK,IACLC,GAAK,IACLwF,GAAK,IAGT,IAAK,IAAW1G,EAAGP,EAAGC,EAAG2F,EAAhBlY,EAAI,EAAeA,EAAImK,IAAKnK,EAC/BmX,MAAM7E,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,EAAI7M,EAAKhG,MAAQmX,MAAM5E,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,KAAOsE,MAAMe,GAAKpZ,KAAKqZ,GAAGlN,KAAK,KAAM4H,MACtHiF,EAAG9X,GAAKsS,EACRyF,EAAG/X,GAAKuS,EACRoH,EAAG3Z,GAAKkY,EACJ5F,EAAIsB,IAAIA,EAAKtB,GACbA,EAAIwB,IAAIA,EAAKxB,GACbC,EAAIsB,IAAIA,EAAKtB,GACbA,EAAIwB,IAAIA,EAAKxB,GACb2F,EAAIiB,IAAIA,EAAKjB,GACbA,EAAIqB,IAAIA,EAAKrB,IAInB,GAAItE,EAAKE,GAAMD,EAAKE,GAAMoF,EAAKI,EAAI,OAAOza,KAG1CA,KAAKsZ,MAAMxE,EAAIC,EAAIsF,GAAIf,MAAMtE,EAAIC,EAAIwF,GAGrC,IAAK,IAAIvZ,EAAI,EAAGA,EAAImK,IAAKnK,EACvB8G,EAAIhI,KAAMgZ,EAAG9X,GAAI+X,EAAG/X,GAAI2Z,EAAG3Z,GAAIgG,EAAKhG,IAGtC,OAAOlB,IACT,C,sDCjGe,WAASwT,EAAGC,EAAG2F,GAC5B,GAAIf,MAAM7E,GAAKA,IAAM6E,MAAM5E,GAAKA,IAAM4E,MAAMe,GAAKA,GAAI,OAAOpZ,KAE5D,IAAI8U,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IACVC,EAAKra,KAAKsa,IACVtF,EAAKhV,KAAKua,IACVtF,EAAKjV,KAAKwa,IACVC,EAAKza,KAAK0a,IAKd,GAAIrC,MAAMvD,GACRE,GAAMF,EAAK3C,KAAKC,MAAMoB,IAAM,EAC5ByB,GAAMF,EAAK5C,KAAKC,MAAMqB,IAAM,EAC5BgH,GAAMJ,EAAKlI,KAAKC,MAAMgH,IAAM,MAIzB,CAMH,IALA,IAEI/P,EACAnI,EAHAyR,EAAIqC,EAAKF,GAAM,EACfhQ,EAAO9E,KAAKia,MAITnF,EAAKtB,GAAKA,GAAKwB,GAAMD,EAAKtB,GAAKA,GAAKwB,GAAMoF,EAAKjB,GAAKA,GAAKqB,GAG9D,OAFAvZ,GAAKkY,EAAIiB,IAAO,GAAK5G,EAAIsB,IAAO,EAAKvB,EAAIsB,GACzCzL,EAAS,IAAIjE,MAAM,IAAWlE,GAAK4D,EAAMA,EAAOuE,EAAQsJ,GAAK,EACrDzR,GACN,KAAK,EAAG8T,EAAKF,EAAKnC,EAAGsC,EAAKF,EAAKpC,EAAG8H,EAAKJ,EAAK1H,EAAG,MAC/C,KAAK,EAAGmC,EAAKE,EAAKrC,EAAGsC,EAAKF,EAAKpC,EAAG8H,EAAKJ,EAAK1H,EAAG,MAC/C,KAAK,EAAGqC,EAAKF,EAAKnC,EAAGoC,EAAKE,EAAKtC,EAAG8H,EAAKJ,EAAK1H,EAAG,MAC/C,KAAK,EAAGmC,EAAKE,EAAKrC,EAAGoC,EAAKE,EAAKtC,EAAG8H,EAAKJ,EAAK1H,EAAG,MAC/C,KAAK,EAAGqC,EAAKF,EAAKnC,EAAGsC,EAAKF,EAAKpC,EAAG0H,EAAKI,EAAK9H,EAAG,MAC/C,KAAK,EAAGmC,EAAKE,EAAKrC,EAAGsC,EAAKF,EAAKpC,EAAG0H,EAAKI,EAAK9H,EAAG,MAC/C,KAAK,EAAGqC,EAAKF,EAAKnC,EAAGoC,EAAKE,EAAKtC,EAAG0H,EAAKI,EAAK9H,EAAG,MAC/C,KAAK,EAAGmC,EAAKE,EAAKrC,EAAGoC,EAAKE,EAAKtC,EAAG0H,EAAKI,EAAK9H,EAI5C3S,KAAKia,OAASja,KAAKia,MAAMpZ,SAAQb,KAAKia,MAAQnV,EACpD,CAQA,OANA9E,KAAKma,IAAMrF,EACX9U,KAAKoa,IAAMrF,EACX/U,KAAKsa,IAAMD,EACXra,KAAKua,IAAMvF,EACXhV,KAAKwa,IAAMvF,EACXjV,KAAK0a,IAAMD,EACJza,IACT,C,8CCnDe,aACb,IAAIkH,EAAO,GAIX,OAHAlH,KAAK4U,OAAM,SAAS9P,GAClB,IAAKA,EAAKjE,OAAQ,GAAGqG,EAAK3G,KAAKuE,EAAKoC,YAAcpC,EAAOA,EAAKgS,KAChE,IACO5P,CACT,C,8CCNe,WAAS0L,GACtB,OAAOhS,UAAUC,OACXb,KAAKsZ,OAAO1G,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAI0G,OAAO1G,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IACzEyF,MAAMrY,KAAKma,UAAO/K,EAAY,CAAC,CAACpP,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKsa,KAAM,CAACta,KAAKua,IAAKva,KAAKwa,IAAKxa,KAAK0a,KACjG,C,6ECFe,WAASlH,EAAGC,EAAG2F,EAAGlF,GAC/B,IAAIhN,EAIA8N,EACAC,EACAwF,EACA1D,EACA+D,EACAC,EAMApE,EACAzV,EAfA4T,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IACVC,EAAKra,KAAKsa,IAOVU,EAAKhb,KAAKua,IACVU,EAAKjb,KAAKwa,IACVU,EAAKlb,KAAK0a,IACVS,EAAO,GACPrW,EAAO9E,KAAKia,MAYhB,IARInV,GAAMqW,EAAK5a,KAAK,IAAI,IAAOuE,EAAMgQ,EAAIC,EAAIsF,EAAIW,EAAIC,EAAIC,IAC3C,MAAVhH,EAAgBA,EAASsC,KAE3B1B,EAAKtB,EAAIU,EAAQa,EAAKtB,EAAIS,EAAQmG,EAAKjB,EAAIlF,EAC3C8G,EAAKxH,EAAIU,EAAQ+G,EAAKxH,EAAIS,EAAQgH,EAAK9B,EAAIlF,EAC3CA,GAAUA,GAGLyC,EAAIwE,EAAKC,OAGd,OAAMtW,EAAO6R,EAAE7R,QACPkQ,EAAK2B,EAAE7B,IAAMkG,IACb/F,EAAK0B,EAAE5B,IAAMkG,IACbR,EAAK9D,EAAE0D,IAAMa,IACbnE,EAAKJ,EAAE3B,IAAMF,IACbgG,EAAKnE,EAAE1B,IAAMF,IACbgG,EAAKpE,EAAE8D,IAAMJ,GAGrB,GAAIvV,EAAKjE,OAAQ,CACf,IAAI0Y,GAAMvE,EAAK+B,GAAM,EACjByC,GAAMvE,EAAK6F,GAAM,EACjBrB,GAAMgB,EAAKM,GAAM,EAErBI,EAAK5a,KACH,IAAI,IAAOuE,EAAK,GAAIyU,EAAIC,EAAIC,EAAI1C,EAAI+D,EAAIC,GACxC,IAAI,IAAOjW,EAAK,GAAIkQ,EAAIwE,EAAIC,EAAIF,EAAIuB,EAAIC,GACxC,IAAI,IAAOjW,EAAK,GAAIyU,EAAItE,EAAIwE,EAAI1C,EAAIyC,EAAIuB,GACxC,IAAI,IAAOjW,EAAK,GAAIkQ,EAAIC,EAAIwE,EAAIF,EAAIC,EAAIuB,GACxC,IAAI,IAAOjW,EAAK,GAAIyU,EAAIC,EAAIiB,EAAI1D,EAAI+D,EAAIrB,GACxC,IAAI,IAAO3U,EAAK,GAAIkQ,EAAIwE,EAAIiB,EAAIlB,EAAIuB,EAAIrB,GACxC,IAAI,IAAO3U,EAAK,GAAIyU,EAAItE,EAAIwF,EAAI1D,EAAIyC,EAAIC,GACxC,IAAI,IAAO3U,EAAK,GAAIkQ,EAAIC,EAAIwF,EAAIlB,EAAIC,EAAIC,KAItCvY,GAAKkY,GAAKK,IAAO,GAAKhG,GAAK+F,IAAO,EAAKhG,GAAK+F,KAC9C5C,EAAIwE,EAAKA,EAAKta,OAAS,GACvBsa,EAAKA,EAAKta,OAAS,GAAKsa,EAAKA,EAAKta,OAAS,EAAIK,GAC/Cia,EAAKA,EAAKta,OAAS,EAAIK,GAAKyV,EAEhC,KAGK,CACH,IAAIiC,EAAKpF,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAMrH,EAAKoC,MAClC2R,EAAKpF,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAMrH,EAAKoC,MAClCmU,EAAKjC,GAAKpZ,KAAKqZ,GAAGlN,KAAK,KAAMrH,EAAKoC,MAClC4R,EAAKF,EAAKA,EAAKC,EAAKA,EAAKwC,EAAKA,EAClC,GAAIvC,EAAK5E,EAAQ,CACf,IAAIH,EAAI5B,KAAKgD,KAAKjB,EAAS4E,GAC3BhE,EAAKtB,EAAIO,EAAGgB,EAAKtB,EAAIM,EAAGsG,EAAKjB,EAAIrF,EACjCiH,EAAKxH,EAAIO,EAAGkH,EAAKxH,EAAIM,EAAGmH,EAAK9B,EAAIrF,EACjC7M,EAAOpC,EAAKoC,IACd,CACF,CAGF,OAAOA,CACT,C,8BCjFe,WAASpC,EAAMgQ,EAAIC,EAAIsF,EAAIrF,EAAIC,EAAIwF,GAChDza,KAAK8E,KAAOA,EACZ9E,KAAK8U,GAAKA,EACV9U,KAAK+U,GAAKA,EACV/U,KAAKqa,GAAKA,EACVra,KAAKgV,GAAKA,EACVhV,KAAKiV,GAAKA,EACVjV,KAAKya,GAAKA,CACZ,C,mMCMe,SAASa,EAAO/Y,EAAOiR,EAAGC,EAAG2F,GAC1C,IAAIzW,EAAO,IAAI4Y,EAAY,MAAL/H,EAAY,IAAWA,EAAQ,MAALC,EAAY,IAAWA,EAAQ,MAAL2F,EAAY,IAAWA,EAAGoC,IAAKA,IAAKA,IAAKA,IAAKA,IAAKA,KAC7H,OAAgB,MAATjZ,EAAgBI,EAAOA,EAAKgY,OAAOpY,EAC5C,CAEA,SAASgZ,EAAO/H,EAAGC,EAAG2F,EAAGtE,EAAIC,EAAIsF,EAAIrF,EAAIC,EAAIwF,GAC3Cza,KAAKkZ,GAAK1F,EACVxT,KAAKmZ,GAAK1F,EACVzT,KAAKqZ,GAAKD,EACVpZ,KAAKma,IAAMrF,EACX9U,KAAKoa,IAAMrF,EACX/U,KAAKsa,IAAMD,EACXra,KAAKua,IAAMvF,EACXhV,KAAKwa,IAAMvF,EACXjV,KAAK0a,IAAMD,EACXza,KAAKia,WAAQ7K,CACf,CAEA,SAASqM,EAAUvB,GAEjB,IADA,IAAI5G,EAAO,CAACpM,KAAMgT,EAAKhT,MAAO4P,EAAOxD,EAC9B4G,EAAOA,EAAKpD,MAAMA,EAAOA,EAAKA,KAAO,CAAC5P,KAAMgT,EAAKhT,MACxD,OAAOoM,CACT,CAEA,IAAIoI,EAAYJ,EAAOpb,UAAYqb,EAAOrb,UAE1Cwb,EAAUpI,KAAO,WACf,IAEI/Q,EACAoE,EAHA2M,EAAO,IAAIiI,EAAOvb,KAAKkZ,GAAIlZ,KAAKmZ,GAAInZ,KAAKqZ,GAAIrZ,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKsa,IAAKta,KAAKua,IAAKva,KAAKwa,IAAKxa,KAAK0a,KACpG5V,EAAO9E,KAAKia,MAIhB,IAAKnV,EAAM,OAAOwO,EAElB,IAAKxO,EAAKjE,OAAQ,OAAOyS,EAAK2G,MAAQwB,EAAU3W,GAAOwO,EAGvD,IADA/Q,EAAQ,CAAC,CAAC0D,OAAQnB,EAAMe,OAAQyN,EAAK2G,MAAQ,IAAI7U,MAAM,KAChDN,EAAOvC,EAAM6Y,OAClB,IAAK,IAAIla,EAAI,EAAGA,EAAI,IAAKA,GACnByF,EAAQ7B,EAAKmB,OAAO/E,MAClByF,EAAM9F,OAAQ0B,EAAMhC,KAAK,CAAC0F,OAAQU,EAAOd,OAAQf,EAAKe,OAAO3E,GAAK,IAAIkE,MAAM,KAC3EN,EAAKe,OAAO3E,GAAKua,EAAU9U,IAKtC,OAAO2M,CACT,EAEAoI,EAAU1T,IAAM,IAChB0T,EAAUf,OAAS,IACnBe,EAAUpC,MAAQ,IAClBoC,EAAUxU,KAAO,IACjBwU,EAAUC,OAAS,IACnBD,EAAU3X,KAAO,IACjB2X,EAAUE,OAAS,IACnBF,EAAUG,UAAY,IACtBH,EAAUI,KAAO,IACjBJ,EAAUK,KAAO,IACjBL,EAAU9G,MAAQ,IAClB8G,EAAUjH,WAAa,IACvBiH,EAAUlI,EAAI,IACdkI,EAAUjI,EAAI,IACdiI,EAAUtC,EAAI,G,8BC7EC,WAASrF,GACtB,GAAIsE,MAAM7E,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,KAAOsE,MAAM5E,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,KAAOsE,MAAMe,GAAKpZ,KAAKqZ,GAAGlN,KAAK,KAAM4H,IAAK,OAAO/T,KAExH,IAAIqJ,EAEA2S,EACAC,EACAnF,EAOAtD,EACAC,EACA2F,EACAG,EACAC,EACAC,EACAI,EACAC,EACAC,EACA7Y,EACA8Y,EApBAlV,EAAO9E,KAAKia,MAIZnF,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IACVC,EAAKra,KAAKsa,IACVtF,EAAKhV,KAAKua,IACVtF,EAAKjV,KAAKwa,IACVC,EAAKza,KAAK0a,IAcd,IAAK5V,EAAM,OAAO9E,KAIlB,GAAI8E,EAAKjE,OAAQ,OAAa,CAI5B,IAHIgZ,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACvDO,EAAOX,IAAMK,GAAMY,EAAKI,GAAM,IAAIJ,EAAKZ,EAASgB,EAAKhB,EACnDpQ,EAASvE,IAAMA,EAAOA,EAAK5D,EAAI6Y,GAAQ,EAAID,GAAU,EAAID,IAAS,OAAO7Z,KAC/E,IAAK8E,EAAKjE,OAAQ,OACdwI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,MAAI8a,EAAW3S,EAAQ2Q,EAAI9Y,EAC5L,CAGA,KAAO4D,EAAKoC,OAAS6M,MAASkI,EAAWnX,IAAMA,EAAOA,EAAKgS,MAAO,OAAO9W,KAIzE,OAHI8W,EAAOhS,EAAKgS,cAAahS,EAAKgS,KAG9BmF,GAAkBnF,EAAOmF,EAASnF,KAAOA,SAAcmF,EAASnF,KAAO9W,MAGtEqJ,GAGLyN,EAAOzN,EAAOnI,GAAK4V,SAAczN,EAAOnI,IAGnC4D,EAAOuE,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACvGvE,KAAUuE,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MAC3GvE,EAAKjE,SACPmb,EAAUA,EAAShC,GAAKlV,EACvB9E,KAAKia,MAAQnV,GAGb9E,OAbaA,KAAKia,MAAQnD,EAAM9W,KAczC,CAEO,SAAS6b,EAAU3U,GACxB,IAAK,IAAIhG,EAAI,EAAGmK,EAAInE,EAAKrG,OAAQK,EAAImK,IAAKnK,EAAGlB,KAAK4b,OAAO1U,EAAKhG,IAC9D,OAAOlB,IACT,C,sDCnEe,aACb,OAAOA,KAAKia,KACd,C,6CCFe,aACb,IAAI8B,EAAO,EAIX,OAHA/b,KAAK4U,OAAM,SAAS9P,GAClB,IAAKA,EAAKjE,OAAQ,KAAKkb,QAAajX,EAAOA,EAAKgS,KAClD,IACOiF,CACT,C,4ECJe,WAAS1b,GACtB,IAAesW,EAAsBhQ,EAAOmO,EAAIC,EAAIsF,EAAIrF,EAAIC,EAAIwF,EAA5DU,EAAO,GAAOrW,EAAO9E,KAAKia,MAE9B,IADInV,GAAMqW,EAAK5a,KAAK,IAAI,IAAOuE,EAAM9E,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKsa,IAAKta,KAAKua,IAAKva,KAAKwa,IAAKxa,KAAK0a,MACrF/D,EAAIwE,EAAKC,OACd,IAAK/a,EAASyE,EAAO6R,EAAE7R,KAAMgQ,EAAK6B,EAAE7B,GAAIC,EAAK4B,EAAE5B,GAAIsF,EAAK1D,EAAE0D,GAAIrF,EAAK2B,EAAE3B,GAAIC,EAAK0B,EAAE1B,GAAIwF,EAAK9D,EAAE8D,KAAO3V,EAAKjE,OAAQ,CAC7G,IAAI0Y,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMY,EAAKI,GAAM,GACzD9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIC,EAAIC,EAAIzE,EAAIC,EAAIwF,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAI0E,EAAIC,EAAIF,EAAItE,EAAIwF,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIxE,EAAI0E,EAAIzE,EAAIwE,EAAIiB,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAIC,EAAI0E,EAAIF,EAAIC,EAAIiB,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIC,EAAIa,EAAIrF,EAAIC,EAAIwE,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAI0E,EAAIa,EAAId,EAAItE,EAAIwE,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIxE,EAAIsF,EAAIrF,EAAIwE,EAAIC,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAIC,EAAIsF,EAAId,EAAIC,EAAIC,GACvE,CAEF,OAAOzZ,IACT,C,6DCjBe,WAASK,GACtB,IAA0BsW,EAAtBwE,EAAO,GAAIrE,EAAO,GAEtB,IADI9W,KAAKia,OAAOkB,EAAK5a,KAAK,IAAI,IAAOP,KAAKia,MAAOja,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKsa,IAAKta,KAAKua,IAAKva,KAAKwa,IAAKxa,KAAK0a,MACjG/D,EAAIwE,EAAKC,OAAO,CACrB,IAAItW,EAAO6R,EAAE7R,KACb,GAAIA,EAAKjE,OAAQ,CACf,IAAI8F,EAAOmO,EAAK6B,EAAE7B,GAAIC,EAAK4B,EAAE5B,GAAIsF,EAAK1D,EAAE0D,GAAIrF,EAAK2B,EAAE3B,GAAIC,EAAK0B,EAAE1B,GAAIwF,EAAK9D,EAAE8D,GAAIlB,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMY,EAAKI,GAAM,GAClI9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAIC,EAAIsF,EAAId,EAAIC,EAAIC,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIxE,EAAIsF,EAAIrF,EAAIwE,EAAIC,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAI0E,EAAIa,EAAId,EAAItE,EAAIwE,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIC,EAAIa,EAAIrF,EAAIC,EAAIwE,KACjE9S,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAIC,EAAI0E,EAAIF,EAAIC,EAAIiB,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIxE,EAAI0E,EAAIzE,EAAIwE,EAAIiB,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAOmO,EAAI0E,EAAIC,EAAIF,EAAItE,EAAIwF,KACjE9T,EAAQ7B,EAAK,KAAIqW,EAAK5a,KAAK,IAAI,IAAOoG,EAAO4S,EAAIC,EAAIC,EAAIzE,EAAIC,EAAIwF,GACvE,CACA3D,EAAKvW,KAAKoW,EACZ,CACA,KAAOA,EAAIG,EAAKsE,OACd/a,EAASsW,EAAE7R,KAAM6R,EAAE7B,GAAI6B,EAAE5B,GAAI4B,EAAE0D,GAAI1D,EAAE3B,GAAI2B,EAAE1B,GAAI0B,EAAE8D,IAEnD,OAAOza,IACT,C,8BCxBO,SAASkc,EAASnI,GACvB,OAAOA,EAAE,EACX,CAEe,WAASnB,GACtB,OAAOhS,UAAUC,QAAUb,KAAKkZ,GAAKtG,EAAG5S,MAAQA,KAAKkZ,EACvD,C,sDCNO,SAASiD,EAASpI,GACvB,OAAOA,EAAE,EACX,CAEe,WAASnB,GACtB,OAAOhS,UAAUC,QAAUb,KAAKmZ,GAAKvG,EAAG5S,MAAQA,KAAKmZ,EACvD,C,sDCNO,SAASiD,EAASrI,GACvB,OAAOA,EAAE,EACX,CAEe,WAASnB,GACtB,OAAOhS,UAAUC,QAAUb,KAAKqZ,GAAKzG,EAAG5S,MAAQA,KAAKqZ,EACvD,C,oDCNe,WAAStF,GACtB,MAAMP,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,GAC1BN,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,GAC5B,OAAO/L,EAAIhI,KAAKsZ,MAAM9F,EAAGC,GAAID,EAAGC,EAAGM,EACrC,CAEA,SAAS/L,EAAIrF,EAAM6Q,EAAGC,EAAGM,GACvB,GAAIsE,MAAM7E,IAAM6E,MAAM5E,GAAI,OAAO9Q,EAEjC,IAAI0G,EAOAkQ,EACAC,EACAE,EACAC,EACAE,EACAC,EACA5Y,EACA8Y,EAbAlV,EAAOnC,EAAKsX,MACZC,EAAO,CAAChT,KAAM6M,GACde,EAAKnS,EAAKwX,IACVpF,EAAKpS,EAAKyX,IACVpF,EAAKrS,EAAK4X,IACVtF,EAAKtS,EAAK6X,IAWd,IAAK1V,EAAM,OAAOnC,EAAKsX,MAAQC,EAAMvX,EAGrC,KAAOmC,EAAKjE,QAGV,IAFIgZ,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,EACvDnQ,EAASvE,IAAQA,EAAOA,EAAK5D,EAAI4Y,GAAU,EAAID,IAAS,OAAOxQ,EAAOnI,GAAKgZ,EAAMvX,EAMvF,GAFA+W,GAAM/W,EAAKuW,GAAG/M,KAAK,KAAMrH,EAAKoC,MAC9ByS,GAAMhX,EAAKwW,GAAGhN,KAAK,KAAMrH,EAAKoC,MAC1BsM,IAAMkG,GAAMjG,IAAMkG,EAAI,OAAOO,EAAKpD,KAAOhS,EAAMuE,EAASA,EAAOnI,GAAKgZ,EAAOvX,EAAKsX,MAAQC,EAAMvX,EAGlG,GACE0G,EAASA,EAASA,EAAOnI,GAAK,IAAIkE,MAAM,GAAKzC,EAAKsX,MAAQ,IAAI7U,MAAM,IAChEyU,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,SACnDtY,EAAI4Y,GAAU,EAAID,KAAYG,GAAKL,GAAMH,IAAO,EAAKE,GAAMH,IACrE,OAAOlQ,EAAO2Q,GAAKlV,EAAMuE,EAAOnI,GAAKgZ,EAAMvX,CAC7C,CAEO,SAASgY,EAAOzT,GACrB,IAAI6M,EAAG7S,EACHsS,EACAC,EAFMpI,EAAInE,EAAKrG,OAGfmY,EAAK,IAAI5T,MAAMiG,GACf4N,EAAK,IAAI7T,MAAMiG,GACfyJ,EAAK0B,IACLzB,EAAKyB,IACLxB,GAAK,IACLC,GAAK,IAGT,IAAK/T,EAAI,EAAGA,EAAImK,IAAKnK,EACfmX,MAAM7E,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,EAAI7M,EAAKhG,MAAQmX,MAAM5E,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,MACjFiF,EAAG9X,GAAKsS,EACRyF,EAAG/X,GAAKuS,EACJD,EAAIsB,IAAIA,EAAKtB,GACbA,EAAIwB,IAAIA,EAAKxB,GACbC,EAAIsB,IAAIA,EAAKtB,GACbA,EAAIwB,IAAIA,EAAKxB,IAInB,GAAIqB,EAAKE,GAAMD,EAAKE,EAAI,OAAOjV,KAM/B,IAHAA,KAAKsZ,MAAMxE,EAAIC,GAAIuE,MAAMtE,EAAIC,GAGxB/T,EAAI,EAAGA,EAAImK,IAAKnK,EACnB8G,EAAIhI,KAAMgZ,EAAG9X,GAAI+X,EAAG/X,GAAIgG,EAAKhG,IAG/B,OAAOlB,IACT,C,qDCnFe,WAASwT,EAAGC,GACzB,GAAI4E,MAAM7E,GAAKA,IAAM6E,MAAM5E,GAAKA,GAAI,OAAOzT,KAE3C,IAAI8U,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IACVpF,EAAKhV,KAAKua,IACVtF,EAAKjV,KAAKwa,IAKd,GAAInC,MAAMvD,GACRE,GAAMF,EAAK3C,KAAKC,MAAMoB,IAAM,EAC5ByB,GAAMF,EAAK5C,KAAKC,MAAMqB,IAAM,MAIzB,CAMH,IALA,IAEIpK,EACAnI,EAHAkY,EAAIpE,EAAKF,GAAM,EACfhQ,EAAO9E,KAAKia,MAITnF,EAAKtB,GAAKA,GAAKwB,GAAMD,EAAKtB,GAAKA,GAAKwB,GAGzC,OAFA/T,GAAKuS,EAAIsB,IAAO,EAAKvB,EAAIsB,GACzBzL,EAAS,IAAIjE,MAAM,IAAWlE,GAAK4D,EAAMA,EAAOuE,EAAQ+P,GAAK,EACrDlY,GACN,KAAK,EAAG8T,EAAKF,EAAKsE,EAAGnE,EAAKF,EAAKqE,EAAG,MAClC,KAAK,EAAGtE,EAAKE,EAAKoE,EAAGnE,EAAKF,EAAKqE,EAAG,MAClC,KAAK,EAAGpE,EAAKF,EAAKsE,EAAGrE,EAAKE,EAAKmE,EAAG,MAClC,KAAK,EAAGtE,EAAKE,EAAKoE,EAAGrE,EAAKE,EAAKmE,EAI/BpZ,KAAKia,OAASja,KAAKia,MAAMpZ,SAAQb,KAAKia,MAAQnV,EACpD,CAMA,OAJA9E,KAAKma,IAAMrF,EACX9U,KAAKoa,IAAMrF,EACX/U,KAAKua,IAAMvF,EACXhV,KAAKwa,IAAMvF,EACJjV,IACT,C,8CC1Ce,aACb,IAAIkH,EAAO,GAIX,OAHAlH,KAAK4U,OAAM,SAAS9P,GAClB,IAAKA,EAAKjE,OAAQ,GAAGqG,EAAK3G,KAAKuE,EAAKoC,YAAcpC,EAAOA,EAAKgS,KAChE,IACO5P,CACT,C,8CCNe,WAAS0L,GACtB,OAAOhS,UAAUC,OACXb,KAAKsZ,OAAO1G,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAI0G,OAAO1G,EAAE,GAAG,IAAKA,EAAE,GAAG,IACrDyF,MAAMrY,KAAKma,UAAO/K,EAAY,CAAC,CAACpP,KAAKma,IAAKna,KAAKoa,KAAM,CAACpa,KAAKua,IAAKva,KAAKwa,KAC7E,C,6ECFe,WAAShH,EAAGC,EAAGS,GAC5B,IAAIhN,EAGA8N,EACAC,EACA8B,EACA+D,EAKAnE,EACAzV,EAXA4T,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IAKVY,EAAKhb,KAAKua,IACVU,EAAKjb,KAAKwa,IACV6B,EAAQ,GACRvX,EAAO9E,KAAKia,MAYhB,IARInV,GAAMuX,EAAM9b,KAAK,IAAI,IAAKuE,EAAMgQ,EAAIC,EAAIiG,EAAIC,IAClC,MAAV/G,EAAgBA,EAASsC,KAE3B1B,EAAKtB,EAAIU,EAAQa,EAAKtB,EAAIS,EAC1B8G,EAAKxH,EAAIU,EAAQ+G,EAAKxH,EAAIS,EAC1BA,GAAUA,GAGLyC,EAAI0F,EAAMjB,OAGf,OAAMtW,EAAO6R,EAAE7R,QACPkQ,EAAK2B,EAAE7B,IAAMkG,IACb/F,EAAK0B,EAAE5B,IAAMkG,IACblE,EAAKJ,EAAE3B,IAAMF,IACbgG,EAAKnE,EAAE1B,IAAMF,GAGrB,GAAIjQ,EAAKjE,OAAQ,CACf,IAAI0Y,GAAMvE,EAAK+B,GAAM,EACjByC,GAAMvE,EAAK6F,GAAM,EAErBuB,EAAM9b,KACJ,IAAI,IAAKuE,EAAK,GAAIyU,EAAIC,EAAIzC,EAAI+D,GAC9B,IAAI,IAAKhW,EAAK,GAAIkQ,EAAIwE,EAAID,EAAIuB,GAC9B,IAAI,IAAKhW,EAAK,GAAIyU,EAAItE,EAAI8B,EAAIyC,GAC9B,IAAI,IAAK1U,EAAK,GAAIkQ,EAAIC,EAAIsE,EAAIC,KAI5BtY,GAAKuS,GAAK+F,IAAO,EAAKhG,GAAK+F,KAC7B5C,EAAI0F,EAAMA,EAAMxb,OAAS,GACzBwb,EAAMA,EAAMxb,OAAS,GAAKwb,EAAMA,EAAMxb,OAAS,EAAIK,GACnDmb,EAAMA,EAAMxb,OAAS,EAAIK,GAAKyV,EAElC,KAGK,CACH,IAAIiC,EAAKpF,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAMrH,EAAKoC,MAClC2R,EAAKpF,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAMrH,EAAKoC,MAClC4R,EAAKF,EAAKA,EAAKC,EAAKA,EACxB,GAAIC,EAAK5E,EAAQ,CACf,IAAIH,EAAI5B,KAAKgD,KAAKjB,EAAS4E,GAC3BhE,EAAKtB,EAAIO,EAAGgB,EAAKtB,EAAIM,EACrBiH,EAAKxH,EAAIO,EAAGkH,EAAKxH,EAAIM,EACrB7M,EAAOpC,EAAKoC,IACd,CACF,CAGF,OAAOA,CACT,C,8BCrEe,WAASpC,EAAMgQ,EAAIC,EAAIC,EAAIC,GACxCjV,KAAK8E,KAAOA,EACZ9E,KAAK8U,GAAKA,EACV9U,KAAK+U,GAAKA,EACV/U,KAAKgV,GAAKA,EACVhV,KAAKiV,GAAKA,CACZ,C,uLCOe,SAASqH,EAAS/Z,EAAOiR,EAAGC,GACzC,IAAI9Q,EAAO,IAAI4Z,EAAc,MAAL/I,EAAY,IAAWA,EAAQ,MAALC,EAAY,IAAWA,EAAG+H,IAAKA,IAAKA,IAAKA,KAC3F,OAAgB,MAATjZ,EAAgBI,EAAOA,EAAKgY,OAAOpY,EAC5C,CAEA,SAASga,EAAS/I,EAAGC,EAAGqB,EAAIC,EAAIC,EAAIC,GAClCjV,KAAKkZ,GAAK1F,EACVxT,KAAKmZ,GAAK1F,EACVzT,KAAKma,IAAMrF,EACX9U,KAAKoa,IAAMrF,EACX/U,KAAKua,IAAMvF,EACXhV,KAAKwa,IAAMvF,EACXjV,KAAKia,WAAQ7K,CACf,CAEA,SAASqM,EAAUvB,GAEjB,IADA,IAAI5G,EAAO,CAACpM,KAAMgT,EAAKhT,MAAO4P,EAAOxD,EAC9B4G,EAAOA,EAAKpD,MAAMA,EAAOA,EAAKA,KAAO,CAAC5P,KAAMgT,EAAKhT,MACxD,OAAOoM,CACT,CAEA,IAAIoI,EAAYY,EAASpc,UAAYqc,EAASrc,UAE9Cwb,EAAUpI,KAAO,WACf,IAEI/Q,EACAoE,EAHA2M,EAAO,IAAIiJ,EAASvc,KAAKkZ,GAAIlZ,KAAKmZ,GAAInZ,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKua,IAAKva,KAAKwa,KACzE1V,EAAO9E,KAAKia,MAIhB,IAAKnV,EAAM,OAAOwO,EAElB,IAAKxO,EAAKjE,OAAQ,OAAOyS,EAAK2G,MAAQwB,EAAU3W,GAAOwO,EAGvD,IADA/Q,EAAQ,CAAC,CAAC0D,OAAQnB,EAAMe,OAAQyN,EAAK2G,MAAQ,IAAI7U,MAAM,KAChDN,EAAOvC,EAAM6Y,OAClB,IAAK,IAAIla,EAAI,EAAGA,EAAI,IAAKA,GACnByF,EAAQ7B,EAAKmB,OAAO/E,MAClByF,EAAM9F,OAAQ0B,EAAMhC,KAAK,CAAC0F,OAAQU,EAAOd,OAAQf,EAAKe,OAAO3E,GAAK,IAAIkE,MAAM,KAC3EN,EAAKe,OAAO3E,GAAKua,EAAU9U,IAKtC,OAAO2M,CACT,EAEAoI,EAAU1T,IAAM,IAChB0T,EAAUf,OAAS,IACnBe,EAAUpC,MAAQ,IAClBoC,EAAUxU,KAAO,IACjBwU,EAAUC,OAAS,IACnBD,EAAU3X,KAAO,IACjB2X,EAAUE,OAAS,IACnBF,EAAUG,UAAY,IACtBH,EAAUI,KAAO,IACjBJ,EAAUK,KAAO,IACjBL,EAAU9G,MAAQ,IAClB8G,EAAUjH,WAAa,IACvBiH,EAAUlI,EAAI,IACdkI,EAAUjI,EAAI,G,8BCxEC,WAASM,GACtB,GAAIsE,MAAM7E,GAAKxT,KAAKkZ,GAAG/M,KAAK,KAAM4H,KAAOsE,MAAM5E,GAAKzT,KAAKmZ,GAAGhN,KAAK,KAAM4H,IAAK,OAAO/T,KAEnF,IAAIqJ,EAEA2S,EACAC,EACAnF,EAKAtD,EACAC,EACA8F,EACAC,EACAK,EACAC,EACA5Y,EACA8Y,EAfAlV,EAAO9E,KAAKia,MAIZnF,EAAK9U,KAAKma,IACVpF,EAAK/U,KAAKoa,IACVpF,EAAKhV,KAAKua,IACVtF,EAAKjV,KAAKwa,IAWd,IAAK1V,EAAM,OAAO9E,KAIlB,GAAI8E,EAAKjE,OAAQ,OAAa,CAG5B,IAFIgZ,EAAQrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,GACtDO,EAASrG,IAAM+F,GAAMzE,EAAKE,GAAM,IAAIF,EAAKyE,EAASvE,EAAKuE,EACrDnQ,EAASvE,IAAMA,EAAOA,EAAK5D,EAAI4Y,GAAU,EAAID,IAAS,OAAO7Z,KACnE,IAAK8E,EAAKjE,OAAQ,OACdwI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,IAAMmI,EAAQnI,EAAI,EAAK,MAAI8a,EAAW3S,EAAQ2Q,EAAI9Y,EAChG,CAGA,KAAO4D,EAAKoC,OAAS6M,MAASkI,EAAWnX,IAAMA,EAAOA,EAAKgS,MAAO,OAAO9W,KAIzE,OAHI8W,EAAOhS,EAAKgS,cAAahS,EAAKgS,KAG9BmF,GAAkBnF,EAAOmF,EAASnF,KAAOA,SAAcmF,EAASnF,KAAO9W,MAGtEqJ,GAGLyN,EAAOzN,EAAOnI,GAAK4V,SAAczN,EAAOnI,IAGnC4D,EAAOuE,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACnDvE,KAAUuE,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MACvDvE,EAAKjE,SACPmb,EAAUA,EAAShC,GAAKlV,EACvB9E,KAAKia,MAAQnV,GAGb9E,OAbaA,KAAKia,MAAQnD,EAAM9W,KAczC,CAEO,SAAS6b,EAAU3U,GACxB,IAAK,IAAIhG,EAAI,EAAGmK,EAAInE,EAAKrG,OAAQK,EAAImK,IAAKnK,EAAGlB,KAAK4b,OAAO1U,EAAKhG,IAC9D,OAAOlB,IACT,C,sDC7De,aACb,OAAOA,KAAKia,KACd,C,8CCFe,aACb,IAAI8B,EAAO,EAIX,OAHA/b,KAAK4U,OAAM,SAAS9P,GAClB,IAAKA,EAAKjE,OAAQ,KAAKkb,QAAajX,EAAOA,EAAKgS,KAClD,IACOiF,CACT,C,6ECJe,WAAS1b,GACtB,IAAgBsW,EAAsBhQ,EAAOmO,EAAIC,EAAIC,EAAIC,EAArDoH,EAAQ,GAAOvX,EAAO9E,KAAKia,MAE/B,IADInV,GAAMuX,EAAM9b,KAAK,IAAI,IAAKuE,EAAM9E,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKua,IAAKva,KAAKwa,MAChE7D,EAAI0F,EAAMjB,OACf,IAAK/a,EAASyE,EAAO6R,EAAE7R,KAAMgQ,EAAK6B,EAAE7B,GAAIC,EAAK4B,EAAE5B,GAAIC,EAAK2B,EAAE3B,GAAIC,EAAK0B,EAAE1B,KAAOnQ,EAAKjE,OAAQ,CACvF,IAAI0Y,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMzE,EAAKE,GAAM,GACrCtO,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAO4S,EAAIC,EAAIxE,EAAIC,KACxDtO,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAOmO,EAAI0E,EAAID,EAAItE,KACxDtO,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAO4S,EAAIxE,EAAIC,EAAIwE,KACxD7S,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAOmO,EAAIC,EAAIwE,EAAIC,GAC9D,CAEF,OAAOxZ,IACT,C,6DCbe,WAASK,GACtB,IAA2BsW,EAAvB0F,EAAQ,GAAIvF,EAAO,GAEvB,IADI9W,KAAKia,OAAOoC,EAAM9b,KAAK,IAAI,IAAKP,KAAKia,MAAOja,KAAKma,IAAKna,KAAKoa,IAAKpa,KAAKua,IAAKva,KAAKwa,MAC5E7D,EAAI0F,EAAMjB,OAAO,CACtB,IAAItW,EAAO6R,EAAE7R,KACb,GAAIA,EAAKjE,OAAQ,CACf,IAAI8F,EAAOmO,EAAK6B,EAAE7B,GAAIC,EAAK4B,EAAE5B,GAAIC,EAAK2B,EAAE3B,GAAIC,EAAK0B,EAAE1B,GAAIsE,GAAMzE,EAAKE,GAAM,EAAGwE,GAAMzE,EAAKE,GAAM,GACxFtO,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAOmO,EAAIC,EAAIwE,EAAIC,KACxD7S,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAO4S,EAAIxE,EAAIC,EAAIwE,KACxD7S,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAOmO,EAAI0E,EAAID,EAAItE,KACxDtO,EAAQ7B,EAAK,KAAIuX,EAAM9b,KAAK,IAAI,IAAKoG,EAAO4S,EAAIC,EAAIxE,EAAIC,GAC9D,CACA6B,EAAKvW,KAAKoW,EACZ,CACA,KAAOA,EAAIG,EAAKsE,OACd/a,EAASsW,EAAE7R,KAAM6R,EAAE7B,GAAI6B,EAAE5B,GAAI4B,EAAE3B,GAAI2B,EAAE1B,IAEvC,OAAOjV,IACT,C,8BCpBO,SAASkc,EAASnI,GACvB,OAAOA,EAAE,EACX,CAEe,WAASnB,GACtB,OAAOhS,UAAUC,QAAUb,KAAKkZ,GAAKtG,EAAG5S,MAAQA,KAAKkZ,EACvD,C,sDCNO,SAASiD,EAASpI,GACvB,OAAOA,EAAE,EACX,CAEe,WAASnB,GACtB,OAAOhS,UAAUC,QAAUb,KAAKmZ,GAAKvG,EAAG5S,MAAQA,KAAKmZ,EACvD,C,wECNA,IAIIqD,EACAC,EALAC,EAAQ,EACRC,EAAU,EACVC,EAAW,EACXC,EAAY,IAGZC,EAAY,EACZC,EAAW,EACXC,EAAY,EACZC,EAA+B,iBAAhBC,aAA4BA,YAAYC,IAAMD,YAAcE,KAC3EC,EAA6B,iBAAXC,QAAuBA,OAAOC,sBAAwBD,OAAOC,sBAAsB/S,KAAK8S,QAAU,SAASE,GAAKC,WAAWD,EAAG,GAAK,EAElJ,SAASL,IACd,OAAOJ,IAAaM,EAASK,GAAWX,EAAWE,EAAME,MAAQH,EACnE,CAEA,SAASU,IACPX,EAAW,CACb,CAEO,SAASY,IACd3d,KAAK4d,MACL5d,KAAK6d,MACL7d,KAAK8d,MAAQ,IACf,CAyBO,SAASC,EAAM1d,EAAU2d,EAAOC,GACrC,IAAItL,EAAI,IAAIgL,EAEZ,OADAhL,EAAE+F,QAAQrY,EAAU2d,EAAOC,GACpBtL,CACT,CAaA,SAASuL,IACPnB,GAAYD,EAAYG,EAAME,OAASH,EACvCN,EAAQC,EAAU,EAClB,KAdK,WACLQ,MACET,EAEF,IADA,IAAkByB,EAAdxL,EAAI6J,EACD7J,IACAwL,EAAIpB,EAAWpK,EAAEkL,QAAU,GAAGlL,EAAEiL,MAAMzR,UAAKiD,EAAW+O,GAC3DxL,EAAIA,EAAEmL,QAENpB,CACJ,CAMI0B,EACF,CAAE,QACA1B,EAAQ,EAWZ,WAEE,IADA,IAAI2B,EAAmBC,EAAfC,EAAK/B,EAAcyB,EAAOzH,IAC3B+H,GACDA,EAAGX,OACDK,EAAOM,EAAGV,QAAOI,EAAOM,EAAGV,OAC/BQ,EAAKE,EAAIA,EAAKA,EAAGT,QAEjBQ,EAAKC,EAAGT,MAAOS,EAAGT,MAAQ,KAC1BS,EAAKF,EAAKA,EAAGP,MAAQQ,EAAK9B,EAAW8B,GAGzC7B,EAAW4B,EACXG,EAAMP,EACR,CAvBIQ,GACA1B,EAAW,CACb,CACF,CAEA,SAAS2B,IACP,IAAIvB,EAAMF,EAAME,MAAOa,EAAQb,EAAML,EACjCkB,EAAQnB,IAAWG,GAAagB,EAAOlB,EAAYK,EACzD,CAiBA,SAASqB,EAAMP,GACTvB,IACAC,IAASA,EAAUgC,aAAahC,IACxBsB,EAAOlB,EACP,IACNkB,EAAOzH,MAAUmG,EAAUc,WAAWS,EAAMD,EAAOhB,EAAME,MAAQH,IACjEJ,IAAUA,EAAWgC,cAAchC,MAElCA,IAAUE,EAAYG,EAAME,MAAOP,EAAWiC,YAAYH,EAAM7B,IACrEH,EAAQ,EAAGW,EAASa,IAExB,CAnFAP,EAAMzd,UAAY6d,EAAM7d,UAAY,CAClCkC,YAAaub,EACbjF,QAAS,SAASrY,EAAU2d,EAAOC,GACjC,GAAwB,mBAAb5d,EAAyB,MAAM,IAAI2P,UAAU,8BACxDiO,GAAgB,MAARA,EAAed,KAASc,IAAkB,MAATD,EAAgB,GAAKA,GACzDhe,KAAK8d,OAASrB,IAAazc,OAC1Byc,EAAUA,EAASqB,MAAQ9d,KAC1Bwc,EAAWxc,KAChByc,EAAWzc,MAEbA,KAAK4d,MAAQvd,EACbL,KAAK6d,MAAQI,EACbO,GACF,EACAvG,KAAM,WACAjY,KAAK4d,QACP5d,KAAK4d,MAAQ,KACb5d,KAAK6d,MAAQrH,IACbgI,IAEJ,E,+CC7CF,MAAMtS,EAAW7E,OAAOnH,UAAUgM,SAO3B,SAAS4S,EAAWnb,GACvB,MAAMob,EAAM7S,EAASC,KAAKxI,GAC1B,OAAOob,EAAIC,SAAS,YAAcD,EAAIE,SAAS,MACnD,C,6DCTA,SAASC,EAAIC,GACX,IAAI9c,EAAUzB,UAAUC,OAAS,QAAsBuO,IAAjBxO,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,OAAWue,GACd,MAAM,IAAInP,UAAU,0BAGtB,GAAqB,IAAjBmP,EAAMte,OACR,MAAM,IAAImP,UAAU,2BAGtB,IAAIoP,EAAqB/c,EAAQgd,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmBjd,EAAQkd,QAC3BA,OAA+B,IAArBD,EAA8BH,EAAMte,OAASye,EAE3D,GAAID,EAAY,GAAKA,GAAaF,EAAMte,SAAWyR,OAAOkN,UAAUH,GAClE,MAAM,IAAIra,MAAM,4DAGlB,GAAIua,GAAWF,GAAaE,EAAUJ,EAAMte,SAAWyR,OAAOkN,UAAUD,GACtE,MAAM,IAAIva,MAAM,iFAKlB,IAFA,IAAIya,EAAWN,EAAME,GAEZne,EAAIme,EAAY,EAAGne,EAAIqe,EAASre,IACnCie,EAAMje,GAAKue,IAAUA,EAAWN,EAAMje,IAG5C,OAAOue,CACT,C,6DC/BA,SAASzJ,EAAImJ,GACX,IAAI9c,EAAUzB,UAAUC,OAAS,QAAsBuO,IAAjBxO,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,OAAWue,GACd,MAAM,IAAInP,UAAU,0BAGtB,GAAqB,IAAjBmP,EAAMte,OACR,MAAM,IAAImP,UAAU,2BAGtB,IAAIoP,EAAqB/c,EAAQgd,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmBjd,EAAQkd,QAC3BA,OAA+B,IAArBD,EAA8BH,EAAMte,OAASye,EAE3D,GAAID,EAAY,GAAKA,GAAaF,EAAMte,SAAWyR,OAAOkN,UAAUH,GAClE,MAAM,IAAIra,MAAM,4DAGlB,GAAIua,GAAWF,GAAaE,EAAUJ,EAAMte,SAAWyR,OAAOkN,UAAUD,GACtE,MAAM,IAAIva,MAAM,iFAKlB,IAFA,IAAI0a,EAAWP,EAAME,GAEZne,EAAIme,EAAY,EAAGne,EAAIqe,EAASre,IACnCie,EAAMje,GAAKwe,IAAUA,EAAWP,EAAMje,IAG5C,OAAOwe,CACT,C,iFC7BA,SAASC,EAAQR,GACf,IAQIS,EARAvd,EAAUzB,UAAUC,OAAS,QAAsBuO,IAAjBxO,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,OAAWue,GACd,MAAM,IAAInP,UAAU,0BACf,GAAqB,IAAjBmP,EAAMte,OACf,MAAM,IAAImP,UAAU,2BAKtB,QAAuBZ,IAAnB/M,EAAQud,OAAsB,CAChC,KAAK,OAAWvd,EAAQud,QACtB,MAAM,IAAI5P,UAAU,+CAGtB4P,EAASvd,EAAQud,MACnB,MACEA,EAAS,IAAIxa,MAAM+Z,EAAMte,QAG3B,IAAIgf,GAAa,OAAIV,GACjBW,GAAa,OAAIX,GAErB,GAAIU,IAAeC,EACjB,MAAM,IAAIC,WAAW,+EAGvB,IAAIC,EAAe3d,EAAQ2T,IACvB0J,OAA4B,IAAjBM,EAA0B3d,EAAQ4d,WAAaJ,EAAa,EAAIG,EAC3EE,EAAe7d,EAAQ6c,IACvBO,OAA4B,IAAjBS,EAA0B7d,EAAQ4d,WAAaH,EAAa,EAAII,EAE/E,GAAIR,GAAYD,EACd,MAAM,IAAIM,WAAW,8CAKvB,IAFA,IAAII,GAAUV,EAAWC,IAAaI,EAAaD,GAE1C3e,EAAI,EAAGA,EAAIie,EAAMte,OAAQK,IAChC0e,EAAO1e,IAAMie,EAAMje,GAAK2e,GAAcM,EAAST,EAGjD,OAAOE,CACT,C,iFC3Ce,MAAMQ,EACnBhe,YAAYuB,EAAOtB,EAAU,CAAC,GAG5B,IAFAsB,EAAQ,gBAA4BA,IAE1B0c,UACR,MAAM,IAAIrb,MAAM,4BAGlB,IAAIuQ,EAAI5R,EAAM2c,KACVjV,EAAI1H,EAAM4c,QAEd,MAAM,2BACJC,GAA6B,EAAI,4BACjCC,GAA8B,EAAI,cAClCC,GAAgB,GACdre,EAEJ,IAIIiT,EAJAqL,EAAQC,QAAQJ,GAChBK,EAAQD,QAAQH,GAEhBK,GAAU,EAEd,GAAIvL,EAAIlK,EACN,GAAKqV,EAME,CACLpL,EAAI3R,EAAMod,YACVxL,EAAID,EAAEgL,KACNjV,EAAIiK,EAAEiL,QACNO,GAAU,EACV,IAAIE,EAAML,EACVA,EAAQE,EACRA,EAAQG,CACV,MAbE1L,EAAI3R,EAAMiH,QAEV0D,QAAQC,KACN,+FAYJ+G,EAAI3R,EAAMiH,QAGZ,IAAIqW,EAAK9O,KAAK6D,IAAIT,EAAGlK,GACjB6V,EAAK/O,KAAK6D,IAAIT,EAAI,EAAGlK,GACrBmK,EAAI,IAAIoF,aAAasG,GACrBC,EAAI,IAAI,IAAO5L,EAAG0L,GAClBG,EAAI,IAAI,IAAO/V,EAAGA,GAElB8S,EAAI,IAAIvD,aAAavP,GACrBgW,EAAO,IAAIzG,aAAarF,GAExB+L,EAAK,IAAI1G,aAAasG,GAC1B,IAAK,IAAIhgB,EAAI,EAAGA,EAAIggB,EAAIhgB,IAAKogB,EAAGpgB,GAAKA,EAErC,IAAIqgB,EAAMpP,KAAK6D,IAAIT,EAAI,EAAGlK,GACtBmW,EAAMrP,KAAK+M,IAAI,EAAG/M,KAAK6D,IAAI3K,EAAI,EAAGkK,IAClCkM,EAAMtP,KAAK+M,IAAIqC,EAAKC,GAExB,IAAK,IAAIxV,EAAI,EAAGA,EAAIyV,EAAKzV,IAAK,CAC5B,GAAIA,EAAIuV,EAAK,CACX/L,EAAExJ,GAAK,EACP,IAAK,IAAI9K,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBsU,EAAExJ,IAAK,OAAWwJ,EAAExJ,GAAIsJ,EAAEvQ,IAAI7D,EAAG8K,IAEnC,GAAa,IAATwJ,EAAExJ,GAAU,CACVsJ,EAAEvQ,IAAIiH,EAAGA,GAAK,IAChBwJ,EAAExJ,IAAMwJ,EAAExJ,IAEZ,IAAK,IAAI9K,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBoU,EAAEjP,IAAInF,EAAG8K,EAAGsJ,EAAEvQ,IAAI7D,EAAG8K,GAAKwJ,EAAExJ,IAE9BsJ,EAAEjP,IAAI2F,EAAGA,EAAGsJ,EAAEvQ,IAAIiH,EAAGA,GAAK,EAC5B,CACAwJ,EAAExJ,IAAMwJ,EAAExJ,EACZ,CAEA,IAAK,IAAIgO,EAAIhO,EAAI,EAAGgO,EAAI3O,EAAG2O,IAAK,CAC9B,GAAIhO,EAAIuV,GAAgB,IAAT/L,EAAExJ,GAAU,CACzB,IAAI2G,EAAI,EACR,IAAK,IAAIzR,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrByR,GAAK2C,EAAEvQ,IAAI7D,EAAG8K,GAAKsJ,EAAEvQ,IAAI7D,EAAG8Y,GAE9BrH,GAAKA,EAAI2C,EAAEvQ,IAAIiH,EAAGA,GAClB,IAAK,IAAI9K,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBoU,EAAEjP,IAAInF,EAAG8Y,EAAG1E,EAAEvQ,IAAI7D,EAAG8Y,GAAKrH,EAAI2C,EAAEvQ,IAAI7D,EAAG8K,GAE3C,CACAmS,EAAEnE,GAAK1E,EAAEvQ,IAAIiH,EAAGgO,EAClB,CAEA,GAAI2G,GAAS3U,EAAIuV,EACf,IAAK,IAAIrgB,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBigB,EAAE9a,IAAInF,EAAG8K,EAAGsJ,EAAEvQ,IAAI7D,EAAG8K,IAIzB,GAAIA,EAAIwV,EAAK,CACXrD,EAAEnS,GAAK,EACP,IAAK,IAAI9K,EAAI8K,EAAI,EAAG9K,EAAImK,EAAGnK,IACzBid,EAAEnS,IAAK,OAAWmS,EAAEnS,GAAImS,EAAEjd,IAE5B,GAAa,IAATid,EAAEnS,GAAU,CACVmS,EAAEnS,EAAI,GAAK,IACbmS,EAAEnS,GAAK,EAAImS,EAAEnS,IAEf,IAAK,IAAI9K,EAAI8K,EAAI,EAAG9K,EAAImK,EAAGnK,IACzBid,EAAEjd,IAAMid,EAAEnS,GAEZmS,EAAEnS,EAAI,IAAM,CACd,CAEA,GADAmS,EAAEnS,IAAMmS,EAAEnS,GACNA,EAAI,EAAIuJ,GAAc,IAAT4I,EAAEnS,GAAU,CAC3B,IAAK,IAAI9K,EAAI8K,EAAI,EAAG9K,EAAIqU,EAAGrU,IACzBmgB,EAAKngB,GAAK,EAEZ,IAAK,IAAIA,EAAI8K,EAAI,EAAG9K,EAAIqU,EAAGrU,IACzB,IAAK,IAAI8Y,EAAIhO,EAAI,EAAGgO,EAAI3O,EAAG2O,IACzBqH,EAAKngB,IAAMid,EAAEnE,GAAK1E,EAAEvQ,IAAI7D,EAAG8Y,GAG/B,IAAK,IAAIA,EAAIhO,EAAI,EAAGgO,EAAI3O,EAAG2O,IAAK,CAC9B,IAAIrH,GAAKwL,EAAEnE,GAAKmE,EAAEnS,EAAI,GACtB,IAAK,IAAI9K,EAAI8K,EAAI,EAAG9K,EAAIqU,EAAGrU,IACzBoU,EAAEjP,IAAInF,EAAG8Y,EAAG1E,EAAEvQ,IAAI7D,EAAG8Y,GAAKrH,EAAI0O,EAAKngB,GAEvC,CACF,CACA,GAAI2f,EACF,IAAK,IAAI3f,EAAI8K,EAAI,EAAG9K,EAAImK,EAAGnK,IACzBkgB,EAAE/a,IAAInF,EAAG8K,EAAGmS,EAAEjd,GAGpB,CACF,CAEA,IAAIiQ,EAAIgB,KAAK6D,IAAI3K,EAAGkK,EAAI,GAYxB,GAXIgM,EAAMlW,IACRmK,EAAE+L,GAAOjM,EAAEvQ,IAAIwc,EAAKA,IAElBhM,EAAIpE,IACNqE,EAAErE,EAAI,GAAK,GAETqQ,EAAM,EAAIrQ,IACZgN,EAAEqD,GAAOlM,EAAEvQ,IAAIyc,EAAKrQ,EAAI,IAE1BgN,EAAEhN,EAAI,GAAK,EAEPwP,EAAO,CACT,IAAK,IAAI3G,EAAIuH,EAAKvH,EAAIiH,EAAIjH,IAAK,CAC7B,IAAK,IAAI9Y,EAAI,EAAGA,EAAIqU,EAAGrU,IACrBigB,EAAE9a,IAAInF,EAAG8Y,EAAG,GAEdmH,EAAE9a,IAAI2T,EAAGA,EAAG,EACd,CACA,IAAK,IAAIhO,EAAIuV,EAAM,EAAGvV,GAAK,EAAGA,IAC5B,GAAa,IAATwJ,EAAExJ,GAAU,CACd,IAAK,IAAIgO,EAAIhO,EAAI,EAAGgO,EAAIiH,EAAIjH,IAAK,CAC/B,IAAIrH,EAAI,EACR,IAAK,IAAIzR,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrByR,GAAKwO,EAAEpc,IAAI7D,EAAG8K,GAAKmV,EAAEpc,IAAI7D,EAAG8Y,GAE9BrH,GAAKA,EAAIwO,EAAEpc,IAAIiH,EAAGA,GAClB,IAAK,IAAI9K,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBigB,EAAE9a,IAAInF,EAAG8Y,EAAGmH,EAAEpc,IAAI7D,EAAG8Y,GAAKrH,EAAIwO,EAAEpc,IAAI7D,EAAG8K,GAE3C,CACA,IAAK,IAAI9K,EAAI8K,EAAG9K,EAAIqU,EAAGrU,IACrBigB,EAAE9a,IAAInF,EAAG8K,GAAImV,EAAEpc,IAAI7D,EAAG8K,IAExBmV,EAAE9a,IAAI2F,EAAGA,EAAG,EAAImV,EAAEpc,IAAIiH,EAAGA,IACzB,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAI,EAAG9K,IACzBigB,EAAE9a,IAAInF,EAAG8K,EAAG,EAEhB,KAAO,CACL,IAAK,IAAI9K,EAAI,EAAGA,EAAIqU,EAAGrU,IACrBigB,EAAE9a,IAAInF,EAAG8K,EAAG,GAEdmV,EAAE9a,IAAI2F,EAAGA,EAAG,EACd,CAEJ,CAEA,GAAI6U,EACF,IAAK,IAAI7U,EAAIX,EAAI,EAAGW,GAAK,EAAGA,IAAK,CAC/B,GAAIA,EAAIwV,GAAgB,IAATrD,EAAEnS,GACf,IAAK,IAAIgO,EAAIhO,EAAI,EAAGgO,EAAI3O,EAAG2O,IAAK,CAC9B,IAAIrH,EAAI,EACR,IAAK,IAAIzR,EAAI8K,EAAI,EAAG9K,EAAImK,EAAGnK,IACzByR,GAAKyO,EAAErc,IAAI7D,EAAG8K,GAAKoV,EAAErc,IAAI7D,EAAG8Y,GAE9BrH,GAAKA,EAAIyO,EAAErc,IAAIiH,EAAI,EAAGA,GACtB,IAAK,IAAI9K,EAAI8K,EAAI,EAAG9K,EAAImK,EAAGnK,IACzBkgB,EAAE/a,IAAInF,EAAG8Y,EAAGoH,EAAErc,IAAI7D,EAAG8Y,GAAKrH,EAAIyO,EAAErc,IAAI7D,EAAG8K,GAE3C,CAEF,IAAK,IAAI9K,EAAI,EAAGA,EAAImK,EAAGnK,IACrBkgB,EAAE/a,IAAInF,EAAG8K,EAAG,GAEdoV,EAAE/a,IAAI2F,EAAGA,EAAG,EACd,CAGF,IAAI0V,EAAKvQ,EAAI,EACTwQ,EAAO,EACPC,EAAMtP,OAAOuP,QACjB,KAAO1Q,EAAI,GAAG,CACZ,IAAInF,EAAG8V,EACP,IAAK9V,EAAImF,EAAI,EAAGnF,IAAM,IACT,IAAPA,EADmBA,IAAK,CAI5B,MAAMkK,EACJ5D,OAAOyP,UAAYH,EAAMzP,KAAK0E,IAAIrB,EAAExJ,GAAKmG,KAAK0E,IAAIrB,EAAExJ,EAAI,KAC1D,GAAImG,KAAK0E,IAAIsH,EAAEnS,KAAOkK,GAAS5D,OAAO+F,MAAM8F,EAAEnS,IAAK,CACjDmS,EAAEnS,GAAK,EACP,KACF,CACF,CACA,GAAIA,IAAMmF,EAAI,EACZ2Q,EAAO,MACF,CACL,IAAIE,EACJ,IAAKA,EAAK7Q,EAAI,EAAG6Q,GAAMhW,GACjBgW,IAAOhW,EADagW,IAAM,CAI9B,IAAIrP,GACDqP,IAAO7Q,EAAIgB,KAAK0E,IAAIsH,EAAE6D,IAAO,IAC7BA,IAAOhW,EAAI,EAAImG,KAAK0E,IAAIsH,EAAE6D,EAAK,IAAM,GACxC,GAAI7P,KAAK0E,IAAIrB,EAAEwM,KAAQJ,EAAMjP,EAAG,CAC9B6C,EAAEwM,GAAM,EACR,KACF,CACF,CACIA,IAAOhW,EACT8V,EAAO,EACEE,IAAO7Q,EAAI,EACpB2Q,EAAO,GAEPA,EAAO,EACP9V,EAAIgW,EAER,CAIA,OAFAhW,IAEQ8V,GACN,KAAK,EAAG,CACN,IAAItE,EAAIW,EAAEhN,EAAI,GACdgN,EAAEhN,EAAI,GAAK,EACX,IAAK,IAAI6I,EAAI7I,EAAI,EAAG6I,GAAKhO,EAAGgO,IAAK,CAC/B,IAAIrH,GAAI,OAAW6C,EAAEwE,GAAIwD,GACrByE,EAAKzM,EAAEwE,GAAKrH,EACZuP,EAAK1E,EAAI7K,EAMb,GALA6C,EAAEwE,GAAKrH,EACHqH,IAAMhO,IACRwR,GAAK0E,EAAK/D,EAAEnE,EAAI,GAChBmE,EAAEnE,EAAI,GAAKiI,EAAK9D,EAAEnE,EAAI,IAEpB6G,EACF,IAAK,IAAI3f,EAAI,EAAGA,EAAImK,EAAGnK,IACrByR,EAAIsP,EAAKb,EAAErc,IAAI7D,EAAG8Y,GAAKkI,EAAKd,EAAErc,IAAI7D,EAAGiQ,EAAI,GACzCiQ,EAAE/a,IAAInF,EAAGiQ,EAAI,GAAI+Q,EAAKd,EAAErc,IAAI7D,EAAG8Y,GAAKiI,EAAKb,EAAErc,IAAI7D,EAAGiQ,EAAI,IACtDiQ,EAAE/a,IAAInF,EAAG8Y,EAAGrH,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,IAAI6K,EAAIW,EAAEnS,EAAI,GACdmS,EAAEnS,EAAI,GAAK,EACX,IAAK,IAAIgO,EAAIhO,EAAGgO,EAAI7I,EAAG6I,IAAK,CAC1B,IAAIrH,GAAI,OAAW6C,EAAEwE,GAAIwD,GACrByE,EAAKzM,EAAEwE,GAAKrH,EACZuP,EAAK1E,EAAI7K,EAIb,GAHA6C,EAAEwE,GAAKrH,EACP6K,GAAK0E,EAAK/D,EAAEnE,GACZmE,EAAEnE,GAAKiI,EAAK9D,EAAEnE,GACV2G,EACF,IAAK,IAAIzf,EAAI,EAAGA,EAAIqU,EAAGrU,IACrByR,EAAIsP,EAAKd,EAAEpc,IAAI7D,EAAG8Y,GAAKkI,EAAKf,EAAEpc,IAAI7D,EAAG8K,EAAI,GACzCmV,EAAE9a,IAAInF,EAAG8K,EAAI,GAAIkW,EAAKf,EAAEpc,IAAI7D,EAAG8Y,GAAKiI,EAAKd,EAAEpc,IAAI7D,EAAG8K,EAAI,IACtDmV,EAAE9a,IAAInF,EAAG8Y,EAAGrH,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,MAAMwP,EAAQhQ,KAAK+M,IACjB/M,KAAK0E,IAAIrB,EAAErE,EAAI,IACfgB,KAAK0E,IAAIrB,EAAErE,EAAI,IACfgB,KAAK0E,IAAIsH,EAAEhN,EAAI,IACfgB,KAAK0E,IAAIrB,EAAExJ,IACXmG,KAAK0E,IAAIsH,EAAEnS,KAEPoW,EAAK5M,EAAErE,EAAI,GAAKgR,EAChBE,EAAO7M,EAAErE,EAAI,GAAKgR,EAClBG,EAAOnE,EAAEhN,EAAI,GAAKgR,EAClBI,EAAK/M,EAAExJ,GAAKmW,EACZK,EAAKrE,EAAEnS,GAAKmW,EACZhM,IAAMkM,EAAOD,IAAOC,EAAOD,GAAME,EAAOA,GAAQ,EAChDxP,EAAIsP,EAAKE,GAAQF,EAAKE,GAC5B,IAAInZ,EAAQ,EACF,IAANgN,GAAiB,IAANrD,IAEX3J,EADEgN,EAAI,EACE,EAAIhE,KAAKgD,KAAKgB,EAAIA,EAAIrD,GAEtBX,KAAKgD,KAAKgB,EAAIA,EAAIrD,GAE5B3J,EAAQ2J,GAAKqD,EAAIhN,IAEnB,IAAIqU,GAAK+E,EAAKH,IAAOG,EAAKH,GAAMjZ,EAC5BsZ,EAAIF,EAAKC,EACb,IAAK,IAAIxI,EAAIhO,EAAGgO,EAAI7I,EAAI,EAAG6I,IAAK,CAC9B,IAAIrH,GAAI,OAAW6K,EAAGiF,GACZ,IAAN9P,IAASA,EAAIL,OAAOyP,WACxB,IAAIE,EAAKzE,EAAI7K,EACTuP,EAAKO,EAAI9P,EAQb,GAPIqH,IAAMhO,IACRmS,EAAEnE,EAAI,GAAKrH,GAEb6K,EAAIyE,EAAKzM,EAAEwE,GAAKkI,EAAK/D,EAAEnE,GACvBmE,EAAEnE,GAAKiI,EAAK9D,EAAEnE,GAAKkI,EAAK1M,EAAEwE,GAC1ByI,EAAIP,EAAK1M,EAAEwE,EAAI,GACfxE,EAAEwE,EAAI,GAAKiI,EAAKzM,EAAEwE,EAAI,GAClB6G,EACF,IAAK,IAAI3f,EAAI,EAAGA,EAAImK,EAAGnK,IACrByR,EAAIsP,EAAKb,EAAErc,IAAI7D,EAAG8Y,GAAKkI,EAAKd,EAAErc,IAAI7D,EAAG8Y,EAAI,GACzCoH,EAAE/a,IAAInF,EAAG8Y,EAAI,GAAIkI,EAAKd,EAAErc,IAAI7D,EAAG8Y,GAAKiI,EAAKb,EAAErc,IAAI7D,EAAG8Y,EAAI,IACtDoH,EAAE/a,IAAInF,EAAG8Y,EAAGrH,GAYhB,GATAA,GAAI,OAAW6K,EAAGiF,GACR,IAAN9P,IAASA,EAAIL,OAAOyP,WACxBE,EAAKzE,EAAI7K,EACTuP,EAAKO,EAAI9P,EACT6C,EAAEwE,GAAKrH,EACP6K,EAAIyE,EAAK9D,EAAEnE,GAAKkI,EAAK1M,EAAEwE,EAAI,GAC3BxE,EAAEwE,EAAI,IAAMkI,EAAK/D,EAAEnE,GAAKiI,EAAKzM,EAAEwE,EAAI,GACnCyI,EAAIP,EAAK/D,EAAEnE,EAAI,GACfmE,EAAEnE,EAAI,GAAKiI,EAAK9D,EAAEnE,EAAI,GAClB2G,GAAS3G,EAAIzE,EAAI,EACnB,IAAK,IAAIrU,EAAI,EAAGA,EAAIqU,EAAGrU,IACrByR,EAAIsP,EAAKd,EAAEpc,IAAI7D,EAAG8Y,GAAKkI,EAAKf,EAAEpc,IAAI7D,EAAG8Y,EAAI,GACzCmH,EAAE9a,IAAInF,EAAG8Y,EAAI,GAAIkI,EAAKf,EAAEpc,IAAI7D,EAAG8Y,GAAKiI,EAAKd,EAAEpc,IAAI7D,EAAG8Y,EAAI,IACtDmH,EAAE9a,IAAInF,EAAG8Y,EAAGrH,EAGlB,CACAwL,EAAEhN,EAAI,GAAKqM,EACXmE,GAAc,EACd,KACF,CACA,KAAK,EACH,GAAInM,EAAExJ,IAAM,IACVwJ,EAAExJ,GAAKwJ,EAAExJ,GAAK,GAAKwJ,EAAExJ,GAAK,EACtB6U,GACF,IAAK,IAAI3f,EAAI,EAAGA,GAAKwgB,EAAIxgB,IACvBkgB,EAAE/a,IAAInF,EAAG8K,GAAIoV,EAAErc,IAAI7D,EAAG8K,IAI5B,KAAOA,EAAI0V,KACLlM,EAAExJ,IAAMwJ,EAAExJ,EAAI,KADL,CAIb,IAAI2G,EAAI6C,EAAExJ,GAGV,GAFAwJ,EAAExJ,GAAKwJ,EAAExJ,EAAI,GACbwJ,EAAExJ,EAAI,GAAK2G,EACPkO,GAAS7U,EAAIX,EAAI,EACnB,IAAK,IAAInK,EAAI,EAAGA,EAAImK,EAAGnK,IACrByR,EAAIyO,EAAErc,IAAI7D,EAAG8K,EAAI,GACjBoV,EAAE/a,IAAInF,EAAG8K,EAAI,EAAGoV,EAAErc,IAAI7D,EAAG8K,IACzBoV,EAAE/a,IAAInF,EAAG8K,EAAG2G,GAGhB,GAAIgO,GAAS3U,EAAIuJ,EAAI,EACnB,IAAK,IAAIrU,EAAI,EAAGA,EAAIqU,EAAGrU,IACrByR,EAAIwO,EAAEpc,IAAI7D,EAAG8K,EAAI,GACjBmV,EAAE9a,IAAInF,EAAG8K,EAAI,EAAGmV,EAAEpc,IAAI7D,EAAG8K,IACzBmV,EAAE9a,IAAInF,EAAG8K,EAAG2G,GAGhB3G,GACF,CACA2V,EAAO,EACPxQ,IAKN,CAEA,GAAI2P,EAAS,CACX,IAAI4B,EAAMtB,EACVA,EAAID,EACJA,EAAIuB,CACN,CAEA1iB,KAAKuV,EAAIA,EACTvV,KAAKqL,EAAIA,EACTrL,KAAKwV,EAAIA,EACTxV,KAAKmhB,EAAIA,EACTnhB,KAAKohB,EAAIA,CACX,CAEAuB,MAAMhf,GACJ,IAAIif,EAAIjf,EACJwa,EAAIne,KAAK6iB,UACTC,EAAQ9iB,KAAKwV,EAAE3U,OACfkiB,EAAK,UAAaD,EAAOA,GAE7B,IAAK,IAAI5hB,EAAI,EAAGA,EAAI4hB,EAAO5hB,IACrBiR,KAAK0E,IAAI7W,KAAKwV,EAAEtU,KAAOid,EACzB4E,EAAG1c,IAAInF,EAAGA,EAAG,GAEb6hB,EAAG1c,IAAInF,EAAGA,EAAG,EAAIlB,KAAKwV,EAAEtU,IAI5B,IAAIigB,EAAInhB,KAAKmhB,EACTC,EAAIphB,KAAKgjB,qBAETC,EAAK7B,EAAE8B,KAAKH,GACZI,EAAQ/B,EAAEd,KACV8C,EAAQjC,EAAEb,KACV+C,EAAM,UAAaF,EAAOC,GAE9B,IAAK,IAAIliB,EAAI,EAAGA,EAAIiiB,EAAOjiB,IACzB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIoJ,EAAOpJ,IAAK,CAC9B,IAAIsJ,EAAM,EACV,IAAK,IAAItX,EAAI,EAAGA,EAAI8W,EAAO9W,IACzBsX,GAAOL,EAAGle,IAAI7D,EAAG8K,GAAKmV,EAAEpc,IAAIiV,EAAGhO,GAEjCqX,EAAIhd,IAAInF,EAAG8Y,EAAGsJ,EAChB,CAGF,OAAOD,EAAIH,KAAKN,EAClB,CAEAW,iBAAiB5f,GACf,OAAO3D,KAAK2iB,MAAM,SAAYhf,GAChC,CAEA6f,UACE,IAAIpC,EAAIphB,KAAKohB,EACTjD,EAAIne,KAAK6iB,UACTM,EAAQ/B,EAAEd,KACVmD,EAAQrC,EAAEb,QACVmD,EAAI,IAAI,IAAOP,EAAOnjB,KAAKwV,EAAE3U,QAEjC,IAAK,IAAIK,EAAI,EAAGA,EAAIiiB,EAAOjiB,IACzB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIyJ,EAAOzJ,IACrB7H,KAAK0E,IAAI7W,KAAKwV,EAAEwE,IAAMmE,GACxBuF,EAAErd,IAAInF,EAAG8Y,EAAGoH,EAAErc,IAAI7D,EAAG8Y,GAAKha,KAAKwV,EAAEwE,IAKvC,IAAImH,EAAInhB,KAAKmhB,EAETiC,EAAQjC,EAAEb,KACVqD,EAAQxC,EAAEZ,QACVqC,EAAI,IAAI,IAAOO,EAAOC,GAE1B,IAAK,IAAIliB,EAAI,EAAGA,EAAIiiB,EAAOjiB,IACzB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIoJ,EAAOpJ,IAAK,CAC9B,IAAIsJ,EAAM,EACV,IAAK,IAAItX,EAAI,EAAGA,EAAI2X,EAAO3X,IACzBsX,GAAOI,EAAE3e,IAAI7D,EAAG8K,GAAKmV,EAAEpc,IAAIiV,EAAGhO,GAEhC4W,EAAEvc,IAAInF,EAAG8Y,EAAGsJ,EACd,CAGF,OAAOV,CACT,CAEIgB,gBACF,OAAO5jB,KAAKwV,EAAE,GAAKxV,KAAKwV,EAAErD,KAAK6D,IAAIhW,KAAKuV,EAAGvV,KAAKqL,GAAK,EACvD,CAEIwY,YACF,OAAO7jB,KAAKwV,EAAE,EAChB,CAEIsO,WACF,IAAIC,EAAM5R,KAAK+M,IAAIlf,KAAKuV,EAAGvV,KAAKqL,GAAKrL,KAAKwV,EAAE,GAAKlD,OAAOuP,QACpD3Q,EAAI,EACJsE,EAAIxV,KAAKwV,EACb,IAAK,IAAItU,EAAI,EAAG8iB,EAAKxO,EAAE3U,OAAQK,EAAI8iB,EAAI9iB,IACjCsU,EAAEtU,GAAK6iB,GACT7S,IAGJ,OAAOA,CACT,CAEI+S,eACF,OAAO7e,MAAMC,KAAKrF,KAAKwV,EACzB,CAEIqN,gBACF,OAAQvQ,OAAOuP,QAAU,EAAK1P,KAAK+M,IAAIlf,KAAKuV,EAAGvV,KAAKqL,GAAKrL,KAAKwV,EAAE,EAClE,CAEI0O,0BACF,OAAOlkB,KAAKmhB,CACd,CAEI6B,2BACF,OAAOhjB,KAAKohB,CACd,CAEI+C,qBACF,OAAO,SAAYnkB,KAAKwV,EAC1B,E,8BC7gBK,SAAS4O,EAAW9O,EAAGa,GAC5B,IAAIjF,EAAI,EACR,OAAIiB,KAAK0E,IAAIvB,GAAKnD,KAAK0E,IAAIV,IACzBjF,EAAIiF,EAAIb,EACDnD,KAAK0E,IAAIvB,GAAKnD,KAAKgD,KAAK,EAAIjE,EAAIA,IAE/B,IAANiF,GACFjF,EAAIoE,EAAIa,EACDhE,KAAK0E,IAAIV,GAAKhE,KAAKgD,KAAK,EAAIjE,EAAIA,IAElC,CACT,C,uECXA,MAAMmT,EAAS,IAAIC,OAAO,GACpBC,EAAa,IAAID,OAAO,GAEvB,SAASE,IACd,OAAOC,EAAyBzkB,KAClC,CAEO,SAASykB,EAAyBC,EAAQriB,EAAU,CAAC,GAC1D,MAAM,QACJsiB,EAAU,GAAE,WACZC,EAAa,GAAE,WACfC,EAAa,EAAC,SACdC,EAAW,QACTziB,EACJ,MAAO,GAAGqiB,EAAOtiB,YAAYsL,WAC7B2W,OACAE,IAOF,SAAqBG,EAAQC,EAASC,EAAYC,EAAYC,GAC5D,MAAM,KAAExE,EAAI,QAAEC,GAAYmE,EACpBK,EAAO5S,KAAK6D,IAAIsK,EAAMqE,GACtBK,EAAO7S,KAAK6D,IAAIuK,EAASqE,GACzBK,EAAS,GAEf,GAAiB,SAAbH,EAAqB,CACvBA,GAAW,EACXI,EAAM,IAAK,IAAIhkB,EAAI,EAAGA,EAAI6jB,EAAM7jB,IAC9B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIgL,EAAMhL,IACxB,GAAI0K,EAAO3f,IAAI7D,EAAG8Y,GAAK,EAAG,CACxB8K,GAAW,EACX,MAAMI,CACR,CAGN,CAEA,IAAK,IAAIhkB,EAAI,EAAGA,EAAI6jB,EAAM7jB,IAAK,CAC7B,IAAIikB,EAAO,GACX,IAAK,IAAInL,EAAI,EAAGA,EAAIgL,EAAMhL,IACxBmL,EAAK5kB,KAAK6kB,EAAaV,EAAO3f,IAAI7D,EAAG8Y,GAAI6K,EAAYC,IAEvDG,EAAO1kB,KAAK,GAAG4kB,EAAK3S,KAAK,OAC3B,CAOA,OANIwS,IAASzE,IACX0E,EAAOA,EAAOpkB,OAAS,IAAM,QAAQ0f,EAAUqE,kBAE7CG,IAASzE,GACX2E,EAAO1kB,KAAK,OAAO+f,EAAOqE,eAErBM,EAAOzS,KAAK,KAAK+R,IAC1B,CAvCec,CAAYX,EAAQC,EAASC,EAAYC,EAAYC,OAClET,OACAA,UAAeK,EAAOpE,SACtB+D,aAAkBK,EAAOnE,YAE3B,CAoCA,SAAS6E,EAAaE,EAAKT,EAAYC,GACrC,OACEQ,GAAO,GAAKR,EACR,IAAIS,EAAcD,EAAKT,EAAa,KACpCU,EAAcD,EAAKT,IACvBW,OAAOX,EACX,CAEA,SAASU,EAAcD,EAAKG,GAE1B,IAAIxZ,EAAMqZ,EAAIpZ,WACd,GAAID,EAAIpL,QAAU4kB,EAAK,OAAOxZ,EAI9B,IAAIyZ,EAAMJ,EAAIK,QAAQF,GAItB,GAHIC,EAAI7kB,OAAS4kB,IACfC,EAAMJ,EAAIK,QAAQxT,KAAK+M,IAAI,EAAGuG,GAAOC,EAAI7kB,OAAS4kB,MAGlDC,EAAI7kB,QAAU4kB,IACbC,EAAIE,WAAW,WACfF,EAAIE,WAAW,UAEhB,OAAOF,EAIT,IAAIG,EAAMP,EAAIQ,cAAcL,GAI5B,OAHII,EAAIhlB,OAAS4kB,IACfI,EAAMP,EAAIQ,cAAc3T,KAAK+M,IAAI,EAAGuG,GAAOI,EAAIhlB,OAAS4kB,MAEnDI,EAAIjX,MAAM,EACnB,C,8BC1FO,SAASmX,EAAsBC,EAAgBC,GACpDD,EAAe9lB,UAAU8H,IAAM,SAAarE,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAKkmB,KAAKviB,GACzC3D,KAAKmmB,KAAKxiB,EACnB,EAEAqiB,EAAe9lB,UAAUgmB,KAAO,SAAcviB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUimB,KAAO,SAAczB,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAehe,IAAM,SAAa0c,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZ1c,IAAIrE,EACvB,EAEAqiB,EAAe9lB,UAAUmmB,IAAM,SAAa1iB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAKsmB,KAAK3iB,GACzC3D,KAAKumB,KAAK5iB,EACnB,EAEAqiB,EAAe9lB,UAAUomB,KAAO,SAAc3iB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUqmB,KAAO,SAAc7B,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAeK,IAAM,SAAa3B,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZ2B,IAAI1iB,EACvB,EACAqiB,EAAe9lB,UAAUsmB,SAAWR,EAAe9lB,UAAUmmB,IAC7DL,EAAe9lB,UAAUumB,UAAYT,EAAe9lB,UAAUomB,KAC9DN,EAAe9lB,UAAUwmB,UAAYV,EAAe9lB,UAAUqmB,KAC9DP,EAAeQ,SAAWR,EAAeK,IAEzCL,EAAe9lB,UAAUymB,IAAM,SAAahjB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAK4mB,KAAKjjB,GACzC3D,KAAK6mB,KAAKljB,EACnB,EAEAqiB,EAAe9lB,UAAU0mB,KAAO,SAAcjjB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAU2mB,KAAO,SAAcnC,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAeW,IAAM,SAAajC,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZiC,IAAIhjB,EACvB,EACAqiB,EAAe9lB,UAAU4mB,SAAWd,EAAe9lB,UAAUymB,IAC7DX,EAAe9lB,UAAU6mB,UAAYf,EAAe9lB,UAAU0mB,KAC9DZ,EAAe9lB,UAAU8mB,UAAYhB,EAAe9lB,UAAU2mB,KAC9Db,EAAec,SAAWd,EAAeW,IAEzCX,EAAe9lB,UAAU+mB,IAAM,SAAatjB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAKknB,KAAKvjB,GACzC3D,KAAKmnB,KAAKxjB,EACnB,EAEAqiB,EAAe9lB,UAAUgnB,KAAO,SAAcvjB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUinB,KAAO,SAAczC,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAeiB,IAAM,SAAavC,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZuC,IAAItjB,EACvB,EACAqiB,EAAe9lB,UAAUknB,OAASpB,EAAe9lB,UAAU+mB,IAC3DjB,EAAe9lB,UAAUmnB,QAAUrB,EAAe9lB,UAAUgnB,KAC5DlB,EAAe9lB,UAAUonB,QAAUtB,EAAe9lB,UAAUinB,KAC5DnB,EAAeoB,OAASpB,EAAeiB,IAEvCjB,EAAe9lB,UAAUqnB,IAAM,SAAa5jB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAKwnB,KAAK7jB,GACzC3D,KAAKynB,KAAK9jB,EACnB,EAEAqiB,EAAe9lB,UAAUsnB,KAAO,SAAc7jB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUunB,KAAO,SAAc/C,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAeuB,IAAM,SAAa7C,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZ6C,IAAI5jB,EACvB,EACAqiB,EAAe9lB,UAAUwnB,QAAU1B,EAAe9lB,UAAUqnB,IAC5DvB,EAAe9lB,UAAUynB,SAAW3B,EAAe9lB,UAAUsnB,KAC7DxB,EAAe9lB,UAAU0nB,SAAW5B,EAAe9lB,UAAUunB,KAC7DzB,EAAe0B,QAAU1B,EAAeuB,IAExCvB,EAAe9lB,UAAU2nB,IAAM,SAAalkB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAK8nB,KAAKnkB,GACzC3D,KAAK+nB,KAAKpkB,EACnB,EAEAqiB,EAAe9lB,UAAU4nB,KAAO,SAAcnkB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAU6nB,KAAO,SAAcrD,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAe6B,IAAM,SAAanD,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZmD,IAAIlkB,EACvB,EAEAqiB,EAAe9lB,UAAU8nB,GAAK,SAAYrkB,GACxC,MAAqB,iBAAVA,EAA2B3D,KAAKioB,IAAItkB,GACxC3D,KAAKkoB,IAAIvkB,EAClB,EAEAqiB,EAAe9lB,UAAU+nB,IAAM,SAAatkB,GAC1C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUgoB,IAAM,SAAaxD,GAE1C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAegC,GAAK,SAAYtD,EAAQ/gB,GAEtC,OADkB,IAAIsiB,EAAOvB,GACZsD,GAAGrkB,EACtB,EAEAqiB,EAAe9lB,UAAUioB,IAAM,SAAaxkB,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAKooB,KAAKzkB,GACzC3D,KAAKqoB,KAAK1kB,EACnB,EAEAqiB,EAAe9lB,UAAUkoB,KAAO,SAAczkB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKrW,GAGpC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUmoB,KAAO,SAAc3D,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAK0K,EAAO3f,IAAI7D,EAAG8Y,IAGlD,OAAOha,IACT,EAEAgmB,EAAemC,IAAM,SAAazD,EAAQ/gB,GAExC,OADkB,IAAIsiB,EAAOvB,GACZyD,IAAIxkB,EACvB,EAEAqiB,EAAe9lB,UAAUooB,UAAY,SAAmB3kB,GACtD,MAAqB,iBAAVA,EAA2B3D,KAAKuoB,WAAW5kB,GAC/C3D,KAAKwoB,WAAW7kB,EACzB,EAEAqiB,EAAe9lB,UAAUqoB,WAAa,SAAoB5kB,GACxD,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,IAAMrW,GAGrC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUsoB,WAAa,SAAoB9D,GAExD,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,IAAM0K,EAAO3f,IAAI7D,EAAG8Y,IAGnD,OAAOha,IACT,EAEAgmB,EAAesC,UAAY,SAAmB5D,EAAQ/gB,GAEpD,OADkB,IAAIsiB,EAAOvB,GACZ4D,UAAU3kB,EAC7B,EAEAqiB,EAAe9lB,UAAUuoB,0BAA4B,SAAmC9kB,GACtF,MAAqB,iBAAVA,EAA2B3D,KAAK0oB,2BAA2B/kB,GAC/D3D,KAAK2oB,2BAA2BhlB,EACzC,EAEAqiB,EAAe9lB,UAAUwoB,2BAA6B,SAAoC/kB,GACxF,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,IAAMrW,GAGrC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUyoB,2BAA6B,SAAoCjE,GAExF,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,IAAM0K,EAAO3f,IAAI7D,EAAG8Y,IAGnD,OAAOha,IACT,EAEAgmB,EAAeyC,0BAA4B,SAAmC/D,EAAQ/gB,GAEpF,OADkB,IAAIsiB,EAAOvB,GACZ+D,0BAA0B9kB,EAC7C,EAEAqiB,EAAe9lB,UAAU0oB,WAAa,SAAoBjlB,GACxD,MAAqB,iBAAVA,EAA2B3D,KAAK6oB,YAAYllB,GAChD3D,KAAK8oB,YAAYnlB,EAC1B,EAEAqiB,EAAe9lB,UAAU2oB,YAAc,SAAqBllB,GAC1D,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,KAAOrW,GAGtC,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAU4oB,YAAc,SAAqBpE,GAE1D,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,KAAO0K,EAAO3f,IAAI7D,EAAG8Y,IAGpD,OAAOha,IACT,EAEAgmB,EAAe4C,WAAa,SAAoBlE,EAAQ/gB,GAEtD,OADkB,IAAIsiB,EAAOvB,GACZkE,WAAWjlB,EAC9B,EACAqiB,EAAe9lB,UAAU6oB,mBAAqB/C,EAAe9lB,UAAU0oB,WACvE5C,EAAe9lB,UAAU8oB,oBAAsBhD,EAAe9lB,UAAU2oB,YACxE7C,EAAe9lB,UAAU+oB,oBAAsBjD,EAAe9lB,UAAU4oB,YACxE9C,EAAe+C,mBAAqB/C,EAAe4C,WAEnD5C,EAAe9lB,UAAUgpB,IAAM,WAC7B,IAAK,IAAIhoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,GAAKha,KAAK+E,IAAI7D,EAAG8Y,IAGjC,OAAOha,IACT,EAEAgmB,EAAekD,IAAM,SAAaxE,GAEhC,OADkB,IAAIuB,EAAOvB,GACZwE,KACnB,EAEAlD,EAAe9lB,UAAU2W,IAAM,WAC7B,IAAK,IAAI3V,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK0E,IAAI7W,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAenP,IAAM,SAAa6N,GAEhC,OADkB,IAAIuB,EAAOvB,GACZ7N,KACnB,EAEAmP,EAAe9lB,UAAUipB,KAAO,WAC9B,IAAK,IAAIjoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKgX,KAAKnpB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAemD,KAAO,SAAczE,GAElC,OADkB,IAAIuB,EAAOvB,GACZyE,MACnB,EAEAnD,EAAe9lB,UAAUkpB,MAAQ,WAC/B,IAAK,IAAIloB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKiX,MAAMppB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAeoD,MAAQ,SAAe1E,GAEpC,OADkB,IAAIuB,EAAOvB,GACZ0E,OACnB,EAEApD,EAAe9lB,UAAUmpB,KAAO,WAC9B,IAAK,IAAInoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKkX,KAAKrpB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeqD,KAAO,SAAc3E,GAElC,OADkB,IAAIuB,EAAOvB,GACZ2E,MACnB,EAEArD,EAAe9lB,UAAUopB,MAAQ,WAC/B,IAAK,IAAIpoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKmX,MAAMtpB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAesD,MAAQ,SAAe5E,GAEpC,OADkB,IAAIuB,EAAOvB,GACZ4E,OACnB,EAEAtD,EAAe9lB,UAAUqpB,KAAO,WAC9B,IAAK,IAAIroB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKoX,KAAKvpB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeuD,KAAO,SAAc7E,GAElC,OADkB,IAAIuB,EAAOvB,GACZ6E,MACnB,EAEAvD,EAAe9lB,UAAUspB,MAAQ,WAC/B,IAAK,IAAItoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKqX,MAAMxpB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAewD,MAAQ,SAAe9E,GAEpC,OADkB,IAAIuB,EAAOvB,GACZ8E,OACnB,EAEAxD,EAAe9lB,UAAUupB,KAAO,WAC9B,IAAK,IAAIvoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKsX,KAAKzpB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeyD,KAAO,SAAc/E,GAElC,OADkB,IAAIuB,EAAOvB,GACZ+E,MACnB,EAEAzD,EAAe9lB,UAAUwpB,KAAO,WAC9B,IAAK,IAAIxoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKuX,KAAK1pB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAe0D,KAAO,SAAchF,GAElC,OADkB,IAAIuB,EAAOvB,GACZgF,MACnB,EAEA1D,EAAe9lB,UAAUypB,MAAQ,WAC/B,IAAK,IAAIzoB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKwX,MAAM3pB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAe2D,MAAQ,SAAejF,GAEpC,OADkB,IAAIuB,EAAOvB,GACZiF,OACnB,EAEA3D,EAAe9lB,UAAUqY,IAAM,WAC7B,IAAK,IAAIrX,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKoG,IAAIvY,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAezN,IAAM,SAAamM,GAEhC,OADkB,IAAIuB,EAAOvB,GACZnM,KACnB,EAEAyN,EAAe9lB,UAAU0pB,KAAO,WAC9B,IAAK,IAAI1oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKyX,KAAK5pB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAe4D,KAAO,SAAclF,GAElC,OADkB,IAAIuB,EAAOvB,GACZkF,MACnB,EAEA5D,EAAe9lB,UAAU2lB,IAAM,WAC7B,IAAK,IAAI3kB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK0T,IAAI7lB,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAeH,IAAM,SAAanB,GAEhC,OADkB,IAAIuB,EAAOvB,GACZmB,KACnB,EAEAG,EAAe9lB,UAAU2pB,MAAQ,WAC/B,IAAK,IAAI3oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK0X,MAAM7pB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAe6D,MAAQ,SAAenF,GAEpC,OADkB,IAAIuB,EAAOvB,GACZmF,OACnB,EAEA7D,EAAe9lB,UAAUkS,MAAQ,WAC/B,IAAK,IAAIlR,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKC,MAAMpS,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAe5T,MAAQ,SAAesS,GAEpC,OADkB,IAAIuB,EAAOvB,GACZtS,OACnB,EAEA4T,EAAe9lB,UAAU4pB,OAAS,WAChC,IAAK,IAAI5oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK2X,OAAO9pB,KAAK+E,IAAI7D,EAAG8Y,KAG3C,OAAOha,IACT,EAEAgmB,EAAe8D,OAAS,SAAgBpF,GAEtC,OADkB,IAAIuB,EAAOvB,GACZoF,QACnB,EAEA9D,EAAe9lB,UAAU6pB,IAAM,WAC7B,IAAK,IAAI7oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK4X,IAAI/pB,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAe+D,IAAM,SAAarF,GAEhC,OADkB,IAAIuB,EAAOvB,GACZqF,KACnB,EAEA/D,EAAe9lB,UAAU8pB,MAAQ,WAC/B,IAAK,IAAI9oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK6X,MAAMhqB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAegE,MAAQ,SAAetF,GAEpC,OADkB,IAAIuB,EAAOvB,GACZsF,OACnB,EAEAhE,EAAe9lB,UAAU+pB,MAAQ,WAC/B,IAAK,IAAI/oB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK8X,MAAMjqB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAeiE,MAAQ,SAAevF,GAEpC,OADkB,IAAIuB,EAAOvB,GACZuF,OACnB,EAEAjE,EAAe9lB,UAAUgqB,KAAO,WAC9B,IAAK,IAAIhpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAK+X,KAAKlqB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAekE,KAAO,SAAcxF,GAElC,OADkB,IAAIuB,EAAOvB,GACZwF,MACnB,EAEAlE,EAAe9lB,UAAUiqB,MAAQ,WAC/B,IAAK,IAAIjpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKgY,MAAMnqB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAemE,MAAQ,SAAezF,GAEpC,OADkB,IAAIuB,EAAOvB,GACZyF,OACnB,EAEAnE,EAAe9lB,UAAUkqB,KAAO,WAC9B,IAAK,IAAIlpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKiY,KAAKpqB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeoE,KAAO,SAAc1F,GAElC,OADkB,IAAIuB,EAAOvB,GACZ0F,MACnB,EAEApE,EAAe9lB,UAAUsY,IAAM,WAC7B,IAAK,IAAItX,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKqG,IAAIxY,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAexN,IAAM,SAAakM,GAEhC,OADkB,IAAIuB,EAAOvB,GACZlM,KACnB,EAEAwN,EAAe9lB,UAAUmqB,KAAO,WAC9B,IAAK,IAAInpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKkY,KAAKrqB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeqE,KAAO,SAAc3F,GAElC,OADkB,IAAIuB,EAAOvB,GACZ2F,MACnB,EAEArE,EAAe9lB,UAAUiV,KAAO,WAC9B,IAAK,IAAIjU,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKgD,KAAKnV,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAe7Q,KAAO,SAAcuP,GAElC,OADkB,IAAIuB,EAAOvB,GACZvP,MACnB,EAEA6Q,EAAe9lB,UAAUoqB,IAAM,WAC7B,IAAK,IAAIppB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKmY,IAAItqB,KAAK+E,IAAI7D,EAAG8Y,KAGxC,OAAOha,IACT,EAEAgmB,EAAesE,IAAM,SAAa5F,GAEhC,OADkB,IAAIuB,EAAOvB,GACZ4F,KACnB,EAEAtE,EAAe9lB,UAAUqqB,KAAO,WAC9B,IAAK,IAAIrpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKoY,KAAKvqB,KAAK+E,IAAI7D,EAAG8Y,KAGzC,OAAOha,IACT,EAEAgmB,EAAeuE,KAAO,SAAc7F,GAElC,OADkB,IAAIuB,EAAOvB,GACZ6F,MACnB,EAEAvE,EAAe9lB,UAAUsqB,MAAQ,WAC/B,IAAK,IAAItpB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKqY,MAAMxqB,KAAK+E,IAAI7D,EAAG8Y,KAG1C,OAAOha,IACT,EAEAgmB,EAAewE,MAAQ,SAAe9F,GAEpC,OADkB,IAAIuB,EAAOvB,GACZ8F,OACnB,EAEAxE,EAAetO,IAAM,SAAagN,EAAQ+F,GAExC,OADkB,IAAIxE,EAAOvB,GACZhN,IAAI+S,EACvB,EAEAzE,EAAe9lB,UAAUwX,IAAM,SAAa/T,GAC1C,MAAqB,iBAAVA,EAA2B3D,KAAK0qB,KAAK/mB,GACzC3D,KAAK2qB,KAAKhnB,EACnB,EAEAqiB,EAAe9lB,UAAUwqB,KAAO,SAAc/mB,GAC5C,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKuF,IAAI1X,KAAK+E,IAAI7D,EAAG8Y,GAAIrW,IAG5C,OAAO3D,IACT,EAEAgmB,EAAe9lB,UAAUyqB,KAAO,SAAcjG,GAE5C,GADAA,EAASuB,EAAOG,YAAY1B,GACxB1kB,KAAKsgB,OAASoE,EAAOpE,MACvBtgB,KAAKugB,UAAYmE,EAAOnE,QACxB,MAAM,IAAIR,WAAW,qCAEvB,IAAK,IAAI7e,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAG7H,KAAKuF,IAAI1X,KAAK+E,IAAI7D,EAAG8Y,GAAI0K,EAAO3f,IAAI7D,EAAG8Y,KAG1D,OAAOha,IACT,CACF,C,uIClxBO,MAAMgmB,EACX4E,mBAAmBC,EAASC,EAAYC,GAEtC,GADaF,EAAUC,IACRC,EAAQlqB,OACrB,MAAM,IAAIkf,WAAW,+CAEvB,IAAIiL,EAAY,IAAI/E,EAAO4E,EAASC,GACpC,IAAK,IAAIG,EAAM,EAAGA,EAAMJ,EAASI,IAC/B,IAAK,IAAIC,EAAS,EAAGA,EAASJ,EAAYI,IACxCF,EAAU3kB,IAAI4kB,EAAKC,EAAQH,EAAQE,EAAMH,EAAaI,IAG1D,OAAOF,CACT,CAEAJ,iBAAiBG,GACf,IAAII,EAAS,IAAIlF,EAAO,EAAG8E,EAAQlqB,QACnC,IAAK,IAAIK,EAAI,EAAGA,EAAI6pB,EAAQlqB,OAAQK,IAClCiqB,EAAO9kB,IAAI,EAAGnF,EAAG6pB,EAAQ7pB,IAE3B,OAAOiqB,CACT,CAEAP,oBAAoBG,GAClB,IAAII,EAAS,IAAIlF,EAAO8E,EAAQlqB,OAAQ,GACxC,IAAK,IAAIK,EAAI,EAAGA,EAAI6pB,EAAQlqB,OAAQK,IAClCiqB,EAAO9kB,IAAInF,EAAG,EAAG6pB,EAAQ7pB,IAE3B,OAAOiqB,CACT,CAEAP,aAAatK,EAAMC,GACjB,OAAO,IAAI0F,EAAO3F,EAAMC,EAC1B,CAEAqK,YAAYtK,EAAMC,GAChB,OAAO,IAAI0F,EAAO3F,EAAMC,GAASrO,KAAK,EACxC,CAEA0Y,YAAYtK,EAAMC,EAASle,EAAU,CAAC,GACpC,GAAuB,iBAAZA,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,OAAEqC,EAASF,KAAKE,QAAWhQ,EACjC,IAAIqiB,EAAS,IAAIuB,EAAO3F,EAAMC,GAC9B,IAAK,IAAIrf,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIuG,EAASvG,IAC3B0K,EAAOre,IAAInF,EAAG8Y,EAAG3H,KAGrB,OAAOqS,CACT,CAEAkG,eAAetK,EAAMC,EAASle,EAAU,CAAC,GACvC,GAAuB,iBAAZA,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,IAAEgG,EAAM,EAAC,IAAEkJ,EAAM,IAAI,OAAE7M,EAASF,KAAKE,QAAWhQ,EACtD,IAAKiQ,OAAOkN,UAAUxJ,GAAM,MAAM,IAAIhG,UAAU,0BAChD,IAAKsC,OAAOkN,UAAUN,GAAM,MAAM,IAAIlP,UAAU,0BAChD,GAAIgG,GAAOkJ,EAAK,MAAM,IAAIa,WAAW,gCACrC,IAAInD,EAAWsC,EAAMlJ,EACjB0O,EAAS,IAAIuB,EAAO3F,EAAMC,GAC9B,IAAK,IAAIrf,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIuG,EAASvG,IAAK,CAChC,IAAIrW,EAAQqS,EAAM7D,KAAKgY,MAAM9X,IAAWuK,GACxC8H,EAAOre,IAAInF,EAAG8Y,EAAGrW,EACnB,CAEF,OAAO+gB,CACT,CAEAkG,WAAWtK,EAAMC,EAAS5c,QACRyL,IAAZmR,IAAuBA,EAAUD,QACvBlR,IAAVzL,IAAqBA,EAAQ,GACjC,IAAIqS,EAAM7D,KAAK6D,IAAIsK,EAAMC,GACrBmE,EAAS1kB,KAAKorB,MAAM9K,EAAMC,GAC9B,IAAK,IAAIrf,EAAI,EAAGA,EAAI8U,EAAK9U,IACvBwjB,EAAOre,IAAInF,EAAGA,EAAGyC,GAEnB,OAAO+gB,CACT,CAEAkG,YAAY1jB,EAAMoZ,EAAMC,GACtB,IAAIxU,EAAI7E,EAAKrG,YACAuO,IAATkR,IAAoBA,EAAOvU,QACfqD,IAAZmR,IAAuBA,EAAUD,GACrC,IAAItK,EAAM7D,KAAK6D,IAAIjK,EAAGuU,EAAMC,GACxBmE,EAAS1kB,KAAKorB,MAAM9K,EAAMC,GAC9B,IAAK,IAAIrf,EAAI,EAAGA,EAAI8U,EAAK9U,IACvBwjB,EAAOre,IAAInF,EAAGA,EAAGgG,EAAKhG,IAExB,OAAOwjB,CACT,CAEAkG,WAAWS,EAASC,GAClBD,EAAUrrB,KAAKomB,YAAYiF,GAC3BC,EAAUtrB,KAAKomB,YAAYkF,GAC3B,IAAIhL,EAAO+K,EAAQ/K,KACfC,EAAU8K,EAAQ9K,QAClB0E,EAAS,IAAIgB,EAAO3F,EAAMC,GAC9B,IAAK,IAAIrf,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIuG,EAASvG,IAC3BiL,EAAO5e,IAAInF,EAAG8Y,EAAG7H,KAAK6D,IAAIqV,EAAQtmB,IAAI7D,EAAG8Y,GAAIsR,EAAQvmB,IAAI7D,EAAG8Y,KAGhE,OAAOiL,CACT,CAEA2F,WAAWS,EAASC,GAClBD,EAAUrrB,KAAKomB,YAAYiF,GAC3BC,EAAUtrB,KAAKomB,YAAYkF,GAC3B,IAAIhL,EAAO+K,EAAQ/K,KACfC,EAAU8K,EAAQ9K,QAClB0E,EAAS,IAAIjlB,KAAKsgB,EAAMC,GAC5B,IAAK,IAAIrf,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIuG,EAASvG,IAC3BiL,EAAO5e,IAAInF,EAAG8Y,EAAG7H,KAAK+M,IAAImM,EAAQtmB,IAAI7D,EAAG8Y,GAAIsR,EAAQvmB,IAAI7D,EAAG8Y,KAGhE,OAAOiL,CACT,CAEA2F,mBAAmBjnB,GACjB,OAAOqiB,EAAeuF,SAAS5nB,GAASA,EAAQ,IAAIsiB,EAAOtiB,EAC7D,CAEAinB,gBAAgBjnB,GACd,OAAgB,MAATA,GAAiC,WAAhBA,EAAM6nB,KAChC,CAEIzP,WACF,OAAO/b,KAAKsgB,KAAOtgB,KAAKugB,OAC1B,CAEAlf,MAAMhB,GACJ,GAAwB,mBAAbA,EACT,MAAM,IAAI2P,UAAU,+BAEtB,IAAK,IAAI9O,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChC3Z,EAAS8L,KAAKnM,KAAMkB,EAAG8Y,GAG3B,OAAOha,IACT,CAEAyrB,YACE,IAAIC,EAAQ,GACZ,IAAK,IAAIxqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChC0R,EAAMnrB,KAAKP,KAAK+E,IAAI7D,EAAG8Y,IAG3B,OAAO0R,CACT,CAEAC,YACE,IAAIrY,EAAO,GACX,IAAK,IAAIpS,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAAK,CAClCoS,EAAK/S,KAAK,IACV,IAAK,IAAIyZ,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChC1G,EAAKpS,GAAGX,KAAKP,KAAK+E,IAAI7D,EAAG8Y,GAE7B,CACA,OAAO1G,CACT,CAEAhI,SACE,OAAOtL,KAAK2rB,WACd,CAEAC,cACE,OAAqB,IAAd5rB,KAAKsgB,IACd,CAEAuL,iBACE,OAAwB,IAAjB7rB,KAAKugB,OACd,CAEAuL,WACE,OAAqB,IAAd9rB,KAAKsgB,MAA+B,IAAjBtgB,KAAKugB,OACjC,CAEAwL,WACE,OAAO/rB,KAAKsgB,OAAStgB,KAAKugB,OAC5B,CAEAF,UACE,OAAqB,IAAdrgB,KAAKsgB,MAA+B,IAAjBtgB,KAAKugB,OACjC,CAEAyL,cACE,GAAIhsB,KAAK+rB,WAAY,CACnB,IAAK,IAAI7qB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,GAAK9Y,EAAG8Y,IACtB,GAAIha,KAAK+E,IAAI7D,EAAG8Y,KAAOha,KAAK+E,IAAIiV,EAAG9Y,GACjC,OAAO,EAIb,OAAO,CACT,CACA,OAAO,CACT,CAEA+qB,gBACE,IAAI/qB,EAAI,EACJ8Y,EAAI,EACJkS,GAAkB,EAClBD,GAAgB,EAChBE,GAAU,EACd,KAAOjrB,EAAIlB,KAAKsgB,MAAQ2L,GAAe,CAGrC,IAFAjS,EAAI,EACJmS,GAAU,EACHnS,EAAIha,KAAKugB,UAAuB,IAAZ4L,GACF,IAAnBnsB,KAAK+E,IAAI7D,EAAG8Y,GACdA,IAC4B,IAAnBha,KAAK+E,IAAI7D,EAAG8Y,IAAYA,EAAIkS,GACrCC,GAAU,EACVD,EAAiBlS,IAEjBiS,GAAgB,EAChBE,GAAU,GAGdjrB,GACF,CACA,OAAO+qB,CACT,CAEAG,uBACE,IAAIlrB,EAAI,EACJ8Y,EAAI,EACJkS,GAAkB,EAClBE,GAAuB,EACvBD,GAAU,EACd,KAAOjrB,EAAIlB,KAAKsgB,MAAQ8L,GAAsB,CAG5C,IAFApS,EAAI,EACJmS,GAAU,EACHnS,EAAIha,KAAKugB,UAAuB,IAAZ4L,GACF,IAAnBnsB,KAAK+E,IAAI7D,EAAG8Y,GACdA,IAC4B,IAAnBha,KAAK+E,IAAI7D,EAAG8Y,IAAYA,EAAIkS,GACrCC,GAAU,EACVD,EAAiBlS,IAEjBoS,GAAuB,EACvBD,GAAU,GAGd,IAAK,IAAIngB,EAAIgO,EAAI,EAAGhO,EAAIhM,KAAKsgB,KAAMtU,IACV,IAAnBhM,KAAK+E,IAAI7D,EAAG8K,KACdogB,GAAuB,GAG3BlrB,GACF,CACA,OAAOkrB,CACT,CAEAC,cACE,IAAIpH,EAASjlB,KAAK4K,QACd0hB,EAAI,EACJtgB,EAAI,EACR,KAAOsgB,EAAIrH,EAAO3E,MAAQtU,EAAIiZ,EAAO1E,SAAS,CAC5C,IAAIgM,EAAOD,EACX,IAAK,IAAIprB,EAAIorB,EAAGprB,EAAI+jB,EAAO3E,KAAMpf,IAC3B+jB,EAAOlgB,IAAI7D,EAAG8K,GAAKiZ,EAAOlgB,IAAIwnB,EAAMvgB,KACtCugB,EAAOrrB,GAGX,GAA4B,IAAxB+jB,EAAOlgB,IAAIwnB,EAAMvgB,GACnBA,QACK,CACLiZ,EAAOuH,SAASF,EAAGC,GACnB,IAAI7J,EAAMuC,EAAOlgB,IAAIunB,EAAGtgB,GACxB,IAAK,IAAIgO,EAAIhO,EAAGgO,EAAIiL,EAAO1E,QAASvG,IAClCiL,EAAO5e,IAAIimB,EAAGtS,EAAGiL,EAAOlgB,IAAIunB,EAAGtS,GAAK0I,GAEtC,IAAK,IAAIxhB,EAAIorB,EAAI,EAAGprB,EAAI+jB,EAAO3E,KAAMpf,IAAK,CACxC,IAAIif,EAAS8E,EAAOlgB,IAAI7D,EAAG8K,GAAKiZ,EAAOlgB,IAAIunB,EAAGtgB,GAC9CiZ,EAAO5e,IAAInF,EAAG8K,EAAG,GACjB,IAAK,IAAIgO,EAAIhO,EAAI,EAAGgO,EAAIiL,EAAO1E,QAASvG,IACtCiL,EAAO5e,IAAInF,EAAG8Y,EAAGiL,EAAOlgB,IAAI7D,EAAG8Y,GAAKiL,EAAOlgB,IAAIunB,EAAGtS,GAAKmG,EAE3D,CACAmM,IACAtgB,GACF,CACF,CACA,OAAOiZ,CACT,CAEAwH,qBACE,IAAIxH,EAASjlB,KAAKqsB,cACd9W,EAAI0P,EAAO1E,QACXlV,EAAI4Z,EAAO3E,KACXgM,EAAIjhB,EAAI,EACZ,KAAOihB,GAAK,GACV,GAAyB,IAArBrH,EAAOyH,OAAOJ,GAChBA,QACK,CACL,IAAInb,EAAI,EACJwb,GAAQ,EACZ,KAAOxb,EAAI9F,IAAe,IAAVshB,GACW,IAArB1H,EAAOlgB,IAAIunB,EAAGnb,GAChBwb,GAAQ,EAERxb,IAGJ,IAAK,IAAIjQ,EAAI,EAAGA,EAAIorB,EAAGprB,IAAK,CAC1B,IAAIif,EAAS8E,EAAOlgB,IAAI7D,EAAGiQ,GAC3B,IAAK,IAAI6I,EAAI7I,EAAG6I,EAAIzE,EAAGyE,IAAK,CAC1B,IAAI0I,EAAMuC,EAAOlgB,IAAI7D,EAAG8Y,GAAKmG,EAAS8E,EAAOlgB,IAAIunB,EAAGtS,GACpDiL,EAAO5e,IAAInF,EAAG8Y,EAAG0I,EACnB,CACF,CACA4J,GACF,CAEF,OAAOrH,CACT,CAEA5e,MACE,MAAM,IAAIrB,MAAM,8BAClB,CAEAD,MACE,MAAM,IAAIC,MAAM,8BAClB,CAEAsf,OAAOjiB,EAAU,CAAC,GAChB,GAAuB,iBAAZA,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,KAAEsQ,EAAO,EAAC,QAAEC,EAAU,GAAMle,EAClC,IAAKiQ,OAAOkN,UAAUc,IAASA,GAAQ,EACrC,MAAM,IAAItQ,UAAU,mCAEtB,IAAKsC,OAAOkN,UAAUe,IAAYA,GAAW,EAC3C,MAAM,IAAIvQ,UAAU,sCAEtB,IAAI0U,EAAS,IAAIuB,EAAOjmB,KAAKsgB,KAAOA,EAAMtgB,KAAKugB,QAAUA,GACzD,IAAK,IAAIrf,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAIuG,EAASvG,IAC3B0K,EAAOkI,aAAa5sB,KAAMA,KAAKsgB,KAAOpf,EAAGlB,KAAKugB,QAAUvG,GAG5D,OAAO0K,CACT,CAEAxS,KAAKvO,GACH,IAAK,IAAIzC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGrW,GAGnB,OAAO3D,IACT,CAEA6sB,MACE,OAAO7sB,KAAK4mB,MAAM,EACpB,CAEAkG,OAAOnY,IACL,QAAc3U,KAAM2U,GACpB,IAAIsW,EAAM,GACV,IAAK,IAAI/pB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAChC+pB,EAAI1qB,KAAKP,KAAK+E,IAAI4P,EAAOzT,IAE3B,OAAO+pB,CACT,CAEA8B,aAAapY,GACX,OAAOsR,EAAO+G,UAAUhtB,KAAK8sB,OAAOnY,GACtC,CAEAsY,OAAOtY,EAAO+W,IACZ,QAAc1rB,KAAM2U,GACpB+W,GAAQ,QAAe1rB,KAAM0rB,GAC7B,IAAK,IAAIxqB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAChClB,KAAKqG,IAAIsO,EAAOzT,EAAGwqB,EAAMxqB,IAE3B,OAAOlB,IACT,CAEAwsB,SAASU,EAAMC,IACb,QAAcntB,KAAMktB,IACpB,QAAcltB,KAAMmtB,GACpB,IAAK,IAAIjsB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAAK,CACrC,IAAIksB,EAAOptB,KAAK+E,IAAImoB,EAAMhsB,GAC1BlB,KAAKqG,IAAI6mB,EAAMhsB,EAAGlB,KAAK+E,IAAIooB,EAAMjsB,IACjClB,KAAKqG,IAAI8mB,EAAMjsB,EAAGksB,EACpB,CACA,OAAOptB,IACT,CAEAqtB,UAAU1Y,IACR,QAAiB3U,KAAM2U,GACvB,IAAIuW,EAAS,GACb,IAAK,IAAIhqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7BgqB,EAAO3qB,KAAKP,KAAK+E,IAAI7D,EAAGyT,IAE1B,OAAOuW,CACT,CAEAoC,gBAAgB3Y,GACd,OAAOsR,EAAOsH,aAAavtB,KAAKqtB,UAAU1Y,GAC5C,CAEA6Y,UAAU7Y,EAAO+W,IACf,QAAiB1rB,KAAM2U,GACvB+W,GAAQ,QAAkB1rB,KAAM0rB,GAChC,IAAK,IAAIxqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7BlB,KAAKqG,IAAInF,EAAGyT,EAAO+W,EAAMxqB,IAE3B,OAAOlB,IACT,CAEAytB,YAAYC,EAASC,IACnB,QAAiB3tB,KAAM0tB,IACvB,QAAiB1tB,KAAM2tB,GACvB,IAAK,IAAIzsB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAAK,CAClC,IAAIksB,EAAOptB,KAAK+E,IAAI7D,EAAGwsB,GACvB1tB,KAAKqG,IAAInF,EAAGwsB,EAAS1tB,KAAK+E,IAAI7D,EAAGysB,IACjC3tB,KAAKqG,IAAInF,EAAGysB,EAASP,EACvB,CACA,OAAOptB,IACT,CAEA4tB,aAAazC,GACXA,GAAS,QAAenrB,KAAMmrB,GAC9B,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOnR,IAG3C,OAAOha,IACT,CAEA6tB,aAAa1C,GACXA,GAAS,QAAenrB,KAAMmrB,GAC9B,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOnR,IAG3C,OAAOha,IACT,CAEA8tB,aAAa3C,GACXA,GAAS,QAAenrB,KAAMmrB,GAC9B,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOnR,IAG3C,OAAOha,IACT,CAEA+tB,aAAa5C,GACXA,GAAS,QAAenrB,KAAMmrB,GAC9B,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOnR,IAG3C,OAAOha,IACT,CAEAguB,gBAAgB7C,GACdA,GAAS,QAAkBnrB,KAAMmrB,GACjC,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOjqB,IAG3C,OAAOlB,IACT,CAEAiuB,gBAAgB9C,GACdA,GAAS,QAAkBnrB,KAAMmrB,GACjC,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOjqB,IAG3C,OAAOlB,IACT,CAEAkuB,gBAAgB/C,GACdA,GAAS,QAAkBnrB,KAAMmrB,GACjC,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOjqB,IAG3C,OAAOlB,IACT,CAEAmuB,gBAAgBhD,GACdA,GAAS,QAAkBnrB,KAAMmrB,GACjC,IAAK,IAAIjqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCha,KAAKqG,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAI7D,EAAG8Y,GAAKmR,EAAOjqB,IAG3C,OAAOlB,IACT,CAEAouB,OAAOzZ,EAAOhR,IACZ,QAAc3D,KAAM2U,GACpB,IAAK,IAAIzT,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAChClB,KAAKqG,IAAIsO,EAAOzT,EAAGlB,KAAK+E,IAAI4P,EAAOzT,GAAKyC,GAE1C,OAAO3D,IACT,CAEAquB,UAAU1Z,EAAOhR,IACf,QAAiB3D,KAAM2U,GACvB,IAAK,IAAIzT,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7BlB,KAAKqG,IAAInF,EAAGyT,EAAO3U,KAAK+E,IAAI7D,EAAGyT,GAAShR,GAE1C,OAAO3D,IACT,CAEAkf,IAAIoP,GACF,GAAItuB,KAAKqgB,UACP,OAAO7E,IAET,OAAQ8S,GACN,IAAK,MAAO,CACV,MAAMpP,EAAM,IAAI9Z,MAAMpF,KAAKsgB,MAAMpO,KAAKI,OAAOic,mBAC7C,IAAK,IAAItD,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUhM,EAAI+L,KAC9B/L,EAAI+L,GAAOjrB,KAAK+E,IAAIkmB,EAAKC,IAI/B,OAAOhM,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAI9Z,MAAMpF,KAAKugB,SAASrO,KAAKI,OAAOic,mBAChD,IAAK,IAAItD,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUhM,EAAIgM,KAC9BhM,EAAIgM,GAAUlrB,KAAK+E,IAAIkmB,EAAKC,IAIlC,OAAOhM,CACT,CACA,UAAK9P,EAAW,CACd,IAAI8P,EAAMlf,KAAK+E,IAAI,EAAG,GACtB,IAAK,IAAIkmB,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUhM,IAC1BA,EAAMlf,KAAK+E,IAAIkmB,EAAKC,IAI1B,OAAOhM,CACT,CACA,QACE,MAAM,IAAIla,MAAM,mBAAmBspB,KAEzC,CAEAE,YACE,QAAcxuB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAI,EAAG,GAChB0pB,EAAM,CAAC,EAAG,GACd,IAAK,IAAIvtB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAC5Bha,KAAK+E,IAAI7D,EAAG8Y,GAAKpI,IACnBA,EAAI5R,KAAK+E,IAAI7D,EAAG8Y,GAChByU,EAAI,GAAKvtB,EACTutB,EAAI,GAAKzU,GAIf,OAAOyU,CACT,CAEAzY,IAAIsY,GACF,GAAItuB,KAAKqgB,UACP,OAAO7E,IAGT,OAAQ8S,GACN,IAAK,MAAO,CACV,MAAMtY,EAAM,IAAI5Q,MAAMpF,KAAKsgB,MAAMpO,KAAKI,OAAOoc,mBAC7C,IAAK,IAAIzD,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUlV,EAAIiV,KAC9BjV,EAAIiV,GAAOjrB,KAAK+E,IAAIkmB,EAAKC,IAI/B,OAAOlV,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAI5Q,MAAMpF,KAAKugB,SAASrO,KAAKI,OAAOoc,mBAChD,IAAK,IAAIzD,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUlV,EAAIkV,KAC9BlV,EAAIkV,GAAUlrB,KAAK+E,IAAIkmB,EAAKC,IAIlC,OAAOlV,CACT,CACA,UAAK5G,EAAW,CACd,IAAI4G,EAAMhW,KAAK+E,IAAI,EAAG,GACtB,IAAK,IAAIkmB,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IACtClrB,KAAK+E,IAAIkmB,EAAKC,GAAUlV,IAC1BA,EAAMhW,KAAK+E,IAAIkmB,EAAKC,IAI1B,OAAOlV,CACT,CACA,QACE,MAAM,IAAIhR,MAAM,mBAAmBspB,KAEzC,CAEAK,YACE,QAAc3uB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAI,EAAG,GAChB0pB,EAAM,CAAC,EAAG,GACd,IAAK,IAAIvtB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAC5Bha,KAAK+E,IAAI7D,EAAG8Y,GAAKpI,IACnBA,EAAI5R,KAAK+E,IAAI7D,EAAG8Y,GAChByU,EAAI,GAAKvtB,EACTutB,EAAI,GAAKzU,GAIf,OAAOyU,CACT,CAEA/B,OAAOzB,GAEL,IADA,QAAcjrB,KAAMirB,GAChBjrB,KAAKqgB,UACP,OAAO7E,IAET,IAAI5J,EAAI5R,KAAK+E,IAAIkmB,EAAK,GACtB,IAAK,IAAI/pB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAC5BlB,KAAK+E,IAAIkmB,EAAK/pB,GAAK0Q,IACrBA,EAAI5R,KAAK+E,IAAIkmB,EAAK/pB,IAGtB,OAAO0Q,CACT,CAEAgd,YAAY3D,IACV,QAAcjrB,KAAMirB,IACpB,QAAcjrB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAIkmB,EAAK,GAClBwD,EAAM,CAACxD,EAAK,GAChB,IAAK,IAAI/pB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAC5BlB,KAAK+E,IAAIkmB,EAAK/pB,GAAK0Q,IACrBA,EAAI5R,KAAK+E,IAAIkmB,EAAK/pB,GAClButB,EAAI,GAAKvtB,GAGb,OAAOutB,CACT,CAEAI,OAAO5D,GAEL,IADA,QAAcjrB,KAAMirB,GAChBjrB,KAAKqgB,UACP,OAAO7E,IAET,IAAI5J,EAAI5R,KAAK+E,IAAIkmB,EAAK,GACtB,IAAK,IAAI/pB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAC5BlB,KAAK+E,IAAIkmB,EAAK/pB,GAAK0Q,IACrBA,EAAI5R,KAAK+E,IAAIkmB,EAAK/pB,IAGtB,OAAO0Q,CACT,CAEAkd,YAAY7D,IACV,QAAcjrB,KAAMirB,IACpB,QAAcjrB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAIkmB,EAAK,GAClBwD,EAAM,CAACxD,EAAK,GAChB,IAAK,IAAI/pB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAC5BlB,KAAK+E,IAAIkmB,EAAK/pB,GAAK0Q,IACrBA,EAAI5R,KAAK+E,IAAIkmB,EAAK/pB,GAClButB,EAAI,GAAKvtB,GAGb,OAAOutB,CACT,CAEAM,UAAU7D,GAER,IADA,QAAiBlrB,KAAMkrB,GACnBlrB,KAAKqgB,UACP,OAAO7E,IAET,IAAI5J,EAAI5R,KAAK+E,IAAI,EAAGmmB,GACpB,IAAK,IAAIhqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IACzBlB,KAAK+E,IAAI7D,EAAGgqB,GAAUtZ,IACxBA,EAAI5R,KAAK+E,IAAI7D,EAAGgqB,IAGpB,OAAOtZ,CACT,CAEAod,eAAe9D,IACb,QAAiBlrB,KAAMkrB,IACvB,QAAclrB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAI,EAAGmmB,GAChBuD,EAAM,CAAC,EAAGvD,GACd,IAAK,IAAIhqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IACzBlB,KAAK+E,IAAI7D,EAAGgqB,GAAUtZ,IACxBA,EAAI5R,KAAK+E,IAAI7D,EAAGgqB,GAChBuD,EAAI,GAAKvtB,GAGb,OAAOutB,CACT,CAEAQ,UAAU/D,GAER,IADA,QAAiBlrB,KAAMkrB,GACnBlrB,KAAKqgB,UACP,OAAO7E,IAET,IAAI5J,EAAI5R,KAAK+E,IAAI,EAAGmmB,GACpB,IAAK,IAAIhqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IACzBlB,KAAK+E,IAAI7D,EAAGgqB,GAAUtZ,IACxBA,EAAI5R,KAAK+E,IAAI7D,EAAGgqB,IAGpB,OAAOtZ,CACT,CAEAsd,eAAehE,IACb,QAAiBlrB,KAAMkrB,IACvB,QAAclrB,MACd,IAAI4R,EAAI5R,KAAK+E,IAAI,EAAGmmB,GAChBuD,EAAM,CAAC,EAAGvD,GACd,IAAK,IAAIhqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IACzBlB,KAAK+E,IAAI7D,EAAGgqB,GAAUtZ,IACxBA,EAAI5R,KAAK+E,IAAI7D,EAAGgqB,GAChBuD,EAAI,GAAKvtB,GAGb,OAAOutB,CACT,CAEAU,OACE,IAAInZ,EAAM7D,KAAK6D,IAAIhW,KAAKsgB,KAAMtgB,KAAKugB,SAC/B4O,EAAO,GACX,IAAK,IAAIjuB,EAAI,EAAGA,EAAI8U,EAAK9U,IACvBiuB,EAAK5uB,KAAKP,KAAK+E,IAAI7D,EAAGA,IAExB,OAAOiuB,CACT,CAEAC,KAAK9rB,EAAO,aACV,IAAI2hB,EAAS,EACb,GAAa,QAAT3hB,EACF,OAAOtD,KAAKkf,MACP,GAAa,cAAT5b,EAAsB,CAC/B,IAAK,IAAIpC,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCiL,GAAkBjlB,KAAK+E,IAAI7D,EAAG8Y,GAAKha,KAAK+E,IAAI7D,EAAG8Y,GAGnD,OAAO7H,KAAKgD,KAAK8P,EACnB,CACE,MAAM,IAAIlF,WAAW,sBAAsBzc,IAE/C,CAEA+rB,gBACE,IAAI/L,EAAM,EACV,IAAK,IAAIpiB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCsJ,GAAOtjB,KAAK+E,IAAI7D,EAAG8Y,GACnBha,KAAKqG,IAAInF,EAAG8Y,EAAGsJ,GAGnB,OAAOtjB,IACT,CAEAsvB,IAAIC,GACEvJ,EAAeuF,SAASgE,KAAUA,EAAUA,EAAQ9D,aACxD,IAAI+D,EAAUxvB,KAAKyrB,YACnB,GAAI+D,EAAQ3uB,SAAW0uB,EAAQ1uB,OAC7B,MAAM,IAAIkf,WAAW,qCAEvB,IAAIuP,EAAM,EACV,IAAK,IAAIpuB,EAAI,EAAGA,EAAIsuB,EAAQ3uB,OAAQK,IAClCouB,GAAOE,EAAQtuB,GAAKquB,EAAQruB,GAE9B,OAAOouB,CACT,CAEApM,KAAKuM,GACHA,EAAQxJ,EAAOG,YAAYqJ,GAE3B,IAAIla,EAAIvV,KAAKsgB,KACTjV,EAAIrL,KAAKugB,QACTpP,EAAIse,EAAMlP,QAEV0E,EAAS,IAAIgB,EAAO1Q,EAAGpE,GAEvBue,EAAQ,IAAI9U,aAAavP,GAC7B,IAAK,IAAI2O,EAAI,EAAGA,EAAI7I,EAAG6I,IAAK,CAC1B,IAAK,IAAIhO,EAAI,EAAGA,EAAIX,EAAGW,IACrB0jB,EAAM1jB,GAAKyjB,EAAM1qB,IAAIiH,EAAGgO,GAG1B,IAAK,IAAI9Y,EAAI,EAAGA,EAAIqU,EAAGrU,IAAK,CAC1B,IAAIsU,EAAI,EACR,IAAK,IAAIxJ,EAAI,EAAGA,EAAIX,EAAGW,IACrBwJ,GAAKxV,KAAK+E,IAAI7D,EAAG8K,GAAK0jB,EAAM1jB,GAG9BiZ,EAAO5e,IAAInF,EAAG8Y,EAAGxE,EACnB,CACF,CACA,OAAOyP,CACT,CAEA0K,YAAYF,GACVA,EAAQxJ,EAAOG,YAAYqJ,GAC3B,IAAIxK,EAAS,IAAIgB,EAAO,EAAG,GAC3B,MAAM2J,EAAM5vB,KAAK+E,IAAI,EAAG,GAClB8qB,EAAMJ,EAAM1qB,IAAI,EAAG,GACnB+qB,EAAM9vB,KAAK+E,IAAI,EAAG,GAClBgrB,EAAMN,EAAM1qB,IAAI,EAAG,GACnBirB,EAAMhwB,KAAK+E,IAAI,EAAG,GAClBkrB,EAAMR,EAAM1qB,IAAI,EAAG,GACnBmrB,EAAMlwB,KAAK+E,IAAI,EAAG,GAClBorB,EAAMV,EAAM1qB,IAAI,EAAG,GAGnBqrB,GAAMR,EAAMM,IAAQL,EAAMM,GAC1BE,GAAML,EAAME,GAAOL,EACnBS,EAAKV,GAAOG,EAAMI,GAClBI,EAAKL,GAAOD,EAAMJ,GAClBW,GAAMZ,EAAME,GAAOK,EAKnBM,EAAML,EAAKG,EAAKC,GAHVV,EAAMI,IAAQD,EAAME,GAI1BO,EAAMJ,EAAKE,EACXG,EAAMN,EAAKE,EACXK,EAAMR,EAAKC,EAAKC,GAPVN,EAAMJ,IAAQC,EAAME,GAahC,OAJA9K,EAAO5e,IAAI,EAAG,EAAGoqB,GACjBxL,EAAO5e,IAAI,EAAG,EAAGqqB,GACjBzL,EAAO5e,IAAI,EAAG,EAAGsqB,GACjB1L,EAAO5e,IAAI,EAAG,EAAGuqB,GACV3L,CACT,CAEA4L,YAAYpB,GACVA,EAAQxJ,EAAOG,YAAYqJ,GAC3B,IAAIxK,EAAS,IAAIgB,EAAO,EAAG,GAE3B,MAAM6K,EAAM9wB,KAAK+E,IAAI,EAAG,GAClBgsB,EAAM/wB,KAAK+E,IAAI,EAAG,GAClBisB,EAAMhxB,KAAK+E,IAAI,EAAG,GAClBksB,EAAMjxB,KAAK+E,IAAI,EAAG,GAClB6qB,EAAM5vB,KAAK+E,IAAI,EAAG,GAClB+qB,EAAM9vB,KAAK+E,IAAI,EAAG,GAClBmsB,EAAMlxB,KAAK+E,IAAI,EAAG,GAClBirB,EAAMhwB,KAAK+E,IAAI,EAAG,GAClBmrB,EAAMlwB,KAAK+E,IAAI,EAAG,GAElBosB,EAAM1B,EAAM1qB,IAAI,EAAG,GACnBqsB,EAAM3B,EAAM1qB,IAAI,EAAG,GACnBssB,EAAM5B,EAAM1qB,IAAI,EAAG,GACnBusB,EAAM7B,EAAM1qB,IAAI,EAAG,GACnB8qB,EAAMJ,EAAM1qB,IAAI,EAAG,GACnBgrB,EAAMN,EAAM1qB,IAAI,EAAG,GACnBwsB,EAAM9B,EAAM1qB,IAAI,EAAG,GACnBkrB,EAAMR,EAAM1qB,IAAI,EAAG,GACnBorB,EAAMV,EAAM1qB,IAAI,EAAG,GAGnBsrB,GAAMS,EAAMG,KAASG,EAAMvB,GAE3BU,IAAOO,EAAMG,EAAMrB,IAAQuB,EAAMC,EAAMvB,GACvCW,GAAMS,EAAMrB,KAASuB,EAAMC,GAC3BI,EAAKV,EAAMK,EACXM,IAAOX,EAAMI,EAAMlB,IAAQmB,EAAME,EAAMtB,GACvC2B,IAAOZ,EAAMI,IAAQG,EAAMtB,GAC3B4B,GAAMT,EAAMlB,KAASmB,EAAME,GAG3BO,IAAQZ,EAAMhB,EAAME,IAAQL,EAAM0B,EAAMtB,GACxC4B,GAAOb,EAAMd,IAAQL,EAAMI,GAC3B6B,EAAMd,EAAMO,EACZQ,GAAO/B,EAAME,KAASqB,EAAMtB,GAC5B+B,IAAQhB,EAAMpB,EAAME,IAAQC,EAAMwB,EAAMpB,GACxC8B,GAAOjB,EAAMlB,IAAQC,EAAMI,GAC3B+B,GAAOtC,EAAME,KAASyB,EAAMpB,GAO5BM,EAAMe,EAAKM,EANLf,EAAMO,EAOZZ,GAzBMI,EAAMC,EAAMC,EAAMC,EAAMrB,EAAMI,EAAME,GAAOL,EAyBtCU,EAAKC,EAAKgB,EAAKI,EAAME,EAAMC,EACtCI,EAAMX,EAAKC,EAAKE,GAjBTb,EAAMC,EAAMC,EAAMpB,EAAME,EAAMoB,EAAMlB,GAAOD,EAiBvB+B,EAAME,EAAME,EACvCvB,EAAMN,EAzBDT,IAAQuB,EAAMC,EAAME,EAAMzB,EAAME,EAAMwB,EAAMpB,GAyBjCI,EAAKiB,EAAKM,EAAME,EAAMC,EACtCrB,EAAMP,EAAKE,EAAKC,EAAKgB,EATf1B,EAAMG,EAUZmC,EAAMN,EAAME,EAAMC,EAAMC,EATlBjB,EAAMI,EAUZgB,EAAMb,EAAKC,EAAKC,EApBV1B,IAAQmB,EAAME,EAAMC,EAAMzB,EAAME,EAAMwB,EAAMtB,GAoBvB2B,EAAMC,EAAMC,EACvCQ,EAAMV,EAAMC,EAAMC,EAAMC,EAVlBb,EAAME,EAWZmB,EAAMf,EAAKC,EAAKC,EAAKC,EAVfzB,EAAMC,EAqBlB,OATAlL,EAAO5e,IAAI,EAAG,EAAGoqB,GACjBxL,EAAO5e,IAAI,EAAG,EAAGqqB,GACjBzL,EAAO5e,IAAI,EAAG,EAAG8rB,GACjBlN,EAAO5e,IAAI,EAAG,EAAGsqB,GACjB1L,EAAO5e,IAAI,EAAG,EAAGuqB,GACjB3L,EAAO5e,IAAI,EAAG,EAAG+rB,GACjBnN,EAAO5e,IAAI,EAAG,EAAGgsB,GACjBpN,EAAO5e,IAAI,EAAG,EAAGisB,GACjBrN,EAAO5e,IAAI,EAAG,EAAGksB,GACVtN,CACT,CAEAuN,aAAa/e,GACXA,EAAIwS,EAAOG,YAAY3S,GACvB,IAAID,EAAIxT,KAAK4K,QACT6nB,EAAKjf,EAAE8M,KACPoS,EAAKlf,EAAE+M,QACPoS,EAAKlf,EAAE6M,KACPsS,EAAKnf,EAAE8M,QAUX,SAASsS,EAAMC,EAAKxS,EAAMyS,GACxB,IAAI7hB,EAAI4hB,EAAIxS,KACRxN,EAAIggB,EAAIvS,QACZ,GAAIrP,IAAMoP,GAAQxN,IAAMigB,EACtB,OAAOD,EACF,CACL,IAAIE,EAAWhN,EAAeoF,MAAM9K,EAAMyS,GAE1C,OADAC,EAAWA,EAASpG,aAAakG,EAAK,EAAG,GAClCE,CACT,CACF,CAnBIN,IAAOC,GAETrkB,QAAQC,KACN,eAAekkB,OAAQC,SAAUC,OAAQC,sCAsB7C,IAAI1hB,EAAIiB,KAAK+M,IAAIuT,EAAIE,GACjB7f,EAAIX,KAAK+M,IAAIwT,EAAIE,GAiFrB,OAhFApf,EAAIqf,EAAMrf,EAAGtC,EAAG4B,GAIhB,SAASmgB,EAAU3d,EAAGa,EAAGmK,EAAMyS,GAE7B,GAAIzS,GAAQ,KAAOyS,GAAQ,IACzB,OAAOzd,EAAE4N,KAAK/M,GAIZmK,EAAO,GAAM,GAAKyS,EAAO,GAAM,GACjCzd,EAAIud,EAAMvd,EAAGgL,EAAO,EAAGyS,EAAO,GAC9B5c,EAAI0c,EAAM1c,EAAGmK,EAAO,EAAGyS,EAAO,IACrBzS,EAAO,GAAM,GACtBhL,EAAIud,EAAMvd,EAAGgL,EAAO,EAAGyS,GACvB5c,EAAI0c,EAAM1c,EAAGmK,EAAO,EAAGyS,IACdA,EAAO,GAAM,IACtBzd,EAAIud,EAAMvd,EAAGgL,EAAMyS,EAAO,GAC1B5c,EAAI0c,EAAM1c,EAAGmK,EAAMyS,EAAO,IAG5B,IAAIG,EAAWC,SAAS7d,EAAEgL,KAAO,EAAG,IAChC8S,EAAWD,SAAS7d,EAAEiL,QAAU,EAAG,IAEnCqP,EAAMta,EAAE+d,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GACjDvD,EAAM1Z,EAAEkd,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GAEjDtD,EAAMxa,EAAE+d,UAAU,EAAGH,EAAW,EAAGE,EAAU9d,EAAEiL,QAAU,GACzDwP,EAAM5Z,EAAEkd,UAAU,EAAGH,EAAW,EAAGE,EAAUjd,EAAEoK,QAAU,GAEzDyP,EAAM1a,EAAE+d,UAAUH,EAAU5d,EAAEgL,KAAO,EAAG,EAAG8S,EAAW,GACtDnD,EAAM9Z,EAAEkd,UAAUH,EAAU/c,EAAEmK,KAAO,EAAG,EAAG8S,EAAW,GAEtDlD,EAAM5a,EAAE+d,UAAUH,EAAU5d,EAAEgL,KAAO,EAAG8S,EAAU9d,EAAEiL,QAAU,GAC9D4P,EAAMha,EAAEkd,UAAUH,EAAU/c,EAAEmK,KAAO,EAAG8S,EAAUjd,EAAEoK,QAAU,GAG9D6P,EAAK6C,EACPjN,EAAehe,IAAI4nB,EAAKM,GACxBlK,EAAehe,IAAI6nB,EAAKM,GACxB+C,EACAE,GAEE/C,EAAK4C,EAAUjN,EAAehe,IAAIgoB,EAAKE,GAAML,EAAKqD,EAAUE,GAC5D9C,EAAK2C,EAAUrD,EAAK5J,EAAeK,IAAI0J,EAAKI,GAAM+C,EAAUE,GAC5D7C,EAAK0C,EAAU/C,EAAKlK,EAAeK,IAAI4J,EAAKJ,GAAMqD,EAAUE,GAC5D5C,EAAKyC,EAAUjN,EAAehe,IAAI4nB,EAAKE,GAAMK,EAAK+C,EAAUE,GAC5D5B,EAAKyB,EACPjN,EAAeK,IAAI2J,EAAKJ,GACxB5J,EAAehe,IAAI6nB,EAAKE,GACxBmD,EACAE,GAEE3B,EAAKwB,EACPjN,EAAeK,IAAIyJ,EAAKI,GACxBlK,EAAehe,IAAIioB,EAAKE,GACxB+C,EACAE,GAIExC,EAAM5K,EAAehe,IAAIooB,EAAIG,GACjCK,EAAIvK,IAAImK,GACRI,EAAI5oB,IAAIypB,GACR,IAAIW,EAAMpM,EAAehe,IAAIsoB,EAAIE,GAC7B8B,EAAMtM,EAAehe,IAAIqoB,EAAIE,GAC7BgC,EAAMvM,EAAeK,IAAI+J,EAAIC,GACjCkC,EAAIvqB,IAAIsoB,GACRiC,EAAIvqB,IAAIwpB,GAGR,IAAIwB,EAAWhN,EAAeoF,MAAM,EAAIwF,EAAItQ,KAAM,EAAIsQ,EAAIrQ,SAK1D,OAJAyS,EAAWA,EAASpG,aAAagE,EAAK,EAAG,GACzCoC,EAAWA,EAASpG,aAAawF,EAAKxB,EAAItQ,KAAM,GAChD0S,EAAWA,EAASpG,aAAa0F,EAAK,EAAG1B,EAAIrQ,SAC7CyS,EAAWA,EAASpG,aAAa2F,EAAK3B,EAAItQ,KAAMsQ,EAAIrQ,SAC7CyS,EAASK,UAAU,EAAG/S,EAAO,EAAG,EAAGyS,EAAO,EACnD,CAEOE,CAAUzf,EA/EjBC,EAAIof,EAAMpf,EAAGvC,EAAG4B,GA+EO5B,EAAG4B,EAC5B,CAEAwgB,UAAUjxB,EAAU,CAAC,GACnB,GAAuB,iBAAZA,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,IAAEgG,EAAM,EAAC,IAAEkJ,EAAM,GAAM7c,EAC7B,IAAKiQ,OAAOihB,SAASvd,GAAM,MAAM,IAAIhG,UAAU,wBAC/C,IAAKsC,OAAOihB,SAASrU,GAAM,MAAM,IAAIlP,UAAU,wBAC/C,GAAIgG,GAAOkJ,EAAK,MAAM,IAAIa,WAAW,gCACrC,IAAIiL,EAAY,IAAI/E,EAAOjmB,KAAKsgB,KAAMtgB,KAAKugB,SAC3C,IAAK,IAAIrf,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAAK,CAClC,MAAM+pB,EAAMjrB,KAAK8sB,OAAO5rB,GACpB+pB,EAAIpqB,OAAS,IACf,OAAQoqB,EAAK,CAAEjV,MAAKkJ,MAAKU,OAAQqL,IAEnCD,EAAUiC,OAAO/rB,EAAG+pB,EACtB,CACA,OAAOD,CACT,CAEAwI,aAAanxB,EAAU,CAAC,GACtB,GAAuB,iBAAZA,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,IAAEgG,EAAM,EAAC,IAAEkJ,EAAM,GAAM7c,EAC7B,IAAKiQ,OAAOihB,SAASvd,GAAM,MAAM,IAAIhG,UAAU,wBAC/C,IAAKsC,OAAOihB,SAASrU,GAAM,MAAM,IAAIlP,UAAU,wBAC/C,GAAIgG,GAAOkJ,EAAK,MAAM,IAAIa,WAAW,gCACrC,IAAIiL,EAAY,IAAI/E,EAAOjmB,KAAKsgB,KAAMtgB,KAAKugB,SAC3C,IAAK,IAAIrf,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAAK,CACrC,MAAMgqB,EAASlrB,KAAKqtB,UAAUnsB,GAC1BgqB,EAAOrqB,SACT,OAAQqqB,EAAQ,CACdlV,IAAKA,EACLkJ,IAAKA,EACLU,OAAQsL,IAGZF,EAAUwC,UAAUtsB,EAAGgqB,EACzB,CACA,OAAOF,CACT,CAEAyI,WACE,MAAMC,EAASvhB,KAAKuX,KAAK1pB,KAAKugB,QAAU,GACxC,IAAK,IAAIrf,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0Z,EAAQ1Z,IAAK,CAC/B,IAAI2Z,EAAQ3zB,KAAK+E,IAAI7D,EAAG8Y,GACpB1I,EAAOtR,KAAK+E,IAAI7D,EAAGlB,KAAKugB,QAAU,EAAIvG,GAC1Cha,KAAKqG,IAAInF,EAAG8Y,EAAG1I,GACftR,KAAKqG,IAAInF,EAAGlB,KAAKugB,QAAU,EAAIvG,EAAG2Z,EACpC,CAEF,OAAO3zB,IACT,CAEA4zB,cACE,MAAMF,EAASvhB,KAAKuX,KAAK1pB,KAAKsgB,KAAO,GACrC,IAAK,IAAItG,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChC,IAAK,IAAI9Y,EAAI,EAAGA,EAAIwyB,EAAQxyB,IAAK,CAC/B,IAAIyyB,EAAQ3zB,KAAK+E,IAAI7D,EAAG8Y,GACpB1I,EAAOtR,KAAK+E,IAAI/E,KAAKsgB,KAAO,EAAIpf,EAAG8Y,GACvCha,KAAKqG,IAAInF,EAAG8Y,EAAG1I,GACftR,KAAKqG,IAAIrG,KAAKsgB,KAAO,EAAIpf,EAAG8Y,EAAG2Z,EACjC,CAEF,OAAO3zB,IACT,CAEA6zB,iBAAiBpE,GACfA,EAAQxJ,EAAOG,YAAYqJ,GAE3B,IAAIla,EAAIvV,KAAKsgB,KACTjV,EAAIrL,KAAKugB,QACTpP,EAAIse,EAAMnP,KACV3J,EAAI8Y,EAAMlP,QAEV0E,EAAS,IAAIgB,EAAO1Q,EAAIpE,EAAG9F,EAAIsL,GACnC,IAAK,IAAIzV,EAAI,EAAGA,EAAIqU,EAAGrU,IACrB,IAAK,IAAI8Y,EAAI,EAAGA,EAAI3O,EAAG2O,IACrB,IAAK,IAAIhO,EAAI,EAAGA,EAAImF,EAAGnF,IACrB,IAAK,IAAID,EAAI,EAAGA,EAAI4K,EAAG5K,IACrBkZ,EAAO5e,IAAI8K,EAAIjQ,EAAI8K,EAAG2K,EAAIqD,EAAIjO,EAAG/L,KAAK+E,IAAI7D,EAAG8Y,GAAKyV,EAAM1qB,IAAIiH,EAAGD,IAKvE,OAAOkZ,CACT,CAEA6O,aAAarE,GAEX,GADAA,EAAQxJ,EAAOG,YAAYqJ,IACtBzvB,KAAK+rB,aAAe0D,EAAM1D,WAC7B,MAAM,IAAI/mB,MAAM,2CAElB,IAAIuQ,EAAIvV,KAAKsgB,KACTjV,EAAIokB,EAAMnP,KACVyT,EAAM/zB,KAAK6zB,iBAAiB5N,EAAO+N,IAAI3oB,EAAGA,IAC1C4oB,EAAMhO,EAAO+N,IAAIze,EAAGA,GAAGse,iBAAiBpE,GAC5C,OAAOsE,EAAI/rB,IAAIisB,EACjB,CAEAlT,YACE,IAAIkE,EAAS,IAAIgB,EAAOjmB,KAAKugB,QAASvgB,KAAKsgB,MAC3C,IAAK,IAAIpf,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIha,KAAKugB,QAASvG,IAChCiL,EAAO5e,IAAI2T,EAAG9Y,EAAGlB,KAAK+E,IAAI7D,EAAG8Y,IAGjC,OAAOiL,CACT,CAEAiP,SAASC,EAAkBC,GACzB,IAAK,IAAIlzB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7BlB,KAAKitB,OAAO/rB,EAAGlB,KAAK8sB,OAAO5rB,GAAGmzB,KAAKF,IAErC,OAAOn0B,IACT,CAEAs0B,YAAYH,EAAkBC,GAC5B,IAAK,IAAIlzB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAChClB,KAAKwtB,UAAUtsB,EAAGlB,KAAKqtB,UAAUnsB,GAAGmzB,KAAKF,IAE3C,OAAOn0B,IACT,CAEAqzB,UAAUkB,EAAUC,EAAQC,EAAaC,IACvC,QAAW10B,KAAMu0B,EAAUC,EAAQC,EAAaC,GAChD,IAAI1J,EAAY,IAAI/E,EAClBuO,EAASD,EAAW,EACpBG,EAAYD,EAAc,GAE5B,IAAK,IAAIvzB,EAAIqzB,EAAUrzB,GAAKszB,EAAQtzB,IAClC,IAAK,IAAI8Y,EAAIya,EAAaza,GAAK0a,EAAW1a,IACxCgR,EAAU3kB,IAAInF,EAAIqzB,EAAUva,EAAIya,EAAaz0B,KAAK+E,IAAI7D,EAAG8Y,IAG7D,OAAOgR,CACT,CAEA2J,aAAaC,EAASH,EAAaC,GAGjC,QAFoBtlB,IAAhBqlB,IAA2BA,EAAc,QAC3BrlB,IAAdslB,IAAyBA,EAAY10B,KAAKugB,QAAU,GAEtDkU,EAAcC,GACdD,EAAc,GACdA,GAAez0B,KAAKugB,SACpBmU,EAAY,GACZA,GAAa10B,KAAKugB,QAElB,MAAM,IAAIR,WAAW,yBAGvB,IAAIiL,EAAY,IAAI/E,EAAO2O,EAAQ/zB,OAAQ6zB,EAAYD,EAAc,GACrE,IAAK,IAAIvzB,EAAI,EAAGA,EAAI0zB,EAAQ/zB,OAAQK,IAClC,IAAK,IAAI8Y,EAAIya,EAAaza,GAAK0a,EAAW1a,IAAK,CAC7C,GAAI4a,EAAQ1zB,GAAK,GAAK0zB,EAAQ1zB,IAAMlB,KAAKsgB,KACvC,MAAM,IAAIP,WAAW,2BAA2B6U,EAAQ1zB,MAE1D8pB,EAAU3kB,IAAInF,EAAG8Y,EAAIya,EAAaz0B,KAAK+E,IAAI6vB,EAAQ1zB,GAAI8Y,GACzD,CAEF,OAAOgR,CACT,CAEA6J,gBAAgBD,EAASL,EAAUC,GAGjC,QAFiBplB,IAAbmlB,IAAwBA,EAAW,QACxBnlB,IAAXolB,IAAsBA,EAASx0B,KAAKsgB,KAAO,GAE7CiU,EAAWC,GACXD,EAAW,GACXA,GAAYv0B,KAAKsgB,MACjBkU,EAAS,GACTA,GAAUx0B,KAAKsgB,KAEf,MAAM,IAAIP,WAAW,yBAGvB,IAAIiL,EAAY,IAAI/E,EAAOuO,EAASD,EAAW,EAAGK,EAAQ/zB,QAC1D,IAAK,IAAIK,EAAI,EAAGA,EAAI0zB,EAAQ/zB,OAAQK,IAClC,IAAK,IAAI8Y,EAAIua,EAAUva,GAAKwa,EAAQxa,IAAK,CACvC,GAAI4a,EAAQ1zB,GAAK,GAAK0zB,EAAQ1zB,IAAMlB,KAAKugB,QACvC,MAAM,IAAIR,WAAW,8BAA8B6U,EAAQ1zB,MAE7D8pB,EAAU3kB,IAAI2T,EAAIua,EAAUrzB,EAAGlB,KAAK+E,IAAIiV,EAAG4a,EAAQ1zB,IACrD,CAEF,OAAO8pB,CACT,CAEA4B,aAAalI,EAAQ6P,EAAUE,GAE7B,IADA/P,EAASuB,EAAOG,YAAY1B,IACjBrE,UACT,OAAOrgB,KAET,IAAIw0B,EAASD,EAAW7P,EAAOpE,KAAO,EAClCoU,EAAYD,EAAc/P,EAAOnE,QAAU,GAC/C,QAAWvgB,KAAMu0B,EAAUC,EAAQC,EAAaC,GAChD,IAAK,IAAIxzB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClCha,KAAKqG,IAAIkuB,EAAWrzB,EAAGuzB,EAAcza,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,IAG1D,OAAOha,IACT,CAEA80B,UAAUC,EAAYC,IACpB,QAAgBh1B,KAAM+0B,IACtB,OAAmB/0B,KAAMg1B,GACzB,IAAIhK,EAAY,IAAI/E,EAAO8O,EAAWl0B,OAAQm0B,EAAcn0B,QAC5D,IAAK,IAAIK,EAAI,EAAGA,EAAI6zB,EAAWl0B,OAAQK,IAAK,CAC1C,IAAI+zB,EAAWF,EAAW7zB,GAC1B,IAAK,IAAI8Y,EAAI,EAAGA,EAAIgb,EAAcn0B,OAAQmZ,IAAK,CAC7C,IAAIkb,EAAcF,EAAchb,GAChCgR,EAAU3kB,IAAInF,EAAG8Y,EAAGha,KAAK+E,IAAIkwB,EAAUC,GACzC,CACF,CACA,OAAOlK,CACT,CAEAmK,QACE,IAAInf,EAAM7D,KAAK6D,IAAIhW,KAAKsgB,KAAMtgB,KAAKugB,SAC/B4U,EAAQ,EACZ,IAAK,IAAIj0B,EAAI,EAAGA,EAAI8U,EAAK9U,IACvBi0B,GAASn1B,KAAK+E,IAAI7D,EAAGA,GAEvB,OAAOi0B,CACT,CAEAvqB,QACE,IAAIogB,EAAY,IAAI/E,EAAOjmB,KAAKsgB,KAAMtgB,KAAKugB,SAC3C,IAAK,IAAI0K,EAAM,EAAGA,EAAMjrB,KAAKsgB,KAAM2K,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASlrB,KAAKugB,QAAS2K,IAC1CF,EAAU3kB,IAAI4kB,EAAKC,EAAQlrB,KAAK+E,IAAIkmB,EAAKC,IAG7C,OAAOF,CACT,CAEA1H,IAAIgL,GACF,OAAQA,GACN,IAAK,MACH,OAAO,QAAStuB,MAClB,IAAK,SACH,OAAO,QAAYA,MACrB,UAAKoP,EACH,OAAO,QAAOpP,MAChB,QACE,MAAM,IAAIgF,MAAM,mBAAmBspB,KAEzC,CAEA8G,QAAQ9G,GACN,OAAQA,GACN,IAAK,MACH,OAAO,QAAatuB,MACtB,IAAK,SACH,OAAO,QAAgBA,MACzB,UAAKoP,EACH,OAAO,QAAWpP,MACpB,QACE,MAAM,IAAIgF,MAAM,mBAAmBspB,KAEzC,CAEA+G,KAAK/G,GACH,MAAMhL,EAAMtjB,KAAKsjB,IAAIgL,GACrB,OAAQA,GACN,IAAK,MACH,IAAK,IAAIptB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAC7BoiB,EAAIpiB,IAAMlB,KAAKugB,QAEjB,OAAO+C,EAET,IAAK,SACH,IAAK,IAAIpiB,EAAI,EAAGA,EAAIlB,KAAKugB,QAASrf,IAChCoiB,EAAIpiB,IAAMlB,KAAKsgB,KAEjB,OAAOgD,EAET,UAAKlU,EACH,OAAOkU,EAAMtjB,KAAK+b,KACpB,QACE,MAAM,IAAI/W,MAAM,mBAAmBspB,KAEzC,CAEAgH,SAAShH,EAAIjsB,EAAU,CAAC,GAKtB,GAJkB,iBAAPisB,IACTjsB,EAAUisB,EACVA,OAAKlf,GAEgB,iBAAZ/M,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,SAAEulB,GAAW,EAAI,KAAEF,EAAOr1B,KAAKq1B,KAAK/G,IAAQjsB,EAClD,GAAwB,kBAAbkzB,EACT,MAAM,IAAIvlB,UAAU,8BAEtB,OAAQse,GACN,IAAK,MACH,KAAK,OAAW+G,GACd,MAAM,IAAIrlB,UAAU,yBAEtB,OAAO,QAAchQ,KAAMu1B,EAAUF,GAEvC,IAAK,SACH,KAAK,OAAWA,GACd,MAAM,IAAIrlB,UAAU,yBAEtB,OAAO,QAAiBhQ,KAAMu1B,EAAUF,GAE1C,UAAKjmB,EACH,GAAoB,iBAATimB,EACT,MAAM,IAAIrlB,UAAU,yBAEtB,OAAO,OAAYhQ,KAAMu1B,EAAUF,GAErC,QACE,MAAM,IAAIrwB,MAAM,mBAAmBspB,KAEzC,CAEAkH,kBAAkBlH,EAAIjsB,GACF,iBAAPisB,IACTjsB,EAAUisB,EACVA,OAAKlf,GAEP,MAAMkmB,EAAWt1B,KAAKs1B,SAAShH,EAAIjsB,GACnC,QAAW+M,IAAPkf,EACF,OAAOnc,KAAKgD,KAAKmgB,GAEjB,IAAK,IAAIp0B,EAAI,EAAGA,EAAIo0B,EAASz0B,OAAQK,IACnCo0B,EAASp0B,GAAKiR,KAAKgD,KAAKmgB,EAASp0B,IAEnC,OAAOo0B,CAEX,CAEAG,OAAOnH,EAAIjsB,EAAU,CAAC,GAKpB,GAJkB,iBAAPisB,IACTjsB,EAAUisB,EACVA,OAAKlf,GAEgB,iBAAZ/M,EACT,MAAM,IAAI2N,UAAU,6BAEtB,MAAM,OAAEylB,EAASz1B,KAAKq1B,KAAK/G,IAAQjsB,EACnC,OAAQisB,GACN,IAAK,MACH,KAAK,OAAWmH,GACd,MAAM,IAAIzlB,UAAU,2BAGtB,OADA,QAAYhQ,KAAMy1B,GACXz1B,KAET,IAAK,SACH,KAAK,OAAWy1B,GACd,MAAM,IAAIzlB,UAAU,2BAGtB,OADA,QAAehQ,KAAMy1B,GACdz1B,KAET,UAAKoP,EACH,GAAsB,iBAAXqmB,EACT,MAAM,IAAIzlB,UAAU,2BAGtB,OADA,QAAUhQ,KAAMy1B,GACTz1B,KAET,QACE,MAAM,IAAIgF,MAAM,mBAAmBspB,KAEzC,CAEAnM,MAAMmM,EAAIjsB,EAAU,CAAC,GAKnB,GAJkB,iBAAPisB,IACTjsB,EAAUisB,EACVA,OAAKlf,GAEgB,iBAAZ/M,EACT,MAAM,IAAI2N,UAAU,6BAEtB,IAAImS,EAAQ9f,EAAQ8f,MACpB,OAAQmM,GACN,IAAK,MACH,QAAclf,IAAV+S,EACFA,GAAQ,QAAcniB,WACjB,KAAK,OAAWmiB,GACrB,MAAM,IAAInS,UAAU,0BAGtB,OADA,QAAWhQ,KAAMmiB,GACVniB,KAET,IAAK,SACH,QAAcoP,IAAV+S,EACFA,GAAQ,QAAiBniB,WACpB,KAAK,OAAWmiB,GACrB,MAAM,IAAInS,UAAU,0BAGtB,OADA,QAAchQ,KAAMmiB,GACbniB,KAET,UAAKoP,EACH,QAAcA,IAAV+S,EACFA,GAAQ,QAAYniB,WACf,GAAqB,iBAAVmiB,EAChB,MAAM,IAAInS,UAAU,0BAGtB,OADA,QAAShQ,KAAMmiB,GACRniB,KAET,QACE,MAAM,IAAIgF,MAAM,mBAAmBspB,KAEzC,CAEApiB,SAAS7J,GACP,OAAO,OAAyBrC,KAAMqC,EACxC,EASF,SAAS+xB,EAAe9e,EAAGa,GACzB,OAAOb,EAAIa,CACb,CARA6P,EAAe9lB,UAAUsrB,MAAQ,SACX,oBAAXnf,SACT2Z,EAAe9lB,UAAUmM,OAAOqpB,IAAI,+BAClC,KAcJ1P,EAAe3T,OAAS2T,EAAe2P,KACvC3P,EAAe4P,UAAY5P,EAAe6P,QAC1C7P,EAAe/B,SAAW+B,EAAemJ,KACzCnJ,EAAe9lB,UAAU+jB,SAAW+B,EAAe9lB,UAAUivB,KAC7DnJ,EAAe8P,SAAW9P,EAAegO,IACzChO,EAAe9lB,UAAU61B,OAAS/P,EAAe9lB,UAAU2sB,IAC3D7G,EAAe9lB,UAAU81B,cACvBhQ,EAAe9lB,UAAU2zB,iBAEZ,MAAM5N,UAAeD,EAClC5jB,YAAY6zB,EAAOC,GAEjB,GADA5zB,QACI2jB,EAAOsF,SAAS0K,GAElB,OAAOA,EAAMrrB,QACR,GAAI0H,OAAOkN,UAAUyW,IAAUA,GAAS,EAAG,CAGhD,GADAj2B,KAAKkH,KAAO,KACRoL,OAAOkN,UAAU0W,IAAaA,GAAY,GAK5C,MAAM,IAAIlmB,UAAU,uCAJpB,IAAK,IAAI9O,EAAI,EAAGA,EAAI+0B,EAAO/0B,IACzBlB,KAAKkH,KAAK3G,KAAK,IAAIqa,aAAasb,GAKtC,KAAO,MAAI,OAAWD,GAqBpB,MAAM,IAAIjmB,UACR,wDAtB0B,CAE5B,MAAMmmB,EAAYF,EAGlB,GAAwB,iBADxBC,GADAD,EAAQE,EAAUt1B,QACCs1B,EAAU,GAAGt1B,OAAS,GAEvC,MAAM,IAAImP,UACR,qDAGJhQ,KAAKkH,KAAO,GACZ,IAAK,IAAIhG,EAAI,EAAGA,EAAI+0B,EAAO/0B,IAAK,CAC9B,GAAIi1B,EAAUj1B,GAAGL,SAAWq1B,EAC1B,MAAM,IAAInW,WAAW,iCAEvB,IAAsBoW,EAAUj1B,GA9CzBk1B,OAAOC,GACQ,iBAAZA,IA8CR,MAAM,IAAIrmB,UAAU,0CAEtBhQ,KAAKkH,KAAK3G,KAAKqa,aAAavV,KAAK8wB,EAAUj1B,IAC7C,CACF,CAIA,CACAlB,KAAKsgB,KAAO2V,EACZj2B,KAAKugB,QAAU2V,CACjB,CAEA7vB,IAAI4uB,EAAUC,EAAavxB,GAEzB,OADA3D,KAAKkH,KAAK+tB,GAAUC,GAAevxB,EAC5B3D,IACT,CAEA+E,IAAIkwB,EAAUC,GACZ,OAAOl1B,KAAKkH,KAAK+tB,GAAUC,EAC7B,CAEAoB,UAAU3hB,GAIR,OAHA,QAAc3U,KAAM2U,GACpB3U,KAAKkH,KAAK9F,OAAOuT,EAAO,GACxB3U,KAAKsgB,MAAQ,EACNtgB,IACT,CAEAu2B,OAAO5hB,EAAO+W,GASZ,YARctc,IAAVsc,IACFA,EAAQ/W,EACRA,EAAQ3U,KAAKsgB,OAEf,QAActgB,KAAM2U,GAAO,GAC3B+W,EAAQ9Q,aAAavV,MAAK,QAAerF,KAAM0rB,IAC/C1rB,KAAKkH,KAAK9F,OAAOuT,EAAO,EAAG+W,GAC3B1rB,KAAKsgB,MAAQ,EACNtgB,IACT,CAEAw2B,aAAa7hB,IACX,QAAiB3U,KAAM2U,GACvB,IAAK,IAAIzT,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAAK,CAClC,MAAMu1B,EAAS,IAAI7b,aAAa5a,KAAKugB,QAAU,GAC/C,IAAK,IAAIvG,EAAI,EAAGA,EAAIrF,EAAOqF,IACzByc,EAAOzc,GAAKha,KAAKkH,KAAKhG,GAAG8Y,GAE3B,IAAK,IAAIA,EAAIrF,EAAQ,EAAGqF,EAAIha,KAAKugB,QAASvG,IACxCyc,EAAOzc,EAAI,GAAKha,KAAKkH,KAAKhG,GAAG8Y,GAE/Bha,KAAKkH,KAAKhG,GAAKu1B,CACjB,CAEA,OADAz2B,KAAKugB,SAAW,EACTvgB,IACT,CAEA02B,UAAU/hB,EAAO+W,QACM,IAAVA,IACTA,EAAQ/W,EACRA,EAAQ3U,KAAKugB,UAEf,QAAiBvgB,KAAM2U,GAAO,GAC9B+W,GAAQ,QAAkB1rB,KAAM0rB,GAChC,IAAK,IAAIxqB,EAAI,EAAGA,EAAIlB,KAAKsgB,KAAMpf,IAAK,CAClC,MAAMu1B,EAAS,IAAI7b,aAAa5a,KAAKugB,QAAU,GAC/C,IAAIvG,EAAI,EACR,KAAOA,EAAIrF,EAAOqF,IAChByc,EAAOzc,GAAKha,KAAKkH,KAAKhG,GAAG8Y,GAG3B,IADAyc,EAAOzc,KAAO0R,EAAMxqB,GACb8Y,EAAIha,KAAKugB,QAAU,EAAGvG,IAC3Byc,EAAOzc,GAAKha,KAAKkH,KAAKhG,GAAG8Y,EAAI,GAE/Bha,KAAKkH,KAAKhG,GAAKu1B,CACjB,CAEA,OADAz2B,KAAKugB,SAAW,EACTvgB,IACT,GAGF,OAAsBgmB,EAAgBC,E,sNClnD/B,SAAS0Q,EAASjS,GACvB,IAAIpB,GAAM,QAASoB,EAAOpE,MAC1B,IAAK,IAAIpf,EAAI,EAAGA,EAAIwjB,EAAOpE,OAAQpf,EACjC,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,UAAWvG,EACpCsJ,EAAIpiB,IAAMwjB,EAAO3f,IAAI7D,EAAG8Y,GAG5B,OAAOsJ,CACT,CAEO,SAASsT,EAAYlS,GAC1B,IAAIpB,GAAM,QAASoB,EAAOnE,SAC1B,IAAK,IAAIrf,EAAI,EAAGA,EAAIwjB,EAAOpE,OAAQpf,EACjC,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,UAAWvG,EACpCsJ,EAAItJ,IAAM0K,EAAO3f,IAAI7D,EAAG8Y,GAG5B,OAAOsJ,CACT,CAEO,SAASuT,EAAOnS,GACrB,IAAI9S,EAAI,EACR,IAAK,IAAI1Q,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClCpI,GAAK8S,EAAO3f,IAAI7D,EAAG8Y,GAGvB,OAAOpI,CACT,CAEO,SAASklB,EAAapS,GAC3B,IAAIpB,GAAM,QAASoB,EAAOpE,KAAM,GAChC,IAAK,IAAIpf,EAAI,EAAGA,EAAIwjB,EAAOpE,OAAQpf,EACjC,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,UAAWvG,EACpCsJ,EAAIpiB,IAAMwjB,EAAO3f,IAAI7D,EAAG8Y,GAG5B,OAAOsJ,CACT,CAEO,SAASyT,EAAgBrS,GAC9B,IAAIpB,GAAM,QAASoB,EAAOnE,QAAS,GACnC,IAAK,IAAIrf,EAAI,EAAGA,EAAIwjB,EAAOpE,OAAQpf,EACjC,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,UAAWvG,EACpCsJ,EAAItJ,IAAM0K,EAAO3f,IAAI7D,EAAG8Y,GAG5B,OAAOsJ,CACT,CAEO,SAAS0T,EAAWtS,GACzB,IAAI9S,EAAI,EACR,IAAK,IAAI1Q,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClCpI,GAAK8S,EAAO3f,IAAI7D,EAAG8Y,GAGvB,OAAOpI,CACT,CAEO,SAASqlB,EAAcvS,EAAQ6Q,EAAUF,GAC9C,MAAM/U,EAAOoE,EAAOpE,KACdyS,EAAOrO,EAAOnE,QACd+U,EAAW,GAEjB,IAAK,IAAIp0B,EAAI,EAAGA,EAAIof,EAAMpf,IAAK,CAC7B,IAAIg2B,EAAO,EACPC,EAAO,EACP3jB,EAAI,EACR,IAAK,IAAIwG,EAAI,EAAGA,EAAI+Y,EAAM/Y,IACxBxG,EAAIkR,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EAAKn0B,GAC5Bg2B,GAAQ1jB,EACR2jB,GAAQ3jB,EAAIA,EAEV+hB,EACFD,EAAS/0B,MAAM42B,EAAQD,EAAOA,EAAQnE,IAASA,EAAO,IAEtDuC,EAAS/0B,MAAM42B,EAAQD,EAAOA,EAAQnE,GAAQA,EAElD,CACA,OAAOuC,CACT,CAEO,SAAS8B,EAAiB1S,EAAQ6Q,EAAUF,GACjD,MAAM/U,EAAOoE,EAAOpE,KACdyS,EAAOrO,EAAOnE,QACd+U,EAAW,GAEjB,IAAK,IAAItb,EAAI,EAAGA,EAAI+Y,EAAM/Y,IAAK,CAC7B,IAAIkd,EAAO,EACPC,EAAO,EACP3jB,EAAI,EACR,IAAK,IAAItS,EAAI,EAAGA,EAAIof,EAAMpf,IACxBsS,EAAIkR,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EAAKrb,GAC5Bkd,GAAQ1jB,EACR2jB,GAAQ3jB,EAAIA,EAEV+hB,EACFD,EAAS/0B,MAAM42B,EAAQD,EAAOA,EAAQ5W,IAASA,EAAO,IAEtDgV,EAAS/0B,MAAM42B,EAAQD,EAAOA,EAAQ5W,GAAQA,EAElD,CACA,OAAOgV,CACT,CAEO,SAAS+B,EAAY3S,EAAQ6Q,EAAUF,GAC5C,MAAM/U,EAAOoE,EAAOpE,KACdyS,EAAOrO,EAAOnE,QACdxE,EAAOuE,EAAOyS,EAEpB,IAAImE,EAAO,EACPC,EAAO,EACP3jB,EAAI,EACR,IAAK,IAAItS,EAAI,EAAGA,EAAIof,EAAMpf,IACxB,IAAK,IAAI8Y,EAAI,EAAGA,EAAI+Y,EAAM/Y,IACxBxG,EAAIkR,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EACvB6B,GAAQ1jB,EACR2jB,GAAQ3jB,EAAIA,EAGhB,OAAI+hB,GACM4B,EAAQD,EAAOA,EAAQnb,IAASA,EAAO,IAEvCob,EAAQD,EAAOA,EAAQnb,GAAQA,CAE3C,CAEO,SAASub,EAAY5S,EAAQ2Q,GAClC,IAAK,IAAIn0B,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EAAKn0B,GAG/C,CAEO,SAASq2B,EAAe7S,EAAQ2Q,GACrC,IAAK,IAAIn0B,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EAAKrb,GAG/C,CAEO,SAASwd,EAAU9S,EAAQ2Q,GAChC,IAAK,IAAIn0B,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKqb,EAG1C,CAEO,SAASoC,EAAc/S,GAC5B,MAAMvC,EAAQ,GACd,IAAK,IAAIjhB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAAK,CACpC,IAAIoiB,EAAM,EACV,IAAK,IAAItJ,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClCsJ,GAAOnR,KAAKuF,IAAIgN,EAAO3f,IAAI7D,EAAG8Y,GAAI,IAAM0K,EAAOnE,QAAU,GAE3D4B,EAAM5hB,KAAK4R,KAAKgD,KAAKmO,GACvB,CACA,OAAOnB,CACT,CAEO,SAASuV,EAAWhT,EAAQvC,GACjC,IAAK,IAAIjhB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKmI,EAAMjhB,GAGhD,CAEO,SAASy2B,EAAiBjT,GAC/B,MAAMvC,EAAQ,GACd,IAAK,IAAInI,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAAK,CACvC,IAAIsJ,EAAM,EACV,IAAK,IAAIpiB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/BoiB,GAAOnR,KAAKuF,IAAIgN,EAAO3f,IAAI7D,EAAG8Y,GAAI,IAAM0K,EAAOpE,KAAO,GAExD6B,EAAM5hB,KAAK4R,KAAKgD,KAAKmO,GACvB,CACA,OAAOnB,CACT,CAEO,SAASyV,EAAclT,EAAQvC,GACpC,IAAK,IAAIjhB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKmI,EAAMnI,GAGhD,CAEO,SAAS6d,EAAYnT,GAC1B,MAAMoT,EAAUpT,EAAO3I,KAAO,EAC9B,IAAIuH,EAAM,EACV,IAAK,IAAItJ,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC,IAAK,IAAI9Y,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/BoiB,GAAOnR,KAAKuF,IAAIgN,EAAO3f,IAAI7D,EAAG8Y,GAAI,GAAK8d,EAG3C,OAAO3lB,KAAKgD,KAAKmO,EACnB,CAEO,SAASyU,EAASrT,EAAQvC,GAC/B,IAAK,IAAIjhB,EAAI,EAAGA,EAAIwjB,EAAOpE,KAAMpf,IAC/B,IAAK,IAAI8Y,EAAI,EAAGA,EAAI0K,EAAOnE,QAASvG,IAClC0K,EAAOre,IAAInF,EAAG8Y,EAAG0K,EAAO3f,IAAI7D,EAAG8Y,GAAKmI,EAG1C,C,qIC1MO,SAAS6V,EAActT,EAAQ/P,EAAOsjB,GAC3C,IAAI/Y,EAAM+Y,EAAQvT,EAAOpE,KAAOoE,EAAOpE,KAAO,EAC9C,GAAI3L,EAAQ,GAAKA,EAAQuK,EACvB,MAAM,IAAIa,WAAW,yBAEzB,CASO,SAASmY,EAAiBxT,EAAQ/P,EAAOsjB,GAC9C,IAAI/Y,EAAM+Y,EAAQvT,EAAOnE,QAAUmE,EAAOnE,QAAU,EACpD,GAAI5L,EAAQ,GAAKA,EAAQuK,EACvB,MAAM,IAAIa,WAAW,4BAEzB,CAUO,SAASoY,EAAezT,EAAQyG,GAIrC,GAHIA,EAAOM,YACTN,EAASA,EAAOM,aAEdN,EAAOtqB,SAAW6jB,EAAOnE,QAC3B,MAAM,IAAIR,WACR,yDAGJ,OAAOoL,CACT,CAUO,SAASiN,EAAkB1T,EAAQyG,GAIxC,GAHIA,EAAOM,YACTN,EAASA,EAAOM,aAEdN,EAAOtqB,SAAW6jB,EAAOpE,KAC3B,MAAM,IAAIP,WAAW,sDAEvB,OAAOoL,CACT,CAEO,SAASkN,EAAgB3T,EAAQqQ,GACtC,KAAK,OAAWA,GACd,MAAM,IAAI/kB,UAAU,gCAGtB,IAAK,IAAI9O,EAAI,EAAGA,EAAI6zB,EAAWl0B,OAAQK,IACrC,GAAI6zB,EAAW7zB,GAAK,GAAK6zB,EAAW7zB,IAAMwjB,EAAOpE,KAC/C,MAAM,IAAIP,WAAW,+BAG3B,CAEO,SAASuY,EAAmB5T,EAAQsQ,GACzC,KAAK,OAAWA,GACd,MAAM,IAAIhlB,UAAU,mCAGtB,IAAK,IAAI9O,EAAI,EAAGA,EAAI8zB,EAAcn0B,OAAQK,IACxC,GAAI8zB,EAAc9zB,GAAK,GAAK8zB,EAAc9zB,IAAMwjB,EAAOnE,QACrD,MAAM,IAAIR,WAAW,kCAG3B,CAEO,SAASwY,EAAW7T,EAAQ6P,EAAUC,EAAQC,EAAaC,GAChE,GAAyB,IAArB9zB,UAAUC,OACZ,MAAM,IAAIkf,WAAW,wBAMvB,GAJAyY,EAAY,WAAYjE,GACxBiE,EAAY,SAAUhE,GACtBgE,EAAY,cAAe/D,GAC3B+D,EAAY,YAAa9D,GAEvBH,EAAWC,GACXC,EAAcC,GACdH,EAAW,GACXA,GAAY7P,EAAOpE,MACnBkU,EAAS,GACTA,GAAU9P,EAAOpE,MACjBmU,EAAc,GACdA,GAAe/P,EAAOnE,SACtBmU,EAAY,GACZA,GAAahQ,EAAOnE,QAEpB,MAAM,IAAIR,WAAW,qCAEzB,CAEO,SAAS0Y,EAAS53B,EAAQ8C,EAAQ,GACvC,IAAI+nB,EAAQ,GACZ,IAAK,IAAIxqB,EAAI,EAAGA,EAAIL,EAAQK,IAC1BwqB,EAAMnrB,KAAKoD,GAEb,OAAO+nB,CACT,CAEA,SAAS8M,EAAY9qB,EAAM/J,GACzB,GAAqB,iBAAVA,EACT,MAAM,IAAIqM,UAAU,GAAGtC,qBAE3B,CAEO,SAASgrB,EAAchU,GAC5B,GAAIA,EAAOrE,UACT,MAAM,IAAIrb,MAAM,wCAEpB,C,6DCpIe,MAAM2zB,UAAwB,IAC3Cv2B,YAAY8E,GACV5E,QACAtC,KAAKkH,KAAOA,EACZlH,KAAKsgB,KAAOpZ,EAAKrG,OACjBb,KAAKugB,QAAUrZ,EAAK,GAAGrG,MACzB,CAEAwF,IAAI4uB,EAAUC,EAAavxB,GAEzB,OADA3D,KAAKkH,KAAK+tB,GAAUC,GAAevxB,EAC5B3D,IACT,CAEA+E,IAAIkwB,EAAUC,GACZ,OAAOl1B,KAAKkH,KAAK+tB,GAAUC,EAC7B,E,sGCDF,IAAI0D,EAAgB,SAAS7kB,EAAGoC,GAI5B,OAHAyiB,EAAgBvxB,OAAOwxB,gBAClB,CAAEC,UAAW,cAAgB1zB,OAAS,SAAU2O,EAAGoC,GAAKpC,EAAE+kB,UAAY3iB,CAAG,GAC1E,SAAUpC,EAAGoC,GAAK,IAAK,IAAIhF,KAAKgF,EAAO9O,OAAOnH,UAAUmT,eAAelH,KAAKgK,EAAGhF,KAAI4C,EAAE5C,GAAKgF,EAAEhF,GAAI,EAC7FynB,EAAc7kB,EAAGoC,EAC5B,EAEO,SAAS4iB,EAAUhlB,EAAGoC,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAInG,UAAU,uBAAyBgpB,OAAO7iB,GAAK,iCAE7D,SAAS8iB,IAAOj5B,KAAKoC,YAAc2R,CAAG,CADtC6kB,EAAc7kB,EAAGoC,GAEjBpC,EAAE7T,UAAkB,OAANiW,EAAa9O,OAAO6xB,OAAO/iB,IAAM8iB,EAAG/4B,UAAYiW,EAAEjW,UAAW,IAAI+4B,EACnF,CAEO,IAAIE,EAAW,WAQlB,OAPAA,EAAW9xB,OAAOsG,QAAU,SAAkBgF,GAC1C,IAAK,IAAI6C,EAAGtU,EAAI,EAAGmK,EAAIzK,UAAUC,OAAQK,EAAImK,EAAGnK,IAE5C,IAAK,IAAIiQ,KADTqE,EAAI5U,UAAUM,GACOmG,OAAOnH,UAAUmT,eAAelH,KAAKqJ,EAAGrE,KAAIwB,EAAExB,GAAKqE,EAAErE,IAE9E,OAAOwB,CACX,EACOwmB,EAAS93B,MAAMrB,KAAMY,UAChC,EAEO,SAASw4B,EAAO5jB,EAAG2I,GACtB,IAAIxL,EAAI,CAAC,EACT,IAAK,IAAIxB,KAAKqE,EAAOnO,OAAOnH,UAAUmT,eAAelH,KAAKqJ,EAAGrE,IAAMgN,EAAE/K,QAAQjC,GAAK,IAC9EwB,EAAExB,GAAKqE,EAAErE,IACb,GAAS,MAALqE,GAAqD,mBAAjCnO,OAAOgyB,sBACtB,KAAIn4B,EAAI,EAAb,IAAgBiQ,EAAI9J,OAAOgyB,sBAAsB7jB,GAAItU,EAAIiQ,EAAEtQ,OAAQK,IAC3Did,EAAE/K,QAAQjC,EAAEjQ,IAAM,GAAKmG,OAAOnH,UAAUo5B,qBAAqBntB,KAAKqJ,EAAGrE,EAAEjQ,MACvEyR,EAAExB,EAAEjQ,IAAMsU,EAAErE,EAAEjQ,IAF4B,CAItD,OAAOyR,CACX,CA8DO,SAAS4mB,EAAUC,EAASC,EAAYC,EAAGC,GAE9C,OAAO,IAAKD,IAAMA,EAAIrqB,WAAU,SAAUC,EAASsqB,GAC/C,SAASC,EAAUl2B,GAAS,IAAMoU,EAAK4hB,EAAU7iB,KAAKnT,GAAS,CAAE,MAAOwa,GAAKyb,EAAOzb,EAAI,CAAE,CAC1F,SAAS2b,EAASn2B,GAAS,IAAMoU,EAAK4hB,EAAiB,MAAEh2B,GAAS,CAAE,MAAOwa,GAAKyb,EAAOzb,EAAI,CAAE,CAC7F,SAASpG,EAAKkN,GAJlB,IAAethB,EAIashB,EAAO8U,KAAOzqB,EAAQ2V,EAAOthB,QAJ1CA,EAIyDshB,EAAOthB,MAJhDA,aAAiB+1B,EAAI/1B,EAAQ,IAAI+1B,GAAE,SAAUpqB,GAAWA,EAAQ3L,EAAQ,KAIjB6L,KAAKqqB,EAAWC,EAAW,CAC7G/hB,GAAM4hB,EAAYA,EAAUt4B,MAAMm4B,EAASC,GAAc,KAAK3iB,OAClE,GACJ,CAEO,SAASkjB,EAAYR,EAASS,GACjC,IAAsGzc,EAAG/J,EAAGd,EAAG8P,EAA3G7P,EAAI,CAAEsnB,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPxnB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGynB,KAAM,GAAIC,IAAK,IAChG,OAAO5X,EAAI,CAAE3L,KAAMwjB,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,mBAAXjuB,SAA0BoW,EAAEpW,OAAOkuB,UAAY,WAAa,OAAOv6B,IAAM,GAAIyiB,EACvJ,SAAS6X,EAAKjvB,GAAK,OAAO,SAAUuG,GAAK,OACzC,SAAc4oB,GACV,GAAIhd,EAAG,MAAM,IAAIxN,UAAU,mCAC3B,KAAOyS,IAAMA,EAAI,EAAG+X,EAAG,KAAO5nB,EAAI,IAAKA,OACnC,GAAI4K,EAAI,EAAG/J,IAAMd,EAAY,EAAR6nB,EAAG,GAAS/mB,EAAU,OAAI+mB,EAAG,GAAK/mB,EAAS,SAAOd,EAAIc,EAAU,SAAMd,EAAExG,KAAKsH,GAAI,GAAKA,EAAEqD,SAAWnE,EAAIA,EAAExG,KAAKsH,EAAG+mB,EAAG,KAAKT,KAAM,OAAOpnB,EAE3J,OADIc,EAAI,EAAGd,IAAG6nB,EAAK,CAAS,EAARA,EAAG,GAAQ7nB,EAAEhP,QACzB62B,EAAG,IACP,KAAK,EAAG,KAAK,EAAG7nB,EAAI6nB,EAAI,MACxB,KAAK,EAAc,OAAX5nB,EAAEsnB,QAAgB,CAAEv2B,MAAO62B,EAAG,GAAIT,MAAM,GAChD,KAAK,EAAGnnB,EAAEsnB,QAASzmB,EAAI+mB,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5nB,EAAEynB,IAAIjf,MAAOxI,EAAEwnB,KAAKhf,MAAO,SACxC,QACI,MAAkBzI,GAAZA,EAAIC,EAAEwnB,MAAYv5B,OAAS,GAAK8R,EAAEA,EAAE9R,OAAS,KAAkB,IAAV25B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5nB,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4nB,EAAG,MAAc7nB,GAAM6nB,EAAG,GAAK7nB,EAAE,IAAM6nB,EAAG,GAAK7nB,EAAE,IAAM,CAAEC,EAAEsnB,MAAQM,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5nB,EAAEsnB,MAAQvnB,EAAE,GAAI,CAAEC,EAAEsnB,MAAQvnB,EAAE,GAAIA,EAAI6nB,EAAI,KAAO,CACpE,GAAI7nB,GAAKC,EAAEsnB,MAAQvnB,EAAE,GAAI,CAAEC,EAAEsnB,MAAQvnB,EAAE,GAAIC,EAAEynB,IAAI95B,KAAKi6B,GAAK,KAAO,CAC9D7nB,EAAE,IAAIC,EAAEynB,IAAIjf,MAChBxI,EAAEwnB,KAAKhf,MAAO,SAEtBof,EAAKP,EAAK9tB,KAAKqtB,EAAS5mB,EAC5B,CAAE,MAAOuL,GAAKqc,EAAK,CAAC,EAAGrc,GAAI1K,EAAI,CAAG,CAAE,QAAU+J,EAAI7K,EAAI,CAAG,CACzD,GAAY,EAAR6nB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAE72B,MAAO62B,EAAG,GAAKA,EAAG,QAAK,EAAQT,MAAM,EAC9E,CAtBgDhiB,CAAK,CAAC1M,EAAGuG,GAAK,CAAG,CAuBrE,CA8BO,SAAS6oB,EAAOC,EAAGrvB,GACtB,IAAIkK,EAAsB,mBAAXlJ,QAAyBquB,EAAEruB,OAAOkuB,UACjD,IAAKhlB,EAAG,OAAOmlB,EACf,IAAmBxpB,EAAYiN,EAA3Bjd,EAAIqU,EAAEpJ,KAAKuuB,GAAOC,EAAK,GAC3B,IACI,WAAc,IAANtvB,GAAgBA,KAAM,MAAQ6F,EAAIhQ,EAAE4V,QAAQijB,MAAMY,EAAGp6B,KAAK2Q,EAAEvN,MACxE,CACA,MAAOoM,GAASoO,EAAI,CAAEpO,MAAOA,EAAS,CACtC,QACI,IACQmB,IAAMA,EAAE6oB,OAASxkB,EAAIrU,EAAU,SAAIqU,EAAEpJ,KAAKjL,EAClD,CACA,QAAU,GAAIid,EAAG,MAAMA,EAAEpO,KAAO,CACpC,CACA,OAAO4qB,CACX,CAkBO,SAASC,EAAcC,EAAIx1B,EAAMy1B,GACpC,GAAIA,GAA6B,IAArBl6B,UAAUC,OAAc,IAAK,IAA4B85B,EAAxBz5B,EAAI,EAAG6K,EAAI1G,EAAKxE,OAAYK,EAAI6K,EAAG7K,KACxEy5B,GAAQz5B,KAAKmE,IACRs1B,IAAIA,EAAKv1B,MAAMlF,UAAU0O,MAAMzC,KAAK9G,EAAM,EAAGnE,IAClDy5B,EAAGz5B,GAAKmE,EAAKnE,IAGrB,OAAO25B,EAAG/oB,OAAO6oB,GAAMv1B,MAAMlF,UAAU0O,MAAMzC,KAAK9G,GACtD,CArE6BgC,OAAO6xB,OA0GX7xB,OAAO6xB,M","file":"435.index.min.js","sourcesContent":["var WILDCARD = '*';\n/* event-emitter */\nvar EventEmitter = /** @class */ (function () {\n    function EventEmitter() {\n        this._events = {};\n    }\n    /**\n     * 监听一个事件\n     * @param evt\n     * @param callback\n     * @param once\n     */\n    EventEmitter.prototype.on = function (evt, callback, once) {\n        if (!this._events[evt]) {\n            this._events[evt] = [];\n        }\n        this._events[evt].push({\n            callback: callback,\n            once: !!once,\n        });\n        return this;\n    };\n    /**\n     * 监听一个事件一次\n     * @param evt\n     * @param callback\n     */\n    EventEmitter.prototype.once = function (evt, callback) {\n        return this.on(evt, callback, true);\n    };\n    /**\n     * 触发一个事件\n     * @param evt\n     * @param args\n     */\n    EventEmitter.prototype.emit = function (evt) {\n        var _this = this;\n        var args = [];\n        for (var _i = 1; _i < arguments.length; _i++) {\n            args[_i - 1] = arguments[_i];\n        }\n        var events = this._events[evt] || [];\n        var wildcardEvents = this._events[WILDCARD] || [];\n        // 实际的处理 emit 方法\n        var doEmit = function (es) {\n            var length = es.length;\n            for (var i = 0; i < length; i++) {\n                if (!es[i]) {\n                    continue;\n                }\n                var _a = es[i], callback = _a.callback, once = _a.once;\n                if (once) {\n                    es.splice(i, 1);\n                    if (es.length === 0) {\n                        delete _this._events[evt];\n                    }\n                    length--;\n                    i--;\n                }\n                callback.apply(_this, args);\n            }\n        };\n        doEmit(events);\n        doEmit(wildcardEvents);\n    };\n    /**\n     * 取消监听一个事件，或者一个channel\n     * @param evt\n     * @param callback\n     */\n    EventEmitter.prototype.off = function (evt, callback) {\n        if (!evt) {\n            // evt 为空全部清除\n            this._events = {};\n        }\n        else {\n            if (!callback) {\n                // evt 存在，callback 为空，清除事件所有方法\n                delete this._events[evt];\n            }\n            else {\n                // evt 存在，callback 存在，清除匹配的\n                var events = this._events[evt] || [];\n                var length_1 = events.length;\n                for (var i = 0; i < length_1; i++) {\n                    if (events[i].callback === callback) {\n                        events.splice(i, 1);\n                        length_1--;\n                        i--;\n                    }\n                }\n                if (events.length === 0) {\n                    delete this._events[evt];\n                }\n            }\n        }\n        return this;\n    };\n    /* 当前所有的事件 */\n    EventEmitter.prototype.getEvents = function () {\n        return this._events;\n    };\n    return EventEmitter;\n}());\nexport default EventEmitter;\n//# sourceMappingURL=index.js.map","import EventEmitter from '@antv/event-emitter';\nimport { doBFS, doDFS } from './utils/traverse';\nexport class Graph extends EventEmitter {\n    nodeMap = new Map();\n    edgeMap = new Map();\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    bothEdgesMap = new Map();\n    treeIndices = new Map();\n    changes = [];\n    batchCount = 0;\n    /**\n     * This function is called with a {@link GraphChangedEvent} each time a graph change happened.\n     *\n     * `event.changes` contains all the graph changes in order since last `onChanged`.\n     */\n    onChanged = () => {\n        // Do nothing.\n    };\n    /**\n     * Create a new Graph instance.\n     * @param options - The options to initialize a graph. See {@link GraphOptions}.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   // Optional, initial nodes.\n     *   nodes: [\n     *     // Each node has a unique ID.\n     *     { id: 'A', foo: 1 },\n     *     { id: 'B', foo: 1 },\n     *   ],\n     *   // Optional, initial edges.\n     *   edges: [\n     *     { id: 'C', source: 'B', target: 'B', weight: 1 },\n     *   ],\n     *   // Optional, called with a GraphChangedEvent.\n     *   onChanged: (event) => {\n     *     console.log(event);\n     *   }\n     * });\n     * ```\n     */\n    constructor(options) {\n        super();\n        if (!options)\n            return;\n        if (options.nodes)\n            this.addNodes(options.nodes);\n        if (options.edges)\n            this.addEdges(options.edges);\n        if (options.tree)\n            this.addTree(options.tree);\n        if (options.onChanged)\n            this.onChanged = options.onChanged;\n    }\n    /**\n     * Batch several graph changes into one.\n     *\n     * Make several changes, but dispatch only one ChangedEvent at the end of batch:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.addEdges([]);\n     * });\n     * ```\n     *\n     * Batches can be nested. Only the outermost batch will dispatch a ChangedEvent:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.batch(() => {\n     *     graph.addEdges([]);\n     *   });\n     * });\n     * ```\n     */\n    batch = (fn) => {\n        this.batchCount += 1;\n        fn();\n        this.batchCount -= 1;\n        if (!this.batchCount) {\n            this.commit();\n        }\n    };\n    /**\n     * Reset changes and dispatch a ChangedEvent.\n     */\n    commit() {\n        const changes = this.changes;\n        this.changes = [];\n        const event = {\n            graph: this,\n            changes,\n        };\n        this.emit('changed', event);\n        this.onChanged(event);\n    }\n    /**\n     * Reduce the number of ordered graph changes by dropping or merging unnecessary changes.\n     *\n     * For example, if we update a node and remove it in a batch:\n     *\n     * ```ts\n     * graph.batch(() => {\n     *   graph.updateNodeData('A', 'foo', 2);\n     *   graph.removeNode('A');\n     * });\n     * ```\n     *\n     * We get 2 atomic graph changes like\n     *\n     * ```ts\n     * [\n     *   { type: 'NodeDataUpdated', id: 'A', propertyName: 'foo', oldValue: 1, newValue: 2 },\n     *   { type: 'NodeRemoved', value: { id: 'A', data: { foo: 2 } },\n     * ]\n     * ```\n     *\n     * Since node 'A' has been removed, we actually have no need to handle with NodeDataUpdated change.\n     *\n     * `reduceChanges()` here helps us remove such changes.\n     */\n    reduceChanges(changes) {\n        let mergedChanges = [];\n        changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeRemoved': {\n                    // NodeAdded: A added.\n                    // NodeDataUpdated: A changed.\n                    // TreeStructureChanged: A's parent changed.\n                    // NodeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'NodeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'NodeDataUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.nodeId !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'EdgeRemoved': {\n                    // EdgeAdded: A added.\n                    // EdgeDataUpdated: A changed.\n                    // EdgeDataUpdated: A's source/target changed.\n                    // EdgeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'EdgeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'EdgeDataUpdated' ||\n                            pastChange.type === 'EdgeUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'NodeDataUpdated':\n                case 'EdgeDataUpdated':\n                case 'EdgeUpdated': {\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 1, newValue: 2 }.\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 2, newValue: 3 }.\n                    // 👆 Could be merged as { id: A, propertyName: 'foo', oldValue: 1, newValue: 3 }.\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === change.type &&\n                            pastChange.id === change.id &&\n                            pastChange.propertyName === change.propertyName);\n                    });\n                    if (existingChange) {\n                        existingChange.newValue = change.newValue;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'TreeStructureDetached': {\n                    // TreeStructureAttached\n                    // TreeStructureChanged\n                    // TreeStructureDetached 👈🏻 Since the tree struct was detached, above 2 changes may be ignored.\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'TreeStructureAttached') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        return true;\n                    });\n                    mergedChanges.push(change);\n                    break;\n                }\n                case 'TreeStructureChanged': {\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === 'TreeStructureChanged' &&\n                            pastChange.treeKey === change.treeKey &&\n                            pastChange.nodeId === change.nodeId);\n                    });\n                    if (existingChange) {\n                        existingChange.newParentId =\n                            change.newParentId;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                default:\n                    mergedChanges.push(change);\n                    break;\n            }\n        });\n        return mergedChanges;\n    }\n    // ================= Node =================\n    checkNodeExistence(id) {\n        this.getNode(id);\n    }\n    /**\n     * Check if a node exists in the graph.\n     * @group NodeMethods\n     */\n    hasNode(id) {\n        return this.nodeMap.has(id);\n    }\n    /**\n     * Tell if two nodes are neighbors.\n     * @group NodeMethods\n     */\n    areNeighbors(firstNodeId, secondNodeId) {\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    /**\n     * Get the node data with given ID.\n     * @group NodeMethods\n     */\n    getNode(id) {\n        const node = this.nodeMap.get(id);\n        if (!node) {\n            throw new Error('Node not found for id: ' + id);\n        }\n        return node;\n    }\n    /**\n     * Given a node ID, find all edges of the node.\n     * @param id - ID of the node\n     * @param direction - Edge direction, defaults to 'both'.\n     * @group NodeMethods\n     */\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        if (direction === 'in') {\n            const inEdges = this.inEdgesMap.get(id);\n            return Array.from(inEdges);\n        }\n        else if (direction === 'out') {\n            const outEdges = this.outEdgesMap.get(id);\n            return Array.from(outEdges);\n        }\n        else {\n            const bothEdges = this.bothEdgesMap.get(id);\n            return Array.from(bothEdges);\n        }\n    }\n    /**\n     * Get the degree of the given node.\n     * @group NodeMethods\n     */\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    /**\n     * Get all successors of the given node.\n     */\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => this.getNode(edge.target));\n        return Array.from(new Set(targets));\n    }\n    /**\n     * Get all predecessors of the given node.\n     */\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => this.getNode(edge.source));\n        return Array.from(new Set(sources));\n    }\n    /**\n     * Given a node ID, find its neighbors.\n     * @param id - ID of the node\n     * @group NodeMethods\n     */\n    getNeighbors(id) {\n        const predecessors = this.getPredecessors(id);\n        const successors = this.getSuccessors(id);\n        return Array.from(new Set([...predecessors, ...successors]));\n    }\n    doAddNode(node) {\n        if (this.hasNode(node.id)) {\n            throw new Error('Node already exists: ' + node.id);\n        }\n        this.nodeMap.set(node.id, node);\n        this.inEdgesMap.set(node.id, new Set());\n        this.outEdgesMap.set(node.id, new Set());\n        this.bothEdgesMap.set(node.id, new Set());\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.set(node.id, new Set());\n        });\n        this.changes.push({ type: 'NodeAdded', value: node });\n    }\n    /**\n     * Add all nodes of the given array, or iterable, into the graph.\n     * @group NodeMethods\n     */\n    addNodes(nodes) {\n        this.batch(() => {\n            for (const node of nodes) {\n                this.doAddNode(node);\n            }\n        });\n    }\n    /**\n     * Add a single node into the graph.\n     * @group NodeMethods\n     */\n    addNode(node) {\n        this.addNodes([node]);\n    }\n    doRemoveNode(id) {\n        const node = this.getNode(id);\n        const bothEdges = this.bothEdgesMap.get(id);\n        bothEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        this.nodeMap.delete(id);\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.get(id)?.forEach((child) => {\n                tree.parentMap.delete(child.id);\n            });\n            tree.parentMap.delete(id);\n            tree.childrenMap.delete(id);\n        });\n        this.changes.push({ type: 'NodeRemoved', value: node });\n    }\n    /**\n     * Remove nodes and their attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNodes(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveNode(id));\n        });\n    }\n    /**\n     * Remove a single node and its attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNode(id) {\n        this.removeNodes([id]);\n    }\n    updateNodeDataProperty(id, propertyName, value) {\n        const node = this.getNode(id);\n        this.batch(() => {\n            const oldValue = node.data[propertyName];\n            const newValue = value;\n            node.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * Like Object.assign, merge all properties of `path` to the node data.\n     * @param id Node ID.\n     * @param patch A data object to merge.\n     */\n    mergeNodeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateNodeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    updateNodeData(...args) {\n        const id = args[0];\n        const node = this.getNode(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateNodeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(node.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = node.data;\n            const newValue = data;\n            node.data = data;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    // ================= Edge =================\n    checkEdgeExistence(id) {\n        if (!this.hasEdge(id)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if an edge exists in the graph.\n     * @group NodeMethods\n     */\n    hasEdge(id) {\n        return this.edgeMap.has(id);\n    }\n    /**\n     * Get the edge data with given ID.\n     * @group EdgeMethods\n     */\n    getEdge(id) {\n        this.checkEdgeExistence(id);\n        return this.edgeMap.get(id);\n    }\n    /**\n     * Get the edge, the source node, and the target node by an edge ID.\n     * @group EdgeMethods\n     */\n    getEdgeDetail(id) {\n        const edge = this.getEdge(id);\n        return {\n            edge,\n            source: this.getNode(edge.source),\n            target: this.getNode(edge.target),\n        };\n    }\n    doAddEdge(edge) {\n        if (this.hasEdge(edge.id)) {\n            throw new Error('Edge already exists: ' + edge.id);\n        }\n        this.checkNodeExistence(edge.source);\n        this.checkNodeExistence(edge.target);\n        this.edgeMap.set(edge.id, edge);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        inEdges.add(edge);\n        outEdges.add(edge);\n        bothEdgesOfSource.add(edge);\n        bothEdgesOfTarget.add(edge);\n        this.changes.push({ type: 'EdgeAdded', value: edge });\n    }\n    /**\n     * Add all edges of the given iterable(an array, a set, etc.) into the graph.\n     * @group EdgeMethods\n     */\n    addEdges(edges) {\n        this.batch(() => {\n            for (const edge of edges) {\n                this.doAddEdge(edge);\n            }\n        });\n    }\n    /**\n     * Add a single edge pointing from `source` to `target` into the graph.\n     *\n     * ```ts\n     * graph.addNode({ id: 'NodeA' });\n     * graph.addNode({ id: 'NodeB' });\n     * graph.addEdge({ id: 'EdgeA', source: 'NodeA', target: 'NodeB' });\n     * ```\n     *\n     * If `source` or `target` were not found in the current graph, it throws an Error.\n     * @group EdgeMethods\n     */\n    addEdge(edge) {\n        this.addEdges([edge]);\n    }\n    doRemoveEdge(id) {\n        const edge = this.getEdge(id);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        outEdges.delete(edge);\n        inEdges.delete(edge);\n        bothEdgesOfSource.delete(edge);\n        bothEdgesOfTarget.delete(edge);\n        this.edgeMap.delete(id);\n        this.changes.push({ type: 'EdgeRemoved', value: edge });\n    }\n    /**\n     * Remove edges whose id was included in the given id list.\n     * @group EdgeMethods\n     */\n    removeEdges(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveEdge(id));\n        });\n    }\n    /**\n     * Remove a single edge of the given id.\n     * @group EdgeMethods\n     */\n    removeEdge(id) {\n        this.removeEdges([id]);\n    }\n    /**\n     * Change the source of an edge. The source must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeSource(id, source) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(source);\n        const oldSource = edge.source;\n        const newSource = source;\n        this.outEdgesMap.get(oldSource).delete(edge);\n        this.bothEdgesMap.get(oldSource).delete(edge);\n        this.outEdgesMap.get(newSource).add(edge);\n        this.bothEdgesMap.get(newSource).add(edge);\n        edge.source = source;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'source',\n                oldValue: oldSource,\n                newValue: newSource,\n            });\n        });\n    }\n    /**\n     * Change the target of an edge. The target must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeTarget(id, target) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(target);\n        const oldTarget = edge.target;\n        const newTarget = target;\n        this.inEdgesMap.get(oldTarget).delete(edge);\n        this.bothEdgesMap.get(oldTarget).delete(edge);\n        this.inEdgesMap.get(newTarget).add(edge);\n        this.bothEdgesMap.get(newTarget).add(edge);\n        edge.target = target;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'target',\n                oldValue: oldTarget,\n                newValue: newTarget,\n            });\n        });\n    }\n    updateEdgeDataProperty(id, propertyName, value) {\n        const edge = this.getEdge(id);\n        this.batch(() => {\n            const oldValue = edge.data[propertyName];\n            const newValue = value;\n            edge.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    updateEdgeData(...args) {\n        const id = args[0];\n        const edge = this.getEdge(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateEdgeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(edge.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = edge.data;\n            const newValue = data;\n            edge.data = data;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * @group EdgeMethods\n     */\n    mergeEdgeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateEdgeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Tree =================\n    checkTreeExistence(treeKey) {\n        if (!this.hasTreeStructure(treeKey)) {\n            throw new Error('Tree structure not found for treeKey: ' + treeKey);\n        }\n    }\n    hasTreeStructure(treeKey) {\n        return this.treeIndices.has(treeKey);\n    }\n    /**\n     * Attach a new tree structure representing the hierarchy of all nodes in the graph.\n     * @param treeKey A unique key of the tree structure. You can attach multiple tree structures with different keys.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   nodes: [{ id: 1 }, { id: 2 }, { id: 3 }],\n     * });\n     * graph.attachTreeStructure('Inheritance');\n     * graph.setParent(2, 1, 'Inheritance');\n     * graph.setParent(3, 1, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2,3]\n     * ```\n     * @group TreeMethods\n     */\n    attachTreeStructure(treeKey) {\n        if (this.treeIndices.has(treeKey)) {\n            // Already attached.\n            return;\n        }\n        this.treeIndices.set(treeKey, {\n            parentMap: new Map(),\n            childrenMap: new Map(),\n        });\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureAttached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Detach the tree structure of the given tree key from the graph.\n     *\n     * ```ts\n     * graph.detachTreeStructure('Inheritance');\n     * graph.getRoots('Inheritance'); // Error!\n     * ```\n     * @group TreeMethods\n     */\n    detachTreeStructure(treeKey) {\n        this.checkTreeExistence(treeKey);\n        this.treeIndices.delete(treeKey);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureDetached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Traverse the given tree data, add each node into the graph, then attach the tree structure.\n     *\n     * ```ts\n     * graph.addTree({\n     *   id: 1,\n     *   children: [\n     *     { id: 2 },\n     *     { id: 3 },\n     *   ],\n     * }, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2, 3]\n     * graph.getAllNodes(); // [1, 2, 3]\n     * graph.getAllEdges(); // []\n     * ```\n     * @group TreeMethods\n     */\n    addTree(tree, treeKey) {\n        this.batch(() => {\n            this.attachTreeStructure(treeKey);\n            // Add Nodes\n            const nodes = [];\n            const stack = Array.isArray(tree) ? tree : [tree];\n            while (stack.length) {\n                const node = stack.shift();\n                nodes.push(node);\n                if (node.children) {\n                    stack.push(...node.children);\n                }\n            }\n            this.addNodes(nodes);\n            // Set parent for each child node.\n            nodes.forEach((parent) => {\n                parent.children?.forEach((child) => {\n                    this.setParent(child.id, parent.id, treeKey);\n                });\n            });\n        });\n    }\n    /**\n     * Get the root nodes of an attached tree structure.\n     *\n     * Consider a graph with the following tree structure attached:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     * ```\n     * `graph.getRoots()` takes all nodes without a parent, therefore [0, 3] was returned.\n     *\n     * Newly added nodes are also unparented. So they are counted as roots.\n     * ```ts\n     * graph.addNode({ id: 5 });\n     * graph.getRoots(); // [0, 3, 5]\n     * ```\n     *\n     * Here is how the tree structure looks like:\n     * ```\n     * Tree structure:\n     *    O     3  5\n     *   / \\    |\n     *  1   2   4\n     * ```\n     *\n     * By setting a parent, a root node no more be a root.\n     * ```ts\n     * graph.setParent(5, 2);\n     * graph.getRoots(); // [0, 3]\n     * ```\n     *\n     * The tree structure now becomes:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     *      |\n     *      5\n     * ```\n     *\n     * Removing a node forces its children to be unparented, or roots.\n     * ```ts\n     * graph.removeNode(0);\n     * graph.getRoots(); // [1, 2, 3]\n     * ```\n     *\n     * You might draw the the structure as follow:\n     * ```\n     * Tree structure:\n     *  1   2  3\n     *      |  |\n     *      5  4\n     * ```\n     * @group TreeMethods\n     */\n    getRoots(treeKey) {\n        this.checkTreeExistence(treeKey);\n        return this.getAllNodes().filter((node) => !this.getParent(node.id, treeKey));\n    }\n    /**\n     * Given a node ID and an optional tree key, get the children of the node in the specified tree structure.\n     * @group TreeMethods\n     */\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const children = tree.childrenMap.get(id);\n        return Array.from(children || []);\n    }\n    /**\n     * Given a node ID and an optional tree key, get the parent of the node in the specified tree structure.\n     * If the given node is one of the tree roots, this returns null.\n     * @group TreeMethods\n     */\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        return tree.parentMap.get(id) || null;\n    }\n    /**\n     * Returns an array of all the ancestor nodes, staring from the parent to the root.\n     */\n    getAncestors(id, treeKey) {\n        const ancestors = [];\n        let current = this.getNode(id);\n        let parent;\n        while (parent = this.getParent(current.id, treeKey)) {\n            ancestors.push(parent);\n            current = parent;\n        }\n        return ancestors;\n    }\n    /**\n     * Set node parent. If this operation causes a circle, it fails with an error.\n     * @param id - ID of the child node.\n     * @param parent - ID of the parent node.\n     * @param treeKey - Which tree structure the relation is applied to.\n     * @group TreeMethods\n     */\n    setParent(id, parent, treeKey) {\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const node = this.getNode(id);\n        const oldParent = tree.parentMap.get(id);\n        const newParent = this.getNode(parent);\n        // Set parent\n        tree.parentMap.set(id, newParent);\n        // Set children\n        if (oldParent) {\n            tree.childrenMap.get(oldParent.id)?.delete(node);\n        }\n        let children = tree.childrenMap.get(newParent.id);\n        if (!children) {\n            children = new Set();\n            tree.childrenMap.set(newParent.id, children);\n        }\n        children.add(node);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureChanged',\n                treeKey,\n                nodeId: id,\n                oldParentId: oldParent?.id,\n                newParentId: newParent.id,\n            });\n        });\n    }\n    dfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n    bfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    // ================= Graph =================\n    /**\n     * Get all nodes in the graph as an array.\n     */\n    getAllNodes() {\n        return Array.from(this.nodeMap.values());\n    }\n    /**\n     * Get all edges in the graph as an array.\n     */\n    getAllEdges() {\n        return Array.from(this.edgeMap.values());\n    }\n    bfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    dfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n    clone() {\n        // Make a shallow copy of nodes and edges.\n        const newNodes = this.getAllNodes().map((oldNode) => {\n            return { ...oldNode, data: { ...oldNode.data } };\n        });\n        const newEdges = this.getAllEdges().map((oldEdge) => {\n            return { ...oldEdge, data: { ...oldEdge.data } };\n        });\n        // Create a new graph with shallow copied nodes and edges.\n        const newGraph = new Graph({\n            nodes: newNodes,\n            edges: newEdges,\n        });\n        // Add tree indices.\n        this.treeIndices.forEach(({ parentMap: oldParentMap, childrenMap: oldChildrenMap }, treeKey) => {\n            const parentMap = new Map();\n            oldParentMap.forEach((parent, key) => {\n                parentMap.set(key, newGraph.getNode(parent.id));\n            });\n            const childrenMap = new Map();\n            oldChildrenMap.forEach((children, key) => {\n                childrenMap.set(key, new Set(Array.from(children).map((n) => newGraph.getNode(n.id))));\n            });\n            newGraph.treeIndices.set(treeKey, {\n                parentMap: parentMap,\n                childrenMap: childrenMap,\n            });\n        });\n        return newGraph;\n    }\n    toJSON() {\n        return JSON.stringify({\n            nodes: this.getAllNodes(),\n            edges: this.getAllEdges(),\n            // FIXME: And tree structures?\n        });\n    }\n}\n//# sourceMappingURL=graph.js.map","export function doBFS(queue, visited, fn, navigator) {\n    while (queue.length) {\n        const node = queue.shift();\n        const abort = fn(node);\n        if (abort) {\n            return true;\n        }\n        visited.add(node.id);\n        navigator(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                visited.add(n.id);\n                queue.push(n);\n            }\n        });\n    }\n    return false;\n}\nexport function doDFS(node, visited, fn, navigator) {\n    const abort = fn(node);\n    if (abort) {\n        return true;\n    }\n    visited.add(node.id);\n    for (const n of navigator(node.id)) {\n        if (!visited.has(n.id)) {\n            if (doDFS(n, visited, fn, navigator)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=traverse.js.map","import isArray from './is-array';\nvar clone = function (obj) {\n    if (typeof obj !== 'object' || obj === null) {\n        return obj;\n    }\n    var rst;\n    if (isArray(obj)) {\n        rst = [];\n        for (var i = 0, l = obj.length; i < l; i++) {\n            if (typeof obj[i] === 'object' && obj[i] != null) {\n                rst[i] = clone(obj[i]);\n            }\n            else {\n                rst[i] = obj[i];\n            }\n        }\n    }\n    else {\n        rst = {};\n        for (var k in obj) {\n            if (typeof obj[k] === 'object' && obj[k] != null) {\n                rst[k] = clone(obj[k]);\n            }\n            else {\n                rst[k] = obj[k];\n            }\n        }\n    }\n    return rst;\n};\nexport default clone;\n//# sourceMappingURL=clone.js.map","import isType from './is-type';\nexport default (function (value) {\n    return Array.isArray ? Array.isArray(value) : isType(value, 'Array');\n});\n//# sourceMappingURL=is-array.js.map","/**\n * @see https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_isfunction\n */\nexport default (function (value) {\n    return typeof value === 'function';\n});\n//# sourceMappingURL=is-function.js.map","// isFinite,\nvar isNil = function (value) {\n    /**\n     * isNil(null) => true\n     * isNil() => true\n     */\n    return value === null || value === undefined;\n};\nexport default isNil;\n//# sourceMappingURL=is-nil.js.map","/**\n * 判断是否数字\n * @return {Boolean} 是否数字\n */\nimport isType from './is-type';\nvar isNumber = function (value) {\n    return isType(value, 'Number');\n};\nexport default isNumber;\n//# sourceMappingURL=is-number.js.map","export default (function (value) {\n    /**\n     * isObject({}) => true\n     * isObject([1, 2, 3]) => true\n     * isObject(Function) => true\n     * isObject(null) => false\n     */\n    var type = typeof value;\n    return (value !== null && type === 'object') || type === 'function';\n});\n//# sourceMappingURL=is-object.js.map","import isType from './is-type';\nexport default (function (str) {\n    return isType(str, 'String');\n});\n//# sourceMappingURL=is-string.js.map","var toString = {}.toString;\nvar isType = function (value, type) { return toString.call(value) === '[object ' + type + ']'; };\nexport default isType;\n//# sourceMappingURL=is-type.js.map","/**\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    return createProxy(ep, [], 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, {\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, 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                    isProxyReleased = true;\n                };\n            }\n            if (prop === \"then\") {\n                if (path.length === 0) {\n                    return { then: () => proxy };\n                }\n                const r = requestResponseMessage(ep, {\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, [...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, {\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, {\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, path.slice(0, -1));\n            }\n            const [argumentList, transferables] = processArguments(rawArgumentList);\n            return requestResponseMessage(ep, {\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, {\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, msg, transfers) {\n    return new Promise((resolve) => {\n        const id = generateUUID();\n        ep.addEventListener(\"message\", function l(ev) {\n            if (!ev.data || !ev.data.id || ev.data.id !== id) {\n                return;\n            }\n            ep.removeEventListener(\"message\", l);\n            resolve(ev.data);\n        });\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","var noop = {value: () => {}};\n\nfunction dispatch() {\n  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {\n    if (!(t = arguments[i] + \"\") || (t in _) || /[\\s.]/.test(t)) throw new Error(\"illegal type: \" + t);\n    _[t] = [];\n  }\n  return new Dispatch(_);\n}\n\nfunction Dispatch(_) {\n  this._ = _;\n}\n\nfunction parseTypenames(typenames, types) {\n  return typenames.trim().split(/^|\\s+/).map(function(t) {\n    var name = \"\", i = t.indexOf(\".\");\n    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);\n    if (t && !types.hasOwnProperty(t)) throw new Error(\"unknown type: \" + t);\n    return {type: t, name: name};\n  });\n}\n\nDispatch.prototype = dispatch.prototype = {\n  constructor: Dispatch,\n  on: function(typename, callback) {\n    var _ = this._,\n        T = parseTypenames(typename + \"\", _),\n        t,\n        i = -1,\n        n = T.length;\n\n    // If no callback was specified, return the callback of the given type and name.\n    if (arguments.length < 2) {\n      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;\n      return;\n    }\n\n    // If a type was specified, set the callback for the given type and name.\n    // Otherwise, if a null callback was specified, remove callbacks of the given name.\n    if (callback != null && typeof callback !== \"function\") throw new Error(\"invalid callback: \" + callback);\n    while (++i < n) {\n      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);\n      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);\n    }\n\n    return this;\n  },\n  copy: function() {\n    var copy = {}, _ = this._;\n    for (var t in _) copy[t] = _[t].slice();\n    return new Dispatch(copy);\n  },\n  call: function(type, that) {\n    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  },\n  apply: function(type, that, args) {\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  }\n};\n\nfunction get(type, name) {\n  for (var i = 0, n = type.length, c; i < n; ++i) {\n    if ((c = type[i]).name === name) {\n      return c.value;\n    }\n  }\n}\n\nfunction set(type, name, callback) {\n  for (var i = 0, n = type.length; i < n; ++i) {\n    if (type[i].name === name) {\n      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));\n      break;\n    }\n  }\n  if (callback != null) type.push({name: name, value: callback});\n  return type;\n}\n\nexport default dispatch;\n","export default function(x, y) {\n  var nodes, strength = 1;\n\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n\n  function force() {\n    var i,\n        n = nodes.length,\n        node,\n        sx = 0,\n        sy = 0;\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i], sx += node.x, sy += node.y;\n    }\n\n    for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n      node = nodes[i], node.x -= sx, node.y -= sy;\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = +_, force) : x;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = +_, force) : y;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  return force;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction x(d) {\n  return d.x + d.vx;\n}\n\nfunction y(d) {\n  return d.y + d.vy;\n}\n\nexport default function(radius) {\n  var nodes,\n      radii,\n      random,\n      strength = 1,\n      iterations = 1;\n\n  if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n  function force() {\n    var i, n = nodes.length,\n        tree,\n        node,\n        xi,\n        yi,\n        ri,\n        ri2;\n\n    for (var k = 0; k < iterations; ++k) {\n      tree = quadtree(nodes, x, y).visitAfter(prepare);\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        ri = radii[node.index], ri2 = ri * ri;\n        xi = node.x + node.vx;\n        yi = node.y + node.vy;\n        tree.visit(apply);\n      }\n    }\n\n    function apply(quad, x0, y0, x1, y1) {\n      var data = quad.data, rj = quad.r, r = ri + rj;\n      if (data) {\n        if (data.index > node.index) {\n          var x = xi - data.x - data.vx,\n              y = yi - data.y - data.vy,\n              l = x * x + y * y;\n          if (l < r * r) {\n            if (x === 0) x = jiggle(random), l += x * x;\n            if (y === 0) y = jiggle(random), l += y * y;\n            l = (r - (l = Math.sqrt(l))) / l * strength;\n            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n            node.vy += (y *= l) * r;\n            data.vx -= x * (r = 1 - r);\n            data.vy -= y * r;\n          }\n        }\n        return;\n      }\n      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n    }\n  }\n\n  function prepare(quad) {\n    if (quad.data) return quad.r = radii[quad.data.index];\n    for (var i = quad.r = 0; i < 4; ++i) {\n      if (quad[i] && quad[i].r > quad.r) {\n        quad.r = quad[i].r;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    radii = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  return force;\n}\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction index(d) {\n  return d.index;\n}\n\nfunction find(nodeById, nodeId) {\n  var node = nodeById.get(nodeId);\n  if (!node) throw new Error(\"node not found: \" + nodeId);\n  return node;\n}\n\nexport default function(links) {\n  var id = index,\n      strength = defaultStrength,\n      strengths,\n      distance = constant(30),\n      distances,\n      nodes,\n      count,\n      bias,\n      random,\n      iterations = 1;\n\n  if (links == null) links = [];\n\n  function defaultStrength(link) {\n    return 1 / Math.min(count[link.source.index], count[link.target.index]);\n  }\n\n  function force(alpha) {\n    for (var k = 0, n = links.length; k < iterations; ++k) {\n      for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {\n        link = links[i], source = link.source, target = link.target;\n        x = target.x + target.vx - source.x - source.vx || jiggle(random);\n        y = target.y + target.vy - source.y - source.vy || jiggle(random);\n        l = Math.sqrt(x * x + y * y);\n        l = (l - distances[i]) / l * alpha * strengths[i];\n        x *= l, y *= l;\n        target.vx -= x * (b = bias[i]);\n        target.vy -= y * b;\n        source.vx += x * (b = 1 - b);\n        source.vy += y * b;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n\n    var i,\n        n = nodes.length,\n        m = links.length,\n        nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),\n        link;\n\n    for (i = 0, count = new Array(n); i < m; ++i) {\n      link = links[i], link.index = i;\n      if (typeof link.source !== \"object\") link.source = find(nodeById, link.source);\n      if (typeof link.target !== \"object\") link.target = find(nodeById, link.target);\n      count[link.source.index] = (count[link.source.index] || 0) + 1;\n      count[link.target.index] = (count[link.target.index] || 0) + 1;\n    }\n\n    for (i = 0, bias = new Array(m); i < m; ++i) {\n      link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);\n    }\n\n    strengths = new Array(m), initializeStrength();\n    distances = new Array(m), initializeDistance();\n  }\n\n  function initializeStrength() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      strengths[i] = +strength(links[i], i, links);\n    }\n  }\n\n  function initializeDistance() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      distances[i] = +distance(links[i], i, links);\n    }\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.links = function(_) {\n    return arguments.length ? (links = _, initialize(), force) : links;\n  };\n\n  force.id = function(_) {\n    return arguments.length ? (id = _, force) : id;\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initializeStrength(), force) : strength;\n  };\n\n  force.distance = function(_) {\n    return arguments.length ? (distance = typeof _ === \"function\" ? _ : constant(+_), initializeDistance(), force) : distance;\n  };\n\n  return force;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import constant from \"./constant.js\";\n\nexport default function(x) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      xz;\n\n  if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    xz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(y) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      yz;\n\n  if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    yz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n  };\n\n  return force;\n}\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d),\n      z = +this._z.call(null, d);\n  return add(this.cover(x, y, z), x, y, z, d);\n}\n\nfunction add(tree, x, y, z, d) {\n  if (isNaN(x) || isNaN(y) || isNaN(z)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      z0 = tree._z0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      z1 = tree._z1,\n      xm,\n      ym,\n      zm,\n      xp,\n      yp,\n      zp,\n      right,\n      bottom,\n      deep,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n    if (parent = node, !(node = node[i = deep << 2 | bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  zp = +tree._z.call(null, node.data);\n  if (x === xp && y === yp && z === zp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(8) : tree._root = new Array(8);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n  } while ((i = deep << 2 | bottom << 1 | right) === (j = (zp >= zm) << 2 | (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  if (!Array.isArray(data)) data = Array.from(data);\n  const n = data.length;\n  const xz = new Float64Array(n);\n  const yz = new Float64Array(n);\n  const zz = new Float64Array(n);\n  let x0 = Infinity,\n      y0 = Infinity,\n      z0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity,\n      z1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (let i = 0, d, x, y, z; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    zz[i] = z;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n    if (z < z0) z0 = z;\n    if (z > z1) z1 = z;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1 || z0 > z1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0, z0).cover(x1, y1, z1);\n\n  // Add the new points.\n  for (let i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], zz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y, z) {\n  if (isNaN(x = +x) || isNaN(y = +y) || isNaN(z = +z)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1;\n\n  // If the octree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing octant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n    z1 = (z0 = Math.floor(z)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var t = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1 || z0 > z || z >= z1) {\n      i = (z < z0) << 2 | (y < y0) << 1 | (x < x0);\n      parent = new Array(8), parent[i] = node, node = parent, t *= 2;\n      switch (i) {\n        case 0: x1 = x0 + t, y1 = y0 + t, z1 = z0 + t; break;\n        case 1: x0 = x1 - t, y1 = y0 + t, z1 = z0 + t; break;\n        case 2: x1 = x0 + t, y0 = y1 - t, z1 = z0 + t; break;\n        case 3: x0 = x1 - t, y0 = y1 - t, z1 = z0 + t; break;\n        case 4: x1 = x0 + t, y1 = y0 + t, z0 = z1 - t; break;\n        case 5: x0 = x1 - t, y1 = y0 + t, z0 = z1 - t; break;\n        case 6: x1 = x0 + t, y0 = y1 - t, z0 = z1 - t; break;\n        case 7: x0 = x1 - t, y0 = y1 - t, z0 = z1 - t; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1], +_[0][2]).cover(+_[1][0], +_[1][1], +_[1][2])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];\n}\n","import Octant from \"./octant.js\";\n\nexport default function(x, y, z, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1,\n      y1,\n      z1,\n      x2,\n      y2,\n      z2,\n      x3 = this._x1,\n      y3 = this._y1,\n      z3 = this._z1,\n      octs = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) octs.push(new Octant(node, x0, y0, z0, x3, y3, z3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius, z0 = z - radius;\n    x3 = x + radius, y3 = y + radius, z3 = z + radius;\n    radius *= radius;\n  }\n\n  while (q = octs.pop()) {\n\n    // Stop searching if this octant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (z1 = q.z0) > z3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0\n        || (z2 = q.z1) < z0) continue;\n\n    // Bisect the current octant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2,\n          zm = (z1 + z2) / 2;\n\n      octs.push(\n        new Octant(node[7], xm, ym, zm, x2, y2, z2),\n        new Octant(node[6], x1, ym, zm, xm, y2, z2),\n        new Octant(node[5], xm, y1, zm, x2, ym, z2),\n        new Octant(node[4], x1, y1, zm, xm, ym, z2),\n        new Octant(node[3], xm, ym, z1, x2, y2, zm),\n        new Octant(node[2], x1, ym, z1, xm, y2, zm),\n        new Octant(node[1], xm, y1, z1, x2, ym, zm),\n        new Octant(node[0], x1, y1, z1, xm, ym, zm)\n      );\n\n      // Visit the closest octant first.\n      if (i = (z >= zm) << 2 | (y >= ym) << 1 | (x >= xm)) {\n        q = octs[octs.length - 1];\n        octs[octs.length - 1] = octs[octs.length - 1 - i];\n        octs[octs.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          dz = z - +this._z.call(null, node.data),\n          d2 = dx * dx + dy * dy + dz * dz;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d, z0 = z - d;\n        x3 = x + d, y3 = y + d, z3 = z + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(node, x0, y0, z0, x1, y1, z1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.z0 = z0;\n  this.x1 = x1;\n  this.y1 = y1;\n  this.z1 = z1;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\nimport tree_z, {defaultZ} from \"./z.js\";\n\nexport default function octree(nodes, x, y, z) {\n  var tree = new Octree(x == null ? defaultX : x, y == null ? defaultY : y, z == null ? defaultZ : z, NaN, NaN, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Octree(x, y, z, x0, y0, z0, x1, y1, z1) {\n  this._x = x;\n  this._y = y;\n  this._z = z;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = octree.prototype = Octree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Octree(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(8)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 8; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(8)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\ntreeProto.z = tree_z;\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1,\n      x,\n      y,\n      z,\n      xm,\n      ym,\n      zm,\n      right,\n      bottom,\n      deep,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n    if (!(parent = node, node = node[i = deep << 2 | bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 7] || parent[(i + 2) & 7] || parent[(i + 3) & 7] || parent[(i + 4) & 7] || parent[(i + 5) & 7] || parent[(i + 6) & 7] || parent[(i + 7) & 7]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3] || parent[4] || parent[5] || parent[6] || parent[7])\n      && node === (parent[7] || parent[6] || parent[5] || parent[4] || parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n  var octs = [], q, node = this._root, child, x0, y0, z0, x1, y1, z1;\n  if (node) octs.push(new Octant(node, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n    }\n  }\n  return this;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n  var octs = [], next = [], q;\n  if (this._root) octs.push(new Octant(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.z0, q.x1, q.y1, q.z1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","export function defaultZ(d) {\n  return d[2];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._z = _, this) : this._z;\n}\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","var frame = 0, // is an animation frame pending?\n    timeout = 0, // is a timeout pending?\n    interval = 0, // are any timers active?\n    pokeDelay = 1000, // how frequently we check for clock skew\n    taskHead,\n    taskTail,\n    clockLast = 0,\n    clockNow = 0,\n    clockSkew = 0,\n    clock = typeof performance === \"object\" && performance.now ? performance : Date,\n    setFrame = typeof window === \"object\" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };\n\nexport function now() {\n  return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);\n}\n\nfunction clearNow() {\n  clockNow = 0;\n}\n\nexport function Timer() {\n  this._call =\n  this._time =\n  this._next = null;\n}\n\nTimer.prototype = timer.prototype = {\n  constructor: Timer,\n  restart: function(callback, delay, time) {\n    if (typeof callback !== \"function\") throw new TypeError(\"callback is not a function\");\n    time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);\n    if (!this._next && taskTail !== this) {\n      if (taskTail) taskTail._next = this;\n      else taskHead = this;\n      taskTail = this;\n    }\n    this._call = callback;\n    this._time = time;\n    sleep();\n  },\n  stop: function() {\n    if (this._call) {\n      this._call = null;\n      this._time = Infinity;\n      sleep();\n    }\n  }\n};\n\nexport function timer(callback, delay, time) {\n  var t = new Timer;\n  t.restart(callback, delay, time);\n  return t;\n}\n\nexport function timerFlush() {\n  now(); // Get the current time, if not already set.\n  ++frame; // Pretend we’ve set an alarm, if we haven’t already.\n  var t = taskHead, e;\n  while (t) {\n    if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);\n    t = t._next;\n  }\n  --frame;\n}\n\nfunction wake() {\n  clockNow = (clockLast = clock.now()) + clockSkew;\n  frame = timeout = 0;\n  try {\n    timerFlush();\n  } finally {\n    frame = 0;\n    nap();\n    clockNow = 0;\n  }\n}\n\nfunction poke() {\n  var now = clock.now(), delay = now - clockLast;\n  if (delay > pokeDelay) clockSkew -= delay, clockLast = now;\n}\n\nfunction nap() {\n  var t0, t1 = taskHead, t2, time = Infinity;\n  while (t1) {\n    if (t1._call) {\n      if (time > t1._time) time = t1._time;\n      t0 = t1, t1 = t1._next;\n    } else {\n      t2 = t1._next, t1._next = null;\n      t1 = t0 ? t0._next = t2 : taskHead = t2;\n    }\n  }\n  taskTail = t0;\n  sleep(time);\n}\n\nfunction sleep(time) {\n  if (frame) return; // Soonest alarm already set, or will be.\n  if (timeout) timeout = clearTimeout(timeout);\n  var delay = time - clockNow; // Strictly less than if we recomputed clockNow.\n  if (delay > 24) {\n    if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);\n    if (interval) interval = clearInterval(interval);\n  } else {\n    if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);\n    frame = 1, setFrame(wake);\n  }\n}\n","// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n *\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\n\nfunction max(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  }\n\n  if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var _options$fromIndex = options.fromIndex,\n      fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n      _options$toIndex = options.toIndex,\n      toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n  if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n    throw new Error('fromIndex must be a positive integer smaller than length');\n  }\n\n  if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n    throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n  }\n\n  var maxValue = input[fromIndex];\n\n  for (var i = fromIndex + 1; i < toIndex; i++) {\n    if (input[i] > maxValue) maxValue = input[i];\n  }\n\n  return maxValue;\n}\n\nexport { max as default };\n","import { isAnyArray } from 'is-any-array';\n\nfunction min(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  }\n\n  if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var _options$fromIndex = options.fromIndex,\n      fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n      _options$toIndex = options.toIndex,\n      toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n  if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n    throw new Error('fromIndex must be a positive integer smaller than length');\n  }\n\n  if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n    throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n  }\n\n  var minValue = input[fromIndex];\n\n  for (var i = fromIndex + 1; i < toIndex; i++) {\n    if (input[i] < minValue) minValue = input[i];\n  }\n\n  return minValue;\n}\n\nexport { min as default };\n","import { isAnyArray } from 'is-any-array';\nimport max from 'ml-array-max';\nimport min from 'ml-array-min';\n\nfunction rescale(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  } else if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var output;\n\n  if (options.output !== undefined) {\n    if (!isAnyArray(options.output)) {\n      throw new TypeError('output option must be an array if specified');\n    }\n\n    output = options.output;\n  } else {\n    output = new Array(input.length);\n  }\n\n  var currentMin = min(input);\n  var currentMax = max(input);\n\n  if (currentMin === currentMax) {\n    throw new RangeError('minimum and maximum input values are equal. Cannot rescale a constant array');\n  }\n\n  var _options$min = options.min,\n      minValue = _options$min === void 0 ? options.autoMinMax ? currentMin : 0 : _options$min,\n      _options$max = options.max,\n      maxValue = _options$max === void 0 ? options.autoMinMax ? currentMax : 1 : _options$max;\n\n  if (minValue >= maxValue) {\n    throw new RangeError('min option must be smaller than max option');\n  }\n\n  var factor = (maxValue - minValue) / (currentMax - currentMin);\n\n  for (var i = 0; i < input.length; i++) {\n    output[i] = (input[i] - currentMin) * factor + minValue;\n  }\n\n  return output;\n}\n\nexport { rescale as default };\n","import Matrix from '../matrix';\nimport WrapperMatrix2D from '../wrap/WrapperMatrix2D';\n\nimport { hypotenuse } from './util';\n\nexport default class SingularValueDecomposition {\n  constructor(value, options = {}) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    if (value.isEmpty()) {\n      throw new Error('Matrix must be non-empty');\n    }\n\n    let m = value.rows;\n    let n = value.columns;\n\n    const {\n      computeLeftSingularVectors = true,\n      computeRightSingularVectors = true,\n      autoTranspose = false,\n    } = options;\n\n    let wantu = Boolean(computeLeftSingularVectors);\n    let wantv = Boolean(computeRightSingularVectors);\n\n    let swapped = false;\n    let a;\n    if (m < n) {\n      if (!autoTranspose) {\n        a = value.clone();\n        // eslint-disable-next-line no-console\n        console.warn(\n          'Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose',\n        );\n      } else {\n        a = value.transpose();\n        m = a.rows;\n        n = a.columns;\n        swapped = true;\n        let aux = wantu;\n        wantu = wantv;\n        wantv = aux;\n      }\n    } else {\n      a = value.clone();\n    }\n\n    let nu = Math.min(m, n);\n    let ni = Math.min(m + 1, n);\n    let s = new Float64Array(ni);\n    let U = new Matrix(m, nu);\n    let V = new Matrix(n, n);\n\n    let e = new Float64Array(n);\n    let work = new Float64Array(m);\n\n    let si = new Float64Array(ni);\n    for (let i = 0; i < ni; i++) si[i] = i;\n\n    let nct = Math.min(m - 1, n);\n    let nrt = Math.max(0, Math.min(n - 2, m));\n    let mrc = Math.max(nct, nrt);\n\n    for (let k = 0; k < mrc; k++) {\n      if (k < nct) {\n        s[k] = 0;\n        for (let i = k; i < m; i++) {\n          s[k] = hypotenuse(s[k], a.get(i, k));\n        }\n        if (s[k] !== 0) {\n          if (a.get(k, k) < 0) {\n            s[k] = -s[k];\n          }\n          for (let i = k; i < m; i++) {\n            a.set(i, k, a.get(i, k) / s[k]);\n          }\n          a.set(k, k, a.get(k, k) + 1);\n        }\n        s[k] = -s[k];\n      }\n\n      for (let j = k + 1; j < n; j++) {\n        if (k < nct && s[k] !== 0) {\n          let t = 0;\n          for (let i = k; i < m; i++) {\n            t += a.get(i, k) * a.get(i, j);\n          }\n          t = -t / a.get(k, k);\n          for (let i = k; i < m; i++) {\n            a.set(i, j, a.get(i, j) + t * a.get(i, k));\n          }\n        }\n        e[j] = a.get(k, j);\n      }\n\n      if (wantu && k < nct) {\n        for (let i = k; i < m; i++) {\n          U.set(i, k, a.get(i, k));\n        }\n      }\n\n      if (k < nrt) {\n        e[k] = 0;\n        for (let i = k + 1; i < n; i++) {\n          e[k] = hypotenuse(e[k], e[i]);\n        }\n        if (e[k] !== 0) {\n          if (e[k + 1] < 0) {\n            e[k] = 0 - e[k];\n          }\n          for (let i = k + 1; i < n; i++) {\n            e[i] /= e[k];\n          }\n          e[k + 1] += 1;\n        }\n        e[k] = -e[k];\n        if (k + 1 < m && e[k] !== 0) {\n          for (let i = k + 1; i < m; i++) {\n            work[i] = 0;\n          }\n          for (let i = k + 1; i < m; i++) {\n            for (let j = k + 1; j < n; j++) {\n              work[i] += e[j] * a.get(i, j);\n            }\n          }\n          for (let j = k + 1; j < n; j++) {\n            let t = -e[j] / e[k + 1];\n            for (let i = k + 1; i < m; i++) {\n              a.set(i, j, a.get(i, j) + t * work[i]);\n            }\n          }\n        }\n        if (wantv) {\n          for (let i = k + 1; i < n; i++) {\n            V.set(i, k, e[i]);\n          }\n        }\n      }\n    }\n\n    let p = Math.min(n, m + 1);\n    if (nct < n) {\n      s[nct] = a.get(nct, nct);\n    }\n    if (m < p) {\n      s[p - 1] = 0;\n    }\n    if (nrt + 1 < p) {\n      e[nrt] = a.get(nrt, p - 1);\n    }\n    e[p - 1] = 0;\n\n    if (wantu) {\n      for (let j = nct; j < nu; j++) {\n        for (let i = 0; i < m; i++) {\n          U.set(i, j, 0);\n        }\n        U.set(j, j, 1);\n      }\n      for (let k = nct - 1; k >= 0; k--) {\n        if (s[k] !== 0) {\n          for (let j = k + 1; j < nu; j++) {\n            let t = 0;\n            for (let i = k; i < m; i++) {\n              t += U.get(i, k) * U.get(i, j);\n            }\n            t = -t / U.get(k, k);\n            for (let i = k; i < m; i++) {\n              U.set(i, j, U.get(i, j) + t * U.get(i, k));\n            }\n          }\n          for (let i = k; i < m; i++) {\n            U.set(i, k, -U.get(i, k));\n          }\n          U.set(k, k, 1 + U.get(k, k));\n          for (let i = 0; i < k - 1; i++) {\n            U.set(i, k, 0);\n          }\n        } else {\n          for (let i = 0; i < m; i++) {\n            U.set(i, k, 0);\n          }\n          U.set(k, k, 1);\n        }\n      }\n    }\n\n    if (wantv) {\n      for (let k = n - 1; k >= 0; k--) {\n        if (k < nrt && e[k] !== 0) {\n          for (let j = k + 1; j < n; j++) {\n            let t = 0;\n            for (let i = k + 1; i < n; i++) {\n              t += V.get(i, k) * V.get(i, j);\n            }\n            t = -t / V.get(k + 1, k);\n            for (let i = k + 1; i < n; i++) {\n              V.set(i, j, V.get(i, j) + t * V.get(i, k));\n            }\n          }\n        }\n        for (let i = 0; i < n; i++) {\n          V.set(i, k, 0);\n        }\n        V.set(k, k, 1);\n      }\n    }\n\n    let pp = p - 1;\n    let iter = 0;\n    let eps = Number.EPSILON;\n    while (p > 0) {\n      let k, kase;\n      for (k = p - 2; k >= -1; k--) {\n        if (k === -1) {\n          break;\n        }\n        const alpha =\n          Number.MIN_VALUE + eps * Math.abs(s[k] + Math.abs(s[k + 1]));\n        if (Math.abs(e[k]) <= alpha || Number.isNaN(e[k])) {\n          e[k] = 0;\n          break;\n        }\n      }\n      if (k === p - 2) {\n        kase = 4;\n      } else {\n        let ks;\n        for (ks = p - 1; ks >= k; ks--) {\n          if (ks === k) {\n            break;\n          }\n          let t =\n            (ks !== p ? Math.abs(e[ks]) : 0) +\n            (ks !== k + 1 ? Math.abs(e[ks - 1]) : 0);\n          if (Math.abs(s[ks]) <= eps * t) {\n            s[ks] = 0;\n            break;\n          }\n        }\n        if (ks === k) {\n          kase = 3;\n        } else if (ks === p - 1) {\n          kase = 1;\n        } else {\n          kase = 2;\n          k = ks;\n        }\n      }\n\n      k++;\n\n      switch (kase) {\n        case 1: {\n          let f = e[p - 2];\n          e[p - 2] = 0;\n          for (let j = p - 2; j >= k; j--) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            if (j !== k) {\n              f = -sn * e[j - 1];\n              e[j - 1] = cs * e[j - 1];\n            }\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, p - 1);\n                V.set(i, p - 1, -sn * V.get(i, j) + cs * V.get(i, p - 1));\n                V.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 2: {\n          let f = e[k - 1];\n          e[k - 1] = 0;\n          for (let j = k; j < p; j++) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            f = -sn * e[j];\n            e[j] = cs * e[j];\n            if (wantu) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, k - 1);\n                U.set(i, k - 1, -sn * U.get(i, j) + cs * U.get(i, k - 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 3: {\n          const scale = Math.max(\n            Math.abs(s[p - 1]),\n            Math.abs(s[p - 2]),\n            Math.abs(e[p - 2]),\n            Math.abs(s[k]),\n            Math.abs(e[k]),\n          );\n          const sp = s[p - 1] / scale;\n          const spm1 = s[p - 2] / scale;\n          const epm1 = e[p - 2] / scale;\n          const sk = s[k] / scale;\n          const ek = e[k] / scale;\n          const b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2;\n          const c = sp * epm1 * (sp * epm1);\n          let shift = 0;\n          if (b !== 0 || c !== 0) {\n            if (b < 0) {\n              shift = 0 - Math.sqrt(b * b + c);\n            } else {\n              shift = Math.sqrt(b * b + c);\n            }\n            shift = c / (b + shift);\n          }\n          let f = (sk + sp) * (sk - sp) + shift;\n          let g = sk * ek;\n          for (let j = k; j < p - 1; j++) {\n            let t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            let cs = f / t;\n            let sn = g / t;\n            if (j !== k) {\n              e[j - 1] = t;\n            }\n            f = cs * s[j] + sn * e[j];\n            e[j] = cs * e[j] - sn * s[j];\n            g = sn * s[j + 1];\n            s[j + 1] = cs * s[j + 1];\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, j + 1);\n                V.set(i, j + 1, -sn * V.get(i, j) + cs * V.get(i, j + 1));\n                V.set(i, j, t);\n              }\n            }\n            t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            cs = f / t;\n            sn = g / t;\n            s[j] = t;\n            f = cs * e[j] + sn * s[j + 1];\n            s[j + 1] = -sn * e[j] + cs * s[j + 1];\n            g = sn * e[j + 1];\n            e[j + 1] = cs * e[j + 1];\n            if (wantu && j < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, j + 1);\n                U.set(i, j + 1, -sn * U.get(i, j) + cs * U.get(i, j + 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          e[p - 2] = f;\n          iter = iter + 1;\n          break;\n        }\n        case 4: {\n          if (s[k] <= 0) {\n            s[k] = s[k] < 0 ? -s[k] : 0;\n            if (wantv) {\n              for (let i = 0; i <= pp; i++) {\n                V.set(i, k, -V.get(i, k));\n              }\n            }\n          }\n          while (k < pp) {\n            if (s[k] >= s[k + 1]) {\n              break;\n            }\n            let t = s[k];\n            s[k] = s[k + 1];\n            s[k + 1] = t;\n            if (wantv && k < n - 1) {\n              for (let i = 0; i < n; i++) {\n                t = V.get(i, k + 1);\n                V.set(i, k + 1, V.get(i, k));\n                V.set(i, k, t);\n              }\n            }\n            if (wantu && k < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = U.get(i, k + 1);\n                U.set(i, k + 1, U.get(i, k));\n                U.set(i, k, t);\n              }\n            }\n            k++;\n          }\n          iter = 0;\n          p--;\n          break;\n        }\n        // no default\n      }\n    }\n\n    if (swapped) {\n      let tmp = V;\n      V = U;\n      U = tmp;\n    }\n\n    this.m = m;\n    this.n = n;\n    this.s = s;\n    this.U = U;\n    this.V = V;\n  }\n\n  solve(value) {\n    let Y = value;\n    let e = this.threshold;\n    let scols = this.s.length;\n    let Ls = Matrix.zeros(scols, scols);\n\n    for (let i = 0; i < scols; i++) {\n      if (Math.abs(this.s[i]) <= e) {\n        Ls.set(i, i, 0);\n      } else {\n        Ls.set(i, i, 1 / this.s[i]);\n      }\n    }\n\n    let U = this.U;\n    let V = this.rightSingularVectors;\n\n    let VL = V.mmul(Ls);\n    let vrows = V.rows;\n    let urows = U.rows;\n    let VLU = Matrix.zeros(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < scols; k++) {\n          sum += VL.get(i, k) * U.get(j, k);\n        }\n        VLU.set(i, j, sum);\n      }\n    }\n\n    return VLU.mmul(Y);\n  }\n\n  solveForDiagonal(value) {\n    return this.solve(Matrix.diag(value));\n  }\n\n  inverse() {\n    let V = this.V;\n    let e = this.threshold;\n    let vrows = V.rows;\n    let vcols = V.columns;\n    let X = new Matrix(vrows, this.s.length);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < vcols; j++) {\n        if (Math.abs(this.s[j]) > e) {\n          X.set(i, j, V.get(i, j) / this.s[j]);\n        }\n      }\n    }\n\n    let U = this.U;\n\n    let urows = U.rows;\n    let ucols = U.columns;\n    let Y = new Matrix(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < ucols; k++) {\n          sum += X.get(i, k) * U.get(j, k);\n        }\n        Y.set(i, j, sum);\n      }\n    }\n\n    return Y;\n  }\n\n  get condition() {\n    return this.s[0] / this.s[Math.min(this.m, this.n) - 1];\n  }\n\n  get norm2() {\n    return this.s[0];\n  }\n\n  get rank() {\n    let tol = Math.max(this.m, this.n) * this.s[0] * Number.EPSILON;\n    let r = 0;\n    let s = this.s;\n    for (let i = 0, ii = s.length; i < ii; i++) {\n      if (s[i] > tol) {\n        r++;\n      }\n    }\n    return r;\n  }\n\n  get diagonal() {\n    return Array.from(this.s);\n  }\n\n  get threshold() {\n    return (Number.EPSILON / 2) * Math.max(this.m, this.n) * this.s[0];\n  }\n\n  get leftSingularVectors() {\n    return this.U;\n  }\n\n  get rightSingularVectors() {\n    return this.V;\n  }\n\n  get diagonalMatrix() {\n    return Matrix.diag(this.s);\n  }\n}\n","export function hypotenuse(a, b) {\n  let r = 0;\n  if (Math.abs(a) > Math.abs(b)) {\n    r = b / a;\n    return Math.abs(a) * Math.sqrt(1 + r * r);\n  }\n  if (b !== 0) {\n    r = a / b;\n    return Math.abs(b) * Math.sqrt(1 + r * r);\n  }\n  return 0;\n}\n","const indent = ' '.repeat(2);\nconst indentData = ' '.repeat(4);\n\nexport function inspectMatrix() {\n  return inspectMatrixWithOptions(this);\n}\n\nexport function inspectMatrixWithOptions(matrix, options = {}) {\n  const {\n    maxRows = 15,\n    maxColumns = 10,\n    maxNumSize = 8,\n    padMinus = 'auto',\n  } = options;\n  return `${matrix.constructor.name} {\n${indent}[\n${indentData}${inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus)}\n${indent}]\n${indent}rows: ${matrix.rows}\n${indent}columns: ${matrix.columns}\n}`;\n}\n\nfunction inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus) {\n  const { rows, columns } = matrix;\n  const maxI = Math.min(rows, maxRows);\n  const maxJ = Math.min(columns, maxColumns);\n  const result = [];\n\n  if (padMinus === 'auto') {\n    padMinus = false;\n    loop: for (let i = 0; i < maxI; i++) {\n      for (let j = 0; j < maxJ; j++) {\n        if (matrix.get(i, j) < 0) {\n          padMinus = true;\n          break loop;\n        }\n      }\n    }\n  }\n\n  for (let i = 0; i < maxI; i++) {\n    let line = [];\n    for (let j = 0; j < maxJ; j++) {\n      line.push(formatNumber(matrix.get(i, j), maxNumSize, padMinus));\n    }\n    result.push(`${line.join(' ')}`);\n  }\n  if (maxJ !== columns) {\n    result[result.length - 1] += ` ... ${columns - maxColumns} more columns`;\n  }\n  if (maxI !== rows) {\n    result.push(`... ${rows - maxRows} more rows`);\n  }\n  return result.join(`\\n${indentData}`);\n}\n\nfunction formatNumber(num, maxNumSize, padMinus) {\n  return (\n    num >= 0 && padMinus\n      ? ` ${formatNumber2(num, maxNumSize - 1)}`\n      : formatNumber2(num, maxNumSize)\n  ).padEnd(maxNumSize);\n}\n\nfunction formatNumber2(num, len) {\n  // small.length numbers should be as is\n  let str = num.toString();\n  if (str.length <= len) return str;\n\n  // (7)'0.00123' is better then (7)'1.23e-2'\n  // (8)'0.000123' is worse then (7)'1.23e-3',\n  let fix = num.toFixed(len);\n  if (fix.length > len) {\n    fix = num.toFixed(Math.max(0, len - (fix.length - len)));\n  }\n  if (\n    fix.length <= len &&\n    !fix.startsWith('0.000') &&\n    !fix.startsWith('-0.000')\n  ) {\n    return fix;\n  }\n\n  // well, if it's still too long the user should've used longer numbers\n  let exp = num.toExponential(len);\n  if (exp.length > len) {\n    exp = num.toExponential(Math.max(0, len - (exp.length - len)));\n  }\n  return exp.slice(0);\n}\n","export function installMathOperations(AbstractMatrix, Matrix) {\n  AbstractMatrix.prototype.add = function add(value) {\n    if (typeof value === 'number') return this.addS(value);\n    return this.addM(value);\n  };\n\n  AbstractMatrix.prototype.addS = function addS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.addM = function addM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.add = function add(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.add(value);\n  };\n\n  AbstractMatrix.prototype.sub = function sub(value) {\n    if (typeof value === 'number') return this.subS(value);\n    return this.subM(value);\n  };\n\n  AbstractMatrix.prototype.subS = function subS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.subM = function subM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sub = function sub(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sub(value);\n  };\n  AbstractMatrix.prototype.subtract = AbstractMatrix.prototype.sub;\n  AbstractMatrix.prototype.subtractS = AbstractMatrix.prototype.subS;\n  AbstractMatrix.prototype.subtractM = AbstractMatrix.prototype.subM;\n  AbstractMatrix.subtract = AbstractMatrix.sub;\n\n  AbstractMatrix.prototype.mul = function mul(value) {\n    if (typeof value === 'number') return this.mulS(value);\n    return this.mulM(value);\n  };\n\n  AbstractMatrix.prototype.mulS = function mulS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.mulM = function mulM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mul = function mul(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mul(value);\n  };\n  AbstractMatrix.prototype.multiply = AbstractMatrix.prototype.mul;\n  AbstractMatrix.prototype.multiplyS = AbstractMatrix.prototype.mulS;\n  AbstractMatrix.prototype.multiplyM = AbstractMatrix.prototype.mulM;\n  AbstractMatrix.multiply = AbstractMatrix.mul;\n\n  AbstractMatrix.prototype.div = function div(value) {\n    if (typeof value === 'number') return this.divS(value);\n    return this.divM(value);\n  };\n\n  AbstractMatrix.prototype.divS = function divS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.divM = function divM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.div = function div(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.div(value);\n  };\n  AbstractMatrix.prototype.divide = AbstractMatrix.prototype.div;\n  AbstractMatrix.prototype.divideS = AbstractMatrix.prototype.divS;\n  AbstractMatrix.prototype.divideM = AbstractMatrix.prototype.divM;\n  AbstractMatrix.divide = AbstractMatrix.div;\n\n  AbstractMatrix.prototype.mod = function mod(value) {\n    if (typeof value === 'number') return this.modS(value);\n    return this.modM(value);\n  };\n\n  AbstractMatrix.prototype.modS = function modS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.modM = function modM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mod = function mod(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mod(value);\n  };\n  AbstractMatrix.prototype.modulus = AbstractMatrix.prototype.mod;\n  AbstractMatrix.prototype.modulusS = AbstractMatrix.prototype.modS;\n  AbstractMatrix.prototype.modulusM = AbstractMatrix.prototype.modM;\n  AbstractMatrix.modulus = AbstractMatrix.mod;\n\n  AbstractMatrix.prototype.and = function and(value) {\n    if (typeof value === 'number') return this.andS(value);\n    return this.andM(value);\n  };\n\n  AbstractMatrix.prototype.andS = function andS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.andM = function andM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.and = function and(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.and(value);\n  };\n\n  AbstractMatrix.prototype.or = function or(value) {\n    if (typeof value === 'number') return this.orS(value);\n    return this.orM(value);\n  };\n\n  AbstractMatrix.prototype.orS = function orS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.orM = function orM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.or = function or(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.or(value);\n  };\n\n  AbstractMatrix.prototype.xor = function xor(value) {\n    if (typeof value === 'number') return this.xorS(value);\n    return this.xorM(value);\n  };\n\n  AbstractMatrix.prototype.xorS = function xorS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.xorM = function xorM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.xor = function xor(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.xor(value);\n  };\n\n  AbstractMatrix.prototype.leftShift = function leftShift(value) {\n    if (typeof value === 'number') return this.leftShiftS(value);\n    return this.leftShiftM(value);\n  };\n\n  AbstractMatrix.prototype.leftShiftS = function leftShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.leftShiftM = function leftShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.leftShift = function leftShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.leftShift(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShift = function signPropagatingRightShift(value) {\n    if (typeof value === 'number') return this.signPropagatingRightShiftS(value);\n    return this.signPropagatingRightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftS = function signPropagatingRightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftM = function signPropagatingRightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.signPropagatingRightShift = function signPropagatingRightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.signPropagatingRightShift(value);\n  };\n\n  AbstractMatrix.prototype.rightShift = function rightShift(value) {\n    if (typeof value === 'number') return this.rightShiftS(value);\n    return this.rightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.rightShiftS = function rightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.rightShiftM = function rightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.rightShift = function rightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.rightShift(value);\n  };\n  AbstractMatrix.prototype.zeroFillRightShift = AbstractMatrix.prototype.rightShift;\n  AbstractMatrix.prototype.zeroFillRightShiftS = AbstractMatrix.prototype.rightShiftS;\n  AbstractMatrix.prototype.zeroFillRightShiftM = AbstractMatrix.prototype.rightShiftM;\n  AbstractMatrix.zeroFillRightShift = AbstractMatrix.rightShift;\n\n  AbstractMatrix.prototype.not = function not() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, ~(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.not = function not(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.not();\n  };\n\n  AbstractMatrix.prototype.abs = function abs() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.abs(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.abs = function abs(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.abs();\n  };\n\n  AbstractMatrix.prototype.acos = function acos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acos = function acos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acos();\n  };\n\n  AbstractMatrix.prototype.acosh = function acosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acosh = function acosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acosh();\n  };\n\n  AbstractMatrix.prototype.asin = function asin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asin = function asin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asin();\n  };\n\n  AbstractMatrix.prototype.asinh = function asinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asinh = function asinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asinh();\n  };\n\n  AbstractMatrix.prototype.atan = function atan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atan = function atan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atan();\n  };\n\n  AbstractMatrix.prototype.atanh = function atanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atanh = function atanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atanh();\n  };\n\n  AbstractMatrix.prototype.cbrt = function cbrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cbrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cbrt = function cbrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cbrt();\n  };\n\n  AbstractMatrix.prototype.ceil = function ceil() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.ceil(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.ceil = function ceil(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.ceil();\n  };\n\n  AbstractMatrix.prototype.clz32 = function clz32() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.clz32(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.clz32 = function clz32(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.clz32();\n  };\n\n  AbstractMatrix.prototype.cos = function cos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cos = function cos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cos();\n  };\n\n  AbstractMatrix.prototype.cosh = function cosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cosh = function cosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cosh();\n  };\n\n  AbstractMatrix.prototype.exp = function exp() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.exp(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.exp = function exp(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.exp();\n  };\n\n  AbstractMatrix.prototype.expm1 = function expm1() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.expm1(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.expm1 = function expm1(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.expm1();\n  };\n\n  AbstractMatrix.prototype.floor = function floor() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.floor(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.floor = function floor(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.floor();\n  };\n\n  AbstractMatrix.prototype.fround = function fround() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.fround(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.fround = function fround(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.fround();\n  };\n\n  AbstractMatrix.prototype.log = function log() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log = function log(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log();\n  };\n\n  AbstractMatrix.prototype.log1p = function log1p() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log1p(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log1p = function log1p(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log1p();\n  };\n\n  AbstractMatrix.prototype.log10 = function log10() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log10(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log10 = function log10(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log10();\n  };\n\n  AbstractMatrix.prototype.log2 = function log2() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log2(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log2 = function log2(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log2();\n  };\n\n  AbstractMatrix.prototype.round = function round() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.round(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.round = function round(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.round();\n  };\n\n  AbstractMatrix.prototype.sign = function sign() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sign(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sign = function sign(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sign();\n  };\n\n  AbstractMatrix.prototype.sin = function sin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sin = function sin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sin();\n  };\n\n  AbstractMatrix.prototype.sinh = function sinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sinh = function sinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sinh();\n  };\n\n  AbstractMatrix.prototype.sqrt = function sqrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sqrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sqrt = function sqrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sqrt();\n  };\n\n  AbstractMatrix.prototype.tan = function tan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tan = function tan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tan();\n  };\n\n  AbstractMatrix.prototype.tanh = function tanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tanh = function tanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tanh();\n  };\n\n  AbstractMatrix.prototype.trunc = function trunc() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.trunc(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.trunc = function trunc(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.trunc();\n  };\n\n  AbstractMatrix.pow = function pow(matrix, arg0) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.pow(arg0);\n  };\n\n  AbstractMatrix.prototype.pow = function pow(value) {\n    if (typeof value === 'number') return this.powS(value);\n    return this.powM(value);\n  };\n\n  AbstractMatrix.prototype.powS = function powS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.pow(this.get(i, j), value));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.powM = function powM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.pow(this.get(i, j), matrix.get(i, j)));\n      }\n    }\n    return this;\n  };\n}\n","import { isAnyArray } from 'is-any-array';\nimport rescale from 'ml-array-rescale';\n\nimport { inspectMatrix, inspectMatrixWithOptions } from './inspect';\nimport { installMathOperations } from './mathOperations';\nimport {\n  sumByRow,\n  sumByColumn,\n  sumAll,\n  productByRow,\n  productByColumn,\n  productAll,\n  varianceByRow,\n  varianceByColumn,\n  varianceAll,\n  centerByRow,\n  centerByColumn,\n  centerAll,\n  scaleByRow,\n  scaleByColumn,\n  scaleAll,\n  getScaleByRow,\n  getScaleByColumn,\n  getScaleAll,\n} from './stat';\nimport {\n  checkRowVector,\n  checkRowIndex,\n  checkColumnIndex,\n  checkColumnVector,\n  checkRange,\n  checkNonEmpty,\n  checkRowIndices,\n  checkColumnIndices,\n} from './util';\n\nexport class AbstractMatrix {\n  static from1DArray(newRows, newColumns, newData) {\n    let length = newRows * newColumns;\n    if (length !== newData.length) {\n      throw new RangeError('data length does not match given dimensions');\n    }\n    let newMatrix = new Matrix(newRows, newColumns);\n    for (let row = 0; row < newRows; row++) {\n      for (let column = 0; column < newColumns; column++) {\n        newMatrix.set(row, column, newData[row * newColumns + column]);\n      }\n    }\n    return newMatrix;\n  }\n\n  static rowVector(newData) {\n    let vector = new Matrix(1, newData.length);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(0, i, newData[i]);\n    }\n    return vector;\n  }\n\n  static columnVector(newData) {\n    let vector = new Matrix(newData.length, 1);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(i, 0, newData[i]);\n    }\n    return vector;\n  }\n\n  static zeros(rows, columns) {\n    return new Matrix(rows, columns);\n  }\n\n  static ones(rows, columns) {\n    return new Matrix(rows, columns).fill(1);\n  }\n\n  static rand(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { random = Math.random } = options;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.set(i, j, random());\n      }\n    }\n    return matrix;\n  }\n\n  static randInt(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1000, random = Math.random } = options;\n    if (!Number.isInteger(min)) throw new TypeError('min must be an integer');\n    if (!Number.isInteger(max)) throw new TypeError('max must be an integer');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let interval = max - min;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        let value = min + Math.round(random() * interval);\n        matrix.set(i, j, value);\n      }\n    }\n    return matrix;\n  }\n\n  static eye(rows, columns, value) {\n    if (columns === undefined) columns = rows;\n    if (value === undefined) value = 1;\n    let min = Math.min(rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, value);\n    }\n    return matrix;\n  }\n\n  static diag(data, rows, columns) {\n    let l = data.length;\n    if (rows === undefined) rows = l;\n    if (columns === undefined) columns = rows;\n    let min = Math.min(l, rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, data[i]);\n    }\n    return matrix;\n  }\n\n  static min(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.min(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static max(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new this(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.max(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static checkMatrix(value) {\n    return AbstractMatrix.isMatrix(value) ? value : new Matrix(value);\n  }\n\n  static isMatrix(value) {\n    return value != null && value.klass === 'Matrix';\n  }\n\n  get size() {\n    return this.rows * this.columns;\n  }\n\n  apply(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('callback must be a function');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        callback.call(this, i, j);\n      }\n    }\n    return this;\n  }\n\n  to1DArray() {\n    let array = [];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        array.push(this.get(i, j));\n      }\n    }\n    return array;\n  }\n\n  to2DArray() {\n    let copy = [];\n    for (let i = 0; i < this.rows; i++) {\n      copy.push([]);\n      for (let j = 0; j < this.columns; j++) {\n        copy[i].push(this.get(i, j));\n      }\n    }\n    return copy;\n  }\n\n  toJSON() {\n    return this.to2DArray();\n  }\n\n  isRowVector() {\n    return this.rows === 1;\n  }\n\n  isColumnVector() {\n    return this.columns === 1;\n  }\n\n  isVector() {\n    return this.rows === 1 || this.columns === 1;\n  }\n\n  isSquare() {\n    return this.rows === this.columns;\n  }\n\n  isEmpty() {\n    return this.rows === 0 || this.columns === 0;\n  }\n\n  isSymmetric() {\n    if (this.isSquare()) {\n      for (let i = 0; i < this.rows; i++) {\n        for (let j = 0; j <= i; j++) {\n          if (this.get(i, j) !== this.get(j, i)) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n    return false;\n  }\n\n  isEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isEchelonForm = false;\n          checked = true;\n        }\n      }\n      i++;\n    }\n    return isEchelonForm;\n  }\n\n  isReducedEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isReducedEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isReducedEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isReducedEchelonForm = false;\n          checked = true;\n        }\n      }\n      for (let k = j + 1; k < this.rows; k++) {\n        if (this.get(i, k) !== 0) {\n          isReducedEchelonForm = false;\n        }\n      }\n      i++;\n    }\n    return isReducedEchelonForm;\n  }\n\n  echelonForm() {\n    let result = this.clone();\n    let h = 0;\n    let k = 0;\n    while (h < result.rows && k < result.columns) {\n      let iMax = h;\n      for (let i = h; i < result.rows; i++) {\n        if (result.get(i, k) > result.get(iMax, k)) {\n          iMax = i;\n        }\n      }\n      if (result.get(iMax, k) === 0) {\n        k++;\n      } else {\n        result.swapRows(h, iMax);\n        let tmp = result.get(h, k);\n        for (let j = k; j < result.columns; j++) {\n          result.set(h, j, result.get(h, j) / tmp);\n        }\n        for (let i = h + 1; i < result.rows; i++) {\n          let factor = result.get(i, k) / result.get(h, k);\n          result.set(i, k, 0);\n          for (let j = k + 1; j < result.columns; j++) {\n            result.set(i, j, result.get(i, j) - result.get(h, j) * factor);\n          }\n        }\n        h++;\n        k++;\n      }\n    }\n    return result;\n  }\n\n  reducedEchelonForm() {\n    let result = this.echelonForm();\n    let m = result.columns;\n    let n = result.rows;\n    let h = n - 1;\n    while (h >= 0) {\n      if (result.maxRow(h) === 0) {\n        h--;\n      } else {\n        let p = 0;\n        let pivot = false;\n        while (p < n && pivot === false) {\n          if (result.get(h, p) === 1) {\n            pivot = true;\n          } else {\n            p++;\n          }\n        }\n        for (let i = 0; i < h; i++) {\n          let factor = result.get(i, p);\n          for (let j = p; j < m; j++) {\n            let tmp = result.get(i, j) - factor * result.get(h, j);\n            result.set(i, j, tmp);\n          }\n        }\n        h--;\n      }\n    }\n    return result;\n  }\n\n  set() {\n    throw new Error('set method is unimplemented');\n  }\n\n  get() {\n    throw new Error('get method is unimplemented');\n  }\n\n  repeat(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { rows = 1, columns = 1 } = options;\n    if (!Number.isInteger(rows) || rows <= 0) {\n      throw new TypeError('rows must be a positive integer');\n    }\n    if (!Number.isInteger(columns) || columns <= 0) {\n      throw new TypeError('columns must be a positive integer');\n    }\n    let matrix = new Matrix(this.rows * rows, this.columns * columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.setSubMatrix(this, this.rows * i, this.columns * j);\n      }\n    }\n    return matrix;\n  }\n\n  fill(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, value);\n      }\n    }\n    return this;\n  }\n\n  neg() {\n    return this.mulS(-1);\n  }\n\n  getRow(index) {\n    checkRowIndex(this, index);\n    let row = [];\n    for (let i = 0; i < this.columns; i++) {\n      row.push(this.get(index, i));\n    }\n    return row;\n  }\n\n  getRowVector(index) {\n    return Matrix.rowVector(this.getRow(index));\n  }\n\n  setRow(index, array) {\n    checkRowIndex(this, index);\n    array = checkRowVector(this, array);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, array[i]);\n    }\n    return this;\n  }\n\n  swapRows(row1, row2) {\n    checkRowIndex(this, row1);\n    checkRowIndex(this, row2);\n    for (let i = 0; i < this.columns; i++) {\n      let temp = this.get(row1, i);\n      this.set(row1, i, this.get(row2, i));\n      this.set(row2, i, temp);\n    }\n    return this;\n  }\n\n  getColumn(index) {\n    checkColumnIndex(this, index);\n    let column = [];\n    for (let i = 0; i < this.rows; i++) {\n      column.push(this.get(i, index));\n    }\n    return column;\n  }\n\n  getColumnVector(index) {\n    return Matrix.columnVector(this.getColumn(index));\n  }\n\n  setColumn(index, array) {\n    checkColumnIndex(this, index);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, array[i]);\n    }\n    return this;\n  }\n\n  swapColumns(column1, column2) {\n    checkColumnIndex(this, column1);\n    checkColumnIndex(this, column2);\n    for (let i = 0; i < this.rows; i++) {\n      let temp = this.get(i, column1);\n      this.set(i, column1, this.get(i, column2));\n      this.set(i, column2, temp);\n    }\n    return this;\n  }\n\n  addRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[j]);\n      }\n    }\n    return this;\n  }\n\n  subRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[j]);\n      }\n    }\n    return this;\n  }\n\n  mulRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[j]);\n      }\n    }\n    return this;\n  }\n\n  divRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[j]);\n      }\n    }\n    return this;\n  }\n\n  addColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[i]);\n      }\n    }\n    return this;\n  }\n\n  subColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[i]);\n      }\n    }\n    return this;\n  }\n\n  divColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulRow(index, value) {\n    checkRowIndex(this, index);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, this.get(index, i) * value);\n    }\n    return this;\n  }\n\n  mulColumn(index, value) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, this.get(i, index) * value);\n    }\n    return this;\n  }\n\n  max(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    switch (by) {\n      case 'row': {\n        const max = new Array(this.rows).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[row]) {\n              max[row] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case 'column': {\n        const max = new Array(this.columns).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[column]) {\n              max[column] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case undefined: {\n        let max = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max) {\n              max = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  maxIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) > v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  min(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n\n    switch (by) {\n      case 'row': {\n        const min = new Array(this.rows).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[row]) {\n              min[row] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case 'column': {\n        const min = new Array(this.columns).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[column]) {\n              min[column] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case undefined: {\n        let min = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min) {\n              min = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  minIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) < v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  maxRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  maxRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  minRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  minRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  maxColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  maxColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  minColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  minColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  diag() {\n    let min = Math.min(this.rows, this.columns);\n    let diag = [];\n    for (let i = 0; i < min; i++) {\n      diag.push(this.get(i, i));\n    }\n    return diag;\n  }\n\n  norm(type = 'frobenius') {\n    let result = 0;\n    if (type === 'max') {\n      return this.max();\n    } else if (type === 'frobenius') {\n      for (let i = 0; i < this.rows; i++) {\n        for (let j = 0; j < this.columns; j++) {\n          result = result + this.get(i, j) * this.get(i, j);\n        }\n      }\n      return Math.sqrt(result);\n    } else {\n      throw new RangeError(`unknown norm type: ${type}`);\n    }\n  }\n\n  cumulativeSum() {\n    let sum = 0;\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        sum += this.get(i, j);\n        this.set(i, j, sum);\n      }\n    }\n    return this;\n  }\n\n  dot(vector2) {\n    if (AbstractMatrix.isMatrix(vector2)) vector2 = vector2.to1DArray();\n    let vector1 = this.to1DArray();\n    if (vector1.length !== vector2.length) {\n      throw new RangeError('vectors do not have the same size');\n    }\n    let dot = 0;\n    for (let i = 0; i < vector1.length; i++) {\n      dot += vector1[i] * vector2[i];\n    }\n    return dot;\n  }\n\n  mmul(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.columns;\n\n    let result = new Matrix(m, p);\n\n    let Bcolj = new Float64Array(n);\n    for (let j = 0; j < p; j++) {\n      for (let k = 0; k < n; k++) {\n        Bcolj[k] = other.get(k, j);\n      }\n\n      for (let i = 0; i < m; i++) {\n        let s = 0;\n        for (let k = 0; k < n; k++) {\n          s += this.get(i, k) * Bcolj[k];\n        }\n\n        result.set(i, j, s);\n      }\n    }\n    return result;\n  }\n\n  strassen2x2(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(2, 2);\n    const a11 = this.get(0, 0);\n    const b11 = other.get(0, 0);\n    const a12 = this.get(0, 1);\n    const b12 = other.get(0, 1);\n    const a21 = this.get(1, 0);\n    const b21 = other.get(1, 0);\n    const a22 = this.get(1, 1);\n    const b22 = other.get(1, 1);\n\n    // Compute intermediate values.\n    const m1 = (a11 + a22) * (b11 + b22);\n    const m2 = (a21 + a22) * b11;\n    const m3 = a11 * (b12 - b22);\n    const m4 = a22 * (b21 - b11);\n    const m5 = (a11 + a12) * b22;\n    const m6 = (a21 - a11) * (b11 + b12);\n    const m7 = (a12 - a22) * (b21 + b22);\n\n    // Combine intermediate values into the output.\n    const c00 = m1 + m4 - m5 + m7;\n    const c01 = m3 + m5;\n    const c10 = m2 + m4;\n    const c11 = m1 - m2 + m3 + m6;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    return result;\n  }\n\n  strassen3x3(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(3, 3);\n\n    const a00 = this.get(0, 0);\n    const a01 = this.get(0, 1);\n    const a02 = this.get(0, 2);\n    const a10 = this.get(1, 0);\n    const a11 = this.get(1, 1);\n    const a12 = this.get(1, 2);\n    const a20 = this.get(2, 0);\n    const a21 = this.get(2, 1);\n    const a22 = this.get(2, 2);\n\n    const b00 = other.get(0, 0);\n    const b01 = other.get(0, 1);\n    const b02 = other.get(0, 2);\n    const b10 = other.get(1, 0);\n    const b11 = other.get(1, 1);\n    const b12 = other.get(1, 2);\n    const b20 = other.get(2, 0);\n    const b21 = other.get(2, 1);\n    const b22 = other.get(2, 2);\n\n    const m1 = (a00 + a01 + a02 - a10 - a11 - a21 - a22) * b11;\n    const m2 = (a00 - a10) * (-b01 + b11);\n    const m3 = a11 * (-b00 + b01 + b10 - b11 - b12 - b20 + b22);\n    const m4 = (-a00 + a10 + a11) * (b00 - b01 + b11);\n    const m5 = (a10 + a11) * (-b00 + b01);\n    const m6 = a00 * b00;\n    const m7 = (-a00 + a20 + a21) * (b00 - b02 + b12);\n    const m8 = (-a00 + a20) * (b02 - b12);\n    const m9 = (a20 + a21) * (-b00 + b02);\n    const m10 = (a00 + a01 + a02 - a11 - a12 - a20 - a21) * b12;\n    const m11 = a21 * (-b00 + b02 + b10 - b11 - b12 - b20 + b21);\n    const m12 = (-a02 + a21 + a22) * (b11 + b20 - b21);\n    const m13 = (a02 - a22) * (b11 - b21);\n    const m14 = a02 * b20;\n    const m15 = (a21 + a22) * (-b20 + b21);\n    const m16 = (-a02 + a11 + a12) * (b12 + b20 - b22);\n    const m17 = (a02 - a12) * (b12 - b22);\n    const m18 = (a11 + a12) * (-b20 + b22);\n    const m19 = a01 * b10;\n    const m20 = a12 * b21;\n    const m21 = a10 * b02;\n    const m22 = a20 * b01;\n    const m23 = a22 * b22;\n\n    const c00 = m6 + m14 + m19;\n    const c01 = m1 + m4 + m5 + m6 + m12 + m14 + m15;\n    const c02 = m6 + m7 + m9 + m10 + m14 + m16 + m18;\n    const c10 = m2 + m3 + m4 + m6 + m14 + m16 + m17;\n    const c11 = m2 + m4 + m5 + m6 + m20;\n    const c12 = m14 + m16 + m17 + m18 + m21;\n    const c20 = m6 + m7 + m8 + m11 + m12 + m13 + m14;\n    const c21 = m12 + m13 + m14 + m15 + m22;\n    const c22 = m6 + m7 + m8 + m9 + m23;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(0, 2, c02);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    result.set(1, 2, c12);\n    result.set(2, 0, c20);\n    result.set(2, 1, c21);\n    result.set(2, 2, c22);\n    return result;\n  }\n\n  mmulStrassen(y) {\n    y = Matrix.checkMatrix(y);\n    let x = this.clone();\n    let r1 = x.rows;\n    let c1 = x.columns;\n    let r2 = y.rows;\n    let c2 = y.columns;\n    if (c1 !== r2) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        `Multiplying ${r1} x ${c1} and ${r2} x ${c2} matrix: dimensions do not match.`,\n      );\n    }\n\n    // Put a matrix into the top left of a matrix of zeros.\n    // `rows` and `cols` are the dimensions of the output matrix.\n    function embed(mat, rows, cols) {\n      let r = mat.rows;\n      let c = mat.columns;\n      if (r === rows && c === cols) {\n        return mat;\n      } else {\n        let resultat = AbstractMatrix.zeros(rows, cols);\n        resultat = resultat.setSubMatrix(mat, 0, 0);\n        return resultat;\n      }\n    }\n\n    // Make sure both matrices are the same size.\n    // This is exclusively for simplicity:\n    // this algorithm can be implemented with matrices of different sizes.\n\n    let r = Math.max(r1, r2);\n    let c = Math.max(c1, c2);\n    x = embed(x, r, c);\n    y = embed(y, r, c);\n\n    // Our recursive multiplication function.\n    function blockMult(a, b, rows, cols) {\n      // For small matrices, resort to naive multiplication.\n      if (rows <= 512 || cols <= 512) {\n        return a.mmul(b); // a is equivalent to this\n      }\n\n      // Apply dynamic padding.\n      if (rows % 2 === 1 && cols % 2 === 1) {\n        a = embed(a, rows + 1, cols + 1);\n        b = embed(b, rows + 1, cols + 1);\n      } else if (rows % 2 === 1) {\n        a = embed(a, rows + 1, cols);\n        b = embed(b, rows + 1, cols);\n      } else if (cols % 2 === 1) {\n        a = embed(a, rows, cols + 1);\n        b = embed(b, rows, cols + 1);\n      }\n\n      let halfRows = parseInt(a.rows / 2, 10);\n      let halfCols = parseInt(a.columns / 2, 10);\n      // Subdivide input matrices.\n      let a11 = a.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n      let b11 = b.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\n      let a12 = a.subMatrix(0, halfRows - 1, halfCols, a.columns - 1);\n      let b12 = b.subMatrix(0, halfRows - 1, halfCols, b.columns - 1);\n\n      let a21 = a.subMatrix(halfRows, a.rows - 1, 0, halfCols - 1);\n      let b21 = b.subMatrix(halfRows, b.rows - 1, 0, halfCols - 1);\n\n      let a22 = a.subMatrix(halfRows, a.rows - 1, halfCols, a.columns - 1);\n      let b22 = b.subMatrix(halfRows, b.rows - 1, halfCols, b.columns - 1);\n\n      // Compute intermediate values.\n      let m1 = blockMult(\n        AbstractMatrix.add(a11, a22),\n        AbstractMatrix.add(b11, b22),\n        halfRows,\n        halfCols,\n      );\n      let m2 = blockMult(AbstractMatrix.add(a21, a22), b11, halfRows, halfCols);\n      let m3 = blockMult(a11, AbstractMatrix.sub(b12, b22), halfRows, halfCols);\n      let m4 = blockMult(a22, AbstractMatrix.sub(b21, b11), halfRows, halfCols);\n      let m5 = blockMult(AbstractMatrix.add(a11, a12), b22, halfRows, halfCols);\n      let m6 = blockMult(\n        AbstractMatrix.sub(a21, a11),\n        AbstractMatrix.add(b11, b12),\n        halfRows,\n        halfCols,\n      );\n      let m7 = blockMult(\n        AbstractMatrix.sub(a12, a22),\n        AbstractMatrix.add(b21, b22),\n        halfRows,\n        halfCols,\n      );\n\n      // Combine intermediate values into the output.\n      let c11 = AbstractMatrix.add(m1, m4);\n      c11.sub(m5);\n      c11.add(m7);\n      let c12 = AbstractMatrix.add(m3, m5);\n      let c21 = AbstractMatrix.add(m2, m4);\n      let c22 = AbstractMatrix.sub(m1, m2);\n      c22.add(m3);\n      c22.add(m6);\n\n      // Crop output to the desired size (undo dynamic padding).\n      let resultat = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n      resultat = resultat.setSubMatrix(c11, 0, 0);\n      resultat = resultat.setSubMatrix(c12, c11.rows, 0);\n      resultat = resultat.setSubMatrix(c21, 0, c11.columns);\n      resultat = resultat.setSubMatrix(c22, c11.rows, c11.columns);\n      return resultat.subMatrix(0, rows - 1, 0, cols - 1);\n    }\n\n    return blockMult(x, y, r, c);\n  }\n\n  scaleRows(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.rows; i++) {\n      const row = this.getRow(i);\n      if (row.length > 0) {\n        rescale(row, { min, max, output: row });\n      }\n      newMatrix.setRow(i, row);\n    }\n    return newMatrix;\n  }\n\n  scaleColumns(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.columns; i++) {\n      const column = this.getColumn(i);\n      if (column.length) {\n        rescale(column, {\n          min: min,\n          max: max,\n          output: column,\n        });\n      }\n      newMatrix.setColumn(i, column);\n    }\n    return newMatrix;\n  }\n\n  flipRows() {\n    const middle = Math.ceil(this.columns / 2);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < middle; j++) {\n        let first = this.get(i, j);\n        let last = this.get(i, this.columns - 1 - j);\n        this.set(i, j, last);\n        this.set(i, this.columns - 1 - j, first);\n      }\n    }\n    return this;\n  }\n\n  flipColumns() {\n    const middle = Math.ceil(this.rows / 2);\n    for (let j = 0; j < this.columns; j++) {\n      for (let i = 0; i < middle; i++) {\n        let first = this.get(i, j);\n        let last = this.get(this.rows - 1 - i, j);\n        this.set(i, j, last);\n        this.set(this.rows - 1 - i, j, first);\n      }\n    }\n    return this;\n  }\n\n  kroneckerProduct(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.rows;\n    let q = other.columns;\n\n    let result = new Matrix(m * p, n * q);\n    for (let i = 0; i < m; i++) {\n      for (let j = 0; j < n; j++) {\n        for (let k = 0; k < p; k++) {\n          for (let l = 0; l < q; l++) {\n            result.set(p * i + k, q * j + l, this.get(i, j) * other.get(k, l));\n          }\n        }\n      }\n    }\n    return result;\n  }\n\n  kroneckerSum(other) {\n    other = Matrix.checkMatrix(other);\n    if (!this.isSquare() || !other.isSquare()) {\n      throw new Error('Kronecker Sum needs two Square Matrices');\n    }\n    let m = this.rows;\n    let n = other.rows;\n    let AxI = this.kroneckerProduct(Matrix.eye(n, n));\n    let IxB = Matrix.eye(m, m).kroneckerProduct(other);\n    return AxI.add(IxB);\n  }\n\n  transpose() {\n    let result = new Matrix(this.columns, this.rows);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        result.set(j, i, this.get(i, j));\n      }\n    }\n    return result;\n  }\n\n  sortRows(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.rows; i++) {\n      this.setRow(i, this.getRow(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  sortColumns(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.columns; i++) {\n      this.setColumn(i, this.getColumn(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  subMatrix(startRow, endRow, startColumn, endColumn) {\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    let newMatrix = new Matrix(\n      endRow - startRow + 1,\n      endColumn - startColumn + 1,\n    );\n    for (let i = startRow; i <= endRow; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        newMatrix.set(i - startRow, j - startColumn, this.get(i, j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixRow(indices, startColumn, endColumn) {\n    if (startColumn === undefined) startColumn = 0;\n    if (endColumn === undefined) endColumn = this.columns - 1;\n    if (\n      startColumn > endColumn ||\n      startColumn < 0 ||\n      startColumn >= this.columns ||\n      endColumn < 0 ||\n      endColumn >= this.columns\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(indices.length, endColumn - startColumn + 1);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        if (indices[i] < 0 || indices[i] >= this.rows) {\n          throw new RangeError(`Row index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(i, j - startColumn, this.get(indices[i], j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixColumn(indices, startRow, endRow) {\n    if (startRow === undefined) startRow = 0;\n    if (endRow === undefined) endRow = this.rows - 1;\n    if (\n      startRow > endRow ||\n      startRow < 0 ||\n      startRow >= this.rows ||\n      endRow < 0 ||\n      endRow >= this.rows\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(endRow - startRow + 1, indices.length);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startRow; j <= endRow; j++) {\n        if (indices[i] < 0 || indices[i] >= this.columns) {\n          throw new RangeError(`Column index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(j - startRow, i, this.get(j, indices[i]));\n      }\n    }\n    return newMatrix;\n  }\n\n  setSubMatrix(matrix, startRow, startColumn) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (matrix.isEmpty()) {\n      return this;\n    }\n    let endRow = startRow + matrix.rows - 1;\n    let endColumn = startColumn + matrix.columns - 1;\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    for (let i = 0; i < matrix.rows; i++) {\n      for (let j = 0; j < matrix.columns; j++) {\n        this.set(startRow + i, startColumn + j, matrix.get(i, j));\n      }\n    }\n    return this;\n  }\n\n  selection(rowIndices, columnIndices) {\n    checkRowIndices(this, rowIndices);\n    checkColumnIndices(this, columnIndices);\n    let newMatrix = new Matrix(rowIndices.length, columnIndices.length);\n    for (let i = 0; i < rowIndices.length; i++) {\n      let rowIndex = rowIndices[i];\n      for (let j = 0; j < columnIndices.length; j++) {\n        let columnIndex = columnIndices[j];\n        newMatrix.set(i, j, this.get(rowIndex, columnIndex));\n      }\n    }\n    return newMatrix;\n  }\n\n  trace() {\n    let min = Math.min(this.rows, this.columns);\n    let trace = 0;\n    for (let i = 0; i < min; i++) {\n      trace += this.get(i, i);\n    }\n    return trace;\n  }\n\n  clone() {\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let row = 0; row < this.rows; row++) {\n      for (let column = 0; column < this.columns; column++) {\n        newMatrix.set(row, column, this.get(row, column));\n      }\n    }\n    return newMatrix;\n  }\n\n  sum(by) {\n    switch (by) {\n      case 'row':\n        return sumByRow(this);\n      case 'column':\n        return sumByColumn(this);\n      case undefined:\n        return sumAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  product(by) {\n    switch (by) {\n      case 'row':\n        return productByRow(this);\n      case 'column':\n        return productByColumn(this);\n      case undefined:\n        return productAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  mean(by) {\n    const sum = this.sum(by);\n    switch (by) {\n      case 'row': {\n        for (let i = 0; i < this.rows; i++) {\n          sum[i] /= this.columns;\n        }\n        return sum;\n      }\n      case 'column': {\n        for (let i = 0; i < this.columns; i++) {\n          sum[i] /= this.rows;\n        }\n        return sum;\n      }\n      case undefined:\n        return sum / this.size;\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  variance(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { unbiased = true, mean = this.mean(by) } = options;\n    if (typeof unbiased !== 'boolean') {\n      throw new TypeError('unbiased must be a boolean');\n    }\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByRow(this, unbiased, mean);\n      }\n      case 'column': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByColumn(this, unbiased, mean);\n      }\n      case undefined: {\n        if (typeof mean !== 'number') {\n          throw new TypeError('mean must be a number');\n        }\n        return varianceAll(this, unbiased, mean);\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  standardDeviation(by, options) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    const variance = this.variance(by, options);\n    if (by === undefined) {\n      return Math.sqrt(variance);\n    } else {\n      for (let i = 0; i < variance.length; i++) {\n        variance[i] = Math.sqrt(variance[i]);\n      }\n      return variance;\n    }\n  }\n\n  center(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { center = this.mean(by) } = options;\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByRow(this, center);\n        return this;\n      }\n      case 'column': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByColumn(this, center);\n        return this;\n      }\n      case undefined: {\n        if (typeof center !== 'number') {\n          throw new TypeError('center must be a number');\n        }\n        centerAll(this, center);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  scale(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    let scale = options.scale;\n    switch (by) {\n      case 'row': {\n        if (scale === undefined) {\n          scale = getScaleByRow(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByRow(this, scale);\n        return this;\n      }\n      case 'column': {\n        if (scale === undefined) {\n          scale = getScaleByColumn(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByColumn(this, scale);\n        return this;\n      }\n      case undefined: {\n        if (scale === undefined) {\n          scale = getScaleAll(this);\n        } else if (typeof scale !== 'number') {\n          throw new TypeError('scale must be a number');\n        }\n        scaleAll(this, scale);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  toString(options) {\n    return inspectMatrixWithOptions(this, options);\n  }\n}\n\nAbstractMatrix.prototype.klass = 'Matrix';\nif (typeof Symbol !== 'undefined') {\n  AbstractMatrix.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n    inspectMatrix;\n}\n\nfunction compareNumbers(a, b) {\n  return a - b;\n}\n\nfunction isArrayOfNumbers(array) {\n  return array.every((element) => {\n    return typeof element === 'number';\n  });\n}\n\n// Synonyms\nAbstractMatrix.random = AbstractMatrix.rand;\nAbstractMatrix.randomInt = AbstractMatrix.randInt;\nAbstractMatrix.diagonal = AbstractMatrix.diag;\nAbstractMatrix.prototype.diagonal = AbstractMatrix.prototype.diag;\nAbstractMatrix.identity = AbstractMatrix.eye;\nAbstractMatrix.prototype.negate = AbstractMatrix.prototype.neg;\nAbstractMatrix.prototype.tensorProduct =\n  AbstractMatrix.prototype.kroneckerProduct;\n\nexport default class Matrix extends AbstractMatrix {\n  constructor(nRows, nColumns) {\n    super();\n    if (Matrix.isMatrix(nRows)) {\n      // eslint-disable-next-line no-constructor-return\n      return nRows.clone();\n    } else if (Number.isInteger(nRows) && nRows >= 0) {\n      // Create an empty matrix\n      this.data = [];\n      if (Number.isInteger(nColumns) && nColumns >= 0) {\n        for (let i = 0; i < nRows; i++) {\n          this.data.push(new Float64Array(nColumns));\n        }\n      } else {\n        throw new TypeError('nColumns must be a positive integer');\n      }\n    } else if (isAnyArray(nRows)) {\n      // Copy the values from the 2D array\n      const arrayData = nRows;\n      nRows = arrayData.length;\n      nColumns = nRows ? arrayData[0].length : 0;\n      if (typeof nColumns !== 'number') {\n        throw new TypeError(\n          'Data must be a 2D array with at least one element',\n        );\n      }\n      this.data = [];\n      for (let i = 0; i < nRows; i++) {\n        if (arrayData[i].length !== nColumns) {\n          throw new RangeError('Inconsistent array dimensions');\n        }\n        if (!isArrayOfNumbers(arrayData[i])) {\n          throw new TypeError('Input data contains non-numeric values');\n        }\n        this.data.push(Float64Array.from(arrayData[i]));\n      }\n    } else {\n      throw new TypeError(\n        'First argument must be a positive number or an array',\n      );\n    }\n    this.rows = nRows;\n    this.columns = nColumns;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n\n  removeRow(index) {\n    checkRowIndex(this, index);\n    this.data.splice(index, 1);\n    this.rows -= 1;\n    return this;\n  }\n\n  addRow(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.rows;\n    }\n    checkRowIndex(this, index, true);\n    array = Float64Array.from(checkRowVector(this, array));\n    this.data.splice(index, 0, array);\n    this.rows += 1;\n    return this;\n  }\n\n  removeColumn(index) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns - 1);\n      for (let j = 0; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      for (let j = index + 1; j < this.columns; j++) {\n        newRow[j - 1] = this.data[i][j];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns -= 1;\n    return this;\n  }\n\n  addColumn(index, array) {\n    if (typeof array === 'undefined') {\n      array = index;\n      index = this.columns;\n    }\n    checkColumnIndex(this, index, true);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns + 1);\n      let j = 0;\n      for (; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      newRow[j++] = array[i];\n      for (; j < this.columns + 1; j++) {\n        newRow[j] = this.data[i][j - 1];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns += 1;\n    return this;\n  }\n}\n\ninstallMathOperations(AbstractMatrix, Matrix);\n","import { newArray } from './util';\n\nexport function sumByRow(matrix) {\n  let sum = newArray(matrix.rows);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function sumByColumn(matrix) {\n  let sum = newArray(matrix.columns);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function sumAll(matrix) {\n  let v = 0;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v += matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nexport function productByRow(matrix) {\n  let sum = newArray(matrix.rows, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function productByColumn(matrix) {\n  let sum = newArray(matrix.columns, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function productAll(matrix) {\n  let v = 1;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v *= matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nexport function varianceByRow(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let i = 0; i < rows; i++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean[i];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / cols) / (cols - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / cols) / cols);\n    }\n  }\n  return variance;\n}\n\nexport function varianceByColumn(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let j = 0; j < cols; j++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let i = 0; i < rows; i++) {\n      x = matrix.get(i, j) - mean[j];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / rows) / (rows - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / rows) / rows);\n    }\n  }\n  return variance;\n}\n\nexport function varianceAll(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const size = rows * cols;\n\n  let sum1 = 0;\n  let sum2 = 0;\n  let x = 0;\n  for (let i = 0; i < rows; i++) {\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean;\n      sum1 += x;\n      sum2 += x * x;\n    }\n  }\n  if (unbiased) {\n    return (sum2 - (sum1 * sum1) / size) / (size - 1);\n  } else {\n    return (sum2 - (sum1 * sum1) / size) / size;\n  }\n}\n\nexport function centerByRow(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[i]);\n    }\n  }\n}\n\nexport function centerByColumn(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[j]);\n    }\n  }\n}\n\nexport function centerAll(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean);\n    }\n  }\n}\n\nexport function getScaleByRow(matrix) {\n  const scale = [];\n  for (let i = 0; i < matrix.rows; i++) {\n    let sum = 0;\n    for (let j = 0; j < matrix.columns; j++) {\n      sum += Math.pow(matrix.get(i, j), 2) / (matrix.columns - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nexport function scaleByRow(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[i]);\n    }\n  }\n}\n\nexport function getScaleByColumn(matrix) {\n  const scale = [];\n  for (let j = 0; j < matrix.columns; j++) {\n    let sum = 0;\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += Math.pow(matrix.get(i, j), 2) / (matrix.rows - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nexport function scaleByColumn(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[j]);\n    }\n  }\n}\n\nexport function getScaleAll(matrix) {\n  const divider = matrix.size - 1;\n  let sum = 0;\n  for (let j = 0; j < matrix.columns; j++) {\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += Math.pow(matrix.get(i, j), 2) / divider;\n    }\n  }\n  return Math.sqrt(sum);\n}\n\nexport function scaleAll(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale);\n    }\n  }\n}\n","import { isAnyArray } from 'is-any-array';\n\n/**\n * @private\n * Check that a row index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkRowIndex(matrix, index, outer) {\n  let max = outer ? matrix.rows : matrix.rows - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Row index out of range');\n  }\n}\n\n/**\n * @private\n * Check that a column index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkColumnIndex(matrix, index, outer) {\n  let max = outer ? matrix.columns : matrix.columns - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Column index out of range');\n  }\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkRowVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.columns) {\n    throw new RangeError(\n      'vector size must be the same as the number of columns',\n    );\n  }\n  return vector;\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkColumnVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.rows) {\n    throw new RangeError('vector size must be the same as the number of rows');\n  }\n  return vector;\n}\n\nexport function checkRowIndices(matrix, rowIndices) {\n  if (!isAnyArray(rowIndices)) {\n    throw new TypeError('row indices must be an array');\n  }\n\n  for (let i = 0; i < rowIndices.length; i++) {\n    if (rowIndices[i] < 0 || rowIndices[i] >= matrix.rows) {\n      throw new RangeError('row indices are out of range');\n    }\n  }\n}\n\nexport function checkColumnIndices(matrix, columnIndices) {\n  if (!isAnyArray(columnIndices)) {\n    throw new TypeError('column indices must be an array');\n  }\n\n  for (let i = 0; i < columnIndices.length; i++) {\n    if (columnIndices[i] < 0 || columnIndices[i] >= matrix.columns) {\n      throw new RangeError('column indices are out of range');\n    }\n  }\n}\n\nexport function checkRange(matrix, startRow, endRow, startColumn, endColumn) {\n  if (arguments.length !== 5) {\n    throw new RangeError('expected 4 arguments');\n  }\n  checkNumber('startRow', startRow);\n  checkNumber('endRow', endRow);\n  checkNumber('startColumn', startColumn);\n  checkNumber('endColumn', endColumn);\n  if (\n    startRow > endRow ||\n    startColumn > endColumn ||\n    startRow < 0 ||\n    startRow >= matrix.rows ||\n    endRow < 0 ||\n    endRow >= matrix.rows ||\n    startColumn < 0 ||\n    startColumn >= matrix.columns ||\n    endColumn < 0 ||\n    endColumn >= matrix.columns\n  ) {\n    throw new RangeError('Submatrix indices are out of range');\n  }\n}\n\nexport function newArray(length, value = 0) {\n  let array = [];\n  for (let i = 0; i < length; i++) {\n    array.push(value);\n  }\n  return array;\n}\n\nfunction checkNumber(name, value) {\n  if (typeof value !== 'number') {\n    throw new TypeError(`${name} must be a number`);\n  }\n}\n\nexport function checkNonEmpty(matrix) {\n  if (matrix.isEmpty()) {\n    throw new Error('Empty matrix has no elements to index');\n  }\n}\n","import { AbstractMatrix } from '../matrix';\n\nexport default class WrapperMatrix2D extends AbstractMatrix {\n  constructor(data) {\n    super();\n    this.data = data;\n    this.rows = data.length;\n    this.columns = data[0].length;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n}\n","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\r\n    function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\r\n    var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\r\n    var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\r\n    var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\r\n    var _, done = false;\r\n    for (var i = decorators.length - 1; i >= 0; i--) {\r\n        var context = {};\r\n        for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\r\n        for (var p in contextIn.access) context.access[p] = contextIn.access[p];\r\n        context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\r\n        var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\r\n        if (kind === \"accessor\") {\r\n            if (result === void 0) continue;\r\n            if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\r\n            if (_ = accept(result.get)) descriptor.get = _;\r\n            if (_ = accept(result.set)) descriptor.set = _;\r\n            if (_ = accept(result.init)) initializers.push(_);\r\n        }\r\n        else if (_ = accept(result)) {\r\n            if (kind === \"field\") initializers.push(_);\r\n            else descriptor[key] = _;\r\n        }\r\n    }\r\n    if (target) Object.defineProperty(target, contextIn.name, descriptor);\r\n    done = true;\r\n};\r\n\r\nexport function __runInitializers(thisArg, initializers, value) {\r\n    var useValue = arguments.length > 2;\r\n    for (var i = 0; i < initializers.length; i++) {\r\n        value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\r\n    }\r\n    return useValue ? value : void 0;\r\n};\r\n\r\nexport function __propKey(x) {\r\n    return typeof x === \"symbol\" ? x : \"\".concat(x);\r\n};\r\n\r\nexport function __setFunctionName(f, name, prefix) {\r\n    if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\r\n    return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\r\n};\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (g && (g = 0, op[0] && (_ = 0)), _) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n"],"sourceRoot":""}