diff --git a/asset-manifest.json b/asset-manifest.json index 61aa5bf..d73cb96 100644 --- a/asset-manifest.json +++ b/asset-manifest.json @@ -1,13 +1,13 @@ { "files": { - "main.css": "/groundhog/static/css/main.59bb2f1c.css", - "main.js": "/groundhog/static/js/main.b497b6ff.js", + "main.css": "/groundhog/static/css/main.5435b5e4.css", + "main.js": "/groundhog/static/js/main.d4e37d27.js", "index.html": "/groundhog/index.html", - "main.59bb2f1c.css.map": "/groundhog/static/css/main.59bb2f1c.css.map", - "main.b497b6ff.js.map": "/groundhog/static/js/main.b497b6ff.js.map" + "main.5435b5e4.css.map": "/groundhog/static/css/main.5435b5e4.css.map", + "main.d4e37d27.js.map": "/groundhog/static/js/main.d4e37d27.js.map" }, "entrypoints": [ - "static/css/main.59bb2f1c.css", - "static/js/main.b497b6ff.js" + "static/css/main.5435b5e4.css", + "static/js/main.d4e37d27.js" ] } \ No newline at end of file diff --git a/index.html b/index.html index 0758f21..7eafa10 100644 --- a/index.html +++ b/index.html @@ -1 +1 @@ -groundHog
\ No newline at end of file +groundHog
\ No newline at end of file diff --git a/static/css/main.59bb2f1c.css b/static/css/main.5435b5e4.css similarity index 65% rename from static/css/main.59bb2f1c.css rename to static/css/main.5435b5e4.css index 915e554..19a1b68 100644 --- a/static/css/main.59bb2f1c.css +++ b/static/css/main.5435b5e4.css @@ -1,2 +1,2 @@ -@import url(https://fonts.googleapis.com/css2?family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@24,400,1,0&family=Russo+One&family=Outfit:wght@500&family=Silkscreen:wght@400;700&family=IBM+Plex+Mono:wght@400&display=swap);body{margin:0}.style_contextInput__1OoGc{height:100%;overflow-x:hidden;overflow-y:scroll;scrollbar-color:var(--palette-fg) #0000;scrollbar-width:thin}.style_contextInput__1OoGc>*{padding:0 8px}.style_contextInput__1OoGc>:first-child{margin-top:48px}.style_contextInput__1OoGc>:last-child{margin-bottom:200px}.style_contextInput__1OoGc .style_section__UU5kL .style_subsection__V6nKB:after{background:var(--palette-fg);content:" ";display:block;height:1px;margin-bottom:8px;width:100%}.style_contextInput__1OoGc h2{height:36px;line-height:28px;margin:0 0 -8px;top:0;z-index:2}.style_contextInput__1OoGc h2,.style_contextInput__1OoGc h3{background:linear-gradient(0deg,#0000,var(--palette-settings-bg) 8px,var(--palette-settings-bg));position:-webkit-sticky;position:sticky}.style_contextInput__1OoGc h3{height:24px;margin:0;padding-bottom:8px;top:28px;z-index:1}.style_contextInput__1OoGc h3:before{content:"subdirectory_arrow_right";font-family:Material Symbols Outlined}.style_contextInput__1OoGc p{margin:0}.style_contextInput__1OoGc .style_inputRow__e-kmi{align-items:center;display:flex;gap:8px;justify-content:space-between;margin-bottom:8px}.style_contextInput__1OoGc .style_inputRow__e-kmi>:not([type=range]){background:none;border:1px solid var(--palette-lines);border-radius:8px;box-sizing:border-box;color:var(--palette-fg);font-family:var(--font-body);height:36px;line-height:34px;margin:0;padding:0;text-align:center;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_icon__w\+PGc{flex-shrink:0;font-family:Material Symbols Outlined;font-size:24px;width:36px}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_inactive__-rc9v{border-style:dashed;color:var(--palette-lines)}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_invisible__I4pew{opacity:0}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_override__ZXWWz{background:#ff0;color:#000}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_seed__gS1FQ{font-size:24px}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_showAdvanced__sTHS2{display:flex;font-size:18px;height:24px;justify-content:center;line-height:22px;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_curve__v3DHl{border:none;display:flex;flex-direction:column;gap:6px;height:-webkit-fit-content;height:-moz-fit-content;height:fit-content;padding:6px 0}.style_contextInput__1OoGc .style_inputRow__e-kmi button{cursor:pointer}.style_contextInput__1OoGc .style_inputRow__e-kmi button:active{background:var(--palette-fg);color:#000}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]{-webkit-appearance:none;appearance:none;background:linear-gradient(to right,var(--palette-accent) 4px,var(--palette-accent) var(--completion),var(--palette-fg) var(--completion),var(--palette-fg) 100%);border-radius:2px;cursor:pointer;height:6px;outline:none;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]::-webkit-slider-thumb{-webkit-appearance:none;appearance:none;background-color:var(--palette-accent);border:none;border-radius:2px;height:14px;width:8px}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]::-moz-range-thumb{background-color:var(--palette-accent);border:none;border-radius:2px;height:14px;width:8px}@property --pvw-yaw{syntax:"";inherits:true;initial-value:0deg}@property --pvw-pitch{syntax:"";inherits:true;initial-value:0deg}@property --pvw-tr-x{syntax:"";inherits:true;initial-value:0}@property --pvw-tr-y{syntax:"";inherits:true;initial-value:0}@property --pvw-scale{syntax:"";inherits:true;initial-value:1}.style_cavernPreview__xf6rH{--pvw-bpak:#222;--pvw-bpck:#2d004b;--pvw-bphk:#166921;--pvw-pathspan:#ff0;--pvw-pathaux:#24b136;--pvw-entfriend:#ff0;--pvw-entenemy:red;--pvw-dfluid:#080022;--pvw-dfloor:#180032;--pvw-dwall:#2d004b;--pvw-scale0:#554;--pvw-scale1:#774;--pvw-scale2:#994;--pvw-scale3:#bb4;--pvw-scale4:#dd4;--pvw-scale5:#ff4;--pvw-scale6:#ff6;--pvw-scale7:#ff8;--pvw-tile1:#2d004b;--pvw-tile2:#180032;--pvw-tile3:#180032;--pvw-tile4:#180032;--pvw-tile5:#180032;--pvw-tile6:#ff5a00;--pvw-tile11:#002fb5;--pvw-tile12:#166921;--pvw-tile14:#bfbfbf;--pvw-tile24:#9d9b00;--pvw-tile26:#ad59ef;--pvw-tile30:#943cc3;--pvw-tile34:#731cad;--pvw-tile38:purple;--pvw-tile42:#b5ff00;--pvw-tile46:#9c4108;--pvw-tile50:#ff0;--pvw-tile60:#180032;--pvw-tile61:#180032;--pvw-tile62:#180032;--pvw-tile63:#180032;--pvw-disco0:#ff4;--pvw-disco1:#822;--pvw-oxex:#553;--pvw-oxhc:var(--pvw-tile42);display:flex;height:100%;overflow:hidden;position:absolute;width:100%}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe{position:relative;width:100%}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU{position:absolute;transform:rotateX(var(--pvw-pitch)) rotate(var(--pvw-yaw)) matrix(var(--pvw-scale),0,0,var(--pvw-scale),calc(var(--pvw-tr-x)*var(--pvw-scale)),calc(var(--pvw-tr-y)*var(--pvw-scale)));transition:transform .5s linear}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU.style_void__RvJKA{transition:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2{font-family:var(--font-tiny);font-size:8px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2 .style_fg__nlyiJ{fill:#fff}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_ambiguousKind__Pm08h .style_bg__N5lpK{fill:var(--pvw-bpak)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_caveKind__x9Yy5 .style_bg__N5lpK{fill:var(--pvw-bpck)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_hallKind__H\+yre .style_bg__N5lpK{fill:var(--pvw-bphk)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H{stroke-linecap:round;stroke-dasharray:2,3}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_ambiguousKind__Pm08h{--fg-color:#fff;--fg-opacity:0.3}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_spanningKind__cv5st{--fg-color:var(--pvw-pathspan)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_auxiliaryKind__FSAib{--fg-color:var(--pvw-pathaux)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H>path{stroke:var(--fg-color);stroke-opacity:var(--fg-opacity);stroke-width:2px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H>text{fill:var(--fg-color);font-family:var(--font-tiny);font-size:12px;opacity:var(--fg-opacity)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv{--color-bg:#444;--color-fg:#fff}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_caveKind__x9Yy5 .style_bg__N5lpK{stroke-width:2px;fill:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre .style_bg__N5lpK{stroke-linecap:round;opacity:.4}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre.style_spanningPathKind__dvMVJ{--color-fg:var(--pvw-pathspan)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre.style_auxiliaryPathKind__rGxFg{--color-fg:var(--pvw-pathaux)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_fluid6__Oqtv2{--color-bg:var(--pvw-tile6)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_fluid11__7ylOY{--color-bg:var(--pvw-tile11)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_left__Yyqc4 .style_label__vGz9Y{text-anchor:end}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_inline__9fTzz .style_label__vGz9Y{text-anchor:middle;font-size:6px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_label__vGz9Y{fill:var(--color-fg);font-size:12px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_pointer__-G8l\+{fill:none;stroke-width:1px;stroke:var(--color-fg)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_bg__N5lpK{stroke:var(--color-bg)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv{stroke-width:1px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv.style_caveKind__x9Yy5{--color0:#40ffff;--color1:#40dddd;--color2:#40bbbb;--color3:#409999}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv.style_hallKind__H\+yre{--color0:#ffff20;--color1:#dddd20;--color2:#bbbb20;--color3:#999920}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_outerPearl__MxT-o{stroke-width:.5px;--color0:#999;--color1:#888;--color2:#777;--color3:#666}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer0__tooG-{stroke:var(--color0)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer1__XpKZy{stroke:var(--color1)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer2__2BD4B{stroke:var(--color2)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer3__3Kn4w{stroke:var(--color3)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_tiles__iaD7a{shape-rendering:crispEdges}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_tiles__iaD7a .style_tile__mcUC8{transition:fill .5s ease-out}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_height__e764C{shape-rendering:crispEdges}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq{--color-fg:var(--pvw-entfriend)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq.style_enemy__z8gSd{--color-fg:var(--pvw-entenemy)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq .style_marker__n7Zau{fill:var(--color-fg);stroke:#000;stroke-width:.5px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq .style_label__vGz9Y{fill:#000;text-anchor:middle;font-family:Outfit;font-size:2px;pointer-events:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_openCaveFlag__kH4fE{stroke:red;fill:#fff}.style_cavernPreview__xf6rH .style_stats__bR5t1{background:var(--palette-bg);border:1px solid var(--palette-settings-bg);bottom:0;color:var(--palette-accent);font-family:var(--font-body);font-size:12px;left:0;margin:16px;max-width:calc(100% - 200px);padding:4px 14px;position:absolute}.style_cavernPreview__xf6rH .style_stats__bR5t1>*{margin:4px 0}.style_cavernPreview__xf6rH .style_stats__bR5t1 h1{font-family:var(--font-cyber);font-size:18px}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul{padding:0}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul>li{display:inline}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul>li:not(:first-child){padding-left:16px}.style_cavernPreview__xf6rH .style_error__Oe9Pd{color:#f18686;font-family:var(--font-body);font-size:24px;left:0;line-break:anywhere;position:absolute;right:0;text-align:center;top:50%}.styles_script__wlFev{background:var(--palette-bg);border-right:1px solid var(--palette-settings-bg);overflow-x:hidden;overflow-y:scroll;position:relative;width:450px;z-index:1}.styles_script__wlFev>h2{padding:0 12px}.styles_script__wlFev .styles_src__D5r4o{word-wrap:break-word;font-family:var(--font-mono);font-size:12px}.styles_script__wlFev .styles_src__D5r4o .styles_line__DUONY{color:var(--color-codehlt);padding:0 12px}.styles_script__wlFev .styles_src__D5r4o .styles_line__DUONY.styles_hovered__IuDHx{background:var(--color-codehlt);color:#000}.styles_scriptOverlay__itjxQ .styles_tile__\+On\+N{fill:var(--color-codehlt)}.styles_scriptOverlay__itjxQ .styles_arrow__BwPCK{fill:none;stroke:var(--color-codehlt);stroke-width:2px}.styles_scriptOverlay__itjxQ .styles_arrowhead__VEozU{fill:var(--palette-bg);stroke:var(--color-codehlt);stroke-width:2px}.styles_misc__Oi8T3{--color-codehlt:var(--palette-fg)}.styles_condition__-r6Ai{--color-codehlt:#ff0}.styles_event__jROkn{--color-codehlt:cyan}.styles_popoverWrapper__re-vG{bottom:0;display:flex;flex-direction:column;justify-content:center;left:0;position:absolute;right:0;top:0}.styles_popoverWrapper__re-vG>div{background:var(--palette-bg);border:1px solid var(--palette-settings-bg);margin:0 auto;max-height:calc(100% - 100px);max-width:500px;overflow-x:hidden;overflow-y:scroll;padding:12px 24px}.styles_popoverWrapper__re-vG>div h1,.styles_popoverWrapper__re-vG>div h2,.styles_popoverWrapper__re-vG>div h3,.styles_popoverWrapper__re-vG>div p{margin:4px 0}.styles_popoverWrapper__re-vG>div h1,.styles_popoverWrapper__re-vG>div h2,.styles_popoverWrapper__re-vG>div h3{color:var(--palette-accent)}.styles_popoverWrapper__re-vG>div a,.styles_popoverWrapper__re-vG>div button{background:none;border:none;color:var(--palette-accent);cursor:pointer;font-family:var(--font-body);font-size:1em;padding:0;text-decoration:underline}.styles_popoverWrapper__re-vG>div>ul{padding-left:0}.styles_popoverWrapper__re-vG>div .styles_subhead__tl6JE{font-size:.5em}.styles_popoverWrapper__re-vG>div h3:before{content:"subdirectory_arrow_right";font-family:Material Symbols Outlined}.styles_popoverWrapper__re-vG>div.styles_lore__aBk0G p{white-space-collapse:preserve-breaks}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs{--palette-settings-bg:#ff0;--palette-accent:#ff0}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_message__dHlbe{white-space:pre}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_stack__6jNum{font-size:8px;white-space:pre}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_context__tmsQi{font-size:8px;line-break:anywhere}@keyframes App_scan-scrim__73gMX{0%{background-position-x:-800px}to{background-position-x:0}}.App_App__HX9JK{--font-body:"Outfit";--font-cyber:"Russo One";--font-tiny:"Silkscreen";--font-mono:"IBM Plex Mono";--palette-fg:#fff;--palette-bg:#121212;--palette-lines:#999;--palette-disabled:#999;--palette-settings-bg:#333;--palette-accent:#c96f12;background:var(--palette-bg);color:var(--palette-fg);display:flex;font-family:var(--font-body);height:100%;overflow:hidden;position:absolute;width:100%}.App_App__HX9JK.App_iceBiome__TxzIK{--palette-bg:#060716;--palette-settings-bg:#224659;--palette-accent:#03c7dd}.App_App__HX9JK.App_lavaBiome__Je2vq{--palette-bg:#140b05;--palette-settings-bg:#4d2114;--palette-accent:#ca0b0b}.App_App__HX9JK .App_settingsPanel__5OsgF{background:var(--palette-settings-bg);flex-grow:1;flex-shrink:0;width:240px}.App_App__HX9JK .App_mainPanel__vxyPC{overflow:hidden;position:relative;width:75%}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE{background:var(--palette-settings-bg);bottom:0;left:0;position:absolute;right:0;top:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE:before{animation:App_scan-scrim__73gMX 3s linear infinite;background-image:linear-gradient(to left,#0000 0,var(--palette-accent) 25px,#0000 400px);background-size:800px 100%;bottom:0;content:"";left:0;opacity:0;position:absolute;right:0;top:0;transition:opacity 3s ease-in}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_loading__XtoTg:before{opacity:1;transition:opacity .25s ease-out}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE:after{background:var(--palette-bg);bottom:0;content:"";left:0;-webkit-mask-composite:source-out;mask-composite:subtract;-webkit-mask-image:linear-gradient(90deg,#fff 16px,#0000 0,#0000 17px,#fff 0),linear-gradient(#0000 16px,#000 0,#000 17px,#0000 0);mask-image:linear-gradient(90deg,#fff 16px,#0000 0,#0000 17px,#fff 0),linear-gradient(#0000 16px,#000 0,#000 17px,#0000 0);-webkit-mask-size:32px 32px;mask-size:32px 32px;position:absolute;right:0;top:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN{background:#bebe13;-webkit-mask-image:linear-gradient(120deg,#fff 25%,#0000 0,#0000 50%,#fff 0,#fff 75%,#0000 0,#0000);mask-image:linear-gradient(120deg,#fff 25%,#0000 0,#0000 50%,#fff 0,#fff 75%,#0000 0,#0000);-webkit-mask-size:46.19px 80px;mask-size:46.19px 80px}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN:after,.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN:before{content:none}.App_App__HX9JK .App_mainPanel__vxyPC .App_stepName__nVlPC{font-feature-settings:"tnum";font-size:16px;font-variant-numeric:tabular-nums;left:16px;position:absolute;top:16px}.App_App__HX9JK .App_mainPanel__vxyPC .App_progressBar__ABZI2{background:linear-gradient(90deg,var(--palette-accent) 0,var(--palette-accent) var(--progress),#0000 var(--progress),#0000 100%);bottom:0;height:8px;position:absolute;transition:height .2s ease-out;width:100%}.App_App__HX9JK .App_mainPanel__vxyPC .App_progressBar__ABZI2.App_complete__bL2eM{height:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS{bottom:0;display:flex;gap:8px;margin:16px;position:absolute;right:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS .App_button__nYXNW,.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS button{background:var(--palette-bg);border:1px solid var(--palette-lines);box-sizing:border-box;color:var(--palette-fg);display:block;font-family:Material Symbols Outlined;font-size:36px;height:48px;line-height:46px;margin:0;padding:0;text-align:center;text-decoration:none;width:48px}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS .App_button__nYXNW.App_disabled__fR4wn,.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS button.App_disabled__fR4wn{border-style:dashed;color:var(--palette-lines)}.App_App__HX9JK .App_vizOptsPanel__EvGsa{background-image:linear-gradient(var(--palette-lines) 1px,#0000 1px),linear-gradient(to right,var(--palette-lines) 1px,#0000 1px);background-size:16px 16px;flex-grow:0;flex-shrink:0;font-family:var(--font-cyber);position:relative;width:128px}.App_App__HX9JK .App_vizOptsPanel__EvGsa h1{font-weight:400;margin:4px 0;text-align:center}.App_App__HX9JK .App_vizOptsPanel__EvGsa button{background:var(--palette-bg);border:1px solid var(--palette-lines);border-bottom-left-radius:8px;border-top-left-radius:8px;box-sizing:border-box;color:var(--palette-fg);font-family:var(--font-cyber);height:24px;left:-8px;margin-bottom:8px;padding:0 16px 0 8px;position:relative;transition:left .2s ease-out;width:152px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button:hover{left:-14px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button.App_active__57U0p{background:var(--palette-fg);color:var(--palette-bg);left:-16px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button.App_disabled__fR4wn{color:var(--palette-disabled)} -/*# sourceMappingURL=main.59bb2f1c.css.map*/ \ No newline at end of file +@import url(https://fonts.googleapis.com/css2?family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@24,400,1,0&family=Russo+One&family=Outfit:wght@500&family=Silkscreen:wght@400;700&family=IBM+Plex+Mono:wght@400&display=swap);body{margin:0}.style_contextInput__1OoGc{height:100%;overflow-x:hidden;overflow-y:scroll;scrollbar-color:var(--palette-fg) #0000;scrollbar-width:thin}.style_contextInput__1OoGc>*{padding:0 8px}.style_contextInput__1OoGc>:first-child{margin-top:48px}.style_contextInput__1OoGc>:last-child{margin-bottom:200px}.style_contextInput__1OoGc .style_section__UU5kL .style_subsection__V6nKB:after{background:var(--palette-fg);content:" ";display:block;height:1px;margin-bottom:8px;width:100%}.style_contextInput__1OoGc h2{height:36px;line-height:28px;margin:0 0 -8px;top:0;z-index:2}.style_contextInput__1OoGc h2,.style_contextInput__1OoGc h3{background:linear-gradient(0deg,#0000,var(--palette-settings-bg) 8px,var(--palette-settings-bg));position:-webkit-sticky;position:sticky}.style_contextInput__1OoGc h3{height:24px;margin:0;padding-bottom:8px;top:28px;z-index:1}.style_contextInput__1OoGc h3:before{content:"subdirectory_arrow_right";font-family:Material Symbols Outlined}.style_contextInput__1OoGc p{margin:0}.style_contextInput__1OoGc .style_inputRow__e-kmi{align-items:center;display:flex;gap:8px;justify-content:space-between;margin-bottom:8px}.style_contextInput__1OoGc .style_inputRow__e-kmi>:not([type=range]){background:none;border:1px solid var(--palette-lines);border-radius:8px;box-sizing:border-box;color:var(--palette-fg);font-family:var(--font-body);height:36px;line-height:34px;margin:0;padding:0;text-align:center;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_icon__w\+PGc{flex-shrink:0;font-family:Material Symbols Outlined;font-size:24px;width:36px}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_inactive__-rc9v{border-style:dashed;color:var(--palette-lines)}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_invisible__I4pew{opacity:0}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_override__ZXWWz{background:#ff0;color:#000}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_seed__gS1FQ{font-size:24px}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_showAdvanced__sTHS2{display:flex;font-size:18px;height:24px;justify-content:center;line-height:22px;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi .style_curve__v3DHl{border:none;display:flex;flex-direction:column;gap:6px;height:-webkit-fit-content;height:-moz-fit-content;height:fit-content;padding:6px 0}.style_contextInput__1OoGc .style_inputRow__e-kmi button{cursor:pointer}.style_contextInput__1OoGc .style_inputRow__e-kmi button:active{background:var(--palette-fg);color:#000}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]{-webkit-appearance:none;appearance:none;background:linear-gradient(to right,var(--palette-accent) 4px,var(--palette-accent) var(--completion),var(--palette-fg) var(--completion),var(--palette-fg) 100%);border-radius:2px;cursor:pointer;height:6px;outline:none;width:100%}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]::-webkit-slider-thumb{-webkit-appearance:none;appearance:none;background-color:var(--palette-accent);border:none;border-radius:2px;height:14px;width:8px}.style_contextInput__1OoGc .style_inputRow__e-kmi input[type=range]::-moz-range-thumb{background-color:var(--palette-accent);border:none;border-radius:2px;height:14px;width:8px}@property --pvw-yaw{syntax:"";inherits:true;initial-value:0deg}@property --pvw-pitch{syntax:"";inherits:true;initial-value:0deg}@property --pvw-tr-x{syntax:"";inherits:true;initial-value:0}@property --pvw-tr-y{syntax:"";inherits:true;initial-value:0}@property --pvw-scale{syntax:"";inherits:true;initial-value:1}.style_cavernPreview__xf6rH{--pvw-bpak:#222;--pvw-bpck:#2d004b;--pvw-bphk:#166921;--pvw-pathspan:#ff0;--pvw-pathaux:#24b136;--pvw-entfriend:#ff0;--pvw-entenemy:red;--pvw-dfluid:#080022;--pvw-dfloor:#180032;--pvw-dwall:#2d004b;--pvw-scale0:#554;--pvw-scale1:#774;--pvw-scale2:#994;--pvw-scale3:#bb4;--pvw-scale4:#dd4;--pvw-scale5:#ff4;--pvw-scale6:#ff6;--pvw-scale7:#ff8;--pvw-tile1:#2d004b;--pvw-tile2:#180032;--pvw-tile3:#180032;--pvw-tile4:#180032;--pvw-tile5:#180032;--pvw-tile6:#ff5a00;--pvw-tile11:#002fb5;--pvw-tile12:#166921;--pvw-tile14:#bfbfbf;--pvw-tile24:#9d9b00;--pvw-tile26:#ad59ef;--pvw-tile30:#943cc3;--pvw-tile34:#731cad;--pvw-tile38:purple;--pvw-tile42:#b5ff00;--pvw-tile46:#9c4108;--pvw-tile50:#ff0;--pvw-tile60:#180032;--pvw-tile61:#180032;--pvw-tile62:#180032;--pvw-tile63:#180032;--pvw-disco0:#ff4;--pvw-disco1:#822;--pvw-oxex:#553;--pvw-oxhc:var(--pvw-tile42);display:flex;height:100%;overflow:hidden;position:absolute;width:100%}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe{position:relative;width:100%}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU{position:absolute;transform:rotateX(var(--pvw-pitch)) rotate(var(--pvw-yaw)) matrix(var(--pvw-scale),0,0,var(--pvw-scale),calc(var(--pvw-tr-x)*var(--pvw-scale)),calc(var(--pvw-tr-y)*var(--pvw-scale)));transition:transform .5s linear}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU.style_void__RvJKA{transition:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2{font-family:var(--font-tiny);font-size:8px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2 .style_fg__nlyiJ{fill:#fff}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_ambiguousKind__Pm08h .style_bg__N5lpK{fill:var(--pvw-bpak)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_caveKind__x9Yy5 .style_bg__N5lpK{fill:var(--pvw-bpck)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_baseplate__p03X2.style_hallKind__H\+yre .style_bg__N5lpK{fill:var(--pvw-bphk)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H{stroke-linecap:round;stroke-dasharray:2,3}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_ambiguousKind__Pm08h{--fg-color:#fff;--fg-opacity:0.3}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_spanningKind__cv5st{--fg-color:var(--pvw-pathspan)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H.style_auxiliaryKind__FSAib{--fg-color:var(--pvw-pathaux)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H>path{stroke:var(--fg-color);stroke-opacity:var(--fg-opacity);stroke-width:2px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_path__HXk6H>text{fill:var(--fg-color);font-family:var(--font-tiny);font-size:12px;opacity:var(--fg-opacity)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv{--color-bg:#444;--color-fg:#fff}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_caveKind__x9Yy5 .style_bg__N5lpK{stroke-width:2px;fill:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre .style_bg__N5lpK{stroke-linecap:round;opacity:.4}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre.style_spanningPathKind__dvMVJ{--color-fg:var(--pvw-pathspan)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_hallKind__H\+yre.style_auxiliaryPathKind__rGxFg{--color-fg:var(--pvw-pathaux)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_fluid6__Oqtv2{--color-bg:var(--pvw-tile6)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_fluid11__7ylOY{--color-bg:var(--pvw-tile11)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_left__Yyqc4 .style_label__vGz9Y{text-anchor:end}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv.style_inline__9fTzz .style_label__vGz9Y{text-anchor:middle;font-size:6px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_label__vGz9Y{fill:var(--color-fg);font-size:12px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_pointer__-G8l\+{fill:none;stroke-width:1px;stroke:var(--color-fg)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_plan__QISwv .style_bg__N5lpK{stroke:var(--color-bg)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv{stroke-width:1px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv.style_caveKind__x9Yy5{--color0:#40ffff;--color1:#40dddd;--color2:#40bbbb;--color3:#409999}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_innerPearl__APwPv.style_hallKind__H\+yre{--color0:#ffff20;--color1:#dddd20;--color2:#bbbb20;--color3:#999920}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C.style_outerPearl__MxT-o{stroke-width:.5px;--color0:#999;--color1:#888;--color2:#777;--color3:#666}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer0__tooG-{stroke:var(--color0)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer1__XpKZy{stroke:var(--color1)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer2__2BD4B{stroke:var(--color2)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_pearl__std\+C .style_layer__Gfelc.style_layer3__3Kn4w{stroke:var(--color3)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_tiles__iaD7a{shape-rendering:crispEdges}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_tiles__iaD7a .style_tile__mcUC8{transition:fill .5s ease-out}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_height__e764C{shape-rendering:crispEdges}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq{--color-fg:var(--pvw-entfriend)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq.style_enemy__z8gSd{--color-fg:var(--pvw-entenemy)}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq .style_marker__n7Zau{fill:var(--color-fg);stroke:#000;stroke-width:.5px}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_entity__p\+Wtq .style_label__vGz9Y{fill:#000;text-anchor:middle;font-family:Outfit;font-size:2px;pointer-events:none}.style_cavernPreview__xf6rH .style_mapWrapper__l0TEe .style_map__o4nZU .style_openCaveFlag__kH4fE{stroke:red;fill:#fff}.style_cavernPreview__xf6rH .style_stats__bR5t1{background:var(--palette-bg);border:1px solid var(--palette-settings-bg);bottom:0;color:var(--palette-accent);font-family:var(--font-body);font-size:12px;left:0;margin:16px;max-width:calc(100% - 200px);padding:4px 14px;position:absolute}.style_cavernPreview__xf6rH .style_stats__bR5t1>*{margin:4px 0}.style_cavernPreview__xf6rH .style_stats__bR5t1 h1{font-family:var(--font-cyber);font-size:18px}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul{padding:0}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul>li{display:inline}.style_cavernPreview__xf6rH .style_stats__bR5t1>ul>li:not(:first-child){padding-left:16px}.style_cavernPreview__xf6rH .style_error__Oe9Pd{color:#f18686;font-family:var(--font-body);font-size:24px;left:0;line-break:anywhere;position:absolute;right:0;text-align:center;top:50%}.styles_script__wlFev{background:var(--palette-bg);border-right:1px solid var(--palette-settings-bg);overflow-x:hidden;overflow-y:scroll;position:relative;width:450px;z-index:1}.styles_script__wlFev>h2{padding:0 12px}.styles_script__wlFev .styles_src__D5r4o{word-wrap:break-word;font-family:var(--font-mono);font-size:12px}.styles_script__wlFev .styles_src__D5r4o .styles_line__DUONY{color:var(--color-codehlt);padding:0 12px}.styles_script__wlFev .styles_src__D5r4o .styles_line__DUONY.styles_hovered__IuDHx{background:var(--color-codehlt);color:#000}.styles_scriptOverlay__itjxQ .styles_tile__\+On\+N{fill:var(--color-codehlt)}.styles_scriptOverlay__itjxQ .styles_arrow__BwPCK{fill:none;stroke:var(--color-codehlt);stroke-width:2px}.styles_scriptOverlay__itjxQ .styles_arrowhead__VEozU{fill:var(--palette-bg);stroke:var(--color-codehlt);stroke-width:2px}.styles_h3__EDfli{font-family:var(--font-body);font-size:20px}.styles_h4__4XasX{font-family:var(--font-body);font-size:14px}.styles_misc__Oi8T3{--color-codehlt:var(--palette-fg)}.styles_condition__-r6Ai{--color-codehlt:#ff0}.styles_event__jROkn{--color-codehlt:cyan}.styles_popoverWrapper__re-vG{bottom:0;display:flex;flex-direction:column;justify-content:center;left:0;position:absolute;right:0;top:0}.styles_popoverWrapper__re-vG>div{background:var(--palette-bg);border:1px solid var(--palette-settings-bg);margin:0 auto;max-height:calc(100% - 100px);max-width:500px;overflow-x:hidden;overflow-y:scroll;padding:12px 24px}.styles_popoverWrapper__re-vG>div h1,.styles_popoverWrapper__re-vG>div h2,.styles_popoverWrapper__re-vG>div h3,.styles_popoverWrapper__re-vG>div p{margin:4px 0}.styles_popoverWrapper__re-vG>div h1,.styles_popoverWrapper__re-vG>div h2,.styles_popoverWrapper__re-vG>div h3{color:var(--palette-accent)}.styles_popoverWrapper__re-vG>div a,.styles_popoverWrapper__re-vG>div button{background:none;border:none;color:var(--palette-accent);cursor:pointer;font-family:var(--font-body);font-size:1em;padding:0;text-decoration:underline}.styles_popoverWrapper__re-vG>div>ul{padding-left:0}.styles_popoverWrapper__re-vG>div .styles_subhead__tl6JE{font-size:.5em}.styles_popoverWrapper__re-vG>div h3:before{content:"subdirectory_arrow_right";font-family:Material Symbols Outlined}.styles_popoverWrapper__re-vG>div.styles_lore__aBk0G p{white-space-collapse:preserve-breaks}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs{--palette-settings-bg:#ff0;--palette-accent:#ff0}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_message__dHlbe{white-space:pre}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_stack__6jNum{font-size:8px;white-space:pre}.styles_popoverWrapper__re-vG>div.styles_error__o6NAs .styles_context__tmsQi{font-size:8px;line-break:anywhere}@keyframes App_scan-scrim__73gMX{0%{background-position-x:-800px}to{background-position-x:0}}.App_App__HX9JK{--font-body:"Outfit";--font-cyber:"Russo One";--font-tiny:"Silkscreen";--font-mono:"IBM Plex Mono";--palette-fg:#fff;--palette-bg:#121212;--palette-lines:#999;--palette-disabled:#999;--palette-settings-bg:#333;--palette-accent:#c96f12;background:var(--palette-bg);color:var(--palette-fg);display:flex;font-family:var(--font-body);height:100%;overflow:hidden;position:absolute;width:100%}.App_App__HX9JK.App_iceBiome__TxzIK{--palette-bg:#060716;--palette-settings-bg:#224659;--palette-accent:#03c7dd}.App_App__HX9JK.App_lavaBiome__Je2vq{--palette-bg:#140b05;--palette-settings-bg:#4d2114;--palette-accent:#ca0b0b}.App_App__HX9JK .App_settingsPanel__5OsgF{background:var(--palette-settings-bg);flex-grow:1;flex-shrink:0;width:240px}.App_App__HX9JK .App_mainPanel__vxyPC{overflow:hidden;position:relative;width:75%}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE{background:var(--palette-settings-bg);bottom:0;left:0;position:absolute;right:0;top:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE:before{animation:App_scan-scrim__73gMX 3s linear infinite;background-image:linear-gradient(to left,#0000 0,var(--palette-accent) 25px,#0000 400px);background-size:800px 100%;bottom:0;content:"";left:0;opacity:0;position:absolute;right:0;top:0;transition:opacity 3s ease-in}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_loading__XtoTg:before{opacity:1;transition:opacity .25s ease-out}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE:after{background:var(--palette-bg);bottom:0;content:"";left:0;-webkit-mask-composite:source-out;mask-composite:subtract;-webkit-mask-image:linear-gradient(90deg,#fff 16px,#0000 0,#0000 17px,#fff 0),linear-gradient(#0000 16px,#000 0,#000 17px,#0000 0);mask-image:linear-gradient(90deg,#fff 16px,#0000 0,#0000 17px,#fff 0),linear-gradient(#0000 16px,#000 0,#000 17px,#0000 0);-webkit-mask-size:32px 32px;mask-size:32px 32px;position:absolute;right:0;top:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN{background:#bebe13;-webkit-mask-image:linear-gradient(120deg,#fff 25%,#0000 0,#0000 50%,#fff 0,#fff 75%,#0000 0,#0000);mask-image:linear-gradient(120deg,#fff 25%,#0000 0,#0000 50%,#fff 0,#fff 75%,#0000 0,#0000);-webkit-mask-size:46.19px 80px;mask-size:46.19px 80px}.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN:after,.App_App__HX9JK .App_mainPanel__vxyPC .App_grid__p-lsE.App_hasError__ajbuN:before{content:none}.App_App__HX9JK .App_mainPanel__vxyPC .App_stepName__nVlPC{font-feature-settings:"tnum";font-size:16px;font-variant-numeric:tabular-nums;left:16px;position:absolute;top:16px}.App_App__HX9JK .App_mainPanel__vxyPC .App_progressBar__ABZI2{background:linear-gradient(90deg,var(--palette-accent) 0,var(--palette-accent) var(--progress),#0000 var(--progress),#0000 100%);bottom:0;height:8px;position:absolute;transition:height .2s ease-out;width:100%}.App_App__HX9JK .App_mainPanel__vxyPC .App_progressBar__ABZI2.App_complete__bL2eM{height:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS{bottom:0;display:flex;gap:8px;margin:16px;position:absolute;right:0}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS .App_button__nYXNW,.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS button{background:var(--palette-bg);border:1px solid var(--palette-lines);box-sizing:border-box;color:var(--palette-fg);display:block;font-family:Material Symbols Outlined;font-size:36px;height:48px;line-height:46px;margin:0;padding:0;text-align:center;text-decoration:none;width:48px}.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS .App_button__nYXNW.App_disabled__fR4wn,.App_App__HX9JK .App_mainPanel__vxyPC .App_controls__arkPS button.App_disabled__fR4wn{border-style:dashed;color:var(--palette-lines)}.App_App__HX9JK .App_vizOptsPanel__EvGsa{background-image:linear-gradient(var(--palette-lines) 1px,#0000 1px),linear-gradient(to right,var(--palette-lines) 1px,#0000 1px);background-size:16px 16px;flex-grow:0;flex-shrink:0;font-family:var(--font-cyber);position:relative;width:128px}.App_App__HX9JK .App_vizOptsPanel__EvGsa h1{font-weight:400;margin:4px 0;text-align:center}.App_App__HX9JK .App_vizOptsPanel__EvGsa button{background:var(--palette-bg);border:1px solid var(--palette-lines);border-bottom-left-radius:8px;border-top-left-radius:8px;box-sizing:border-box;color:var(--palette-fg);font-family:var(--font-cyber);height:24px;left:-8px;margin-bottom:8px;padding:0 16px 0 8px;position:relative;transition:left .2s ease-out;width:152px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button:hover{left:-14px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button.App_active__57U0p{background:var(--palette-fg);color:var(--palette-bg);left:-16px}.App_App__HX9JK .App_vizOptsPanel__EvGsa button.App_disabled__fR4wn{color:var(--palette-disabled)} +/*# sourceMappingURL=main.5435b5e4.css.map*/ \ No newline at end of file diff --git a/static/css/main.5435b5e4.css.map b/static/css/main.5435b5e4.css.map new file mode 100644 index 0000000..0d2d73c --- /dev/null +++ b/static/css/main.5435b5e4.css.map @@ -0,0 +1 @@ +{"version":3,"file":"static/css/main.5435b5e4.css","mappings":"iOAEA,KACE,QACF,CCJA,2BAGE,YAFA,kBACA,kBAGA,wCACA,qBAEA,6BACE,cAEA,wCACE,gBAGF,uCACE,oBAMA,gFAME,6BALA,YACA,cAEA,WACA,kBAFA,UAGA,CAKN,8BAKE,YACA,iBAFA,gBAFA,MAKA,SACA,CAQF,4DARE,iGAPA,uCAsBA,CAPF,8BAIE,YADA,SAEA,mBAHA,SAIA,SACA,CAMA,qCAEE,mCADA,qCACA,CAIJ,6BACE,SAGF,kDAIE,mBAHA,aACA,QACA,8BAEA,kBAEA,qEAUE,gBALA,sCAMA,kBAPA,sBAKA,wBAGA,6BAXA,YAEA,iBAIA,SADA,UAOA,kBAXA,UAWA,CAGF,sEAGE,cAFA,sCACA,eAEA,WAGF,yEAEE,oBADA,0BACA,CAGF,0EACE,UAGF,yEAEE,gBADA,UACA,CAGF,qEACE,eAGF,6EACE,aAKA,eAFA,YAFA,uBAKA,iBAJA,UAIA,CAGF,sEAIE,YAHA,aAEA,sBAGA,QAJA,sEAGA,aACA,CAGF,yDACE,eAEA,gEACE,6BACA,WAIJ,oEACE,wBACA,gBAMA,kKAFA,kBAFA,eAGA,WAFA,aAFA,UAKA,CAQA,0FACE,wBACA,gBAGA,uCAEA,YADA,kBAHA,YACA,SAGA,CAGF,sFAGE,uCAEA,YADA,kBAHA,YACA,SAGA,CCnLR,oBACE,iBACA,cACA,mBAEF,sBACE,iBACA,cACA,mBAEF,qBACE,kBACA,cACA,gBAEF,qBACE,kBACA,cACA,gBAEF,sBACE,kBACA,cACA,gBAGF,4BASE,eAAmB,CACnB,kBAAmB,CACnB,kBAAmB,CAEnB,mBAAsB,CACtB,qBAAsB,CAEtB,oBAAuB,CACvB,kBAAmB,CAEnB,oBAAqB,CACrB,oBAAqB,CACrB,mBAAoB,CAEpB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CAErB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,mBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,iBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CAErB,iBAAqB,CACrB,iBAAqB,CAErB,eAAmB,CACnB,4BAA4B,CApD5B,aAFA,YAFA,gBADA,kBAEA,UAuD6B,CAE7B,qDACE,kBACA,WAEA,uEACE,kBAEA,uLADA,+BACA,CAUA,yFACE,gBAGF,+FACE,6BACA,cAEA,gHACE,UAGF,2IACE,qBAGF,sIACE,qBAGF,uIACE,qBAIJ,0FACE,qBACA,qBAEA,qHACE,eAAiB,CACjB,gBAAiB,CAGnB,oHACE,8BAA+B,CAGjC,qHACE,6BAA8B,CAGhC,+FACE,uBACA,iCACA,iBAGF,+FACE,qBAEA,6BACA,eAFA,yBAEA,CAIJ,0FACE,eAAmB,CACnB,eAAiB,CACjB,iIACE,iBACA,UAGA,kIACE,qBACA,WAEF,+IACE,8BAA+B,CAEjC,gJACE,6BAA8B,CAGlC,8GACE,2BAA4B,CAE9B,+GACE,4BAA6B,CAE/B,gIACE,gBAEF,kIACE,mBACA,cAEF,8GACE,qBACA,eAEF,iHACE,UACA,iBACA,uBAEF,2GACE,uBAKF,oHACE,iBACA,0IACE,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CAEnB,2IACE,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CAGrB,oHACE,kBACA,aAAiB,CACjB,aAAiB,CACjB,aAAiB,CACjB,aAAiB,CAGjB,oIACE,qBAEF,oIACE,qBAEF,oIACE,qBAEF,oIACE,qBAKN,2FACE,2BACA,8GACE,6BAIJ,4FACE,2BAGF,6FACE,+BAAgC,CAChC,gHACE,8BAA+B,CAEjC,kHACE,qBACA,YACA,kBAEF,iHACE,UAGA,mBAFA,mBACA,cAEA,oBAIJ,kGACE,WACA,UAKN,gDAKE,6BAIA,4CANA,SACA,4BAEA,6BACA,eALA,OASA,YAHA,6BAEA,iBATA,iBAUA,CAEA,kDACE,aAGF,mDACE,8BACA,eAGF,mDACE,UAEA,sDACE,eAEA,wEACE,kBAMR,gDAME,cACA,6BAFA,eAHA,OAOA,oBARA,kBAEA,QAKA,kBAJA,OAKA,CCrUJ,sBAEE,6BACA,kDAEA,kBACA,kBALA,kBAGA,YAGA,UAEA,yBACE,eAGF,yCAGE,qBAFA,6BACA,cACA,CAEA,6DACE,2BACA,eAEA,mFAEE,gCADA,UACA,CAON,mDACE,0BAGF,kDACE,UACA,4BACA,iBAGF,sDACE,uBACA,4BACA,iBAIJ,kBAEE,6BADA,cACA,CAEF,kBAEE,6BADA,cACA,CAEF,oBACE,iCAAkC,CAEpC,yBACE,oBAAuB,CAEzB,qBACE,oBAAqB,CC/DvB,8BAIE,SAEA,aACA,sBACA,uBALA,OAFA,kBAIA,QAHA,KAMA,CAEA,kCACE,6BACA,4CACA,cAGA,8BADA,gBAEA,kBACA,kBAJA,iBAIA,CAEA,mJAIE,aAGF,+GAGE,4BAGF,6EAKE,gBAHA,YAIA,4BACA,eACA,6BAJA,cADA,UAMA,0BAGF,qCACE,eAGF,yDACE,eAGF,4CAEE,mCADA,qCACA,CAIA,uDACE,qCAIJ,sDACE,0BAA6B,CAC7B,qBAAwB,CAExB,6EACE,gBAGF,2EACE,cACA,gBAGF,6EACE,cACA,oBC/ER,iCACE,GACE,6BAEF,GACE,yBAIJ,gBACE,oBAAqB,CACrB,wBAAyB,CACzB,wBAAyB,CACzB,2BAA4B,CAE5B,iBAAmB,CACnB,oBAAqB,CACrB,oBAAwB,CACxB,uBAA2B,CAC3B,0BAA8B,CAC9B,wBAAyB,CAqBzB,6BADA,wBANA,aAQA,6BAJA,YAFA,gBADA,kBAEA,UAKA,CApBA,oCACE,oBAAqB,CACrB,6BAAyC,CACzC,wBAAoC,CAGtC,qCACE,oBAAqB,CACrB,6BAA8B,CAC9B,wBAAyB,CAa3B,0CAIE,sCADA,YADA,cADA,WAGA,CAGF,sCAGE,gBAFA,kBACA,SACA,CAEA,uDAOE,sCAFA,SAHA,OADA,kBAGA,QADA,KAIA,CAEA,8DAeE,mDAPA,yFAMA,2BARA,SALA,WAEA,OAaA,UAdA,kBAGA,QADA,MAaA,8BAGF,iFACE,UACA,iCAGF,6DAQE,6BAFA,SALA,WAEA,OAMA,0DACA,8PAaA,gDArBA,kBAGA,QADA,KAmBA,CAGF,2EACE,mBACA,gMAUA,sDAEA,mKAEE,aAKN,2DAKE,6BADA,eACA,kCAFA,UAFA,kBACA,QAGA,CAGF,8DAKE,iIADA,SADA,WAFA,kBAWA,+BAVA,UAUA,CACA,kFACE,SAIJ,2DAKE,SAJA,aACA,QACA,YACA,kBAEA,QAEA,gJAaE,6BALA,sCADA,sBAKA,wBAVA,cAYA,sCATA,eAFA,YAGA,iBAIA,SADA,UAMA,kBACA,qBAZA,UAYA,CAEA,wLACE,oBACA,2BAMR,yCAME,kIAEA,0BAJA,YADA,cAMA,8BARA,kBACA,WAOA,CAEA,4CACE,gBACA,aACA,kBAGF,gDAUE,6BAJA,sCAMA,8BADA,2BANA,sBAQA,wBACA,8BAVA,YAFA,UAKA,kBACA,qBAPA,kBAcA,6BAZA,WAYA,CAEA,sDACE,WAGF,kEAGE,6BADA,wBADA,UAEA,CAGF,oEACE","sources":["index.css","webui/components/context_editor/style.module.scss","webui/components/map_preview/style.module.scss","webui/components/map_preview/script_preview/styles.module.scss","webui/components/popovers/styles.module.scss","webui/App.module.scss"],"sourcesContent":["@import url(\"https://fonts.googleapis.com/css2?family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@24,400,1,0&family=Russo+One&family=Outfit:wght@500&family=Silkscreen:wght@400;700&family=IBM+Plex+Mono:wght@400&display=swap\");\n\nbody {\n margin: 0;\n}\n",".contextInput {\n overflow-x: hidden;\n overflow-y: scroll;\n height: 100%;\n\n scrollbar-color: var(--palette-fg) transparent;\n scrollbar-width: thin;\n\n & > * {\n padding: 0 8px;\n\n &:first-child {\n margin-top: 48px;\n }\n\n &:last-child {\n margin-bottom: 200px;\n }\n }\n\n .section {\n .subsection {\n &::after {\n content: \" \";\n display: block;\n width: 100%;\n height: 1px;\n margin-bottom: 8px;\n background: var(--palette-fg);\n }\n }\n }\n\n h2 {\n position: sticky;\n top: 0;\n margin: 0;\n margin-bottom: -8px;\n height: 36px;\n line-height: 28px;\n z-index: 2;\n background: linear-gradient(\n 0deg,\n transparent,\n var(--palette-settings-bg) 8px,\n var(--palette-settings-bg)\n );\n }\n\n h3 {\n position: sticky;\n top: 28px;\n margin: 0;\n height: 24px;\n padding-bottom: 8px;\n z-index: 1;\n background: linear-gradient(\n 0deg,\n transparent,\n var(--palette-settings-bg) 8px,\n var(--palette-settings-bg)\n );\n &::before {\n font-family: \"Material Symbols Outlined\";\n content: \"subdirectory_arrow_right\";\n }\n }\n\n p {\n margin: 0;\n }\n\n .inputRow {\n display: flex;\n gap: 8px;\n justify-content: space-between;\n align-items: center;\n margin-bottom: 8px;\n\n > *:not([type=\"range\"]) {\n height: 36px;\n width: 100%;\n line-height: 34px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n padding: 0;\n margin: 0;\n\n color: var(--palette-fg);\n background: none;\n border-radius: 8px;\n font-family: var(--font-body);\n text-align: center;\n }\n\n .icon {\n font-family: \"Material Symbols Outlined\";\n font-size: 24px;\n flex-shrink: 0;\n width: 36px;\n }\n\n .inactive {\n color: var(--palette-lines);\n border-style: dashed;\n }\n\n .invisible {\n opacity: 0;\n }\n\n .override {\n color: black;\n background: yellow;\n }\n\n .seed {\n font-size: 24px;\n }\n\n .showAdvanced {\n display: flex;\n justify-content: center;\n width: 100%;\n height: 24px;\n\n font-size: 18px;\n line-height: 22px;\n }\n\n .curve {\n display: flex;\n height: fit-content;\n flex-direction: column;\n border: none;\n padding: 6px 0;\n gap: 6px;\n }\n\n button {\n cursor: pointer;\n\n &:active {\n background: var(--palette-fg);\n color: black;\n }\n }\n\n input[type=\"range\"] {\n -webkit-appearance: none;\n appearance: none;\n width: 100%;\n cursor: pointer;\n outline: none;\n border-radius: 2px;\n height: 6px;\n background: linear-gradient(\n to right,\n var(--palette-accent) 4px,\n var(--palette-accent) var(--completion),\n var(--palette-fg) var(--completion),\n var(--palette-fg) 100%\n );\n\n &::-webkit-slider-thumb {\n -webkit-appearance: none;\n appearance: none;\n height: 14px;\n width: 8px;\n background-color: var(--palette-accent);\n border-radius: 2px;\n border: none;\n }\n\n &::-moz-range-thumb {\n height: 14px;\n width: 8px;\n background-color: var(--palette-accent);\n border-radius: 2px;\n border: none;\n }\n }\n }\n}\n","@property --pvw-yaw {\n syntax: \"\";\n inherits: true;\n initial-value: 0deg;\n}\n@property --pvw-pitch {\n syntax: \"\";\n inherits: true;\n initial-value: 0deg;\n}\n@property --pvw-tr-x {\n syntax: \"\";\n inherits: true;\n initial-value: 0;\n}\n@property --pvw-tr-y {\n syntax: \"\";\n inherits: true;\n initial-value: 0;\n}\n@property --pvw-scale {\n syntax: \"\";\n inherits: true;\n initial-value: 1;\n}\n\n.cavernPreview {\n position: absolute;\n overflow: hidden;\n width: 100%;\n height: 100%;\n\n display: flex;\n\n // Blueprints\n --pvw-bpak: #222222;\n --pvw-bpck: #2d004b;\n --pvw-bphk: #166921;\n // Paths\n --pvw-pathspan: yellow;\n --pvw-pathaux: #24b136;\n // Entites\n --pvw-entfriend: yellow;\n --pvw-entenemy: red;\n // Default tile overlays\n --pvw-dfluid: #080022;\n --pvw-dfloor: #180032;\n --pvw-dwall: #2d004b;\n // Tile overlays indicating numeric qty (ore, ec, landslideness...)\n --pvw-scale0: #555544;\n --pvw-scale1: #777744;\n --pvw-scale2: #999944;\n --pvw-scale3: #bbbb44;\n --pvw-scale4: #dddd44;\n --pvw-scale5: #ffff44;\n --pvw-scale6: #ffff66;\n --pvw-scale7: #ffff88;\n // Specific tile IDs\n --pvw-tile1: #2d004b;\n --pvw-tile2: #180032;\n --pvw-tile3: #180032;\n --pvw-tile4: #180032;\n --pvw-tile5: #180032;\n --pvw-tile6: #ff5a00;\n --pvw-tile11: #002fb5;\n --pvw-tile12: #166921;\n --pvw-tile14: #bfbfbf;\n --pvw-tile24: #9d9b00;\n --pvw-tile26: #ad59ef;\n --pvw-tile30: #943cc3;\n --pvw-tile34: #731cad;\n --pvw-tile38: #800080;\n --pvw-tile42: #b5ff00;\n --pvw-tile46: #9c4108;\n --pvw-tile50: #ffff00;\n --pvw-tile60: #180032;\n --pvw-tile61: #180032;\n --pvw-tile62: #180032;\n --pvw-tile63: #180032;\n // Cavern Discovery\n --pvw-disco0: #ffff44;\n --pvw-disco1: #882222;\n // Oxygen\n --pvw-oxex: #555533;\n --pvw-oxhc: var(--pvw-tile42);\n\n .mapWrapper {\n position: relative;\n width: 100%;\n\n .map {\n position: absolute;\n transition: transform 500ms linear;\n transform: rotate3d(1, 0, 0, var(--pvw-pitch)) rotate(var(--pvw-yaw))\n matrix(\n var(--pvw-scale),\n 0,\n 0,\n var(--pvw-scale),\n calc(var(--pvw-tr-x) * var(--pvw-scale)),\n calc(var(--pvw-tr-y) * var(--pvw-scale))\n );\n\n &.void {\n transition: none;\n }\n\n .baseplate {\n font-family: var(--font-tiny);\n font-size: 8px;\n\n .fg {\n fill: white;\n }\n\n &.ambiguousKind .bg {\n fill: var(--pvw-bpak);\n }\n\n &.caveKind .bg {\n fill: var(--pvw-bpck);\n }\n\n &.hallKind .bg {\n fill: var(--pvw-bphk);\n }\n }\n\n .path {\n stroke-linecap: round;\n stroke-dasharray: 2, 3;\n\n &.ambiguousKind {\n --fg-color: white;\n --fg-opacity: 0.3;\n }\n\n &.spanningKind {\n --fg-color: var(--pvw-pathspan);\n }\n\n &.auxiliaryKind {\n --fg-color: var(--pvw-pathaux);\n }\n\n & > path {\n stroke: var(--fg-color);\n stroke-opacity: var(--fg-opacity);\n stroke-width: 2px;\n }\n\n & > text {\n fill: var(--fg-color);\n opacity: var(--fg-opacity);\n font-family: var(--font-tiny);\n font-size: 12px;\n }\n }\n\n .plan {\n --color-bg: #444444;\n --color-fg: white;\n &.caveKind .bg {\n stroke-width: 2px;\n fill: none;\n }\n &.hallKind {\n .bg {\n stroke-linecap: round;\n opacity: 0.4;\n }\n &.spanningPathKind {\n --color-fg: var(--pvw-pathspan);\n }\n &.auxiliaryPathKind {\n --color-fg: var(--pvw-pathaux);\n }\n }\n &.fluid6 {\n --color-bg: var(--pvw-tile6);\n }\n &.fluid11 {\n --color-bg: var(--pvw-tile11);\n }\n &.left .label {\n text-anchor: end;\n }\n &.inline .label {\n text-anchor: middle;\n font-size: 6px;\n }\n .label {\n fill: var(--color-fg);\n font-size: 12px;\n }\n .pointer {\n fill: none;\n stroke-width: 1px;\n stroke: var(--color-fg);\n }\n .bg {\n stroke: var(--color-bg);\n }\n }\n\n .pearl {\n &.innerPearl {\n stroke-width: 1px;\n &.caveKind {\n --color0: #40ffff;\n --color1: #40dddd;\n --color2: #40bbbb;\n --color3: #409999;\n }\n &.hallKind {\n --color0: #ffff20;\n --color1: #dddd20;\n --color2: #bbbb20;\n --color3: #999920;\n }\n }\n &.outerPearl {\n stroke-width: 0.5px;\n --color0: #999999;\n --color1: #888888;\n --color2: #777777;\n --color3: #666666;\n }\n .layer {\n &.layer0 {\n stroke: var(--color0);\n }\n &.layer1 {\n stroke: var(--color1);\n }\n &.layer2 {\n stroke: var(--color2);\n }\n &.layer3 {\n stroke: var(--color3);\n }\n }\n }\n\n .tiles {\n shape-rendering: crispEdges;\n .tile {\n transition: fill 500ms ease-out;\n }\n }\n\n .height {\n shape-rendering: crispEdges;\n }\n\n .entity {\n --color-fg: var(--pvw-entfriend);\n &.enemy {\n --color-fg: var(--pvw-entenemy);\n }\n .marker {\n fill: var(--color-fg);\n stroke: black;\n stroke-width: 0.5px;\n }\n .label {\n fill: black;\n font-family: \"Outfit\";\n font-size: 2px;\n text-anchor: middle;\n pointer-events: none;\n }\n }\n\n .openCaveFlag {\n stroke: red;\n fill: white;\n }\n }\n }\n\n .stats {\n position: absolute;\n left: 0;\n bottom: 0;\n color: var(--palette-accent);\n background: var(--palette-bg);\n font-family: var(--font-body);\n font-size: 12px;\n max-width: calc(100% - 200px);\n border: 1px solid var(--palette-settings-bg);\n padding: 4px 14px;\n margin: 16px;\n\n > * {\n margin: 4px 0;\n }\n\n h1 {\n font-family: var(--font-cyber);\n font-size: 18px;\n }\n\n > ul {\n padding: 0;\n\n > li {\n display: inline;\n\n &:not(:first-child) {\n padding-left: 16px;\n }\n }\n }\n }\n\n .error {\n position: absolute;\n left: 0;\n right: 0;\n top: 50%;\n font-size: 24px;\n color: #f18686;\n font-family: var(--font-body);\n text-align: center;\n line-break: anywhere;\n }\n}\n",".script {\n position: relative;\n background: var(--palette-bg);\n border-right: 1px solid var(--palette-settings-bg);\n width: 450px;\n overflow-x: hidden;\n overflow-y: scroll;\n z-index: 1;\n\n > h2 {\n padding: 0 12px;\n }\n\n .src {\n font-family: var(--font-mono);\n font-size: 12px;\n word-wrap: break-word;\n\n .line {\n color: var(--color-codehlt);\n padding: 0 12px;\n\n &.hovered {\n color: black;\n background: var(--color-codehlt);\n }\n }\n }\n}\n\n.scriptOverlay {\n .tile {\n fill: var(--color-codehlt);\n }\n\n .arrow {\n fill: none;\n stroke: var(--color-codehlt);\n stroke-width: 2px;\n }\n\n .arrowhead {\n fill: var(--palette-bg);\n stroke: var(--color-codehlt);\n stroke-width: 2px;\n }\n}\n\n.h3 {\n font-size: 20px;\n font-family: var(--font-body);\n}\n.h4 {\n font-size: 14px;\n font-family: var(--font-body);\n}\n.misc {\n --color-codehlt: var(--palette-fg);\n}\n.condition {\n --color-codehlt: yellow;\n}\n.event {\n --color-codehlt: cyan;\n}\n",".popoverWrapper {\n position: absolute;\n top: 0;\n left: 0;\n bottom: 0;\n right: 0;\n display: flex;\n flex-direction: column;\n justify-content: center;\n\n > div {\n background: var(--palette-bg);\n border: 1px solid var(--palette-settings-bg);\n margin: 0 auto;\n padding: 12px 24px;\n max-width: 500px;\n max-height: calc(100% - 100px);\n overflow-x: hidden;\n overflow-y: scroll;\n\n h1,\n h2,\n h3,\n p {\n margin: 4px 0;\n }\n\n h1,\n h2,\n h3 {\n color: var(--palette-accent);\n }\n\n a,\n button {\n border: none;\n padding: 0;\n font-size: 1em;\n background: none;\n color: var(--palette-accent);\n cursor: pointer;\n font-family: var(--font-body);\n text-decoration: underline;\n }\n\n > ul {\n padding-left: 0;\n }\n\n .subhead {\n font-size: 0.5em;\n }\n\n h3::before {\n font-family: \"Material Symbols Outlined\";\n content: \"subdirectory_arrow_right\";\n }\n\n &.lore {\n p {\n white-space-collapse: preserve-breaks;\n }\n }\n\n &.error {\n --palette-settings-bg: yellow;\n --palette-accent: yellow;\n\n .message {\n white-space: pre;\n }\n\n .stack {\n font-size: 8px;\n white-space: pre;\n }\n\n .context {\n font-size: 8px;\n line-break: anywhere;\n }\n }\n }\n}\n","@keyframes scan-scrim {\n 0% {\n background-position-x: -800px;\n }\n 100% {\n background-position-x: 0;\n }\n}\n\n.App {\n --font-body: \"Outfit\";\n --font-cyber: \"Russo One\";\n --font-tiny: \"Silkscreen\";\n --font-mono: \"IBM Plex Mono\";\n\n --palette-fg: white;\n --palette-bg: #121212;\n --palette-lines: #999999;\n --palette-disabled: #999999;\n --palette-settings-bg: #333333;\n --palette-accent: #c96f12;\n\n &.iceBiome {\n --palette-bg: #060716;\n --palette-settings-bg: hsl(200, 45%, 24%);\n --palette-accent: hsl(186, 97%, 44%);\n }\n\n &.lavaBiome {\n --palette-bg: #140b05;\n --palette-settings-bg: #4d2114;\n --palette-accent: #ca0b0b;\n }\n\n display: flex;\n position: absolute;\n overflow: hidden;\n width: 100%;\n height: 100%;\n\n color: var(--palette-fg);\n background: var(--palette-bg);\n font-family: var(--font-body);\n\n .settingsPanel {\n width: 240px;\n flex-shrink: 0;\n flex-grow: 1;\n background: var(--palette-settings-bg);\n }\n\n .mainPanel {\n position: relative;\n width: 75%;\n overflow: hidden;\n\n .grid {\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background: var(--palette-settings-bg);\n\n &::before {\n content: \"\";\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background-image: linear-gradient(\n to left,\n transparent 0px,\n var(--palette-accent) 25px,\n transparent 400px\n );\n background-size: 800px 100%;\n animation: scan-scrim 3s infinite linear;\n opacity: 0;\n transition: opacity 3000ms ease-in;\n }\n\n &.loading::before {\n opacity: 1;\n transition: opacity 250ms ease-out;\n }\n\n &::after {\n content: \"\";\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background: var(--palette-bg);\n mask-composite: subtract;\n mask-image: linear-gradient(\n to right,\n white 16px,\n transparent 16px,\n transparent 17px,\n white 17px\n ),\n linear-gradient(\n transparent 16px,\n black 16px,\n black 17px,\n transparent 17px\n );\n mask-size: 32px 32px;\n }\n\n &.hasError {\n background: #bebe13;\n mask-image: linear-gradient(\n 120deg,\n white 25%,\n transparent 25%,\n transparent 50%,\n white 50%,\n white 75%,\n transparent 75%,\n transparent 100%\n );\n mask-size: 46.19px 80px;\n\n &::before,\n &::after {\n content: none;\n }\n }\n }\n\n .stepName {\n position: absolute;\n top: 16px;\n left: 16px;\n font-size: 16px;\n font-variant-numeric: tabular-nums;\n }\n\n .progressBar {\n position: absolute;\n width: 100%;\n height: 8px;\n bottom: 0;\n background: linear-gradient(\n 90deg,\n var(--palette-accent) 0%,\n var(--palette-accent) var(--progress),\n transparent var(--progress),\n transparent 100%\n );\n transition: height 200ms ease-out;\n &.complete {\n height: 0;\n }\n }\n\n .controls {\n display: flex;\n gap: 8px;\n margin: 16px;\n position: absolute;\n bottom: 0;\n right: 0;\n\n button,\n .button {\n display: block;\n height: 48px;\n width: 48px;\n font-size: 36px;\n line-height: 46px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n padding: 0;\n margin: 0;\n\n color: var(--palette-fg);\n background: var(--palette-bg);\n font-family: \"Material Symbols Outlined\";\n text-align: center;\n text-decoration: none;\n\n &.disabled {\n border-style: dashed;\n color: var(--palette-lines);\n }\n }\n }\n }\n\n .vizOptsPanel {\n position: relative;\n width: 128px;\n flex-shrink: 0;\n flex-grow: 0;\n\n background-image: linear-gradient(var(--palette-lines) 1px, transparent 1px),\n linear-gradient(to right, var(--palette-lines) 1px, transparent 1px);\n background-size: 16px 16px;\n font-family: var(--font-cyber);\n\n h1 {\n font-weight: normal;\n margin: 4px 0;\n text-align: center;\n }\n\n button {\n position: relative;\n left: -8px;\n width: 152px;\n height: 24px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n margin-bottom: 8px;\n padding: 0 16px 0 8px;\n\n background: var(--palette-bg);\n border-top-left-radius: 8px;\n border-bottom-left-radius: 8px;\n color: var(--palette-fg);\n font-family: var(--font-cyber);\n transition: left 200ms ease-out;\n\n &:hover {\n left: -14px;\n }\n\n &.active {\n left: -16px;\n color: var(--palette-bg);\n background: var(--palette-fg);\n }\n\n &.disabled {\n color: var(--palette-disabled);\n }\n }\n }\n}\n"],"names":[],"sourceRoot":""} \ No newline at end of file diff --git a/static/css/main.59bb2f1c.css.map b/static/css/main.59bb2f1c.css.map deleted file mode 100644 index df09d7b..0000000 --- a/static/css/main.59bb2f1c.css.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"static/css/main.59bb2f1c.css","mappings":"iOAEA,KACE,QACF,CCJA,2BAGE,YAFA,kBACA,kBAGA,wCACA,qBAEA,6BACE,cAEA,wCACE,gBAGF,uCACE,oBAMA,gFAME,6BALA,YACA,cAEA,WACA,kBAFA,UAGA,CAKN,8BAKE,YACA,iBAFA,gBAFA,MAKA,SACA,CAQF,4DARE,iGAPA,uCAsBA,CAPF,8BAIE,YADA,SAEA,mBAHA,SAIA,SACA,CAMA,qCAEE,mCADA,qCACA,CAIJ,6BACE,SAGF,kDAIE,mBAHA,aACA,QACA,8BAEA,kBAEA,qEAUE,gBALA,sCAMA,kBAPA,sBAKA,wBAGA,6BAXA,YAEA,iBAIA,SADA,UAOA,kBAXA,UAWA,CAGF,sEAGE,cAFA,sCACA,eAEA,WAGF,yEAEE,oBADA,0BACA,CAGF,0EACE,UAGF,yEAEE,gBADA,UACA,CAGF,qEACE,eAGF,6EACE,aAKA,eAFA,YAFA,uBAKA,iBAJA,UAIA,CAGF,sEAIE,YAHA,aAEA,sBAGA,QAJA,sEAGA,aACA,CAGF,yDACE,eAEA,gEACE,6BACA,WAIJ,oEACE,wBACA,gBAMA,kKAFA,kBAFA,eAGA,WAFA,aAFA,UAKA,CAQA,0FACE,wBACA,gBAGA,uCAEA,YADA,kBAHA,YACA,SAGA,CAGF,sFAGE,uCAEA,YADA,kBAHA,YACA,SAGA,CCnLR,oBACE,iBACA,cACA,mBAEF,sBACE,iBACA,cACA,mBAEF,qBACE,kBACA,cACA,gBAEF,qBACE,kBACA,cACA,gBAEF,sBACE,kBACA,cACA,gBAGF,4BASE,eAAmB,CACnB,kBAAmB,CACnB,kBAAmB,CAEnB,mBAAsB,CACtB,qBAAsB,CAEtB,oBAAuB,CACvB,kBAAmB,CAEnB,oBAAqB,CACrB,oBAAqB,CACrB,mBAAoB,CAEpB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CACrB,iBAAqB,CAErB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,mBAAoB,CACpB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,mBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,iBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CACrB,oBAAqB,CAErB,iBAAqB,CACrB,iBAAqB,CAErB,eAAmB,CACnB,4BAA4B,CApD5B,aAFA,YAFA,gBADA,kBAEA,UAuD6B,CAE7B,qDACE,kBACA,WAEA,uEACE,kBAEA,uLADA,+BACA,CAUA,yFACE,gBAGF,+FACE,6BACA,cAEA,gHACE,UAGF,2IACE,qBAGF,sIACE,qBAGF,uIACE,qBAIJ,0FACE,qBACA,qBAEA,qHACE,eAAiB,CACjB,gBAAiB,CAGnB,oHACE,8BAA+B,CAGjC,qHACE,6BAA8B,CAGhC,+FACE,uBACA,iCACA,iBAGF,+FACE,qBAEA,6BACA,eAFA,yBAEA,CAIJ,0FACE,eAAmB,CACnB,eAAiB,CACjB,iIACE,iBACA,UAGA,kIACE,qBACA,WAEF,+IACE,8BAA+B,CAEjC,gJACE,6BAA8B,CAGlC,8GACE,2BAA4B,CAE9B,+GACE,4BAA6B,CAE/B,gIACE,gBAEF,kIACE,mBACA,cAEF,8GACE,qBACA,eAEF,iHACE,UACA,iBACA,uBAEF,2GACE,uBAKF,oHACE,iBACA,0IACE,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CAEnB,2IACE,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CACjB,gBAAiB,CAGrB,oHACE,kBACA,aAAiB,CACjB,aAAiB,CACjB,aAAiB,CACjB,aAAiB,CAGjB,oIACE,qBAEF,oIACE,qBAEF,oIACE,qBAEF,oIACE,qBAKN,2FACE,2BACA,8GACE,6BAIJ,4FACE,2BAGF,6FACE,+BAAgC,CAChC,gHACE,8BAA+B,CAEjC,kHACE,qBACA,YACA,kBAEF,iHACE,UAGA,mBAFA,mBACA,cAEA,oBAIJ,kGACE,WACA,UAKN,gDAKE,6BAIA,4CANA,SACA,4BAEA,6BACA,eALA,OASA,YAHA,6BAEA,iBATA,iBAUA,CAEA,kDACE,aAGF,mDACE,8BACA,eAGF,mDACE,UAEA,sDACE,eAEA,wEACE,kBAMR,gDAME,cACA,6BAFA,eAHA,OAOA,oBARA,kBAEA,QAKA,kBAJA,OAKA,CCrUJ,sBAEE,6BACA,kDAEA,kBACA,kBALA,kBAGA,YAGA,UAEA,yBACE,eAGF,yCAGE,qBAFA,6BACA,cACA,CAEA,6DACE,2BACA,eAEA,mFAEE,gCADA,UACA,CAON,mDACE,0BAGF,kDACE,UACA,4BACA,iBAGF,sDACE,uBACA,4BACA,iBAIJ,oBACE,iCAAkC,CAEpC,yBACE,oBAAuB,CAEzB,qBACE,oBAAqB,CCvDvB,8BAIE,SAEA,aACA,sBACA,uBALA,OAFA,kBAIA,QAHA,KAMA,CAEA,kCACE,6BACA,4CACA,cAGA,8BADA,gBAEA,kBACA,kBAJA,iBAIA,CAEA,mJAIE,aAGF,+GAGE,4BAGF,6EAKE,gBAHA,YAIA,4BACA,eACA,6BAJA,cADA,UAMA,0BAGF,qCACE,eAGF,yDACE,eAGF,4CAEE,mCADA,qCACA,CAIA,uDACE,qCAIJ,sDACE,0BAA6B,CAC7B,qBAAwB,CAExB,6EACE,gBAGF,2EACE,cACA,gBAGF,6EACE,cACA,oBC/ER,iCACE,GACE,6BAEF,GACE,yBAIJ,gBACE,oBAAqB,CACrB,wBAAyB,CACzB,wBAAyB,CACzB,2BAA4B,CAE5B,iBAAmB,CACnB,oBAAqB,CACrB,oBAAwB,CACxB,uBAA2B,CAC3B,0BAA8B,CAC9B,wBAAyB,CAqBzB,6BADA,wBANA,aAQA,6BAJA,YAFA,gBADA,kBAEA,UAKA,CApBA,oCACE,oBAAqB,CACrB,6BAAyC,CACzC,wBAAoC,CAGtC,qCACE,oBAAqB,CACrB,6BAA8B,CAC9B,wBAAyB,CAa3B,0CAIE,sCADA,YADA,cADA,WAGA,CAGF,sCAGE,gBAFA,kBACA,SACA,CAEA,uDAOE,sCAFA,SAHA,OADA,kBAGA,QADA,KAIA,CAEA,8DAeE,mDAPA,yFAMA,2BARA,SALA,WAEA,OAaA,UAdA,kBAGA,QADA,MAaA,8BAGF,iFACE,UACA,iCAGF,6DAQE,6BAFA,SALA,WAEA,OAMA,0DACA,8PAaA,gDArBA,kBAGA,QADA,KAmBA,CAGF,2EACE,mBACA,gMAUA,sDAEA,mKAEE,aAKN,2DAKE,6BADA,eACA,kCAFA,UAFA,kBACA,QAGA,CAGF,8DAKE,iIADA,SADA,WAFA,kBAWA,+BAVA,UAUA,CACA,kFACE,SAIJ,2DAKE,SAJA,aACA,QACA,YACA,kBAEA,QAEA,gJAaE,6BALA,sCADA,sBAKA,wBAVA,cAYA,sCATA,eAFA,YAGA,iBAIA,SADA,UAMA,kBACA,qBAZA,UAYA,CAEA,wLACE,oBACA,2BAMR,yCAME,kIAEA,0BAJA,YADA,cAMA,8BARA,kBACA,WAOA,CAEA,4CACE,gBACA,aACA,kBAGF,gDAUE,6BAJA,sCAMA,8BADA,2BANA,sBAQA,wBACA,8BAVA,YAFA,UAKA,kBACA,qBAPA,kBAcA,6BAZA,WAYA,CAEA,sDACE,WAGF,kEAGE,6BADA,wBADA,UAEA,CAGF,oEACE","sources":["index.css","webui/components/context_editor/style.module.scss","webui/components/map_preview/style.module.scss","webui/components/map_preview/script_preview/styles.module.scss","webui/components/popovers/styles.module.scss","webui/App.module.scss"],"sourcesContent":["@import url(\"https://fonts.googleapis.com/css2?family=Material+Symbols+Outlined:opsz,wght,FILL,GRAD@24,400,1,0&family=Russo+One&family=Outfit:wght@500&family=Silkscreen:wght@400;700&family=IBM+Plex+Mono:wght@400&display=swap\");\n\nbody {\n margin: 0;\n}\n",".contextInput {\n overflow-x: hidden;\n overflow-y: scroll;\n height: 100%;\n\n scrollbar-color: var(--palette-fg) transparent;\n scrollbar-width: thin;\n\n & > * {\n padding: 0 8px;\n\n &:first-child {\n margin-top: 48px;\n }\n\n &:last-child {\n margin-bottom: 200px;\n }\n }\n\n .section {\n .subsection {\n &::after {\n content: \" \";\n display: block;\n width: 100%;\n height: 1px;\n margin-bottom: 8px;\n background: var(--palette-fg);\n }\n }\n }\n\n h2 {\n position: sticky;\n top: 0;\n margin: 0;\n margin-bottom: -8px;\n height: 36px;\n line-height: 28px;\n z-index: 2;\n background: linear-gradient(\n 0deg,\n transparent,\n var(--palette-settings-bg) 8px,\n var(--palette-settings-bg)\n );\n }\n\n h3 {\n position: sticky;\n top: 28px;\n margin: 0;\n height: 24px;\n padding-bottom: 8px;\n z-index: 1;\n background: linear-gradient(\n 0deg,\n transparent,\n var(--palette-settings-bg) 8px,\n var(--palette-settings-bg)\n );\n &::before {\n font-family: \"Material Symbols Outlined\";\n content: \"subdirectory_arrow_right\";\n }\n }\n\n p {\n margin: 0;\n }\n\n .inputRow {\n display: flex;\n gap: 8px;\n justify-content: space-between;\n align-items: center;\n margin-bottom: 8px;\n\n > *:not([type=\"range\"]) {\n height: 36px;\n width: 100%;\n line-height: 34px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n padding: 0;\n margin: 0;\n\n color: var(--palette-fg);\n background: none;\n border-radius: 8px;\n font-family: var(--font-body);\n text-align: center;\n }\n\n .icon {\n font-family: \"Material Symbols Outlined\";\n font-size: 24px;\n flex-shrink: 0;\n width: 36px;\n }\n\n .inactive {\n color: var(--palette-lines);\n border-style: dashed;\n }\n\n .invisible {\n opacity: 0;\n }\n\n .override {\n color: black;\n background: yellow;\n }\n\n .seed {\n font-size: 24px;\n }\n\n .showAdvanced {\n display: flex;\n justify-content: center;\n width: 100%;\n height: 24px;\n\n font-size: 18px;\n line-height: 22px;\n }\n\n .curve {\n display: flex;\n height: fit-content;\n flex-direction: column;\n border: none;\n padding: 6px 0;\n gap: 6px;\n }\n\n button {\n cursor: pointer;\n\n &:active {\n background: var(--palette-fg);\n color: black;\n }\n }\n\n input[type=\"range\"] {\n -webkit-appearance: none;\n appearance: none;\n width: 100%;\n cursor: pointer;\n outline: none;\n border-radius: 2px;\n height: 6px;\n background: linear-gradient(\n to right,\n var(--palette-accent) 4px,\n var(--palette-accent) var(--completion),\n var(--palette-fg) var(--completion),\n var(--palette-fg) 100%\n );\n\n &::-webkit-slider-thumb {\n -webkit-appearance: none;\n appearance: none;\n height: 14px;\n width: 8px;\n background-color: var(--palette-accent);\n border-radius: 2px;\n border: none;\n }\n\n &::-moz-range-thumb {\n height: 14px;\n width: 8px;\n background-color: var(--palette-accent);\n border-radius: 2px;\n border: none;\n }\n }\n }\n}\n","@property --pvw-yaw {\n syntax: \"\";\n inherits: true;\n initial-value: 0deg;\n}\n@property --pvw-pitch {\n syntax: \"\";\n inherits: true;\n initial-value: 0deg;\n}\n@property --pvw-tr-x {\n syntax: \"\";\n inherits: true;\n initial-value: 0;\n}\n@property --pvw-tr-y {\n syntax: \"\";\n inherits: true;\n initial-value: 0;\n}\n@property --pvw-scale {\n syntax: \"\";\n inherits: true;\n initial-value: 1;\n}\n\n.cavernPreview {\n position: absolute;\n overflow: hidden;\n width: 100%;\n height: 100%;\n\n display: flex;\n\n // Blueprints\n --pvw-bpak: #222222;\n --pvw-bpck: #2d004b;\n --pvw-bphk: #166921;\n // Paths\n --pvw-pathspan: yellow;\n --pvw-pathaux: #24b136;\n // Entites\n --pvw-entfriend: yellow;\n --pvw-entenemy: red;\n // Default tile overlays\n --pvw-dfluid: #080022;\n --pvw-dfloor: #180032;\n --pvw-dwall: #2d004b;\n // Tile overlays indicating numeric qty (ore, ec, landslideness...)\n --pvw-scale0: #555544;\n --pvw-scale1: #777744;\n --pvw-scale2: #999944;\n --pvw-scale3: #bbbb44;\n --pvw-scale4: #dddd44;\n --pvw-scale5: #ffff44;\n --pvw-scale6: #ffff66;\n --pvw-scale7: #ffff88;\n // Specific tile IDs\n --pvw-tile1: #2d004b;\n --pvw-tile2: #180032;\n --pvw-tile3: #180032;\n --pvw-tile4: #180032;\n --pvw-tile5: #180032;\n --pvw-tile6: #ff5a00;\n --pvw-tile11: #002fb5;\n --pvw-tile12: #166921;\n --pvw-tile14: #bfbfbf;\n --pvw-tile24: #9d9b00;\n --pvw-tile26: #ad59ef;\n --pvw-tile30: #943cc3;\n --pvw-tile34: #731cad;\n --pvw-tile38: #800080;\n --pvw-tile42: #b5ff00;\n --pvw-tile46: #9c4108;\n --pvw-tile50: #ffff00;\n --pvw-tile60: #180032;\n --pvw-tile61: #180032;\n --pvw-tile62: #180032;\n --pvw-tile63: #180032;\n // Cavern Discovery\n --pvw-disco0: #ffff44;\n --pvw-disco1: #882222;\n // Oxygen\n --pvw-oxex: #555533;\n --pvw-oxhc: var(--pvw-tile42);\n\n .mapWrapper {\n position: relative;\n width: 100%;\n\n .map {\n position: absolute;\n transition: transform 500ms linear;\n transform: rotate3d(1, 0, 0, var(--pvw-pitch)) rotate(var(--pvw-yaw))\n matrix(\n var(--pvw-scale),\n 0,\n 0,\n var(--pvw-scale),\n calc(var(--pvw-tr-x) * var(--pvw-scale)),\n calc(var(--pvw-tr-y) * var(--pvw-scale))\n );\n\n &.void {\n transition: none;\n }\n\n .baseplate {\n font-family: var(--font-tiny);\n font-size: 8px;\n\n .fg {\n fill: white;\n }\n\n &.ambiguousKind .bg {\n fill: var(--pvw-bpak);\n }\n\n &.caveKind .bg {\n fill: var(--pvw-bpck);\n }\n\n &.hallKind .bg {\n fill: var(--pvw-bphk);\n }\n }\n\n .path {\n stroke-linecap: round;\n stroke-dasharray: 2, 3;\n\n &.ambiguousKind {\n --fg-color: white;\n --fg-opacity: 0.3;\n }\n\n &.spanningKind {\n --fg-color: var(--pvw-pathspan);\n }\n\n &.auxiliaryKind {\n --fg-color: var(--pvw-pathaux);\n }\n\n & > path {\n stroke: var(--fg-color);\n stroke-opacity: var(--fg-opacity);\n stroke-width: 2px;\n }\n\n & > text {\n fill: var(--fg-color);\n opacity: var(--fg-opacity);\n font-family: var(--font-tiny);\n font-size: 12px;\n }\n }\n\n .plan {\n --color-bg: #444444;\n --color-fg: white;\n &.caveKind .bg {\n stroke-width: 2px;\n fill: none;\n }\n &.hallKind {\n .bg {\n stroke-linecap: round;\n opacity: 0.4;\n }\n &.spanningPathKind {\n --color-fg: var(--pvw-pathspan);\n }\n &.auxiliaryPathKind {\n --color-fg: var(--pvw-pathaux);\n }\n }\n &.fluid6 {\n --color-bg: var(--pvw-tile6);\n }\n &.fluid11 {\n --color-bg: var(--pvw-tile11);\n }\n &.left .label {\n text-anchor: end;\n }\n &.inline .label {\n text-anchor: middle;\n font-size: 6px;\n }\n .label {\n fill: var(--color-fg);\n font-size: 12px;\n }\n .pointer {\n fill: none;\n stroke-width: 1px;\n stroke: var(--color-fg);\n }\n .bg {\n stroke: var(--color-bg);\n }\n }\n\n .pearl {\n &.innerPearl {\n stroke-width: 1px;\n &.caveKind {\n --color0: #40ffff;\n --color1: #40dddd;\n --color2: #40bbbb;\n --color3: #409999;\n }\n &.hallKind {\n --color0: #ffff20;\n --color1: #dddd20;\n --color2: #bbbb20;\n --color3: #999920;\n }\n }\n &.outerPearl {\n stroke-width: 0.5px;\n --color0: #999999;\n --color1: #888888;\n --color2: #777777;\n --color3: #666666;\n }\n .layer {\n &.layer0 {\n stroke: var(--color0);\n }\n &.layer1 {\n stroke: var(--color1);\n }\n &.layer2 {\n stroke: var(--color2);\n }\n &.layer3 {\n stroke: var(--color3);\n }\n }\n }\n\n .tiles {\n shape-rendering: crispEdges;\n .tile {\n transition: fill 500ms ease-out;\n }\n }\n\n .height {\n shape-rendering: crispEdges;\n }\n\n .entity {\n --color-fg: var(--pvw-entfriend);\n &.enemy {\n --color-fg: var(--pvw-entenemy);\n }\n .marker {\n fill: var(--color-fg);\n stroke: black;\n stroke-width: 0.5px;\n }\n .label {\n fill: black;\n font-family: \"Outfit\";\n font-size: 2px;\n text-anchor: middle;\n pointer-events: none;\n }\n }\n\n .openCaveFlag {\n stroke: red;\n fill: white;\n }\n }\n }\n\n .stats {\n position: absolute;\n left: 0;\n bottom: 0;\n color: var(--palette-accent);\n background: var(--palette-bg);\n font-family: var(--font-body);\n font-size: 12px;\n max-width: calc(100% - 200px);\n border: 1px solid var(--palette-settings-bg);\n padding: 4px 14px;\n margin: 16px;\n\n > * {\n margin: 4px 0;\n }\n\n h1 {\n font-family: var(--font-cyber);\n font-size: 18px;\n }\n\n > ul {\n padding: 0;\n\n > li {\n display: inline;\n\n &:not(:first-child) {\n padding-left: 16px;\n }\n }\n }\n }\n\n .error {\n position: absolute;\n left: 0;\n right: 0;\n top: 50%;\n font-size: 24px;\n color: #f18686;\n font-family: var(--font-body);\n text-align: center;\n line-break: anywhere;\n }\n}\n",".script {\n position: relative;\n background: var(--palette-bg);\n border-right: 1px solid var(--palette-settings-bg);\n width: 450px;\n overflow-x: hidden;\n overflow-y: scroll;\n z-index: 1;\n\n > h2 {\n padding: 0 12px;\n }\n\n .src {\n font-family: var(--font-mono);\n font-size: 12px;\n word-wrap: break-word;\n\n .line {\n color: var(--color-codehlt);\n padding: 0 12px;\n\n &.hovered {\n color: black;\n background: var(--color-codehlt);\n }\n }\n }\n}\n\n.scriptOverlay {\n .tile {\n fill: var(--color-codehlt);\n }\n\n .arrow {\n fill: none;\n stroke: var(--color-codehlt);\n stroke-width: 2px;\n }\n\n .arrowhead {\n fill: var(--palette-bg);\n stroke: var(--color-codehlt);\n stroke-width: 2px;\n }\n}\n\n.misc {\n --color-codehlt: var(--palette-fg);\n}\n.condition {\n --color-codehlt: yellow;\n}\n.event {\n --color-codehlt: cyan;\n}\n",".popoverWrapper {\n position: absolute;\n top: 0;\n left: 0;\n bottom: 0;\n right: 0;\n display: flex;\n flex-direction: column;\n justify-content: center;\n\n > div {\n background: var(--palette-bg);\n border: 1px solid var(--palette-settings-bg);\n margin: 0 auto;\n padding: 12px 24px;\n max-width: 500px;\n max-height: calc(100% - 100px);\n overflow-x: hidden;\n overflow-y: scroll;\n\n h1,\n h2,\n h3,\n p {\n margin: 4px 0;\n }\n\n h1,\n h2,\n h3 {\n color: var(--palette-accent);\n }\n\n a,\n button {\n border: none;\n padding: 0;\n font-size: 1em;\n background: none;\n color: var(--palette-accent);\n cursor: pointer;\n font-family: var(--font-body);\n text-decoration: underline;\n }\n\n > ul {\n padding-left: 0;\n }\n\n .subhead {\n font-size: 0.5em;\n }\n\n h3::before {\n font-family: \"Material Symbols Outlined\";\n content: \"subdirectory_arrow_right\";\n }\n\n &.lore {\n p {\n white-space-collapse: preserve-breaks;\n }\n }\n\n &.error {\n --palette-settings-bg: yellow;\n --palette-accent: yellow;\n\n .message {\n white-space: pre;\n }\n\n .stack {\n font-size: 8px;\n white-space: pre;\n }\n\n .context {\n font-size: 8px;\n line-break: anywhere;\n }\n }\n }\n}\n","@keyframes scan-scrim {\n 0% {\n background-position-x: -800px;\n }\n 100% {\n background-position-x: 0;\n }\n}\n\n.App {\n --font-body: \"Outfit\";\n --font-cyber: \"Russo One\";\n --font-tiny: \"Silkscreen\";\n --font-mono: \"IBM Plex Mono\";\n\n --palette-fg: white;\n --palette-bg: #121212;\n --palette-lines: #999999;\n --palette-disabled: #999999;\n --palette-settings-bg: #333333;\n --palette-accent: #c96f12;\n\n &.iceBiome {\n --palette-bg: #060716;\n --palette-settings-bg: hsl(200, 45%, 24%);\n --palette-accent: hsl(186, 97%, 44%);\n }\n\n &.lavaBiome {\n --palette-bg: #140b05;\n --palette-settings-bg: #4d2114;\n --palette-accent: #ca0b0b;\n }\n\n display: flex;\n position: absolute;\n overflow: hidden;\n width: 100%;\n height: 100%;\n\n color: var(--palette-fg);\n background: var(--palette-bg);\n font-family: var(--font-body);\n\n .settingsPanel {\n width: 240px;\n flex-shrink: 0;\n flex-grow: 1;\n background: var(--palette-settings-bg);\n }\n\n .mainPanel {\n position: relative;\n width: 75%;\n overflow: hidden;\n\n .grid {\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background: var(--palette-settings-bg);\n\n &::before {\n content: \"\";\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background-image: linear-gradient(\n to left,\n transparent 0px,\n var(--palette-accent) 25px,\n transparent 400px\n );\n background-size: 800px 100%;\n animation: scan-scrim 3s infinite linear;\n opacity: 0;\n transition: opacity 3000ms ease-in;\n }\n\n &.loading::before {\n opacity: 1;\n transition: opacity 250ms ease-out;\n }\n\n &::after {\n content: \"\";\n position: absolute;\n left: 0;\n top: 0;\n right: 0;\n bottom: 0;\n\n background: var(--palette-bg);\n mask-composite: subtract;\n mask-image: linear-gradient(\n to right,\n white 16px,\n transparent 16px,\n transparent 17px,\n white 17px\n ),\n linear-gradient(\n transparent 16px,\n black 16px,\n black 17px,\n transparent 17px\n );\n mask-size: 32px 32px;\n }\n\n &.hasError {\n background: #bebe13;\n mask-image: linear-gradient(\n 120deg,\n white 25%,\n transparent 25%,\n transparent 50%,\n white 50%,\n white 75%,\n transparent 75%,\n transparent 100%\n );\n mask-size: 46.19px 80px;\n\n &::before,\n &::after {\n content: none;\n }\n }\n }\n\n .stepName {\n position: absolute;\n top: 16px;\n left: 16px;\n font-size: 16px;\n font-variant-numeric: tabular-nums;\n }\n\n .progressBar {\n position: absolute;\n width: 100%;\n height: 8px;\n bottom: 0;\n background: linear-gradient(\n 90deg,\n var(--palette-accent) 0%,\n var(--palette-accent) var(--progress),\n transparent var(--progress),\n transparent 100%\n );\n transition: height 200ms ease-out;\n &.complete {\n height: 0;\n }\n }\n\n .controls {\n display: flex;\n gap: 8px;\n margin: 16px;\n position: absolute;\n bottom: 0;\n right: 0;\n\n button,\n .button {\n display: block;\n height: 48px;\n width: 48px;\n font-size: 36px;\n line-height: 46px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n padding: 0;\n margin: 0;\n\n color: var(--palette-fg);\n background: var(--palette-bg);\n font-family: \"Material Symbols Outlined\";\n text-align: center;\n text-decoration: none;\n\n &.disabled {\n border-style: dashed;\n color: var(--palette-lines);\n }\n }\n }\n }\n\n .vizOptsPanel {\n position: relative;\n width: 128px;\n flex-shrink: 0;\n flex-grow: 0;\n\n background-image: linear-gradient(var(--palette-lines) 1px, transparent 1px),\n linear-gradient(to right, var(--palette-lines) 1px, transparent 1px);\n background-size: 16px 16px;\n font-family: var(--font-cyber);\n\n h1 {\n font-weight: normal;\n margin: 4px 0;\n text-align: center;\n }\n\n button {\n position: relative;\n left: -8px;\n width: 152px;\n height: 24px;\n box-sizing: border-box;\n border: 1px solid var(--palette-lines);\n margin-bottom: 8px;\n padding: 0 16px 0 8px;\n\n background: var(--palette-bg);\n border-top-left-radius: 8px;\n border-bottom-left-radius: 8px;\n color: var(--palette-fg);\n font-family: var(--font-cyber);\n transition: left 200ms ease-out;\n\n &:hover {\n left: -14px;\n }\n\n &.active {\n left: -16px;\n color: var(--palette-bg);\n background: var(--palette-fg);\n }\n\n &.disabled {\n color: var(--palette-disabled);\n }\n }\n }\n}\n"],"names":[],"sourceRoot":""} \ No newline at end of file diff --git a/static/js/main.b497b6ff.js.map b/static/js/main.b497b6ff.js.map deleted file mode 100644 index ec30826..0000000 --- a/static/js/main.b497b6ff.js.map +++ /dev/null @@ -1 +0,0 @@ -{"version":3,"file":"static/js/main.b497b6ff.js","mappings":";yCA+CA,IAAIA,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YC9BjB,IAAII,EAAU,CACb,WAgCD,SAAwBC,EAAKC,GAC5B,OAAOD,EAAIE,IAAKD,EACjB,EAjCC,UA2DD,SAAuBD,EAAKC,GAC3B,OAAOD,EAAIE,IAAKD,EACjB,EA5DC,QAuFD,SAAuBD,EAAKC,GAC3B,OAAOD,EAAIE,IAAKD,EACjB,GAwCAJ,EAAOC,QAXP,SAAiBK,GAChB,IAAIC,EAAIL,EAASI,GACjB,MAAkB,oBAANC,EACJA,EAEDL,EAAQM,OAChB,kBCnGA,IAAIV,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCjCjB,IAAIW,EAAU,CACb,WAkCD,SAAwBN,EAAKC,EAAKM,GACjCP,EAAIQ,IAAKD,EAAON,EACjB,EAnCC,UA+DD,SAAuBD,EAAKC,EAAKM,GAChCP,EAAIQ,IAAKD,EAAON,EACjB,EAhEC,QA6FD,SAAuBD,EAAKC,EAAKM,GAChCP,EAAIQ,IAAKD,EAAON,EACjB,GA2CAJ,EAAOC,QAXP,SAAiBK,GAChB,IAAIC,EAAIE,EAASH,GACjB,MAAkB,oBAANC,EACJA,EAEDE,EAAQD,OAChB,kBC5HA,IAAIV,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAIc,EAAkBb,EAAS,MAC3Bc,EAASd,EAAS,MAClBe,EAASf,EAAS,MAClBgB,EAAiBhB,EAAS,MAC1BiB,EAAiBjB,EAAS,MAC1BO,EAAQP,EAAS,KAqDrBC,EAAOC,QA3BP,SAA2BgB,GAC1B,IAAIC,EAAKZ,EAAOW,GAChB,OAAKL,EAAiBK,GACd,CACN,KAAQA,EACR,MAASC,EACT,kBAAoB,EACpB,UAAa,CACZH,EAAgBG,GAChBF,EAAgBE,KAIZ,CACN,KAAQD,EACR,MAASC,EACT,kBAAoB,EACpB,UAAa,CACZL,EAAQK,GACRJ,EAAQI,IAGX,kBCrCA,IAAIpB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCrBjB,IAAIqB,EAAO,WA4BXnB,EAAOC,QAPP,SAA0BS,GACzB,cAAgBA,EAAML,MAAQc,UAAeT,EAAMC,MAAQQ,CAC5D,kBCPA,IAAIrB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCYjBE,EAAOC,QAbP,SAA4BS,GAE3B,MACkB,kBAAVA,GACG,OAAVA,GAC2B,oBAA3BA,EAAMU,YAAYC,MAzBI,KA0BtBX,EAAMY,iBAER,kBCZA,IAAIxB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCYjBE,EAAOC,QAbP,SAA2BS,GAE1B,MACkB,kBAAVA,GACG,OAAVA,GAC2B,mBAA3BA,EAAMU,YAAYC,MAzBI,IA0BtBX,EAAMY,iBAER,kBCZA,IAAIxB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCrBjB,IAAII,EAAU,CACb,QAgCD,SAAqBC,EAAKC,GACzB,OAAOD,EAAKC,EACb,EAjCC,QAmDD,SAAqBD,EAAKC,GACzB,OAAOD,EAAKC,EACb,EApDC,MAsED,SAAmBD,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAvEC,MAyFD,SAAmBD,EAAKC,GACvB,OAAOD,EAAKC,EACb,EA1FC,KA4GD,SAAkBD,EAAKC,GACtB,OAAOD,EAAKC,EACb,EA7GC,OA+HD,SAAoBD,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAhIC,OAkJD,SAAoBD,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAnJC,MAqKD,SAAmBD,EAAKC,GACvB,OAAOD,EAAKC,EACb,EAtKC,OAwLD,SAAoBD,EAAKC,GACxB,OAAOD,EAAKC,EACb,EAzLC,QAyMD,SAAqBD,EAAKC,GACzB,OAAOD,EAAKC,EACb,EA1MC,QA0ND,SAAuBD,EAAKC,GAC3B,OAAOD,EAAKC,EACb,GA+BAJ,EAAOC,QAXP,SAAiBK,GAChB,IAAIC,EAAIL,EAASI,GACjB,MAAkB,oBAANC,EACJA,EAEDL,EAAQM,OAChB,kBC/OA,IAAIV,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCvBjB,IAAIW,EAAU,CACb,QAkCD,SAAqBN,EAAKC,EAAKM,GAC9BP,EAAKC,GAAQM,CACd,EAnCC,QAuDD,SAAqBP,EAAKC,EAAKM,GAC9BP,EAAKC,GAAQM,CACd,EAxDC,MA4ED,SAAmBP,EAAKC,EAAKM,GAC5BP,EAAKC,GAAQM,CACd,EA7EC,MAiGD,SAAmBP,EAAKC,EAAKM,GAC5BP,EAAKC,GAAQM,CACd,EAlGC,KAsHD,SAAkBP,EAAKC,EAAKM,GAC3BP,EAAKC,GAAQM,CACd,EAvHC,OA2ID,SAAoBP,EAAKC,EAAKM,GAC7BP,EAAKC,GAAQM,CACd,EA5IC,OAgKD,SAAoBP,EAAKC,EAAKM,GAC7BP,EAAKC,GAAQM,CACd,EAjKC,MAqLD,SAAmBP,EAAKC,EAAKM,GAC5BP,EAAKC,GAAQM,CACd,EAtLC,OA0MD,SAAoBP,EAAKC,EAAKM,GAC7BP,EAAKC,GAAQM,CACd,EA3MC,QA6ND,SAAqBP,EAAKC,EAAKM,GAC9BP,EAAKC,GAAQM,CACd,EA9NC,QAgPD,SAAuBP,EAAKC,EAAKM,GAChCP,EAAKC,GAAQM,CACd,GAiCAV,EAAOC,QAXP,SAAiBK,GAChB,IAAIC,EAAIE,EAASH,GACjB,MAAkB,oBAANC,EACJA,EAEDE,EAAQD,OAChB,kBCzRA,IAAIe,EAAgBxB,EAAS,MACzByB,EAAOzB,EAAS,MAChB0B,EAAO1B,EAAS,MAoCpBC,EAAOC,QAvBP,SAAoByB,EAAKvB,GACxB,IAAIwB,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAMxB,EAAI4B,OACVD,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIzB,EAAK0B,IACHN,EAAeK,GACpB,OAAO,KAERF,EAAKI,GAAMN,EAAMI,GACjBF,EAAKI,EAAE,GAAML,EAAMG,GACnBE,GAAK,CACN,CACA,OAAOJ,CACR,kBCjCA,IAAIM,EAAoBjC,EAAS,MAC7BwB,EAAgBxB,EAAS,MACzBkC,EAASlC,EAAS,MAClByB,EAAOzB,EAAS,MAChB0B,EAAO1B,EAAS,MAsCpBC,EAAOC,QA1BP,SAAuBiC,GACtB,IAAIC,EACAP,EACAQ,EAGJ,IADAD,EAAM,KAELP,EAAIM,EAAGG,QACAC,MAIP,GADAF,EAAIR,EAAElB,MACDsB,EAAmBI,IAAOA,EAAEL,QAAU,EAC1CI,EAAII,KAAMH,EAAG,GAAKA,EAAG,QACf,KAAKb,EAAea,GAG1B,OAAO,IAAII,UAAWP,EAAQ,kJAAmJG,IAFjLD,EAAII,KAAMf,EAAMY,GAAKX,EAAMW,GAG5B,CAED,OAAOD,CACR,kBCrCA,IAAIH,EAAoBjC,EAAS,MAC7BwB,EAAgBxB,EAAS,MACzBkC,EAASlC,EAAS,MAClByB,EAAOzB,EAAS,MAChB0B,EAAO1B,EAAS,MA2CpBC,EAAOC,QA7BP,SAA0BiC,EAAIO,EAAMC,GACnC,IAAIP,EACAP,EACAQ,EACAP,EAIJ,IAFAM,EAAM,GACNN,GAAK,IAEJD,EAAIM,EAAGG,QACAC,MAKP,GAFAT,GAAK,EACLO,EAAIK,EAAKE,KAAMD,EAASd,EAAElB,MAAOmB,GAC5BG,EAAmBI,IAAOA,EAAEL,QAAU,EAC1CI,EAAII,KAAMH,EAAG,GAAKA,EAAG,QACf,KAAKb,EAAea,GAG1B,OAAO,IAAII,UAAWP,EAAQ,+IAAgJG,IAF9KD,EAAII,KAAMf,EAAMY,GAAKX,EAAMW,GAG5B,CAED,OAAOD,CACR,iBCwBA,IAAIrC,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCrEjB,IAAI8C,EAAuB7C,EAAAA,MAAAA,YACvBiC,EAAoBjC,EAAS,MAC7B8C,EAAe9C,EAAS,MACxB+C,EAAgB/C,EAAS,MACzBgD,EAAWhD,EAAS,MACpBiD,EAAUjD,EAAS,KACnBkD,EAAWlD,EAAS,MACpBmD,EAAanD,EAAS,MACtBwB,EAAgBxB,EAAS,MACzBoD,EAASpD,EAAS,MAClBqD,EAAYrD,EAAS,KACrBsD,EAAmBtD,EAAS,MAC5BuD,EAAoBvD,EAAS,MAC7BwD,EAA2BxD,EAAS,MACpCyD,EAAkBzD,EAAS,MAC3B0D,EAAc1D,EAAS,KACvB2D,EAAsB3D,EAAS,MAC/B4D,EAAe5D,EAAS,MACxB6D,EAAa7D,EAAS,MACtByB,EAAOzB,EAAS,MAChB0B,EAAO1B,EAAS,MAChB8D,EAAQ9D,EAAS,MACjB+D,EAAgB/D,EAAS,MACzBgE,EAAiBhE,EAAS,MAC1Bc,EAASd,EAAS,MAClBgB,EAAiBhB,EAAS,MAC1BkC,EAASlC,EAAS,MAClBiE,EAAejE,EAAS,MACxBkE,EAAkBlE,EAAS,MAC3BmE,EAAYnE,EAAS,MAKrBuB,EAAqD,EAAjCqC,EAAarC,kBACjC6C,EAAsBZ,IAY1B,SAASa,EAAgB1D,GACxB,OACCA,aAAiB2D,GAEC,kBAAV3D,GACG,OAAVA,IAE4B,mBAA3BA,EAAMU,YAAYC,MACS,oBAA3BX,EAAMU,YAAYC,OAEM,kBAAlBX,EAAM4D,SAGY,kBAAlB5D,EAAM6D,OAGhB,CASA,SAASC,EAA2B9D,GACnC,OACCA,IAAU2D,GAGK,mBAAf3D,EAAMW,IAER,CAUA,SAASoD,EAAe/C,EAAKtB,GAE5B,OAAO,IAAIwD,EAAYlC,EADvBtB,GAAO,GAC4BsB,EAAKtB,EAAI,GAC7C,CAyEA,SAASiE,IACR,IAAIK,EACAC,EACAjD,EACAC,EAGJ,GADAgD,EAAQC,UAAU7C,SACX8C,gBAAgBR,GACtB,OAAe,IAAVM,EACG,IAAIN,EAEG,IAAVM,EACG,IAAIN,EAAiBO,UAAU,IAExB,IAAVD,EACG,IAAIN,EAAiBO,UAAU,GAAIA,UAAU,IAE9C,IAAIP,EAAiBO,UAAU,GAAIA,UAAU,GAAIA,UAAU,IAGnE,GAAe,IAAVD,EACJjD,EAAM,IAAIiC,EAAc,QAClB,GAAe,IAAVgB,EACX,GAAK/B,EAAsBgC,UAAU,IACpClD,EAAM,IAAIiC,EAA2B,EAAbiB,UAAU,SAC5B,GAAK/B,EAAc+B,UAAU,IAKnC,IAHAjD,GADAD,EAAMkD,UAAW,IACP7C,SAGEiB,EAAStB,IAASH,EAAeG,EAAI,KAEhD,GAAa,QADbA,EAAMwC,EAAW,IAAIP,EAAkB,EAAJhC,GAASD,IACxB,CAEnB,IAAMyB,EAAQxB,GACb,MAAM,IAAImD,WAAY7C,EAAQ,6GAA8GN,IAG7ID,EAAM,IAAIiC,EAAciB,UAAU,GACnC,MACM,CACN,GAAKvB,EAAkB3B,GACtBA,EAAMoC,EAAepC,EAAK,QACpB,GAAK4B,EAAmB5B,GAC9BA,EAAMqC,EAAgBrC,EAAK,QACrB,IAAMyB,EAAQxB,GACpB,MAAM,IAAImD,WAAY7C,EAAQ,6HAA8HN,IAE7JD,EAAM,IAAIiC,EAAcjC,EACzB,MACM,GAAKoB,EAAe8B,UAAU,IAAO,CAE3C,IAAMxB,GADN1B,EAAMkD,UAAW,IACIG,WAAWzD,GAC/B,MAAM,IAAIwD,WAAY7C,EAAQ,yFAA0FX,EAAmBI,EAAIqD,aAEhJrD,EAAM,IAAIiC,EAAcjC,EACzB,KAAO,KAAKqB,EAAU6B,UAAU,IAkB/B,MAAM,IAAIpC,UAAWP,EAAQ,qHAAsH2C,UAAU,KAhB7J,GADAlD,EAAMkD,UAAW,IACY,IAAxBT,EACJ,MAAM,IAAI3B,UAAWP,EAAQ,mJAAoJP,IAElL,IAAMwB,EAAYxB,EAAK8B,IACtB,MAAM,IAAIhB,UAAWP,EAAQ,qHAAsHP,IAGpJ,GADAA,EAAMA,EAAK8B,MACLN,EAAYxB,EAAIW,MACrB,MAAM,IAAIG,UAAWP,EAAQ,qHAAsHP,IAGpJ,IADAA,EAAMsC,EAActC,cACAsD,MACnB,MAAMtD,EAEPA,EAAM,IAAIiC,EAAcjC,EAGzB,KACM,CAEN,IAAMoB,EADNpB,EAAMkD,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,wEAAyEP,IAGvG,IAAMkB,EADN8B,EAAaE,UAAW,IAEvB,MAAM,IAAIpC,UAAWP,EAAQ,4EAA6EyC,IAE3G,IAAMtB,EAAWsB,EAAWpD,GAC3B,MAAM,IAAIwD,WAAY7C,EAAQ,uEAAwEX,EAAmBoD,IAE1H,GAAe,IAAVC,EAAc,CAElB,GADAhD,EAAMD,EAAIqD,WAAaL,GACjBtB,EAAWzB,EAAIL,GACpB,MAAM,IAAIwD,WAAY7C,EAAQ,oGAAqGX,EAAmBK,IAEvJD,EAAM,IAAIiC,EAAcjC,EAAKgD,EAC9B,KAAO,CAEN,IAAM9B,EADNjB,EAAMiD,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,uEAAwEN,IAEtG,GAAMA,EAAIL,EAAsBI,EAAIqD,WAAWL,EAC9C,MAAM,IAAII,WAAY7C,EAAQ,iJAAkJN,EAAIL,IAErLI,EAAM,IAAIiC,EAAcjC,EAAKgD,EAAgB,EAAJ/C,EAC1C,CACD,CAIA,OAHA8B,EAAaoB,KAAM,UAAWnD,GAC9B+B,EAAaoB,KAAM,UAAWnD,EAAIK,OAAO,GAElC8C,IACR,CAeApB,EAAaY,EAAiB,oBAAqB/C,GAenDmC,EAAaY,EAAiB,OAAQ,mBAmDtCZ,EAAaY,EAAiB,QAAQ,SAAeY,GACpD,IAAIvC,EACAiC,EACAlC,EACAN,EACAT,EACAwD,EACA7E,EACAsB,EACAwD,EACAvD,EACAC,EACAC,EACJ,IAAMoB,EAAY2B,MACjB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMgC,EAA2BK,MAChC,MAAM,IAAIrC,UAAW,6DAGtB,IADAmC,EAAQC,UAAU7C,QACL,EAAI,CAEhB,IAAMmB,EADNT,EAAOmC,UAAW,IAEjB,MAAM,IAAIpC,UAAWP,EAAQ,qEAAsEQ,IAE/FkC,EAAQ,IACZjC,EAAUkC,UAAW,GAEvB,CACA,GAAKR,EAAgBa,GAAQ,CAE5B,GADAtD,EAAMsD,EAAIlD,OACLU,EAAO,CAIX,IAFAf,GADAS,EAAM,IAAI0C,KAAMlD,IACN4C,QACVzC,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIa,EAAKE,KAAMD,EAASuC,EAAI5E,IAAKwB,GAAKA,GACjCN,EAAeK,GACnBF,EAAKI,GAAMN,EAAMI,GACjBF,EAAKI,EAAE,GAAML,EAAMG,OACb,MAAKI,EAAmBJ,IAAOA,EAAEG,QAAU,GAIjD,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7KF,EAAKI,GAAMF,EAAG,GACdF,EAAKI,EAAE,GAAMF,EAAG,EAGjB,CACAE,GAAK,CACN,CACA,OAAOK,CACR,CACA,OAAO,IAAI0C,KAAMI,EAClB,CACA,GAAKpC,EAAcoC,GAAQ,CAC1B,GAAKxC,EAAO,CAUX,IAPAd,EAAMsD,EAAIlD,OAET1B,EADI4E,EAAI5E,KAAO4E,EAAItE,IACbI,EAAgB,WAEhBF,EAAQ,WAGTgB,EAAI,EAAGA,EAAIF,EAAKE,IACrB,IAAMN,EAAelB,EAAK4E,EAAKpD,IAAQ,CACtCsD,GAAM,EACN,KACD,CAGD,GAAKA,EAAM,CACV,IAAMhC,EAAQxB,GACb,MAAM,IAAImD,WAAY7C,EAAQ,gGAAiGN,IAIhI,IADAD,GADAS,EAAM,IAAI0C,KAAMlD,EAAI,IACV4C,QACJ1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAKG,GAAMY,EAAKE,KAAMD,EAASrC,EAAK4E,EAAKpD,GAAKA,GAE/C,OAAOM,CACR,CAKA,IAFAT,GADAS,EAAM,IAAI0C,KAAMlD,IACN4C,QACVzC,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIa,EAAKE,KAAMD,EAASrC,EAAK4E,EAAKpD,GAAKA,GAClCN,EAAeK,GACnBF,EAAKI,GAAMN,EAAMI,GACjBF,EAAKI,EAAE,GAAML,EAAMG,OACb,MAAKI,EAAmBJ,IAAOA,EAAEG,QAAU,GAIjD,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7KF,EAAKI,GAAMF,EAAG,GACdF,EAAKI,EAAE,GAAMF,EAAG,EAGjB,CACAE,GAAK,CACN,CACA,OAAOK,CACR,CACA,OAAO,IAAI0C,KAAMI,EAClB,CACA,GAAKlC,EAAUkC,IAASd,GAAuBjB,EAAY+B,EAAKzB,IAAsB,CAErF,GADA9B,EAAMuD,EAAKzB,MACLN,EAAYxB,EAAIW,MACrB,MAAM,IAAIG,UAAWP,EAAQ,6FAA8FgD,IAO5H,IAJCC,EADIzC,EACEwB,EAAiBvC,EAAKe,EAAMC,GAE5BsB,EAActC,cAEDsD,MACnB,MAAME,EAKP,IADAxD,GADAS,EAAM,IAAI0C,KADVlD,EAAMuD,EAAInD,OAAS,IAETwC,QACJ1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAKG,GAAMqD,EAAKrD,GAEjB,OAAOM,CACR,CACA,MAAM,IAAIK,UAAWP,EAAQ,6FAA8FgD,GAC5H,IAoBAxB,EAAaY,EAAiB,MAAM,WACnC,IAAIe,EACAvD,EACJ,IAAMqB,EAAY2B,MACjB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMgC,EAA2BK,MAChC,MAAM,IAAIrC,UAAW,6DAGtB,IADA4C,EAAO,GACDvD,EAAI,EAAGA,EAAI+C,UAAU7C,OAAQF,IAClCuD,EAAK7C,KAAMqC,UAAW/C,IAEvB,OAAO,IAAIgD,KAAMO,EAClB,IAwDA3B,EAAaY,EAAgBgB,UAAW,MAAM,SAAajF,GAC1D,IAAMgE,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMY,EAAWhD,GAChB,MAAM,IAAIoC,UAAWP,EAAQ,0DAA2D7B,IAKzF,GAHKA,EAAM,IACVA,GAAOyE,KAAKP,WAERlE,EAAM,GAAKA,GAAOyE,KAAKP,SAG5B,OAAOG,EAAeI,KAAKN,QAASnE,EACrC,IAgBAsD,EAAqBW,EAAgBgB,UAAW,UAAU,WACzD,OAAOR,KAAKN,QAAQe,MACrB,IAgBA5B,EAAqBW,EAAgBgB,UAAW,cAAc,WAC7D,OAAOR,KAAKN,QAAQQ,UACrB,IAgBArB,EAAqBW,EAAgBgB,UAAW,cAAc,WAC7D,OAAOR,KAAKN,QAAQG,UACrB,IAiBAjB,EAAaY,EAAgBgB,UAAW,oBAAqBhB,EAAgB/C,mBAuC7EmC,EAAaY,EAAgBgB,UAAW,cAAc,SAAqBE,EAAQC,GAClF,IAAMpB,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAQtB,OAL0B,IAArBoC,UAAU7C,OACd8C,KAAKN,QAAQkB,WAAmB,EAAPF,EAAgB,EAANC,GAEnCX,KAAKN,QAAQkB,WAAmB,EAAPF,EAAgB,EAANC,EAAsB,EAAbZ,UAAU,IAEhDC,IACR,IAqCApB,EAAaY,EAAgBgB,UAAW,WAAW,WAClD,IAAIC,EACAI,EACAC,EACAhE,EACAiE,EACA/D,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAkBtB,OAhBAkD,EAAOb,KACPS,EAAST,KAAKN,QACd5C,EAAMkD,KAAKP,QAGXzC,GAAK,EACLC,GAAK,EAIL2B,EADAkC,EAAO,CAAC,EACW,QAcnB,WACC,IAAIvD,EAEJ,GADAP,GAAK,EACA+D,GAAO/D,GAAKF,EAChB,MAAO,CACN,MAAQ,GAKV,OADAS,EAAI,IAAIwB,EAAY0B,EADpBxD,GAAK,GAC4BwD,EAAQxD,EAAE,IACpC,CACN,MAAS,CAAED,EAAGO,GACd,MAAQ,EAEV,IA3BAqB,EAAakC,EAAM,UAoCnB,SAAcjF,GAEb,GADAkF,GAAM,EACDhB,UAAU7C,OACd,MAAO,CACN,MAASrB,EACT,MAAQ,GAGV,MAAO,CACN,MAAQ,EAEV,IA7CK8C,GACJC,EAAakC,EAAMnC,GAoDpB,WACC,OAAOkC,EAAKG,SACb,IApDOF,CAqDR,IA+BAlC,EAAaY,EAAgBgB,UAAW,SAAS,SAAgBS,EAAWpD,GAC3E,IAAIhB,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9B,IAAMiE,EAAUnD,KAAMD,EAAS+B,EAAe/C,EAAKG,GAAKA,EAAGgD,MAC1D,OAAO,EAGT,OAAO,CACR,IA0CApB,EAAaY,EAAgBgB,UAAW,QAAQ,SAAe3E,EAAO8E,EAAOO,GAC5E,IAAIrE,EACAC,EACAvB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAeb,GACpB,MAAM,IAAI8B,UAAWP,EAAQ,0EAA2EvB,IAIzG,GAFAgB,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACNM,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWoC,GAChB,MAAM,IAAIhD,UAAWP,EAAQ,qEAAsEuD,IAQpG,GANKA,EAAQ,IACZA,GAAS7D,GACI,IACZ6D,EAAQ,GAGLZ,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,oEAAqE8D,IAE9FA,EAAM,IACVA,GAAOpE,GACI,IACVoE,EAAM,GAGHA,EAAMpE,IACVoE,EAAMpE,EAER,MACCoE,EAAMpE,CAER,MACC6D,EAAQ,EACRO,EAAMpE,EAIP,IAFAqE,EAAKxE,EAAMd,GACXuF,EAAKxE,EAAMf,GACLmB,EAAI2D,EAAO3D,EAAIkE,EAAKlE,IAEzBH,EADAtB,EAAM,EAAEyB,GACKmE,EACbtE,EAAKtB,EAAI,GAAM6F,EAEhB,OAAOpB,IACR,IA2CApB,EAAaY,EAAgBgB,UAAW,UAAU,SAAiBS,EAAWpD,GAC7E,IAAIhB,EACAS,EACAN,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAInG,IAFApE,EAAMmD,KAAKN,QACXpC,EAAM,GACAN,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BO,EAAIqC,EAAe/C,EAAKG,GACnBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,OACnC1C,EAAII,KAAMH,GAGZ,OAAO,IAAIyC,KAAKzD,YAAae,EAC9B,IAqCAsB,EAAaY,EAAgBgB,UAAW,QAAQ,SAAeS,EAAWpD,GACzE,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAO,EAAIqC,EAAe/C,EAAKG,GACnBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOzC,CAGV,IA+BAqB,EAAaY,EAAgBgB,UAAW,aAAa,SAAoBS,EAAWpD,GACnF,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAO,EAAIqC,EAAe/C,EAAKG,GACnBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOhD,EAGT,OAAQ,CACT,IAqCA4B,EAAaY,EAAgBgB,UAAW,YAAY,SAAmBS,EAAWpD,GACjF,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAIgD,KAAKP,QAAQ,EAAGzC,GAAK,EAAGA,IAEjC,GADAO,EAAIqC,EAAe/C,EAAKG,GACnBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOzC,CAGV,IA+BAqB,EAAaY,EAAgBgB,UAAW,iBAAiB,SAAwBS,EAAWpD,GAC3F,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAIgD,KAAKP,QAAQ,EAAGzC,GAAK,EAAGA,IAEjC,GADAO,EAAIqC,EAAe/C,EAAKG,GACnBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOhD,EAGT,OAAQ,CACT,IA4BA4B,EAAaY,EAAgBgB,UAAW,WAAW,SAAkBa,EAAKxD,GACzE,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYgD,GACjB,MAAM,IAAI1D,UAAWP,EAAQ,oEAAqEiE,IAGnG,IADAxE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BO,EAAIqC,EAAe/C,EAAKG,GACxBqE,EAAIvD,KAAMD,EAASN,EAAGP,EAAGgD,KAE3B,IAyCApB,EAAaY,EAAgBgB,UAAW,OAAO,SAAcjF,GAC5D,IAAMgE,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMI,EAAsBxC,GAC3B,MAAM,IAAIoC,UAAWP,EAAQ,qEAAsE7B,IAEpG,KAAKA,GAAOyE,KAAKP,SAGjB,OAAOG,EAAeI,KAAKN,QAASnE,EACrC,IAgBAsD,EAAqBW,EAAgBgB,UAAW,UAAU,WACzD,OAAOR,KAAKP,OACb,IAmCAb,EAAaY,EAAgBgB,UAAW,YAAY,SAAmBc,EAAeC,GACrF,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,EAAY,IAChBA,GAAavB,KAAKP,SACD,IAChB8B,EAAY,EAGf,MACCA,EAAY,EAKb,IAHAJ,EAAKxE,EAAM2E,GACXF,EAAKxE,EAAM0E,GACXzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,EAAIgD,KAAKP,QAASzC,IAEtC,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAO,EAGT,OAAO,CACR,IAmCAqD,EAAaY,EAAgBgB,UAAW,WAAW,SAAkBc,EAAeC,GACnF,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,EAAY,IAChBA,GAAavB,KAAKP,SACD,IAChB8B,EAAY,EAGf,MACCA,EAAY,EAKb,IAHAJ,EAAKxE,EAAM2E,GACXF,EAAKxE,EAAM0E,GACXzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,EAAIgD,KAAKP,QAASzC,IAEtC,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAOyB,EAGT,OAAQ,CACT,IAyBA4B,EAAaY,EAAgBgB,UAAW,QAAQ,SAAegB,GAC9D,IAAIlE,EACAT,EACA4E,EACAzE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,GAA0B,IAArBoC,UAAU7C,OACduE,EAAM,QACA,KAAKrD,EAAUoD,GAGrB,MAAM,IAAI7D,UAAWP,EAAQ,kEAAmEoE,IAFhGC,EAAMD,CAGP,CAGA,IAFAlE,EAAM,GACNT,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BM,EAAII,KAAMkC,EAAe/C,EAAKG,GAAI0E,YAEnC,OAAOpE,EAAIqE,KAAMF,EAClB,IAsCA7C,EAAaY,EAAgBgB,UAAW,eAAe,SAAsBc,EAAeC,GAC3F,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,GAAavB,KAAKP,QACtB8B,EAAYvB,KAAKP,QAAU,EAChB8B,EAAY,IACvBA,GAAavB,KAAKP,QAEpB,MACC8B,EAAYvB,KAAKP,QAAU,EAK5B,IAHA0B,EAAKxE,EAAM2E,GACXF,EAAKxE,EAAM0E,GACXzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,GAAK,EAAGA,IAE5B,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAOyB,EAGT,OAAQ,CACT,IAyCA4B,EAAaY,EAAgBgB,UAAW,OAAO,SAAca,EAAKxD,GACjE,IAAI+D,EACA/E,EACAS,EACAN,EACAD,EACJ,IAAMwC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYgD,GACjB,MAAM,IAAI1D,UAAWP,EAAQ,oEAAqEiE,IAKnG,IAHAxE,EAAMmD,KAAKN,QAEXkC,GADAtE,EAAM,IAAI0C,KAAKzD,YAAayD,KAAKP,UACpBC,QACP1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAD,EAAIsE,EAAIvD,KAAMD,EAAS+B,EAAe/C,EAAKG,GAAKA,EAAGgD,MAC9CtD,EAAeK,GACnB6E,EAAQ,EAAE5E,GAAML,EAAMI,GACtB6E,EAAS,EAAE5E,EAAG,GAAMJ,EAAMG,OACpB,KAAKI,EAAmBJ,IAAoB,IAAbA,EAAEG,OAIvC,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7K6E,EAAQ,EAAE5E,GAAMD,EAAG,GACnB6E,EAAS,EAAE5E,EAAG,GAAMD,EAAG,EAGxB,CAED,OAAOO,CACR,IAmCAsB,EAAaY,EAAgBgB,UAAW,UAAU,SAAiBqB,EAASC,GAC3E,IAAIjF,EACAkF,EACAjF,EAEAE,EAEJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYwD,GACjB,MAAM,IAAIlE,UAAWP,EAAQ,oEAAqEyE,IAInG,GAFAhF,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACNM,UAAU7C,OAAS,EACvB6E,EAAMD,EACN9E,EAAI,MACE,CACN,GAAa,IAARF,EACJ,MAAM,IAAIqD,MAAO,oGAElB4B,EAAMnC,EAAe/C,EAAK,GAC1BG,EAAI,CACL,CACA,KAAQA,EAAIF,EAAKE,IAEhB+E,EAAMF,EAASE,EADXnC,EAAe/C,EAAKG,GACDA,EAAGgD,MAE3B,OAAO+B,CACR,IAmDAnD,EAAaY,EAAgBgB,UAAW,WAAW,WAClD,IAAI3D,EACAwD,EACAvD,EACAkF,EACAhF,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAKtB,IAHAb,EAAMkD,KAAKP,QACX5C,EAAMmD,KAAKN,QACXsC,EAAIhD,EAAOlC,EAAM,GACXE,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBC,EAAIH,EAAME,EAAI,EACdqD,EAAMxD,EAAM,EAAEG,GACdH,EAAM,EAAEG,GAAOH,EAAM,EAAEI,GACvBJ,EAAM,EAAEI,GAAOoD,EACfA,EAAMxD,EAAM,EAAEG,EAAG,GACjBH,EAAM,EAAEG,EAAG,GAAMH,EAAM,EAAEI,EAAG,GAC5BJ,EAAM,EAAEI,EAAG,GAAMoD,EAElB,OAAOL,IACR,IAgEApB,EAAaY,EAAgBgB,UAAW,OAAO,SAAc3E,GAE5D,IAAIoG,EACA1G,EACAsB,EACAwD,EACAC,EACA0B,EACAjF,EACAC,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAGtB,GADAd,EAAMmD,KAAKN,QACNK,UAAU7C,OAAS,GAEvB,IAAMa,EADNxC,EAAMwE,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,+EAAgF7B,SAG9GA,EAAM,EAEP,GAAKmB,EAAeb,GAAU,CAC7B,GAAKN,GAAOyE,KAAKP,QAChB,MAAM,IAAIQ,WAAY7C,EAAQ,kEAAmE7B,IAKlG,OAFAsB,EADAtB,GAAO,GACMoB,EAAMd,QACnBgB,EAAKtB,EAAI,GAAMqB,EAAMf,GAEtB,CACA,GAAK0D,EAAgB1D,GAArB,CAEC,GAAKN,GADLyG,EAAInG,EAAM4D,SACGO,KAAKP,QACjB,MAAM,IAAIQ,WAAY,0FAMvB,GAJAgC,EAAOpG,EAAM6D,QAGbzC,EAAIJ,EAAIgD,WAActE,EAAIkB,EAEzBwF,EAAKxB,SAAW5D,EAAI4D,QAEnBwB,EAAKpC,WAAa5C,GAClBgF,EAAKpC,WAAWoC,EAAK/B,WAAajD,EAElC,CAGD,IADAoD,EAAM,IAAIvB,EAAcmD,EAAK/E,QACvBF,EAAI,EAAGA,EAAIiF,EAAK/E,OAAQF,IAC7BqD,EAAKrD,GAAMiF,EAAMjF,GAElBiF,EAAO5B,CACR,CAGA,IAFA9E,GAAO,EACP0B,EAAI,EACED,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBH,EAAKtB,GAAQ0G,EAAMhF,GACnBJ,EAAKtB,EAAI,GAAM0G,EAAMhF,EAAE,GACvB1B,GAAO,EACP0B,GAAK,CAGP,KAhCA,CAiCA,IAAKe,EAAcnC,GA2DnB,MAAM,IAAI8B,UAAWP,EAAQ,kIAAmIvB,IAxD/J,IADAmG,EAAInG,EAAMqB,OACJF,EAAI,EAAGA,EAAIgF,EAAGhF,IACnB,IAAMN,EAAeb,EAAOmB,IAAQ,CACnCsD,GAAM,EACN,KACD,CAGD,GAAKA,EAAM,CACV,IAAMhC,EAAQ0D,GACb,MAAM,IAAI/B,WAAY7C,EAAQ,6GAA8G4E,IAE7I,GAAKzG,EAAKyG,EAAE,EAAKhC,KAAKP,QACrB,MAAM,IAAIQ,WAAY,0FAMvB,GAJAgC,EAAOpG,EAGPoB,EAAIJ,EAAIgD,WAActE,EAAIkB,EAEzBwF,EAAKxB,SAAW5D,EAAI4D,QAEnBwB,EAAKpC,WAAa5C,GAClBgF,EAAKpC,WAAWoC,EAAK/B,WAAajD,EAElC,CAGD,IADAoD,EAAM,IAAIvB,EAAckD,GAClBhF,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBqD,EAAKrD,GAAMiF,EAAMjF,GAElBiF,EAAO5B,CACR,CAIA,IAHA9E,GAAO,EACPyG,GAAK,EACL/E,EAAI,EACED,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBH,EAAKtB,GAAQ0G,EAAMhF,GACnBJ,EAAKtB,EAAI,GAAM0G,EAAMhF,EAAE,GACvB1B,GAAO,EACP0B,GAAK,EAEN,MACD,CAEA,GAAK1B,EAAIyG,EAAIhC,KAAKP,QACjB,MAAM,IAAIQ,WAAY,0FAGvB,IADA1E,GAAO,EACDyB,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBD,EAAIlB,EAAOmB,GACXH,EAAKtB,GAAQoB,EAAMI,GACnBF,EAAKtB,EAAI,GAAMqB,EAAMG,GACrBxB,GAAO,CAxDT,CA+DD,IA2EAqD,EAAaY,EAAgBgB,UAAW,SAAS,SAAgBG,EAAOO,GACvE,IAAIgB,EACAN,EACAtE,EACA/B,EACAsB,EACAC,EACAE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,GAFAd,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACe,IAArBM,UAAU7C,OACdyD,EAAQ,EACRO,EAAMpE,MACA,CACN,IAAMyB,EAAWoC,GAChB,MAAM,IAAIhD,UAAWP,EAAQ,oEAAqEuD,IAQnG,GANKA,EAAQ,IACZA,GAAS7D,GACI,IACZ6D,EAAQ,GAGgB,IAArBZ,UAAU7C,OACdgE,EAAMpE,MACA,CACN,IAAMyB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,qEAAsE8D,IAE/FA,EAAM,GACVA,GAAOpE,GACI,IACVoE,EAAM,GAEIA,EAAMpE,IACjBoE,EAAMpE,EAER,CACD,CAQA,IANCoF,EADIvB,EAAQO,EACHA,EAAMP,EAEN,EAGViB,GADAtE,EAAM,IAAI0C,KAAKzD,YAAa2F,IACfxC,QACP1C,EAAI,EAAGA,EAAIkF,EAAQlF,IACxBzB,EAAM,GAAGyB,EAAE2D,GACXiB,EAAQ,EAAE5E,GAAMH,EAAKtB,GACrBqG,EAAS,EAAE5E,EAAG,GAAMH,EAAKtB,EAAI,GAE9B,OAAO+B,CACR,IA+BAsB,EAAaY,EAAgBgB,UAAW,QAAQ,SAAeS,EAAWpD,GACzE,IAAIhB,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9B,GAAKiE,EAAUnD,KAAMD,EAAS+B,EAAe/C,EAAKG,GAAKA,EAAGgD,MACzD,OAAO,EAGT,OAAO,CACR,IA2EApB,EAAaY,EAAgBgB,UAAW,YAAY,SAAmB2B,EAAOjB,GAC7E,IAAIkB,EACAvF,EACAC,EACJ,IAAMyC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,GAFAd,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACe,IAArBM,UAAU7C,OACdiF,EAAQ,EACRjB,EAAMpE,MACA,CACN,IAAMyB,EAAW4D,GAChB,MAAM,IAAIxE,UAAWP,EAAQ,oEAAqE+E,IAQnG,GANKA,EAAQ,IACZA,GAASrF,GACI,IACZqF,EAAQ,GAGgB,IAArBpC,UAAU7C,OACdgE,EAAMpE,MACA,CACN,IAAMyB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,qEAAsE8D,IAE/FA,EAAM,GACVA,GAAOpE,GACI,IACVoE,EAAM,GAEIA,EAAMpE,IACjBoE,EAAMpE,EAER,CACD,CAWA,OAVKqF,GAASrF,GACbA,EAAM,EACNsF,EAASvF,EAAIqD,YACFiC,GAASjB,GACpBpE,EAAM,EACNsF,EAASvF,EAAIgD,WAAesC,EAAM1F,IAElCK,EAAMoE,EAAMiB,EACZC,EAASvF,EAAIgD,WAAesC,EAAM1F,GAE5B,IAAIuD,KAAKzD,YAAaM,EAAI4D,OAAQ2B,EAAUtF,EAAM,EAAM,EAAIA,EACpE,IAmDA8B,EAAaY,EAAgBgB,UAAW,cAAc,WACrD,IAAIoB,EACAtE,EACAR,EACAD,EACAG,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAMtB,IAJAb,EAAMkD,KAAKP,QACXnC,EAAM,IAAI0C,KAAKzD,YAAaO,GAC5BD,EAAMmD,KAAKN,QACXkC,EAAStE,EAAIoC,QACP1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBC,EAAIH,EAAME,EAAI,EACd4E,EAAS,EAAE5E,GAAOH,EAAM,EAAEI,GAC1B2E,EAAS,EAAE5E,EAAG,GAAMH,EAAM,EAAEI,EAAG,GAEhC,OAAOK,CACR,IAoBAsB,EAAaY,EAAgBgB,UAAW,YAAY,WACnD,IAAIlD,EACAT,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,IAFAL,EAAM,GACNT,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BM,EAAII,KAAMkC,EAAe/C,EAAKG,GAAI0E,YAEnC,OAAOpE,EAAIqE,KAAM,IAClB,IAuCA/C,EAAaY,EAAgBgB,UAAW,QAAQ,SAAmB6B,EAAOxG,GACzE,IAAIgB,EACAS,EACAR,EACJ,IAAMyC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMY,EAAW8D,GAChB,MAAM,IAAI1E,UAAWP,EAAQ,oEAAqEiF,IAMnG,GAJAvF,EAAMkD,KAAKP,QACN4C,EAAQ,IACZA,GAASvF,GAELuF,EAAQ,GAAKA,GAASvF,EAC1B,MAAM,IAAImD,WAAY7C,EAAQ,kEAAmEiF,IAElG,IAAM3F,EAAeb,GACpB,MAAM,IAAI8B,UAAWP,EAAQ,2EAA4EvB,IAM1G,OAHAgB,GADAS,EAAM,IAAI0C,KAAKzD,YAAayD,KAAKN,UACvBA,SACL,EAAE2C,GAAU1F,EAAMd,GACvBgB,EAAM,EAAEwF,EAAO,GAAMzF,EAAMf,GACpByB,CACR,IAKAnC,EAAOC,QAAUoE,kBC96EjB,IAAI9C,EAAgBxB,EAAS,MACzBoH,EAAQpH,EAAS,MACjBqH,EAAQrH,EAAS,MAoCrBC,EAAOC,QAvBP,SAAoByB,EAAKvB,GACxB,IAAIwB,EACAC,EACAC,EACAC,EAIJ,IAFAH,EAAMxB,EAAI4B,OACVD,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIzB,EAAK0B,IACHN,EAAeK,GACpB,OAAO,KAERF,EAAKI,GAAMqF,EAAOvF,GAClBF,EAAKI,EAAE,GAAMsF,EAAOxF,GACpBE,GAAK,CACN,CACA,OAAOJ,CACR,iBCjCA,IAAIM,EAAoBjC,EAAS,MAC7BwB,EAAgBxB,EAAS,MACzBoH,EAAQpH,EAAS,MACjBqH,EAAQrH,EAAS,MACjBkC,EAASlC,EAAS,MAsCtBC,EAAOC,QA1BP,SAAuBiC,GACtB,IAAIC,EACAP,EACAQ,EAGJ,IADAD,EAAM,KAELP,EAAIM,EAAGG,QACAC,MAIP,GADAF,EAAIR,EAAElB,MACDsB,EAAmBI,IAAOA,EAAEL,QAAU,EAC1CI,EAAII,KAAMH,EAAG,GAAKA,EAAG,QACf,KAAKb,EAAea,GAG1B,OAAO,IAAII,UAAWP,EAAQ,kJAAmJG,IAFjLD,EAAII,KAAM4E,EAAO/E,GAAKgF,EAAOhF,GAG9B,CAED,OAAOD,CACR,kBCrCA,IAAIH,EAAoBjC,EAAS,MAC7BwB,EAAgBxB,EAAS,MACzBoH,EAAQpH,EAAS,MACjBqH,EAAQrH,EAAS,MACjBkC,EAASlC,EAAS,MA2CtBC,EAAOC,QA7BP,SAA0BiC,EAAIO,EAAMC,GACnC,IAAIP,EACAP,EACAQ,EACAP,EAIJ,IAFAM,EAAM,GACNN,GAAK,IAEJD,EAAIM,EAAGG,QACAC,MAKP,GAFAT,GAAK,EACLO,EAAIK,EAAKE,KAAMD,EAASd,EAAElB,MAAOmB,GAC5BG,EAAmBI,IAAOA,EAAEL,QAAU,EAC1CI,EAAII,KAAMH,EAAG,GAAKA,EAAG,QACf,KAAKb,EAAea,GAG1B,OAAO,IAAII,UAAWP,EAAQ,+IAAgJG,IAF9KD,EAAII,KAAM4E,EAAO/E,GAAKgF,EAAOhF,GAG9B,CAED,OAAOD,CACR,kBCwBA,IAAIrC,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCrEjB,IAAI8C,EAAuB7C,EAAAA,MAAAA,YACvBiC,EAAoBjC,EAAS,MAC7B8C,EAAe9C,EAAS,MACxB+C,EAAgB/C,EAAS,MACzBgD,EAAWhD,EAAS,MACpBiD,EAAUjD,EAAS,KACnBkD,EAAWlD,EAAAA,MAAAA,YACXmD,EAAanD,EAAS,MACtBwB,EAAgBxB,EAAS,MACzBoD,EAASpD,EAAS,MAClBqD,EAAYrD,EAAS,KACrBsD,EAAmBtD,EAAS,MAC5BuD,EAAoBvD,EAAS,MAC7BwD,EAA2BxD,EAAS,MACpCyD,EAAkBzD,EAAS,MAC3B0D,EAAc1D,EAAS,KACvB2D,EAAsB3D,EAAS,MAC/BsH,EAAetH,EAAS,MACxBuH,EAAYvH,EAAS,MACrBkC,EAASlC,EAAS,MAClBoH,EAAQpH,EAAS,MACjBqH,EAAQrH,EAAS,MACjB8D,EAAQ9D,EAAS,MACjB+D,EAAgB/D,EAAS,MACzBgE,EAAiBhE,EAAS,MAC1Bc,EAASd,EAAS,MAClBgB,EAAiBhB,EAAS,MAC1BiE,EAAejE,EAAS,KACxBkE,EAAkBlE,EAAS,MAC3BmE,EAAYnE,EAAS,MAKrBuB,EAAqD,EAAjC+F,EAAa/F,kBACjC6C,EAAsBZ,IAY1B,SAASa,EAAgB1D,GACxB,OACCA,aAAiB6G,GAEC,kBAAV7G,GACG,OAAVA,IAE4B,mBAA3BA,EAAMU,YAAYC,MACS,oBAA3BX,EAAMU,YAAYC,OAEM,kBAAlBX,EAAM4D,SAGY,kBAAlB5D,EAAM6D,OAGhB,CASA,SAASC,EAA2B9D,GACnC,OACCA,IAAU6G,GAGK,oBAAf7G,EAAMW,IAER,CAUA,SAASmG,EAAc9F,EAAKtB,GAE3B,OAAO,IAAIkH,EAAW5F,EADtBtB,GAAO,GAC2BsB,EAAKtB,EAAI,GAC5C,CAyEA,SAASmH,IACR,IAAI7C,EACAC,EACAjD,EACAC,EAGJ,GADAgD,EAAQC,UAAU7C,SACX8C,gBAAgB0C,GACtB,OAAe,IAAV5C,EACG,IAAI4C,EAEG,IAAV5C,EACG,IAAI4C,EAAgB3C,UAAU,IAEvB,IAAVD,EACG,IAAI4C,EAAgB3C,UAAU,GAAIA,UAAU,IAE7C,IAAI2C,EAAgB3C,UAAU,GAAIA,UAAU,GAAIA,UAAU,IAGlE,GAAe,IAAVD,EACJjD,EAAM,IAAI2F,EAAc,QAClB,GAAe,IAAV1C,EACX,GAAK/B,EAAsBgC,UAAU,IACpClD,EAAM,IAAI2F,EAA2B,EAAbzC,UAAU,SAC5B,GAAK/B,EAAc+B,UAAU,IAKnC,IAHAjD,GADAD,EAAMkD,UAAW,IACP7C,SAGEiB,EAAStB,IAASH,EAAeG,EAAI,KAEhD,GAAa,QADbA,EAAMwC,EAAW,IAAImD,EAAkB,EAAJ1F,GAASD,IACxB,CAEnB,IAAMyB,EAAQxB,GACb,MAAM,IAAImD,WAAY7C,EAAQ,6GAA8GN,IAG7ID,EAAM,IAAI2F,EAAczC,UAAU,GACnC,MACM,CACN,GAAKvB,EAAkB3B,GACtBA,EAAMoC,EAAepC,EAAK,QACpB,GAAK4B,EAAmB5B,GAC9BA,EAAMqC,EAAgBrC,EAAK,QACrB,IAAMyB,EAAQxB,GACpB,MAAM,IAAImD,WAAY7C,EAAQ,6HAA8HN,IAE7JD,EAAM,IAAI2F,EAAc3F,EACzB,MACM,GAAKoB,EAAe8B,UAAU,IAAO,CAE3C,IAAMxB,GADN1B,EAAMkD,UAAW,IACIG,WAAWzD,GAC/B,MAAM,IAAIwD,WAAY7C,EAAQ,yFAA0FX,EAAmBI,EAAIqD,aAEhJrD,EAAM,IAAI2F,EAAc3F,EACzB,KAAO,KAAKqB,EAAU6B,UAAU,IAkB/B,MAAM,IAAIpC,UAAWP,EAAQ,qHAAsH2C,UAAU,KAhB7J,GADAlD,EAAMkD,UAAW,IACY,IAAxBT,EACJ,MAAM,IAAI3B,UAAWP,EAAQ,mJAAoJP,IAElL,IAAMwB,EAAYxB,EAAK8B,IACtB,MAAM,IAAIhB,UAAWP,EAAQ,qHAAsHP,IAGpJ,GADAA,EAAMA,EAAK8B,MACLN,EAAYxB,EAAIW,MACrB,MAAM,IAAIG,UAAWP,EAAQ,qHAAsHP,IAGpJ,IADAA,EAAMsC,EAActC,cACAsD,MACnB,MAAMtD,EAEPA,EAAM,IAAI2F,EAAc3F,EAGzB,KACM,CAEN,IAAMoB,EADNpB,EAAMkD,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,wEAAyEP,IAGvG,IAAMkB,EADN8B,EAAaE,UAAW,IAEvB,MAAM,IAAIpC,UAAWP,EAAQ,4EAA6EyC,IAE3G,IAAMtB,EAAWsB,EAAWpD,GAC3B,MAAM,IAAIwD,WAAY7C,EAAQ,uEAAwEX,EAAmBoD,IAE1H,GAAe,IAAVC,EAAc,CAElB,GADAhD,EAAMD,EAAIqD,WAAaL,GACjBtB,EAAWzB,EAAIL,GACpB,MAAM,IAAIwD,WAAY7C,EAAQ,oGAAqGX,EAAmBK,IAEvJD,EAAM,IAAI2F,EAAc3F,EAAKgD,EAC9B,KAAO,CAEN,IAAM9B,EADNjB,EAAMiD,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,uEAAwEN,IAEtG,GAAMA,EAAIL,EAAsBI,EAAIqD,WAAWL,EAC9C,MAAM,IAAII,WAAY7C,EAAQ,iJAAkJN,EAAIL,IAErLI,EAAM,IAAI2F,EAAc3F,EAAKgD,EAAgB,EAAJ/C,EAC1C,CACD,CAIA,OAHA8B,EAAaoB,KAAM,UAAWnD,GAC9B+B,EAAaoB,KAAM,UAAWnD,EAAIK,OAAO,GAElC8C,IACR,CAeApB,EAAa8D,EAAgB,oBAAqBjG,GAelDmC,EAAa8D,EAAgB,OAAQ,kBAmDrC9D,EAAa8D,EAAgB,QAAQ,SAAetC,GACnD,IAAIvC,EACAiC,EACAlC,EACAN,EACAT,EACAwD,EACA7E,EACAsB,EACAwD,EACAvD,EACAC,EACAC,EACJ,IAAMoB,EAAY2B,MACjB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMgC,EAA2BK,MAChC,MAAM,IAAIrC,UAAW,6DAGtB,IADAmC,EAAQC,UAAU7C,QACL,EAAI,CAEhB,IAAMmB,EADNT,EAAOmC,UAAW,IAEjB,MAAM,IAAIpC,UAAWP,EAAQ,qEAAsEQ,IAE/FkC,EAAQ,IACZjC,EAAUkC,UAAW,GAEvB,CACA,GAAKR,EAAgBa,GAAQ,CAE5B,GADAtD,EAAMsD,EAAIlD,OACLU,EAAO,CAIX,IAFAf,GADAS,EAAM,IAAI0C,KAAMlD,IACN4C,QACVzC,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIa,EAAKE,KAAMD,EAASuC,EAAI5E,IAAKwB,GAAKA,GACjCN,EAAeK,GACnBF,EAAKI,GAAMqF,EAAOvF,GAClBF,EAAKI,EAAE,GAAMsF,EAAOxF,OACd,MAAKI,EAAmBJ,IAAOA,EAAEG,QAAU,GAIjD,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7KF,EAAKI,GAAMF,EAAG,GACdF,EAAKI,EAAE,GAAMF,EAAG,EAGjB,CACAE,GAAK,CACN,CACA,OAAOK,CACR,CACA,OAAO,IAAI0C,KAAMI,EAClB,CACA,GAAKpC,EAAcoC,GAAQ,CAC1B,GAAKxC,EAAO,CAUX,IAPAd,EAAMsD,EAAIlD,OAET1B,EADI4E,EAAI5E,KAAO4E,EAAItE,IACbI,EAAgB,WAEhBF,EAAQ,WAGTgB,EAAI,EAAGA,EAAIF,EAAKE,IACrB,IAAMN,EAAelB,EAAK4E,EAAKpD,IAAQ,CACtCsD,GAAM,EACN,KACD,CAGD,GAAKA,EAAM,CACV,IAAMhC,EAAQxB,GACb,MAAM,IAAImD,WAAY7C,EAAQ,+FAAgG,EAAGN,IAIlI,IADAD,GADAS,EAAM,IAAI0C,KAAMlD,EAAI,IACV4C,QACJ1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAKG,GAAMY,EAAKE,KAAMD,EAASrC,EAAK4E,EAAKpD,GAAKA,GAE/C,OAAOM,CACR,CAKA,IAFAT,GADAS,EAAM,IAAI0C,KAAMlD,IACN4C,QACVzC,EAAI,EACED,EAAI,EAAGA,EAAIF,EAAKE,IAAM,CAE3B,GADAD,EAAIa,EAAKE,KAAMD,EAASrC,EAAK4E,EAAKpD,GAAKA,GAClCN,EAAeK,GACnBF,EAAKI,GAAMqF,EAAOvF,GAClBF,EAAKI,EAAE,GAAMsF,EAAOxF,OACd,MAAKI,EAAmBJ,IAAOA,EAAEG,QAAU,GAIjD,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7KF,EAAKI,GAAMF,EAAG,GACdF,EAAKI,EAAE,GAAMF,EAAG,EAGjB,CACAE,GAAK,CACN,CACA,OAAOK,CACR,CACA,OAAO,IAAI0C,KAAMI,EAClB,CACA,GAAKlC,EAAUkC,IAASd,GAAuBjB,EAAY+B,EAAKzB,IAAsB,CAErF,GADA9B,EAAMuD,EAAKzB,MACLN,EAAYxB,EAAIW,MACrB,MAAM,IAAIG,UAAWP,EAAQ,6FAA8FgD,IAO5H,IAJCC,EADIzC,EACEwB,EAAiBvC,EAAKe,EAAMC,GAE5BsB,EAActC,cAEDsD,MACnB,MAAME,EAKP,IADAxD,GADAS,EAAM,IAAI0C,KADVlD,EAAMuD,EAAInD,OAAS,IAETwC,QACJ1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBH,EAAKG,GAAMqD,EAAKrD,GAEjB,OAAOM,CACR,CACA,MAAM,IAAIK,UAAWP,EAAQ,6FAA8FgD,GAC5H,IAoBAxB,EAAa8D,EAAgB,MAAM,WAClC,IAAInC,EACAvD,EACJ,IAAMqB,EAAY2B,MACjB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMgC,EAA2BK,MAChC,MAAM,IAAIrC,UAAW,6DAGtB,IADA4C,EAAO,GACDvD,EAAI,EAAGA,EAAI+C,UAAU7C,OAAQF,IAClCuD,EAAK7C,KAAMqC,UAAW/C,IAEvB,OAAO,IAAIgD,KAAMO,EAClB,IAuDA3B,EAAa8D,EAAelC,UAAW,MAAM,SAAajF,GACzD,IAAMgE,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMY,EAAWhD,GAChB,MAAM,IAAIoC,UAAWP,EAAQ,0DAA2D7B,IAKzF,GAHKA,EAAM,IACVA,GAAOyE,KAAKP,WAERlE,EAAM,GAAKA,GAAOyE,KAAKP,SAG5B,OAAOkD,EAAc3C,KAAKN,QAASnE,EACpC,IAgBAsD,EAAqB6D,EAAelC,UAAW,UAAU,WACxD,OAAOR,KAAKN,QAAQe,MACrB,IAgBA5B,EAAqB6D,EAAelC,UAAW,cAAc,WAC5D,OAAOR,KAAKN,QAAQQ,UACrB,IAgBArB,EAAqB6D,EAAelC,UAAW,cAAc,WAC5D,OAAOR,KAAKN,QAAQG,UACrB,IAiBAjB,EAAa8D,EAAelC,UAAW,oBAAqBkC,EAAejG,mBAuC3EmC,EAAa8D,EAAelC,UAAW,cAAc,SAAqBE,EAAQC,GACjF,IAAMpB,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAQtB,OAL0B,IAArBoC,UAAU7C,OACd8C,KAAKN,QAAQkB,WAAmB,EAAPF,EAAgB,EAANC,GAEnCX,KAAKN,QAAQkB,WAAmB,EAAPF,EAAgB,EAANC,EAAsB,EAAbZ,UAAU,IAEhDC,IACR,IAqCApB,EAAa8D,EAAelC,UAAW,WAAW,WACjD,IAAIC,EACAI,EACAC,EACAhE,EACAiE,EACA/D,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAkBtB,OAhBAkD,EAAOb,KACPS,EAAST,KAAKN,QACd5C,EAAMkD,KAAKP,QAGXzC,GAAK,EACLC,GAAK,EAIL2B,EADAkC,EAAO,CAAC,EACW,QAcnB,WACC,IAAIvD,EAEJ,GADAP,GAAK,EACA+D,GAAO/D,GAAKF,EAChB,MAAO,CACN,MAAQ,GAKV,OADAS,EAAI,IAAIkF,EAAWhC,EADnBxD,GAAK,GAC2BwD,EAAQxD,EAAE,IACnC,CACN,MAAS,CAAED,EAAGO,GACd,MAAQ,EAEV,IA3BAqB,EAAakC,EAAM,UAoCnB,SAAcjF,GAEb,GADAkF,GAAM,EACDhB,UAAU7C,OACd,MAAO,CACN,MAASrB,EACT,MAAQ,GAGV,MAAO,CACN,MAAQ,EAEV,IA7CK8C,GACJC,EAAakC,EAAMnC,GAoDpB,WACC,OAAOkC,EAAKG,SACb,IApDOF,CAqDR,IA+BAlC,EAAa8D,EAAelC,UAAW,SAAS,SAAgBS,EAAWpD,GAC1E,IAAIhB,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9B,IAAMiE,EAAUnD,KAAMD,EAAS8E,EAAc9F,EAAKG,GAAKA,EAAGgD,MACzD,OAAO,EAGT,OAAO,CACR,IA0CApB,EAAa8D,EAAelC,UAAW,QAAQ,SAAe3E,EAAO8E,EAAOO,GAC3E,IAAIrE,EACAC,EACAvB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAeb,GACpB,MAAM,IAAI8B,UAAWP,EAAQ,0EAA2EvB,IAIzG,GAFAgB,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACNM,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWoC,GAChB,MAAM,IAAIhD,UAAWP,EAAQ,qEAAsEuD,IAQpG,GANKA,EAAQ,IACZA,GAAS7D,GACI,IACZ6D,EAAQ,GAGLZ,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,oEAAqE8D,IAE9FA,EAAM,IACVA,GAAOpE,GACI,IACVoE,EAAM,GAGHA,EAAMpE,IACVoE,EAAMpE,EAER,MACCoE,EAAMpE,CAER,MACC6D,EAAQ,EACRO,EAAMpE,EAIP,IAFAqE,EAAKmB,EAAOzG,GACZuF,EAAKmB,EAAO1G,GACNmB,EAAI2D,EAAO3D,EAAIkE,EAAKlE,IAEzBH,EADAtB,EAAM,EAAEyB,GACKmE,EACbtE,EAAKtB,EAAI,GAAM6F,EAEhB,OAAOpB,IACR,IA2CApB,EAAa8D,EAAelC,UAAW,UAAU,SAAiBS,EAAWpD,GAC5E,IAAIhB,EACAS,EACAN,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAInG,IAFApE,EAAMmD,KAAKN,QACXpC,EAAM,GACAN,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BO,EAAIoF,EAAc9F,EAAKG,GAClBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,OACnC1C,EAAII,KAAMH,GAGZ,OAAO,IAAIyC,KAAKzD,YAAae,EAC9B,IAsCAsB,EAAa8D,EAAelC,UAAW,QAAQ,SAAeS,EAAWpD,GACxE,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAO,EAAIoF,EAAc9F,EAAKG,GAClBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOzC,CAGV,IAgCAqB,EAAa8D,EAAelC,UAAW,aAAa,SAAoBS,EAAWpD,GAClF,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAO,EAAIoF,EAAc9F,EAAKG,GAClBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOhD,EAGT,OAAQ,CACT,IAsCA4B,EAAa8D,EAAelC,UAAW,YAAY,SAAmBS,EAAWpD,GAChF,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAIgD,KAAKP,QAAQ,EAAGzC,GAAK,EAAGA,IAEjC,GADAO,EAAIoF,EAAc9F,EAAKG,GAClBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOzC,CAGV,IAgCAqB,EAAa8D,EAAelC,UAAW,iBAAiB,SAAwBS,EAAWpD,GAC1F,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAIgD,KAAKP,QAAQ,EAAGzC,GAAK,EAAGA,IAEjC,GADAO,EAAIoF,EAAc9F,EAAKG,GAClBiE,EAAUnD,KAAMD,EAASN,EAAGP,EAAGgD,MACnC,OAAOhD,EAGT,OAAQ,CACT,IA4BA4B,EAAa8D,EAAelC,UAAW,WAAW,SAAkBa,EAAKxD,GACxE,IAAIhB,EACAG,EACAO,EACJ,IAAMgC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYgD,GACjB,MAAM,IAAI1D,UAAWP,EAAQ,oEAAqEiE,IAGnG,IADAxE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BO,EAAIoF,EAAc9F,EAAKG,GACvBqE,EAAIvD,KAAMD,EAASN,EAAGP,EAAGgD,KAE3B,IAyCApB,EAAa8D,EAAelC,UAAW,OAAO,SAAcjF,GAC3D,IAAMgE,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMI,EAAsBxC,GAC3B,MAAM,IAAIoC,UAAWP,EAAQ,qEAAsE7B,IAEpG,KAAKA,GAAOyE,KAAKP,SAGjB,OAAOkD,EAAc3C,KAAKN,QAASnE,EACpC,IAmCAqD,EAAa8D,EAAelC,UAAW,YAAY,SAAmBc,EAAeC,GACpF,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,EAAY,IAChBA,GAAavB,KAAKP,SACD,IAChB8B,EAAY,EAGf,MACCA,EAAY,EAKb,IAHAJ,EAAKmB,EAAOhB,GACZF,EAAKmB,EAAOjB,GACZzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,EAAIgD,KAAKP,QAASzC,IAEtC,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAO,EAGT,OAAO,CACR,IAmCAqD,EAAa8D,EAAelC,UAAW,WAAW,SAAkBc,EAAeC,GAClF,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,EAAY,IAChBA,GAAavB,KAAKP,SACD,IAChB8B,EAAY,EAGf,MACCA,EAAY,EAKb,IAHAJ,EAAKmB,EAAOhB,GACZF,EAAKmB,EAAOjB,GACZzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,EAAIgD,KAAKP,QAASzC,IAEtC,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAOyB,EAGT,OAAQ,CACT,IAyBA4B,EAAa8D,EAAelC,UAAW,QAAQ,SAAegB,GAC7D,IAAIlE,EACAT,EACA4E,EACAzE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,GAA0B,IAArBoC,UAAU7C,OACduE,EAAM,QACA,KAAKrD,EAAUoD,GAGrB,MAAM,IAAI7D,UAAWP,EAAQ,kEAAmEoE,IAFhGC,EAAMD,CAGP,CAGA,IAFAlE,EAAM,GACNT,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BM,EAAII,KAAMiF,EAAc9F,EAAKG,GAAI0E,YAElC,OAAOpE,EAAIqE,KAAMF,EAClB,IAsCA7C,EAAa8D,EAAelC,UAAW,eAAe,SAAsBc,EAAeC,GAC1F,IAAI1E,EACAtB,EACA4F,EACAC,EACApE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMjB,EAAe4E,GACpB,MAAM,IAAI3D,UAAWP,EAAQ,0EAA2EkE,IAEzG,GAAKvB,UAAU7C,OAAS,EAAI,CAC3B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,qEAAsEmE,IAE/FA,GAAavB,KAAKP,QACtB8B,EAAYvB,KAAKP,QAAU,EAChB8B,EAAY,IACvBA,GAAavB,KAAKP,QAEpB,MACC8B,EAAYvB,KAAKP,QAAU,EAK5B,IAHA0B,EAAKmB,EAAOhB,GACZF,EAAKmB,EAAOjB,GACZzE,EAAMmD,KAAKN,QACL1C,EAAIuE,EAAWvE,GAAK,EAAGA,IAE5B,GAAKmE,IAAOtE,EADZtB,EAAM,EAAIyB,IACgBoE,IAAOvE,EAAKtB,EAAI,GACzC,OAAOyB,EAGT,OAAQ,CACT,IAgBA6B,EAAqB6D,EAAelC,UAAW,UAAU,WACxD,OAAOR,KAAKP,OACb,IAyCAb,EAAa8D,EAAelC,UAAW,OAAO,SAAca,EAAKxD,GAChE,IAAI+D,EACA/E,EACAS,EACAN,EACAD,EACJ,IAAMwC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYgD,GACjB,MAAM,IAAI1D,UAAWP,EAAQ,oEAAqEiE,IAKnG,IAHAxE,EAAMmD,KAAKN,QAEXkC,GADAtE,EAAM,IAAI0C,KAAKzD,YAAayD,KAAKP,UACpBC,QACP1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAE9B,GADAD,EAAIsE,EAAIvD,KAAMD,EAAS8E,EAAc9F,EAAKG,GAAKA,EAAGgD,MAC7CtD,EAAeK,GACnB6E,EAAQ,EAAE5E,GAAMsF,EAAOvF,GACvB6E,EAAS,EAAE5E,EAAG,GAAMuF,EAAOxF,OACrB,KAAKI,EAAmBJ,IAAoB,IAAbA,EAAEG,OAIvC,MAAM,IAAIS,UAAWP,EAAQ,+IAAgJL,IAH7K6E,EAAQ,EAAE5E,GAAMD,EAAG,GACnB6E,EAAS,EAAE5E,EAAG,GAAMD,EAAG,EAGxB,CAED,OAAOO,CACR,IAmCAsB,EAAa8D,EAAelC,UAAW,UAAU,SAAiBqB,EAASC,GAC1E,IAAIjF,EACAkF,EACAjF,EAEAE,EAEJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAYwD,GACjB,MAAM,IAAIlE,UAAWP,EAAQ,oEAAqEyE,IAInG,GAFAhF,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACNM,UAAU7C,OAAS,EACvB6E,EAAMD,EACN9E,EAAI,MACE,CACN,GAAa,IAARF,EACJ,MAAM,IAAIqD,MAAO,oGAElB4B,EAAMY,EAAc9F,EAAK,GACzBG,EAAI,CACL,CACA,KAAQA,EAAIF,EAAKE,IAEhB+E,EAAMF,EAASE,EADXY,EAAc9F,EAAKG,GACAA,EAAGgD,MAE3B,OAAO+B,CACR,IAmDAnD,EAAa8D,EAAelC,UAAW,WAAW,WACjD,IAAI3D,EACAwD,EACAvD,EACAkF,EACAhF,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAKtB,IAHAb,EAAMkD,KAAKP,QACX5C,EAAMmD,KAAKN,QACXsC,EAAIhD,EAAOlC,EAAM,GACXE,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBC,EAAIH,EAAME,EAAI,EACdqD,EAAMxD,EAAM,EAAEG,GACdH,EAAM,EAAEG,GAAOH,EAAM,EAAEI,GACvBJ,EAAM,EAAEI,GAAOoD,EACfA,EAAMxD,EAAM,EAAEG,EAAG,GACjBH,EAAM,EAAEG,EAAG,GAAMH,EAAM,EAAEI,EAAG,GAC5BJ,EAAM,EAAEI,EAAG,GAAMoD,EAElB,OAAOL,IACR,IAgEApB,EAAa8D,EAAelC,UAAW,OAAO,SAAc3E,GAE3D,IAAIoG,EACA1G,EACAsB,EACAwD,EACAC,EACA0B,EACAjF,EACAC,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAGtB,GADAd,EAAMmD,KAAKN,QACNK,UAAU7C,OAAS,GAEvB,IAAMa,EADNxC,EAAMwE,UAAW,IAEhB,MAAM,IAAIpC,UAAWP,EAAQ,+EAAgF7B,SAG9GA,EAAM,EAEP,GAAKmB,EAAeb,GAAU,CAC7B,GAAKN,GAAOyE,KAAKP,QAChB,MAAM,IAAIQ,WAAY7C,EAAQ,kEAAmE7B,IAKlG,OAFAsB,EADAtB,GAAO,GACM+G,EAAOzG,QACpBgB,EAAKtB,EAAI,GAAMgH,EAAO1G,GAEvB,CACA,GAAK0D,EAAgB1D,GAArB,CAEC,GAAKN,GADLyG,EAAInG,EAAM4D,SACGO,KAAKP,QACjB,MAAM,IAAIQ,WAAY,0FAMvB,GAJAgC,EAAOpG,EAAM6D,QAGbzC,EAAIJ,EAAIgD,WAActE,EAAIkB,EAEzBwF,EAAKxB,SAAW5D,EAAI4D,QAEnBwB,EAAKpC,WAAa5C,GAClBgF,EAAKpC,WAAWoC,EAAK/B,WAAajD,EAElC,CAGD,IADAoD,EAAM,IAAImC,EAAcP,EAAK/E,QACvBF,EAAI,EAAGA,EAAIiF,EAAK/E,OAAQF,IAC7BqD,EAAKrD,GAAMiF,EAAMjF,GAElBiF,EAAO5B,CACR,CAGA,IAFA9E,GAAO,EACP0B,EAAI,EACED,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBH,EAAKtB,GAAQ0G,EAAMhF,GACnBJ,EAAKtB,EAAI,GAAM0G,EAAMhF,EAAE,GACvB1B,GAAO,EACP0B,GAAK,CAGP,KAhCA,CAiCA,IAAKe,EAAcnC,GA2DnB,MAAM,IAAI8B,UAAWP,EAAQ,kIAAmIvB,IAxD/J,IADAmG,EAAInG,EAAMqB,OACJF,EAAI,EAAGA,EAAIgF,EAAGhF,IACnB,IAAMN,EAAeb,EAAOmB,IAAQ,CACnCsD,GAAM,EACN,KACD,CAGD,GAAKA,EAAM,CACV,IAAMhC,EAAQ0D,GACb,MAAM,IAAI/B,WAAY7C,EAAQ,6GAA8G4E,IAE7I,GAAKzG,EAAKyG,EAAE,EAAKhC,KAAKP,QACrB,MAAM,IAAIQ,WAAY,0FAMvB,GAJAgC,EAAOpG,EAGPoB,EAAIJ,EAAIgD,WAActE,EAAIkB,EAEzBwF,EAAKxB,SAAW5D,EAAI4D,QAEnBwB,EAAKpC,WAAa5C,GAClBgF,EAAKpC,WAAWoC,EAAK/B,WAAajD,EAElC,CAGD,IADAoD,EAAM,IAAImC,EAAcR,GAClBhF,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBqD,EAAKrD,GAAMiF,EAAMjF,GAElBiF,EAAO5B,CACR,CAIA,IAHA9E,GAAO,EACPyG,GAAK,EACL/E,EAAI,EACED,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBH,EAAKtB,GAAQ0G,EAAMhF,GACnBJ,EAAKtB,EAAI,GAAM0G,EAAMhF,EAAE,GACvB1B,GAAO,EACP0B,GAAK,EAEN,MACD,CAEA,GAAK1B,EAAIyG,EAAIhC,KAAKP,QACjB,MAAM,IAAIQ,WAAY,0FAGvB,IADA1E,GAAO,EACDyB,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBD,EAAIlB,EAAOmB,GACXH,EAAKtB,GAAQ+G,EAAOvF,GACpBF,EAAKtB,EAAI,GAAMgH,EAAOxF,GACtBxB,GAAO,CAxDT,CA+DD,IA2EAqD,EAAa8D,EAAelC,UAAW,SAAS,SAAgBG,EAAOO,GACtE,IAAIgB,EACAN,EACAtE,EACA/B,EACAsB,EACAC,EACAE,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,GAFAd,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACe,IAArBM,UAAU7C,OACdyD,EAAQ,EACRO,EAAMpE,MACA,CACN,IAAMyB,EAAWoC,GAChB,MAAM,IAAIhD,UAAWP,EAAQ,oEAAqEuD,IAQnG,GANKA,EAAQ,IACZA,GAAS7D,GACI,IACZ6D,EAAQ,GAGgB,IAArBZ,UAAU7C,OACdgE,EAAMpE,MACA,CACN,IAAMyB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,qEAAsE8D,IAE/FA,EAAM,GACVA,GAAOpE,GACI,IACVoE,EAAM,GAEIA,EAAMpE,IACjBoE,EAAMpE,EAER,CACD,CAQA,IANCoF,EADIvB,EAAQO,EACHA,EAAMP,EAEN,EAGViB,GADAtE,EAAM,IAAI0C,KAAKzD,YAAa2F,IACfxC,QACP1C,EAAI,EAAGA,EAAIkF,EAAQlF,IACxBzB,EAAM,GAAGyB,EAAE2D,GACXiB,EAAQ,EAAE5E,GAAMH,EAAKtB,GACrBqG,EAAS,EAAE5E,EAAG,GAAMH,EAAKtB,EAAI,GAE9B,OAAO+B,CACR,IA+BAsB,EAAa8D,EAAelC,UAAW,QAAQ,SAAeS,EAAWpD,GACxE,IAAIhB,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMU,EAAY4C,GACjB,MAAM,IAAItD,UAAWP,EAAQ,oEAAqE6D,IAGnG,IADApE,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9B,GAAKiE,EAAUnD,KAAMD,EAAS8E,EAAc9F,EAAKG,GAAKA,EAAGgD,MACxD,OAAO,EAGT,OAAO,CACR,IA2EApB,EAAa8D,EAAelC,UAAW,YAAY,SAAmB2B,EAAOjB,GAC5E,IAAIkB,EACAvF,EACAC,EACJ,IAAMyC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,GAFAd,EAAMmD,KAAKN,QACX5C,EAAMkD,KAAKP,QACe,IAArBM,UAAU7C,OACdiF,EAAQ,EACRjB,EAAMpE,MACA,CACN,IAAMyB,EAAW4D,GAChB,MAAM,IAAIxE,UAAWP,EAAQ,oEAAqE+E,IAQnG,GANKA,EAAQ,IACZA,GAASrF,GACI,IACZqF,EAAQ,GAGgB,IAArBpC,UAAU7C,OACdgE,EAAMpE,MACA,CACN,IAAMyB,EAAW2C,GAChB,MAAM,IAAIvD,UAAWP,EAAQ,qEAAsE8D,IAE/FA,EAAM,GACVA,GAAOpE,GACI,IACVoE,EAAM,GAEIA,EAAMpE,IACjBoE,EAAMpE,EAER,CACD,CAWA,OAVKqF,GAASrF,GACbA,EAAM,EACNsF,EAASvF,EAAIqD,YACFiC,GAASjB,GACpBpE,EAAM,EACNsF,EAASvF,EAAIgD,WAAcsC,EAAM1F,IAEjCK,EAAMoE,EAAMiB,EACZC,EAASvF,EAAIgD,WAAesC,EAAM1F,GAE5B,IAAIuD,KAAKzD,YAAaM,EAAI4D,OAAQ2B,EAAUtF,EAAM,EAAM,EAAIA,EACpE,IAmDA8B,EAAa8D,EAAelC,UAAW,cAAc,WACpD,IAAIoB,EACAtE,EACAR,EACAD,EACAG,EACAC,EACJ,IAAMsC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAMtB,IAJAb,EAAMkD,KAAKP,QACXnC,EAAM,IAAI0C,KAAKzD,YAAaO,GAC5BD,EAAMmD,KAAKN,QACXkC,EAAStE,EAAIoC,QACP1C,EAAI,EAAGA,EAAIF,EAAKE,IACrBC,EAAIH,EAAME,EAAI,EACd4E,EAAS,EAAE5E,GAAOH,EAAM,EAAEI,GAC1B2E,EAAS,EAAE5E,EAAG,GAAMH,EAAM,EAAEI,EAAG,GAEhC,OAAOK,CACR,IAoBAsB,EAAa8D,EAAelC,UAAW,YAAY,WAClD,IAAIlD,EACAT,EACAG,EACJ,IAAMuC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAItB,IAFAL,EAAM,GACNT,EAAMmD,KAAKN,QACL1C,EAAI,EAAGA,EAAIgD,KAAKP,QAASzC,IAC9BM,EAAII,KAAMiF,EAAc9F,EAAKG,GAAI0E,YAElC,OAAOpE,EAAIqE,KAAM,IAClB,IAuCA/C,EAAa8D,EAAelC,UAAW,QAAQ,SAAmB6B,EAAOxG,GACxE,IAAIgB,EACAS,EACAR,EACJ,IAAMyC,EAAgBS,MACrB,MAAM,IAAIrC,UAAW,6DAEtB,IAAMY,EAAW8D,GAChB,MAAM,IAAI1E,UAAWP,EAAQ,oEAAqEiF,IAMnG,GAJAvF,EAAMkD,KAAKP,QACN4C,EAAQ,IACZA,GAASvF,GAELuF,EAAQ,GAAKA,GAASvF,EAC1B,MAAM,IAAImD,WAAY7C,EAAQ,kEAAmEiF,IAElG,IAAM3F,EAAeb,GACpB,MAAM,IAAI8B,UAAWP,EAAQ,2EAA4EvB,IAM1G,OAHAgB,GADAS,EAAM,IAAI0C,KAAKzD,YAAayD,KAAKN,UACvBA,SACL,EAAE2C,GAAUC,EAAOzG,GACxBgB,EAAM,EAAEwF,EAAO,GAAME,EAAO1G,GACrByB,CACR,IAKAnC,EAAOC,QAAUsH,YC95EjBvH,EAAOC,QAlBW,CACjB,aAAgB,UAChB,aAAgB,UAChB,MAAS,UACT,WAAc,QACd,WAAc,QACd,UAAa,OACb,YAAe,SACf,YAAe,SACf,WAAc,QACd,kBAAqB,SACrB,eAAkB,YAClB,gBAAmB,8BCbpB,IAAI0D,EAAe5D,EAAS,MACxBsH,EAAetH,EAAS,MACxB0H,EAAc1H,EAAS,MACvB2H,EAAa3H,EAAS,MACtB4H,EAAc5H,EAAS,MACvB6H,EAAa7H,EAAS,MACtB8H,EAAa9H,EAAS,MACtB+H,EAAoB/H,EAAS,MAS7BgI,EAAQ,CACXpE,EACA0D,EACAK,EACAD,EACAG,EACAD,EAde5H,EAAS,MAgBxB8H,EACAC,EAhBoB/H,EAAS,MACRA,EAAS,MAuB/BC,EAAOC,QAAU8H,YCfjB/H,EAAOC,QAjBM,CACZ,UACA,UACA,QACA,SACA,QACA,SACA,OACA,QACA,SACA,YACA,6BCSD,IAAIH,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAIkI,EAAWjI,EAAS,KACpBiD,EAAUjD,EAAS,KACnBkI,EAAkBlI,EAAS,MAC3BmI,EAAanI,EAAS,MACtBgI,EAAQhI,EAAS,MACjBoI,EAASpI,EAAS,MAKlBqI,EAASD,EAAOpG,OAsCpB/B,EAAOC,QApBP,SAAgBS,GACf,IAAImB,EACJ,GAAKmB,EAAStC,GACb,MAAO,UAER,GAAKsH,EAAUtH,GACd,OAAO,KAER,IAAMmB,EAAI,EAAGA,EAAIuG,EAAQvG,IACxB,GAAKnB,aAAiBqH,EAAOlG,GAC5B,OAAOsG,EAAQtG,GAIjB,OAAOqG,EAAYD,EAAiBvH,KAAa,IAClD,kBC/BA,IAOI2H,EAPAC,EAAyBvI,EAAS,MAClCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIC,IACGC,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAAiC,oBAAjBhB,aAAgCA,kBAAe,EAKnErH,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAI,EAAyB1I,EAAS,MAClCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADII,IACGF,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAAiC,oBAAjB1E,aAAgCA,kBAAe,EAKnE3D,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAK,EAAuB3I,EAAS,MAChCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIK,IACGH,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAA+B,oBAAfT,WAA8BA,gBAAa,EAK/D5H,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAM,EAAuB5I,EAAS,MAChCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIM,IACGJ,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAA+B,oBAAfX,WAA8BA,gBAAa,EAK/D1H,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAO,EAAsB7I,EAAS,MAC/BwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIO,IACGL,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAA8B,oBAAdQ,UAA6BA,eAAY,EAK7D7I,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCTA,IAAI6D,EAAY9I,EAAS,MACrB8H,EAAa9H,EAAS,MACtB+H,EAAoB/H,EAAS,MAC7B6H,EAAa7H,EAAS,MACtB4H,EAAc5H,EAAS,MACvB2H,EAAa3H,EAAS,MACtB0H,EAAc1H,EAAS,MACvBsH,EAAetH,EAAS,MAQxBgI,EAAQ,CACX,CARkBhI,EAAS,MAQX,gBAChB,CAAEsH,EAAc,gBAChB,CAAEK,EAAY,cACd,CAAED,EAAa,eACf,CAAEG,EAAY,cACd,CAAED,EAAa,eACf,CAAEkB,EAAW,aACb,CAAEhB,EAAY,cACd,CAAEC,EAAmB,qBACrB,CAhBoB/H,EAAS,MAgBX,kBAClB,CAhBqBA,EAAS,KAgBX,oBAMpBC,EAAOC,QAAU8H,kBClBjB,IAAIjI,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCnBjB,IAAIgJ,EAAe/I,EAAS,MACxBgJ,EAAsBhJ,EAAS,MAC/B+D,EAAgB/D,EAAS,MACzBgE,EAAiBhE,EAAS,MAC1BkC,EAASlC,EAAS,MAClBiJ,EAAWjJ,EAAS,MAsDxBC,EAAOC,QA7BP,SAA0BE,GACzB,IAAI8I,EACA9G,EACAN,EAEJ,GAAKiH,EAAc3I,GAClB8I,EAAO9I,MACD,KAAK4I,EAAqB5I,GAOhC,MAAM,IAAIqC,UAAWP,EAAQ,6DAA8D9B,IAL1F8I,EAD8B,IAA1B9I,EAAImB,kBACDwC,EAAe3D,EAAK,GAEpB4D,EAAgB5D,EAAK,EAI9B,CAKA,IAJAgC,EAAM,CACL,KAAQ6G,EAAU7I,GAClB,KAAQ,IAEH0B,EAAI,EAAGA,EAAIoH,EAAKlH,OAAQF,IAC7BM,EAAI8G,KAAK1G,KAAM0G,EAAMpH,IAEtB,OAAOM,CACR,kBCtDA,IAAI+G,EAAanJ,EAAS,MACtBoJ,EAAWpJ,EAAS,MACpBqJ,EAAiBrJ,EAAS,MAC1BgI,EAAQhI,EAAS,MA4CrBC,EAAOC,QAzBP,SAAmBE,GAClB,IAAIyB,EACAC,EAGJ,IAAMA,EAAI,EAAGA,EAAIkG,EAAMhG,OAAQF,IAC9B,GAAKqH,EAAY/I,EAAK4H,EAAOlG,GAAK,IACjC,OAAOkG,EAAOlG,GAAK,GAIrB,KAAQ1B,GAAM,CAEb,IADAyB,EAAIuH,EAAUhJ,GACR0B,EAAI,EAAGA,EAAIkG,EAAMhG,OAAQF,IAC9B,GAAKD,IAAMmG,EAAOlG,GAAK,GACtB,OAAOkG,EAAOlG,GAAK,GAGrB1B,EAAMiJ,EAAgBjJ,EACvB,CACD,kBC9BA,IAOIkI,EAPAgB,EAAwBtJ,EAAS,MACjCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIgB,IACGd,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAAgC,oBAAhBV,YAA+BA,iBAAc,EAKjE3H,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAiB,EAAwBvJ,EAAS,MACjCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIiB,IACGf,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAAgC,oBAAhBZ,YAA+BA,iBAAc,EAKjEzH,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAkB,EAAuBxJ,EAAS,MAChCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADIkB,IACGhB,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAA+B,oBAAfR,WAA8BA,gBAAa,EAK/D7H,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,kBCGA,IAOIqD,EAPAmB,EAA8BzJ,EAAS,MACvCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsI,EADImB,IACGjB,EAEAC,EAMRxI,EAAOC,QAAUoI,YC7BjB,IAAIA,EAAsC,oBAAtBP,kBAAqCA,uBAAoB,EAK7E9H,EAAOC,QAAUoI,YCSjBrI,EAAOC,QAPP,WACC,MAAM,IAAI+E,MAAO,kBAClB,YCTA,IAAIlF,EAAiC,oBAAjBuH,aAAgCA,aAAe,KAKnErH,EAAOC,QAAUH,kBCOjB,IAAIwI,EAAyBvI,EAAS,MAKtCC,EAAOC,QAAUqI,kBCjBjB,IAAImB,EAAiB1J,EAAS,MAC1B2J,EAAO3J,EAAS,MAChB4J,EAAqB5J,EAAS,MAwClCC,EAAOC,QA1BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAmC,oBAAvBwJ,EACX,OAAO,EAGR,IACCxJ,EAAM,IAAIwJ,EAAoB,CAAE,EAAK,MAAO,KAAM,OAClDC,EACCH,EAAgBtJ,IACH,IAAbA,EAAK,IACQ,oBAAbA,EAAK,KACS,oBAAdA,EAAK,IACLA,EAAK,KAAQuJ,CAEf,CAAE,MAAQG,GACTD,GAAO,CACR,CACA,OAAOA,CACR,YCrCA,IAAI9J,EAAiC,oBAAjB6D,aAAgCA,aAAe,KAKnE3D,EAAOC,QAAUH,kBCOjB,IAAI2I,EAAyB1I,EAAS,MAKtCC,EAAOC,QAAUwI,kBCjBjB,IAAIqB,EAAiB/J,EAAS,MAC1BgK,EAAqBhK,EAAS,MAwClCC,EAAOC,QA1BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAmC,oBAAvB4J,EACX,OAAO,EAGR,IACC5J,EAAM,IAAI4J,EAAoB,CAAE,EAAK,MAAO,KAAMC,MAClDJ,EACCE,EAAgB3J,IACH,IAAbA,EAAK,IACQ,OAAbA,EAAK,KACS,OAAdA,EAAK,IACLA,EAAK,KAAQA,EAAK,EAEpB,CAAE,MAAQ0J,GACTD,GAAO,CACR,CACA,OAAOA,CACR,YC1BA5J,EAAOC,QAPP,WACC,kBCQD,IAAIH,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAImK,EAAMlK,EAAS,MAqBnBC,EAAOC,QAPP,WACC,MAAsB,QAAbgK,EAAI5I,IACd,kBCJA,IAAIqH,EAAuB3I,EAAS,MAKpCC,EAAOC,QAAUyI,WCjBjB,IAAI5I,EAA+B,oBAAf8H,WAA8BA,WAAa,KAK/D5H,EAAOC,QAAUH,kBCLjB,IAAIoK,EAAenK,EAAS,MACxBoK,EAAYpK,EAAS,MACrBqK,EAAYrK,EAAS,KACrBsK,EAAmBtK,EAAS,KAwChCC,EAAOC,QA1BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAiC,oBAArBkK,EACX,OAAO,EAGR,IACClK,EAAM,IAAIkK,EAAkB,CAAE,EAAG,MAAO,KAAMF,EAAU,IACxDP,EACCM,EAAc/J,IACD,IAAbA,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQiK,CAEf,CAAE,MAAQP,GACTD,GAAO,CACR,CACA,OAAOA,CACR,kBC1BA,IAAIjB,EAAuB5I,EAAS,MAKpCC,EAAOC,QAAU0I,YCjBjB,IAAI7I,EAA+B,oBAAf4H,WAA8BA,WAAa,KAK/D1H,EAAOC,QAAUH,kBCLjB,IAAIwK,EAAevK,EAAS,MACxBwK,EAAYxK,EAAS,KACrByK,EAAYzK,EAAS,MACrB0K,EAAmB1K,EAAS,MAwChCC,EAAOC,QA1BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAiC,oBAArBsK,EACX,OAAO,EAGR,IACCtK,EAAM,IAAIsK,EAAkB,CAAE,EAAG,MAAO,KAAMF,EAAU,IACxDX,EACCU,EAAcnK,IACD,IAAbA,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQqK,CAEf,CAAE,MAAQX,GACTD,GAAO,CACR,CACA,OAAOA,CACR,kBC1BA,IAAIhB,EAAsB7I,EAAS,MAKnCC,EAAOC,QAAU2I,YCjBjB,IAAI9I,EAA8B,oBAAd+I,UAA6BA,UAAY,KAK7D7I,EAAOC,QAAUH,kBCLjB,IAAI4K,EAAc3K,EAAS,MACvB4K,EAAW5K,EAAS,MACpB6K,EAAW7K,EAAS,MACpB8K,EAAkB9K,EAAS,MAwC/BC,EAAOC,QA1BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAgC,oBAApB0K,EACX,OAAO,EAGR,IACC1K,EAAM,IAAI0K,EAAiB,CAAE,EAAG,MAAO,KAAMF,EAAS,IACtDf,EACCc,EAAavK,IACA,IAAbA,EAAK,IACQ,IAAbA,EAAK,KACS,IAAdA,EAAK,IACLA,EAAK,KAAQyK,CAEf,CAAE,MAAQf,GACTD,GAAO,CACR,CACA,OAAOA,CACR,kBC1BA,IAAI9J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAIgL,EAAa/K,EAAS,MACtBgL,EAAShL,EAAS,MA0BtBC,EAAOC,QAZP,WACC,MACmB,oBAAX8K,GACoB,kBAApBA,EAAQ,QACfD,EAAYC,EAAQ,aACO,kBAApBA,EAAOC,QAEhB,kBCHA,IAAIlL,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCxBjB,IAAImL,EAAMC,OAAO7F,UAAU8F,eAyC3BnL,EAAOC,QAbP,SAAqBS,EAAO0K,GAC3B,YACW,IAAV1K,GACU,OAAVA,GAIMuK,EAAItI,KAAMjC,EAAO0K,EACzB,kBCxBA,IAAItL,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCEjBE,EAAOC,QAVP,WACC,MACmB,oBAAX8K,QACoB,kBAApBA,OAAQ,MAEjB,kBCFA,IAAIjL,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAKI8F,EALa7F,EAAS,KAKhBsL,GAqBVrL,EAAOC,QAPP,WACC,OAAS2F,GAAqC,kBAAvBmF,OAAOO,WAC/B,kBCTA,IAAIjC,EAAwBtJ,EAAS,MAKrCC,EAAOC,QAAUoJ,kBCjBjB,IAAIkC,EAAgBxL,EAAS,MACzByL,EAAazL,EAAS,MACtB0L,EAAoB1L,EAAS,MA0CjCC,EAAOC,QA5BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAkC,oBAAtBsL,EACX,OAAO,EAGR,IAECtL,EAAM,IAAIsL,EADVtL,EAAM,CAAE,EAAG,MAAO,KAAMqL,EAAW,EAAGA,EAAW,IAEjD5B,EACC2B,EAAepL,IACF,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQqL,EAAW,GACX,IAAbrL,EAAK,IACQ,IAAbA,EAAK,EAEP,CAAE,MAAQ0J,GACTD,GAAO,CACR,CACA,OAAOA,CACR,YCvCA,IAAI9J,EAAgC,oBAAhB6H,YAA+BA,YAAc,KAKjE3H,EAAOC,QAAUH,kBCOjB,IAAIwJ,EAAwBvJ,EAAS,MAKrCC,EAAOC,QAAUqJ,kBCjBjB,IAAIoC,EAAgB3L,EAAS,MACzB4L,EAAa5L,EAAS,MACtB6L,EAAoB7L,EAAS,KA0CjCC,EAAOC,QA5BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAkC,oBAAtByL,EACX,OAAO,EAGR,IAECzL,EAAM,IAAIyL,EADVzL,EAAM,CAAE,EAAG,MAAO,KAAMwL,EAAW,EAAGA,EAAW,IAEjD/B,EACC8B,EAAevL,IACF,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQwL,EAAW,GACX,IAAbxL,EAAK,IACQ,IAAbA,EAAK,EAEP,CAAE,MAAQ0J,GACTD,GAAO,CACR,CACA,OAAOA,CACR,WCvCA,IAAI9J,EAAgC,oBAAhB2H,YAA+BA,YAAc,KAKjEzH,EAAOC,QAAUH,kBCOjB,IAAIyJ,EAAuBxJ,EAAS,MAKpCC,EAAOC,QAAUsJ,kBCjBjB,IAAIsC,EAAe9L,EAAS,MACxB+L,EAAY/L,EAAS,MACrBgM,EAAmBhM,EAAS,MA0ChCC,EAAOC,QA5BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAiC,oBAArB4L,EACX,OAAO,EAGR,IAEC5L,EAAM,IAAI4L,EADV5L,EAAM,CAAE,EAAG,MAAO,KAAM2L,EAAU,EAAGA,EAAU,IAE/ClC,EACCiC,EAAc1L,IACD,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACLA,EAAK,KAAQ2L,EAAU,GACV,IAAb3L,EAAK,IACQ,IAAbA,EAAK,EAEP,CAAE,MAAQ0J,GACTD,GAAO,CACR,CACA,OAAOA,CACR,YCvCA,IAAI9J,EAA+B,oBAAf+H,WAA8BA,WAAa,KAK/D7H,EAAOC,QAAUH,kBCOjB,IAAI0J,EAA8BzJ,EAAS,MAK3CC,EAAOC,QAAUuJ,kBCjBjB,IAAIwC,EAAsBjM,EAAS,MAC/BkM,EAA0BlM,EAAS,KA2CvCC,EAAOC,QA7BP,WACC,IAAI2J,EACAzJ,EAEJ,GAAwC,oBAA5B8L,EACX,OAAO,EAGR,IACC9L,EAAM,IAAI8L,EAAyB,EAAG,EAAG,EAAG,EAAG,KAAM,KAAM,IAAK,MAChErC,EACCoC,EAAqB7L,IACR,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,IAAbA,EAAK,IACQ,MAAbA,EAAK,IACQ,MAAbA,EAAK,EAEP,CAAE,MAAQ0J,GACTD,GAAO,CACR,CACA,OAAOA,CACR,WCvCA,IAAI9J,EAAsC,oBAAtBgI,kBAAqCA,kBAAoB,KAK7E9H,EAAOC,QAAUH,kBCmBjB,IAAIA,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC7BjB,IAAImC,EAASlC,EAAS,MA4CtBC,EAAOC,QAXP,SAAqBS,EAAOU,GAE3B,GAA4B,oBAAhBA,EACX,MAAM,IAAIoB,UAAWP,EAAQ,mEAAoEb,IAElG,OAASV,aAAiBU,CAC3B,kBCvCA,IAKIwI,EALAsC,EAAcnM,EAAS,KA2B3B6J,EAPA,WACC,OAAOsC,EAAatH,UACrB,CAKOuH,GAKPnM,EAAOC,QAAU2J,kBCbjB,IAOIsC,EAPAE,EAAoBrM,EAAS,MAC7BD,EAAOC,EAAS,KAChByI,EAAWzI,EAAS,MAOvBmM,EADIE,EACUtM,EAEA0I,EAMfxI,EAAOC,QAAUiM,iBCpCjB,IAAIG,EAActM,EAAS,MA+B3BC,EAAOC,QAPP,SAAsBS,GACrB,MAAkC,uBAAzB2L,EAAa3L,EACvB,kBC1BA,IAAIoK,EAAa/K,EAAS,MACtBuM,EAAuBvM,EAAS,MAChCiD,EAAUjD,EAAS,KACnBqD,EAAYrD,EAAS,KACrBwM,EAAaxM,EAAS,MAyC1BC,EAAOC,QAjBP,SAAsBS,GACrB,OACW,OAAVA,GACiB,kBAAVA,IACNsC,EAAStC,IACc,kBAAjBA,EAAMqB,QACbqB,EAAW1C,EAAMqB,SACjBrB,EAAMqB,QAAU,GAChBrB,EAAMqB,QAAUwK,GAChBzB,EAAYpK,EAAO,YAClB4L,EAAsB5L,EAAO,SAEhC,kBCtBA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCvBjB,IAAIsD,EAAYrD,EAAS,KACrBwM,EAAaxM,EAAS,MAqC1BC,EAAOC,QAdP,SAA4BS,GAC3B,MACkB,kBAAVA,GACG,OAAVA,GACwB,kBAAjBA,EAAMqB,QACbqB,EAAW1C,EAAMqB,SACjBrB,EAAMqB,QAAU,GAChBrB,EAAMqB,QAAUwK,CAElB,iBClBA,IAAIzM,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAKIS,EALA8L,EAActM,EAAS,MAgC1BQ,EADIiM,MAAMxJ,QACNwJ,MAAMxJ,QARX,SAAkBtC,GACjB,MAAkC,mBAAzB2L,EAAa3L,EACvB,EAcAV,EAAOC,QAAUM,kBCxBjB,IAAIT,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCrBjB,IAAIuM,EAActM,EAAS,MAKvB0M,EAA0C,oBAAhBC,YA+B9B1M,EAAOC,QAVP,SAAwBS,GACvB,OACG+L,GAAkB/L,aAAiBgM,aACZ,yBAAzBL,EAAa3L,EAEf,kBCKA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBClDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAsCxBC,EAAOC,QAPP,SAAoBS,GACnB,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBClCA,IAAIkM,EAAiB7M,EAAS,MAC1BsM,EAActM,EAAS,MACvB8M,EAAU9M,EAAS,KACnB+M,EAAO/M,EAAS,MAKhB6F,EAAMgH,IAqCV5M,EAAOC,QAhBP,SAAoBS,GACnB,MAAsB,kBAAVA,IACNA,aAAiBmM,IAGjBjH,EACGkH,EAAMpM,GAEoB,qBAAzB2L,EAAa3L,IAGxB,YCfAV,EAAOC,QAPP,SAAoBS,GACnB,MAA0B,mBAAVA,CACjB,YCrBA,IAAI6F,EAAWsG,QAAQxH,UAAUkB,SAKjCvG,EAAOC,QAAUsG,kBCJjB,IAAIA,EAAWxG,EAAS,MAwBxBC,EAAOC,QAZP,SAAeS,GACd,IAEC,OADA6F,EAAS5D,KAAMjC,IACR,CACR,CAAE,MAAQmJ,GACT,OAAO,CACR,CACD,iBCJA,IAAI/J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAIiN,EAAehN,EAAS,MA+C5BC,EAAOC,QApBP,SAAmBS,GAClB,OACCqM,EAAcrM,KAGbA,EAAMsM,WAELtM,EAAMU,aAGgC,oBAA/BV,EAAMU,YAAY4G,UACzBtH,EAAMU,YAAY4G,SAAUtH,GAIhC,kBC3BA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAIsD,EAAYrD,EAAS,KACrBwM,EAAaxM,EAAS,MAiC1BC,EAAOC,QAdP,SAAuBS,GACtB,MACkB,kBAAVA,GACG,OAAVA,GACwB,kBAAjBA,EAAMqB,QACbqB,EAAW1C,EAAMqB,SACjBrB,EAAMqB,QAAU,GAChBrB,EAAMqB,QAAUwK,CAElB,kBCVA,IAAIzM,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCxBjB,IAAI8D,EAAa7D,EAAS,MACtBuH,EAAYvH,EAAS,MAsCzBC,EAAOC,QAfP,SAAwBS,GACvB,OAAKA,aAAiBkD,GAAclD,aAAiB4G,GAInC,kBAAV5G,GACG,OAAVA,GACoB,kBAAbA,EAAMsF,IACO,kBAAbtF,EAAMuF,EAEf,kBClCA,IAAIsB,EAAiBxH,EAAS,MAM1BgI,EAAQ,CALUhI,EAAS,KAO9BwH,GAMDvH,EAAOC,QAAU8H,kBCDjB,IAAIjI,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBClBjB,IAAIqJ,EAAWpJ,EAAS,MACpBqJ,EAAiBrJ,EAAS,MAC1BgI,EAAQhI,EAAS,MACjBkN,EAAQlN,EAAS,MA+CrBC,EAAOC,QA9BP,SAA8BS,GAC7B,IAAIkB,EACAC,EAEJ,GAAsB,kBAAVnB,GAAgC,OAAVA,EACjC,OAAO,EAGR,IAAMmB,EAAI,EAAGA,EAAIkG,EAAMhG,OAAQF,IAC9B,GAAKnB,aAAiBqH,EAAOlG,GAC5B,OAAO,EAIT,KAAQnB,GAAQ,CAEf,IADAkB,EAAIuH,EAAUzI,GACRmB,EAAI,EAAGA,EAAIoL,EAAMlL,OAAQF,IAC9B,GAAKoL,EAAOpL,KAAQD,EACnB,OAAO,EAGTlB,EAAQ0I,EAAgB1I,EACzB,CAEA,OAAO,CACR,kBC7CA,IAKIkJ,EAkBJA,GAvBa7J,EAAS,MAiBN4C,KAAM,OAAQ,KAW9B3C,EAAOC,QAAU2J,kBCTjB,IAAI9J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCxBjB,IAAImD,EAAWlD,EAAS,MACpBmN,EAAQnN,EAAAA,KAAAA,YACRqD,EAAYrD,EAAAA,MAAAA,YACZoN,EAASpN,EAAS,MAClBqN,EAAmBrN,EAAS,MAqDhCC,EAAOC,QAzBP,SAA+BS,EAAO0K,GACrC,IAAIxB,EACJ,YACW,IAAVlJ,GACU,OAAVA,MAIDkJ,EAAOuD,EAAOxK,KAAMjC,EAAO0K,KACbgC,GAAoBnK,EAAUvC,IAIzCwM,EAFF9B,GAAYA,IAGXhI,EAAWgI,IACXA,GAAY,GACZA,EAAW1K,EAAMqB,OAGZ6H,EACR,YC1BA,IAAI0C,EAAuBpB,OAAO7F,UAAUgI,qBAK5CrN,EAAOC,QAAUqM,kBChBjB,IAAI7C,EAAiB1J,EAAS,MAK9BC,EAAOC,QAAUwJ,kBCpBjB,IAAI4C,EAActM,EAAS,MAKvBuN,EAA4C,oBAAjBjG,aA6B/BrH,EAAOC,QAVP,SAAyBS,GACxB,OACG4M,GAAmB5M,aAAiB2G,cACb,0BAAzBgF,EAAa3L,EAEf,kBCdA,IAAIoJ,EAAiB/J,EAAS,IAK9BC,EAAOC,QAAU6J,gBCpBjB,IAAIuC,EAActM,EAAS,MAKvBwN,EAA4C,oBAAjB5J,aA6B/B3D,EAAOC,QAVP,SAAyBS,GACxB,OACG6M,GAAmB7M,aAAiBiD,cACb,0BAAzB0I,EAAa3L,EAEf,kBCbA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCrBjB,IAAI0N,EAASzN,EAAS,MA2BtBC,EAAOC,QARP,SAAqBS,GAEpB,MAA6B,aAApB8M,EAAQ9M,EAClB,kBCPA,IAAIwJ,EAAenK,EAAS,MAK5BC,EAAOC,QAAUiK,kBCpBjB,IAAImC,EAActM,EAAS,MAKvB0N,EAAwC,oBAAf7F,WA6B7B5H,EAAOC,QAVP,SAAuBS,GACtB,OACG+M,GAAiB/M,aAAiBkH,YACX,wBAAzByE,EAAa3L,EAEf,kBCdA,IAAI4J,EAAevK,EAAS,MAK5BC,EAAOC,QAAUqK,kBCpBjB,IAAI+B,EAActM,EAAS,MAKvB2N,EAAwC,oBAAfhG,WA6B7B1H,EAAOC,QAVP,SAAuBS,GACtB,OACGgN,GAAiBhN,aAAiBgH,YACX,wBAAzB2E,EAAa3L,EAEf,kBCdA,IAAIgK,EAAc3K,EAAS,MAK3BC,EAAOC,QAAUyK,kBCpBjB,IAAI2B,EAActM,EAAS,MAKvB4N,EAAsC,oBAAd9E,UA6B5B7I,EAAOC,QAVP,SAAsBS,GACrB,OACGiN,GAAgBjN,aAAiBmI,WACV,uBAAzBwD,EAAa3L,EAEf,kBCYA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBCvDjB,IAAI4J,EAAO3J,EAAS,MAChB6N,EAAO7N,EAAS,MAChB8N,EAAQ9N,EAAS,KAuBrBC,EAAOC,QAXP,SAAoBS,GACnB,OACCA,EAAQgJ,GACRhJ,EAAQkN,GACRC,EAAOnN,EAET,kBCpBA,IAAIiM,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAkCxBC,EAAOC,QAPP,SAAoBS,GACnB,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBC9BA,IAAIoN,EAAW/N,EAAAA,MAAAA,SACX8N,EAAQ9N,EAAS,MA6BrBC,EAAOC,QAVP,SAAoBS,GACnB,OACCoN,EAAUpN,IACVmN,EAAOnN,EAAMqN,UAEf,kBCzBA,IAAID,EAAW/N,EAAAA,MAAAA,YACX8N,EAAQ9N,EAAS,MA6BrBC,EAAOC,QAVP,SAAoBS,GACnB,OACCoN,EAAUpN,IACVmN,EAAOnN,EAET,kBCzBA,IAAImH,EAAa9H,EAAS,MAMtBiO,EAAQ,CACX,OANiBjO,EAAS,MAO1B,MAAS8H,GAMV7H,EAAOC,QAAU+N,iBCFjB,IAAIC,EAAmBlO,EAAS,MAKhCC,EAAOC,QAAUgO,kBCjBjB,IAKIrE,EALAoE,EAAQjO,EAAS,MA2CrB6J,EAvBA,WACC,IAAIsE,EAgBJ,OAbAA,EAAa,IAAIF,EAAe,OAAI,IAOxB,GAAM,KAMU,KAHhB,IAAIA,EAAc,MAAIE,EAAW5I,QAGzB,EACrB,CAKO6I,GAKPnO,EAAOC,QAAU2J,iBCNjB,IAAInG,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBCxDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAkCxBC,EAAOC,QAPP,SAAgBS,GACf,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBC9BA,IAAIoN,EAAW/N,EAAAA,MAAAA,SACXqO,EAAQrO,EAAS,MA6BrBC,EAAOC,QAVP,SAAgBS,GACf,OACCoN,EAAUpN,IACV0N,EAAO1N,EAAMqN,UAEf,kBCzBA,IAAID,EAAW/N,EAAAA,MAAAA,YACXqO,EAAQrO,EAAS,MAiCrBC,EAAOC,QAVP,SAAgBS,GACf,OACCoN,EAAUpN,IACV0N,EAAO1N,EAET,kBCaA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,KAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,iBCxDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAsCxBC,EAAOC,QAPP,SAA+BS,GAC9B,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBClCA,IAAI0C,EAAYrD,EAAAA,MAAAA,SA6BhBC,EAAOC,QAVP,SAA+BS,GAC9B,OACC0C,EAAW1C,IACXA,EAAMqN,WAAa,CAErB,kBCxBA,IAAI3K,EAAYrD,EAAAA,MAAAA,YA6BhBC,EAAOC,QAVP,SAA+BS,GAC9B,OACC0C,EAAW1C,IACXA,GAAS,CAEX,kBCkBA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,KAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,iBCxDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAkCxBC,EAAOC,QAPP,SAAmBS,GAClB,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBC9BA,IAAIkM,EAAiB7M,EAAS,MAC1BsM,EAActM,EAAS,MACvBsO,EAAStO,EAAS,MAClB+M,EAAO/M,EAAS,MAKhB6F,EAAMgH,IAmCV5M,EAAOC,QAhBP,SAAmBS,GAClB,MAAsB,kBAAVA,IACNA,aAAiB2N,IAGjBzI,EACGkH,EAAMpM,GAEoB,oBAAzB2L,EAAa3L,IAGxB,YCfAV,EAAOC,QAPP,SAAmBS,GAClB,MAA0B,kBAAVA,CACjB,kBClBA,IAMI6F,EANSxG,EAAS,MAMAsF,UAAUkB,SAKhCvG,EAAOC,QAAUsG,kBCXjB,IAAIA,EAAWxG,EAAS,MAwBxBC,EAAOC,QAZP,SAAeS,GACd,IAEC,OADA6F,EAAS5D,KAAMjC,IACR,CACR,CAAE,MAAQmJ,GACT,OAAO,CACR,CACD,kBCQA,IAAIpG,EAAc1D,EAAS,KACvBuO,EAAWvO,EAAS,MACpBD,EAAOC,EAAS,MAUpB0D,EAAa3D,EAAM,oBALKwO,EAAUxO,IAUlCE,EAAOC,QAAUH,YClBjBE,EAAOC,QAVP,SAAuBS,GACtB,OACW,OAAVA,GACiB,kBAAVA,CAET,kBCNA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAIkD,EAAUjD,EAAS,KA8BvBC,EAAOC,QAXP,SAAmBS,GAClB,MACkB,kBAAVA,GACG,OAAVA,IACCsC,EAAStC,EAEZ,kBCVA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAIiD,EAAWhD,EAAS,MACpBmD,EAAanD,EAAS,MACtBqJ,EAAiBrJ,EAAS,MAC1B+K,EAAa/K,EAAS,MACtBsM,EAActM,EAAS,MAKvBwO,EAAkBrD,OAAO7F,UAgF7BrF,EAAOC,QAvCP,SAAwBS,GACvB,IAAI8N,EAGJ,QAAMzL,EAAUrC,OAIhB8N,EAAQpF,EAAgB1I,MAOtBoK,EAAYpK,EAAO,gBAGpBoK,EAAY0D,EAAO,gBACnBtL,EAAYsL,EAAMpN,cACmB,sBAArCiL,EAAamC,EAAMpN,cAGnB0J,EAAY0D,EAAO,kBACnBtL,EAAYsL,EAAMC,iBAIjBD,IAAUD,GAzDb,SAAmBG,GAClB,IAAIC,EAGJ,IAAMA,KAAOD,EACZ,IAAM5D,EAAY4D,EAAKC,GACtB,OAAO,EAGT,OAAO,CACR,CAkDGC,CAAUlO,IAGb,kBC1CA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,KAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBCxDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,KA0CxBC,EAAOC,QAPP,SAA4BS,GAC3B,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,iBCtCA,IAAI0C,EAAYrD,EAAAA,MAAAA,SA6BhBC,EAAOC,QAVP,SAA4BS,GAC3B,OACC0C,EAAW1C,IACXA,EAAMqN,UAAY,CAEpB,kBCxBA,IAAI3K,EAAYrD,EAAAA,MAAAA,YA6BhBC,EAAOC,QAVP,SAA4BS,GAC3B,OACC0C,EAAW1C,IACXA,EAAQ,CAEV,iBCkBA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBCxDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAsCxBC,EAAOC,QAPP,SAA2BS,GAC1B,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBClCA,IAAIoN,EAAW/N,EAAAA,MAAAA,SA6BfC,EAAOC,QAVP,SAA2BS,GAC1B,OACCoN,EAAUpN,IACVA,EAAMqN,UAAY,CAEpB,kBCxBA,IAAID,EAAW/N,EAAAA,MAAAA,YA6BfC,EAAOC,QAVP,SAA2BS,GAC1B,OACCoN,EAAUpN,IACVA,EAAQ,CAEV,kBCYA,IAAI+C,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAChB4M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MAKxB0D,EAAa3D,EAAM,cAAe6M,GAClClJ,EAAa3D,EAAM,WAAYiD,GAK/B/C,EAAOC,QAAUH,kBClDjB,IAAI6M,EAAc5M,EAAS,MACvBgD,EAAWhD,EAAS,MA0BxBC,EAAOC,QAPP,SAAmBS,GAClB,OAASiM,EAAajM,IAAWqC,EAAUrC,EAC5C,kBCtBA,IAAIkM,EAAiB7M,EAAS,MAC1BsM,EAActM,EAAS,MACvB+M,EAAO/M,EAAS,MAKhB6F,EAAMgH,IAmCV5M,EAAOC,QAhBP,SAAmBS,GAClB,MAAsB,kBAAVA,IACNA,aAAiBmO,SAGjBjJ,EACGkH,EAAMpM,GAEoB,oBAAzB2L,EAAa3L,IAGxB,YClBAV,EAAOC,QAPP,SAAmBS,GAClB,MAA0B,kBAAVA,CACjB,kBCdA,IAAIqN,EAAUhO,EAAS,MAwBvBC,EAAOC,QAZP,SAAeS,GACd,IAEC,OADAqN,EAAQpL,KAAMjC,IACP,CACR,CAAE,MAAQmJ,GACT,OAAO,CACR,CACD,YCpBA,IAAIkE,EAAUc,OAAOxJ,UAAU0I,QAK/B/N,EAAOC,QAAU8N,kBCJjB,IAAIlF,EAAY9I,EAAS,MACrB8H,EAAa9H,EAAS,MACtB+H,EAAoB/H,EAAS,MAC7B6H,EAAa7H,EAAS,MACtB4H,EAAc5H,EAAS,MACvB2H,EAAa3H,EAAS,MACtB0H,EAAc1H,EAAS,MACvBsH,EAAetH,EAAS,MAMxBgI,EAAQ,CALOhI,EAAS,MAO3BsH,EACAK,EACAD,EACAG,EACAD,EACAkB,EACAhB,EACAC,GAMD9H,EAAOC,QAAU8H,kBCfjB,IAAIjI,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBClBjB,IAAIqJ,EAAWpJ,EAAS,MACpB+O,EAAU/O,EAAS,MACnBqJ,EAAiBrJ,EAAS,MAC1B0I,EAAyB1I,EAAS,MAClC4D,EAAe5D,EAAS,MACxBgI,EAAQhI,EAAS,MACjBkN,EAAQlN,EAAS,MAMjBgP,EAAetG,IAA6BW,EAAgBzF,GAAiBqL,EAajF,SAASA,IAAS,CAVlBD,EAAyC,eAA1BD,EAASC,GAAkCA,EAAaC,EA6DvEhP,EAAOC,QAlCP,SAAuBS,GACtB,IAAIkB,EACAC,EAEJ,GAAsB,kBAAVnB,GAAgC,OAAVA,EACjC,OAAO,EAGR,GAAKA,aAAiBqO,EACrB,OAAO,EAGR,IAAMlN,EAAI,EAAGA,EAAIkG,EAAMhG,OAAQF,IAC9B,GAAKnB,aAAiBqH,EAAOlG,GAC5B,OAAO,EAIT,KAAQnB,GAAQ,CAEf,IADAkB,EAAIuH,EAAUzI,GACRmB,EAAI,EAAGA,EAAIoL,EAAMlL,OAAQF,IAC9B,GAAKoL,EAAOpL,KAAQD,EACnB,OAAO,EAGTlB,EAAQ0I,EAAgB1I,EACzB,CAEA,OAAO,CACR,kBCxDA,IAAI6K,EAAgBxL,EAAS,MAK7BC,EAAOC,QAAUsL,kBCpBjB,IAAIc,EAActM,EAAS,MAKvBkP,EAA0C,oBAAhBtH,YA6B9B3H,EAAOC,QAVP,SAAwBS,GACvB,OACGuO,GAAkBvO,aAAiBiH,aACZ,yBAAzB0E,EAAa3L,EAEf,kBCdA,IAAIgL,EAAgB3L,EAAS,MAK7BC,EAAOC,QAAUyL,kBCpBjB,IAAIW,EAActM,EAAS,MAKvBmP,EAA0C,oBAAhBzH,YA6B9BzH,EAAOC,QAVP,SAAwBS,GACvB,OACGwO,GAAkBxO,aAAiB+G,aACZ,yBAAzB4E,EAAa3L,EAEf,kBCdA,IAAImL,EAAe9L,EAAS,MAK5BC,EAAOC,QAAU4L,kBCpBjB,IAAIQ,EAActM,EAAS,MAKvBoP,EAAwC,oBAAftH,WA6B7B7H,EAAOC,QAVP,SAAuBS,GACtB,OACGyO,GAAiBzO,aAAiBmH,YACX,wBAAzBwE,EAAa3L,EAEf,kBCdA,IAAIsL,EAAsBjM,EAAS,MAKnCC,EAAOC,QAAU+L,kBCpBjB,IAAIK,EAActM,EAAS,MAKvBqP,EAAsD,oBAAtBtH,kBA6BpC9H,EAAOC,QAVP,SAA8BS,GAC7B,OACG0O,GAAwB1O,aAAiBoH,mBAClB,+BAAzBuE,EAAa3L,EAEf,kBCRA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAIkD,EAAUjD,EAAS,KACnBkC,EAASlC,EAAS,MA6DtBC,EAAOC,QAnCP,SAAmB6F,GAClB,GAA0B,oBAAdA,EACX,MAAM,IAAItD,UAAWP,EAAQ,0DAA2D6D,IAEzF,OASA,SAAgBpF,GACf,IAAIiB,EACAE,EACJ,IAAMmB,EAAStC,GACd,OAAO,EAGR,GAAa,KADbiB,EAAMjB,EAAMqB,QAEX,OAAO,EAER,IAAMF,EAAI,EAAGA,EAAIF,EAAKE,IACrB,IAAiC,IAA5BiE,EAAWpF,EAAOmB,IACtB,OAAO,EAGT,OAAO,CACR,CACD,YCkBA7B,EAAOC,QA9BP,SAAgB4G,EAAG5F,EAAGoO,EAASC,EAASC,EAAGC,EAASC,GACnD,IAAIC,EACAC,EACAhP,EACAN,EACAuP,EACAC,EACAhO,EAYJ,IATA6N,EAAOzO,EAAEgI,KACT0G,EAAOJ,EAAEtG,KAGT5I,EAAMY,EAAE6O,UAAW,GACnBnP,EAAM4O,EAAEO,UAAW,GAEnBF,EAAKN,EACLO,EAAKJ,EACC5N,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBlB,EAAKgP,EAAME,EAAIxP,EAAKqP,EAAME,IAC1BA,GAAMP,EACNQ,GAAML,EAEP,OAAOvO,CACR,iBC9CA,IAAIwC,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,UALLC,EAAS,MAUvBC,EAAOC,QAAUH,kBCpCjB,IAAIiQ,EAAmBhQ,EAAS,MAC5B+P,EAAY/P,EAAS,MAoGzBC,EAAOC,QAzEP,SAAgB4G,EAAG5F,EAAGoO,EAASE,EAAGC,GACjC,IAAII,EACAC,EACAG,EACAC,EACAC,EACArO,EAEJ,GAAKgF,GAAK,EACT,OAAO0I,EAIR,GAFAS,EAAKD,EAAkB9O,GACvBgP,EAAKF,EAAkBR,GAClBS,EAAGG,kBAAoBF,EAAGE,iBAY9B,OADAL,EAAWjJ,EAAGmJ,EAAIX,EATjBO,EADIP,EAAU,GACR,EAAExI,GAAKwI,EAER,EAOyBY,EAAIT,EAJlCK,EADIL,EAAU,GACR,EAAE3I,GAAK2I,EAER,GAGCS,EAAGhH,KAGX,GAAiB,IAAZoG,GAA6B,IAAZG,EAAgB,CAIrC,IAHAU,EAAIrJ,EAnDE,GAsDG,EACR,IAAMhF,EAAI,EAAGA,EAAIqO,EAAGrO,IACnB0N,EAAG1N,GAAMZ,EAAGY,GAGd,GAAKgF,EA3DC,EA4DL,OAAO0I,EAER,IAAM1N,EAAIqO,EAAGrO,EAAIgF,EAAGhF,GA9Dd,EA+DL0N,EAAG1N,GAAMZ,EAAGY,GACZ0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAChB0N,EAAG1N,EAAE,GAAMZ,EAAGY,EAAE,GAEjB,OAAO0N,CACR,CAWA,IATCK,EADIP,EAAU,GACR,EAAExI,GAAKwI,EAER,EAGLQ,EADIL,EAAU,GACR,EAAE3I,GAAK2I,EAER,EAEA3N,EAAI,EAAGA,EAAIgF,EAAGhF,IACnB0N,EAAGM,GAAO5O,EAAG2O,GACbA,GAAMP,EACNQ,GAAML,EAEP,OAAOD,CACR,iBChGA,IAAIQ,EAAmBhQ,EAAS,MAC5B+P,EAAY/P,EAAS,MAyFzBC,EAAOC,QA5DP,SAAgB4G,EAAG5F,EAAGoO,EAASC,EAASC,EAAGC,EAASC,GACnD,IAAIG,EACAC,EACAG,EACAC,EACAC,EACArO,EAEJ,GAAKgF,GAAK,EACT,OAAO0I,EAIR,GAFAS,EAAKD,EAAkB9O,GACvBgP,EAAKF,EAAkBR,GAClBS,EAAGG,kBAAoBF,EAAGE,iBAE9B,OADAL,EAAWjJ,EAAGmJ,EAAIX,EAASC,EAASW,EAAIT,EAASC,GAC1CQ,EAAGhH,KAMX,GAJA2G,EAAKN,EACLO,EAAKJ,EAGY,IAAZJ,GAA6B,IAAZG,EAAgB,CAIrC,IAHAU,EAAIrJ,EA9CE,GAiDG,EACR,IAAMhF,EAAI,EAAGA,EAAIqO,EAAGrO,IACnB0N,EAAGM,GAAO5O,EAAG2O,GACbA,GAAMP,EACNQ,GAAML,EAGR,GAAK3I,EAxDC,EAyDL,OAAO0I,EAER,IAAM1N,EAAIqO,EAAGrO,EAAIgF,EAAGhF,GA3Dd,EA4DL0N,EAAGM,GAAO5O,EAAG2O,GACbL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBL,EAAGM,EAAG,GAAM5O,EAAG2O,EAAG,GAClBA,GApEK,EAqELC,GArEK,EAuEN,OAAON,CACR,CACA,IAAM1N,EAAI,EAAGA,EAAIgF,EAAGhF,IACnB0N,EAAGM,GAAO5O,EAAG2O,GACbA,GAAMP,EACNQ,GAAML,EAEP,OAAOD,CACR,iBC7DA,IAAIzP,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCNjB,IAAIsQ,EAAOvD,QAKX7M,EAAOC,QAAUmQ,kBChBjB,IAAItQ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAIgO,EAAW/N,EAAAA,MAAAA,YACXsQ,EAAiBtQ,EAAS,MAC1B0D,EAAc1D,EAAS,KACvBuQ,EAAmBvQ,EAAS,MAC5BkC,EAASlC,EAAS,MAClBwQ,EAAQxQ,EAAS,MACjByQ,EAASzQ,EAAS,MAoBtB,SAASuH,EAAW9F,EAAMC,GACzB,KAAQoD,gBAAgByC,GACvB,MAAM,IAAI9E,UAAW,0EAEtB,IAAMsL,EAAUtM,GACf,MAAM,IAAIgB,UAAWP,EAAQ,kEAAmET,IAEjG,IAAMsM,EAAUrM,GACf,MAAM,IAAIe,UAAWP,EAAQ,uEAAwER,IActG,OAZA4O,EAAgBxL,KAAM,KAAM,CAC3B,cAAgB,EAChB,YAAc,EACd,UAAY,EACZ,MAASyL,EAAkB9O,KAE5B6O,EAAgBxL,KAAM,KAAM,CAC3B,cAAgB,EAChB,YAAc,EACd,UAAY,EACZ,MAASyL,EAAkB7O,KAErBoD,IACR,CAcApB,EAAa6D,EAAW,oBAAqB,GAgB7C7D,EAAa6D,EAAUjC,UAAW,oBAAqB,GAgBvD5B,EAAa6D,EAAUjC,UAAW,aAAc,GAgBhD5B,EAAa6D,EAAUjC,UAAW,WAAYkL,GAoB9C9M,EAAa6D,EAAUjC,UAAW,SAAUmL,GAK5CxQ,EAAOC,QAAUqH,YCxHjBtH,EAAOC,QAZP,WAEC,IAAIkC,EAAM,CACVA,KAAW,aAGX,OAFAA,EAAI6D,GAAKnB,KAAKmB,GACd7D,EAAI8D,GAAKpB,KAAKoB,GACP9D,CACR,YCQAnC,EAAOC,QAfP,WAEC,IAAIwQ,EAAM,GAAK5L,KAAKmB,GAOpB,OANKnB,KAAKoB,GAAK,EACdwK,GAAO,OAAU5L,KAAKoB,GAEtBwK,GAAO,MAAQ5L,KAAKoB,GAErBwK,GAAO,GAER,kBCFA,IAAI3Q,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAIgO,EAAW/N,EAAAA,MAAAA,YACXsQ,EAAiBtQ,EAAS,MAC1B0D,EAAc1D,EAAS,KACvBkC,EAASlC,EAAS,MAClBwQ,EAAQxQ,EAAS,MACjByQ,EAASzQ,EAAS,MAoBtB,SAAS6D,EAAYpC,EAAMC,GAC1B,KAAQoD,gBAAgBjB,GACvB,MAAM,IAAIpB,UAAW,0EAEtB,IAAMsL,EAAUtM,GACf,MAAM,IAAIgB,UAAWP,EAAQ,kEAAmET,IAEjG,IAAMsM,EAAUrM,GACf,MAAM,IAAIe,UAAWP,EAAQ,uEAAwER,IActG,OAZA4O,EAAgBxL,KAAM,KAAM,CAC3B,cAAgB,EAChB,YAAc,EACd,UAAY,EACZ,MAASrD,IAEV6O,EAAgBxL,KAAM,KAAM,CAC3B,cAAgB,EAChB,YAAc,EACd,UAAY,EACZ,MAASpD,IAEHoD,IACR,CAcApB,EAAaG,EAAY,oBAAqB,GAgB9CH,EAAaG,EAAWyB,UAAW,oBAAqB,GAgBxD5B,EAAaG,EAAWyB,UAAW,aAAc,IAgBjD5B,EAAaG,EAAWyB,UAAW,WAAYkL,GAoB/C9M,EAAaG,EAAWyB,UAAW,SAAUmL,GAK7CxQ,EAAOC,QAAU2D,YCvHjB5D,EAAOC,QAZP,WAEC,IAAIkC,EAAM,CACVA,KAAW,cAGX,OAFAA,EAAI6D,GAAKnB,KAAKmB,GACd7D,EAAI8D,GAAKpB,KAAKoB,GACP9D,CACR,YCQAnC,EAAOC,QAfP,WAEC,IAAIwQ,EAAM,GAAK5L,KAAKmB,GAOpB,OANKnB,KAAKoB,GAAK,EACdwK,GAAO,OAAU5L,KAAKoB,GAEtBwK,GAAO,MAAQ5L,KAAKoB,GAErBwK,GAAO,GAER,kBCCA,IAAI3Q,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjBE,EAAOC,QAPP,SAAemC,GACd,OAAOA,EAAE6D,EACV,kBCCA,IAAInG,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjBE,EAAOC,QAPP,SAAgBmC,GACf,OAAOA,EAAE6D,EACV,kBCCA,IAAInG,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjBE,EAAOC,QAPP,SAAemC,GACd,OAAOA,EAAE4D,EACV,kBCCA,IAAIlG,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjBE,EAAOC,QAPP,SAAgBmC,GACf,OAAOA,EAAE4D,EACV,YCYAhG,EAAOC,QALgB,qBCKvBD,EAAOC,QALsB,2BCc7BD,EAAOC,QALqB,eCG5BD,EAAOC,QAL0B,qBCKjCD,EAAOC,QAL+B,qBCKtCD,EAAOC,QAL2B,qBCKlCD,EAAOC,QALkC,kBCAzCD,EAAOC,QALG,4BCQVD,EAAOC,SALoC,eCK3CD,EAAOC,QAL0B,eCQjCD,EAAOC,QALwB,2BCE/BD,EAAOC,SALoC,qBCf3C,IAqBIyQ,EArBS3Q,EAAS,MAqBI4Q,kBAK1B3Q,EAAOC,QAAUyQ,YCTjB,IAAIE,EAAevC,OAAOwC,kBAK1B7Q,EAAOC,QAAU2Q,YCMjB5Q,EAAOC,QALuB,iCCI9BD,EAAOC,QALS,eCKhBD,EAAOC,SALS,eCKhBD,EAAOC,QALS,qBCKhBD,EAAOC,SALS,qBCKhBD,EAAOC,QALQ,cCKfD,EAAOC,SALQ,cCKfD,EAAOC,QALU,gBCKjBD,EAAOC,QALU,qBCKjBD,EAAOC,QALS,oBCZhB,IAAIH,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAIsD,EAAYrD,EAAS,KAkCzBC,EAAOC,QAPP,SAAiBgB,GAChB,OAAOmC,EAAWnC,EAAE,EACrB,kBCRA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAI4J,EAAO3J,EAAS,MAChB6N,EAAO7N,EAAS,MAkCpBC,EAAOC,QAPP,SAAqBgB,GACpB,OAAQA,IAAMyI,GAAQzI,IAAM2M,CAC7B,iBCfA,IAAI9N,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAI+D,EAAQ9D,EAAS,MA0BrBC,EAAOC,QAPP,SAAoBgB,GACnB,OAAQ4C,EAAM5C,KAAOA,CACtB,kBCNA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCCjBE,EAAOC,QAPP,SAAgBgB,GACf,OAASA,IAAMA,CAChB,iBCKA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAIqD,EAASpD,EAAS,MAsCtBC,EAAOC,QAXP,SAAgBgB,GAEf,OACQkC,EADHlC,EAAI,EACOA,EAAE,EAEHA,EAAE,EAClB,kBClBA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAI4J,EAAO3J,EAAS,MA0BpBC,EAAOC,QAPP,SAAyBgB,GACxB,OAAc,IAANA,GAAa,EAAIA,IAAMyI,CAChC,kBCTA,IAAI5J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YC4FjBE,EAAOC,QA9BP,SAAe6Q,EAAGC,GACjB,IAIIC,EACAC,EAkBJ,QARAD,GA9FmB,OAsFnBF,KAAO,MAQoB,IAC3BG,GA/FmB,OAuFnBF,KAAO,MAQoB,KAGP,KARbD,IAAI,KAAO,GASHG,EAAOD,GARfD,IAAI,KAAO,IAQa,KAAO,KAGX,CAC5B,kBChFA,IAAIjR,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCIjBE,EAAOC,QAPP,SAAcgB,GACb,OAAOiQ,KAAKC,IAAKlQ,EAClB,kBCPA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCJjB,IAAIsR,EAAOF,KAAKE,KAKhBpR,EAAOC,QAAUmR,iBCHjB,IAAItR,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC7BjB,IAAIuR,EAAYtR,EAAS,MACrBuR,EAAWvR,EAAS,MACpBwR,EAAUxR,EAAS,MACnByR,EAAczR,EAAS,MACvB0R,EAAY1R,EAAS,MAMrB2R,EAAQ,CAAE,EAAG,GA2DjB1R,EAAOC,QA3BP,SAAmBgB,EAAGsO,GACrB,IAAIoC,EACAC,EAmBJ,OAhBAL,EAAQM,OAAQ5Q,EAAGyQ,EAAO,EAAG,GAC7BC,EAAKD,EAAO,GAGZC,GAAML,EAGNM,EAAKJ,EAAajC,GASXkC,EAHPE,GAHAC,GAAMP,EAMgBK,EAAO,GAC9B,iBCpBA,IAAII,EAAQ/R,EAAS,MACjBgS,EAAWhS,EAAS,MA+BxBC,EAAOC,QAjBP,SAAmB+R,EAAIC,EAAIC,GAC1B,IAAIC,EACAC,EACAC,EAQJ,OAHAA,GAFAF,EAAIH,EAAKC,IACTG,EAAID,EAAIA,GACIJ,EAAUK,GAGfN,EAFH,GAAQG,EAAQE,EAAEE,GAAI,EAAIA,GAAOL,GAEpBE,EAClB,iBClDA,IAAIpS,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCkBjB,IAAIoN,EAAQnN,EAAS,MACjBuS,EAAQvS,EAAS,MACjB6N,EAAO7N,EAAS,MAChB2J,EAAO3J,EAAS,MAChBwS,EAAWxS,EAAS,KAOpByS,EAAS,mBAGTC,EAAW,GAAO,GAAK,IACvBC,GAAgBD,EAwJpBzS,EAAOC,QAtCP,SAAcgB,GACb,IAEIiR,EAEJ,OAAKhF,EAAOjM,IAAOA,IAAMyI,EACjBzI,EAEHA,IAAM2M,EACH,EAEH3M,EAhIS,iBAiINyI,EAEHzI,GAlIU,kBAmIP,EAGPA,EAAIyR,GACJzR,EAAIwR,EAEG,EAAMxR,GAIbiR,EAAII,EADArR,EAAI,EACIuR,EAAOvR,EAAK,GAEZuR,EAAOvR,EAAK,IAKlBsR,EAHFtR,EArJO,kBAqJFiR,EApJE,uBAqJPA,EAEoBA,GAC1B,YCtLAlS,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,mBAED,mBAAuBA,GAA+BA,GAAK,qBAA0BA,GAAsC,sBAAJA,EAA5B,wBAA9D,qBACrC,kBCEA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCJjB,IAAI+D,EAAQqN,KAAKrN,MAKjB7D,EAAOC,QAAU4D,kBCGjB,IAAI/D,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC5BjB,IAAI4J,EAAO3J,EAAS,MAChB6N,EAAO7N,EAAS,MAChB4S,EAAO5S,EAAS,MAChB6S,EAAe7S,EAAS,MACxB8S,EAAyB9S,EAAS,MAClC+S,EAAyB/S,EAAS,MAClCmN,EAAQnN,EAAS,MACjBgT,EAAahT,EAAS,MACtBiT,EAAWjT,EAAS,KACpBkT,EAAYlT,EAAAA,IAAAA,OACZmT,EAAWnT,EAAS,MACpBwR,EAAUxR,EAAS,MACnB0R,EAAY1R,EAAS,MAYrBoT,EAAO,CAAE,EAAK,GAGdzB,EAAQ,CAAE,EAAG,GA6FjB1R,EAAOC,QArDP,SAAgBmT,EAAMC,GACrB,IAAIC,EACApD,EACJ,OACS,IAARmD,GACS,IAATD,GACAlG,EAAOkG,IACPL,EAAYK,GAELA,GAGRH,EAAWG,EAAMD,EAAM,EAAG,GAE1BE,GAAOF,EAAM,IAGbE,GAAOH,EAJPE,EAAOD,EAAM,KAOFL,EACHE,EAAU,EAAKI,GAElBC,EAAMT,EACLQ,EAAO,EACJxF,EAEDlE,GAGH2J,GAAOR,GACXQ,GAAO,GACPnD,EAjFc,sBAmFdA,EAAI,EAGLqB,EAAQM,OAAQuB,EAAM1B,EAAO,EAAG,GAChC4B,EAAO5B,EAAO,GAGd4B,GAvFoB,WA6FbpD,EAAIuB,EAHX6B,GAAUD,EAAIV,GAAS,GAGKjB,EAAO,KACpC,kBClGA,IAAI5R,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCfjB,IAAI0R,EAAczR,EAAS,MACvBwT,EAAcxT,EAAS,KACvBmN,EAAQnN,EAAS,MACjB4S,EAAO5S,EAAS,MAChB6N,EAAO7N,EAAS,MAChBgS,EAAWhS,EAAS,MACpByT,EAAWzT,EAAS,MAKpB0T,EAAS,kBACTC,EAAS,uBAKTC,EAAwB,QAwH5B3T,EAAOC,QAhFP,SAAagB,GACZ,IAAI2S,EACAjC,EAEAkC,EACA3B,EACA4B,EACAvT,EACAsB,EACAC,EACAiS,EACAC,EACA5R,EAEJ,OAAW,IAANnB,EACG2M,EAEHV,EAAOjM,IAAOA,EAAI,EACf+I,KAGRkI,EAAI,GADJP,EAAKH,EAAavQ,IAtDO,UA0DxBiR,GAAK,GAILP,EAAKH,EADLvQ,GAvEU,mBA0EN0Q,GAnEoB,WAoEjB1Q,EAAIA,GAEZiR,IAASP,GAAI,IAAOgB,EAAO,EAM3BT,IAJArQ,GADA8P,GAAMgC,GACI,OAAW,UAIX,GACVpT,GAFAU,EAAIsS,EAAatS,EAAG0Q,EArEG,WAqEC9P,IAEhB,GACF8R,EAAuB,EAAEhC,GAAO,EAE1B,IAANpR,EACO,IAAN2R,EACG,EAEAA,EAAIuB,EAAWvB,EAAIwB,GAE5BI,EAAIvT,EAAIA,GAAM,GA5FA,kBA4FiBA,GACpB,IAAN2R,EACG3R,EAAIuT,EAEJ5B,EAAIuB,GAAaK,EAAG5B,EAAEwB,EAAWnT,KAI1CsB,EAAM8P,EAAK,OAAU,EAErB7P,EAAM,OAAU6P,EAAK,EACrBkC,GAFAG,GAFA5R,GADA2R,EAAIxT,GAAK,EAAMA,IACPwT,GAEA3R,GAEC2P,EAAUiC,GAGnBF,EAFK1R,EAAIoR,EAAUQ,GAEVH,GADThS,GAAKC,GAEI,GACR8R,EAAO,GAAMrT,EAAIA,EACN,IAAN2R,EACG3R,GAAMqT,EAAQG,GAAKH,EAAKE,IAExB5B,EAAIuB,GAAYG,GAASG,GAAGH,EAAKE,GAAK5B,EAAEwB,GAAWnT,IAEjD,IAAN2R,EACG3R,EAAKwT,GAAGxT,EAAEuT,GAEV5B,EAAIuB,GAAeM,GAAGxT,EAAEuT,GAAO5B,EAAEwB,EAAYnT,KACtD,YC1HAP,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,kBAED,kBAAsBA,GAAK,mBAA2B,mBAAJA,EAC1D,YCKAjB,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,kBAED,kBAAsBA,GAAK,kBAAsBA,GAAK,kBAA0B,mBAAJA,GACpF,kBCDA,IAAIgT,EAAMlU,EAAS,MAKnBC,EAAOC,QAAUgU,kBCvBjB,IAAIC,EAAiBnU,EAAS,MAC1BmN,EAAQnN,EAAS,MACjB2J,EAAO3J,EAAS,MA8CpBC,EAAOC,QAtBP,SAAcgB,EAAGsO,GAChB,OAAKrC,EAAOjM,IAAOiM,EAAOqC,GAClBvF,IAEH/I,IAAMyI,GAAQ6F,IAAM7F,EACjBA,EAEHzI,IAAMsO,GAAW,IAANtO,EACViT,EAAgBjT,GACbA,EAEDsO,EAEHtO,EAAIsO,EACDtO,EAEDsO,CACR,kBCVA,IAAIzP,EAAOC,EAAS,KAKpBC,EAAOC,QAAUH,kBCxBjB,IAAI0R,EAAczR,EAAS,MACvBoU,EAAapU,EAAS,MACtBwT,EAAcxT,EAAS,KACvB4S,EAAO5S,EAAS,MAChBqU,EAAWrU,EAAS,MASpBsU,EAAsB,QAyBtBC,EAAK,CACR,EACA,KAEGC,EAAQ,CACX,EACA,mBAEGC,EAAQ,CACX,EACA,sBAiIDxU,EAAOC,QA9GP,SAAiBkC,EAAKsS,EAAIC,GACzB,IAAIxP,EACAyP,EACAC,EACAC,EACAC,EACAC,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACAvB,EACAwB,EACAjD,EACAD,EACAmD,EACA1T,EACA2T,EACAzT,EACAoQ,EAkFJ,OAhFAqD,EAAI,EAGCb,EAAML,IAEVkB,GAAK,GACLb,EAAMlD,EAFNiD,GApEU,mBAyEXc,IAAOb,GA3EwB,IA2EY/B,EAAM,EAMjD+B,EA1FuB,YAuFvB5S,EA7F2B,QA6FtB4S,GAQA5S,GAAK,OACToQ,EAAI,EAGKpQ,EAAI,OACboQ,EAAI,GAIJA,EAAI,EACJqD,GAAK,EACLb,GAAOL,GAaRnP,EAjH2B,QAiHnBwP,GAAK,EApHgB,WAwH7BI,GATAlT,EAAI,IALJ6S,EAAKlB,EAAakB,EAAIC,KAGtBM,EAAKV,EAAIpC,QACToD,EAAIb,EAAKO,IAGTH,EAAKV,EADLQ,EAAKW,EAAI1T,EACY,KAKrBmT,EAAKxB,EAAa,EADlBrO,GAAQgN,GAAK,KAGkB2C,GAD1BJ,GAAMM,EAAKC,KAMhB7C,GADAyC,EAAKD,EAAKA,GACDC,EAAKR,EAAUQ,GAIxBG,EAAKZ,EADLY,EAAK,GADLH,EAAKC,EAAKA,IADV1C,GAAK2C,GAAMD,EAAKF,IAGK,GAmBrBU,GAPAD,GA5HW,sBAyHXF,EAAKf,EADLe,GAJAI,EAAIT,EAAKE,IACTnT,EAAMkT,EAAGC,GAJJ5C,GAAM4C,EAAG,EAAOH,IAIAD,GAIA,IA/Hb,mBAgIH/S,GAAKsT,EAAKI,IAEiBd,EAAOtC,MAMvC2B,EAAKM,EADLN,GANAsB,EA9HW,kBA8HED,GAMHE,GAFVH,EAAKV,EAAOrC,KACZE,EAAImD,GAEiB,IACLnD,EAAK6C,EAAME,GAE3BhT,EAAK,GAAM0R,EACX1R,EAAK,GAAMkT,EACJlT,CACR,kBC5KA,IAAIgS,EAAapU,EAAS,MACtByV,EAAWzV,EAAS,MAqDxBC,EAAOC,QAxBP,SAAekC,EAAKsS,GACnB,IAAIY,EACAxB,EACAzB,EAEAkD,EACA1T,EAYJ,OAJAyT,GAHAzT,EA5BgB,uBAyBhBwQ,EAAIqC,EAAK,GA/BI,oBAgCTrC,EAAIA,EAAIoD,EAAUpD,OAItByB,EAAKM,EADLN,GAFAyB,EA9BgB,mBA8BClD,GAERxQ,EACY,IACN0T,GAEfnT,EAAK,GAAM0R,EACX1R,EAAK,GAAMkT,EACJlT,CACR,iBCjDA,IAAI+K,EAAQnN,EAAS,MACjB0V,EAAQ1V,EAAS,KACjBgT,EAAahT,EAAS,MACtBqD,EAAYrD,EAAS,KACrB2V,EAAO3V,EAAS,MAChBoR,EAAMpR,EAAS,MACfwR,EAAUxR,EAAS,MACnBoU,EAAapU,EAAS,MACtB4V,EAAgB5V,EAAS,MACzB6N,EAAO7N,EAAS,MAChB2J,EAAO3J,EAAS,MAChBuR,EAAWvR,EAAS,MACpB6V,EAAU7V,EAAS,MACnB8V,EAAU9V,EAAS,MACnB+V,EAAc/V,EAAS,MACvBgW,EAAShW,EAAS,MAClBiW,EAAOjW,EAAS,MAChBkW,EAAOlW,EAAS,MAehBmW,EAAqB,WAarBC,EAAO,MACPC,EAAO,OAMP1E,EAAQ,CAAE,EAAK,GAGf2E,EAAgB,CAAE,EAAK,GAoS3BrW,EAAOC,QA5LP,SAASqW,EAAKrV,EAAGsO,GAChB,IAAImF,EACA6B,EACA9B,EACA9C,EAEAC,EAEA4E,EACAC,EACAC,EACAxB,EACAyB,EACAvE,EACAhQ,EACAN,EACAD,EACJ,GAAKqL,EAAOjM,IAAOiM,EAAOqC,GACzB,OAAOvF,IAQR,GALAuH,EAAQM,OAAQtC,EAAGmC,EAAO,EAAG,GAC7BE,EAAKF,EAAO,GAIA,IAHPA,EAAO,GAGI,CACf,GAAW,IAANnC,EACJ,OAAO,EAER,GAAW,IAANA,EACJ,OAAOtO,EAER,IAAY,IAAPsO,EACJ,OAAO,EAAMtO,EAEd,GAAW,KAANsO,EACJ,OAAOmG,EAAMzU,GAEd,IAAY,KAAPsO,EACJ,OAAO,EAAMmG,EAAMzU,GAEpB,GAAW,IAANsO,EACJ,OAAOtO,EAAIA,EAEZ,GAAW,IAANsO,EACJ,OAAOtO,EAAIA,EAAIA,EAEhB,GAAW,IAANsO,EAEJ,OADAtO,GAAKA,GACMA,EAEZ,GAAK8R,EAAYxD,GAChB,OAAOuG,EAAa7U,EAAGsO,EAEzB,CAOA,GALAgC,EAAQM,OAAQ5Q,EAAGyQ,EAAO,EAAG,GAC7BC,EAAKD,EAAO,GAIA,IAHPA,EAAO,GAGI,CACf,GAAY,IAAPC,EACJ,OAAOiE,EAAS3U,EAAGsO,GAEpB,GAAW,IAANtO,EACJ,OAAO,EAER,IACQ,IAAPA,GACAwU,EAAOlG,GAEP,OAAQ,EAET,GAAKwD,EAAY9R,GAChB,OAAKA,IAAM2M,EAEH0I,GAAM,GAAM/G,GAEfA,EAAI,EACD,EAED7F,CAET,CACA,GACCzI,EAAI,IACe,IAAnBmC,EAAWmM,GAGX,OAAQtO,EAAEA,IAAIA,EAAEA,GAqBjB,GAnBAwT,EAAKtD,EAAKlQ,GAGVyT,EAAO/C,EAAKL,EACZiF,EAAO3E,EAAKN,EAIZmF,EAAM7E,IAzNqB,GAyNS,EAInC4E,GALDA,EAAM7E,IAxNqB,GAwNS,IAIzB8D,EAAOlG,IACX,EAED,EAKDgH,EArPmB,WAqPQ,CAE/B,GAAKA,EApPkB,WAqPtB,OAAOV,EAAS5U,EAAGsO,GAIpB,GAAKmF,EA/PmB,WAiQvB,OAAY,IAAP+B,EAEGD,EAAKL,EAAOA,EAGbK,EAAKJ,EAAOA,EAEpB,GAAK1B,EA5PiB,WA8PrB,OAAY,IAAP+B,EAEGD,EAAKL,EAAOA,EAGbK,EAAKJ,EAAOA,EAGpBhE,EAAI4D,EAAMK,EAAe5B,EAC1B,MAGCrC,EAAI2D,EAAQM,EAAe5B,EAAIC,GAchC,GARAtS,GAFAuU,GAAQpH,GADRmH,EAAKvC,EAAY5E,EAAG,KACN6C,EAAE,GAAS7C,EAAE6C,EAAE,KAC7B8C,EAAKwB,EAAKtE,EAAE,IAIZb,EAAQM,OAAQzP,EAAGsP,EAAO,EAAG,GAC7B5P,EAAI6T,EAAejE,EAAM,IACzB7P,EAAI8T,EAAejE,EAAM,IAGpB5P,GAAKoU,EAAqB,CAE9B,GAAoC,KAA7BpU,EAAEoU,EAAoBrU,GAE5B,OAAO2U,EAAKL,EAAOA,EAEpB,GAAMQ,EAhRE,qBAgRSvU,EAAE8S,EAElB,OAAOsB,EAAKL,EAAOA,CAErB,MAEK,IAAMrU,EAAEwP,IAjSE,WAiSuB,CAErC,GAA+B,KAAxBxP,EAhSW,WAgSMD,GAEvB,OAAO2U,EAAKJ,EAAOA,EAEpB,GAAKO,GAAOvU,EAAE8S,EAEb,OAAOsB,EAAKJ,EAAOA,CAErB,CAIA,OAAOI,GAFPpU,EAAI6T,EAAMnU,EAAGoT,EAAIyB,GAGlB,YC5UA3W,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,kBAED,kBAAsBA,GAAK,kBAAsBA,GAAK,mBAAuBA,GAAK,iBAAqBA,GAAK,mBAA2B,mBAAJA,KAC3I,YCKAjB,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,mBAED,mBAAuBA,GAA+BA,GAAK,qBAA0BA,GAAsC,sBAAJA,EAA5B,wBAA9D,qBACrC,YCKAjB,EAAOC,QAVP,SAAmBgB,GAClB,OAAW,IAANA,EACG,GAED,GAAOA,GAAgC,IAAJA,EAAtB,kBACrB,kBCLA,IAAIuQ,EAAczR,EAAS,MACvBwT,EAAcxT,EAAS,KACvBoU,EAAapU,EAAS,MACtB4V,EAAgB5V,EAAS,MACzB+R,EAAQ/R,EAAS,MACjB6W,EAAM7W,EAAS,MACf4S,EAAO5S,EAAS,MAChBuR,EAAWvR,EAAS,MACpB4T,EAAwB5T,EAAS,MACjCgS,EAAWhS,EAAS,MAMpBsU,EAAsB,QAqF1BrU,EAAOC,QAvDP,SAAe6B,EAAGoT,EAAIyB,GACrB,IACI9C,EACAzB,EAEAkD,EACA1T,EACAoS,EACA5R,EACAmT,EACA1T,EACAqQ,EAsCJ,OAnCAA,IADArQ,EAAKC,EAAIwP,IArCsB,IAsCOqB,EAAM,EAC5C4C,EAAI,EAGC1T,EA7CsB,aAiD1BuQ,EAAImB,EAAa,IAHjBgC,EAAKzT,GAAKuS,GAAsBnC,EAAE,KAAO,KAE3ByB,IADdzB,IAAOqD,EAAIjE,IA5CmB,IA4CqBqB,EAAM,OACX,GAE9C4C,GAAOA,EAAI5B,EAAuBU,IA/CJ,GA+CuDnC,IAAM,EACtFpQ,EAAI,IACRyT,GAAKA,GAENL,GAAM9C,GAOP4B,GAFApS,GAAO+U,IAFPvE,EAAI+B,EADJ/B,EAAIuE,EAAKzB,EACU,IAEJA,IAAK0B,GAlDR,qBAkDkBxE,KAC9BhQ,GAFAkT,EApDY,kBAoDRlD,GAEIxQ,GACK0T,GAEbzB,EAAKzR,GADLgQ,EAAIhQ,EAAIA,GACK2P,EAAUK,GAGvBtQ,EAAI0P,EADJpP,EAAI,GADGA,EAAEyR,GAAOA,EAAG,IAAWG,EAAK5R,EAAE4R,GACtB5R,IAEfN,EAAI6T,EAAe7T,GAKlBM,GAJDN,GAAMyT,GAjEyB,KAiES,IAjET,IAoEQ,EAClCzD,EAAO1P,EAAGmT,GAEVhC,EAAanR,EAAGN,EAGtB,kBC/FA,IAAI2T,EAAQ1V,EAAS,KACjBiT,EAAWjT,EAAS,KACpB6N,EAAO7N,EAAS,MAChB2J,EAAO3J,EAAS,MA4DpBC,EAAOC,QAvBP,SAAcgB,EAAGsO,GAChB,OAAKA,IAAM3B,EACHlE,EAEH6F,IAAM7F,EACH,EAEH6F,EAAI,EACHkG,EAAOlG,GACJtO,EAED,EAGHwU,EAAOlG,GACJyD,EAAUtJ,EAAMzI,GAEjByI,CACR,kBC1DA,IAAI4H,EAAWvR,EAAS,MACpByR,EAAczR,EAAS,MA0D3BC,EAAOC,QA5BP,SAAcgB,EAAGsO,GAOhB,OAHKiC,EAAavQ,GACNqQ,IA7Ba,WAgCnB/B,EAAI,EAED4G,IAGDC,EAIH7G,EAAI,EAED4G,IAGDC,CACR,kBCpEA,IAAIjF,EAAMpR,EAAS,MACf2J,EAAO3J,EAAS,MAgEpBC,EAAOC,QAnBP,SAAcgB,EAAGsO,GAChB,OAAY,IAAPtO,GAEIA,EAAEA,IAAIA,EAAEA,GAEN,IAANA,EACG,EAGFkQ,EAAIlQ,GAAK,KAAUsO,IAAM7F,GACvB,EAGDA,CACR,kBCpCA,IAAI5J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCNjB,IAAI4V,EAAOxE,KAAKwE,KAKhB1V,EAAOC,QAAUyV,kBCEjB,IAAI5V,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCnCjB,IAAI+D,EAAQ9D,EAAS,MACjBqR,EAAOrR,EAAS,MAiDpBC,EAAOC,QAVP,SAAgBgB,GACf,OAAKA,EAAI,EACDmQ,EAAMnQ,GAEP4C,EAAO5C,EACf,kBCjCA,IAAInB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCjBjBE,EAAOC,QAAUoO,uBCqBjB,IAAIvO,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC1BjB,IAAI0R,EAAczR,EAAS,MACvB8W,EAAW9W,EAAS,MACpB4S,EAAO5S,EAAS,MAyCpBC,EAAOC,QAdP,SAAmBgB,GAElB,IAAIqS,EAAO9B,EAAavQ,GAMxB,OAHAqS,GAASA,EAAOuD,KAAe,IAGhBlE,EAAM,CACtB,kBCRA,IAAI7S,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCnCjB,IAKIgX,EACAC,EACAC,GAEoB,IATHjX,EAAS,MAU7BgX,EAAO,EACPC,EAAM,IAEND,EAAO,EACPC,EAAM,GAEPF,EAAU,CACT,KAAQC,EACR,IAAOC,GAMRhX,EAAOC,QAAU6W,kBCxBjB,IAAIrP,EAAc1H,EAAS,MACvB4D,EAAe5D,EAAS,MACxB+W,EAAU/W,EAAS,MAKnBkX,EAAe,IAAItT,EAAc,GACjCuT,EAAc,IAAIzP,EAAawP,EAAa3R,QAE5CyR,EAAOD,EAAQC,KACfC,EAAMF,EAAQE,IAsFlBhX,EAAOC,QATP,SAAoBqT,EAAM6D,GAGzB,OAFAD,EAAaH,GAASzD,EACtB4D,EAAaF,GAAQG,EACdF,EAAc,EACtB,kBC5FA,IAKIF,EAEHA,GADuB,IANHhX,EAAS,KAOtB,EAEA,EAMRC,EAAOC,QAAU8W,kBCHjB,IAAIjX,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAI2H,EAAc1H,EAAS,MACvB4D,EAAe5D,EAAS,MACxBgX,EAAOhX,EAAS,MAKhBkX,EAAe,IAAItT,EAAc,GACjCuT,EAAc,IAAIzP,EAAawP,EAAa3R,QA4DhDtF,EAAOC,QARP,SAAsBgB,GAErB,OADAgW,EAAc,GAAMhW,EACbiW,EAAaH,EACrB,kBC/DA,IAAIK,EAA0BrX,EAAS,MACnCgT,EAAahT,EAAS,MACtBmN,EAAQnN,EAAS,MACjBoR,EAAMpR,EAAS,MAuEnBC,EAAOC,QAnBP,SAAoBgB,EAAGkB,EAAKkV,EAAQpQ,GACnC,OAAKiG,EAAOjM,IAAO8R,EAAY9R,IAC9BkB,EAAK8E,GAAWhG,EAChBkB,EAAK8E,EAASoQ,GAAW,EAClBlV,GAEG,IAANlB,GAAakQ,EAAKlQ,GAAMmW,GAC5BjV,EAAK8E,GArDM,iBAqDKhG,EAChBkB,EAAK8E,EAASoQ,IAAY,GACnBlV,IAERA,EAAK8E,GAAWhG,EAChBkB,EAAK8E,EAASoQ,GAAW,EAClBlV,EACR,gBCtCA,IAAIsB,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,SALNC,EAAS,OAUtBC,EAAOC,QAAUH,kBC3CjB,IAAIoG,EAAMnG,EAAS,MAkDnBC,EAAOC,QAPP,SAAoBgB,GACnB,OAAOiF,EAAKjF,EAAG,CAAE,EAAK,GAAK,EAAG,EAC/B,kBC7CA,IAKI8V,EAEHA,GADuB,IANHhX,EAAS,KAOtB,EAEA,EAMRC,EAAOC,QAAU8W,iBCSjB,IAAIjX,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC7BjB,IAAI2H,EAAc1H,EAAS,MACvB4D,EAAe5D,EAAS,MACxBgX,EAAOhX,EAAS,MAKhBkX,EAAe,IAAItT,EAAc,GACjCuT,EAAc,IAAIzP,EAAawP,EAAa3R,QAyEhDtF,EAAOC,QATP,SAAsBgB,EAAGqS,GAGxB,OAFA2D,EAAc,GAAMhW,EACpBiW,EAAaH,GAAWzD,IAAS,EAC1B2D,EAAc,EACtB,kBC5CA,IAAInX,EAAOC,EAAS,KAKpBC,EAAOC,QAAUH,kBCrCjB,IAKIkX,EAEHA,GADuB,IANHjX,EAAS,KAOvB,EAEA,EAMPC,EAAOC,QAAU+W,iBCfjB,IAAIvP,EAAc1H,EAAS,MACvB4D,EAAe5D,EAAS,MACxBiX,EAAMjX,EAAS,MAKfkX,EAAe,IAAItT,EAAc,GACjCuT,EAAc,IAAIzP,EAAawP,EAAa3R,QAiFhDtF,EAAOC,QATP,SAAqBgB,EAAGkW,GAGvB,OAFAF,EAAc,GAAMhW,EACpBiW,EAAaF,GAAUG,IAAQ,EACxBF,EAAc,EACtB,kBCxEA,IAMI3G,EANA/H,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBuQ,EADuB,oBAAZ/H,EACQA,EAEAC,EAMpBxI,EAAOC,QAAUqQ,YC5BjB,IAAIgH,EAAkC,oBAAhBpG,KAAKoG,OAA0BpG,KAAKoG,OAAS,KAKnEtX,EAAOC,QAAUqX,kBCLjB,IAKIC,EAAe,IALAxX,EAAS,MAKT,CAAkB,GAuBrCC,EAAOC,QARP,SAA2BgB,GAE1B,OADAsW,EAAc,GAAMtW,EACbsW,EAAc,EACtB,kBCvBA,IAAI9P,EAAc1H,EAAS,MACvB4D,EAAe5D,EAAS,MACxB+W,EAAU/W,EAAS,MAKnBkX,EAAe,IAAItT,EAAc,GACjCuT,EAAc,IAAIzP,EAAawP,EAAa3R,QAE5CyR,EAAOD,EAAQC,KACfC,EAAMF,EAAQE,IAyElBhX,EAAOC,QAVP,SAAkBgB,EAAGkB,EAAKkV,EAAQpQ,GAIjC,OAHAgQ,EAAc,GAAMhW,EACpBkB,EAAK8E,GAAWiQ,EAAaH,GAC7B5U,EAAK8E,EAASoQ,GAAWH,EAAaF,GAC/B7U,CACR,kBCvDA,IAAIsB,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,SALNC,EAAS,OAUtBC,EAAOC,QAAUH,kBCpCjB,IAKIgX,EACAC,EACAC,GAEoB,IATHjX,EAAS,MAU7BgX,EAAO,EACPC,EAAM,IAEND,EAAO,EACPC,EAAM,GAEPF,EAAU,CACT,KAAQC,EACR,IAAOC,GAMRhX,EAAOC,QAAU6W,kBCxBjB,IAAI5Q,EAAMnG,EAAS,MAsBnBC,EAAOC,QAPP,SAAkBgB,GACjB,OAAOiF,EAAKjF,EAAG,CAAE,EAAO,GAAS,EAAG,EACrC,kBCDA,IAAI0U,EAAgB5V,EAAS,MAK7BC,EAAOC,QAAU0V,YCGjB3V,EAAOC,QARP,SAAwBgB,GAEvB,OAAS,EAAFA,CACR,YCOA,IAAI4Q,EAAS3G,OAAO2G,OAKpB7R,EAAOC,QAAU4R,kBC/BjB,IAKIjI,EALa7J,EAAS,KAKfmD,CAAYgI,OAAO2G,QAK9B7R,EAAOC,QAAU2J,kBCEjB,IAOIiI,EAPA2F,EAAkBzX,EAAS,MAC3BD,EAAOC,EAAS,MAChByI,EAAWzI,EAAS,MAOvB8R,EADI2F,EACK1X,EAEA0I,EAMVxI,EAAOC,QAAU4R,kBC7BjB,IAAI4F,EAAuB1X,EAAS,KAChCmL,EAASnL,EAAS,MAClBkC,EAASlC,EAAS,MA4DtBC,EAAOC,QA/BP,SAAiBsF,GAChB,IAAImS,EACAC,EACAhJ,EACAhN,EACAiW,EACA/V,EACAC,EACJ,QAAgB,IAAXyD,GAAgC,OAAXA,EACzB,MAAM,IAAI/C,UAAWP,EAAQ,2EAA4EsD,IAG1G,IADAqS,EAAK1M,EAAQ3F,GACP1D,EAAI,EAAGA,EAAI+C,UAAU7C,OAAQF,IAElC,QAAgB,KADhB6V,EAAS9S,UAAW/C,KACiB,OAAX6V,EAM1B,IADA/V,GADAgW,EAAOF,EAAsBvM,EAAQwM,KAC1B3V,OACLD,EAAI,EAAGA,EAAIH,EAAKG,IAErB8V,EADAjJ,EAAMgJ,EAAM7V,IACA4V,EAAQ/I,GAGtB,OAAOiJ,CACR,kBC/BA,IAAI9X,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjB,IAAI+X,EAAM3M,OAKVlL,EAAOC,QAAU4X,kBCnCjB,IAAIC,EAAgB/X,EAAS,MACzBgY,EAAUhY,EAAS,MACnBiY,EAAUjY,EAAS,MACnBkY,EAAUlY,EAAS,MAoCvBC,EAAOC,QArBP,SAAiBiY,EAAOC,EAAOC,EAAOC,GACrC,IAAIC,EAEJ,OAAKF,IAAUC,GAAQD,EAAQ,IACvBL,EAASG,EAAOC,EAAOC,GAE1BA,EAAQ,GAAOC,EAAO,EACnBL,EAASE,EAAOC,EAAOC,EAAOC,GAEjCD,EAAQ,GAAOC,EAAO,EACnBJ,EAASC,EAAOE,EAAOC,IAG/BC,EAAKR,EAAeI,EAAOC,EAAOC,KAEpBE,EADTR,EAAeI,EAAOC,EAAOE,GAEnC,kBClCA,IAAI5U,EAAc1D,EAAS,KACvB2D,EAAsB3D,EAAS,MAC/BwY,EAAuBxY,EAAS,MAChCgD,EAAWhD,EAAS,MACpByY,EAAYzY,EAAAA,MAAAA,YACZmD,EAAanD,EAAS,MACtB+K,EAAa/K,EAAS,MACtB0Y,EAAmB1Y,EAAS,MAC5B2Y,EAAO3Y,EAAS,MAChBoY,EAAQpY,EAAAA,MAAAA,QACRmY,EAAQnY,EAAAA,MAAAA,QACRmN,EAAQnN,EAAS,MACjB4Y,EAAQ5Y,EAAS,KACjB0H,EAAc1H,EAAS,MACvB2L,EAAgB3L,EAAS,MACzB8R,EAAS9R,EAAS,MAClB6Y,EAAkB7Y,EAAS,MAC3BkC,EAASlC,EAAS,MAClB8Y,EAAW9Y,EAAS,MACpB+Y,EAAQ/Y,EAAS,MAsSrBC,EAAOC,QApQP,WACC,IAAI8Y,EACAC,EACAZ,EACAC,EACAY,EACAC,EACAC,EACAvT,EACAiE,EAGJ,GADAjE,GAAM,EACoB,IAArBhB,UAAU7C,OAIdmX,EAAOhB,EAHPe,EAAO,CACN,MAAQ,SAGH,GAA0B,IAArBrU,UAAU7C,OAAe,CAEpC,IAAMgB,EADNkW,EAAOrU,UAAW,IAEjB,MAAM,IAAIpC,UAAWP,EAAQ,qEAAsEgX,IAEpG,GAAKnO,EAAYmO,EAAM,UAAaT,EAAWS,EAAKG,MACnD,MAAM,IAAI5W,UAAWP,EAAQ,+DAAgE,OAAQgX,EAAKG,OAE3G,GAAKtO,EAAYmO,EAAM,QAAW,CACjC,IAAM/V,EAAY+V,EAAKE,MACtB,MAAM,IAAI3W,UAAWP,EAAQ,8FAA+F,OAAQgX,EAAKE,OAE1ID,EAAOD,EAAKE,IACb,KAAO,CACN,GAAKrO,EAAYmO,EAAM,WAAcvN,EAAeuN,EAAKI,OACxD,MAAM,IAAI7W,UAAWP,EAAQ,mEAAoE,QAASgX,EAAKI,SAG7F,KADnBJ,EAAOpH,EAAQ,CAAC,EAAGoH,IACTG,KACTxT,GAAM,EACKqT,EAAKI,QAChBJ,EAAKI,MAAQV,EAAOM,EAAKI,MAAMtX,OAAQkX,EAAKI,MAAO,EAAG,IAAI5R,EAAawR,EAAKI,MAAMtX,QAAU,IAE7FkX,EAAKG,MAAO,EACZF,EAAOhB,EAAOe,EACf,CACD,KAAO,CAIN,GADApP,EAAMgP,EAFNT,EAAQxT,UAAW,GACnByT,EAAOzT,UAAW,IAGjB,MAAMiF,EAEP,GAAKjF,UAAU7C,OAAS,EAAI,CAE3B,IAAMgB,EADNkW,EAAOrU,UAAW,IAEjB,MAAM,IAAIpC,UAAWP,EAAQ,qEAAsEgX,IAEpG,GAAKnO,EAAYmO,EAAM,UAAaT,EAAWS,EAAKG,MACnD,MAAM,IAAI5W,UAAWP,EAAQ,+DAAgE,OAAQgX,EAAKG,OAE3G,GAAKtO,EAAYmO,EAAM,QAAW,CACjC,IAAM/V,EAAY+V,EAAKE,MACtB,MAAM,IAAI3W,UAAWP,EAAQ,8FAA+F,OAAQgX,EAAKE,OAE1ID,EAAOD,EAAKE,IACb,KAAO,CACN,GAAKrO,EAAYmO,EAAM,WAAcvN,EAAeuN,EAAKI,OACxD,MAAM,IAAI7W,UAAWP,EAAQ,mEAAoE,QAASgX,EAAKI,SAG7F,KADnBJ,EAAOpH,EAAQ,CAAC,EAAGoH,IACTG,KACTxT,GAAM,EACKqT,EAAKI,QAChBJ,EAAKI,MAAQV,EAAOM,EAAKI,MAAMtX,OAAQkX,EAAKI,MAAO,EAAG,IAAI5R,EAAawR,EAAKI,MAAMtX,QAAU,IAE7FkX,EAAKG,MAAO,EACZF,EAAOhB,EAAOe,EACf,CACD,MAICC,EAAOhB,EAHPe,EAAO,CACN,MAAQ,GAIX,CA2CA,OA1CKA,GAAQA,EAAKE,KACjBH,EAAQb,EAAM,CACb,KAAQc,EAAKE,QAGTF,EAAKI,MACTN,EAAQE,EAAKI,OAEbN,EAAQG,EAAKG,MACbH,EAAKG,MAAQN,GAEdC,EAAQb,EAAM,CACb,MAASY,EACT,MAAQ,KAQVtV,EAJC0V,OADc,IAAVf,EAiJL,SAAgBA,EAAOC,GACtB,GACCnL,EAAOkL,IACPlL,EAAOmL,IACPD,GAAS,GACTC,GAAQ,EAER,OAAOrO,IAER,OAAO8O,EAAOI,EAAMF,EAAOZ,EAAOC,EACnC,EA1BA,WACC,OAAOS,EAAOI,EAAMF,EAAOZ,EAAOC,EACnC,EA9HmB,OAAQ,QAGtBY,GAAQA,EAAKE,MACjB1V,EAAa0V,EAAM,OAAQ,MAC3B1V,EAAa0V,EAAM,aAAc,MACjCZ,EAAsBY,EAAM,QAASV,EAAkB,MAAQC,GAC/DjV,EAAa0V,EAAM,cAAe,MAClC1V,EAAa0V,EAAM,aAAc,MACjC1V,EAAa0V,EAAM,SAAUV,EAAkB,OAC/ChV,EAAa0V,EAAM,OAAQD,KAE3BxV,EAAqByV,EAAM,QAiB5B,WACC,OAAOD,EAAKI,IACb,IAlBC5V,EAAqByV,EAAM,cA0B5B,WACC,OAAOD,EAAKK,UACb,IA3BChB,EAAsBY,EAAM,SAuD7B,WACC,OAAOD,EAAKG,KACb,IAUA,SAAmBtF,GAClB,IAAMrI,EAAeqI,GACpB,MAAM,IAAIvR,UAAWP,EAAQ,6DAA8D8R,IAEvFnO,IACJmO,EAAI4E,EAAO5E,EAAEhS,OAAQgS,EAAG,EAAG,IAAItM,EAAasM,EAAEhS,QAAU,IAEzDmX,EAAKG,MAAQtF,CACd,IA1ECrQ,EAAqByV,EAAM,eAkC5B,WACC,OAAOD,EAAKM,WACb,IAnCC9V,EAAqByV,EAAM,cA2C5B,WACC,OAAOD,EAAKnU,UACb,IA5CCtB,EAAa0V,EAAM,UAoFpB,WACC,IAAIhX,EAAM,CACVA,KAAW,QACXA,EAAId,KAAO8X,EAAKM,KAChBtX,EAAIkX,MAAQT,EAAiBM,EAAKG,OAEjClX,EAAIuX,YADU,IAAVtB,EACS,GAEA,CAAEA,EAAOC,GAEvB,OAAOlW,CACR,IA9FCsB,EAAa0V,EAAM,OAAQD,GAC3BA,EAAOA,EAAKS,YAENR,CAkIR,kBC9RA,IAAI1V,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,UALLC,EAAS,OAUvBC,EAAOC,QAAUH,kBClCjB,IA2BIuY,EA3BUtY,EAAS,KA2BZ6Z,GAKX5Z,EAAOC,QAAUoY,kBChCjB,IAAI/B,EAAMvW,EAAS,MACf8Z,EAAK9Z,EAAS,MAwDlBC,EAAOC,QA1CP,SAAiBiY,EAAOC,EAAOC,GAC9B,IAAIjT,EACA2U,EACAC,EACAhG,EACA3B,EACAkD,EACArU,EACAsO,EAMJ,IAHA6C,EAAIkE,GADJyD,EAAI3B,EAAQ,GACD2B,EAAG,IAEd5U,GAAM,GACU,IAARA,IAEPlE,EAAI,IAAQ,GADZ8S,EAAIoE,KACe/F,KACT,GAAOnR,GAAK,KACrBqU,EAAI4C,OAGJ3I,EAAI,GAFJuK,EAAKxD,EAAKvC,EAAG,KACbxE,EAAK,EAAI6I,EAAS,KAGjBjT,GAAM,EAGDmQ,GADL/F,GAAK,GAAM+G,EAAKwD,GAAK,EAAI1B,EAAO,GAAM,MAErC7I,EAAIwK,EAAIF,EAAI,EAAI5Y,GAAG,EAAIA,KACvBsO,GAAKwE,EAAEA,EAAI,IACD8F,EAAIvE,KACbnQ,GAAM,KAMX,OAAOlE,CACR,kBCpDA,IAAIqV,EAAMvW,EAAS,MACf8Z,EAAK9Z,EAAS,MAuDlBC,EAAOC,QAxCP,SAAiBiY,EAAOC,EAAOC,EAAOC,GACrC,IAAI2B,EACA7U,EACA8U,EACAF,EACAG,EACAC,EACAC,EACArG,EACAuB,EACArU,EACAsO,EAUJ,IALA6K,GADAD,GAFAJ,EAAI3B,EAAQ,IACZ8B,EAAI7B,EAAO,IAEHwB,EAAIM,GACZF,EAAKF,EAAII,EACTH,EAAQ,GAAM1D,EAAK6D,EAAG,IAEtBhV,GAAM,GACU,IAARA,IAEPlE,EAAIgZ,GADJlG,EAAIoE,KACQ6B,IACF,GAAO/Y,GAAK,IACrBqU,EAAI4C,IACJ3I,EAAIwK,EAAIF,EAAI5Y,EAAE8Y,GACdxK,GAAK2K,EAAIL,GAAI,EAAI5Y,GAAKiZ,IACtB3K,GAAK6K,EAAK,GAAIrG,EAAEA,IACN8F,EAAIvE,KACbnQ,GAAM,IAIT,OAAOlE,CACR,kBCnDA,IAAIoS,EAAMtT,EAAS,KACfuW,EAAMvW,EAAS,MACf8Z,EAAK9Z,EAAS,MAiDlBC,EAAOC,QAnCP,SAAiBiZ,EAAMd,EAAOC,GAQ7B,IAPA,IAAIgC,EACAC,EACAC,EACAjF,EACA1T,EACAX,IAQH,GALAqU,EAAI4D,IACJtX,EAAIsX,KAGJqB,GAFAtZ,EAAIqV,EAAKhB,EAAG,EAAI8C,IACZ9B,EAAK1U,EAAG,EAAIyW,KAEL,EACV,OAAKkC,EAAK,EACFtZ,EAAMsZ,IAEdF,EAAKR,EAAIvE,GAAM8C,IACfkC,EAAKT,EAAIjY,GAAMyW,IAEdiC,GAAMD,EACNA,EAAK,IAELA,GAAMC,EACNA,EAAK,GAECjH,EAAKgH,EAAKR,EAAIxG,EAAIgH,GAAMhH,EAAIiH,KAGtC,kBC9CA,IAAIT,EAAK9Z,EAAS,MACd2V,EAAO3V,EAAS,MAChBuW,EAAMvW,EAAS,MAKfya,EAAY,EAAM,EAwDtBxa,EAAOC,QA1CP,SAAwBiY,EAAOC,EAAOC,GACrC,IAAIjT,EACAsV,EACAC,EACAC,EACAtI,EACAuI,EACA3Z,EACA8S,EACAuB,EACA1T,EAYJ,IAVKwW,EAAQ,GAEZ/F,EAAI,EAAMqD,EAAM,GADhBkF,EAAIxC,EAAQ,EAAMoC,IAElBzG,EAAIuC,EAAK4B,IAAS,EAAIE,KAGtB/F,EAAI,EAAMqD,EAAM,GADhBkF,EAAIxC,EAAQoC,IAEZzG,EAAI,GAEL5O,GAAM,EACEA,GAAM,CACb,GAECvD,EAAI,EAAOyQ,GADXpR,EAAIkX,WAEKvW,GAAK,GAGf8Y,EAAK,EAAO,MADZD,EAAKxZ,EAAIA,GACYwZ,EACrBE,EAAM,GAAIF,EAAOG,GAAI,GAHrBhZ,GAAKA,EAAIA,GAGkBiY,EAAGjY,MAC9B0T,EAAI4C,KACKwC,GAAMb,EAAIvE,GAAMqF,KACxBxV,GAAM,EAER,CACA,OAAOyV,EAAIhZ,EAAImS,CAChB,kBC1DA,IAAI8G,EAAa9a,EAAAA,KAAAA,YACbkC,EAASlC,EAAS,MAgCtBC,EAAOC,QAbP,SAAmBmY,EAAOC,GACzB,OAAMwC,EAAYzC,GAGZyC,EAAYxC,GAGX,KAFC,IAAI7V,UAAWP,EAAQ,4EAA6EoW,IAHpG,IAAI7V,UAAWP,EAAQ,2EAA4EmW,GAM5G,iBC5BA,IAAI1C,EAAO3V,EAAS,MAChBsT,EAAMtT,EAAS,KACf8Z,EAAK9Z,EAAS,MAMd+a,EAAI,mBAsCR9a,EAAOC,QArBP,SAAsB4G,EAAGkU,GACxB,IAAIC,EACAza,EACAsB,EAOJ,IALAtB,EAAI8S,GAAM,GAAM0H,EAAQA,IAExBC,EAAI,IACFzY,KAAMuY,EAAEva,GACVya,EAAEzY,KAAMwY,GACFlZ,EAAI,EAAGA,EAAIgF,EAAGhF,IACnBmZ,EAAGnZ,GAAM6T,GAAO,EAAMmE,EAAMiB,EAAEE,EAAEnZ,EAAE,GAAOtB,IACzCA,EAAI8S,GAAM,GAAM2H,EAAGnZ,GAAMmZ,EAAGnZ,IAG7B,OADAmZ,EAAEzY,KAAM,GACDyY,CACR,kBCzCA,IAAIvX,EAAc1D,EAAS,KACvB2D,EAAsB3D,EAAS,MAC/BwY,EAAuBxY,EAAS,MAChCmD,EAAanD,EAAS,MACtBgD,EAAWhD,EAAS,MACpByY,EAAYzY,EAAAA,MAAAA,YACZ+K,EAAa/K,EAAS,MACtB2L,EAAgB3L,EAAS,MACzBkb,EAAUlb,EAAAA,MAAAA,QACV0Y,EAAmB1Y,EAAS,MAC5B2Y,EAAO3Y,EAAS,MAChB8D,EAAQ9D,EAAS,MACjB4L,EAAa5L,EAAS,MACtB6Y,EAAkB7Y,EAAS,MAC3BkC,EAASlC,EAAS,MAClBmb,EAAmBnb,EAAS,MAsMhCC,EAAOC,QArKP,SAAkBkb,GACjB,IAAIjD,EACAkD,EACAjD,EACAc,EAKJ,GAHAA,EAAO,CACN,MAAQ,GAEJrU,UAAU7C,OAAS,CACvB,IAAMgB,EAAUoY,GACf,MAAM,IAAI3Y,UAAWP,EAAQ,yDAA0DkZ,IAExF,GAAKrQ,EAAYqQ,EAAS,UACzBlC,EAAKG,KAAO+B,EAAQ/B,MACdZ,EAAW2C,EAAQ/B,OACxB,MAAM,IAAI5W,UAAWP,EAAQ,+DAAgE,OAAQkZ,EAAQ/B,OAG/G,GAAKtO,EAAYqQ,EAAS,QAAW,CACpC,IAAMjY,EAAYiY,EAAQhC,MACzB,MAAM,IAAI3W,UAAWP,EAAQ,8FAA+F,OAAQkZ,EAAQhC,OAE7IjB,EAAQiD,EAAQhC,IACjB,MAEK,GAAKrO,EAAYqQ,EAAS,UAE9B,GADAlC,EAAKI,MAAQ8B,EAAQ9B,OACf3N,EAAeyP,EAAQ9B,OAC5B,MAAM,IAAI7W,UAAWP,EAAQ,mEAAoE,QAASkZ,EAAQ9B,aAI/G,GAAKvO,EAAYqQ,EAAS,UAC9BlC,EAAKK,KAAO6B,EAAQ7B,UACE,IAAjB6B,EAAQ7B,MACZ,MAAM,IAAI9W,UAAWP,EAAQ,qPAAsP,OAAQkZ,EAAQ7B,MAGtS,CAwCA,YAvCoB,IAAfL,EAAKI,WACM,IAAVnB,EAEJA,GADAkD,EAAQH,EAAShC,IACHU,YAEdyB,EAAQH,EAAQ,CACf,KAAQpX,EAAO,EAAQ8H,EAAWuM,KAClC,KAAQe,EAAKG,OAEdH,EAAKK,KAAO,MAIbpB,GADAkD,EAAQH,EAAShC,IACHU,WAEfxB,EAAQ+C,EAAkBhD,EAAOkD,GAEjC3X,EAAa0U,EAAO,OAAQ,qBACT,OAAdc,EAAKK,MACT7V,EAAa0U,EAAO,OAAQ,MAC5B1U,EAAa0U,EAAO,aAAc,QAElCzU,EAAqByU,EAAO,QAyB7B,WACC,OAAOiD,EAAM9B,IACd,IA1BC5V,EAAqByU,EAAO,cAkC7B,WACC,OAAOiD,EAAM7B,UACd,KAjCK4B,GAAWA,EAAQhC,MACvBZ,EAAsBJ,EAAO,QAASM,EAAkB,MAAQC,GAChEjV,EAAa0U,EAAO,cAAe,MACnC1U,EAAa0U,EAAO,aAAc,MAClC1U,EAAa0U,EAAO,SAAUM,EAAkB,SAEhDF,EAAsBJ,EAAO,SAuD9B,WACC,OAAOiD,EAAM/B,KACd,IASA,SAAmBtF,GAClBqH,EAAM/B,MAAQtF,CACf,IAnECrQ,EAAqByU,EAAO,eAkC7B,WACC,OAAOiD,EAAM5B,WACd,IAnCC9V,EAAqByU,EAAO,cA2C7B,WACC,OAAOiD,EAAMrW,UACd,IA5CCtB,EAAa0U,EAAO,UA6ErB,WACC,IAAIhW,EAAM,CACVA,KAAW,QAIX,OAHAA,EAAId,KAAO8W,EAAMsB,KACjBtX,EAAIkX,MAAQT,EAAiBwC,EAAM/B,OACnClX,EAAIuX,OAAS,GACNvX,CACR,KAlFAsB,EAAa0U,EAAO,OAAQD,GAErBC,CAiFR,kBChNA,IAAIhH,EAAMpR,EAAS,MACfsT,EAAMtT,EAAS,KACfsb,EAActb,EAAS,KACvBub,EAAavb,EAAS,MACtBwb,EAAaxb,EAAS,MAStByb,EAAmB,eAGnBR,EAAIK,EANS,IAMgBG,GAG7B1H,EAAIwH,EAAYN,GAiEpBhb,EAAOC,QAjDP,SAAeiY,EAAOkD,GACrB,OAYA,WACC,IAAIK,EACAC,EACAjB,EACAxZ,EACAqU,EACAzT,EACAC,EACJ,OAAe,CAKd,GAJAwT,EAAM,EAAI4C,IAAY,EACtBrW,EApCoB,IAoChBuZ,IAGCjK,EAAKmE,GAAMxB,EAAGjS,GAClB,OAAOyT,EAAI0F,EAAGnZ,GAGf,GAAW,IAANA,EACJ,OAAO0Z,EAAYrD,EAAOsD,EAAkBlG,EAAI,GAQjD,GAJAmF,GADAxZ,EAAIqU,EAAI0F,EAAGnZ,IACFZ,EACTa,EAAID,EAAI,EACR4Z,EAAKpI,GAAM,IAAS2H,EAAGnZ,GAAImZ,EAAGnZ,GAAO4Y,KACrCiB,EAAKrI,GAAM,IAAS2H,EAAGlZ,GAAIkZ,EAAGlZ,GAAO2Y,KAC1BvC,KAASuD,EAAGC,GAAO,EAC7B,OAAOza,CAET,CACD,CACD,kBCzDA,IAAIwC,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,UALLC,EAAS,OAUvBC,EAAOC,QAAUH,kBClCjB,IAgDIqY,EAhDUpY,EAAS,KAgDX6Z,GAKZ5Z,EAAOC,QAAUkY,YC5BjBnY,EAAOC,QAdP,SAAqB+a,GACpB,IAAIlH,EACAjS,EAGJ,IADAiS,EAAI,GACEjS,EAAI,EAAGA,EAAImZ,EAAEjZ,OAAO,EAAGF,IAC5BiS,EAAEvR,KAAMyY,EAAGnZ,EAAE,GAAMmZ,EAAGnZ,IAEvB,OAAOiS,CACR,kBCpBA,IAAI+F,EAAK9Z,EAAS,MA+BlBC,EAAOC,QAbP,SAAqBiZ,EAAM6B,EAAOY,GACjC,IAAI1a,EACAsO,EACJ,GACCtO,EAAI4Y,EAAIX,KAAW6B,EACnBxL,EAAIsK,EAAIX,YACE,EAAI3J,EAAItO,EAAEA,GACrB,OAAS0a,EAAe1a,EAAE8Z,EAAQA,EAAM9Z,CACzC,kBCeA,IAAIwC,EAAc1D,EAAS,KACvB2D,EAAsB3D,EAAS,MAC/BwY,EAAuBxY,EAAS,MAChC+K,EAAa/K,EAAS,MACtBgD,EAAWhD,EAAS,MACpB8C,EAAe9C,EAAS,MACxB2L,EAAgB3L,EAAS,MACzByY,EAAYzY,EAAAA,MAAAA,YACZ6b,EAAoB7b,EAAAA,MAAAA,YACpB8b,EAA2B9b,EAAS,MACpC4L,EAAa5L,EAAS,MACtB0H,EAAc1H,EAAS,MACvBkU,EAAMlU,EAAS,MACf+b,EAAO/b,EAAS,MAChB4Y,EAAQ5Y,EAAS,KACjB6Y,EAAkB7Y,EAAS,MAC3BkC,EAASlC,EAAS,MAClBgc,EAAahc,EAAS,MAMtB8G,EAAI,IAGJmV,EAAI,IAGJC,EAAWtQ,IAAe,EAM1BuQ,EAAa,WAGbC,EAAa,WAGbC,EAAmB,WAGnBC,EAAqB,QAGrBC,EAAqB,WAYrBC,EAAQ,CAAE,EAAWC,YAGrBC,EAAiC,GAAQZ,EAAyB,GAMlEa,EAAS,WAGTC,EAAM,EAGNC,EAAiBf,EAA2BY,EAG5CI,EAAsB,EAGtBC,EAAqB,EAGrBC,EAAuB,EAGvBC,EAAuBnW,EAAI,EAG3BoW,EAAsBpW,EAAI,EAG1BqW,EAAqBrW,EAAI,EAa7B,SAASsW,EAAa9D,EAAOzT,GAC5B,IAAIwX,EAOJ,OALCA,EADIxX,EACC,SAEA,WAGDyT,EAAMtX,OAASmb,EAAmB,EAC/B,IAAIpY,WAAY7C,EAAQ,qDAAsDmb,IAGjF/D,EAAO,KAAQwD,EACZ,IAAI/X,WAAY7C,EAAQ,8FAA+Fmb,EAAIP,EAAqBxD,EAAO,KAG1JA,EAAO,KAAQyD,EACZ,IAAIhY,WAAY7C,EAAQ,kGAAmGmb,EAAIN,EAAoBzD,EAAO,KAG7JA,EAAO0D,KAA2BlW,EAC/B,IAAI/B,WAAY7C,EAAQ,4FAA6Fmb,EAAIvW,EAAGwS,EAAO0D,KAGpG,IAAlC1D,EAAO2D,GACJ,IAAIlY,WAAY7C,EAAQ,8FAA+Fmb,EAAI,EAAG/D,EAAO2D,KAGxI3D,EAAO4D,KAA0B5D,EAAMtX,OAAOmb,EAC3C,IAAIpY,WAAY7C,EAAQ,2GAA4Gmb,EAAI/D,EAAMtX,OAAOmb,EAAoB7D,EAAO4D,KAEjL,IACR,CAWA,SAASI,EAAahE,EAAOxS,EAAGkN,GAC/B,IAAIlS,EAMJ,IAHAwX,EAAO,GAAMtF,IAAM,EAGblS,EAAI,EAAGA,EAAIgF,EAAGhF,IAWnBkS,IADAA,EAAIsF,EAAOxX,EAAE,KAAM,GACVkS,IAAI,MAAQ,EACrBsF,EAAOxX,GAAQia,EAAM/H,EAAGqI,GAAqBva,IAAM,EAEpD,OAAOwX,CACR,CAkdArZ,EAAOC,QAzUP,SAAkBkb,GACjB,IAAIpC,EACAM,EACAJ,EACAK,EACAgE,EACAzT,EAGJ,GADAoP,EAAO,CAAC,EACHrU,UAAU7C,OAAS,CACvB,IAAMgB,EAAUoY,GACf,MAAM,IAAI3Y,UAAWP,EAAQ,qEAAsEkZ,IAEpG,GAAKrQ,EAAYqQ,EAAS,UACzBlC,EAAKG,KAAO+B,EAAQ/B,MACdZ,EAAW2C,EAAQ/B,OACxB,MAAM,IAAI5W,UAAWP,EAAQ,+DAAgE,OAAQkZ,EAAQ/B,OAG/G,GAAKtO,EAAYqQ,EAAS,SAAY,CAGrC,GAFA9B,EAAQ8B,EAAQ9B,MAChBJ,EAAKI,OAAQ,GACP3N,EAAe2N,GACpB,MAAM,IAAI7W,UAAWP,EAAQ,mEAAoE,QAASoX,IAG3G,GADAxP,EAAMsT,EAAa9D,GAAO,GAEzB,MAAMxP,GAEY,IAAdoP,EAAKG,KACTL,EAAQM,GAERN,EAAQ,IAAItR,EAAa4R,EAAMtX,QAC/B4W,EAAOU,EAAMtX,OAAQsX,EAAO,EAAGN,EAAO,IAGvCM,EAAQ,IAAI5R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAaqY,EAAqB,GAAGhE,EAAMzX,kBAAoBuF,GAG5GyS,EAAO,IAAI7R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAauY,EAAoB,GAAGlE,EAAMzX,kBAAoB+X,EAAO4D,GAClH,CAEA,QAAc,IAAT3D,EACJ,GAAKxO,EAAYqQ,EAAS,QAGzB,GAFA7B,EAAO6B,EAAQ7B,KACfL,EAAKK,MAAO,EACPsC,EAAmBtC,GAAS,CAChC,GAAKA,EAAO2C,EACX,MAAM,IAAInX,WAAY7C,EAAQ,kIAAmI,OAAQqX,IAE1KA,KAAU,CACX,KAAO,KAA8B,IAAzBzW,EAAcyW,IAAoBA,EAAKvX,OAAS,EAC3D,MAAM,IAAIS,UAAWP,EAAQ,qPAAsP,OAAQqX,IACrR,GAAqB,IAAhBA,EAAKvX,OAAe,CAE/B,GADAuX,EAAOA,EAAM,IACPsC,EAAmBtC,GACxB,MAAM,IAAI9W,UAAWP,EAAQ,qPAAsP,OAAQqX,IAE5R,GAAKA,EAAO2C,EACX,MAAM,IAAInX,WAAY7C,EAAQ,qPAAsP,OAAQqX,IAE7RA,KAAU,CACX,MACCgE,EAAOhE,EAAKvX,QACZgX,EAAQ,IAAItR,EAAayV,EAAmBI,IAGrC,GAAMT,EACb9D,EAAO,GAAM+D,EACb/D,EAAOgE,GAAyBlW,EAChCkS,EAAOiE,GAAyB,EAChCjE,EAAOiE,EAAqB,GAAMnW,EAClCkS,EAAOkE,GAAwBK,EAG/B3E,EAAM4E,QAASD,EAAMhE,EAAM,EAAG,EAAGP,EAAO,EAAGkE,EAAoB,GAG/D5D,EAAQ,IAAI5R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAaqY,EAAqB,GAAGhE,EAAMzX,kBAAoBuF,GAG5GyS,EAAO,IAAI7R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAauY,EAAoB,GAAGlE,EAAMzX,kBAAoBgc,GAI1GjE,EAlNL,SAAoBA,EAAOxS,EAAGyS,EAAM0C,GACnC,IAAIjI,EACAlS,EACAC,EACAoQ,EAIJ,IAFArQ,EAAI,EACJC,EAAI,EACEoQ,EAAI+B,EAAKpN,EAAGmV,GAAK9J,EAAI,EAAGA,IAU7B6B,EAAIsF,EAAOxX,EAAE,KAAM,EAEnBkS,EAAM+H,EADN/H,GAAMA,EAAGA,IAAI,MAAQ,EACNsI,KAAyB,EACxChD,EAAOxX,IAAUwX,EAAMxX,KAAK,EAAGkS,GAAKuF,EAAKxX,GAAKA,IAAM,EAGpDA,GAAK,GADLD,GAAK,IAEKgF,IACTwS,EAAO,GAAMA,EAAOxS,EAAE,GACtBhF,EAAI,GAEAC,GAAKka,IACTla,EAAI,GAGN,IAAMoQ,EAAIrL,EAAE,EAAGqL,EAAI,EAAGA,IAUrB6B,EAAIsF,EAAOxX,EAAE,KAAM,EAEnBkS,EAAM+H,EADN/H,GAAMA,EAAGA,IAAI,MAAQ,EACNuI,KAAyB,EACxCjD,EAAOxX,IAAUwX,EAAMxX,KAAK,EAAGkS,GAAKlS,IAAM,GAE1CA,GAAK,IACKgF,IACTwS,EAAO,GAAMA,EAAOxS,EAAE,GACtBhF,EAAI,GAMN,OAFAwX,EAAO,GAAMqD,EAENrD,CACR,CAwJamE,CADRnE,EAAQgE,EAAahE,EAAOxS,EAvWL,UAwWGA,EAAGyS,EAAMgE,EACpC,MAEAhE,EAAOyC,MAAiB,CAG3B,MACCzC,EAAOyC,MAAiB,EA6CzB,YA3Ce,IAAV1C,KACJN,EAAQ,IAAItR,EAAayV,EAAmB,IAGrC,GAAML,EACb9D,EAAO,GAAM+D,EACb/D,EAAOgE,GAAyBlW,EAChCkS,EAAOiE,GAAyB,EAChCjE,EAAOiE,EAAqB,GAAMnW,EAClCkS,EAAOkE,GAAwB,EAC/BlE,EAAOkE,EAAoB,GAAM3D,EAGjCD,EAAQ,IAAI5R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAaqY,EAAqB,GAAGhE,EAAMzX,kBAAoBuF,GAG5GyS,EAAO,IAAI7R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAauY,EAAoB,GAAGlE,EAAMzX,kBAAoB,GAG1G+X,EAAQgE,EAAahE,EAAOxS,EAAGyS,IAGhC7V,EAAawX,EAAS,OAAQ,WAC9BvX,EAAqBuX,EAAS,OAAQwC,GACtC/Z,EAAqBuX,EAAS,aAAcyC,GAC5CnF,EAAsB0C,EAAS,QAAS0C,EAAUC,GAClDla,EAAqBuX,EAAS,cAAe4C,GAC7Cna,EAAqBuX,EAAS,aAAc6C,GAC5Cra,EAAawX,EAAS,SAAUzK,GAChC/M,EAAawX,EAAS,MAAO,GAC7BxX,EAAawX,EAAS,MAAOtP,GAC7BlI,EAAawX,EAAS,aAActB,GAEpClW,EAAakW,EAAY,OAAQsB,EAAQxB,MACzC/V,EAAqBiW,EAAY,OAAQ8D,GACzC/Z,EAAqBiW,EAAY,aAAc+D,GAC/CnF,EAAsBoB,EAAY,QAASgE,EAAUC,GACrDla,EAAqBiW,EAAY,cAAekE,GAChDna,EAAqBiW,EAAY,aAAcmE,GAC/Cra,EAAakW,EAAY,SAAUnJ,GACnC/M,EAAakW,EAAY,MAAO,GAChClW,EAAakW,EAAY,MAAOiD,GAEzB3B,EAQP,SAASwC,IACR,IAAI9b,EAAMoX,EAAOkE,GACjB,OAAOtE,EAAOhX,EAAK2X,EAAM,EAAG,IAAI7R,EAAa9F,GAAO,EACrD,CAQA,SAAS+b,IACR,OAAO3E,EAAOkE,EACf,CAQA,SAASY,IACR,OAAO9E,EAAMhX,MACd,CAQA,SAAS+b,IACR,OAAO/E,EAAMhU,UACd,CAuBA,SAAS4Y,IACR,IAAIhc,EAAMoX,EAAMhX,OAChB,OAAO4W,EAAOhX,EAAKoX,EAAO,EAAG,IAAItR,EAAa9F,GAAO,EACtD,CAeA,SAASic,EAAU7J,GAClB,IAAIlK,EACJ,IAAM6B,EAAeqI,GACpB,MAAM,IAAIvR,UAAWP,EAAQ,6DAA8D8R,IAG5F,GADAlK,EAAMsT,EAAapJ,GAAG,GAErB,MAAMlK,GAEY,IAAdoP,EAAKG,KACJH,EAAKI,OAAStF,EAAEhS,SAAWgX,EAAMhX,OACrC4W,EAAO5E,EAAEhS,OAAQgS,EAAG,EAAGgF,EAAO,IAE9BA,EAAQhF,EACRkF,EAAKI,OAAQ,IAITtF,EAAEhS,SAAWgX,EAAMhX,SACvBgX,EAAQ,IAAItR,EAAasM,EAAEhS,SAE5B4W,EAAO5E,EAAEhS,OAAQgS,EAAG,EAAGgF,EAAO,IAG/BM,EAAQ,IAAI5R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAaqY,EAAqB,GAAGhE,EAAMzX,kBAAoBuF,GAG5GyS,EAAO,IAAI7R,EAAasR,EAAMzT,OAAQyT,EAAMrU,YAAauY,EAAoB,GAAGlE,EAAMzX,kBAAoByX,EAAOkE,GAClH,CAYA,SAASzM,IACR,IAAIrO,EAAM,CACVA,KAAW,QAIX,OAHAA,EAAId,KAAO4Z,EAAQxB,KACnBtX,EAAIkX,MAAQT,EAAiBG,GAC7B5W,EAAIuX,OAAS,GACNvX,CACR,CAYA,SAAS8Y,IACR,IAAI9I,EACAtQ,EAsBJ,OAnBAA,EAAIkX,EAAOiE,EAAqB,KAGtBnW,IACTwS,EAzVH,SAAgBA,GACf,IAAIrF,EACAnS,EACAC,EACAoQ,EAGJ,IADAA,EAAIrL,EAAImV,EACFna,EAAI,EAAGA,EAAIqQ,EAAGrQ,IACnBmS,EAAMqF,EAAMxX,GAAGqa,EAAiB7C,EAAMxX,EAAE,GAAGsa,EAC3C9C,EAAOxX,GAAMwX,EAAOxX,EAAEma,GAAQhI,IAAI,EAAMuI,EAAOvI,EAAE2I,GAGlD,IADA7a,EAAI+E,EAAI,EACAhF,EAAIC,EAAGD,IACdmS,EAAMqF,EAAMxX,GAAGqa,EAAiB7C,EAAMxX,EAAE,GAAGsa,EAC3C9C,EAAOxX,GAAMwX,EAAOxX,EAAEqQ,GAAQ8B,IAAI,EAAMuI,EAAOvI,EAAE2I,GAIlD,OAFA3I,EAAMqF,EAAMvX,GAAGoa,EAAiB7C,EAAM,GAAG8C,EACzC9C,EAAOvX,GAAMuX,EAAO2C,EAAE,GAAQhI,IAAI,EAAMuI,EAAOvI,EAAE2I,GAC1CtD,CACR,CAsUW0E,CAAO1E,GACfxX,EAAI,GAGLsQ,EAAIkH,EAAOxX,GAGXkX,EAAOiE,EAAqB,GAAMnb,EAAI,EAGtCsQ,GAAKA,IAAM,GACXA,GAAOA,GAAK,EA3iBgB,WA4iB5BA,GAAOA,GAAK,GAziBgB,YA0iB5BA,GAAKA,IAAM,MAEE,CACd,CAgBA,SAASwH,IAGR,OApjBW,UAkjBHsB,MAAc,IACdA,MAAc,IACIwB,CAC3B,CACD,kBC1oBA,IAAIhZ,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,UALLC,EAAS,OAUvBC,EAAOC,QAAUH,kBClCjB,IA0EImb,EA1EUlb,EAAS,KA0ET6Z,CAAQ,CACrB,KA1EgB7Z,EAAS,KA0EjBgc,KAMT/b,EAAOC,QAAUgb,kBCjFjB,IAAItP,EAAa5L,EAAS,MACtB8D,EAAQ9D,EAAS,MAKjBie,EAAMrS,EAAa,EAuBvB3L,EAAOC,QARP,WAEC,OADQ4D,EAAO,EAAOma,EAAI9M,KAAK+M,YAClB,CACd,kBCEA,IAAIxa,EAAc1D,EAAS,KACvBD,EAAOC,EAAS,MAMpB0D,EAAa3D,EAAM,SALNC,EAAS,OAUtBC,EAAOC,QAAUH,YCPjBE,EAAOC,QAPP,WACC,MAAO,yBACR,kBC1BA,IAgCIie,EAhCiBne,EAAS,KAgCPoe,GAKvBne,EAAOC,QAAUie,kBCnBjB,IAAIpe,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCvBjB,IAAI6D,EAAe5D,EAAS,MA8B5BC,EAAOC,QAPP,SAAsBgB,EAAGgG,GACxB,OAAO,IAAItD,EAAc1C,EAAEqE,OAAQrE,EAAEyD,WAAYzD,EAAEK,kBAAkB2F,EAAS,GAAGhG,EAAEc,OAAOkF,GAC3F,kBCPA,IAAInH,EAAOC,EAAS,KAKpBC,EAAOC,QAAUH,iBCvBjB,IAAIuH,EAAetH,EAAS,MA8B5BC,EAAOC,QAPP,SAAsBgB,EAAGgG,GACxB,OAAO,IAAII,EAAcpG,EAAEqE,OAAQrE,EAAEyD,WAAYzD,EAAEK,kBAAkB2F,EAAS,GAAGhG,EAAEc,OAAOkF,GAC3F,kBCzBA,IAAI6G,EAAW/N,EAAS,MAGpBoR,EAAMD,KAAKC,IACXiN,EAAYvP,OAAOxJ,UAAUgZ,YAC7BC,EAAYzP,OAAOxJ,UAAUkZ,YAC7BC,EAAU3P,OAAOxJ,UAAUmZ,QAK3BC,EAAoB,WACpBC,EAAoB,UACpBC,EAAiB,UACjBC,EAAuB,UACvBC,EAA0B,OAC1BC,EAAqB,QACrBC,EAAqB,gBAuEzB/e,EAAOC,QA1DP,SAAuB+e,GACtB,IAAIC,EACA9c,EACA5B,EAAI2e,WAAYF,EAAMG,KAC1B,IAAMC,SAAU7e,GAAM,CACrB,IAAMuN,EAAUkR,EAAMG,KACrB,MAAM,IAAIna,MAAO,yCAA2C7C,GAG7D5B,EAAIye,EAAMG,GACX,CACA,OAASH,EAAMK,WACf,IAAK,IACL,IAAK,IACJld,EAAM5B,EAAE+e,cAAeN,EAAMO,WAC7B,MACD,IAAK,IACL,IAAK,IACJpd,EAAM5B,EAAEif,QAASR,EAAMO,WACvB,MACD,IAAK,IACL,IAAK,IACCpO,EAAK5Q,GAAM,OACf0e,EAASD,EAAMO,WACD,IACbN,GAAU,GAEX9c,EAAM5B,EAAE+e,cAAeL,IAEvB9c,EAAM5B,EAAEkf,YAAaT,EAAMO,WAEtBP,EAAMU,YACXvd,EAAMqc,EAAQ7b,KAAMR,EAAK4c,EAAoB,OAC7C5c,EAAMqc,EAAQ7b,KAAMR,EAAK2c,EAAoB,KAC7C3c,EAAMqc,EAAQ7b,KAAMR,EAAK0c,EAAyB,KAEnD,MACD,QACC,MAAM,IAAI7Z,MAAO,mCAAqCga,EAAMK,WAc7D,OAZAld,EAAMqc,EAAQ7b,KAAMR,EAAKsc,EAAmB,SAC5Ctc,EAAMqc,EAAQ7b,KAAMR,EAAKuc,EAAmB,SACvCM,EAAMU,YACVvd,EAAMqc,EAAQ7b,KAAMR,EAAKwc,EAAgB,OACzCxc,EAAMqc,EAAQ7b,KAAMR,EAAKyc,EAAsB,SAE3Cre,GAAK,GAAKye,EAAMW,OACpBxd,EAAM6c,EAAMW,KAAOxd,GAEpBA,EAAQ6c,EAAMK,YAAcf,EAAU3b,KAAMqc,EAAMK,WACjDf,EAAU3b,KAAMR,GAChBic,EAAUzb,KAAMR,EAElB,kBCnFA,IAAI2L,EAAW/N,EAAS,MACpB6f,EAAU7f,EAAS,MAGnBqe,EAAYvP,OAAOxJ,UAAUgZ,YAC7BC,EAAYzP,OAAOxJ,UAAUkZ,YAuFjCve,EAAOC,QA1EP,SAAwB+e,GACvB,IAAIa,EACA1d,EACAN,EAEJ,OAASmd,EAAMK,WACf,IAAK,IAEJQ,EAAO,EACP,MACD,IAAK,IAEJA,EAAO,EACP,MACD,IAAK,IACL,IAAK,IAEJA,EAAO,GACP,MAID,QAECA,EAAO,GAKR,GAFA1d,EAAM6c,EAAMG,IACZtd,EAAIie,SAAU3d,EAAK,KACbid,SAAUvd,GAAM,CACrB,IAAMiM,EAAU3L,GACf,MAAM,IAAI6C,MAAO,2BAA6B7C,GAE/CN,EAAI,CACL,CAkCA,OAjCKA,EAAI,IAA2B,MAApBmd,EAAMK,WAA8B,KAATQ,KAC1Che,EAAI,WAAaA,EAAI,GAEjBA,EAAI,GACRM,IAASN,GAAI0E,SAAUsZ,GAClBb,EAAMO,YACVpd,EAAMyd,EAASzd,EAAK6c,EAAMO,UAAWP,EAAMe,WAE5C5d,EAAM,IAAMA,IAEZA,EAAMN,EAAE0E,SAAUsZ,GACZhe,GAAMmd,EAAMO,UAENP,EAAMO,YACjBpd,EAAMyd,EAASzd,EAAK6c,EAAMO,UAAWP,EAAMe,WAF3C5d,EAAM,GAIF6c,EAAMW,OACVxd,EAAM6c,EAAMW,KAAOxd,IAGP,KAAT0d,IACCb,EAAMU,YACVvd,EAAM,KAAOA,GAEdA,EAAQ6c,EAAMK,YAAcf,EAAU3b,KAAMqc,EAAMK,WACjDf,EAAU3b,KAAMR,GAChBic,EAAUzb,KAAMR,IAEJ,IAAT0d,GACCb,EAAMU,WAAiC,MAApBvd,EAAI6d,OAAQ,KACnC7d,EAAM,IAAMA,GAGPA,CACR,iBC1EA,IAAIrC,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCKjBE,EAAOC,QAPP,SAAmBS,GAClB,MAA0B,kBAAVA,CACjB,YCCAV,EAAOC,QAPP,SAAmBS,GAClB,MAA0B,kBAAVA,CACjB,kBCdA,IAAIuf,EAAgBlgB,EAAS,MACzBkD,EAAWlD,EAAS,MACpBmgB,EAAengB,EAAS,MACxBogB,EAAWpgB,EAAS,MACpB6f,EAAU7f,EAAS,MAKnBqgB,EAAevR,OAAOuR,aACtBlT,EAAQmT,MACRrd,EAAUwJ,MAAMxJ,QAYpB,SAASsd,EAAYtB,GACpB,IAAI7c,EAAM,CAAC,EAMX,OALAA,EAAIkd,UAAYL,EAAMK,UACtBld,EAAIod,eAAkC,IAApBP,EAAMO,UAAyB,EAAIP,EAAMO,UAC3Dpd,EAAIoe,MAAQvB,EAAMuB,MAClBpe,EAAIqe,MAAQxB,EAAMwB,OAAS,GAC3Bre,EAAIse,QAAUzB,EAAMyB,QACbte,CACR,CAiKAnC,EAAOC,QA9IP,SAA4BygB,GAC3B,IAAIC,EACAH,EACAxB,EACA4B,EACAC,EACA1e,EACA2e,EACAjf,EACAC,EAEJ,IAAMkB,EAAS0d,GACd,MAAM,IAAIle,UAAW,8DAAgEke,EAAS,MAI/F,IAFAve,EAAM,GACN2e,EAAM,EACAjf,EAAI,EAAGA,EAAI6e,EAAO3e,OAAQF,IAE/B,GADAmd,EAAQ0B,EAAQ7e,GACXoB,EAAU+b,GACd7c,GAAO6c,MACD,CAGN,GAFA2B,OAAgC,IAApB3B,EAAMO,YAClBP,EAAQsB,EAAYtB,IACRK,UACX,MAAM,IAAI7c,UAAW,oEAAqEX,EAAG,cAAgBmd,EAAQ,MAMtH,IAJKA,EAAMyB,UACVK,EAAM9B,EAAMyB,SAEbD,EAAQxB,EAAMwB,MACR1e,EAAI,EAAGA,EAAI0e,EAAMze,OAAQD,IAE9B,OADA8e,EAAOJ,EAAMR,OAAQle,IAErB,IAAK,IACJkd,EAAMW,KAAO,IACb,MACD,IAAK,IACJX,EAAMW,KAAO,IACb,MACD,IAAK,IACJX,EAAMe,UAAW,EACjBf,EAAM+B,UAAW,EACjB,MACD,IAAK,IACJ/B,EAAM+B,SAAWP,EAAMQ,QAAS,KAAQ,EACxC,MACD,IAAK,IACJhC,EAAMU,WAAY,EAClB,MACD,QACC,MAAM,IAAI1a,MAAO,iBAAmB4b,GAGtC,GAAqB,MAAhB5B,EAAMuB,MAAgB,CAG1B,GAFAvB,EAAMuB,MAAQT,SAAUlb,UAAWkc,GAAO,IAC1CA,GAAO,EACF5T,EAAO8R,EAAMuB,OACjB,MAAM,IAAI/d,UAAW,wCAA0Cse,EAAM,6BAA+B9B,EAAMuB,MAAQ,MAE9GvB,EAAMuB,MAAQ,IAClBvB,EAAMe,UAAW,EACjBf,EAAMuB,OAASvB,EAAMuB,MAEvB,CACA,GAAKI,GACqB,MAApB3B,EAAMO,UAAoB,CAG9B,GAFAP,EAAMO,UAAYO,SAAUlb,UAAWkc,GAAO,IAC9CA,GAAO,EACF5T,EAAO8R,EAAMO,WACjB,MAAM,IAAI/c,UAAW,4CAA8Cse,EAAM,6BAA+B9B,EAAMO,UAAY,MAEtHP,EAAMO,UAAY,IACtBP,EAAMO,UAAY,EAClBoB,GAAY,EAEd,CAGD,OADA3B,EAAMG,IAAMva,UAAWkc,GACd9B,EAAMK,WACf,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAECsB,IACJ3B,EAAM+B,UAAW,GAElB/B,EAAMG,IAAMc,EAAejB,GAC3B,MACD,IAAK,IAEJA,EAAMiC,SAAaN,EAAc3B,EAAMO,WAAa,EACpD,MACD,IAAK,IAEJ,IAAMrS,EAAO8R,EAAMG,KAAQ,CAE1B,IADA0B,EAAMf,SAAUd,EAAMG,IAAK,KAChB,GAAK0B,EAAM,IACrB,MAAM,IAAI7b,MAAO,kCAAoCga,EAAMG,KAE5DH,EAAMG,IAAQjS,EAAO2T,GACpBhS,OAAQmQ,EAAMG,KACdiB,EAAcS,EAChB,CACA,MACD,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IACL,IAAK,IAEEF,IACL3B,EAAMO,UAAY,GAEnBP,EAAMG,IAAMe,EAAclB,GAC1B,MACD,QACC,MAAM,IAAIha,MAAO,sBAAwBga,EAAMK,WAG3CL,EAAMiC,UAAY,GAAKjC,EAAMG,IAAIpd,OAASid,EAAMiC,WACpDjC,EAAMG,IAAMH,EAAMG,IAAI+B,UAAW,EAAGlC,EAAMiC,WAEtCjC,EAAM+B,SACV/B,EAAMG,IAAMS,EAASZ,EAAMG,IAAKH,EAAMuB,OAASvB,EAAMO,UAAWP,EAAMe,UAC3Df,EAAMuB,QACjBvB,EAAMG,IAAMgB,EAAUnB,EAAMG,IAAKH,EAAMuB,MAAOvB,EAAMe,WAErD5d,GAAO6c,EAAMG,KAAO,GACpB2B,GAAO,CACR,CAED,OAAO3e,CACR,YCpLA,SAASgf,EAAQ5L,GAChB,IACI1T,EADAM,EAAM,GAEV,IAAMN,EAAI,EAAGA,EAAI0T,EAAG1T,IACnBM,GAAO,IAER,OAAOA,CACR,CA4BAnC,EAAOC,QAdP,SAAmBwQ,EAAK8P,EAAOa,GAC9B,IAAIC,EAAMd,EAAQ9P,EAAI1O,OACtB,OAAKsf,EAAM,EACH5Q,EAERA,EAAQ2Q,EACP3Q,EAAM0Q,EAAQE,GACdF,EAAQE,GAAQ5Q,CAElB,YCnBA,SAAS6Q,EAAO/L,GACf,IACI1T,EADAM,EAAM,GAEV,IAAMN,EAAI,EAAGA,EAAI0T,EAAG1T,IACnBM,GAAO,IAER,OAAOA,CACR,CAoCAnC,EAAOC,QAtBP,SAAkBwQ,EAAK8P,EAAOa,GAC7B,IAAIG,GAAW,EACXF,EAAMd,EAAQ9P,EAAI1O,OACtB,OAAKsf,EAAM,IAnCZ,SAA0B5Q,GACzB,MAAoB,MAAbA,EAAK,EACb,CAoCM+Q,CAAiB/Q,KACrB8Q,GAAW,EACX9Q,EAAMA,EAAIgR,OAAQ,IAEnBhR,EAAQ2Q,EACP3Q,EAAM6Q,EAAOD,GACbC,EAAOD,GAAQ5Q,EACX8Q,IACJ9Q,EAAM,IAAMA,IAVLA,CAaT,kBC3CA,IAAI3Q,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YClBjB,IAAI4hB,EAAK,6EAYT,SAASC,EAAOC,GACf,IAAI5C,EAAQ,CACX,QAAa4C,EAAO,GAAQ9B,SAAU8B,EAAO,GAAK,SAAO,EACzD,MAASA,EAAO,GAChB,MAASA,EAAO,GAChB,UAAaA,EAAO,GACpB,UAAaA,EAAO,IAKrB,MAHoB,MAAfA,EAAO,SAA8B,IAAfA,EAAO,KACjC5C,EAAMO,UAAY,KAEZP,CACR,CA2CAhf,EAAOC,QA5BP,SAAyBwQ,GACxB,IAAIoR,EACAnB,EACAkB,EACAE,EAKJ,IAHApB,EAAS,GACToB,EAAO,EACPF,EAAQF,EAAGK,KAAMtR,GACTmR,IACPC,EAAUpR,EAAIuR,MAAOF,EAAMJ,EAAGO,UAAYL,EAAO,GAAI7f,SACxCA,QACZ2e,EAAOne,KAAMsf,GAEdnB,EAAOne,KAAMof,EAAOC,IACpBE,EAAOJ,EAAGO,UACVL,EAAQF,EAAGK,KAAMtR,GAMlB,OAJAoR,EAAUpR,EAAIuR,MAAOF,IACR/f,QACZ2e,EAAOne,KAAMsf,GAEPnB,CACR,kBC/CA,IAAI5gB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCDjBE,EAAOC,QAPP,SAAmBS,GAClB,MAA0B,kBAAVA,CACjB,kBCdA,IAAIwhB,EAAcniB,EAAS,KACvBoiB,EAAWpiB,EAAS,MACpBkD,EAAWlD,EAAS,MAuCxBC,EAAOC,QAjBP,SAASgC,EAAQwO,GAChB,IAAIrL,EACAvD,EAEJ,IAAMoB,EAAUwN,GACf,MAAM,IAAIjO,UAAWP,EAAQ,kEAAmEwO,IAGjG,IADArL,EAAO,CAAE+c,EAAU1R,IACb5O,EAAI,EAAGA,EAAI+C,UAAU7C,OAAQF,IAClCuD,EAAK7C,KAAMqC,UAAW/C,IAEvB,OAAOqgB,EAAYE,MAAO,KAAMhd,EACjC,kBCxBA,IAAItF,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCjBjB,IAAIuiB,EAA0B,oBAAXtX,OAA0BA,YAAS,EAKtD/K,EAAOC,QAAUoiB,kBC0CjB,IAAIviB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpDjB,IAmDIwiB,EAnD2BviB,EAAS,KAmDjBwD,GAA+BwH,OAAOC,SAAW,KAKxEhL,EAAOC,QAAUqiB,kBCpCjB,IAAIxiB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCQjBE,EAAOC,QAjBP,SAAeS,GACd,OAQA,WACC,OAAOA,CACR,CACD,kBCVA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCvBjB,IAAIuM,EAActM,EAAS,MACvB2hB,EAAK3hB,EAAAA,MAAAA,OACLiI,EAAWjI,EAAS,KAuDxBC,EAAOC,QAxBP,SAA0B2B,GACzB,IAAIggB,EACAvgB,EACAgH,EAEJ,IAAe,YADfhH,EAAOgL,EAAazK,GAAIogB,MAAO,GAAI,KACC,UAAT3gB,IAAqBO,EAAER,YAAc,CAE/D,GAA0B,kBAD1BiH,EAAOzG,EAAER,aACQC,KAChB,OAAOgH,EAAKhH,KAGb,GADAugB,EAAQF,EAAGK,KAAM1Z,EAAK9B,YAErB,OAAOqb,EAAO,EAEhB,CACA,OAAK5Z,EAAUpG,GACP,SAEDP,CACR,kBC7BA,IAAIvB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBC5BjB,IAAIuQ,EAAiBtQ,EAAS,MAsC9BC,EAAOC,QAXP,SAA2CyO,EAAK6T,EAAM1hB,GACrDwP,EAAgB3B,EAAK6T,EAAM,CAC1B,cAAgB,EAChB,YAAc,EACd,IAAO1hB,GAET,iBCdA,IAAIf,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCxBjB,IAAIuQ,EAAiBtQ,EAAS,MAmC9BC,EAAOC,QAZP,SAAmCyO,EAAK6T,EAAM7hB,GAC7C2P,EAAgB3B,EAAK6T,EAAM,CAC1B,cAAgB,EAChB,YAAc,EACd,UAAY,EACZ,MAAS7hB,GAEX,kBCAA,IAAIZ,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCnCjB,IAAIuQ,EAAiBtQ,EAAS,MA+C9BC,EAAOC,QAZP,SAA4CyO,EAAK6T,EAAM1hB,EAAQC,GAC9DuP,EAAgB3B,EAAK6T,EAAM,CAC1B,cAAgB,EAChB,YAAc,EACd,IAAO1hB,EACP,IAAOC,GAET,YCTA,IAAIuP,EAAiBnF,OAAOmF,eAK5BrQ,EAAOC,QAAUoQ,YCtCjB,IAAIvQ,EAA0C,oBAA1BoL,OAAOmF,eAAkCnF,OAAOmF,eAAiB,KAKrFrQ,EAAOC,QAAUH,gBCLjB,IAAIuQ,EAAiBtQ,EAAS,MA4B9BC,EAAOC,QAbP,WAEC,IAEC,OADAoQ,EAAgB,CAAC,EAAG,IAAK,CAAC,IACnB,CACR,CAAE,MAAQxG,GACT,OAAO,CACR,CACD,kBCLA,IAOIwG,EAPAmS,EAA2BziB,EAAS,IACpCwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBsQ,EADImS,IACaja,EAEAC,EAMlBxI,EAAOC,QAAUoQ,kBCjCjB,IAAIpO,EAASlC,EAAS,MAKlB0iB,EAAiBvX,OAAO7F,UACxBkL,EAAQkS,EAAelc,SACvBmc,EAAeD,EAAeE,iBAC9BC,EAAeH,EAAeI,iBAC9BC,EAAeL,EAAeM,iBAC9BC,EAAeP,EAAeQ,iBAuFlCjjB,EAAOC,QAnDP,SAAyByO,EAAK6T,EAAMW,GACnC,IAAI7d,EACA8d,EACAC,EACAC,EAEJ,GAAoB,kBAAR3U,GAA4B,OAARA,GAAsC,mBAAtB6B,EAAM5N,KAAM+L,GAC3D,MAAM,IAAIlM,UAAWP,EAAQ,mEAAoEyM,IAElG,GAA2B,kBAAfwU,GAA0C,OAAfA,GAAoD,mBAA7B3S,EAAM5N,KAAMugB,GACzE,MAAM,IAAI1gB,UAAWP,EAAQ,wEAAyEihB,IAyBvG,IAvBAC,EAAa,UAAWD,KAGtBJ,EAAangB,KAAM+L,EAAK6T,IACxBS,EAAargB,KAAM+L,EAAK6T,IAGxBld,EAAYqJ,EAAI4U,UAChB5U,EAAI4U,UAAYb,SAGT/T,EAAK6T,GACZ7T,EAAK6T,GAASW,EAAWxiB,MAGzBgO,EAAI4U,UAAYje,GAEhBqJ,EAAK6T,GAASW,EAAWxiB,OAG3B0iB,EAAW,QAASF,EACpBG,EAAW,QAASH,EAEfC,IAAcC,GAAUC,GAC5B,MAAM,IAAIre,MAAO,wHASlB,OANKoe,GAAUV,GACdA,EAAa/f,KAAM+L,EAAK6T,EAAMW,EAAW7iB,KAErCgjB,GAAUT,GACdA,EAAajgB,KAAM+L,EAAK6T,EAAMW,EAAWviB,KAEnC+N,CACR,iBC/EA,IAAI5O,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCpBjB,IAAI6X,EAAO5X,EAAS,MAChBwjB,EAAkBxjB,EAAS,MAC3ByjB,EAAezjB,EAAS,MAsC5BC,EAAOC,QAlBP,SAA+BS,GAC9B,IAAIyB,EACA+C,EACArD,EAIJ,IAFAM,EAAMwV,EAAMjX,GACZwE,EAAMqe,EAAiB7iB,GACjBmB,EAAI,EAAGA,EAAIqD,EAAInD,OAAQF,IACvB2hB,EAAc9iB,EAAOwE,EAAKrD,KAC9BM,EAAII,KAAM2C,EAAKrD,IAGjB,OAAOM,CACR,kBCjBA,IAAIrC,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCvBjB,IAAIoD,EAAanD,EAAS,MACtB0jB,EAAyB1jB,EAAS,MAClCkC,EAASlC,EAAS,MAClB2hB,EAAK3hB,EAAAA,MAAAA,OAKL2jB,EAA0BD,IA0C9BzjB,EAAOC,QAdP,SAAuBiG,GAEtB,IAA2B,IAAtBhD,EAAYgD,GAChB,MAAM,IAAI1D,UAAWP,EAAQ,0DAA2DiE,IAEzF,OAAKwd,EACGxd,EAAI7E,KAELqgB,EAAGK,KAAM7b,EAAIK,YAAc,EACnC,kBC7CA,IAOIod,EAPAzgB,EAAanD,EAAS,MACtBwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvB4jB,EADIzgB,EAAYgI,OAAO9B,gBACZb,EAEAC,EAMZxI,EAAOC,QAAU0jB,kBCLjB,IAAI7jB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBCjBjB,IAAIoL,EAASnL,EAAS,MAClB4jB,EAAW5jB,EAAS,MA+BxBC,EAAOC,QAhBP,SAAyBS,GACxB,OACW,OAAVA,QACU,IAAVA,EAEO,MAGRA,EAAQwK,EAAQxK,GAETijB,EAAUjjB,GAClB,YC3BA,IAAIijB,EAAWzY,OAAO9B,eAKtBpJ,EAAOC,QAAU0jB,kBCLjB,IAAItX,EAActM,EAAS,MACvB4jB,EAAW5jB,EAAS,MA+BxBC,EAAOC,QAnBP,SAAyByO,GACxB,IAAIF,EAAQmV,EAAUjV,GACtB,OAAKF,GAAmB,OAAVA,EACNA,EAEgC,sBAAnCnC,EAAaqC,EAAItN,aAEdsN,EAAItN,YAAYiE,UAEnBqJ,aAAexD,OACZA,OAAO7F,UAGR,IACR,YCdArF,EAAOC,QARP,SAAmByO,GAElB,OAAOA,EAAI4U,SACZ,kBCRA,IAAI9K,EAAYzY,EAAAA,MAAAA,YACZkC,EAASlC,EAAS,MAClB6jB,EAAU7jB,EAAS,MACnB8jB,EAAO9jB,EAAS,MAChB+jB,EAAM/jB,EAAS,KACfgkB,EAAahkB,EAAS,MAmD1BC,EAAOC,QA7BP,SAAoB+jB,GACnB,GAAKpf,UAAU7C,OAAS,CACvB,IAAMyW,EAAWwL,GAChB,MAAM,IAAIxhB,UAAWP,EAAQ,yDAA0D+hB,IAExF,GAAKA,EACJ,OAAOJ,GAGT,CAEA,GAAKG,EACJ,OAAOA,EAGR,GAAKF,EACJ,OAAOA,EAGR,GAAKC,EACJ,OAAOA,EAGR,MAAM,IAAI9e,MAAO,qDAClB,YCtCAhF,EAAOC,QAPP,WACC,OAAO,IAAIgkB,SAAU,eAAd,EACR,YCRA,IAAIvV,EAA8B,kBAAfwV,WAA4BA,WAAa,KAK5DlkB,EAAOC,QAAUyO,YCLjB,IAAIA,EAAwB,kBAAThJ,KAAsBA,KAAO,KAKhD1F,EAAOC,QAAUyO,WCLjB,IAAIA,EAA0B,kBAAXyV,OAAwBA,OAAS,KAKpDnkB,EAAOC,QAAUyO,kBCwCjB,IAAI5O,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,kBClDjB,IAAIoN,EAAQnN,EAAS,KACjB8C,EAAe9C,EAAS,MACxBkD,EAAWlD,EAAAA,MAAAA,YACXqD,EAAYrD,EAAAA,MAAAA,YACZkC,EAASlC,EAAS,MA0GtBC,EAAOC,QAhDP,SAAkBE,EAAKgG,EAAeC,GACrC,IAAIzE,EACAE,EACJ,IAAMgB,EAAc1C,KAAU8C,EAAU9C,GACvC,MAAM,IAAIqC,UAAWP,EAAQ,8EAA+E9B,IAG7G,GAAa,KADbwB,EAAMxB,EAAI4B,QAET,OAAQ,EAET,GAA0B,IAArB6C,UAAU7C,OAAe,CAC7B,IAAMqB,EAAWgD,GAChB,MAAM,IAAI5D,UAAWP,EAAQ,oEAAqEmE,IAEnG,GAAKA,GAAa,EAAI,CACrB,GAAKA,GAAazE,EACjB,OAAQ,EAETE,EAAIuE,CACL,MACCvE,EAAIF,EAAMyE,GACD,IACRvE,EAAI,EAGP,MACCA,EAAI,EAGL,GAAKqL,EAAO/G,IACX,KAAQtE,EAAIF,EAAKE,IAChB,GAAKqL,EAAO/M,EAAI0B,IACf,OAAOA,OAIT,KAAQA,EAAIF,EAAKE,IAChB,GAAK1B,EAAK0B,KAAQsE,EACjB,OAAOtE,EAIV,OAAQ,CACT,YC9EA7B,EAAOC,QAPP,SAAeS,GACd,OAAOwK,OAAOyM,KAAMzM,OAAQxK,GAC7B,kBCtBA,IAAIwL,EAAcnM,EAAS,MACvBwI,EAAUxI,EAAS,MAKnBiiB,EAAQxV,MAAMnH,UAAU2c,MA+B5BhiB,EAAOC,QAVP,SAAeS,GACd,OAAKwL,EAAaxL,GACV6H,EAASyZ,EAAMrf,KAAMjC,IAEtB6H,EAAS7H,EACjB,kBChCA,IAAIiX,EAAO5X,EAAS,MAmCpBC,EAAOC,QAPP,WACC,OAlBD,WACC,OAA8C,KAArC0X,EAAM/S,YAAe,IAAK7C,MACpC,CAgBQ+K,CAAM,EAAG,EACjB,kBC9BA,IAUIlD,EAVAkB,EAAa/K,EAAS,MACtBihB,EAAUjhB,EAAS,MACnByN,EAASzN,EAAS,MAClBqkB,EAAyBrkB,EAAS,MAClCskB,EAAgBtkB,EAAS,MACzBukB,EAAMvkB,EAAS,MA2CnB6J,EAzBA,WACC,IAAIsI,EACJ,GAAuB,cAAlB1E,EAAQ8W,GACZ,OAAO,EAER,IAAMpS,KAAKoS,EACV,KAEmC,IAAjCtD,EAASqD,EAAenS,IACxBpH,EAAYwZ,EAAKpS,IACJ,OAAboS,EAAKpS,IACkB,WAAvB1E,EAAQ8W,EAAKpS,KAEbkS,EAAwBE,EAAKpS,GAE/B,CAAE,MAAQrI,GACT,OAAO,CACR,CAED,OAAO,CACR,CAKO0a,GAKPvkB,EAAOC,QAAU2J,YCrDjB,IAAIA,EAAgC,qBAAhBsB,OAAOyM,KAK3B3X,EAAOC,QAAU2J,kBCLjB,IAOIA,EAPuB7J,EAAS,KAOzBuM,CANAvM,EAAS,MAMmB,aAKvCC,EAAOC,QAAU2J,kBCZjB,IAaIA,GAbuB7J,EAAS,KAaxBuM,CARF,CACT,SAAY,MAO0B,YAKvCtM,EAAOC,QAAU2J,YClBjB,IAAIA,EAA2B,qBAAXua,OAKpBnkB,EAAOC,QAAU2J,kBCYjB,IAAI9J,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCRjBE,EAAOC,QAPP,SAAiCS,GAChC,OAASA,EAAMU,aAAeV,EAAMU,YAAYiE,YAAc3E,CAC/D,kBCTA,IAAI8jB,EAA2BzkB,EAAS,MACpCqkB,EAAyBrkB,EAAS,MAClC0kB,EAAa1kB,EAAS,MA0B1BC,EAAOC,QAdP,SAAkBS,GACjB,IAAoB,IAAf+jB,IAAyBD,EAC7B,OAAOJ,EAAwB1jB,GAEhC,IACC,OAAO0jB,EAAwB1jB,EAChC,CAAE,MAAQgkB,GACT,OAAO,CACR,CACD,kBCvBA,IA0BI/M,EA1BAgN,EAAkB5kB,EAAS,MAC3B6kB,EAAc7kB,EAAS,MACvBwI,EAAUxI,EAAS,MACnB8kB,EAAU9kB,EAAS,MACnByI,EAAWzI,EAAS,MAyBtB4X,EAFGiN,EACCD,IACGE,EAEAtc,EAGDC,EAMRxI,EAAOC,QAAU0X,kBCxCjB,IAAI5K,EAAehN,EAAS,MACxB+K,EAAa/K,EAAS,MACtBmM,EAAcnM,EAAS,MACvB+kB,EAAqB/kB,EAAS,MAC9BglB,EAAyBhlB,EAAS,MAClCqkB,EAAyBrkB,EAAS,MAClCilB,EAAiBjlB,EAAS,MAyE9BC,EAAOC,QApDP,SAAeS,GACd,IAAIukB,EACAC,EACAC,EACAhjB,EACA+P,EACAkT,EACAvjB,EAGJ,GADAM,EAAM,GACD+J,EAAaxL,GAAU,CAE3B,IAAMmB,EAAI,EAAGA,EAAInB,EAAMqB,OAAQF,IAC9BM,EAAII,KAAMV,EAAE0E,YAGb,OAAOpE,CACR,CACA,GAAsB,kBAAVzB,GAEX,GAAKA,EAAMqB,OAAS,IAAM+I,EAAYpK,EAAO,KAC5C,IAAMmB,EAAI,EAAGA,EAAInB,EAAMqB,OAAQF,IAC9BM,EAAII,KAAMV,EAAE0E,gBAGR,CAEN,IAAe,KADf4e,EAA2B,oBAAVzkB,KACQqM,EAAcrM,GACtC,OAAOyB,EAER+iB,EAAkBJ,GAAsBK,CACzC,CACA,IAAMjT,KAAKxR,EACFwkB,GAAuB,cAANhT,IAAuBpH,EAAYpK,EAAOwR,IAClE/P,EAAII,KAAMsM,OAAQqD,IAGpB,GAAK6S,EAEJ,IADAE,EAAkBb,EAAwB1jB,GACpCmB,EAAI,EAAGA,EAAImjB,EAAejjB,OAAQF,IACvCujB,EAAIJ,EAAgBnjB,GACZojB,GAAyB,gBAANG,IAAyBta,EAAYpK,EAAO0kB,IACtEjjB,EAAII,KAAMsM,OAAQuW,IAIrB,OAAOjjB,CACR,YC1EA,IAAI6R,EAAwB,qBAAXmQ,YAA2B,EAASA,OAKrDnkB,EAAOC,QAAU+T,kBCgBjB,IAOIlU,EAPA8M,EAAiB7M,EAAS,MAC1BwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBD,EADI8M,IACGpE,EAEAD,EAMRvI,EAAOC,QAAUH,kBCtCjB,IAAIyQ,EAAQxQ,EAAS,MAiCrBC,EAAOC,QAPP,SAAsB2B,GACrB,OAAO2O,EAAM5N,KAAMf,EACpB,kBC5BA,IAAIkJ,EAAa/K,EAAS,MACtBuL,EAAcvL,EAAS,MACvBwQ,EAAQxQ,EAAS,MAwDrBC,EAAOC,QA9BP,SAAsB2B,GACrB,IAAIyjB,EACAC,EACAnjB,EAEJ,GAAW,OAANP,QAAoB,IAANA,EAClB,OAAO2O,EAAM5N,KAAMf,GAEpB0jB,EAAM1jB,EAAG0J,GACT+Z,EAAQva,EAAYlJ,EAAG0J,GAGvB,IACC1J,EAAG0J,QAAgB,CACpB,CAAE,MAAQzB,GACT,OAAO0G,EAAM5N,KAAMf,EACpB,CAQA,OAPAO,EAAMoO,EAAM5N,KAAMf,GAEbyjB,EACJzjB,EAAG0J,GAAgBga,SAEZ1jB,EAAG0J,GAEJnJ,CACR,YCrDA,IAAIoO,EAAQrF,OAAO7F,UAAUkB,SAK7BvG,EAAOC,QAAUsQ,kBCLjB,IAAIxF,EAAShL,EAAS,MAKlBwlB,EAA+B,oBAAXxa,EAA0BA,EAAOO,YAAc,GAKvEtL,EAAOC,QAAUslB,kBCEjB,IAAIzlB,EAAOC,EAAS,MAKpBC,EAAOC,QAAUH,YCLjBE,EAAOC,QAPP,WACC,kBCND,IAAIiL,EAASnL,EAAS,MAKlBwjB,EAAkBrY,EAAOsa,sBA0B7BxlB,EAAOC,QAPP,SAAgCS,GAC/B,OAAO6iB,EAAiBrY,EAAQxK,GACjC,YC1BA,IAAIkJ,EAAiD,qBAAjCsB,OAAOsa,sBAK3BxlB,EAAOC,QAAU2J,kBCMjB,IAOI9J,EAPA8kB,EAAc7kB,EAAS,MACvBwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAOvBD,EADI8kB,EACGrc,EAEAC,EAMRxI,EAAOC,QAAUH,YCNjBE,EAAOC,QAPP,WACC,MAAO,EACR,kBCjBA,IAAIyhB,EAAK3hB,EAAS,MACd0lB,EAAW1lB,EAAS,MACpB2lB,EAAa3lB,EAAS,MA8B1BC,EAAOC,QAnBP,WACC,MAEe,oBAAPyhB,GAGe,kBAAfgE,GAGa,oBAAbD,CAKT,kBC3BA,IAKIE,EALY5lB,EAAS,KAKd6lB,GACPH,EAAWE,EAAKE,UAAYF,EAAKE,SAASC,WAK9C9lB,EAAOC,QAAUwlB,YCRjBzlB,EAAOC,QALE,cCAT,IAAIylB,EAAa7c,UAKjB7I,EAAOC,QAAUylB,kBCYjB,IAAIK,EAAchmB,EAAS,MACvBwI,EAAUxI,EAAS,MACnByI,EAAWzI,EAAS,MAKpBD,EAASimB,IAAkBvd,EAAWD,EAK1CvI,EAAOC,QAAUH,kBC3BjB,IAAIqJ,EAAWpJ,EAAS,MAqDxBC,EAAOC,QAnBP,SAAiB2B,GAChB,IAAIokB,EAGJ,OAAW,OAANpkB,EACG,OAKM,YAHdokB,SAAcpkB,GAINuH,EAAUvH,GAAIyc,cAEf2H,CACR,kBChDA,IAAI7c,EAAWpJ,EAAS,MAkBxBC,EAAOC,QAPP,SAAiB2B,GAChB,OAAOuH,EAAUvH,GAAIyc,aACtB,kBCvBa,IAAI4H,EAAGlmB,EAAQ,MAASmmB,EAAGnmB,EAAQ,MAAa,SAASqlB,EAAEtU,GAAG,IAAI,IAAIC,EAAE,yDAAyDD,EAAEuB,EAAE,EAAEA,EAAEzN,UAAU7C,OAAOsQ,IAAItB,GAAG,WAAWoV,mBAAmBvhB,UAAUyN,IAAI,MAAM,yBAAyBvB,EAAE,WAAWC,EAAE,gHAAgH,CAAC,IAAIqV,EAAG,IAAIC,IAAIC,EAAG,CAAC,EAAE,SAASC,EAAGzV,EAAEC,GAAGyV,EAAG1V,EAAEC,GAAGyV,EAAG1V,EAAE,UAAUC,EAAE,CACxb,SAASyV,EAAG1V,EAAEC,GAAW,IAARuV,EAAGxV,GAAGC,EAAMD,EAAE,EAAEA,EAAEC,EAAEhP,OAAO+O,IAAIsV,EAAGK,IAAI1V,EAAED,GAAG,CAC5D,IAAI4V,IAAK,qBAAqBvC,QAAQ,qBAAqBA,OAAO0B,UAAU,qBAAqB1B,OAAO0B,SAASc,eAAeC,EAAG1b,OAAO7F,UAAU8F,eAAe0b,EAAG,8VAA8V7V,EACpgB,CAAC,EAAE8V,EAAG,CAAC,EACiN,SAASllB,EAAEkP,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,GAAGniB,KAAKoiB,gBAAgB,IAAIlW,GAAG,IAAIA,GAAG,IAAIA,EAAElM,KAAKqiB,cAActM,EAAE/V,KAAKsiB,mBAAmBJ,EAAEliB,KAAKuiB,gBAAgB/U,EAAExN,KAAKwiB,aAAavW,EAAEjM,KAAKmhB,KAAKjV,EAAElM,KAAKyiB,YAAY/mB,EAAEsE,KAAK0iB,kBAAkBP,CAAC,CAAC,IAAI5kB,EAAE,CAAC,EACpb,uIAAuIolB,MAAM,KAAKC,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,CAAC,gBAAgB,kBAAkB,CAAC,YAAY,SAAS,CAAC,UAAU,OAAO,CAAC,YAAY,eAAe2W,SAAQ,SAAS3W,GAAG,IAAIC,EAAED,EAAE,GAAG1O,EAAE2O,GAAG,IAAInP,EAAEmP,EAAE,GAAE,EAAGD,EAAE,GAAG,MAAK,GAAG,EAAG,IAAG,CAAC,kBAAkB,YAAY,aAAa,SAAS2W,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAEuN,cAAc,MAAK,GAAG,EAAG,IAC1e,CAAC,cAAc,4BAA4B,YAAY,iBAAiBoJ,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,8OAA8O0W,MAAM,KAAKC,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAEuN,cAAc,MAAK,GAAG,EAAG,IACxb,CAAC,UAAU,WAAW,QAAQ,YAAYoJ,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,UAAU,YAAY2W,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,OAAO,OAAO,OAAO,QAAQ2W,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,UAAU,SAAS2W,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAEuN,cAAc,MAAK,GAAG,EAAG,IAAG,IAAIqJ,EAAG,gBAAgB,SAASC,EAAG7W,GAAG,OAAOA,EAAE,GAAGyN,aAAa,CAIxZ,SAASqJ,EAAG9W,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAE3kB,EAAE+I,eAAe4F,GAAG3O,EAAE2O,GAAG,MAAQ,OAAOgW,EAAE,IAAIA,EAAEf,KAAKpL,KAAK,EAAE7J,EAAEhP,SAAS,MAAMgP,EAAE,IAAI,MAAMA,EAAE,IAAI,MAAMA,EAAE,IAAI,MAAMA,EAAE,MAP9I,SAAYD,EAAEC,EAAEsB,EAAEuI,GAAG,GAAG,OAAO7J,GAAG,qBAAqBA,GADqE,SAAYD,EAAEC,EAAEsB,EAAEuI,GAAG,GAAG,OAAOvI,GAAG,IAAIA,EAAE2T,KAAK,OAAM,EAAG,cAAcjV,GAAG,IAAK,WAAW,IAAK,SAAS,OAAM,EAAG,IAAK,UAAU,OAAG6J,IAAc,OAAOvI,GAASA,EAAE4U,gBAAmD,WAAnCnW,EAAEA,EAAEuN,cAAc2D,MAAM,EAAE,KAAsB,UAAUlR,GAAE,QAAQ,OAAM,EAAG,CAC/T+W,CAAG/W,EAAEC,EAAEsB,EAAEuI,GAAG,OAAM,EAAG,GAAGA,EAAE,OAAM,EAAG,GAAG,OAAOvI,EAAE,OAAOA,EAAE2T,MAAM,KAAK,EAAE,OAAOjV,EAAE,KAAK,EAAE,OAAM,IAAKA,EAAE,KAAK,EAAE,OAAOsP,MAAMtP,GAAG,KAAK,EAAE,OAAOsP,MAAMtP,IAAI,EAAEA,EAAE,OAAM,CAAE,CAOtE+W,CAAG/W,EAAEsB,EAAE0U,EAAEnM,KAAKvI,EAAE,MAAMuI,GAAG,OAAOmM,EARxK,SAAYjW,GAAG,QAAG8V,EAAGjkB,KAAKmkB,EAAGhW,KAAe8V,EAAGjkB,KAAKqO,EAAGF,KAAe+V,EAAG/Z,KAAKgE,GAAUgW,EAAGhW,IAAG,GAAGE,EAAGF,IAAG,GAAS,GAAE,CAQwDiX,CAAGhX,KAAK,OAAOsB,EAAEvB,EAAEkX,gBAAgBjX,GAAGD,EAAEmX,aAAalX,EAAE,GAAGsB,IAAI0U,EAAEK,gBAAgBtW,EAAEiW,EAAEM,cAAc,OAAOhV,EAAE,IAAI0U,EAAEf,MAAQ,GAAG3T,GAAGtB,EAAEgW,EAAEG,cAActM,EAAEmM,EAAEI,mBAAmB,OAAO9U,EAAEvB,EAAEkX,gBAAgBjX,IAAasB,EAAE,KAAX0U,EAAEA,EAAEf,OAAc,IAAIe,IAAG,IAAK1U,EAAE,GAAG,GAAGA,EAAEuI,EAAE9J,EAAEoX,eAAetN,EAAE7J,EAAEsB,GAAGvB,EAAEmX,aAAalX,EAAEsB,KAAI,CAHjd,0jCAA0jCmV,MAAM,KAAKC,SAAQ,SAAS3W,GAAG,IAAIC,EAAED,EAAE0N,QAAQkJ,EACzmCC,GAAIvlB,EAAE2O,GAAG,IAAInP,EAAEmP,EAAE,GAAE,EAAGD,EAAE,MAAK,GAAG,EAAG,IAAG,2EAA2E0W,MAAM,KAAKC,SAAQ,SAAS3W,GAAG,IAAIC,EAAED,EAAE0N,QAAQkJ,EAAGC,GAAIvlB,EAAE2O,GAAG,IAAInP,EAAEmP,EAAE,GAAE,EAAGD,EAAE,gCAA+B,GAAG,EAAG,IAAG,CAAC,WAAW,WAAW,aAAa2W,SAAQ,SAAS3W,GAAG,IAAIC,EAAED,EAAE0N,QAAQkJ,EAAGC,GAAIvlB,EAAE2O,GAAG,IAAInP,EAAEmP,EAAE,GAAE,EAAGD,EAAE,wCAAuC,GAAG,EAAG,IAAG,CAAC,WAAW,eAAe2W,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAEuN,cAAc,MAAK,GAAG,EAAG,IACldjc,EAAE+lB,UAAU,IAAIvmB,EAAE,YAAY,GAAE,EAAG,aAAa,gCAA+B,GAAG,GAAI,CAAC,MAAM,OAAO,SAAS,cAAc6lB,SAAQ,SAAS3W,GAAG1O,EAAE0O,GAAG,IAAIlP,EAAEkP,EAAE,GAAE,EAAGA,EAAEuN,cAAc,MAAK,GAAG,EAAG,IAE5L,IAAI+J,EAAGnC,EAAGoC,mDAAmDC,EAAGvd,OAAOwd,IAAI,iBAAiBC,EAAGzd,OAAOwd,IAAI,gBAAgBE,EAAG1d,OAAOwd,IAAI,kBAAkBG,EAAG3d,OAAOwd,IAAI,qBAAqBI,EAAG5d,OAAOwd,IAAI,kBAAkBK,EAAG7d,OAAOwd,IAAI,kBAAkBM,EAAG9d,OAAOwd,IAAI,iBAAiBO,EAAG/d,OAAOwd,IAAI,qBAAqBQ,EAAGhe,OAAOwd,IAAI,kBAAkBS,EAAGje,OAAOwd,IAAI,uBAAuBU,EAAGle,OAAOwd,IAAI,cAAcW,EAAGne,OAAOwd,IAAI,cAAcxd,OAAOwd,IAAI,eAAexd,OAAOwd,IAAI,0BACje,IAAIY,EAAGpe,OAAOwd,IAAI,mBAAmBxd,OAAOwd,IAAI,uBAAuBxd,OAAOwd,IAAI,eAAexd,OAAOwd,IAAI,wBAAwB,IAAIa,EAAGre,OAAOC,SAAS,SAASqe,EAAGvY,GAAG,OAAG,OAAOA,GAAG,kBAAkBA,EAAS,KAAwC,oBAAnCA,EAAEsY,GAAItY,EAAEsY,IAAKtY,EAAE,eAA0CA,EAAE,IAAI,CAAC,IAAoBwY,EAAhBvP,EAAE7O,OAAO2G,OAAU,SAAS0X,EAAGzY,GAAG,QAAG,IAASwY,EAAG,IAAI,MAAMtkB,OAAQ,CAAC,MAAMqN,GAAG,IAAItB,EAAEsB,EAAEmX,MAAMC,OAAO7H,MAAM,gBAAgB0H,EAAGvY,GAAGA,EAAE,IAAI,EAAE,CAAC,MAAM,KAAKuY,EAAGxY,CAAC,CAAC,IAAI4Y,GAAG,EACzb,SAASC,EAAG7Y,EAAEC,GAAG,IAAID,GAAG4Y,EAAG,MAAM,GAAGA,GAAG,EAAG,IAAIrX,EAAErN,MAAM4kB,kBAAkB5kB,MAAM4kB,uBAAkB,EAAO,IAAI,GAAG7Y,EAAE,GAAGA,EAAE,WAAW,MAAM/L,OAAQ,EAAEkG,OAAOmF,eAAeU,EAAE1L,UAAU,QAAQ,CAAC1E,IAAI,WAAW,MAAMqE,OAAQ,IAAI,kBAAkB6kB,SAASA,QAAQC,UAAU,CAAC,IAAID,QAAQC,UAAU/Y,EAAE,GAAG,CAAC,MAAMgZ,GAAG,IAAInP,EAAEmP,CAAC,CAACF,QAAQC,UAAUhZ,EAAE,GAAGC,EAAE,KAAK,CAAC,IAAIA,EAAEpO,MAAM,CAAC,MAAMonB,GAAGnP,EAAEmP,CAAC,CAACjZ,EAAEnO,KAAKoO,EAAE1L,UAAU,KAAK,CAAC,IAAI,MAAML,OAAQ,CAAC,MAAM+kB,GAAGnP,EAAEmP,CAAC,CAACjZ,GAAG,CAAC,CAAC,MAAMiZ,GAAG,GAAGA,GAAGnP,GAAG,kBAAkBmP,EAAEP,MAAM,CAAC,IAAI,IAAIzC,EAAEgD,EAAEP,MAAMhC,MAAM,MACnfjnB,EAAEqa,EAAE4O,MAAMhC,MAAM,MAAMR,EAAED,EAAEhlB,OAAO,EAAEioB,EAAEzpB,EAAEwB,OAAO,EAAE,GAAGilB,GAAG,GAAGgD,GAAGjD,EAAEC,KAAKzmB,EAAEypB,IAAIA,IAAI,KAAK,GAAGhD,GAAG,GAAGgD,EAAEhD,IAAIgD,IAAI,GAAGjD,EAAEC,KAAKzmB,EAAEypB,GAAG,CAAC,GAAG,IAAIhD,GAAG,IAAIgD,EAAG,MAAMhD,IAAQ,IAAJgD,GAASjD,EAAEC,KAAKzmB,EAAEypB,GAAG,CAAC,IAAI9X,EAAE,KAAK6U,EAAEC,GAAGxI,QAAQ,WAAW,QAA6F,OAArF1N,EAAEmZ,aAAa/X,EAAEgY,SAAS,iBAAiBhY,EAAEA,EAAEsM,QAAQ,cAAc1N,EAAEmZ,cAAqB/X,CAAC,QAAO,GAAG8U,GAAG,GAAGgD,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQN,GAAG,EAAG1kB,MAAM4kB,kBAAkBvX,CAAC,CAAC,OAAOvB,EAAEA,EAAEA,EAAEmZ,aAAanZ,EAAEzP,KAAK,IAAIkoB,EAAGzY,GAAG,EAAE,CAC9Z,SAASqZ,EAAGrZ,GAAG,OAAOA,EAAEwU,KAAK,KAAK,EAAE,OAAOiE,EAAGzY,EAAEkV,MAAM,KAAK,GAAG,OAAOuD,EAAG,QAAQ,KAAK,GAAG,OAAOA,EAAG,YAAY,KAAK,GAAG,OAAOA,EAAG,gBAAgB,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,OAAOzY,EAAE6Y,EAAG7Y,EAAEkV,MAAK,GAAM,KAAK,GAAG,OAAOlV,EAAE6Y,EAAG7Y,EAAEkV,KAAKoE,QAAO,GAAM,KAAK,EAAE,OAAOtZ,EAAE6Y,EAAG7Y,EAAEkV,MAAK,GAAM,QAAQ,MAAM,GAAG,CACxR,SAASqE,EAAGvZ,GAAG,GAAG,MAAMA,EAAE,OAAO,KAAK,GAAG,oBAAoBA,EAAE,OAAOA,EAAEmZ,aAAanZ,EAAEzP,MAAM,KAAK,GAAG,kBAAkByP,EAAE,OAAOA,EAAE,OAAOA,GAAG,KAAK2X,EAAG,MAAM,WAAW,KAAKD,EAAG,MAAM,SAAS,KAAKG,EAAG,MAAM,WAAW,KAAKD,EAAG,MAAM,aAAa,KAAKK,EAAG,MAAM,WAAW,KAAKC,EAAG,MAAM,eAAe,GAAG,kBAAkBlY,EAAE,OAAOA,EAAEwZ,UAAU,KAAKzB,EAAG,OAAO/X,EAAEmZ,aAAa,WAAW,YAAY,KAAKrB,EAAG,OAAO9X,EAAEyZ,SAASN,aAAa,WAAW,YAAY,KAAKnB,EAAG,IAAI/X,EAAED,EAAEsZ,OAC7Z,OADoatZ,EAAEA,EAAEmZ,eACndnZ,EAAE,MADieA,EAAEC,EAAEkZ,aAClflZ,EAAE1P,MAAM,IAAY,cAAcyP,EAAE,IAAI,cAAqBA,EAAE,KAAKmY,EAAG,OAA6B,QAAtBlY,EAAED,EAAEmZ,aAAa,MAAclZ,EAAEsZ,EAAGvZ,EAAEkV,OAAO,OAAO,KAAKkD,EAAGnY,EAAED,EAAE0Z,SAAS1Z,EAAEA,EAAE2Z,MAAM,IAAI,OAAOJ,EAAGvZ,EAAEC,GAAG,CAAC,MAAMsB,GAAG,EAAE,OAAO,IAAI,CAC3M,SAASqY,EAAG5Z,GAAG,IAAIC,EAAED,EAAEkV,KAAK,OAAOlV,EAAEwU,KAAK,KAAK,GAAG,MAAM,QAAQ,KAAK,EAAE,OAAOvU,EAAEkZ,aAAa,WAAW,YAAY,KAAK,GAAG,OAAOlZ,EAAEwZ,SAASN,aAAa,WAAW,YAAY,KAAK,GAAG,MAAM,qBAAqB,KAAK,GAAG,OAAkBnZ,GAAXA,EAAEC,EAAEqZ,QAAWH,aAAanZ,EAAEzP,MAAM,GAAG0P,EAAEkZ,cAAc,KAAKnZ,EAAE,cAAcA,EAAE,IAAI,cAAc,KAAK,EAAE,MAAM,WAAW,KAAK,EAAE,OAAOC,EAAE,KAAK,EAAE,MAAM,SAAS,KAAK,EAAE,MAAM,OAAO,KAAK,EAAE,MAAM,OAAO,KAAK,GAAG,OAAOsZ,EAAGtZ,GAAG,KAAK,EAAE,OAAOA,IAAI2X,EAAG,aAAa,OAAO,KAAK,GAAG,MAAM,YACtf,KAAK,GAAG,MAAM,WAAW,KAAK,GAAG,MAAM,QAAQ,KAAK,GAAG,MAAM,WAAW,KAAK,GAAG,MAAM,eAAe,KAAK,GAAG,MAAM,gBAAgB,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,GAAG,oBAAoB3X,EAAE,OAAOA,EAAEkZ,aAAalZ,EAAE1P,MAAM,KAAK,GAAG,kBAAkB0P,EAAE,OAAOA,EAAE,OAAO,IAAI,CAAC,SAAS4Z,EAAG7Z,GAAG,cAAcA,GAAG,IAAK,UAAU,IAAK,SAAS,IAAK,SAAS,IAAK,YAAqB,IAAK,SAAS,OAAOA,EAAE,QAAQ,MAAM,GAAG,CACra,SAAS8Z,EAAG9Z,GAAG,IAAIC,EAAED,EAAEkV,KAAK,OAAOlV,EAAEA,EAAE+Z,WAAW,UAAU/Z,EAAEuN,gBAAgB,aAAatN,GAAG,UAAUA,EAAE,CAEtF,SAAS+Z,EAAGha,GAAGA,EAAEia,gBAAgBja,EAAEia,cADvD,SAAYja,GAAG,IAAIC,EAAE6Z,EAAG9Z,GAAG,UAAU,QAAQuB,EAAEnH,OAAO8f,yBAAyBla,EAAE1P,YAAYiE,UAAU0L,GAAG6J,EAAE,GAAG9J,EAAEC,GAAG,IAAID,EAAE3F,eAAe4F,IAAI,qBAAqBsB,GAAG,oBAAoBA,EAAEhS,KAAK,oBAAoBgS,EAAE1R,IAAI,CAAC,IAAIomB,EAAE1U,EAAEhS,IAAIE,EAAE8R,EAAE1R,IAAiL,OAA7KuK,OAAOmF,eAAeS,EAAEC,EAAE,CAACka,cAAa,EAAG5qB,IAAI,WAAW,OAAO0mB,EAAEpkB,KAAKkC,KAAK,EAAElE,IAAI,SAASmQ,GAAG8J,EAAE,GAAG9J,EAAEvQ,EAAEoC,KAAKkC,KAAKiM,EAAE,IAAI5F,OAAOmF,eAAeS,EAAEC,EAAE,CAACma,WAAW7Y,EAAE6Y,aAAmB,CAACC,SAAS,WAAW,OAAOvQ,CAAC,EAAEwQ,SAAS,SAASta,GAAG8J,EAAE,GAAG9J,CAAC,EAAEua,aAAa,WAAWva,EAAEia,cACxf,YAAYja,EAAEC,EAAE,EAAE,CAAC,CAAkDua,CAAGxa,GAAG,CAAC,SAASya,EAAGza,GAAG,IAAIA,EAAE,OAAM,EAAG,IAAIC,EAAED,EAAEia,cAAc,IAAIha,EAAE,OAAM,EAAG,IAAIsB,EAAEtB,EAAEoa,WAAevQ,EAAE,GAAqD,OAAlD9J,IAAI8J,EAAEgQ,EAAG9Z,GAAGA,EAAE0a,QAAQ,OAAO,QAAQ1a,EAAEpQ,QAAOoQ,EAAE8J,KAAavI,IAAGtB,EAAEqa,SAASta,IAAG,EAAM,CAAC,SAAS2a,EAAG3a,GAAwD,GAAG,qBAAxDA,EAAEA,IAAI,qBAAqB+U,SAASA,cAAS,IAAkC,OAAO,KAAK,IAAI,OAAO/U,EAAE4a,eAAe5a,EAAE6a,IAAI,CAAC,MAAM5a,GAAG,OAAOD,EAAE6a,IAAI,CAAC,CACpa,SAASC,EAAG9a,EAAEC,GAAG,IAAIsB,EAAEtB,EAAEya,QAAQ,OAAOzR,EAAE,CAAC,EAAEhJ,EAAE,CAAC8a,oBAAe,EAAOC,kBAAa,EAAOprB,WAAM,EAAO8qB,QAAQ,MAAMnZ,EAAEA,EAAEvB,EAAEib,cAAcC,gBAAgB,CAAC,SAASC,EAAGnb,EAAEC,GAAG,IAAIsB,EAAE,MAAMtB,EAAE+a,aAAa,GAAG/a,EAAE+a,aAAalR,EAAE,MAAM7J,EAAEya,QAAQza,EAAEya,QAAQza,EAAE8a,eAAexZ,EAAEsY,EAAG,MAAM5Z,EAAErQ,MAAMqQ,EAAErQ,MAAM2R,GAAGvB,EAAEib,cAAc,CAACC,eAAepR,EAAEjU,aAAa0L,EAAE6Z,WAAW,aAAanb,EAAEiV,MAAM,UAAUjV,EAAEiV,KAAK,MAAMjV,EAAEya,QAAQ,MAAMza,EAAErQ,MAAM,CAAC,SAASyrB,EAAGrb,EAAEC,GAAe,OAAZA,EAAEA,EAAEya,UAAiB5D,EAAG9W,EAAE,UAAUC,GAAE,EAAG,CAC9d,SAASqb,EAAGtb,EAAEC,GAAGob,EAAGrb,EAAEC,GAAG,IAAIsB,EAAEsY,EAAG5Z,EAAErQ,OAAOka,EAAE7J,EAAEiV,KAAK,GAAG,MAAM3T,EAAK,WAAWuI,GAAM,IAAIvI,GAAG,KAAKvB,EAAEpQ,OAAOoQ,EAAEpQ,OAAO2R,KAAEvB,EAAEpQ,MAAM,GAAG2R,GAAOvB,EAAEpQ,QAAQ,GAAG2R,IAAIvB,EAAEpQ,MAAM,GAAG2R,QAAQ,GAAG,WAAWuI,GAAG,UAAUA,EAA8B,YAA3B9J,EAAEkX,gBAAgB,SAAgBjX,EAAE5F,eAAe,SAASkhB,GAAGvb,EAAEC,EAAEiV,KAAK3T,GAAGtB,EAAE5F,eAAe,iBAAiBkhB,GAAGvb,EAAEC,EAAEiV,KAAK2E,EAAG5Z,EAAE+a,eAAe,MAAM/a,EAAEya,SAAS,MAAMza,EAAE8a,iBAAiB/a,EAAE+a,iBAAiB9a,EAAE8a,eAAe,CACla,SAASS,EAAGxb,EAAEC,EAAEsB,GAAG,GAAGtB,EAAE5F,eAAe,UAAU4F,EAAE5F,eAAe,gBAAgB,CAAC,IAAIyP,EAAE7J,EAAEiV,KAAK,KAAK,WAAWpL,GAAG,UAAUA,QAAG,IAAS7J,EAAErQ,OAAO,OAAOqQ,EAAErQ,OAAO,OAAOqQ,EAAE,GAAGD,EAAEib,cAAcplB,aAAa0L,GAAGtB,IAAID,EAAEpQ,QAAQoQ,EAAEpQ,MAAMqQ,GAAGD,EAAEgb,aAAa/a,CAAC,CAAU,MAATsB,EAAEvB,EAAEzP,QAAcyP,EAAEzP,KAAK,IAAIyP,EAAE+a,iBAAiB/a,EAAEib,cAAcC,eAAe,KAAK3Z,IAAIvB,EAAEzP,KAAKgR,EAAE,CACzV,SAASga,GAAGvb,EAAEC,EAAEsB,GAAM,WAAWtB,GAAG0a,EAAG3a,EAAEyb,iBAAiBzb,IAAE,MAAMuB,EAAEvB,EAAEgb,aAAa,GAAGhb,EAAEib,cAAcplB,aAAamK,EAAEgb,eAAe,GAAGzZ,IAAIvB,EAAEgb,aAAa,GAAGzZ,GAAE,CAAC,IAAIma,GAAGhgB,MAAMxJ,QAC7K,SAASypB,GAAG3b,EAAEC,EAAEsB,EAAEuI,GAAe,GAAZ9J,EAAEA,EAAEqK,QAAWpK,EAAE,CAACA,EAAE,CAAC,EAAE,IAAI,IAAIgW,EAAE,EAAEA,EAAE1U,EAAEtQ,OAAOglB,IAAIhW,EAAE,IAAIsB,EAAE0U,KAAI,EAAG,IAAI1U,EAAE,EAAEA,EAAEvB,EAAE/O,OAAOsQ,IAAI0U,EAAEhW,EAAE5F,eAAe,IAAI2F,EAAEuB,GAAG3R,OAAOoQ,EAAEuB,GAAGqa,WAAW3F,IAAIjW,EAAEuB,GAAGqa,SAAS3F,GAAGA,GAAGnM,IAAI9J,EAAEuB,GAAGsa,iBAAgB,EAAG,KAAK,CAAmB,IAAlBta,EAAE,GAAGsY,EAAGtY,GAAGtB,EAAE,KAASgW,EAAE,EAAEA,EAAEjW,EAAE/O,OAAOglB,IAAI,CAAC,GAAGjW,EAAEiW,GAAGrmB,QAAQ2R,EAAiD,OAA9CvB,EAAEiW,GAAG2F,UAAS,OAAG9R,IAAI9J,EAAEiW,GAAG4F,iBAAgB,IAAW,OAAO5b,GAAGD,EAAEiW,GAAG6F,WAAW7b,EAAED,EAAEiW,GAAG,CAAC,OAAOhW,IAAIA,EAAE2b,UAAS,EAAG,CAAC,CACxY,SAASG,GAAG/b,EAAEC,GAAG,GAAG,MAAMA,EAAE+b,wBAAwB,MAAM9nB,MAAMogB,EAAE,KAAK,OAAOrL,EAAE,CAAC,EAAEhJ,EAAE,CAACrQ,WAAM,EAAOorB,kBAAa,EAAOiB,SAAS,GAAGjc,EAAEib,cAAcplB,cAAc,CAAC,SAASqmB,GAAGlc,EAAEC,GAAG,IAAIsB,EAAEtB,EAAErQ,MAAM,GAAG,MAAM2R,EAAE,CAA+B,GAA9BA,EAAEtB,EAAEgc,SAAShc,EAAEA,EAAE+a,aAAgB,MAAMzZ,EAAE,CAAC,GAAG,MAAMtB,EAAE,MAAM/L,MAAMogB,EAAE,KAAK,GAAGoH,GAAGna,GAAG,CAAC,GAAG,EAAEA,EAAEtQ,OAAO,MAAMiD,MAAMogB,EAAE,KAAK/S,EAAEA,EAAE,EAAE,CAACtB,EAAEsB,CAAC,CAAC,MAAMtB,IAAIA,EAAE,IAAIsB,EAAEtB,CAAC,CAACD,EAAEib,cAAc,CAACplB,aAAagkB,EAAGtY,GAAG,CACnY,SAAS4a,GAAGnc,EAAEC,GAAG,IAAIsB,EAAEsY,EAAG5Z,EAAErQ,OAAOka,EAAE+P,EAAG5Z,EAAE+a,cAAc,MAAMzZ,KAAIA,EAAE,GAAGA,KAAMvB,EAAEpQ,QAAQoQ,EAAEpQ,MAAM2R,GAAG,MAAMtB,EAAE+a,cAAchb,EAAEgb,eAAezZ,IAAIvB,EAAEgb,aAAazZ,IAAI,MAAMuI,IAAI9J,EAAEgb,aAAa,GAAGlR,EAAE,CAAC,SAASsS,GAAGpc,GAAG,IAAIC,EAAED,EAAEqc,YAAYpc,IAAID,EAAEib,cAAcplB,cAAc,KAAKoK,GAAG,OAAOA,IAAID,EAAEpQ,MAAMqQ,EAAE,CAAC,SAASqc,GAAGtc,GAAG,OAAOA,GAAG,IAAK,MAAM,MAAM,6BAA6B,IAAK,OAAO,MAAM,qCAAqC,QAAQ,MAAM,+BAA+B,CAC7c,SAASG,GAAGH,EAAEC,GAAG,OAAO,MAAMD,GAAG,iCAAiCA,EAAEsc,GAAGrc,GAAG,+BAA+BD,GAAG,kBAAkBC,EAAE,+BAA+BD,CAAC,CAChK,IAAIuc,GAAevc,GAAZwc,IAAYxc,GAAsJ,SAASA,EAAEC,GAAG,GAAG,+BAA+BD,EAAEyc,cAAc,cAAczc,EAAEA,EAAE0c,UAAUzc,MAAM,CAA2F,KAA1Fsc,GAAGA,IAAIxH,SAASc,cAAc,QAAU6G,UAAU,QAAQzc,EAAEhD,UAAUxH,WAAW,SAAawK,EAAEsc,GAAGI,WAAW3c,EAAE2c,YAAY3c,EAAE4c,YAAY5c,EAAE2c,YAAY,KAAK1c,EAAE0c,YAAY3c,EAAE6c,YAAY5c,EAAE0c,WAAW,CAAC,EAAvb,qBAAqBG,OAAOA,MAAMC,wBAAwB,SAAS9c,EAAEsB,EAAEuI,EAAEmM,GAAG6G,MAAMC,yBAAwB,WAAW,OAAO/c,GAAEC,EAAEsB,EAAM,GAAE,EAAEvB,IACtK,SAASgd,GAAGhd,EAAEC,GAAG,GAAGA,EAAE,CAAC,IAAIsB,EAAEvB,EAAE2c,WAAW,GAAGpb,GAAGA,IAAIvB,EAAEid,WAAW,IAAI1b,EAAE2b,SAAwB,YAAd3b,EAAE4b,UAAUld,EAAS,CAACD,EAAEqc,YAAYpc,CAAC,CACtH,IAAImd,GAAG,CAACC,yBAAwB,EAAGC,aAAY,EAAGC,mBAAkB,EAAGC,kBAAiB,EAAGC,kBAAiB,EAAGC,SAAQ,EAAGC,cAAa,EAAGC,iBAAgB,EAAGC,aAAY,EAAGC,SAAQ,EAAGC,MAAK,EAAGC,UAAS,EAAGC,cAAa,EAAGC,YAAW,EAAGC,cAAa,EAAGC,WAAU,EAAGC,UAAS,EAAGC,SAAQ,EAAGC,YAAW,EAAGC,aAAY,EAAGC,cAAa,EAAGC,YAAW,EAAGC,eAAc,EAAGC,gBAAe,EAAGC,iBAAgB,EAAGC,YAAW,EAAGC,WAAU,EAAGC,YAAW,EAAGC,SAAQ,EAAGC,OAAM,EAAGC,SAAQ,EAAGC,SAAQ,EAAGC,QAAO,EAAGC,QAAO,EAClfC,MAAK,EAAGC,aAAY,EAAGC,cAAa,EAAGC,aAAY,EAAGC,iBAAgB,EAAGC,kBAAiB,EAAGC,kBAAiB,EAAGC,eAAc,EAAGC,aAAY,GAAIC,GAAG,CAAC,SAAS,KAAK,MAAM,KAA6H,SAASC,GAAGjgB,EAAEC,EAAEsB,GAAG,OAAO,MAAMtB,GAAG,mBAAmBA,GAAG,KAAKA,EAAE,GAAGsB,GAAG,kBAAkBtB,GAAG,IAAIA,GAAGmd,GAAG/iB,eAAe2F,IAAIod,GAAGpd,IAAI,GAAGC,GAAG0Y,OAAO1Y,EAAE,IAAI,CACzb,SAASigB,GAAGlgB,EAAEC,GAAa,IAAI,IAAIsB,KAAlBvB,EAAEA,EAAEmgB,MAAmBlgB,EAAE,GAAGA,EAAE5F,eAAekH,GAAG,CAAC,IAAIuI,EAAE,IAAIvI,EAAE2O,QAAQ,MAAM+F,EAAEgK,GAAG1e,EAAEtB,EAAEsB,GAAGuI,GAAG,UAAUvI,IAAIA,EAAE,YAAYuI,EAAE9J,EAAEogB,YAAY7e,EAAE0U,GAAGjW,EAAEuB,GAAG0U,CAAC,CAAC,CADY7b,OAAOyM,KAAKuW,IAAIzG,SAAQ,SAAS3W,GAAGggB,GAAGrJ,SAAQ,SAAS1W,GAAGA,EAAEA,EAAED,EAAEkP,OAAO,GAAGzB,cAAczN,EAAEoQ,UAAU,GAAGgN,GAAGnd,GAAGmd,GAAGpd,EAAE,GAAE,IAChI,IAAIqgB,GAAGpX,EAAE,CAACqX,UAAS,GAAI,CAACC,MAAK,EAAGxR,MAAK,EAAGyR,IAAG,EAAGC,KAAI,EAAGC,OAAM,EAAGC,IAAG,EAAGC,KAAI,EAAGC,OAAM,EAAGC,QAAO,EAAGC,MAAK,EAAGC,MAAK,EAAGC,OAAM,EAAGra,QAAO,EAAGsa,OAAM,EAAGC,KAAI,IAClT,SAASC,GAAGphB,EAAEC,GAAG,GAAGA,EAAE,CAAC,GAAGogB,GAAGrgB,KAAK,MAAMC,EAAEgc,UAAU,MAAMhc,EAAE+b,yBAAyB,MAAM9nB,MAAMogB,EAAE,IAAItU,IAAI,GAAG,MAAMC,EAAE+b,wBAAwB,CAAC,GAAG,MAAM/b,EAAEgc,SAAS,MAAM/nB,MAAMogB,EAAE,KAAK,GAAG,kBAAkBrU,EAAE+b,2BAA2B,WAAW/b,EAAE+b,yBAAyB,MAAM9nB,MAAMogB,EAAE,IAAK,CAAC,GAAG,MAAMrU,EAAEkgB,OAAO,kBAAkBlgB,EAAEkgB,MAAM,MAAMjsB,MAAMogB,EAAE,IAAK,CAAC,CAClW,SAAS+M,GAAGrhB,EAAEC,GAAG,IAAI,IAAID,EAAEkQ,QAAQ,KAAK,MAAM,kBAAkBjQ,EAAEqhB,GAAG,OAAOthB,GAAG,IAAK,iBAAiB,IAAK,gBAAgB,IAAK,YAAY,IAAK,gBAAgB,IAAK,gBAAgB,IAAK,mBAAmB,IAAK,iBAAiB,IAAK,gBAAgB,OAAM,EAAG,QAAQ,OAAM,EAAG,CAAC,IAAIuhB,GAAG,KAAK,SAASC,GAAGxhB,GAA6F,OAA1FA,EAAEA,EAAEvL,QAAQuL,EAAEyhB,YAAYpO,QAASqO,0BAA0B1hB,EAAEA,EAAE0hB,yBAAgC,IAAI1hB,EAAEkd,SAASld,EAAE2hB,WAAW3hB,CAAC,CAAC,IAAI4hB,GAAG,KAAKC,GAAG,KAAKC,GAAG,KACpc,SAASC,GAAG/hB,GAAG,GAAGA,EAAEgiB,GAAGhiB,GAAG,CAAC,GAAG,oBAAoB4hB,GAAG,MAAM1tB,MAAMogB,EAAE,MAAM,IAAIrU,EAAED,EAAEiiB,UAAUhiB,IAAIA,EAAEiiB,GAAGjiB,GAAG2hB,GAAG5hB,EAAEiiB,UAAUjiB,EAAEkV,KAAKjV,GAAG,CAAC,CAAC,SAASkiB,GAAGniB,GAAG6hB,GAAGC,GAAGA,GAAGrwB,KAAKuO,GAAG8hB,GAAG,CAAC9hB,GAAG6hB,GAAG7hB,CAAC,CAAC,SAASoiB,KAAK,GAAGP,GAAG,CAAC,IAAI7hB,EAAE6hB,GAAG5hB,EAAE6hB,GAAoB,GAAjBA,GAAGD,GAAG,KAAKE,GAAG/hB,GAAMC,EAAE,IAAID,EAAE,EAAEA,EAAEC,EAAEhP,OAAO+O,IAAI+hB,GAAG9hB,EAAED,GAAG,CAAC,CAAC,SAASqiB,GAAGriB,EAAEC,GAAG,OAAOD,EAAEC,EAAE,CAAC,SAASqiB,KAAK,CAAC,IAAIC,IAAG,EAAG,SAASC,GAAGxiB,EAAEC,EAAEsB,GAAG,GAAGghB,GAAG,OAAOviB,EAAEC,EAAEsB,GAAGghB,IAAG,EAAG,IAAI,OAAOF,GAAGriB,EAAEC,EAAEsB,EAAE,CAAC,QAAWghB,IAAG,GAAG,OAAOV,IAAI,OAAOC,MAAGQ,KAAKF,KAAI,CAAC,CAChb,SAASK,GAAGziB,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEiiB,UAAU,GAAG,OAAO1gB,EAAE,OAAO,KAAK,IAAIuI,EAAEoY,GAAG3gB,GAAG,GAAG,OAAOuI,EAAE,OAAO,KAAKvI,EAAEuI,EAAE7J,GAAGD,EAAE,OAAOC,GAAG,IAAK,UAAU,IAAK,iBAAiB,IAAK,gBAAgB,IAAK,uBAAuB,IAAK,cAAc,IAAK,qBAAqB,IAAK,cAAc,IAAK,qBAAqB,IAAK,YAAY,IAAK,mBAAmB,IAAK,gBAAgB6J,GAAGA,EAAEgS,YAAqBhS,IAAI,YAAb9J,EAAEA,EAAEkV,OAAuB,UAAUlV,GAAG,WAAWA,GAAG,aAAaA,IAAIA,GAAG8J,EAAE,MAAM9J,EAAE,QAAQA,GAAE,EAAG,GAAGA,EAAE,OAAO,KAAK,GAAGuB,GAAG,oBACleA,EAAE,MAAMrN,MAAMogB,EAAE,IAAIrU,SAASsB,IAAI,OAAOA,CAAC,CAAC,IAAImhB,IAAG,EAAG,GAAG9M,EAAG,IAAI,IAAI+M,GAAG,CAAC,EAAEvoB,OAAOmF,eAAeojB,GAAG,UAAU,CAACpzB,IAAI,WAAWmzB,IAAG,CAAE,IAAIrP,OAAOuP,iBAAiB,OAAOD,GAAGA,IAAItP,OAAOwP,oBAAoB,OAAOF,GAAGA,GAAG,CAAC,MAAM3iB,IAAG0iB,IAAG,CAAE,CAAC,SAASI,GAAG9iB,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,EAAEgD,EAAE9X,GAAG,IAAI6X,EAAEvd,MAAMnH,UAAU2c,MAAMrf,KAAKiC,UAAU,GAAG,IAAImM,EAAEqR,MAAM/P,EAAE0X,EAAE,CAAC,MAAM7Z,GAAGrL,KAAKgvB,QAAQ3jB,EAAE,CAAC,CAAC,IAAI4jB,IAAG,EAAGC,GAAG,KAAKC,IAAG,EAAGC,GAAG,KAAKC,GAAG,CAACL,QAAQ,SAAS/iB,GAAGgjB,IAAG,EAAGC,GAAGjjB,CAAC,GAAG,SAASqjB,GAAGrjB,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,EAAEgD,EAAE9X,GAAG4hB,IAAG,EAAGC,GAAG,KAAKH,GAAGxR,MAAM8R,GAAGtvB,UAAU,CACjW,SAASwvB,GAAGtjB,GAAG,IAAIC,EAAED,EAAEuB,EAAEvB,EAAE,GAAGA,EAAE4O,UAAU,KAAK3O,EAAEsjB,QAAQtjB,EAAEA,EAAEsjB,WAAW,CAACvjB,EAAEC,EAAE,GAAO,KAAa,MAAjBA,EAAED,GAAS0P,SAAcnO,EAAEtB,EAAEsjB,QAAQvjB,EAAEC,EAAEsjB,aAAavjB,EAAE,CAAC,OAAO,IAAIC,EAAEuU,IAAIjT,EAAE,IAAI,CAAC,SAASiiB,GAAGxjB,GAAG,GAAG,KAAKA,EAAEwU,IAAI,CAAC,IAAIvU,EAAED,EAAEyjB,cAAsE,GAAxD,OAAOxjB,IAAkB,QAAdD,EAAEA,EAAE4O,aAAqB3O,EAAED,EAAEyjB,gBAAmB,OAAOxjB,EAAE,OAAOA,EAAEyjB,UAAU,CAAC,OAAO,IAAI,CAAC,SAASC,GAAG3jB,GAAG,GAAGsjB,GAAGtjB,KAAKA,EAAE,MAAM9L,MAAMogB,EAAE,KAAM,CAE1S,SAASsP,GAAG5jB,GAAW,OAAO,QAAfA,EADtN,SAAYA,GAAG,IAAIC,EAAED,EAAE4O,UAAU,IAAI3O,EAAE,CAAS,GAAG,QAAXA,EAAEqjB,GAAGtjB,IAAe,MAAM9L,MAAMogB,EAAE,MAAM,OAAOrU,IAAID,EAAE,KAAKA,CAAC,CAAC,IAAI,IAAIuB,EAAEvB,EAAE8J,EAAE7J,IAAI,CAAC,IAAIgW,EAAE1U,EAAEgiB,OAAO,GAAG,OAAOtN,EAAE,MAAM,IAAIxmB,EAAEwmB,EAAErH,UAAU,GAAG,OAAOnf,EAAE,CAAY,GAAG,QAAdqa,EAAEmM,EAAEsN,QAAmB,CAAChiB,EAAEuI,EAAE,QAAQ,CAAC,KAAK,CAAC,GAAGmM,EAAE4N,QAAQp0B,EAAEo0B,MAAM,CAAC,IAAIp0B,EAAEwmB,EAAE4N,MAAMp0B,GAAG,CAAC,GAAGA,IAAI8R,EAAE,OAAOoiB,GAAG1N,GAAGjW,EAAE,GAAGvQ,IAAIqa,EAAE,OAAO6Z,GAAG1N,GAAGhW,EAAExQ,EAAEA,EAAEq0B,OAAO,CAAC,MAAM5vB,MAAMogB,EAAE,KAAM,CAAC,GAAG/S,EAAEgiB,SAASzZ,EAAEyZ,OAAOhiB,EAAE0U,EAAEnM,EAAEra,MAAM,CAAC,IAAI,IAAIymB,GAAE,EAAGgD,EAAEjD,EAAE4N,MAAM3K,GAAG,CAAC,GAAGA,IAAI3X,EAAE,CAAC2U,GAAE,EAAG3U,EAAE0U,EAAEnM,EAAEra,EAAE,KAAK,CAAC,GAAGypB,IAAIpP,EAAE,CAACoM,GAAE,EAAGpM,EAAEmM,EAAE1U,EAAE9R,EAAE,KAAK,CAACypB,EAAEA,EAAE4K,OAAO,CAAC,IAAI5N,EAAE,CAAC,IAAIgD,EAAEzpB,EAAEo0B,MAAM3K,GAAG,CAAC,GAAGA,IAC5f3X,EAAE,CAAC2U,GAAE,EAAG3U,EAAE9R,EAAEqa,EAAEmM,EAAE,KAAK,CAAC,GAAGiD,IAAIpP,EAAE,CAACoM,GAAE,EAAGpM,EAAEra,EAAE8R,EAAE0U,EAAE,KAAK,CAACiD,EAAEA,EAAE4K,OAAO,CAAC,IAAI5N,EAAE,MAAMhiB,MAAMogB,EAAE,KAAM,CAAC,CAAC,GAAG/S,EAAEqN,YAAY9E,EAAE,MAAM5V,MAAMogB,EAAE,KAAM,CAAC,GAAG,IAAI/S,EAAEiT,IAAI,MAAMtgB,MAAMogB,EAAE,MAAM,OAAO/S,EAAE0gB,UAAU8B,UAAUxiB,EAAEvB,EAAEC,CAAC,CAAkB+jB,CAAGhkB,IAAmBikB,GAAGjkB,GAAG,IAAI,CAAC,SAASikB,GAAGjkB,GAAG,GAAG,IAAIA,EAAEwU,KAAK,IAAIxU,EAAEwU,IAAI,OAAOxU,EAAE,IAAIA,EAAEA,EAAE6jB,MAAM,OAAO7jB,GAAG,CAAC,IAAIC,EAAEgkB,GAAGjkB,GAAG,GAAG,OAAOC,EAAE,OAAOA,EAAED,EAAEA,EAAE8jB,OAAO,CAAC,OAAO,IAAI,CAC1X,IAAII,GAAG9O,EAAG+O,0BAA0BC,GAAGhP,EAAGiP,wBAAwBC,GAAGlP,EAAGmP,qBAAqBC,GAAGpP,EAAGqP,sBAAsBrb,GAAEgM,EAAGsP,aAAaC,GAAGvP,EAAGwP,iCAAiCC,GAAGzP,EAAG0P,2BAA2BC,GAAG3P,EAAG4P,8BAA8BC,GAAG7P,EAAG8P,wBAAwBC,GAAG/P,EAAGgQ,qBAAqBC,GAAGjQ,EAAGkQ,sBAAsBC,GAAG,KAAKC,GAAG,KACvV,IAAIC,GAAGrlB,KAAKslB,MAAMtlB,KAAKslB,MAAiC,SAAY1lB,GAAU,OAAPA,KAAK,EAAS,IAAIA,EAAE,GAAG,IAAI2lB,GAAG3lB,GAAG4lB,GAAG,GAAG,CAAC,EAA/ED,GAAGvlB,KAAKylB,IAAID,GAAGxlB,KAAK0F,IAA4D,IAAIggB,GAAG,GAAGC,GAAG,QAC7H,SAASC,GAAGhmB,GAAG,OAAOA,GAAGA,GAAG,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,OAAO,GAAG,KAAK,GAAG,OAAO,GAAG,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAS,QAAFA,EAAU,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,OAAS,UAAFA,EAAY,KAAK,UAAU,OAAO,UAAU,KAAK,UAAU,OAAO,UAAU,KAAK,UAAU,OAAO,UAAU,KAAK,WAAW,OAAO,WACzgB,QAAQ,OAAOA,EAAE,CAAC,SAASimB,GAAGjmB,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEkmB,aAAa,GAAG,IAAI3kB,EAAE,OAAO,EAAE,IAAIuI,EAAE,EAAEmM,EAAEjW,EAAEmmB,eAAe12B,EAAEuQ,EAAEomB,YAAYlQ,EAAI,UAAF3U,EAAY,GAAG,IAAI2U,EAAE,CAAC,IAAIgD,EAAEhD,GAAGD,EAAE,IAAIiD,EAAEpP,EAAEkc,GAAG9M,GAAS,KAALzpB,GAAGymB,KAAUpM,EAAEkc,GAAGv2B,GAAI,MAAa,KAAPymB,EAAE3U,GAAG0U,GAAQnM,EAAEkc,GAAG9P,GAAG,IAAIzmB,IAAIqa,EAAEkc,GAAGv2B,IAAI,GAAG,IAAIqa,EAAE,OAAO,EAAE,GAAG,IAAI7J,GAAGA,IAAI6J,GAAG,KAAK7J,EAAEgW,MAAKA,EAAEnM,GAAGA,KAAEra,EAAEwQ,GAAGA,IAAQ,KAAKgW,GAAG,KAAO,QAAFxmB,IAAY,OAAOwQ,EAA0C,GAAxC,KAAO,EAAF6J,KAAOA,GAAK,GAAFvI,GAA4B,KAAtBtB,EAAED,EAAEqmB,gBAAwB,IAAIrmB,EAAEA,EAAEsmB,cAAcrmB,GAAG6J,EAAE,EAAE7J,GAAcgW,EAAE,IAAb1U,EAAE,GAAGkkB,GAAGxlB,IAAU6J,GAAG9J,EAAEuB,GAAGtB,IAAIgW,EAAE,OAAOnM,CAAC,CACvc,SAASyc,GAAGvmB,EAAEC,GAAG,OAAOD,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAOC,EAAE,IAAI,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAOA,EAAE,IAAuJ,QAAQ,OAAO,EAAE,CACrN,SAASumB,GAAGxmB,GAAgC,OAAO,KAApCA,GAAkB,WAAhBA,EAAEkmB,cAAsClmB,EAAI,WAAFA,EAAa,WAAW,CAAC,CAAC,SAASymB,KAAK,IAAIzmB,EAAE8lB,GAAoC,OAA1B,KAAQ,SAAfA,KAAK,MAAqBA,GAAG,IAAW9lB,CAAC,CAAC,SAAS0mB,GAAG1mB,GAAG,IAAI,IAAIC,EAAE,GAAGsB,EAAE,EAAE,GAAGA,EAAEA,IAAItB,EAAExO,KAAKuO,GAAG,OAAOC,CAAC,CAC3a,SAAS0mB,GAAG3mB,EAAEC,EAAEsB,GAAGvB,EAAEkmB,cAAcjmB,EAAE,YAAYA,IAAID,EAAEmmB,eAAe,EAAEnmB,EAAEomB,YAAY,IAAGpmB,EAAEA,EAAE4mB,YAAW3mB,EAAE,GAAGwlB,GAAGxlB,IAAQsB,CAAC,CACzH,SAASslB,GAAG7mB,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEqmB,gBAAgBpmB,EAAE,IAAID,EAAEA,EAAEsmB,cAAc/kB,GAAG,CAAC,IAAIuI,EAAE,GAAG2b,GAAGlkB,GAAG0U,EAAE,GAAGnM,EAAEmM,EAAEhW,EAAED,EAAE8J,GAAG7J,IAAID,EAAE8J,IAAI7J,GAAGsB,IAAI0U,CAAC,CAAC,CAAC,IAAI5M,GAAE,EAAE,SAASyd,GAAG9mB,GAAS,OAAO,GAAbA,IAAIA,GAAa,EAAEA,EAAE,KAAO,UAAFA,GAAa,GAAG,UAAU,EAAE,CAAC,CAAC,IAAI+mB,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,IAAG,EAAGC,GAAG,GAAGC,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,GAAG,IAAIC,IAAIC,GAAG,IAAID,IAAIE,GAAG,GAAGC,GAAG,6PAA6PnR,MAAM,KAChiB,SAASoR,GAAG9nB,EAAEC,GAAG,OAAOD,GAAG,IAAK,UAAU,IAAK,WAAWsnB,GAAG,KAAK,MAAM,IAAK,YAAY,IAAK,YAAYC,GAAG,KAAK,MAAM,IAAK,YAAY,IAAK,WAAWC,GAAG,KAAK,MAAM,IAAK,cAAc,IAAK,aAAaC,GAAGM,OAAO9nB,EAAE+nB,WAAW,MAAM,IAAK,oBAAoB,IAAK,qBAAqBL,GAAGI,OAAO9nB,EAAE+nB,WAAW,CACnT,SAASC,GAAGjoB,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,GAAG,OAAG,OAAOuQ,GAAGA,EAAEkoB,cAAcz4B,GAASuQ,EAAE,CAACmoB,UAAUloB,EAAEmoB,aAAa7mB,EAAE8mB,iBAAiBve,EAAEoe,YAAYz4B,EAAE64B,iBAAiB,CAACrS,IAAI,OAAOhW,IAAY,QAARA,EAAE+hB,GAAG/hB,KAAa+mB,GAAG/mB,IAAID,IAAEA,EAAEqoB,kBAAkBve,EAAE7J,EAAED,EAAEsoB,iBAAiB,OAAOrS,IAAI,IAAIhW,EAAEiQ,QAAQ+F,IAAIhW,EAAExO,KAAKwkB,GAAUjW,EAAC,CAEpR,SAASuoB,GAAGvoB,GAAG,IAAIC,EAAEuoB,GAAGxoB,EAAEvL,QAAQ,GAAG,OAAOwL,EAAE,CAAC,IAAIsB,EAAE+hB,GAAGrjB,GAAG,GAAG,OAAOsB,EAAE,GAAW,MAARtB,EAAEsB,EAAEiT,MAAY,GAAW,QAARvU,EAAEujB,GAAGjiB,IAA4D,OAA/CvB,EAAEmoB,UAAUloB,OAAEknB,GAAGnnB,EAAEyoB,UAAS,WAAWxB,GAAG1lB,EAAE,SAAgB,GAAG,IAAItB,GAAGsB,EAAE0gB,UAAU8B,QAAQN,cAAciF,aAAmE,YAArD1oB,EAAEmoB,UAAU,IAAI5mB,EAAEiT,IAAIjT,EAAE0gB,UAAU0G,cAAc,KAAY,CAAC3oB,EAAEmoB,UAAU,IAAI,CAClT,SAASS,GAAG5oB,GAAG,GAAG,OAAOA,EAAEmoB,UAAU,OAAM,EAAG,IAAI,IAAIloB,EAAED,EAAEsoB,iBAAiB,EAAEroB,EAAEhP,QAAQ,CAAC,IAAIsQ,EAAEsnB,GAAG7oB,EAAEooB,aAAapoB,EAAEqoB,iBAAiBpoB,EAAE,GAAGD,EAAEkoB,aAAa,GAAG,OAAO3mB,EAAiG,OAAe,QAARtB,EAAE+hB,GAAGzgB,KAAaylB,GAAG/mB,GAAGD,EAAEmoB,UAAU5mB,GAAE,EAA3H,IAAIuI,EAAE,IAAtBvI,EAAEvB,EAAEkoB,aAAwB53B,YAAYiR,EAAE2T,KAAK3T,GAAGggB,GAAGzX,EAAEvI,EAAE9M,OAAOq0B,cAAchf,GAAGyX,GAAG,KAA0DthB,EAAE8oB,OAAO,CAAC,OAAM,CAAE,CAAC,SAASC,GAAGhpB,EAAEC,EAAEsB,GAAGqnB,GAAG5oB,IAAIuB,EAAEwmB,OAAO9nB,EAAE,CAAC,SAASgpB,KAAK7B,IAAG,EAAG,OAAOE,IAAIsB,GAAGtB,MAAMA,GAAG,MAAM,OAAOC,IAAIqB,GAAGrB,MAAMA,GAAG,MAAM,OAAOC,IAAIoB,GAAGpB,MAAMA,GAAG,MAAMC,GAAG9Q,QAAQqS,IAAIrB,GAAGhR,QAAQqS,GAAG,CACnf,SAASE,GAAGlpB,EAAEC,GAAGD,EAAEmoB,YAAYloB,IAAID,EAAEmoB,UAAU,KAAKf,KAAKA,IAAG,EAAGhS,EAAG+O,0BAA0B/O,EAAG8P,wBAAwB+D,KAAK,CAC5H,SAASE,GAAGnpB,GAAG,SAASC,EAAEA,GAAG,OAAOipB,GAAGjpB,EAAED,EAAE,CAAC,GAAG,EAAEqnB,GAAGp2B,OAAO,CAACi4B,GAAG7B,GAAG,GAAGrnB,GAAG,IAAI,IAAIuB,EAAE,EAAEA,EAAE8lB,GAAGp2B,OAAOsQ,IAAI,CAAC,IAAIuI,EAAEud,GAAG9lB,GAAGuI,EAAEqe,YAAYnoB,IAAI8J,EAAEqe,UAAU,KAAK,CAAC,CAAyF,IAAxF,OAAOb,IAAI4B,GAAG5B,GAAGtnB,GAAG,OAAOunB,IAAI2B,GAAG3B,GAAGvnB,GAAG,OAAOwnB,IAAI0B,GAAG1B,GAAGxnB,GAAGynB,GAAG9Q,QAAQ1W,GAAG0nB,GAAGhR,QAAQ1W,GAAOsB,EAAE,EAAEA,EAAEqmB,GAAG32B,OAAOsQ,KAAIuI,EAAE8d,GAAGrmB,IAAK4mB,YAAYnoB,IAAI8J,EAAEqe,UAAU,MAAM,KAAK,EAAEP,GAAG32B,QAAiB,QAARsQ,EAAEqmB,GAAG,IAAYO,WAAYI,GAAGhnB,GAAG,OAAOA,EAAE4mB,WAAWP,GAAGmB,OAAO,CAAC,IAAIK,GAAG9R,EAAG+R,wBAAwBC,IAAG,EAC5a,SAASC,GAAGvpB,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAE5M,GAAE5Z,EAAE25B,GAAGI,WAAWJ,GAAGI,WAAW,KAAK,IAAIngB,GAAE,EAAEogB,GAAGzpB,EAAEC,EAAEsB,EAAEuI,EAAE,CAAC,QAAQT,GAAE4M,EAAEmT,GAAGI,WAAW/5B,CAAC,CAAC,CAAC,SAASi6B,GAAG1pB,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAE5M,GAAE5Z,EAAE25B,GAAGI,WAAWJ,GAAGI,WAAW,KAAK,IAAIngB,GAAE,EAAEogB,GAAGzpB,EAAEC,EAAEsB,EAAEuI,EAAE,CAAC,QAAQT,GAAE4M,EAAEmT,GAAGI,WAAW/5B,CAAC,CAAC,CACjO,SAASg6B,GAAGzpB,EAAEC,EAAEsB,EAAEuI,GAAG,GAAGwf,GAAG,CAAC,IAAIrT,EAAE4S,GAAG7oB,EAAEC,EAAEsB,EAAEuI,GAAG,GAAG,OAAOmM,EAAE0T,GAAG3pB,EAAEC,EAAE6J,EAAE8f,GAAGroB,GAAGumB,GAAG9nB,EAAE8J,QAAQ,GANtF,SAAY9J,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,OAAOhW,GAAG,IAAK,UAAU,OAAOqnB,GAAGW,GAAGX,GAAGtnB,EAAEC,EAAEsB,EAAEuI,EAAEmM,IAAG,EAAG,IAAK,YAAY,OAAOsR,GAAGU,GAAGV,GAAGvnB,EAAEC,EAAEsB,EAAEuI,EAAEmM,IAAG,EAAG,IAAK,YAAY,OAAOuR,GAAGS,GAAGT,GAAGxnB,EAAEC,EAAEsB,EAAEuI,EAAEmM,IAAG,EAAG,IAAK,cAAc,IAAIxmB,EAAEwmB,EAAE+R,UAAkD,OAAxCP,GAAG53B,IAAIJ,EAAEw4B,GAAGR,GAAGl4B,IAAIE,IAAI,KAAKuQ,EAAEC,EAAEsB,EAAEuI,EAAEmM,KAAU,EAAG,IAAK,oBAAoB,OAAOxmB,EAAEwmB,EAAE+R,UAAUL,GAAG93B,IAAIJ,EAAEw4B,GAAGN,GAAGp4B,IAAIE,IAAI,KAAKuQ,EAAEC,EAAEsB,EAAEuI,EAAEmM,KAAI,EAAG,OAAM,CAAE,CAM1Q4T,CAAG5T,EAAEjW,EAAEC,EAAEsB,EAAEuI,GAAGA,EAAEggB,uBAAuB,GAAGhC,GAAG9nB,EAAE8J,GAAK,EAAF7J,IAAM,EAAE4nB,GAAG3X,QAAQlQ,GAAG,CAAC,KAAK,OAAOiW,GAAG,CAAC,IAAIxmB,EAAEuyB,GAAG/L,GAA0D,GAAvD,OAAOxmB,GAAGs3B,GAAGt3B,GAAiB,QAAdA,EAAEo5B,GAAG7oB,EAAEC,EAAEsB,EAAEuI,KAAa6f,GAAG3pB,EAAEC,EAAE6J,EAAE8f,GAAGroB,GAAM9R,IAAIwmB,EAAE,MAAMA,EAAExmB,CAAC,CAAC,OAAOwmB,GAAGnM,EAAEggB,iBAAiB,MAAMH,GAAG3pB,EAAEC,EAAE6J,EAAE,KAAKvI,EAAE,CAAC,CAAC,IAAIqoB,GAAG,KACpU,SAASf,GAAG7oB,EAAEC,EAAEsB,EAAEuI,GAA2B,GAAxB8f,GAAG,KAAwB,QAAX5pB,EAAEwoB,GAAVxoB,EAAEwhB,GAAG1X,KAAuB,GAAW,QAAR7J,EAAEqjB,GAAGtjB,IAAYA,EAAE,UAAU,GAAW,MAARuB,EAAEtB,EAAEuU,KAAW,CAAS,GAAG,QAAXxU,EAAEwjB,GAAGvjB,IAAe,OAAOD,EAAEA,EAAE,IAAI,MAAM,GAAG,IAAIuB,EAAE,CAAC,GAAGtB,EAAEgiB,UAAU8B,QAAQN,cAAciF,aAAa,OAAO,IAAIzoB,EAAEuU,IAAIvU,EAAEgiB,UAAU0G,cAAc,KAAK3oB,EAAE,IAAI,MAAMC,IAAID,IAAIA,EAAE,MAAW,OAAL4pB,GAAG5pB,EAAS,IAAI,CAC7S,SAAS+pB,GAAG/pB,GAAG,OAAOA,GAAG,IAAK,SAAS,IAAK,QAAQ,IAAK,QAAQ,IAAK,cAAc,IAAK,OAAO,IAAK,MAAM,IAAK,WAAW,IAAK,WAAW,IAAK,UAAU,IAAK,YAAY,IAAK,OAAO,IAAK,UAAU,IAAK,WAAW,IAAK,QAAQ,IAAK,UAAU,IAAK,UAAU,IAAK,WAAW,IAAK,QAAQ,IAAK,YAAY,IAAK,UAAU,IAAK,QAAQ,IAAK,QAAQ,IAAK,OAAO,IAAK,gBAAgB,IAAK,cAAc,IAAK,YAAY,IAAK,aAAa,IAAK,QAAQ,IAAK,SAAS,IAAK,SAAS,IAAK,SAAS,IAAK,cAAc,IAAK,WAAW,IAAK,aAAa,IAAK,eAAe,IAAK,SAAS,IAAK,kBAAkB,IAAK,YAAY,IAAK,mBAAmB,IAAK,iBAAiB,IAAK,oBAAoB,IAAK,aAAa,IAAK,YAAY,IAAK,cAAc,IAAK,OAAO,IAAK,mBAAmB,IAAK,QAAQ,IAAK,aAAa,IAAK,WAAW,IAAK,SAAS,IAAK,cAAc,OAAO,EAAE,IAAK,OAAO,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,cAAc,IAAK,aAAa,IAAK,cAAc,IAAK,SAAS,IAAK,SAAS,IAAK,YAAY,IAAK,QAAQ,IAAK,aAAa,IAAK,aAAa,IAAK,eAAe,IAAK,eAAe,OAAO,EACpqC,IAAK,UAAU,OAAO2kB,MAAM,KAAKE,GAAG,OAAO,EAAE,KAAKE,GAAG,OAAO,EAAE,KAAKE,GAAG,KAAKE,GAAG,OAAO,GAAG,KAAKE,GAAG,OAAO,UAAU,QAAQ,OAAO,GAAG,QAAQ,OAAO,GAAG,CAAC,IAAI2E,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAK,SAASC,KAAK,GAAGD,GAAG,OAAOA,GAAG,IAAIlqB,EAAkB8J,EAAhB7J,EAAEgqB,GAAG1oB,EAAEtB,EAAEhP,OAASglB,EAAE,UAAU+T,GAAGA,GAAGp6B,MAAMo6B,GAAG3N,YAAY5sB,EAAEwmB,EAAEhlB,OAAO,IAAI+O,EAAE,EAAEA,EAAEuB,GAAGtB,EAAED,KAAKiW,EAAEjW,GAAGA,KAAK,IAAIkW,EAAE3U,EAAEvB,EAAE,IAAI8J,EAAE,EAAEA,GAAGoM,GAAGjW,EAAEsB,EAAEuI,KAAKmM,EAAExmB,EAAEqa,GAAGA,KAAK,OAAOogB,GAAGjU,EAAE/E,MAAMlR,EAAE,EAAE8J,EAAE,EAAEA,OAAE,EAAO,CACxY,SAASsgB,GAAGpqB,GAAG,IAAIC,EAAED,EAAEqqB,QAA+E,MAAvE,aAAarqB,EAAgB,KAAbA,EAAEA,EAAEsqB,WAAgB,KAAKrqB,IAAID,EAAE,IAAKA,EAAEC,EAAE,KAAKD,IAAIA,EAAE,IAAW,IAAIA,GAAG,KAAKA,EAAEA,EAAE,CAAC,CAAC,SAASuqB,KAAK,OAAM,CAAE,CAAC,SAASC,KAAK,OAAM,CAAE,CAC5K,SAASC,GAAGzqB,GAAG,SAASC,EAAEA,EAAE6J,EAAEmM,EAAExmB,EAAEymB,GAA6G,IAAI,IAAI3U,KAAlHxN,KAAK22B,WAAWzqB,EAAElM,KAAK42B,YAAY1U,EAAEliB,KAAKmhB,KAAKpL,EAAE/V,KAAKm0B,YAAYz4B,EAAEsE,KAAKU,OAAOyhB,EAAEniB,KAAK62B,cAAc,KAAkB5qB,EAAEA,EAAE3F,eAAekH,KAAKtB,EAAED,EAAEuB,GAAGxN,KAAKwN,GAAGtB,EAAEA,EAAExQ,GAAGA,EAAE8R,IAAgI,OAA5HxN,KAAK82B,oBAAoB,MAAMp7B,EAAEq7B,iBAAiBr7B,EAAEq7B,kBAAiB,IAAKr7B,EAAEs7B,aAAaR,GAAGC,GAAGz2B,KAAKi3B,qBAAqBR,GAAUz2B,IAAI,CAC9E,OAD+EkV,EAAEhJ,EAAE1L,UAAU,CAAC02B,eAAe,WAAWl3B,KAAK+2B,kBAAiB,EAAG,IAAI9qB,EAAEjM,KAAKm0B,YAAYloB,IAAIA,EAAEirB,eAAejrB,EAAEirB,iBAAiB,mBAAmBjrB,EAAE+qB,cAC7e/qB,EAAE+qB,aAAY,GAAIh3B,KAAK82B,mBAAmBN,GAAG,EAAET,gBAAgB,WAAW,IAAI9pB,EAAEjM,KAAKm0B,YAAYloB,IAAIA,EAAE8pB,gBAAgB9pB,EAAE8pB,kBAAkB,mBAAmB9pB,EAAEkrB,eAAelrB,EAAEkrB,cAAa,GAAIn3B,KAAKi3B,qBAAqBT,GAAG,EAAEY,QAAQ,WAAW,EAAEC,aAAab,KAAYtqB,CAAC,CACjR,IAAoLorB,GAAGC,GAAGC,GAAtLC,GAAG,CAACC,WAAW,EAAEC,QAAQ,EAAEC,WAAW,EAAEC,UAAU,SAAS5rB,GAAG,OAAOA,EAAE4rB,WAAWC,KAAKC,KAAK,EAAEhB,iBAAiB,EAAEiB,UAAU,GAAGC,GAAGvB,GAAGe,IAAIS,GAAGhjB,EAAE,CAAC,EAAEuiB,GAAG,CAACU,KAAK,EAAEC,OAAO,IAAIC,GAAG3B,GAAGwB,IAAaI,GAAGpjB,EAAE,CAAC,EAAEgjB,GAAG,CAACK,QAAQ,EAAEC,QAAQ,EAAEC,QAAQ,EAAEC,QAAQ,EAAEC,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAEC,SAAS,EAAEC,OAAO,EAAEC,QAAQ,EAAEC,iBAAiBC,GAAGC,OAAO,EAAEC,QAAQ,EAAEC,cAAc,SAASptB,GAAG,YAAO,IAASA,EAAEotB,cAAcptB,EAAEqtB,cAAcrtB,EAAEyhB,WAAWzhB,EAAEstB,UAAUttB,EAAEqtB,YAAYrtB,EAAEotB,aAAa,EAAEG,UAAU,SAASvtB,GAAG,MAAG,cAC3eA,EAASA,EAAEutB,WAAUvtB,IAAIurB,KAAKA,IAAI,cAAcvrB,EAAEkV,MAAMmW,GAAGrrB,EAAEssB,QAAQf,GAAGe,QAAQhB,GAAGtrB,EAAEusB,QAAQhB,GAAGgB,SAASjB,GAAGD,GAAG,EAAEE,GAAGvrB,GAAUqrB,GAAE,EAAEmC,UAAU,SAASxtB,GAAG,MAAM,cAAcA,EAAEA,EAAEwtB,UAAUlC,EAAE,IAAImC,GAAGhD,GAAG4B,IAAiCqB,GAAGjD,GAA7BxhB,EAAE,CAAC,EAAEojB,GAAG,CAACsB,aAAa,KAA4CC,GAAGnD,GAA9BxhB,EAAE,CAAC,EAAEgjB,GAAG,CAACmB,cAAc,KAA0ES,GAAGpD,GAA5DxhB,EAAE,CAAC,EAAEuiB,GAAG,CAACsC,cAAc,EAAEC,YAAY,EAAEC,cAAc,KAAcC,GAAGhlB,EAAE,CAAC,EAAEuiB,GAAG,CAAC0C,cAAc,SAASluB,GAAG,MAAM,kBAAkBA,EAAEA,EAAEkuB,cAAc7a,OAAO6a,aAAa,IAAIC,GAAG1D,GAAGwD,IAAyBG,GAAG3D,GAArBxhB,EAAE,CAAC,EAAEuiB,GAAG,CAACrzB,KAAK,KAAck2B,GAAG,CAACC,IAAI,SACxfC,SAAS,IAAIC,KAAK,YAAYC,GAAG,UAAUC,MAAM,aAAaC,KAAK,YAAYC,IAAI,SAAS5b,IAAI,KAAK6b,KAAK,cAAcC,KAAK,cAAcC,OAAO,aAAaC,gBAAgB,gBAAgBC,GAAG,CAAC,EAAE,YAAY,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,GAAG,WAAW,GAAG,MAAM,GAAG,OAAO,GAAG,YAAY,GAAG,UAAU,GAAG,aAAa,GAAG,YAAY,GAAG,SAAS,GAAG,SAAS,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KACtf,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,UAAU,IAAI,aAAa,IAAI,QAAQC,GAAG,CAACC,IAAI,SAASC,QAAQ,UAAUC,KAAK,UAAUC,MAAM,YAAY,SAASC,GAAGvvB,GAAG,IAAIC,EAAElM,KAAKm0B,YAAY,OAAOjoB,EAAE+sB,iBAAiB/sB,EAAE+sB,iBAAiBhtB,MAAIA,EAAEkvB,GAAGlvB,OAAMC,EAAED,EAAK,CAAC,SAASitB,KAAK,OAAOsC,EAAE,CAChS,IAAIC,GAAGvmB,EAAE,CAAC,EAAEgjB,GAAG,CAACpuB,IAAI,SAASmC,GAAG,GAAGA,EAAEnC,IAAI,CAAC,IAAIoC,EAAEouB,GAAGruB,EAAEnC,MAAMmC,EAAEnC,IAAI,GAAG,iBAAiBoC,EAAE,OAAOA,CAAC,CAAC,MAAM,aAAaD,EAAEkV,KAAc,MAARlV,EAAEoqB,GAAGpqB,IAAU,QAAQjC,OAAOuR,aAAatP,GAAI,YAAYA,EAAEkV,MAAM,UAAUlV,EAAEkV,KAAK+Z,GAAGjvB,EAAEqqB,UAAU,eAAe,EAAE,EAAEoF,KAAK,EAAEC,SAAS,EAAE9C,QAAQ,EAAEC,SAAS,EAAEC,OAAO,EAAEC,QAAQ,EAAE4C,OAAO,EAAEC,OAAO,EAAE5C,iBAAiBC,GAAG3C,SAAS,SAAStqB,GAAG,MAAM,aAAaA,EAAEkV,KAAKkV,GAAGpqB,GAAG,CAAC,EAAEqqB,QAAQ,SAASrqB,GAAG,MAAM,YAAYA,EAAEkV,MAAM,UAAUlV,EAAEkV,KAAKlV,EAAEqqB,QAAQ,CAAC,EAAEwF,MAAM,SAAS7vB,GAAG,MAAM,aAC7eA,EAAEkV,KAAKkV,GAAGpqB,GAAG,YAAYA,EAAEkV,MAAM,UAAUlV,EAAEkV,KAAKlV,EAAEqqB,QAAQ,CAAC,IAAIyF,GAAGrF,GAAG+E,IAAiIO,GAAGtF,GAA7HxhB,EAAE,CAAC,EAAEojB,GAAG,CAACrE,UAAU,EAAEvY,MAAM,EAAEugB,OAAO,EAAEC,SAAS,EAAEC,mBAAmB,EAAEC,MAAM,EAAEC,MAAM,EAAEnjB,MAAM,EAAEojB,YAAY,EAAEC,UAAU,KAAmIC,GAAG9F,GAArHxhB,EAAE,CAAC,EAAEgjB,GAAG,CAACuE,QAAQ,EAAEC,cAAc,EAAEC,eAAe,EAAE5D,OAAO,EAAEC,QAAQ,EAAEH,QAAQ,EAAEC,SAAS,EAAEG,iBAAiBC,MAA0E0D,GAAGlG,GAA3DxhB,EAAE,CAAC,EAAEuiB,GAAG,CAACjV,aAAa,EAAEwX,YAAY,EAAEC,cAAc,KAAc4C,GAAG3nB,EAAE,CAAC,EAAEojB,GAAG,CAACwE,OAAO,SAAS7wB,GAAG,MAAM,WAAWA,EAAEA,EAAE6wB,OAAO,gBAAgB7wB,GAAGA,EAAE8wB,YAAY,CAAC,EACnfC,OAAO,SAAS/wB,GAAG,MAAM,WAAWA,EAAEA,EAAE+wB,OAAO,gBAAgB/wB,GAAGA,EAAEgxB,YAAY,eAAehxB,GAAGA,EAAEixB,WAAW,CAAC,EAAEC,OAAO,EAAEC,UAAU,IAAIC,GAAG3G,GAAGmG,IAAIS,GAAG,CAAC,EAAE,GAAG,GAAG,IAAIC,GAAG1b,GAAI,qBAAqBvC,OAAOke,GAAG,KAAK3b,GAAI,iBAAiBb,WAAWwc,GAAGxc,SAASyc,cAAc,IAAIC,GAAG7b,GAAI,cAAcvC,SAASke,GAAGG,GAAG9b,KAAM0b,IAAIC,IAAI,EAAEA,IAAI,IAAIA,IAAII,GAAG5zB,OAAOuR,aAAa,IAAIsiB,IAAG,EAC1W,SAASC,GAAG7xB,EAAEC,GAAG,OAAOD,GAAG,IAAK,QAAQ,OAAO,IAAIqxB,GAAGnhB,QAAQjQ,EAAEoqB,SAAS,IAAK,UAAU,OAAO,MAAMpqB,EAAEoqB,QAAQ,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,OAAM,EAAG,QAAQ,OAAM,EAAG,CAAC,SAASyH,GAAG9xB,GAAc,MAAM,kBAAjBA,EAAEA,EAAEmsB,SAAkC,SAASnsB,EAAEA,EAAE7H,KAAK,IAAI,CAAC,IAAI45B,IAAG,EAE9Q,IAAIC,GAAG,CAACC,OAAM,EAAGC,MAAK,EAAGC,UAAS,EAAG,kBAAiB,EAAGC,OAAM,EAAGC,OAAM,EAAGC,QAAO,EAAGC,UAAS,EAAGC,OAAM,EAAGC,QAAO,EAAGC,KAAI,EAAGC,MAAK,EAAGC,MAAK,EAAGC,KAAI,EAAGC,MAAK,GAAI,SAASC,GAAG/yB,GAAG,IAAIC,EAAED,GAAGA,EAAE+Z,UAAU/Z,EAAE+Z,SAASxM,cAAc,MAAM,UAAUtN,IAAI+xB,GAAGhyB,EAAEkV,MAAM,aAAajV,CAAO,CAAC,SAAS+yB,GAAGhzB,EAAEC,EAAEsB,EAAEuI,GAAGqY,GAAGrY,GAAsB,GAAnB7J,EAAEgzB,GAAGhzB,EAAE,aAAgBhP,SAASsQ,EAAE,IAAIyqB,GAAG,WAAW,SAAS,KAAKzqB,EAAEuI,GAAG9J,EAAEvO,KAAK,CAACyhC,MAAM3xB,EAAE4xB,UAAUlzB,IAAI,CAAC,IAAImzB,GAAG,KAAKC,GAAG,KAAK,SAASn+B,GAAG8K,GAAGszB,GAAGtzB,EAAE,EAAE,CAAC,SAASuzB,GAAGvzB,GAAe,GAAGya,EAAT+Y,GAAGxzB,IAAY,OAAOA,CAAC,CACpe,SAASyzB,GAAGzzB,EAAEC,GAAG,GAAG,WAAWD,EAAE,OAAOC,CAAC,CAAC,IAAIyzB,IAAG,EAAG,GAAG9d,EAAG,CAAC,IAAI+d,GAAG,GAAG/d,EAAG,CAAC,IAAIge,GAAG,YAAY7e,SAAS,IAAI6e,GAAG,CAAC,IAAIC,GAAG9e,SAASc,cAAc,OAAOge,GAAG1c,aAAa,UAAU,WAAWyc,GAAG,oBAAoBC,GAAGC,OAAO,CAACH,GAAGC,EAAE,MAAMD,IAAG,EAAGD,GAAGC,MAAM5e,SAASyc,cAAc,EAAEzc,SAASyc,aAAa,CAAC,SAASuC,KAAKX,KAAKA,GAAGY,YAAY,mBAAmBC,IAAIZ,GAAGD,GAAG,KAAK,CAAC,SAASa,GAAGj0B,GAAG,GAAG,UAAUA,EAAEuW,cAAcgd,GAAGF,IAAI,CAAC,IAAIpzB,EAAE,GAAG+yB,GAAG/yB,EAAEozB,GAAGrzB,EAAEwhB,GAAGxhB,IAAIwiB,GAAGttB,GAAG+K,EAAE,CAAC,CAC/b,SAASi0B,GAAGl0B,EAAEC,EAAEsB,GAAG,YAAYvB,GAAG+zB,KAAUV,GAAG9xB,GAAR6xB,GAAGnzB,GAAUk0B,YAAY,mBAAmBF,KAAK,aAAaj0B,GAAG+zB,IAAI,CAAC,SAASK,GAAGp0B,GAAG,GAAG,oBAAoBA,GAAG,UAAUA,GAAG,YAAYA,EAAE,OAAOuzB,GAAGF,GAAG,CAAC,SAASgB,GAAGr0B,EAAEC,GAAG,GAAG,UAAUD,EAAE,OAAOuzB,GAAGtzB,EAAE,CAAC,SAASq0B,GAAGt0B,EAAEC,GAAG,GAAG,UAAUD,GAAG,WAAWA,EAAE,OAAOuzB,GAAGtzB,EAAE,CAAiE,IAAIs0B,GAAG,oBAAoBn6B,OAAOknB,GAAGlnB,OAAOknB,GAA5G,SAAYthB,EAAEC,GAAG,OAAOD,IAAIC,IAAI,IAAID,GAAG,EAAEA,IAAI,EAAEC,IAAID,IAAIA,GAAGC,IAAIA,CAAC,EACtW,SAASu0B,GAAGx0B,EAAEC,GAAG,GAAGs0B,GAAGv0B,EAAEC,GAAG,OAAM,EAAG,GAAG,kBAAkBD,GAAG,OAAOA,GAAG,kBAAkBC,GAAG,OAAOA,EAAE,OAAM,EAAG,IAAIsB,EAAEnH,OAAOyM,KAAK7G,GAAG8J,EAAE1P,OAAOyM,KAAK5G,GAAG,GAAGsB,EAAEtQ,SAAS6Y,EAAE7Y,OAAO,OAAM,EAAG,IAAI6Y,EAAE,EAAEA,EAAEvI,EAAEtQ,OAAO6Y,IAAI,CAAC,IAAImM,EAAE1U,EAAEuI,GAAG,IAAIgM,EAAGjkB,KAAKoO,EAAEgW,KAAKse,GAAGv0B,EAAEiW,GAAGhW,EAAEgW,IAAI,OAAM,CAAE,CAAC,OAAM,CAAE,CAAC,SAASwe,GAAGz0B,GAAG,KAAKA,GAAGA,EAAE2c,YAAY3c,EAAEA,EAAE2c,WAAW,OAAO3c,CAAC,CACtU,SAAS00B,GAAG10B,EAAEC,GAAG,IAAwB6J,EAApBvI,EAAEkzB,GAAGz0B,GAAO,IAAJA,EAAE,EAAYuB,GAAG,CAAC,GAAG,IAAIA,EAAE2b,SAAS,CAA0B,GAAzBpT,EAAE9J,EAAEuB,EAAE8a,YAAYprB,OAAU+O,GAAGC,GAAG6J,GAAG7J,EAAE,MAAM,CAAC00B,KAAKpzB,EAAEpL,OAAO8J,EAAED,GAAGA,EAAE8J,CAAC,CAAC9J,EAAE,CAAC,KAAKuB,GAAG,CAAC,GAAGA,EAAEqzB,YAAY,CAACrzB,EAAEA,EAAEqzB,YAAY,MAAM50B,CAAC,CAACuB,EAAEA,EAAEogB,UAAU,CAACpgB,OAAE,CAAM,CAACA,EAAEkzB,GAAGlzB,EAAE,CAAC,CAAC,SAASszB,GAAG70B,EAAEC,GAAG,SAAOD,IAAGC,KAAED,IAAIC,KAAKD,GAAG,IAAIA,EAAEkd,YAAYjd,GAAG,IAAIA,EAAEid,SAAS2X,GAAG70B,EAAEC,EAAE0hB,YAAY,aAAa3hB,EAAEA,EAAE80B,SAAS70B,KAAGD,EAAE+0B,4BAAwD,GAA7B/0B,EAAE+0B,wBAAwB90B,KAAY,CAC9Z,SAAS+0B,KAAK,IAAI,IAAIh1B,EAAEqT,OAAOpT,EAAE0a,IAAK1a,aAAaD,EAAEi1B,mBAAmB,CAAC,IAAI,IAAI1zB,EAAE,kBAAkBtB,EAAEi1B,cAAcxF,SAASyF,IAAI,CAAC,MAAMrrB,GAAGvI,GAAE,CAAE,CAAC,IAAGA,EAAyB,MAAMtB,EAAE0a,GAA/B3a,EAAEC,EAAEi1B,eAAgCngB,SAAS,CAAC,OAAO9U,CAAC,CAAC,SAASm1B,GAAGp1B,GAAG,IAAIC,EAAED,GAAGA,EAAE+Z,UAAU/Z,EAAE+Z,SAASxM,cAAc,OAAOtN,IAAI,UAAUA,IAAI,SAASD,EAAEkV,MAAM,WAAWlV,EAAEkV,MAAM,QAAQlV,EAAEkV,MAAM,QAAQlV,EAAEkV,MAAM,aAAalV,EAAEkV,OAAO,aAAajV,GAAG,SAASD,EAAEq1B,gBAAgB,CACxa,SAASC,GAAGt1B,GAAG,IAAIC,EAAE+0B,KAAKzzB,EAAEvB,EAAEu1B,YAAYzrB,EAAE9J,EAAEw1B,eAAe,GAAGv1B,IAAIsB,GAAGA,GAAGA,EAAEka,eAAeoZ,GAAGtzB,EAAEka,cAAcga,gBAAgBl0B,GAAG,CAAC,GAAG,OAAOuI,GAAGsrB,GAAG7zB,GAAG,GAAGtB,EAAE6J,EAAEpV,WAAc,KAARsL,EAAE8J,EAAE7U,OAAiB+K,EAAEC,GAAG,mBAAmBsB,EAAEA,EAAEm0B,eAAez1B,EAAEsB,EAAEo0B,aAAav1B,KAAKw1B,IAAI51B,EAAEuB,EAAE3R,MAAMqB,aAAa,IAAG+O,GAAGC,EAAEsB,EAAEka,eAAe1G,WAAW9U,EAAE41B,aAAaxiB,QAASyiB,aAAa,CAAC91B,EAAEA,EAAE81B,eAAe,IAAI7f,EAAE1U,EAAE8a,YAAYprB,OAAOxB,EAAE2Q,KAAKw1B,IAAI9rB,EAAEpV,MAAMuhB,GAAGnM,OAAE,IAASA,EAAE7U,IAAIxF,EAAE2Q,KAAKw1B,IAAI9rB,EAAE7U,IAAIghB,IAAIjW,EAAE+1B,QAAQtmC,EAAEqa,IAAImM,EAAEnM,EAAEA,EAAEra,EAAEA,EAAEwmB,GAAGA,EAAEye,GAAGnzB,EAAE9R,GAAG,IAAIymB,EAAEwe,GAAGnzB,EACvfuI,GAAGmM,GAAGC,IAAI,IAAIlW,EAAEg2B,YAAYh2B,EAAEi2B,aAAahgB,EAAE0e,MAAM30B,EAAEk2B,eAAejgB,EAAE9f,QAAQ6J,EAAEm2B,YAAYjgB,EAAEye,MAAM30B,EAAEo2B,cAAclgB,EAAE/f,WAAU8J,EAAEA,EAAEo2B,eAAgBC,SAASrgB,EAAE0e,KAAK1e,EAAE9f,QAAQ6J,EAAEu2B,kBAAkB9mC,EAAEqa,GAAG9J,EAAEw2B,SAASv2B,GAAGD,EAAE+1B,OAAO7f,EAAEye,KAAKze,EAAE/f,UAAU8J,EAAEw2B,OAAOvgB,EAAEye,KAAKze,EAAE/f,QAAQ6J,EAAEw2B,SAASv2B,IAAI,CAAM,IAALA,EAAE,GAAOD,EAAEuB,EAAEvB,EAAEA,EAAE2hB,YAAY,IAAI3hB,EAAEkd,UAAUjd,EAAExO,KAAK,CAACilC,QAAQ12B,EAAE22B,KAAK32B,EAAE42B,WAAWC,IAAI72B,EAAE82B,YAAmD,IAAvC,oBAAoBv1B,EAAEw1B,OAAOx1B,EAAEw1B,QAAYx1B,EAAE,EAAEA,EAAEtB,EAAEhP,OAAOsQ,KAAIvB,EAAEC,EAAEsB,IAAKm1B,QAAQE,WAAW52B,EAAE22B,KAAK32B,EAAE02B,QAAQI,UAAU92B,EAAE62B,GAAG,CAAC,CACzf,IAAIG,GAAGphB,GAAI,iBAAiBb,UAAU,IAAIA,SAASyc,aAAayF,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,IAAG,EAC3F,SAASC,GAAGr3B,EAAEC,EAAEsB,GAAG,IAAIuI,EAAEvI,EAAE8R,SAAS9R,EAAEA,EAAEwT,SAAS,IAAIxT,EAAE2b,SAAS3b,EAAEA,EAAEka,cAAc2b,IAAI,MAAMH,IAAIA,KAAKtc,EAAG7Q,KAAU,mBAALA,EAAEmtB,KAAyB7B,GAAGtrB,GAAGA,EAAE,CAACpV,MAAMoV,EAAE4rB,eAAezgC,IAAI6U,EAAE6rB,cAAuF7rB,EAAE,CAACmsB,YAA3EnsB,GAAGA,EAAE2R,eAAe3R,EAAE2R,cAAcoa,aAAaxiB,QAAQyiB,gBAA+BG,WAAWC,aAAapsB,EAAEosB,aAAaC,UAAUrsB,EAAEqsB,UAAUC,YAAYtsB,EAAEssB,aAAce,IAAI3C,GAAG2C,GAAGrtB,KAAKqtB,GAAGrtB,EAAsB,GAApBA,EAAEmpB,GAAGiE,GAAG,aAAgBjmC,SAASgP,EAAE,IAAI+rB,GAAG,WAAW,SAAS,KAAK/rB,EAAEsB,GAAGvB,EAAEvO,KAAK,CAACyhC,MAAMjzB,EAAEkzB,UAAUrpB,IAAI7J,EAAExL,OAAOwiC,KAAK,CACtf,SAASK,GAAGt3B,EAAEC,GAAG,IAAIsB,EAAE,CAAC,EAAiF,OAA/EA,EAAEvB,EAAEuN,eAAetN,EAAEsN,cAAchM,EAAE,SAASvB,GAAG,SAASC,EAAEsB,EAAE,MAAMvB,GAAG,MAAMC,EAASsB,CAAC,CAAC,IAAIg2B,GAAG,CAACC,aAAaF,GAAG,YAAY,gBAAgBG,mBAAmBH,GAAG,YAAY,sBAAsBI,eAAeJ,GAAG,YAAY,kBAAkBK,cAAcL,GAAG,aAAa,kBAAkBM,GAAG,CAAC,EAAEC,GAAG,CAAC,EACpF,SAASC,GAAG93B,GAAG,GAAG43B,GAAG53B,GAAG,OAAO43B,GAAG53B,GAAG,IAAIu3B,GAAGv3B,GAAG,OAAOA,EAAE,IAAYuB,EAARtB,EAAEs3B,GAAGv3B,GAAK,IAAIuB,KAAKtB,EAAE,GAAGA,EAAE5F,eAAekH,IAAIA,KAAKs2B,GAAG,OAAOD,GAAG53B,GAAGC,EAAEsB,GAAG,OAAOvB,CAAC,CAA/X4V,IAAKiiB,GAAG9iB,SAASc,cAAc,OAAOsK,MAAM,mBAAmB9M,gBAAgBkkB,GAAGC,aAAaO,iBAAiBR,GAAGE,mBAAmBM,iBAAiBR,GAAGG,eAAeK,WAAW,oBAAoB1kB,eAAekkB,GAAGI,cAAcnO,YAAwJ,IAAIwO,GAAGF,GAAG,gBAAgBG,GAAGH,GAAG,sBAAsBI,GAAGJ,GAAG,kBAAkBK,GAAGL,GAAG,iBAAiBM,GAAG,IAAI1Q,IAAI2Q,GAAG,smBAAsmB3hB,MAAM,KAC/lC,SAAS4hB,GAAGt4B,EAAEC,GAAGm4B,GAAGvoC,IAAImQ,EAAEC,GAAGwV,EAAGxV,EAAE,CAACD,GAAG,CAAC,IAAI,IAAIu4B,GAAG,EAAEA,GAAGF,GAAGpnC,OAAOsnC,KAAK,CAAC,IAAIC,GAAGH,GAAGE,IAA2DD,GAApDE,GAAGjrB,cAAuD,MAAtCirB,GAAG,GAAG/qB,cAAc+qB,GAAGtnB,MAAM,IAAiB,CAAConB,GAAGN,GAAG,kBAAkBM,GAAGL,GAAG,wBAAwBK,GAAGJ,GAAG,oBAAoBI,GAAG,WAAW,iBAAiBA,GAAG,UAAU,WAAWA,GAAG,WAAW,UAAUA,GAAGH,GAAG,mBAAmBziB,EAAG,eAAe,CAAC,WAAW,cAAcA,EAAG,eAAe,CAAC,WAAW,cAAcA,EAAG,iBAAiB,CAAC,aAAa,gBAC7cA,EAAG,iBAAiB,CAAC,aAAa,gBAAgBD,EAAG,WAAW,oEAAoEiB,MAAM,MAAMjB,EAAG,WAAW,uFAAuFiB,MAAM,MAAMjB,EAAG,gBAAgB,CAAC,iBAAiB,WAAW,YAAY,UAAUA,EAAG,mBAAmB,2DAA2DiB,MAAM,MAAMjB,EAAG,qBAAqB,6DAA6DiB,MAAM,MAC/fjB,EAAG,sBAAsB,8DAA8DiB,MAAM,MAAM,IAAI+hB,GAAG,6NAA6N/hB,MAAM,KAAKgiB,GAAG,IAAInjB,IAAI,0CAA0CmB,MAAM,KAAKiiB,OAAOF,KACzZ,SAASG,GAAG54B,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEkV,MAAM,gBAAgBlV,EAAE4qB,cAAcrpB,EAlDjE,SAAYvB,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,EAAEgD,EAAE9X,GAA4B,GAAzBiiB,GAAG/R,MAAMvd,KAAKD,WAAckvB,GAAG,CAAC,IAAGA,GAAgC,MAAM9uB,MAAMogB,EAAE,MAA1C,IAAI2E,EAAEgK,GAAGD,IAAG,EAAGC,GAAG,KAA8BC,KAAKA,IAAG,EAAGC,GAAGlK,EAAE,CAAC,CAkDpE4f,CAAG/uB,EAAE7J,OAAE,EAAOD,GAAGA,EAAE4qB,cAAc,IAAI,CACxG,SAAS0I,GAAGtzB,EAAEC,GAAGA,EAAE,KAAO,EAAFA,GAAK,IAAI,IAAIsB,EAAE,EAAEA,EAAEvB,EAAE/O,OAAOsQ,IAAI,CAAC,IAAIuI,EAAE9J,EAAEuB,GAAG0U,EAAEnM,EAAEopB,MAAMppB,EAAEA,EAAEqpB,UAAUnzB,EAAE,CAAC,IAAIvQ,OAAE,EAAO,GAAGwQ,EAAE,IAAI,IAAIiW,EAAEpM,EAAE7Y,OAAO,EAAE,GAAGilB,EAAEA,IAAI,CAAC,IAAIgD,EAAEpP,EAAEoM,GAAG9U,EAAE8X,EAAE4f,SAAS7f,EAAEC,EAAE0R,cAA2B,GAAb1R,EAAEA,EAAE6f,SAAY33B,IAAI3R,GAAGwmB,EAAE+U,uBAAuB,MAAMhrB,EAAE44B,GAAG3iB,EAAEiD,EAAED,GAAGxpB,EAAE2R,CAAC,MAAM,IAAI8U,EAAE,EAAEA,EAAEpM,EAAE7Y,OAAOilB,IAAI,CAAoD,GAA5C9U,GAAP8X,EAAEpP,EAAEoM,IAAO4iB,SAAS7f,EAAEC,EAAE0R,cAAc1R,EAAEA,EAAE6f,SAAY33B,IAAI3R,GAAGwmB,EAAE+U,uBAAuB,MAAMhrB,EAAE44B,GAAG3iB,EAAEiD,EAAED,GAAGxpB,EAAE2R,CAAC,CAAC,CAAC,CAAC,GAAG8hB,GAAG,MAAMljB,EAAEmjB,GAAGD,IAAG,EAAGC,GAAG,KAAKnjB,CAAE,CAC5a,SAASg5B,GAAEh5B,EAAEC,GAAG,IAAIsB,EAAEtB,EAAEg5B,SAAI,IAAS13B,IAAIA,EAAEtB,EAAEg5B,IAAI,IAAI1jB,KAAK,IAAIzL,EAAE9J,EAAE,WAAWuB,EAAEpH,IAAI2P,KAAKovB,GAAGj5B,EAAED,EAAE,GAAE,GAAIuB,EAAEoU,IAAI7L,GAAG,CAAC,SAASqvB,GAAGn5B,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE,EAAE7J,IAAI6J,GAAG,GAAGovB,GAAG33B,EAAEvB,EAAE8J,EAAE7J,EAAE,CAAC,IAAIm5B,GAAG,kBAAkBh5B,KAAK+M,SAAS1X,SAAS,IAAIyb,MAAM,GAAG,SAASmoB,GAAGr5B,GAAG,IAAIA,EAAEo5B,IAAI,CAACp5B,EAAEo5B,KAAI,EAAG9jB,EAAGqB,SAAQ,SAAS1W,GAAG,oBAAoBA,IAAIy4B,GAAGv+B,IAAI8F,IAAIk5B,GAAGl5B,GAAE,EAAGD,GAAGm5B,GAAGl5B,GAAE,EAAGD,GAAG,IAAG,IAAIC,EAAE,IAAID,EAAEkd,SAASld,EAAEA,EAAEyb,cAAc,OAAOxb,GAAGA,EAAEm5B,MAAMn5B,EAAEm5B,KAAI,EAAGD,GAAG,mBAAkB,EAAGl5B,GAAG,CAAC,CACjb,SAASi5B,GAAGl5B,EAAEC,EAAEsB,EAAEuI,GAAG,OAAOigB,GAAG9pB,IAAI,KAAK,EAAE,IAAIgW,EAAEsT,GAAG,MAAM,KAAK,EAAEtT,EAAEyT,GAAG,MAAM,QAAQzT,EAAEwT,GAAGloB,EAAE0U,EAAEqjB,KAAK,KAAKr5B,EAAEsB,EAAEvB,GAAGiW,OAAE,GAAQyM,IAAI,eAAeziB,GAAG,cAAcA,GAAG,UAAUA,IAAIgW,GAAE,GAAInM,OAAE,IAASmM,EAAEjW,EAAE4iB,iBAAiB3iB,EAAEsB,EAAE,CAACg4B,SAAQ,EAAGC,QAAQvjB,IAAIjW,EAAE4iB,iBAAiB3iB,EAAEsB,GAAE,QAAI,IAAS0U,EAAEjW,EAAE4iB,iBAAiB3iB,EAAEsB,EAAE,CAACi4B,QAAQvjB,IAAIjW,EAAE4iB,iBAAiB3iB,EAAEsB,GAAE,EAAG,CAClV,SAASooB,GAAG3pB,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,IAAIxmB,EAAEqa,EAAE,GAAG,KAAO,EAAF7J,IAAM,KAAO,EAAFA,IAAM,OAAO6J,EAAE9J,EAAE,OAAO,CAAC,GAAG,OAAO8J,EAAE,OAAO,IAAIoM,EAAEpM,EAAE0K,IAAI,GAAG,IAAI0B,GAAG,IAAIA,EAAE,CAAC,IAAIgD,EAAEpP,EAAEmY,UAAU0G,cAAc,GAAGzP,IAAIjD,GAAG,IAAIiD,EAAEgE,UAAUhE,EAAEyI,aAAa1L,EAAE,MAAM,GAAG,IAAIC,EAAE,IAAIA,EAAEpM,EAAEyZ,OAAO,OAAOrN,GAAG,CAAC,IAAI9U,EAAE8U,EAAE1B,IAAI,IAAG,IAAIpT,GAAG,IAAIA,MAAKA,EAAE8U,EAAE+L,UAAU0G,iBAAkB1S,GAAG,IAAI7U,EAAE8b,UAAU9b,EAAEugB,aAAa1L,GAAE,OAAOC,EAAEA,EAAEqN,MAAM,CAAC,KAAK,OAAOrK,GAAG,CAAS,GAAG,QAAXhD,EAAEsS,GAAGtP,IAAe,OAAe,GAAG,KAAX9X,EAAE8U,EAAE1B,MAAc,IAAIpT,EAAE,CAAC0I,EAAEra,EAAEymB,EAAE,SAASlW,CAAC,CAACkZ,EAAEA,EAAEyI,UAAU,CAAC,CAAC7X,EAAEA,EAAEyZ,MAAM,CAACf,IAAG,WAAW,IAAI1Y,EAAEra,EAAEwmB,EAAEuL,GAAGjgB,GAAG2U,EAAE,GACpflW,EAAE,CAAC,IAAIkZ,EAAEkf,GAAG7oC,IAAIyQ,GAAG,QAAG,IAASkZ,EAAE,CAAC,IAAI9X,EAAE4qB,GAAGvnB,EAAEzE,EAAE,OAAOA,GAAG,IAAK,WAAW,GAAG,IAAIoqB,GAAG7oB,GAAG,MAAMvB,EAAE,IAAK,UAAU,IAAK,QAAQoB,EAAE0uB,GAAG,MAAM,IAAK,UAAUrrB,EAAE,QAAQrD,EAAEwsB,GAAG,MAAM,IAAK,WAAWnpB,EAAE,OAAOrD,EAAEwsB,GAAG,MAAM,IAAK,aAAa,IAAK,YAAYxsB,EAAEwsB,GAAG,MAAM,IAAK,QAAQ,GAAG,IAAIrsB,EAAE2rB,OAAO,MAAMltB,EAAE,IAAK,WAAW,IAAK,WAAW,IAAK,YAAY,IAAK,YAAY,IAAK,UAAU,IAAK,WAAW,IAAK,YAAY,IAAK,cAAcoB,EAAEqsB,GAAG,MAAM,IAAK,OAAO,IAAK,UAAU,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,OAAOrsB,EAC1iBssB,GAAG,MAAM,IAAK,cAAc,IAAK,WAAW,IAAK,YAAY,IAAK,aAAatsB,EAAEmvB,GAAG,MAAM,KAAKyH,GAAG,KAAKC,GAAG,KAAKC,GAAG92B,EAAEysB,GAAG,MAAM,KAAKsK,GAAG/2B,EAAEuvB,GAAG,MAAM,IAAK,SAASvvB,EAAEgrB,GAAG,MAAM,IAAK,QAAQhrB,EAAEgwB,GAAG,MAAM,IAAK,OAAO,IAAK,MAAM,IAAK,QAAQhwB,EAAE+sB,GAAG,MAAM,IAAK,oBAAoB,IAAK,qBAAqB,IAAK,gBAAgB,IAAK,cAAc,IAAK,cAAc,IAAK,aAAa,IAAK,cAAc,IAAK,YAAY/sB,EAAE2uB,GAAG,IAAIzuB,EAAE,KAAO,EAAFrB,GAAKw5B,GAAGn4B,GAAG,WAAWtB,EAAE7P,EAAEmR,EAAE,OAAO4X,EAAEA,EAAE,UAAU,KAAKA,EAAE5X,EAAE,GAAG,IAAI,IAAQkD,EAAJtB,EAAE4G,EAAI,OAC/e5G,GAAG,CAAK,IAAIw2B,GAARl1B,EAAEtB,GAAU+e,UAAsF,GAA5E,IAAIzd,EAAEgQ,KAAK,OAAOklB,IAAIl1B,EAAEk1B,EAAE,OAAOvpC,IAAc,OAAVupC,EAAEjX,GAAGvf,EAAE/S,KAAYmR,EAAE7P,KAAKkoC,GAAGz2B,EAAEw2B,EAAEl1B,MAASi1B,EAAE,MAAMv2B,EAAEA,EAAEqgB,MAAM,CAAC,EAAEjiB,EAAErQ,SAASioB,EAAE,IAAI9X,EAAE8X,EAAEzU,EAAE,KAAKlD,EAAE0U,GAAGC,EAAEzkB,KAAK,CAACyhC,MAAMha,EAAEia,UAAU7xB,IAAI,CAAC,CAAC,GAAG,KAAO,EAAFrB,GAAK,CAA4E,GAAnCmB,EAAE,aAAapB,GAAG,eAAeA,KAAtEkZ,EAAE,cAAclZ,GAAG,gBAAgBA,IAA2CuB,IAAIggB,MAAK9c,EAAElD,EAAE6rB,eAAe7rB,EAAE8rB,eAAe7E,GAAG/jB,KAAIA,EAAEm1B,OAAgBx4B,GAAG8X,KAAGA,EAAEjD,EAAE5C,SAAS4C,EAAEA,GAAGiD,EAAEjD,EAAEwF,eAAevC,EAAE2c,aAAa3c,EAAE2gB,aAAaxmB,OAAUjS,GAAqCA,EAAE0I,EAAiB,QAAfrF,GAAnCA,EAAElD,EAAE6rB,eAAe7rB,EAAE+rB,WAAkB9E,GAAG/jB,GAAG,QAC9dA,KAARg1B,EAAEnW,GAAG7e,KAAU,IAAIA,EAAE+P,KAAK,IAAI/P,EAAE+P,OAAK/P,EAAE,QAAUrD,EAAE,KAAKqD,EAAEqF,GAAK1I,IAAIqD,GAAE,CAAgU,GAA/TnD,EAAEmsB,GAAGiM,EAAE,eAAevpC,EAAE,eAAe+S,EAAE,QAAW,eAAelD,GAAG,gBAAgBA,IAAEsB,EAAEyuB,GAAG2J,EAAE,iBAAiBvpC,EAAE,iBAAiB+S,EAAE,WAAUu2B,EAAE,MAAMr4B,EAAE8X,EAAEsa,GAAGpyB,GAAGoD,EAAE,MAAMC,EAAEyU,EAAEsa,GAAG/uB,IAAGyU,EAAE,IAAI5X,EAAEo4B,EAAEx2B,EAAE,QAAQ9B,EAAEG,EAAE0U,IAAKxhB,OAAOglC,EAAEvgB,EAAEkU,cAAc5oB,EAAEk1B,EAAE,KAAKlR,GAAGvS,KAAKnM,KAAIxI,EAAE,IAAIA,EAAEnR,EAAE+S,EAAE,QAAQuB,EAAElD,EAAE0U,IAAKxhB,OAAO+P,EAAElD,EAAE8rB,cAAcqM,EAAEC,EAAEp4B,GAAGm4B,EAAEC,EAAKt4B,GAAGqD,EAAExE,EAAE,CAAa,IAAR9P,EAAEsU,EAAEvB,EAAE,EAAMsB,EAAhBlD,EAAEF,EAAkBoD,EAAEA,EAAEs1B,GAAGt1B,GAAGtB,IAAQ,IAAJsB,EAAE,EAAMk1B,EAAEvpC,EAAEupC,EAAEA,EAAEI,GAAGJ,GAAGl1B,IAAI,KAAK,EAAEtB,EAAEsB,GAAGlD,EAAEw4B,GAAGx4B,GAAG4B,IAAI,KAAK,EAAEsB,EAAEtB,GAAG/S,EACpf2pC,GAAG3pC,GAAGqU,IAAI,KAAKtB,KAAK,CAAC,GAAG5B,IAAInR,GAAG,OAAOA,GAAGmR,IAAInR,EAAEye,UAAU,MAAM3O,EAAEqB,EAAEw4B,GAAGx4B,GAAGnR,EAAE2pC,GAAG3pC,EAAE,CAACmR,EAAE,IAAI,MAAMA,EAAE,KAAK,OAAOF,GAAG24B,GAAG7jB,EAAEgD,EAAE9X,EAAEE,GAAE,GAAI,OAAOmD,GAAG,OAAOg1B,GAAGM,GAAG7jB,EAAEujB,EAAEh1B,EAAEnD,GAAE,EAAG,CAA8D,GAAG,YAA1CF,GAAjB8X,EAAEpP,EAAE0pB,GAAG1pB,GAAGuJ,QAAW0G,UAAUb,EAAEa,SAASxM,gBAA+B,UAAUnM,GAAG,SAAS8X,EAAEhE,KAAK,IAAI8kB,EAAGvG,QAAQ,GAAGV,GAAG7Z,GAAG,GAAGwa,GAAGsG,EAAG1F,OAAO,CAAC0F,EAAG5F,GAAG,IAAI6F,EAAG/F,EAAE,MAAM9yB,EAAE8X,EAAEa,WAAW,UAAU3Y,EAAEmM,gBAAgB,aAAa2L,EAAEhE,MAAM,UAAUgE,EAAEhE,QAAQ8kB,EAAG3F,IACrV,OAD4V2F,IAAKA,EAAGA,EAAGh6B,EAAE8J,IAAKkpB,GAAG9c,EAAE8jB,EAAGz4B,EAAE0U,IAAWgkB,GAAIA,EAAGj6B,EAAEkZ,EAAEpP,GAAG,aAAa9J,IAAIi6B,EAAG/gB,EAAE+B,gBAClfgf,EAAG7e,YAAY,WAAWlC,EAAEhE,MAAMqG,GAAGrC,EAAE,SAASA,EAAEtpB,QAAOqqC,EAAGnwB,EAAE0pB,GAAG1pB,GAAGuJ,OAAcrT,GAAG,IAAK,WAAa+yB,GAAGkH,IAAK,SAASA,EAAG5E,mBAAgB4B,GAAGgD,EAAG/C,GAAGptB,EAAEqtB,GAAG,MAAK,MAAM,IAAK,WAAWA,GAAGD,GAAGD,GAAG,KAAK,MAAM,IAAK,YAAYG,IAAG,EAAG,MAAM,IAAK,cAAc,IAAK,UAAU,IAAK,UAAUA,IAAG,EAAGC,GAAGnhB,EAAE3U,EAAE0U,GAAG,MAAM,IAAK,kBAAkB,GAAG+gB,GAAG,MAAM,IAAK,UAAU,IAAK,QAAQK,GAAGnhB,EAAE3U,EAAE0U,GAAG,IAAIikB,EAAG,GAAG5I,GAAGrxB,EAAE,CAAC,OAAOD,GAAG,IAAK,mBAAmB,IAAIm6B,EAAG,qBAAqB,MAAMl6B,EAAE,IAAK,iBAAiBk6B,EAAG,mBACpe,MAAMl6B,EAAE,IAAK,oBAAoBk6B,EAAG,sBAAsB,MAAMl6B,EAAEk6B,OAAG,CAAM,MAAMpI,GAAGF,GAAG7xB,EAAEuB,KAAK44B,EAAG,oBAAoB,YAAYn6B,GAAG,MAAMuB,EAAE8oB,UAAU8P,EAAG,sBAAsBA,IAAKzI,IAAI,OAAOnwB,EAAEquB,SAASmC,IAAI,uBAAuBoI,EAAG,qBAAqBA,GAAIpI,KAAKmI,EAAG/P,OAAYF,GAAG,UAARD,GAAG/T,GAAkB+T,GAAGp6B,MAAMo6B,GAAG3N,YAAY0V,IAAG,IAAiB,GAAZkI,EAAGhH,GAAGnpB,EAAEqwB,IAASlpC,SAASkpC,EAAG,IAAI/L,GAAG+L,EAAGn6B,EAAE,KAAKuB,EAAE0U,GAAGC,EAAEzkB,KAAK,CAACyhC,MAAMiH,EAAGhH,UAAU8G,IAAKC,EAAGC,EAAGhiC,KAAK+hC,EAAa,QAATA,EAAGpI,GAAGvwB,MAAe44B,EAAGhiC,KAAK+hC,MAAUA,EAAGzI,GA5BhM,SAAYzxB,EAAEC,GAAG,OAAOD,GAAG,IAAK,iBAAiB,OAAO8xB,GAAG7xB,GAAG,IAAK,WAAW,OAAG,KAAKA,EAAE4vB,MAAa,MAAK+B,IAAG,EAAUD,IAAG,IAAK,YAAY,OAAO3xB,EAAEC,EAAE9H,QAASw5B,IAAIC,GAAG,KAAK5xB,EAAE,QAAQ,OAAO,KAAK,CA4BEo6B,CAAGp6B,EAAEuB,GA3Bzd,SAAYvB,EAAEC,GAAG,GAAG8xB,GAAG,MAAM,mBAAmB/xB,IAAIsxB,IAAIO,GAAG7xB,EAAEC,IAAID,EAAEmqB,KAAKD,GAAGD,GAAGD,GAAG,KAAK+H,IAAG,EAAG/xB,GAAG,KAAK,OAAOA,GAAG,IAAK,QAAgQ,QAAQ,OAAO,KAA3P,IAAK,WAAW,KAAKC,EAAE2sB,SAAS3sB,EAAE6sB,QAAQ7sB,EAAE8sB,UAAU9sB,EAAE2sB,SAAS3sB,EAAE6sB,OAAO,CAAC,GAAG7sB,EAAEo6B,MAAM,EAAEp6B,EAAEo6B,KAAKppC,OAAO,OAAOgP,EAAEo6B,KAAK,GAAGp6B,EAAE4vB,MAAM,OAAO9xB,OAAOuR,aAAarP,EAAE4vB,MAAM,CAAC,OAAO,KAAK,IAAK,iBAAiB,OAAO6B,IAAI,OAAOzxB,EAAE2vB,OAAO,KAAK3vB,EAAE9H,KAAyB,CA2BqFmiC,CAAGt6B,EAAEuB,MACje,GADoeuI,EAAEmpB,GAAGnpB,EAAE,kBACve7Y,SAASglB,EAAE,IAAImY,GAAG,gBAAgB,cAAc,KAAK7sB,EAAE0U,GAAGC,EAAEzkB,KAAK,CAACyhC,MAAMjd,EAAEkd,UAAUrpB,IAAImM,EAAE9d,KAAK+hC,GAAG,CAAC5G,GAAGpd,EAAEjW,EAAE,GAAE,CAAC,SAAS05B,GAAG35B,EAAEC,EAAEsB,GAAG,MAAM,CAACu3B,SAAS94B,EAAE+4B,SAAS94B,EAAE2qB,cAAcrpB,EAAE,CAAC,SAAS0xB,GAAGjzB,EAAEC,GAAG,IAAI,IAAIsB,EAAEtB,EAAE,UAAU6J,EAAE,GAAG,OAAO9J,GAAG,CAAC,IAAIiW,EAAEjW,EAAEvQ,EAAEwmB,EAAEgM,UAAU,IAAIhM,EAAEzB,KAAK,OAAO/kB,IAAIwmB,EAAExmB,EAAY,OAAVA,EAAEgzB,GAAGziB,EAAEuB,KAAYuI,EAAEywB,QAAQZ,GAAG35B,EAAEvQ,EAAEwmB,IAAc,OAAVxmB,EAAEgzB,GAAGziB,EAAEC,KAAY6J,EAAErY,KAAKkoC,GAAG35B,EAAEvQ,EAAEwmB,KAAKjW,EAAEA,EAAEujB,MAAM,CAAC,OAAOzZ,CAAC,CAAC,SAASgwB,GAAG95B,GAAG,GAAG,OAAOA,EAAE,OAAO,KAAK,GAAGA,EAAEA,EAAEujB,aAAavjB,GAAG,IAAIA,EAAEwU,KAAK,OAAOxU,GAAI,IAAI,CACnd,SAAS+5B,GAAG/5B,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,IAAI,IAAIxmB,EAAEwQ,EAAEyqB,WAAWxU,EAAE,GAAG,OAAO3U,GAAGA,IAAIuI,GAAG,CAAC,IAAIoP,EAAE3X,EAAEH,EAAE8X,EAAEtK,UAAUqK,EAAEC,EAAE+I,UAAU,GAAG,OAAO7gB,GAAGA,IAAI0I,EAAE,MAAM,IAAIoP,EAAE1E,KAAK,OAAOyE,IAAIC,EAAED,EAAEhD,EAAa,OAAV7U,EAAEqhB,GAAGlhB,EAAE9R,KAAYymB,EAAEqkB,QAAQZ,GAAGp4B,EAAEH,EAAE8X,IAAKjD,GAAc,OAAV7U,EAAEqhB,GAAGlhB,EAAE9R,KAAYymB,EAAEzkB,KAAKkoC,GAAGp4B,EAAEH,EAAE8X,KAAM3X,EAAEA,EAAEgiB,MAAM,CAAC,IAAIrN,EAAEjlB,QAAQ+O,EAAEvO,KAAK,CAACyhC,MAAMjzB,EAAEkzB,UAAUjd,GAAG,CAAC,IAAIskB,GAAG,SAASC,GAAG,iBAAiB,SAASC,GAAG16B,GAAG,OAAO,kBAAkBA,EAAEA,EAAE,GAAGA,GAAG0N,QAAQ8sB,GAAG,MAAM9sB,QAAQ+sB,GAAG,GAAG,CAAC,SAASE,GAAG36B,EAAEC,EAAEsB,GAAW,GAARtB,EAAEy6B,GAAGz6B,GAAMy6B,GAAG16B,KAAKC,GAAGsB,EAAE,MAAMrN,MAAMogB,EAAE,KAAM,CAAC,SAASsmB,KAAK,CAC9e,IAAIC,GAAG,KAAKC,GAAG,KAAK,SAASC,GAAG/6B,EAAEC,GAAG,MAAM,aAAaD,GAAG,aAAaA,GAAG,kBAAkBC,EAAEgc,UAAU,kBAAkBhc,EAAEgc,UAAU,kBAAkBhc,EAAE+b,yBAAyB,OAAO/b,EAAE+b,yBAAyB,MAAM/b,EAAE+b,wBAAwBgf,MAAM,CAC5P,IAAIC,GAAG,oBAAoBC,WAAWA,gBAAW,EAAOC,GAAG,oBAAoBC,aAAaA,kBAAa,EAAOC,GAAG,oBAAoBC,QAAQA,aAAQ,EAAOC,GAAG,oBAAoBC,eAAeA,eAAe,qBAAqBH,GAAG,SAASr7B,GAAG,OAAOq7B,GAAGI,QAAQ,MAAMC,KAAK17B,GAAG27B,MAAMC,GAAG,EAAEX,GAAG,SAASW,GAAG57B,GAAGk7B,YAAW,WAAW,MAAMl7B,CAAE,GAAE,CACpV,SAAS67B,GAAG77B,EAAEC,GAAG,IAAIsB,EAAEtB,EAAE6J,EAAE,EAAE,EAAE,CAAC,IAAImM,EAAE1U,EAAEqzB,YAA6B,GAAjB50B,EAAE4c,YAAYrb,GAAM0U,GAAG,IAAIA,EAAEiH,SAAS,GAAY,QAAT3b,EAAE0U,EAAE9d,MAAc,CAAC,GAAG,IAAI2R,EAA0B,OAAvB9J,EAAE4c,YAAY3G,QAAGkT,GAAGlpB,GAAU6J,GAAG,KAAK,MAAMvI,GAAG,OAAOA,GAAG,OAAOA,GAAGuI,IAAIvI,EAAE0U,CAAC,OAAO1U,GAAG4nB,GAAGlpB,EAAE,CAAC,SAAS67B,GAAG97B,GAAG,KAAK,MAAMA,EAAEA,EAAEA,EAAE40B,YAAY,CAAC,IAAI30B,EAAED,EAAEkd,SAAS,GAAG,IAAIjd,GAAG,IAAIA,EAAE,MAAM,GAAG,IAAIA,EAAE,CAAU,GAAG,OAAZA,EAAED,EAAE7H,OAAiB,OAAO8H,GAAG,OAAOA,EAAE,MAAM,GAAG,OAAOA,EAAE,OAAO,IAAI,CAAC,CAAC,OAAOD,CAAC,CACjY,SAAS+7B,GAAG/7B,GAAGA,EAAEA,EAAEg8B,gBAAgB,IAAI,IAAI/7B,EAAE,EAAED,GAAG,CAAC,GAAG,IAAIA,EAAEkd,SAAS,CAAC,IAAI3b,EAAEvB,EAAE7H,KAAK,GAAG,MAAMoJ,GAAG,OAAOA,GAAG,OAAOA,EAAE,CAAC,GAAG,IAAItB,EAAE,OAAOD,EAAEC,GAAG,KAAK,OAAOsB,GAAGtB,GAAG,CAACD,EAAEA,EAAEg8B,eAAe,CAAC,OAAO,IAAI,CAAC,IAAIC,GAAG77B,KAAK+M,SAAS1X,SAAS,IAAIyb,MAAM,GAAGgrB,GAAG,gBAAgBD,GAAGE,GAAG,gBAAgBF,GAAGrC,GAAG,oBAAoBqC,GAAGhD,GAAG,iBAAiBgD,GAAGG,GAAG,oBAAoBH,GAAGI,GAAG,kBAAkBJ,GAClX,SAASzT,GAAGxoB,GAAG,IAAIC,EAAED,EAAEk8B,IAAI,GAAGj8B,EAAE,OAAOA,EAAE,IAAI,IAAIsB,EAAEvB,EAAE2hB,WAAWpgB,GAAG,CAAC,GAAGtB,EAAEsB,EAAEq4B,KAAKr4B,EAAE26B,IAAI,CAAe,GAAd36B,EAAEtB,EAAE2O,UAAa,OAAO3O,EAAE4jB,OAAO,OAAOtiB,GAAG,OAAOA,EAAEsiB,MAAM,IAAI7jB,EAAE+7B,GAAG/7B,GAAG,OAAOA,GAAG,CAAC,GAAGuB,EAAEvB,EAAEk8B,IAAI,OAAO36B,EAAEvB,EAAE+7B,GAAG/7B,EAAE,CAAC,OAAOC,CAAC,CAAKsB,GAAJvB,EAAEuB,GAAMogB,UAAU,CAAC,OAAO,IAAI,CAAC,SAASK,GAAGhiB,GAAkB,QAAfA,EAAEA,EAAEk8B,KAAKl8B,EAAE45B,MAAc,IAAI55B,EAAEwU,KAAK,IAAIxU,EAAEwU,KAAK,KAAKxU,EAAEwU,KAAK,IAAIxU,EAAEwU,IAAI,KAAKxU,CAAC,CAAC,SAASwzB,GAAGxzB,GAAG,GAAG,IAAIA,EAAEwU,KAAK,IAAIxU,EAAEwU,IAAI,OAAOxU,EAAEiiB,UAAU,MAAM/tB,MAAMogB,EAAE,IAAK,CAAC,SAAS4N,GAAGliB,GAAG,OAAOA,EAAEm8B,KAAK,IAAI,CAAC,IAAIG,GAAG,GAAGC,IAAI,EAAE,SAASC,GAAGx8B,GAAG,MAAM,CAAC+jB,QAAQ/jB,EAAE,CACve,SAASy8B,GAAEz8B,GAAG,EAAEu8B,KAAKv8B,EAAE+jB,QAAQuY,GAAGC,IAAID,GAAGC,IAAI,KAAKA,KAAK,CAAC,SAASG,GAAE18B,EAAEC,GAAGs8B,KAAKD,GAAGC,IAAIv8B,EAAE+jB,QAAQ/jB,EAAE+jB,QAAQ9jB,CAAC,CAAC,IAAI08B,GAAG,CAAC,EAAEC,GAAEJ,GAAGG,IAAIE,GAAGL,IAAG,GAAIM,GAAGH,GAAG,SAASI,GAAG/8B,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEkV,KAAK8nB,aAAa,IAAIz7B,EAAE,OAAOo7B,GAAG,IAAI7yB,EAAE9J,EAAEiiB,UAAU,GAAGnY,GAAGA,EAAEmzB,8CAA8Ch9B,EAAE,OAAO6J,EAAEozB,0CAA0C,IAASztC,EAALwmB,EAAE,CAAC,EAAI,IAAIxmB,KAAK8R,EAAE0U,EAAExmB,GAAGwQ,EAAExQ,GAAoH,OAAjHqa,KAAI9J,EAAEA,EAAEiiB,WAAYgb,4CAA4Ch9B,EAAED,EAAEk9B,0CAA0CjnB,GAAUA,CAAC,CAC9d,SAASknB,GAAGn9B,GAAyB,OAAO,QAA7BA,EAAEA,EAAEo9B,yBAAmC,IAASp9B,CAAC,CAAC,SAASq9B,KAAKZ,GAAEI,IAAIJ,GAAEG,GAAE,CAAC,SAASU,GAAGt9B,EAAEC,EAAEsB,GAAG,GAAGq7B,GAAE7Y,UAAU4Y,GAAG,MAAMzoC,MAAMogB,EAAE,MAAMooB,GAAEE,GAAE38B,GAAGy8B,GAAEG,GAAGt7B,EAAE,CAAC,SAASg8B,GAAGv9B,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEiiB,UAAgC,GAAtBhiB,EAAEA,EAAEm9B,kBAAqB,oBAAoBtzB,EAAE0zB,gBAAgB,OAAOj8B,EAAwB,IAAI,IAAI0U,KAA9BnM,EAAEA,EAAE0zB,kBAAiC,KAAKvnB,KAAKhW,GAAG,MAAM/L,MAAMogB,EAAE,IAAIsF,EAAG5Z,IAAI,UAAUiW,IAAI,OAAOhN,EAAE,CAAC,EAAE1H,EAAEuI,EAAE,CACxX,SAAS2zB,GAAGz9B,GAA2G,OAAxGA,GAAGA,EAAEA,EAAEiiB,YAAYjiB,EAAE09B,2CAA2Cf,GAAGG,GAAGF,GAAE7Y,QAAQ2Y,GAAEE,GAAE58B,GAAG08B,GAAEG,GAAGA,GAAG9Y,UAAe,CAAE,CAAC,SAAS4Z,GAAG39B,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEiiB,UAAU,IAAInY,EAAE,MAAM5V,MAAMogB,EAAE,MAAM/S,GAAGvB,EAAEu9B,GAAGv9B,EAAEC,EAAE68B,IAAIhzB,EAAE4zB,0CAA0C19B,EAAEy8B,GAAEI,IAAIJ,GAAEG,IAAGF,GAAEE,GAAE58B,IAAIy8B,GAAEI,IAAIH,GAAEG,GAAGt7B,EAAE,CAAC,IAAIq8B,GAAG,KAAKC,IAAG,EAAGC,IAAG,EAAG,SAASC,GAAG/9B,GAAG,OAAO49B,GAAGA,GAAG,CAAC59B,GAAG49B,GAAGnsC,KAAKuO,EAAE,CAChW,SAASg+B,KAAK,IAAIF,IAAI,OAAOF,GAAG,CAACE,IAAG,EAAG,IAAI99B,EAAE,EAAEC,EAAEoJ,GAAE,IAAI,IAAI9H,EAAEq8B,GAAG,IAAIv0B,GAAE,EAAErJ,EAAEuB,EAAEtQ,OAAO+O,IAAI,CAAC,IAAI8J,EAAEvI,EAAEvB,GAAG,GAAG8J,EAAEA,GAAE,SAAU,OAAOA,EAAE,CAAC8zB,GAAG,KAAKC,IAAG,CAAE,CAAC,MAAM5nB,GAAG,MAAM,OAAO2nB,KAAKA,GAAGA,GAAG1sB,MAAMlR,EAAE,IAAIkkB,GAAGW,GAAGmZ,IAAI/nB,CAAE,CAAC,QAAQ5M,GAAEpJ,EAAE69B,IAAG,CAAE,CAAC,CAAC,OAAO,IAAI,CAAC,IAAIG,GAAG,GAAGC,GAAG,EAAEC,GAAG,KAAKC,GAAG,EAAEC,GAAG,GAAGC,GAAG,EAAEC,GAAG,KAAKC,GAAG,EAAEC,GAAG,GAAG,SAASC,GAAG1+B,EAAEC,GAAGg+B,GAAGC,MAAME,GAAGH,GAAGC,MAAMC,GAAGA,GAAGn+B,EAAEo+B,GAAGn+B,CAAC,CACjV,SAAS0+B,GAAG3+B,EAAEC,EAAEsB,GAAG88B,GAAGC,MAAME,GAAGH,GAAGC,MAAMG,GAAGJ,GAAGC,MAAMC,GAAGA,GAAGv+B,EAAE,IAAI8J,EAAE00B,GAAGx+B,EAAEy+B,GAAG,IAAIxoB,EAAE,GAAGwP,GAAG3b,GAAG,EAAEA,KAAK,GAAGmM,GAAG1U,GAAG,EAAE,IAAI9R,EAAE,GAAGg2B,GAAGxlB,GAAGgW,EAAE,GAAG,GAAGxmB,EAAE,CAAC,IAAIymB,EAAED,EAAEA,EAAE,EAAExmB,GAAGqa,GAAG,GAAGoM,GAAG,GAAGzgB,SAAS,IAAIqU,IAAIoM,EAAED,GAAGC,EAAEsoB,GAAG,GAAG,GAAG/Y,GAAGxlB,GAAGgW,EAAE1U,GAAG0U,EAAEnM,EAAE20B,GAAGhvC,EAAEuQ,CAAC,MAAMw+B,GAAG,GAAG/uC,EAAE8R,GAAG0U,EAAEnM,EAAE20B,GAAGz+B,CAAC,CAAC,SAAS4+B,GAAG5+B,GAAG,OAAOA,EAAEujB,SAASmb,GAAG1+B,EAAE,GAAG2+B,GAAG3+B,EAAE,EAAE,GAAG,CAAC,SAAS6+B,GAAG7+B,GAAG,KAAKA,IAAIm+B,IAAIA,GAAGF,KAAKC,IAAID,GAAGC,IAAI,KAAKE,GAAGH,KAAKC,IAAID,GAAGC,IAAI,KAAK,KAAKl+B,IAAIu+B,IAAIA,GAAGF,KAAKC,IAAID,GAAGC,IAAI,KAAKG,GAAGJ,KAAKC,IAAID,GAAGC,IAAI,KAAKE,GAAGH,KAAKC,IAAID,GAAGC,IAAI,IAAI,CAAC,IAAIQ,GAAG,KAAKC,GAAG,KAAKC,IAAE,EAAGC,GAAG,KACje,SAASC,GAAGl/B,EAAEC,GAAG,IAAIsB,EAAE49B,GAAG,EAAE,KAAK,KAAK,GAAG59B,EAAE69B,YAAY,UAAU79B,EAAE0gB,UAAUhiB,EAAEsB,EAAEgiB,OAAOvjB,EAAgB,QAAdC,EAAED,EAAEq/B,YAAoBr/B,EAAEq/B,UAAU,CAAC99B,GAAGvB,EAAE0P,OAAO,IAAIzP,EAAExO,KAAK8P,EAAE,CACxJ,SAAS+9B,GAAGt/B,EAAEC,GAAG,OAAOD,EAAEwU,KAAK,KAAK,EAAE,IAAIjT,EAAEvB,EAAEkV,KAAyE,OAAO,QAA3EjV,EAAE,IAAIA,EAAEid,UAAU3b,EAAEgM,gBAAgBtN,EAAE8Z,SAASxM,cAAc,KAAKtN,KAAmBD,EAAEiiB,UAAUhiB,EAAE6+B,GAAG9+B,EAAE++B,GAAGjD,GAAG77B,EAAE0c,aAAY,GAAO,KAAK,EAAE,OAAoD,QAA7C1c,EAAE,KAAKD,EAAEu/B,cAAc,IAAIt/B,EAAEid,SAAS,KAAKjd,KAAYD,EAAEiiB,UAAUhiB,EAAE6+B,GAAG9+B,EAAE++B,GAAG,MAAK,GAAO,KAAK,GAAG,OAA+B,QAAxB9+B,EAAE,IAAIA,EAAEid,SAAS,KAAKjd,KAAYsB,EAAE,OAAOg9B,GAAG,CAAC3U,GAAG4U,GAAGgB,SAASf,IAAI,KAAKz+B,EAAEyjB,cAAc,CAACC,WAAWzjB,EAAEw/B,YAAYl+B,EAAEm+B,UAAU,aAAYn+B,EAAE49B,GAAG,GAAG,KAAK,KAAK,IAAKld,UAAUhiB,EAAEsB,EAAEgiB,OAAOvjB,EAAEA,EAAE6jB,MAAMtiB,EAAEu9B,GAAG9+B,EAAE++B,GAClf,MAAK,GAAO,QAAQ,OAAM,EAAG,CAAC,SAASY,GAAG3/B,GAAG,OAAO,KAAY,EAAPA,EAAE4/B,OAAS,KAAa,IAAR5/B,EAAE0P,MAAU,CAAC,SAASmwB,GAAG7/B,GAAG,GAAGg/B,GAAE,CAAC,IAAI/+B,EAAE8+B,GAAG,GAAG9+B,EAAE,CAAC,IAAIsB,EAAEtB,EAAE,IAAIq/B,GAAGt/B,EAAEC,GAAG,CAAC,GAAG0/B,GAAG3/B,GAAG,MAAM9L,MAAMogB,EAAE,MAAMrU,EAAE67B,GAAGv6B,EAAEqzB,aAAa,IAAI9qB,EAAEg1B,GAAG7+B,GAAGq/B,GAAGt/B,EAAEC,GAAGi/B,GAAGp1B,EAAEvI,IAAIvB,EAAE0P,OAAe,KAAT1P,EAAE0P,MAAY,EAAEsvB,IAAE,EAAGF,GAAG9+B,EAAE,CAAC,KAAK,CAAC,GAAG2/B,GAAG3/B,GAAG,MAAM9L,MAAMogB,EAAE,MAAMtU,EAAE0P,OAAe,KAAT1P,EAAE0P,MAAY,EAAEsvB,IAAE,EAAGF,GAAG9+B,CAAC,CAAC,CAAC,CAAC,SAAS8/B,GAAG9/B,GAAG,IAAIA,EAAEA,EAAEujB,OAAO,OAAOvjB,GAAG,IAAIA,EAAEwU,KAAK,IAAIxU,EAAEwU,KAAK,KAAKxU,EAAEwU,KAAKxU,EAAEA,EAAEujB,OAAOub,GAAG9+B,CAAC,CACha,SAAS+/B,GAAG//B,GAAG,GAAGA,IAAI8+B,GAAG,OAAM,EAAG,IAAIE,GAAE,OAAOc,GAAG9/B,GAAGg/B,IAAE,GAAG,EAAG,IAAI/+B,EAAkG,IAA/FA,EAAE,IAAID,EAAEwU,QAAQvU,EAAE,IAAID,EAAEwU,OAAgBvU,EAAE,UAAXA,EAAED,EAAEkV,OAAmB,SAASjV,IAAI86B,GAAG/6B,EAAEkV,KAAKlV,EAAEggC,gBAAmB//B,IAAIA,EAAE8+B,IAAI,CAAC,GAAGY,GAAG3/B,GAAG,MAAMigC,KAAK/rC,MAAMogB,EAAE,MAAM,KAAKrU,GAAGi/B,GAAGl/B,EAAEC,GAAGA,EAAE67B,GAAG77B,EAAE20B,YAAY,CAAO,GAANkL,GAAG9/B,GAAM,KAAKA,EAAEwU,IAAI,CAAgD,KAA7BxU,EAAE,QAApBA,EAAEA,EAAEyjB,eAAyBzjB,EAAE0jB,WAAW,MAAW,MAAMxvB,MAAMogB,EAAE,MAAMtU,EAAE,CAAiB,IAAhBA,EAAEA,EAAE40B,YAAgB30B,EAAE,EAAED,GAAG,CAAC,GAAG,IAAIA,EAAEkd,SAAS,CAAC,IAAI3b,EAAEvB,EAAE7H,KAAK,GAAG,OAAOoJ,EAAE,CAAC,GAAG,IAAItB,EAAE,CAAC8+B,GAAGjD,GAAG97B,EAAE40B,aAAa,MAAM50B,CAAC,CAACC,GAAG,KAAK,MAAMsB,GAAG,OAAOA,GAAG,OAAOA,GAAGtB,GAAG,CAACD,EAAEA,EAAE40B,WAAW,CAACmK,GACjgB,IAAI,CAAC,MAAMA,GAAGD,GAAGhD,GAAG97B,EAAEiiB,UAAU2S,aAAa,KAAK,OAAM,CAAE,CAAC,SAASqL,KAAK,IAAI,IAAIjgC,EAAE++B,GAAG/+B,GAAGA,EAAE87B,GAAG97B,EAAE40B,YAAY,CAAC,SAASsL,KAAKnB,GAAGD,GAAG,KAAKE,IAAE,CAAE,CAAC,SAASmB,GAAGngC,GAAG,OAAOi/B,GAAGA,GAAG,CAACj/B,GAAGi/B,GAAGxtC,KAAKuO,EAAE,CAAC,IAAIogC,GAAG9oB,EAAG+R,wBAAwB,SAASgX,GAAGrgC,EAAEC,GAAG,GAAGD,GAAGA,EAAEsgC,aAAa,CAA4B,IAAI,IAAI/+B,KAAnCtB,EAAEgJ,EAAE,CAAC,EAAEhJ,GAAGD,EAAEA,EAAEsgC,kBAA4B,IAASrgC,EAAEsB,KAAKtB,EAAEsB,GAAGvB,EAAEuB,IAAI,OAAOtB,CAAC,CAAC,OAAOA,CAAC,CAAC,IAAIsgC,GAAG/D,GAAG,MAAMgE,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAK,SAASC,KAAKD,GAAGD,GAAGD,GAAG,IAAI,CAAC,SAASI,GAAG5gC,GAAG,IAAIC,EAAEsgC,GAAGxc,QAAQ0Y,GAAE8D,IAAIvgC,EAAE6gC,cAAc5gC,CAAC,CACjd,SAAS6gC,GAAG9gC,EAAEC,EAAEsB,GAAG,KAAK,OAAOvB,GAAG,CAAC,IAAI8J,EAAE9J,EAAE4O,UAA+H,IAApH5O,EAAE+gC,WAAW9gC,KAAKA,GAAGD,EAAE+gC,YAAY9gC,EAAE,OAAO6J,IAAIA,EAAEi3B,YAAY9gC,IAAI,OAAO6J,IAAIA,EAAEi3B,WAAW9gC,KAAKA,IAAI6J,EAAEi3B,YAAY9gC,GAAMD,IAAIuB,EAAE,MAAMvB,EAAEA,EAAEujB,MAAM,CAAC,CAAC,SAASyd,GAAGhhC,EAAEC,GAAGugC,GAAGxgC,EAAE0gC,GAAGD,GAAG,KAAsB,QAAjBzgC,EAAEA,EAAEihC,eAAuB,OAAOjhC,EAAEkhC,eAAe,KAAKlhC,EAAEmhC,MAAMlhC,KAAKmhC,IAAG,GAAIphC,EAAEkhC,aAAa,KAAK,CACtU,SAASG,GAAGrhC,GAAG,IAAIC,EAAED,EAAE6gC,cAAc,GAAGH,KAAK1gC,EAAE,GAAGA,EAAE,CAACshC,QAAQthC,EAAEuhC,cAActhC,EAAE1O,KAAK,MAAM,OAAOkvC,GAAG,CAAC,GAAG,OAAOD,GAAG,MAAMtsC,MAAMogB,EAAE,MAAMmsB,GAAGzgC,EAAEwgC,GAAGS,aAAa,CAACE,MAAM,EAAED,aAAalhC,EAAE,MAAMygC,GAAGA,GAAGlvC,KAAKyO,EAAE,OAAOC,CAAC,CAAC,IAAIuhC,GAAG,KAAK,SAASC,GAAGzhC,GAAG,OAAOwhC,GAAGA,GAAG,CAACxhC,GAAGwhC,GAAG/vC,KAAKuO,EAAE,CAAC,SAAS0hC,GAAG1hC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEhW,EAAE0hC,YAA+E,OAAnE,OAAO1rB,GAAG1U,EAAEhQ,KAAKgQ,EAAEkgC,GAAGxhC,KAAKsB,EAAEhQ,KAAK0kB,EAAE1kB,KAAK0kB,EAAE1kB,KAAKgQ,GAAGtB,EAAE0hC,YAAYpgC,EAASqgC,GAAG5hC,EAAE8J,EAAE,CAChY,SAAS83B,GAAG5hC,EAAEC,GAAGD,EAAEmhC,OAAOlhC,EAAE,IAAIsB,EAAEvB,EAAE4O,UAAqC,IAA3B,OAAOrN,IAAIA,EAAE4/B,OAAOlhC,GAAGsB,EAAEvB,EAAMA,EAAEA,EAAEujB,OAAO,OAAOvjB,GAAGA,EAAE+gC,YAAY9gC,EAAgB,QAAdsB,EAAEvB,EAAE4O,aAAqBrN,EAAEw/B,YAAY9gC,GAAGsB,EAAEvB,EAAEA,EAAEA,EAAEujB,OAAO,OAAO,IAAIhiB,EAAEiT,IAAIjT,EAAE0gB,UAAU,IAAI,CAAC,IAAI4f,IAAG,EAAG,SAASC,GAAG9hC,GAAGA,EAAE+hC,YAAY,CAACC,UAAUhiC,EAAEyjB,cAAcwe,gBAAgB,KAAKC,eAAe,KAAKC,OAAO,CAACC,QAAQ,KAAKT,YAAY,KAAKR,MAAM,GAAGkB,QAAQ,KAAK,CACpX,SAASC,GAAGtiC,EAAEC,GAAGD,EAAEA,EAAE+hC,YAAY9hC,EAAE8hC,cAAc/hC,IAAIC,EAAE8hC,YAAY,CAACC,UAAUhiC,EAAEgiC,UAAUC,gBAAgBjiC,EAAEiiC,gBAAgBC,eAAeliC,EAAEkiC,eAAeC,OAAOniC,EAAEmiC,OAAOE,QAAQriC,EAAEqiC,SAAS,CAAC,SAASE,GAAGviC,EAAEC,GAAG,MAAM,CAACuiC,UAAUxiC,EAAEyiC,KAAKxiC,EAAEuU,IAAI,EAAEkuB,QAAQ,KAAKC,SAAS,KAAKpxC,KAAK,KAAK,CACtR,SAASqxC,GAAG5iC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAE+hC,YAAY,GAAG,OAAOj4B,EAAE,OAAO,KAAgB,GAAXA,EAAEA,EAAEq4B,OAAU,KAAO,EAAFU,IAAK,CAAC,IAAI5sB,EAAEnM,EAAEs4B,QAA+D,OAAvD,OAAOnsB,EAAEhW,EAAE1O,KAAK0O,GAAGA,EAAE1O,KAAK0kB,EAAE1kB,KAAK0kB,EAAE1kB,KAAK0O,GAAG6J,EAAEs4B,QAAQniC,EAAS2hC,GAAG5hC,EAAEuB,EAAE,CAAoF,OAAnE,QAAhB0U,EAAEnM,EAAE63B,cAAsB1hC,EAAE1O,KAAK0O,EAAEwhC,GAAG33B,KAAK7J,EAAE1O,KAAK0kB,EAAE1kB,KAAK0kB,EAAE1kB,KAAK0O,GAAG6J,EAAE63B,YAAY1hC,EAAS2hC,GAAG5hC,EAAEuB,EAAE,CAAC,SAASuhC,GAAG9iC,EAAEC,EAAEsB,GAAmB,GAAG,QAAnBtB,EAAEA,EAAE8hC,eAA0B9hC,EAAEA,EAAEkiC,OAAO,KAAO,QAAF5gC,IAAY,CAAC,IAAIuI,EAAE7J,EAAEkhC,MAAwB5/B,GAAlBuI,GAAG9J,EAAEkmB,aAAkBjmB,EAAEkhC,MAAM5/B,EAAEslB,GAAG7mB,EAAEuB,EAAE,CAAC,CACrZ,SAASwhC,GAAG/iC,EAAEC,GAAG,IAAIsB,EAAEvB,EAAE+hC,YAAYj4B,EAAE9J,EAAE4O,UAAU,GAAG,OAAO9E,GAAoBvI,KAAhBuI,EAAEA,EAAEi4B,aAAmB,CAAC,IAAI9rB,EAAE,KAAKxmB,EAAE,KAAyB,GAAG,QAAvB8R,EAAEA,EAAE0gC,iBAA4B,CAAC,EAAE,CAAC,IAAI/rB,EAAE,CAACssB,UAAUjhC,EAAEihC,UAAUC,KAAKlhC,EAAEkhC,KAAKjuB,IAAIjT,EAAEiT,IAAIkuB,QAAQnhC,EAAEmhC,QAAQC,SAASphC,EAAEohC,SAASpxC,KAAK,MAAM,OAAO9B,EAAEwmB,EAAExmB,EAAEymB,EAAEzmB,EAAEA,EAAE8B,KAAK2kB,EAAE3U,EAAEA,EAAEhQ,IAAI,OAAO,OAAOgQ,GAAG,OAAO9R,EAAEwmB,EAAExmB,EAAEwQ,EAAExQ,EAAEA,EAAE8B,KAAK0O,CAAC,MAAMgW,EAAExmB,EAAEwQ,EAAiH,OAA/GsB,EAAE,CAACygC,UAAUl4B,EAAEk4B,UAAUC,gBAAgBhsB,EAAEisB,eAAezyC,EAAE0yC,OAAOr4B,EAAEq4B,OAAOE,QAAQv4B,EAAEu4B,cAASriC,EAAE+hC,YAAYxgC,EAAQ,CAAoB,QAAnBvB,EAAEuB,EAAE2gC,gBAAwB3gC,EAAE0gC,gBAAgBhiC,EAAED,EAAEzO,KACnf0O,EAAEsB,EAAE2gC,eAAejiC,CAAC,CACpB,SAAS+iC,GAAGhjC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEjW,EAAE+hC,YAAYF,IAAG,EAAG,IAAIpyC,EAAEwmB,EAAEgsB,gBAAgB/rB,EAAED,EAAEisB,eAAehpB,EAAEjD,EAAEksB,OAAOC,QAAQ,GAAG,OAAOlpB,EAAE,CAACjD,EAAEksB,OAAOC,QAAQ,KAAK,IAAIhhC,EAAE8X,EAAED,EAAE7X,EAAE7P,KAAK6P,EAAE7P,KAAK,KAAK,OAAO2kB,EAAEzmB,EAAEwpB,EAAE/C,EAAE3kB,KAAK0nB,EAAE/C,EAAE9U,EAAE,IAAIhC,EAAEY,EAAE4O,UAAU,OAAOxP,KAAoB8Z,GAAhB9Z,EAAEA,EAAE2iC,aAAgBG,kBAAmBhsB,IAAI,OAAOgD,EAAE9Z,EAAE6iC,gBAAgBhpB,EAAEC,EAAE3nB,KAAK0nB,EAAE7Z,EAAE8iC,eAAe9gC,GAAG,CAAC,GAAG,OAAO3R,EAAE,CAAC,IAAIwzC,EAAEhtB,EAAE+rB,UAA6B,IAAnB9rB,EAAE,EAAE9W,EAAE6Z,EAAE7X,EAAE,KAAK8X,EAAEzpB,IAAI,CAAC,IAAI4R,EAAE6X,EAAEupB,KAAKhkC,EAAEya,EAAEspB,UAAU,IAAI14B,EAAEzI,KAAKA,EAAE,CAAC,OAAOjC,IAAIA,EAAEA,EAAE7N,KAAK,CAACixC,UAAU/jC,EAAEgkC,KAAK,EAAEjuB,IAAI0E,EAAE1E,IAAIkuB,QAAQxpB,EAAEwpB,QAAQC,SAASzpB,EAAEypB,SACvfpxC,KAAK,OAAOyO,EAAE,CAAC,IAAIyE,EAAEzE,EAAEsB,EAAE4X,EAAU,OAAR7X,EAAEpB,EAAExB,EAAE8C,EAASD,EAAEkT,KAAK,KAAK,EAAc,GAAG,oBAAf/P,EAAEnD,EAAEohC,SAAiC,CAACO,EAAEx+B,EAAE5S,KAAK4M,EAAEwkC,EAAE5hC,GAAG,MAAMrB,CAAC,CAACijC,EAAEx+B,EAAE,MAAMzE,EAAE,KAAK,EAAEyE,EAAEiL,OAAe,MAATjL,EAAEiL,MAAa,IAAI,KAAK,EAAsD,GAAG,QAA3CrO,EAAE,oBAAdoD,EAAEnD,EAAEohC,SAAgCj+B,EAAE5S,KAAK4M,EAAEwkC,EAAE5hC,GAAGoD,SAAe,IAASpD,EAAE,MAAMrB,EAAEijC,EAAEh6B,EAAE,CAAC,EAAEg6B,EAAE5hC,GAAG,MAAMrB,EAAE,KAAK,EAAE6hC,IAAG,EAAG,CAAC,OAAO3oB,EAAEypB,UAAU,IAAIzpB,EAAEupB,OAAOziC,EAAE0P,OAAO,GAAe,QAAZrO,EAAE4U,EAAEosB,SAAiBpsB,EAAEosB,QAAQ,CAACnpB,GAAG7X,EAAE5P,KAAKynB,GAAG,MAAMza,EAAE,CAAC+jC,UAAU/jC,EAAEgkC,KAAKphC,EAAEmT,IAAI0E,EAAE1E,IAAIkuB,QAAQxpB,EAAEwpB,QAAQC,SAASzpB,EAAEypB,SAASpxC,KAAK,MAAM,OAAO6N,GAAG6Z,EAAE7Z,EAAEX,EAAE2C,EAAE6hC,GAAG7jC,EAAEA,EAAE7N,KAAKkN,EAAEyX,GAAG7U,EAC3e,GAAG,QAAZ6X,EAAEA,EAAE3nB,MAAiB,IAAsB,QAAnB2nB,EAAEjD,EAAEksB,OAAOC,SAAiB,MAAelpB,GAAJ7X,EAAE6X,GAAM3nB,KAAK8P,EAAE9P,KAAK,KAAK0kB,EAAEisB,eAAe7gC,EAAE4U,EAAEksB,OAAOC,QAAQ,IAAI,EAAsG,GAA5F,OAAOhjC,IAAIgC,EAAE6hC,GAAGhtB,EAAE+rB,UAAU5gC,EAAE6U,EAAEgsB,gBAAgBhpB,EAAEhD,EAAEisB,eAAe9iC,EAA4B,QAA1Ba,EAAEgW,EAAEksB,OAAOR,aAAwB,CAAC1rB,EAAEhW,EAAE,GAAGiW,GAAGD,EAAEwsB,KAAKxsB,EAAEA,EAAE1kB,WAAW0kB,IAAIhW,EAAE,MAAM,OAAOxQ,IAAIwmB,EAAEksB,OAAOhB,MAAM,GAAG+B,IAAIhtB,EAAElW,EAAEmhC,MAAMjrB,EAAElW,EAAEyjB,cAAcwf,CAAC,CAAC,CAC9V,SAASE,GAAGnjC,EAAEC,EAAEsB,GAA8B,GAA3BvB,EAAEC,EAAEoiC,QAAQpiC,EAAEoiC,QAAQ,KAAQ,OAAOriC,EAAE,IAAIC,EAAE,EAAEA,EAAED,EAAE/O,OAAOgP,IAAI,CAAC,IAAI6J,EAAE9J,EAAEC,GAAGgW,EAAEnM,EAAE64B,SAAS,GAAG,OAAO1sB,EAAE,CAAqB,GAApBnM,EAAE64B,SAAS,KAAK74B,EAAEvI,EAAK,oBAAoB0U,EAAE,MAAM/hB,MAAMogB,EAAE,IAAI2B,IAAIA,EAAEpkB,KAAKiY,EAAE,CAAC,CAAC,CAAC,IAAIs5B,IAAI,IAAIjuB,EAAGkuB,WAAWC,KAAK,SAASC,GAAGvjC,EAAEC,EAAEsB,EAAEuI,GAA8BvI,EAAE,QAAXA,EAAEA,EAAEuI,EAAtB7J,EAAED,EAAEyjB,sBAAmC,IAASliB,EAAEtB,EAAEgJ,EAAE,CAAC,EAAEhJ,EAAEsB,GAAGvB,EAAEyjB,cAAcliB,EAAE,IAAIvB,EAAEmhC,QAAQnhC,EAAE+hC,YAAYC,UAAUzgC,EAAE,CAClX,IAAIiiC,GAAG,CAACC,UAAU,SAASzjC,GAAG,SAAOA,EAAEA,EAAE0jC,kBAAiBpgB,GAAGtjB,KAAKA,CAAI,EAAE2jC,gBAAgB,SAAS3jC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE0jC,gBAAgB,IAAI55B,EAAER,KAAI2M,EAAE2tB,GAAG5jC,GAAGvQ,EAAE8yC,GAAGz4B,EAAEmM,GAAGxmB,EAAEizC,QAAQziC,OAAE,IAASsB,GAAG,OAAOA,IAAI9R,EAAEkzC,SAASphC,GAAe,QAAZtB,EAAE2iC,GAAG5iC,EAAEvQ,EAAEwmB,MAAc4tB,GAAG5jC,EAAED,EAAEiW,EAAEnM,GAAGg5B,GAAG7iC,EAAED,EAAEiW,GAAG,EAAE6tB,oBAAoB,SAAS9jC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE0jC,gBAAgB,IAAI55B,EAAER,KAAI2M,EAAE2tB,GAAG5jC,GAAGvQ,EAAE8yC,GAAGz4B,EAAEmM,GAAGxmB,EAAE+kB,IAAI,EAAE/kB,EAAEizC,QAAQziC,OAAE,IAASsB,GAAG,OAAOA,IAAI9R,EAAEkzC,SAASphC,GAAe,QAAZtB,EAAE2iC,GAAG5iC,EAAEvQ,EAAEwmB,MAAc4tB,GAAG5jC,EAAED,EAAEiW,EAAEnM,GAAGg5B,GAAG7iC,EAAED,EAAEiW,GAAG,EAAE8tB,mBAAmB,SAAS/jC,EAAEC,GAAGD,EAAEA,EAAE0jC,gBAAgB,IAAIniC,EAAE+H,KAAIQ,EACnf85B,GAAG5jC,GAAGiW,EAAEssB,GAAGhhC,EAAEuI,GAAGmM,EAAEzB,IAAI,OAAE,IAASvU,GAAG,OAAOA,IAAIgW,EAAE0sB,SAAS1iC,GAAe,QAAZA,EAAE2iC,GAAG5iC,EAAEiW,EAAEnM,MAAc+5B,GAAG5jC,EAAED,EAAE8J,EAAEvI,GAAGuhC,GAAG7iC,EAAED,EAAE8J,GAAG,GAAG,SAASk6B,GAAGhkC,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,GAAiB,MAAM,oBAApBlW,EAAEA,EAAEiiB,WAAsCgiB,sBAAsBjkC,EAAEikC,sBAAsBn6B,EAAEra,EAAEymB,IAAGjW,EAAE1L,YAAW0L,EAAE1L,UAAU2vC,wBAAsB1P,GAAGjzB,EAAEuI,KAAK0qB,GAAGve,EAAExmB,GAAK,CAC1S,SAAS00C,GAAGnkC,EAAEC,EAAEsB,GAAG,IAAIuI,GAAE,EAAGmM,EAAE0mB,GAAOltC,EAAEwQ,EAAEmkC,YAA2W,MAA/V,kBAAkB30C,GAAG,OAAOA,EAAEA,EAAE4xC,GAAG5xC,IAAIwmB,EAAEknB,GAAGl9B,GAAG68B,GAAGF,GAAE7Y,QAAyBt0B,GAAGqa,EAAE,QAAtBA,EAAE7J,EAAE+8B,oBAA4B,IAASlzB,GAAGizB,GAAG/8B,EAAEiW,GAAG0mB,IAAI18B,EAAE,IAAIA,EAAEsB,EAAE9R,GAAGuQ,EAAEyjB,cAAc,OAAOxjB,EAAEsI,YAAO,IAAStI,EAAEsI,MAAMtI,EAAEsI,MAAM,KAAKtI,EAAEokC,QAAQb,GAAGxjC,EAAEiiB,UAAUhiB,EAAEA,EAAEyjC,gBAAgB1jC,EAAE8J,KAAI9J,EAAEA,EAAEiiB,WAAYgb,4CAA4ChnB,EAAEjW,EAAEk9B,0CAA0CztC,GAAUwQ,CAAC,CAC5Z,SAASqkC,GAAGtkC,EAAEC,EAAEsB,EAAEuI,GAAG9J,EAAEC,EAAEsI,MAAM,oBAAoBtI,EAAEskC,2BAA2BtkC,EAAEskC,0BAA0BhjC,EAAEuI,GAAG,oBAAoB7J,EAAEukC,kCAAkCvkC,EAAEukC,iCAAiCjjC,EAAEuI,GAAG7J,EAAEsI,QAAQvI,GAAGwjC,GAAGM,oBAAoB7jC,EAAEA,EAAEsI,MAAM,KAAK,CACpQ,SAASk8B,GAAGzkC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEjW,EAAEiiB,UAAUhM,EAAEyuB,MAAMnjC,EAAE0U,EAAE1N,MAAMvI,EAAEyjB,cAAcxN,EAAEqtB,KAAKF,GAAGtB,GAAG9hC,GAAG,IAAIvQ,EAAEwQ,EAAEmkC,YAAY,kBAAkB30C,GAAG,OAAOA,EAAEwmB,EAAEqrB,QAAQD,GAAG5xC,IAAIA,EAAE0tC,GAAGl9B,GAAG68B,GAAGF,GAAE7Y,QAAQ9N,EAAEqrB,QAAQvE,GAAG/8B,EAAEvQ,IAAIwmB,EAAE1N,MAAMvI,EAAEyjB,cAA2C,oBAA7Bh0B,EAAEwQ,EAAE0kC,4BAAiDpB,GAAGvjC,EAAEC,EAAExQ,EAAE8R,GAAG0U,EAAE1N,MAAMvI,EAAEyjB,eAAe,oBAAoBxjB,EAAE0kC,0BAA0B,oBAAoB1uB,EAAE2uB,yBAAyB,oBAAoB3uB,EAAE4uB,2BAA2B,oBAAoB5uB,EAAE6uB,qBAAqB7kC,EAAEgW,EAAE1N,MACrf,oBAAoB0N,EAAE6uB,oBAAoB7uB,EAAE6uB,qBAAqB,oBAAoB7uB,EAAE4uB,2BAA2B5uB,EAAE4uB,4BAA4B5kC,IAAIgW,EAAE1N,OAAOi7B,GAAGM,oBAAoB7tB,EAAEA,EAAE1N,MAAM,MAAMy6B,GAAGhjC,EAAEuB,EAAE0U,EAAEnM,GAAGmM,EAAE1N,MAAMvI,EAAEyjB,eAAe,oBAAoBxN,EAAE8uB,oBAAoB/kC,EAAE0P,OAAO,QAAQ,CACpS,SAASs1B,GAAGhlC,EAAEC,EAAEsB,GAAW,GAAG,QAAXvB,EAAEuB,EAAE0jC,MAAiB,oBAAoBjlC,GAAG,kBAAkBA,EAAE,CAAC,GAAGuB,EAAE2jC,OAAO,CAAY,GAAX3jC,EAAEA,EAAE2jC,OAAY,CAAC,GAAG,IAAI3jC,EAAEiT,IAAI,MAAMtgB,MAAMogB,EAAE,MAAM,IAAIxK,EAAEvI,EAAE0gB,SAAS,CAAC,IAAInY,EAAE,MAAM5V,MAAMogB,EAAE,IAAItU,IAAI,IAAIiW,EAAEnM,EAAEra,EAAE,GAAGuQ,EAAE,OAAG,OAAOC,GAAG,OAAOA,EAAEglC,KAAK,oBAAoBhlC,EAAEglC,KAAKhlC,EAAEglC,IAAIE,aAAa11C,EAASwQ,EAAEglC,KAAIhlC,EAAE,SAASD,GAAG,IAAIC,EAAEgW,EAAEqtB,KAAKrjC,IAAImjC,KAAKnjC,EAAEgW,EAAEqtB,KAAK,CAAC,GAAG,OAAOtjC,SAASC,EAAExQ,GAAGwQ,EAAExQ,GAAGuQ,CAAC,EAAEC,EAAEklC,WAAW11C,EAASwQ,EAAC,CAAC,GAAG,kBAAkBD,EAAE,MAAM9L,MAAMogB,EAAE,MAAM,IAAI/S,EAAE2jC,OAAO,MAAMhxC,MAAMogB,EAAE,IAAItU,GAAI,CAAC,OAAOA,CAAC,CACre,SAASolC,GAAGplC,EAAEC,GAAuC,MAApCD,EAAE5F,OAAO7F,UAAUkB,SAAS5D,KAAKoO,GAAS/L,MAAMogB,EAAE,GAAG,oBAAoBtU,EAAE,qBAAqB5F,OAAOyM,KAAK5G,GAAGvK,KAAK,MAAM,IAAIsK,GAAI,CAAC,SAASqlC,GAAGrlC,GAAiB,OAAOC,EAAfD,EAAE2Z,OAAe3Z,EAAE0Z,SAAS,CACrM,SAAS4rB,GAAGtlC,GAAG,SAASC,EAAEA,EAAEsB,GAAG,GAAGvB,EAAE,CAAC,IAAI8J,EAAE7J,EAAEo/B,UAAU,OAAOv1B,GAAG7J,EAAEo/B,UAAU,CAAC99B,GAAGtB,EAAEyP,OAAO,IAAI5F,EAAErY,KAAK8P,EAAE,CAAC,CAAC,SAASA,EAAEA,EAAEuI,GAAG,IAAI9J,EAAE,OAAO,KAAK,KAAK,OAAO8J,GAAG7J,EAAEsB,EAAEuI,GAAGA,EAAEA,EAAEga,QAAQ,OAAO,IAAI,CAAC,SAASha,EAAE9J,EAAEC,GAAG,IAAID,EAAE,IAAI0nB,IAAI,OAAOznB,GAAG,OAAOA,EAAEpC,IAAImC,EAAEnQ,IAAIoQ,EAAEpC,IAAIoC,GAAGD,EAAEnQ,IAAIoQ,EAAE7J,MAAM6J,GAAGA,EAAEA,EAAE6jB,QAAQ,OAAO9jB,CAAC,CAAC,SAASiW,EAAEjW,EAAEC,GAAsC,OAAnCD,EAAEulC,GAAGvlC,EAAEC,IAAK7J,MAAM,EAAE4J,EAAE8jB,QAAQ,KAAY9jB,CAAC,CAAC,SAASvQ,EAAEwQ,EAAEsB,EAAEuI,GAAa,OAAV7J,EAAE7J,MAAM0T,EAAM9J,EAA6C,QAAjB8J,EAAE7J,EAAE2O,YAA6B9E,EAAEA,EAAE1T,OAAQmL,GAAGtB,EAAEyP,OAAO,EAAEnO,GAAGuI,GAAE7J,EAAEyP,OAAO,EAASnO,IAArGtB,EAAEyP,OAAO,QAAQnO,EAAqF,CAAC,SAAS2U,EAAEjW,GACzd,OAD4dD,GAC7f,OAAOC,EAAE2O,YAAY3O,EAAEyP,OAAO,GAAUzP,CAAC,CAAC,SAASiZ,EAAElZ,EAAEC,EAAEsB,EAAEuI,GAAG,OAAG,OAAO7J,GAAG,IAAIA,EAAEuU,MAAWvU,EAAEulC,GAAGjkC,EAAEvB,EAAE4/B,KAAK91B,IAAKyZ,OAAOvjB,EAAEC,KAAEA,EAAEgW,EAAEhW,EAAEsB,IAAKgiB,OAAOvjB,EAASC,EAAC,CAAC,SAASmB,EAAEpB,EAAEC,EAAEsB,EAAEuI,GAAG,IAAIra,EAAE8R,EAAE2T,KAAK,OAAGzlB,IAAIkoB,EAAUvY,EAAEY,EAAEC,EAAEsB,EAAEmjC,MAAMzoB,SAASnS,EAAEvI,EAAE1D,KAAQ,OAAOoC,IAAIA,EAAEm/B,cAAc3vC,GAAG,kBAAkBA,GAAG,OAAOA,GAAGA,EAAE+pB,WAAWpB,GAAIitB,GAAG51C,KAAKwQ,EAAEiV,QAAapL,EAAEmM,EAAEhW,EAAEsB,EAAEmjC,QAASO,IAAID,GAAGhlC,EAAEC,EAAEsB,GAAGuI,EAAEyZ,OAAOvjB,EAAE8J,KAAEA,EAAE27B,GAAGlkC,EAAE2T,KAAK3T,EAAE1D,IAAI0D,EAAEmjC,MAAM,KAAK1kC,EAAE4/B,KAAK91B,IAAKm7B,IAAID,GAAGhlC,EAAEC,EAAEsB,GAAGuI,EAAEyZ,OAAOvjB,EAAS8J,EAAC,CAAC,SAASmP,EAAEjZ,EAAEC,EAAEsB,EAAEuI,GAAG,OAAG,OAAO7J,GAAG,IAAIA,EAAEuU,KACjfvU,EAAEgiB,UAAU0G,gBAAgBpnB,EAAEonB,eAAe1oB,EAAEgiB,UAAUyjB,iBAAiBnkC,EAAEmkC,iBAAsBzlC,EAAE0lC,GAAGpkC,EAAEvB,EAAE4/B,KAAK91B,IAAKyZ,OAAOvjB,EAAEC,KAAEA,EAAEgW,EAAEhW,EAAEsB,EAAE0a,UAAU,KAAMsH,OAAOvjB,EAASC,EAAC,CAAC,SAASb,EAAEY,EAAEC,EAAEsB,EAAEuI,EAAEra,GAAG,OAAG,OAAOwQ,GAAG,IAAIA,EAAEuU,MAAWvU,EAAE2lC,GAAGrkC,EAAEvB,EAAE4/B,KAAK91B,EAAEra,IAAK8zB,OAAOvjB,EAAEC,KAAEA,EAAEgW,EAAEhW,EAAEsB,IAAKgiB,OAAOvjB,EAASC,EAAC,CAAC,SAASgjC,EAAEjjC,EAAEC,EAAEsB,GAAG,GAAG,kBAAkBtB,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAOA,EAAEulC,GAAG,GAAGvlC,EAAED,EAAE4/B,KAAKr+B,IAAKgiB,OAAOvjB,EAAEC,EAAE,GAAG,kBAAkBA,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAEuZ,UAAU,KAAKhC,EAAG,OAAOjW,EAAEkkC,GAAGxlC,EAAEiV,KAAKjV,EAAEpC,IAAIoC,EAAEykC,MAAM,KAAK1kC,EAAE4/B,KAAKr+B,IACjf0jC,IAAID,GAAGhlC,EAAE,KAAKC,GAAGsB,EAAEgiB,OAAOvjB,EAAEuB,EAAE,KAAKmW,EAAG,OAAOzX,EAAE0lC,GAAG1lC,EAAED,EAAE4/B,KAAKr+B,IAAKgiB,OAAOvjB,EAAEC,EAAE,KAAKmY,EAAiB,OAAO6qB,EAAEjjC,GAAE8J,EAAnB7J,EAAE0Z,OAAmB1Z,EAAEyZ,UAAUnY,GAAG,GAAGma,GAAGzb,IAAIsY,EAAGtY,GAAG,OAAOA,EAAE2lC,GAAG3lC,EAAED,EAAE4/B,KAAKr+B,EAAE,OAAQgiB,OAAOvjB,EAAEC,EAAEmlC,GAAGplC,EAAEC,EAAE,CAAC,OAAO,IAAI,CAAC,SAASoB,EAAErB,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAE,OAAOhW,EAAEA,EAAEpC,IAAI,KAAK,GAAG,kBAAkB0D,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAO,OAAO0U,EAAE,KAAKiD,EAAElZ,EAAEC,EAAE,GAAGsB,EAAEuI,GAAG,GAAG,kBAAkBvI,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAEiY,UAAU,KAAKhC,EAAG,OAAOjW,EAAE1D,MAAMoY,EAAE7U,EAAEpB,EAAEC,EAAEsB,EAAEuI,GAAG,KAAK,KAAK4N,EAAG,OAAOnW,EAAE1D,MAAMoY,EAAEgD,EAAEjZ,EAAEC,EAAEsB,EAAEuI,GAAG,KAAK,KAAKsO,EAAG,OAAiB/W,EAAErB,EACpfC,GADwegW,EAAE1U,EAAEoY,OACxepY,EAAEmY,UAAU5P,GAAG,GAAG4R,GAAGna,IAAIgX,EAAGhX,GAAG,OAAO,OAAO0U,EAAE,KAAK7W,EAAEY,EAAEC,EAAEsB,EAAEuI,EAAE,MAAMs7B,GAAGplC,EAAEuB,EAAE,CAAC,OAAO,IAAI,CAAC,SAAS9C,EAAEuB,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,GAAG,kBAAkBnM,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAwBoP,EAAEjZ,EAAnBD,EAAEA,EAAEzQ,IAAIgS,IAAI,KAAW,GAAGuI,EAAEmM,GAAG,GAAG,kBAAkBnM,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAE0P,UAAU,KAAKhC,EAAG,OAA2CpW,EAAEnB,EAAtCD,EAAEA,EAAEzQ,IAAI,OAAOua,EAAEjM,IAAI0D,EAAEuI,EAAEjM,MAAM,KAAWiM,EAAEmM,GAAG,KAAKyB,EAAG,OAA2CuB,EAAEhZ,EAAtCD,EAAEA,EAAEzQ,IAAI,OAAOua,EAAEjM,IAAI0D,EAAEuI,EAAEjM,MAAM,KAAWiM,EAAEmM,GAAG,KAAKmC,EAAiB,OAAO3Z,EAAEuB,EAAEC,EAAEsB,GAAE9R,EAAvBqa,EAAE6P,OAAuB7P,EAAE4P,UAAUzD,GAAG,GAAGyF,GAAG5R,IAAIyO,EAAGzO,GAAG,OAAwB1K,EAAEa,EAAnBD,EAAEA,EAAEzQ,IAAIgS,IAAI,KAAWuI,EAAEmM,EAAE,MAAMmvB,GAAGnlC,EAAE6J,EAAE,CAAC,OAAO,IAAI,CAC9f,SAASrF,EAAEwR,EAAEC,EAAEgD,EAAE9X,GAAG,IAAI,IAAI6X,EAAE,KAAK7Z,EAAE,KAAKoF,EAAE0R,EAAEhT,EAAEgT,EAAE,EAAE/lB,EAAE,KAAK,OAAOqU,GAAGtB,EAAEgW,EAAEjoB,OAAOiS,IAAI,CAACsB,EAAEpO,MAAM8M,GAAG/S,EAAEqU,EAAEA,EAAE,MAAMrU,EAAEqU,EAAEsf,QAAQ,IAAIrf,EAAEpD,EAAE4U,EAAEzR,EAAE0U,EAAEhW,GAAG9B,GAAG,GAAG,OAAOqD,EAAE,CAAC,OAAOD,IAAIA,EAAErU,GAAG,KAAK,CAAC6P,GAAGwE,GAAG,OAAOC,EAAEmK,WAAW3O,EAAEgW,EAAEzR,GAAG0R,EAAEzmB,EAAEgV,EAAEyR,EAAEhT,GAAG,OAAO9D,EAAE6Z,EAAExU,EAAErF,EAAE0kB,QAAQrf,EAAErF,EAAEqF,EAAED,EAAErU,CAAC,CAAC,GAAG+S,IAAIgW,EAAEjoB,OAAO,OAAOsQ,EAAE0U,EAAEzR,GAAGw6B,IAAGN,GAAGzoB,EAAE/S,GAAG+V,EAAE,GAAG,OAAOzU,EAAE,CAAC,KAAKtB,EAAEgW,EAAEjoB,OAAOiS,IAAkB,QAAdsB,EAAEy+B,EAAEhtB,EAAEiD,EAAEhW,GAAG9B,MAAc8U,EAAEzmB,EAAE+U,EAAE0R,EAAEhT,GAAG,OAAO9D,EAAE6Z,EAAEzU,EAAEpF,EAAE0kB,QAAQtf,EAAEpF,EAAEoF,GAAc,OAAXw6B,IAAGN,GAAGzoB,EAAE/S,GAAU+V,CAAC,CAAC,IAAIzU,EAAEsF,EAAEmM,EAAEzR,GAAGtB,EAAEgW,EAAEjoB,OAAOiS,IAAsB,QAAlB/S,EAAEsO,EAAE+F,EAAEyR,EAAE/S,EAAEgW,EAAEhW,GAAG9B,MAAcpB,GAAG,OAAO7P,EAAEye,WAAWpK,EAAEujB,OAAO,OACvf53B,EAAE0N,IAAIqF,EAAE/S,EAAE0N,KAAKqY,EAAEzmB,EAAEU,EAAE+lB,EAAEhT,GAAG,OAAO9D,EAAE6Z,EAAE9oB,EAAEiP,EAAE0kB,QAAQ3zB,EAAEiP,EAAEjP,GAAuD,OAApD6P,GAAGwE,EAAEmS,SAAQ,SAAS3W,GAAG,OAAOC,EAAEgW,EAAEjW,EAAE,IAAGg/B,IAAGN,GAAGzoB,EAAE/S,GAAU+V,CAAC,CAAC,SAAS3X,EAAE2U,EAAEC,EAAEgD,EAAE9X,GAAG,IAAI6X,EAAEV,EAAGW,GAAG,GAAG,oBAAoBD,EAAE,MAAM/kB,MAAMogB,EAAE,MAAkB,GAAG,OAAf4E,EAAED,EAAEpnB,KAAKqnB,IAAc,MAAMhlB,MAAMogB,EAAE,MAAM,IAAI,IAAI9P,EAAEyU,EAAE,KAAK7Z,EAAE8W,EAAEhT,EAAEgT,EAAE,EAAE/lB,EAAE,KAAKsU,EAAEyU,EAAE3nB,OAAO,OAAO6N,IAAIqF,EAAEjT,KAAK0R,IAAIuB,EAAEyU,EAAE3nB,OAAO,CAAC6N,EAAEhJ,MAAM8M,GAAG/S,EAAEiP,EAAEA,EAAE,MAAMjP,EAAEiP,EAAE0kB,QAAQ,IAAIxiB,EAAED,EAAE4U,EAAE7W,EAAEqF,EAAE7U,MAAMwR,GAAG,GAAG,OAAOE,EAAE,CAAC,OAAOlC,IAAIA,EAAEjP,GAAG,KAAK,CAAC6P,GAAGZ,GAAG,OAAOkC,EAAEsN,WAAW3O,EAAEgW,EAAE7W,GAAG8W,EAAEzmB,EAAE6R,EAAE4U,EAAEhT,GAAG,OAAOsB,EAAEyU,EAAE3X,EAAEkD,EAAEsf,QAAQxiB,EAAEkD,EAAElD,EAAElC,EAAEjP,CAAC,CAAC,GAAGsU,EAAEjT,KAAK,OAAO+P,EAAE0U,EACzf7W,GAAG4/B,IAAGN,GAAGzoB,EAAE/S,GAAG+V,EAAE,GAAG,OAAO7Z,EAAE,CAAC,MAAMqF,EAAEjT,KAAK0R,IAAIuB,EAAEyU,EAAE3nB,OAAwB,QAAjBkT,EAAEw+B,EAAEhtB,EAAExR,EAAE7U,MAAMwR,MAAc8U,EAAEzmB,EAAEgV,EAAEyR,EAAEhT,GAAG,OAAOsB,EAAEyU,EAAExU,EAAED,EAAEsf,QAAQrf,EAAED,EAAEC,GAAc,OAAXu6B,IAAGN,GAAGzoB,EAAE/S,GAAU+V,CAAC,CAAC,IAAI7Z,EAAE0K,EAAEmM,EAAE7W,IAAIqF,EAAEjT,KAAK0R,IAAIuB,EAAEyU,EAAE3nB,OAA4B,QAArBkT,EAAEhG,EAAEW,EAAE6W,EAAE/S,EAAEuB,EAAE7U,MAAMwR,MAAcpB,GAAG,OAAOyE,EAAEmK,WAAWxP,EAAE2oB,OAAO,OAAOtjB,EAAE5G,IAAIqF,EAAEuB,EAAE5G,KAAKqY,EAAEzmB,EAAEgV,EAAEyR,EAAEhT,GAAG,OAAOsB,EAAEyU,EAAExU,EAAED,EAAEsf,QAAQrf,EAAED,EAAEC,GAAuD,OAApDzE,GAAGZ,EAAEuX,SAAQ,SAAS3W,GAAG,OAAOC,EAAEgW,EAAEjW,EAAE,IAAGg/B,IAAGN,GAAGzoB,EAAE/S,GAAU+V,CAAC,CAG3T,OAH4T,SAASwgB,EAAEz5B,EAAE8J,EAAEra,EAAEypB,GAAkF,GAA/E,kBAAkBzpB,GAAG,OAAOA,GAAGA,EAAEylB,OAAOyC,GAAI,OAAOloB,EAAEoO,MAAMpO,EAAEA,EAAEi1C,MAAMzoB,UAAa,kBAAkBxsB,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAE+pB,UAAU,KAAKhC,EAAGxX,EAAE,CAAC,IAAI,IAAIoB,EAC7hB3R,EAAEoO,IAAIob,EAAEnP,EAAE,OAAOmP,GAAG,CAAC,GAAGA,EAAEpb,MAAMuD,EAAE,CAAU,IAATA,EAAE3R,EAAEylB,QAAYyC,GAAI,GAAG,IAAIsB,EAAEzE,IAAI,CAACjT,EAAEvB,EAAEiZ,EAAE6K,UAASha,EAAEmM,EAAEgD,EAAExpB,EAAEi1C,MAAMzoB,WAAYsH,OAAOvjB,EAAEA,EAAE8J,EAAE,MAAM9J,CAAC,OAAO,GAAGiZ,EAAEmmB,cAAch+B,GAAG,kBAAkBA,GAAG,OAAOA,GAAGA,EAAEoY,WAAWpB,GAAIitB,GAAGjkC,KAAK6X,EAAE/D,KAAK,CAAC3T,EAAEvB,EAAEiZ,EAAE6K,UAASha,EAAEmM,EAAEgD,EAAExpB,EAAEi1C,QAASO,IAAID,GAAGhlC,EAAEiZ,EAAExpB,GAAGqa,EAAEyZ,OAAOvjB,EAAEA,EAAE8J,EAAE,MAAM9J,CAAC,CAACuB,EAAEvB,EAAEiZ,GAAG,KAAK,CAAMhZ,EAAED,EAAEiZ,GAAGA,EAAEA,EAAE6K,OAAO,CAACr0B,EAAEylB,OAAOyC,IAAI7N,EAAE87B,GAAGn2C,EAAEi1C,MAAMzoB,SAASjc,EAAE4/B,KAAK1mB,EAAEzpB,EAAEoO,MAAO0lB,OAAOvjB,EAAEA,EAAE8J,KAAIoP,EAAEusB,GAAGh2C,EAAEylB,KAAKzlB,EAAEoO,IAAIpO,EAAEi1C,MAAM,KAAK1kC,EAAE4/B,KAAK1mB,IAAK+rB,IAAID,GAAGhlC,EAAE8J,EAAEra,GAAGypB,EAAEqK,OAAOvjB,EAAEA,EAAEkZ,EAAE,CAAC,OAAOhD,EAAElW,GAAG,KAAK0X,EAAG1X,EAAE,CAAC,IAAIiZ,EAAExpB,EAAEoO,IAAI,OACzfiM,GAAG,CAAC,GAAGA,EAAEjM,MAAMob,EAAC,CAAC,GAAG,IAAInP,EAAE0K,KAAK1K,EAAEmY,UAAU0G,gBAAgBl5B,EAAEk5B,eAAe7e,EAAEmY,UAAUyjB,iBAAiBj2C,EAAEi2C,eAAe,CAACnkC,EAAEvB,EAAE8J,EAAEga,UAASha,EAAEmM,EAAEnM,EAAEra,EAAEwsB,UAAU,KAAMsH,OAAOvjB,EAAEA,EAAE8J,EAAE,MAAM9J,CAAC,CAAMuB,EAAEvB,EAAE8J,GAAG,KAAM,CAAK7J,EAAED,EAAE8J,GAAGA,EAAEA,EAAEga,OAAO,EAACha,EAAE67B,GAAGl2C,EAAEuQ,EAAE4/B,KAAK1mB,IAAKqK,OAAOvjB,EAAEA,EAAE8J,CAAC,CAAC,OAAOoM,EAAElW,GAAG,KAAKoY,EAAG,OAAiBqhB,EAAEz5B,EAAE8J,GAAdmP,EAAExpB,EAAEkqB,OAAclqB,EAAEiqB,UAAUR,GAAG,GAAGwC,GAAGjsB,GAAG,OAAOgV,EAAEzE,EAAE8J,EAAEra,EAAEypB,GAAG,GAAGX,EAAG9oB,GAAG,OAAO6R,EAAEtB,EAAE8J,EAAEra,EAAEypB,GAAGksB,GAAGplC,EAAEvQ,EAAE,CAAC,MAAM,kBAAkBA,GAAG,KAAKA,GAAG,kBAAkBA,GAAGA,EAAE,GAAGA,EAAE,OAAOqa,GAAG,IAAIA,EAAE0K,KAAKjT,EAAEvB,EAAE8J,EAAEga,UAASha,EAAEmM,EAAEnM,EAAEra,IAAK8zB,OAAOvjB,EAAEA,EAAE8J,IACnfvI,EAAEvB,EAAE8J,IAAGA,EAAE07B,GAAG/1C,EAAEuQ,EAAE4/B,KAAK1mB,IAAKqK,OAAOvjB,EAAEA,EAAE8J,GAAGoM,EAAElW,IAAIuB,EAAEvB,EAAE8J,EAAE,CAAS,CAAC,IAAI+7B,GAAGP,IAAG,GAAIQ,GAAGR,IAAG,GAAIS,GAAG,CAAC,EAAEC,GAAGxJ,GAAGuJ,IAAIE,GAAGzJ,GAAGuJ,IAAIG,GAAG1J,GAAGuJ,IAAI,SAASI,GAAGnmC,GAAG,GAAGA,IAAI+lC,GAAG,MAAM7xC,MAAMogB,EAAE,MAAM,OAAOtU,CAAC,CAAC,SAASomC,GAAGpmC,EAAEC,GAAyC,OAAtCy8B,GAAEwJ,GAAGjmC,GAAGy8B,GAAEuJ,GAAGjmC,GAAG08B,GAAEsJ,GAAGD,IAAI/lC,EAAEC,EAAEid,UAAmB,KAAK,EAAE,KAAK,GAAGjd,GAAGA,EAAEA,EAAEw1B,iBAAiBx1B,EAAEwc,aAAatc,GAAG,KAAK,IAAI,MAAM,QAAkEF,EAAEE,GAArCF,GAAvBD,EAAE,IAAIA,EAAEC,EAAE0hB,WAAW1hB,GAAMwc,cAAc,KAAKzc,EAAEA,EAAEqmC,SAAkB5J,GAAEuJ,IAAItJ,GAAEsJ,GAAG/lC,EAAE,CAAC,SAASqmC,KAAK7J,GAAEuJ,IAAIvJ,GAAEwJ,IAAIxJ,GAAEyJ,GAAG,CACnb,SAASK,GAAGvmC,GAAGmmC,GAAGD,GAAGniB,SAAS,IAAI9jB,EAAEkmC,GAAGH,GAAGjiB,SAAaxiB,EAAEpB,GAAGF,EAAED,EAAEkV,MAAMjV,IAAIsB,IAAIm7B,GAAEuJ,GAAGjmC,GAAG08B,GAAEsJ,GAAGzkC,GAAG,CAAC,SAASilC,GAAGxmC,GAAGimC,GAAGliB,UAAU/jB,IAAIy8B,GAAEuJ,IAAIvJ,GAAEwJ,IAAI,CAAC,IAAI/6B,GAAEsxB,GAAG,GACrJ,SAASiK,GAAGzmC,GAAG,IAAI,IAAIC,EAAED,EAAE,OAAOC,GAAG,CAAC,GAAG,KAAKA,EAAEuU,IAAI,CAAC,IAAIjT,EAAEtB,EAAEwjB,cAAc,GAAG,OAAOliB,IAAmB,QAAfA,EAAEA,EAAEmiB,aAAqB,OAAOniB,EAAEpJ,MAAM,OAAOoJ,EAAEpJ,MAAM,OAAO8H,CAAC,MAAM,GAAG,KAAKA,EAAEuU,UAAK,IAASvU,EAAE+/B,cAAc0G,aAAa,GAAG,KAAa,IAARzmC,EAAEyP,OAAW,OAAOzP,OAAO,GAAG,OAAOA,EAAE4jB,MAAM,CAAC5jB,EAAE4jB,MAAMN,OAAOtjB,EAAEA,EAAEA,EAAE4jB,MAAM,QAAQ,CAAC,GAAG5jB,IAAID,EAAE,MAAM,KAAK,OAAOC,EAAE6jB,SAAS,CAAC,GAAG,OAAO7jB,EAAEsjB,QAAQtjB,EAAEsjB,SAASvjB,EAAE,OAAO,KAAKC,EAAEA,EAAEsjB,MAAM,CAACtjB,EAAE6jB,QAAQP,OAAOtjB,EAAEsjB,OAAOtjB,EAAEA,EAAE6jB,OAAO,CAAC,OAAO,IAAI,CAAC,IAAI6iB,GAAG,GACrc,SAASC,KAAK,IAAI,IAAI5mC,EAAE,EAAEA,EAAE2mC,GAAG11C,OAAO+O,IAAI2mC,GAAG3mC,GAAG6mC,8BAA8B,KAAKF,GAAG11C,OAAO,CAAC,CAAC,IAAI61C,GAAGxvB,EAAGyvB,uBAAuBC,GAAG1vB,EAAG+R,wBAAwB4d,GAAG,EAAElxC,GAAE,KAAKmxC,GAAE,KAAKC,GAAE,KAAKC,IAAG,EAAGC,IAAG,EAAGC,GAAG,EAAEC,GAAG,EAAE,SAASC,KAAI,MAAMtzC,MAAMogB,EAAE,KAAM,CAAC,SAASmzB,GAAGznC,EAAEC,GAAG,GAAG,OAAOA,EAAE,OAAM,EAAG,IAAI,IAAIsB,EAAE,EAAEA,EAAEtB,EAAEhP,QAAQsQ,EAAEvB,EAAE/O,OAAOsQ,IAAI,IAAIgzB,GAAGv0B,EAAEuB,GAAGtB,EAAEsB,IAAI,OAAM,EAAG,OAAM,CAAE,CAChW,SAASmmC,GAAG1nC,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,GAAyH,GAAtHw3C,GAAGx3C,EAAEsG,GAAEkK,EAAEA,EAAEwjB,cAAc,KAAKxjB,EAAE8hC,YAAY,KAAK9hC,EAAEkhC,MAAM,EAAE2F,GAAG/iB,QAAQ,OAAO/jB,GAAG,OAAOA,EAAEyjB,cAAckkB,GAAGC,GAAG5nC,EAAEuB,EAAEuI,EAAEmM,GAAMoxB,GAAG,CAAC53C,EAAE,EAAE,EAAE,CAAY,GAAX43C,IAAG,EAAGC,GAAG,EAAK,IAAI73C,EAAE,MAAMyE,MAAMogB,EAAE,MAAM7kB,GAAG,EAAE03C,GAAED,GAAE,KAAKjnC,EAAE8hC,YAAY,KAAK+E,GAAG/iB,QAAQ8jB,GAAG7nC,EAAEuB,EAAEuI,EAAEmM,EAAE,OAAOoxB,GAAG,CAA+D,GAA9DP,GAAG/iB,QAAQ+jB,GAAG7nC,EAAE,OAAOinC,IAAG,OAAOA,GAAE31C,KAAK01C,GAAG,EAAEE,GAAED,GAAEnxC,GAAE,KAAKqxC,IAAG,EAAMnnC,EAAE,MAAM/L,MAAMogB,EAAE,MAAM,OAAOtU,CAAC,CAAC,SAAS+nC,KAAK,IAAI/nC,EAAE,IAAIsnC,GAAQ,OAALA,GAAG,EAAStnC,CAAC,CAC/Y,SAASgoC,KAAK,IAAIhoC,EAAE,CAACyjB,cAAc,KAAKue,UAAU,KAAKiG,UAAU,KAAKC,MAAM,KAAK32C,KAAK,MAA8C,OAAxC,OAAO41C,GAAEpxC,GAAE0tB,cAAc0jB,GAAEnnC,EAAEmnC,GAAEA,GAAE51C,KAAKyO,EAASmnC,EAAC,CAAC,SAASgB,KAAK,GAAG,OAAOjB,GAAE,CAAC,IAAIlnC,EAAEjK,GAAE6Y,UAAU5O,EAAE,OAAOA,EAAEA,EAAEyjB,cAAc,IAAI,MAAMzjB,EAAEknC,GAAE31C,KAAK,IAAI0O,EAAE,OAAOknC,GAAEpxC,GAAE0tB,cAAc0jB,GAAE51C,KAAK,GAAG,OAAO0O,EAAEknC,GAAElnC,EAAEinC,GAAElnC,MAAM,CAAC,GAAG,OAAOA,EAAE,MAAM9L,MAAMogB,EAAE,MAAUtU,EAAE,CAACyjB,eAAPyjB,GAAElnC,GAAqByjB,cAAcue,UAAUkF,GAAElF,UAAUiG,UAAUf,GAAEe,UAAUC,MAAMhB,GAAEgB,MAAM32C,KAAK,MAAM,OAAO41C,GAAEpxC,GAAE0tB,cAAc0jB,GAAEnnC,EAAEmnC,GAAEA,GAAE51C,KAAKyO,CAAC,CAAC,OAAOmnC,EAAC,CACje,SAASiB,GAAGpoC,EAAEC,GAAG,MAAM,oBAAoBA,EAAEA,EAAED,GAAGC,CAAC,CACnD,SAASooC,GAAGroC,GAAG,IAAIC,EAAEkoC,KAAK5mC,EAAEtB,EAAEioC,MAAM,GAAG,OAAO3mC,EAAE,MAAMrN,MAAMogB,EAAE,MAAM/S,EAAE+mC,oBAAoBtoC,EAAE,IAAI8J,EAAEo9B,GAAEjxB,EAAEnM,EAAEm+B,UAAUx4C,EAAE8R,EAAE6gC,QAAQ,GAAG,OAAO3yC,EAAE,CAAC,GAAG,OAAOwmB,EAAE,CAAC,IAAIC,EAAED,EAAE1kB,KAAK0kB,EAAE1kB,KAAK9B,EAAE8B,KAAK9B,EAAE8B,KAAK2kB,CAAC,CAACpM,EAAEm+B,UAAUhyB,EAAExmB,EAAE8R,EAAE6gC,QAAQ,IAAI,CAAC,GAAG,OAAOnsB,EAAE,CAACxmB,EAAEwmB,EAAE1kB,KAAKuY,EAAEA,EAAEk4B,UAAU,IAAI9oB,EAAEhD,EAAE,KAAK9U,EAAE,KAAK6X,EAAExpB,EAAE,EAAE,CAAC,IAAI2P,EAAE6Z,EAAEwpB,KAAK,IAAIwE,GAAG7nC,KAAKA,EAAE,OAAOgC,IAAIA,EAAEA,EAAE7P,KAAK,CAACkxC,KAAK,EAAE8F,OAAOtvB,EAAEsvB,OAAOC,cAAcvvB,EAAEuvB,cAAcC,WAAWxvB,EAAEwvB,WAAWl3C,KAAK,OAAOuY,EAAEmP,EAAEuvB,cAAcvvB,EAAEwvB,WAAWzoC,EAAE8J,EAAEmP,EAAEsvB,YAAY,CAAC,IAAItF,EAAE,CAACR,KAAKrjC,EAAEmpC,OAAOtvB,EAAEsvB,OAAOC,cAAcvvB,EAAEuvB,cACngBC,WAAWxvB,EAAEwvB,WAAWl3C,KAAK,MAAM,OAAO6P,GAAG8X,EAAE9X,EAAE6hC,EAAE/sB,EAAEpM,GAAG1I,EAAEA,EAAE7P,KAAK0xC,EAAEltC,GAAEorC,OAAO/hC,EAAE8jC,IAAI9jC,CAAC,CAAC6Z,EAAEA,EAAE1nB,IAAI,OAAO,OAAO0nB,GAAGA,IAAIxpB,GAAG,OAAO2R,EAAE8U,EAAEpM,EAAE1I,EAAE7P,KAAK2nB,EAAEqb,GAAGzqB,EAAE7J,EAAEwjB,iBAAiB2d,IAAG,GAAInhC,EAAEwjB,cAAc3Z,EAAE7J,EAAE+hC,UAAU9rB,EAAEjW,EAAEgoC,UAAU7mC,EAAEG,EAAEmnC,kBAAkB5+B,CAAC,CAAiB,GAAG,QAAnB9J,EAAEuB,EAAEogC,aAAwB,CAAC1rB,EAAEjW,EAAE,GAAGvQ,EAAEwmB,EAAEwsB,KAAK1sC,GAAEorC,OAAO1xC,EAAEyzC,IAAIzzC,EAAEwmB,EAAEA,EAAE1kB,WAAW0kB,IAAIjW,EAAE,MAAM,OAAOiW,IAAI1U,EAAE4/B,MAAM,GAAG,MAAM,CAAClhC,EAAEwjB,cAAcliB,EAAEonC,SAAS,CAC9X,SAASC,GAAG5oC,GAAG,IAAIC,EAAEkoC,KAAK5mC,EAAEtB,EAAEioC,MAAM,GAAG,OAAO3mC,EAAE,MAAMrN,MAAMogB,EAAE,MAAM/S,EAAE+mC,oBAAoBtoC,EAAE,IAAI8J,EAAEvI,EAAEonC,SAAS1yB,EAAE1U,EAAE6gC,QAAQ3yC,EAAEwQ,EAAEwjB,cAAc,GAAG,OAAOxN,EAAE,CAAC1U,EAAE6gC,QAAQ,KAAK,IAAIlsB,EAAED,EAAEA,EAAE1kB,KAAK,GAAG9B,EAAEuQ,EAAEvQ,EAAEymB,EAAEqyB,QAAQryB,EAAEA,EAAE3kB,WAAW2kB,IAAID,GAAGse,GAAG9kC,EAAEwQ,EAAEwjB,iBAAiB2d,IAAG,GAAInhC,EAAEwjB,cAAch0B,EAAE,OAAOwQ,EAAEgoC,YAAYhoC,EAAE+hC,UAAUvyC,GAAG8R,EAAEmnC,kBAAkBj5C,CAAC,CAAC,MAAM,CAACA,EAAEqa,EAAE,CAAC,SAAS5I,KAAK,CACpW,SAAS2nC,GAAG7oC,EAAEC,GAAG,IAAIsB,EAAExL,GAAE+T,EAAEq+B,KAAKlyB,EAAEhW,IAAIxQ,GAAG8kC,GAAGzqB,EAAE2Z,cAAcxN,GAAsE,GAAnExmB,IAAIqa,EAAE2Z,cAAcxN,EAAEmrB,IAAG,GAAIt3B,EAAEA,EAAEo+B,MAAMY,GAAGC,GAAGzP,KAAK,KAAK/3B,EAAEuI,EAAE9J,GAAG,CAACA,IAAO8J,EAAEk/B,cAAc/oC,GAAGxQ,GAAG,OAAO03C,IAAuB,EAApBA,GAAE1jB,cAAcjP,IAAM,CAAuD,GAAtDjT,EAAEmO,OAAO,KAAKu5B,GAAG,EAAEC,GAAG5P,KAAK,KAAK/3B,EAAEuI,EAAEmM,EAAEhW,QAAG,EAAO,MAAS,OAAO+C,GAAE,MAAM9O,MAAMogB,EAAE,MAAM,KAAQ,GAAH2yB,KAAQkC,GAAG5nC,EAAEtB,EAAEgW,EAAE,CAAC,OAAOA,CAAC,CAAC,SAASkzB,GAAGnpC,EAAEC,EAAEsB,GAAGvB,EAAE0P,OAAO,MAAM1P,EAAE,CAACgpC,YAAY/oC,EAAErQ,MAAM2R,GAAmB,QAAhBtB,EAAElK,GAAEgsC,cAAsB9hC,EAAE,CAACmpC,WAAW,KAAKC,OAAO,MAAMtzC,GAAEgsC,YAAY9hC,EAAEA,EAAEopC,OAAO,CAACrpC,IAAgB,QAAXuB,EAAEtB,EAAEopC,QAAgBppC,EAAEopC,OAAO,CAACrpC,GAAGuB,EAAE9P,KAAKuO,EAAG,CAClf,SAASkpC,GAAGlpC,EAAEC,EAAEsB,EAAEuI,GAAG7J,EAAErQ,MAAM2R,EAAEtB,EAAE+oC,YAAYl/B,EAAEw/B,GAAGrpC,IAAIspC,GAAGvpC,EAAE,CAAC,SAAS+oC,GAAG/oC,EAAEC,EAAEsB,GAAG,OAAOA,GAAE,WAAW+nC,GAAGrpC,IAAIspC,GAAGvpC,EAAE,GAAE,CAAC,SAASspC,GAAGtpC,GAAG,IAAIC,EAAED,EAAEgpC,YAAYhpC,EAAEA,EAAEpQ,MAAM,IAAI,IAAI2R,EAAEtB,IAAI,OAAOs0B,GAAGv0B,EAAEuB,EAAE,CAAC,MAAMuI,GAAG,OAAM,CAAE,CAAC,CAAC,SAASy/B,GAAGvpC,GAAG,IAAIC,EAAE2hC,GAAG5hC,EAAE,GAAG,OAAOC,GAAG4jC,GAAG5jC,EAAED,EAAE,GAAG,EAAE,CAClQ,SAASwpC,GAAGxpC,GAAG,IAAIC,EAAE+nC,KAA8M,MAAzM,oBAAoBhoC,IAAIA,EAAEA,KAAKC,EAAEwjB,cAAcxjB,EAAE+hC,UAAUhiC,EAAEA,EAAE,CAACoiC,QAAQ,KAAKT,YAAY,KAAKR,MAAM,EAAEwH,SAAS,KAAKL,oBAAoBF,GAAGM,kBAAkB1oC,GAAGC,EAAEioC,MAAMloC,EAAEA,EAAEA,EAAE2oC,SAASc,GAAGnQ,KAAK,KAAKvjC,GAAEiK,GAAS,CAACC,EAAEwjB,cAAczjB,EAAE,CAC5P,SAASipC,GAAGjpC,EAAEC,EAAEsB,EAAEuI,GAA8O,OAA3O9J,EAAE,CAACwU,IAAIxU,EAAE0pC,OAAOzpC,EAAE0pC,QAAQpoC,EAAEqoC,KAAK9/B,EAAEvY,KAAK,MAAsB,QAAhB0O,EAAElK,GAAEgsC,cAAsB9hC,EAAE,CAACmpC,WAAW,KAAKC,OAAO,MAAMtzC,GAAEgsC,YAAY9hC,EAAEA,EAAEmpC,WAAWppC,EAAEzO,KAAKyO,GAAmB,QAAfuB,EAAEtB,EAAEmpC,YAAoBnpC,EAAEmpC,WAAWppC,EAAEzO,KAAKyO,GAAG8J,EAAEvI,EAAEhQ,KAAKgQ,EAAEhQ,KAAKyO,EAAEA,EAAEzO,KAAKuY,EAAE7J,EAAEmpC,WAAWppC,GAAWA,CAAC,CAAC,SAAS6pC,KAAK,OAAO1B,KAAK1kB,aAAa,CAAC,SAASqmB,GAAG9pC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAE+xB,KAAKjyC,GAAE2Z,OAAO1P,EAAEiW,EAAEwN,cAAcwlB,GAAG,EAAEhpC,EAAEsB,OAAE,OAAO,IAASuI,EAAE,KAAKA,EAAE,CAC9Y,SAASigC,GAAG/pC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEkyB,KAAKr+B,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAIra,OAAE,EAAO,GAAG,OAAOy3C,GAAE,CAAC,IAAIhxB,EAAEgxB,GAAEzjB,cAA0B,GAAZh0B,EAAEymB,EAAEyzB,QAAW,OAAO7/B,GAAG29B,GAAG39B,EAAEoM,EAAE0zB,MAAmC,YAA5B3zB,EAAEwN,cAAcwlB,GAAGhpC,EAAEsB,EAAE9R,EAAEqa,GAAU,CAAC/T,GAAE2Z,OAAO1P,EAAEiW,EAAEwN,cAAcwlB,GAAG,EAAEhpC,EAAEsB,EAAE9R,EAAEqa,EAAE,CAAC,SAASkgC,GAAGhqC,EAAEC,GAAG,OAAO6pC,GAAG,QAAQ,EAAE9pC,EAAEC,EAAE,CAAC,SAAS6oC,GAAG9oC,EAAEC,GAAG,OAAO8pC,GAAG,KAAK,EAAE/pC,EAAEC,EAAE,CAAC,SAASgqC,GAAGjqC,EAAEC,GAAG,OAAO8pC,GAAG,EAAE,EAAE/pC,EAAEC,EAAE,CAAC,SAASiqC,GAAGlqC,EAAEC,GAAG,OAAO8pC,GAAG,EAAE,EAAE/pC,EAAEC,EAAE,CAChX,SAASkqC,GAAGnqC,EAAEC,GAAG,MAAG,oBAAoBA,GAASD,EAAEA,IAAIC,EAAED,GAAG,WAAWC,EAAE,KAAK,GAAK,OAAOA,QAAG,IAASA,GAASD,EAAEA,IAAIC,EAAE8jB,QAAQ/jB,EAAE,WAAWC,EAAE8jB,QAAQ,IAAI,QAA1E,CAA2E,CAAC,SAASqmB,GAAGpqC,EAAEC,EAAEsB,GAA6C,OAA1CA,EAAE,OAAOA,QAAG,IAASA,EAAEA,EAAEo3B,OAAO,CAAC34B,IAAI,KAAY+pC,GAAG,EAAE,EAAEI,GAAG7Q,KAAK,KAAKr5B,EAAED,GAAGuB,EAAE,CAAC,SAAS8oC,KAAK,CAAC,SAASC,GAAGtqC,EAAEC,GAAG,IAAIsB,EAAE4mC,KAAKloC,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAI6J,EAAEvI,EAAEkiB,cAAc,OAAG,OAAO3Z,GAAG,OAAO7J,GAAGwnC,GAAGxnC,EAAE6J,EAAE,IAAWA,EAAE,IAAGvI,EAAEkiB,cAAc,CAACzjB,EAAEC,GAAUD,EAAC,CAC7Z,SAASuqC,GAAGvqC,EAAEC,GAAG,IAAIsB,EAAE4mC,KAAKloC,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAI6J,EAAEvI,EAAEkiB,cAAc,OAAG,OAAO3Z,GAAG,OAAO7J,GAAGwnC,GAAGxnC,EAAE6J,EAAE,IAAWA,EAAE,IAAG9J,EAAEA,IAAIuB,EAAEkiB,cAAc,CAACzjB,EAAEC,GAAUD,EAAC,CAAC,SAASwqC,GAAGxqC,EAAEC,EAAEsB,GAAG,OAAG,KAAQ,GAAH0lC,KAAcjnC,EAAEgiC,YAAYhiC,EAAEgiC,WAAU,EAAGZ,IAAG,GAAIphC,EAAEyjB,cAAcliB,IAAEgzB,GAAGhzB,EAAEtB,KAAKsB,EAAEklB,KAAK1wB,GAAEorC,OAAO5/B,EAAE2hC,IAAI3hC,EAAEvB,EAAEgiC,WAAU,GAAW/hC,EAAC,CAAC,SAASwqC,GAAGzqC,EAAEC,GAAG,IAAIsB,EAAE8H,GAAEA,GAAE,IAAI9H,GAAG,EAAEA,EAAEA,EAAE,EAAEvB,GAAE,GAAI,IAAI8J,EAAEk9B,GAAGxd,WAAWwd,GAAGxd,WAAW,CAAC,EAAE,IAAIxpB,GAAE,GAAIC,GAAG,CAAC,QAAQoJ,GAAE9H,EAAEylC,GAAGxd,WAAW1f,CAAC,CAAC,CAAC,SAAS4gC,KAAK,OAAOvC,KAAK1kB,aAAa,CAC1d,SAASknB,GAAG3qC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE85B,GAAG5jC,GAAkE,GAA/DuB,EAAE,CAACkhC,KAAK34B,EAAEy+B,OAAOhnC,EAAEinC,eAAc,EAAGC,WAAW,KAAKl3C,KAAK,MAASq5C,GAAG5qC,GAAG6qC,GAAG5qC,EAAEsB,QAAQ,GAAiB,QAAdA,EAAEmgC,GAAG1hC,EAAEC,EAAEsB,EAAEuI,IAAY,CAAW+5B,GAAGtiC,EAAEvB,EAAE8J,EAAXR,MAAgBwhC,GAAGvpC,EAAEtB,EAAE6J,EAAE,CAAC,CAC/K,SAAS2/B,GAAGzpC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE85B,GAAG5jC,GAAGiW,EAAE,CAACwsB,KAAK34B,EAAEy+B,OAAOhnC,EAAEinC,eAAc,EAAGC,WAAW,KAAKl3C,KAAK,MAAM,GAAGq5C,GAAG5qC,GAAG6qC,GAAG5qC,EAAEgW,OAAO,CAAC,IAAIxmB,EAAEuQ,EAAE4O,UAAU,GAAG,IAAI5O,EAAEmhC,QAAQ,OAAO1xC,GAAG,IAAIA,EAAE0xC,QAAiC,QAAxB1xC,EAAEwQ,EAAEqoC,qBAA8B,IAAI,IAAIpyB,EAAEjW,EAAEyoC,kBAAkBxvB,EAAEzpB,EAAEymB,EAAE3U,GAAqC,GAAlC0U,EAAEuyB,eAAc,EAAGvyB,EAAEwyB,WAAWvvB,EAAKqb,GAAGrb,EAAEhD,GAAG,CAAC,IAAI9U,EAAEnB,EAAE0hC,YAA+E,OAAnE,OAAOvgC,GAAG6U,EAAE1kB,KAAK0kB,EAAEwrB,GAAGxhC,KAAKgW,EAAE1kB,KAAK6P,EAAE7P,KAAK6P,EAAE7P,KAAK0kB,QAAGhW,EAAE0hC,YAAY1rB,EAAQ,CAAC,CAAC,MAAMgD,GAAG,CAAwB,QAAd1X,EAAEmgC,GAAG1hC,EAAEC,EAAEgW,EAAEnM,MAAoB+5B,GAAGtiC,EAAEvB,EAAE8J,EAAbmM,EAAE3M,MAAgBwhC,GAAGvpC,EAAEtB,EAAE6J,GAAG,CAAC,CAC/c,SAAS8gC,GAAG5qC,GAAG,IAAIC,EAAED,EAAE4O,UAAU,OAAO5O,IAAIjK,IAAG,OAAOkK,GAAGA,IAAIlK,EAAC,CAAC,SAAS80C,GAAG7qC,EAAEC,GAAGonC,GAAGD,IAAG,EAAG,IAAI7lC,EAAEvB,EAAEoiC,QAAQ,OAAO7gC,EAAEtB,EAAE1O,KAAK0O,GAAGA,EAAE1O,KAAKgQ,EAAEhQ,KAAKgQ,EAAEhQ,KAAK0O,GAAGD,EAAEoiC,QAAQniC,CAAC,CAAC,SAAS6qC,GAAG9qC,EAAEC,EAAEsB,GAAG,GAAG,KAAO,QAAFA,GAAW,CAAC,IAAIuI,EAAE7J,EAAEkhC,MAAwB5/B,GAAlBuI,GAAG9J,EAAEkmB,aAAkBjmB,EAAEkhC,MAAM5/B,EAAEslB,GAAG7mB,EAAEuB,EAAE,CAAC,CAC9P,IAAIumC,GAAG,CAACiD,YAAY1J,GAAG2J,YAAYxD,GAAEyD,WAAWzD,GAAE0D,UAAU1D,GAAE2D,oBAAoB3D,GAAE4D,mBAAmB5D,GAAE6D,gBAAgB7D,GAAE8D,QAAQ9D,GAAE+D,WAAW/D,GAAEgE,OAAOhE,GAAEiE,SAASjE,GAAEkE,cAAclE,GAAEmE,iBAAiBnE,GAAEoE,cAAcpE,GAAEqE,iBAAiBrE,GAAEsE,qBAAqBtE,GAAEuE,MAAMvE,GAAEwE,0BAAyB,GAAIrE,GAAG,CAACoD,YAAY1J,GAAG2J,YAAY,SAAShrC,EAAEC,GAA4C,OAAzC+nC,KAAKvkB,cAAc,CAACzjB,OAAE,IAASC,EAAE,KAAKA,GAAUD,CAAC,EAAEirC,WAAW5J,GAAG6J,UAAUlB,GAAGmB,oBAAoB,SAASnrC,EAAEC,EAAEsB,GAA6C,OAA1CA,EAAE,OAAOA,QAAG,IAASA,EAAEA,EAAEo3B,OAAO,CAAC34B,IAAI,KAAY8pC,GAAG,QAC3f,EAAEK,GAAG7Q,KAAK,KAAKr5B,EAAED,GAAGuB,EAAE,EAAE8pC,gBAAgB,SAASrrC,EAAEC,GAAG,OAAO6pC,GAAG,QAAQ,EAAE9pC,EAAEC,EAAE,EAAEmrC,mBAAmB,SAASprC,EAAEC,GAAG,OAAO6pC,GAAG,EAAE,EAAE9pC,EAAEC,EAAE,EAAEqrC,QAAQ,SAAStrC,EAAEC,GAAG,IAAIsB,EAAEymC,KAAqD,OAAhD/nC,OAAE,IAASA,EAAE,KAAKA,EAAED,EAAEA,IAAIuB,EAAEkiB,cAAc,CAACzjB,EAAEC,GAAUD,CAAC,EAAEurC,WAAW,SAASvrC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAEk+B,KAAkM,OAA7L/nC,OAAE,IAASsB,EAAEA,EAAEtB,GAAGA,EAAE6J,EAAE2Z,cAAc3Z,EAAEk4B,UAAU/hC,EAAED,EAAE,CAACoiC,QAAQ,KAAKT,YAAY,KAAKR,MAAM,EAAEwH,SAAS,KAAKL,oBAAoBtoC,EAAE0oC,kBAAkBzoC,GAAG6J,EAAEo+B,MAAMloC,EAAEA,EAAEA,EAAE2oC,SAASgC,GAAGrR,KAAK,KAAKvjC,GAAEiK,GAAS,CAAC8J,EAAE2Z,cAAczjB,EAAE,EAAEwrC,OAAO,SAASxrC,GAC3d,OAAdA,EAAE,CAAC+jB,QAAQ/jB,GAAhBgoC,KAA4BvkB,cAAczjB,CAAC,EAAEyrC,SAASjC,GAAGkC,cAAcrB,GAAGsB,iBAAiB,SAAS3rC,GAAG,OAAOgoC,KAAKvkB,cAAczjB,CAAC,EAAE4rC,cAAc,WAAW,IAAI5rC,EAAEwpC,IAAG,GAAIvpC,EAAED,EAAE,GAA6C,OAA1CA,EAAEyqC,GAAGnR,KAAK,KAAKt5B,EAAE,IAAIgoC,KAAKvkB,cAAczjB,EAAQ,CAACC,EAAED,EAAE,EAAE6rC,iBAAiB,WAAW,EAAEC,qBAAqB,SAAS9rC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE/T,GAAEkgB,EAAE+xB,KAAK,GAAGhJ,GAAE,CAAC,QAAG,IAASz9B,EAAE,MAAMrN,MAAMogB,EAAE,MAAM/S,EAAEA,GAAG,KAAK,CAAO,GAANA,EAAEtB,IAAO,OAAO+C,GAAE,MAAM9O,MAAMogB,EAAE,MAAM,KAAQ,GAAH2yB,KAAQkC,GAAGr/B,EAAE7J,EAAEsB,EAAE,CAAC0U,EAAEwN,cAAcliB,EAAE,IAAI9R,EAAE,CAACG,MAAM2R,EAAEynC,YAAY/oC,GACvZ,OAD0ZgW,EAAEiyB,MAAMz4C,EAAEu6C,GAAGjB,GAAGzP,KAAK,KAAKxvB,EACpfra,EAAEuQ,GAAG,CAACA,IAAI8J,EAAE4F,OAAO,KAAKu5B,GAAG,EAAEC,GAAG5P,KAAK,KAAKxvB,EAAEra,EAAE8R,EAAEtB,QAAG,EAAO,MAAasB,CAAC,EAAEwqC,MAAM,WAAW,IAAI/rC,EAAEgoC,KAAK/nC,EAAE+C,GAAEipC,iBAAiB,GAAGjN,GAAE,CAAC,IAAIz9B,EAAEk9B,GAAkDx+B,EAAE,IAAIA,EAAE,KAA9CsB,GAAHi9B,KAAU,GAAG,GAAG/Y,GAAhB+Y,IAAsB,IAAI/oC,SAAS,IAAI8L,GAAuB,GAAPA,EAAE+lC,QAAWrnC,GAAG,IAAIsB,EAAE9L,SAAS,KAAKwK,GAAG,GAAG,MAAaA,EAAE,IAAIA,EAAE,KAAfsB,EAAEgmC,MAAmB9xC,SAAS,IAAI,IAAI,OAAOuK,EAAEyjB,cAAcxjB,CAAC,EAAE+rC,0BAAyB,GAAIpE,GAAG,CAACmD,YAAY1J,GAAG2J,YAAYV,GAAGW,WAAW5J,GAAG6J,UAAUpC,GAAGqC,oBAAoBf,GAAGgB,mBAAmBnB,GAAGoB,gBAAgBnB,GAAGoB,QAAQf,GAAGgB,WAAWlD,GAAGmD,OAAO3B,GAAG4B,SAAS,WAAW,OAAOpD,GAAGD,GAAG,EACrhBsD,cAAcrB,GAAGsB,iBAAiB,SAAS3rC,GAAc,OAAOwqC,GAAZrC,KAAiBjB,GAAEzjB,cAAczjB,EAAE,EAAE4rC,cAAc,WAAgD,MAAM,CAArCvD,GAAGD,IAAI,GAAKD,KAAK1kB,cAAyB,EAAEooB,iBAAiB3qC,GAAG4qC,qBAAqBjD,GAAGkD,MAAMrB,GAAGsB,0BAAyB,GAAInE,GAAG,CAACkD,YAAY1J,GAAG2J,YAAYV,GAAGW,WAAW5J,GAAG6J,UAAUpC,GAAGqC,oBAAoBf,GAAGgB,mBAAmBnB,GAAGoB,gBAAgBnB,GAAGoB,QAAQf,GAAGgB,WAAW3C,GAAG4C,OAAO3B,GAAG4B,SAAS,WAAW,OAAO7C,GAAGR,GAAG,EAAEsD,cAAcrB,GAAGsB,iBAAiB,SAAS3rC,GAAG,IAAIC,EAAEkoC,KAAK,OAAO,OACzfjB,GAAEjnC,EAAEwjB,cAAczjB,EAAEwqC,GAAGvqC,EAAEinC,GAAEzjB,cAAczjB,EAAE,EAAE4rC,cAAc,WAAgD,MAAM,CAArChD,GAAGR,IAAI,GAAKD,KAAK1kB,cAAyB,EAAEooB,iBAAiB3qC,GAAG4qC,qBAAqBjD,GAAGkD,MAAMrB,GAAGsB,0BAAyB,GAAI,SAASE,GAAGlsC,EAAEC,GAAG,IAAI,IAAIsB,EAAE,GAAGuI,EAAE7J,EAAE,GAAGsB,GAAG8X,EAAGvP,GAAGA,EAAEA,EAAEyZ,aAAazZ,GAAG,IAAImM,EAAE1U,CAAC,CAAC,MAAM9R,GAAGwmB,EAAE,6BAA6BxmB,EAAE08C,QAAQ,KAAK18C,EAAEipB,KAAK,CAAC,MAAM,CAAC9oB,MAAMoQ,EAAE4G,OAAO3G,EAAEyY,MAAMzC,EAAEm2B,OAAO,KAAK,CAAC,SAASC,GAAGrsC,EAAEC,EAAEsB,GAAG,MAAM,CAAC3R,MAAMoQ,EAAE4G,OAAO,KAAK8R,MAAM,MAAMnX,EAAEA,EAAE,KAAK6qC,OAAO,MAAMnsC,EAAEA,EAAE,KAAK,CACzd,SAASqsC,GAAGtsC,EAAEC,GAAG,IAAIssC,QAAQ34B,MAAM3T,EAAErQ,MAAM,CAAC,MAAM2R,GAAG25B,YAAW,WAAW,MAAM35B,CAAE,GAAE,CAAC,CAAC,IAAIirC,GAAG,oBAAoBC,QAAQA,QAAQ/kB,IAAI,SAASglB,GAAG1sC,EAAEC,EAAEsB,IAAGA,EAAEghC,IAAI,EAAEhhC,IAAKiT,IAAI,EAAEjT,EAAEmhC,QAAQ,CAAChM,QAAQ,MAAM,IAAI5sB,EAAE7J,EAAErQ,MAAsD,OAAhD2R,EAAEohC,SAAS,WAAWgK,KAAKA,IAAG,EAAGC,GAAG9iC,GAAGwiC,GAAGtsC,EAAEC,EAAE,EAASsB,CAAC,CAC3Q,SAASsrC,GAAG7sC,EAAEC,EAAEsB,IAAGA,EAAEghC,IAAI,EAAEhhC,IAAKiT,IAAI,EAAE,IAAI1K,EAAE9J,EAAEkV,KAAK43B,yBAAyB,GAAG,oBAAoBhjC,EAAE,CAAC,IAAImM,EAAEhW,EAAErQ,MAAM2R,EAAEmhC,QAAQ,WAAW,OAAO54B,EAAEmM,EAAE,EAAE1U,EAAEohC,SAAS,WAAW2J,GAAGtsC,EAAEC,EAAE,CAAC,CAAC,IAAIxQ,EAAEuQ,EAAEiiB,UAA8O,OAApO,OAAOxyB,GAAG,oBAAoBA,EAAEs9C,oBAAoBxrC,EAAEohC,SAAS,WAAW2J,GAAGtsC,EAAEC,GAAG,oBAAoB6J,IAAI,OAAOkjC,GAAGA,GAAG,IAAIz3B,IAAI,CAACxhB,OAAOi5C,GAAGr3B,IAAI5hB,OAAO,IAAIwN,EAAEtB,EAAEyY,MAAM3kB,KAAKg5C,kBAAkB9sC,EAAErQ,MAAM,CAACq9C,eAAe,OAAO1rC,EAAEA,EAAE,IAAI,GAAUA,CAAC,CACnb,SAAS2rC,GAAGltC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEmtC,UAAU,GAAG,OAAOrjC,EAAE,CAACA,EAAE9J,EAAEmtC,UAAU,IAAIX,GAAG,IAAIv2B,EAAE,IAAIV,IAAIzL,EAAEja,IAAIoQ,EAAEgW,EAAE,WAAiB,KAAXA,EAAEnM,EAAEva,IAAI0Q,MAAgBgW,EAAE,IAAIV,IAAIzL,EAAEja,IAAIoQ,EAAEgW,IAAIA,EAAE9b,IAAIoH,KAAK0U,EAAEN,IAAIpU,GAAGvB,EAAEotC,GAAG9T,KAAK,KAAKt5B,EAAEC,EAAEsB,GAAGtB,EAAEy7B,KAAK17B,EAAEA,GAAG,CAAC,SAASqtC,GAAGrtC,GAAG,EAAE,CAAC,IAAIC,EAA4E,IAAvEA,EAAE,KAAKD,EAAEwU,OAAsBvU,EAAE,QAApBA,EAAED,EAAEyjB,gBAAyB,OAAOxjB,EAAEyjB,YAAuBzjB,EAAE,OAAOD,EAAEA,EAAEA,EAAEujB,MAAM,OAAO,OAAOvjB,GAAG,OAAO,IAAI,CAChW,SAASstC,GAAGttC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,OAAG,KAAY,EAAPjW,EAAE4/B,OAAe5/B,IAAIC,EAAED,EAAE0P,OAAO,OAAO1P,EAAE0P,OAAO,IAAInO,EAAEmO,OAAO,OAAOnO,EAAEmO,QAAQ,MAAM,IAAInO,EAAEiT,MAAM,OAAOjT,EAAEqN,UAAUrN,EAAEiT,IAAI,KAAIvU,EAAEsiC,IAAI,EAAE,IAAK/tB,IAAI,EAAEouB,GAAGrhC,EAAEtB,EAAE,KAAKsB,EAAE4/B,OAAO,GAAGnhC,IAAEA,EAAE0P,OAAO,MAAM1P,EAAEmhC,MAAMlrB,EAASjW,EAAC,CAAC,IAAIutC,GAAGj2B,EAAGk2B,kBAAkBpM,IAAG,EAAG,SAASqM,GAAGztC,EAAEC,EAAEsB,EAAEuI,GAAG7J,EAAE4jB,MAAM,OAAO7jB,EAAE8lC,GAAG7lC,EAAE,KAAKsB,EAAEuI,GAAG+7B,GAAG5lC,EAAED,EAAE6jB,MAAMtiB,EAAEuI,EAAE,CACnV,SAAS4jC,GAAG1tC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG1U,EAAEA,EAAE+X,OAAO,IAAI7pB,EAAEwQ,EAAEglC,IAAqC,OAAjCjE,GAAG/gC,EAAEgW,GAAGnM,EAAE49B,GAAG1nC,EAAEC,EAAEsB,EAAEuI,EAAEra,EAAEwmB,GAAG1U,EAAEwmC,KAAQ,OAAO/nC,GAAIohC,IAA2EpC,IAAGz9B,GAAGq9B,GAAG3+B,GAAGA,EAAEyP,OAAO,EAAE+9B,GAAGztC,EAAEC,EAAE6J,EAAEmM,GAAUhW,EAAE4jB,QAA7G5jB,EAAE8hC,YAAY/hC,EAAE+hC,YAAY9hC,EAAEyP,QAAQ,KAAK1P,EAAEmhC,QAAQlrB,EAAE03B,GAAG3tC,EAAEC,EAAEgW,GAAoD,CACzN,SAAS23B,GAAG5tC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,GAAG,OAAOjW,EAAE,CAAC,IAAIvQ,EAAE8R,EAAE2T,KAAK,MAAG,oBAAoBzlB,GAAIo+C,GAAGp+C,SAAI,IAASA,EAAE6wC,cAAc,OAAO/+B,EAAEusC,cAAS,IAASvsC,EAAE++B,eAAoDtgC,EAAEylC,GAAGlkC,EAAE2T,KAAK,KAAKpL,EAAE7J,EAAEA,EAAE2/B,KAAK3pB,IAAKgvB,IAAIhlC,EAAEglC,IAAIjlC,EAAEujB,OAAOtjB,EAASA,EAAE4jB,MAAM7jB,IAArGC,EAAEuU,IAAI,GAAGvU,EAAEiV,KAAKzlB,EAAEs+C,GAAG/tC,EAAEC,EAAExQ,EAAEqa,EAAEmM,GAAyE,CAAW,GAAVxmB,EAAEuQ,EAAE6jB,MAAS,KAAK7jB,EAAEmhC,MAAMlrB,GAAG,CAAC,IAAIC,EAAEzmB,EAAEuwC,cAA0C,IAAhBz+B,EAAE,QAAdA,EAAEA,EAAEusC,SAAmBvsC,EAAEizB,IAAQte,EAAEpM,IAAI9J,EAAEilC,MAAMhlC,EAAEglC,IAAI,OAAO0I,GAAG3tC,EAAEC,EAAEgW,EAAE,CAA6C,OAA5ChW,EAAEyP,OAAO,GAAE1P,EAAEulC,GAAG91C,EAAEqa,IAAKm7B,IAAIhlC,EAAEglC,IAAIjlC,EAAEujB,OAAOtjB,EAASA,EAAE4jB,MAAM7jB,CAAC,CAC1b,SAAS+tC,GAAG/tC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,GAAG,OAAOjW,EAAE,CAAC,IAAIvQ,EAAEuQ,EAAEggC,cAAc,GAAGxL,GAAG/kC,EAAEqa,IAAI9J,EAAEilC,MAAMhlC,EAAEglC,IAAI,IAAG7D,IAAG,EAAGnhC,EAAEs/B,aAAaz1B,EAAEra,EAAE,KAAKuQ,EAAEmhC,MAAMlrB,GAAsC,OAAOhW,EAAEkhC,MAAMnhC,EAAEmhC,MAAMwM,GAAG3tC,EAAEC,EAAEgW,GAAjE,KAAa,OAARjW,EAAE0P,SAAgB0xB,IAAG,EAAyC,EAAC,OAAO4M,GAAGhuC,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAE,CACxN,SAASg4B,GAAGjuC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE7J,EAAEs/B,aAAatpB,EAAEnM,EAAEmS,SAASxsB,EAAE,OAAOuQ,EAAEA,EAAEyjB,cAAc,KAAK,GAAG,WAAW3Z,EAAE81B,KAAK,GAAG,KAAY,EAAP3/B,EAAE2/B,MAAQ3/B,EAAEwjB,cAAc,CAACyqB,UAAU,EAAEC,UAAU,KAAKC,YAAY,MAAM1R,GAAE2R,GAAGC,IAAIA,IAAI/sC,MAAM,CAAC,GAAG,KAAO,WAAFA,GAAc,OAAOvB,EAAE,OAAOvQ,EAAEA,EAAEy+C,UAAU3sC,EAAEA,EAAEtB,EAAEkhC,MAAMlhC,EAAE8gC,WAAW,WAAW9gC,EAAEwjB,cAAc,CAACyqB,UAAUluC,EAAEmuC,UAAU,KAAKC,YAAY,MAAMnuC,EAAE8hC,YAAY,KAAKrF,GAAE2R,GAAGC,IAAIA,IAAItuC,EAAE,KAAKC,EAAEwjB,cAAc,CAACyqB,UAAU,EAAEC,UAAU,KAAKC,YAAY,MAAMtkC,EAAE,OAAOra,EAAEA,EAAEy+C,UAAU3sC,EAAEm7B,GAAE2R,GAAGC,IAAIA,IAAIxkC,CAAC,MAAM,OACtfra,GAAGqa,EAAEra,EAAEy+C,UAAU3sC,EAAEtB,EAAEwjB,cAAc,MAAM3Z,EAAEvI,EAAEm7B,GAAE2R,GAAGC,IAAIA,IAAIxkC,EAAc,OAAZ2jC,GAAGztC,EAAEC,EAAEgW,EAAE1U,GAAUtB,EAAE4jB,KAAK,CAAC,SAAS0qB,GAAGvuC,EAAEC,GAAG,IAAIsB,EAAEtB,EAAEglC,KAAO,OAAOjlC,GAAG,OAAOuB,GAAG,OAAOvB,GAAGA,EAAEilC,MAAM1jC,KAAEtB,EAAEyP,OAAO,IAAIzP,EAAEyP,OAAO,QAAO,CAAC,SAASs+B,GAAGhuC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,IAAIxmB,EAAE0tC,GAAG57B,GAAGu7B,GAAGF,GAAE7Y,QAAmD,OAA3Ct0B,EAAEstC,GAAG98B,EAAExQ,GAAGuxC,GAAG/gC,EAAEgW,GAAG1U,EAAEmmC,GAAG1nC,EAAEC,EAAEsB,EAAEuI,EAAEra,EAAEwmB,GAAGnM,EAAEi+B,KAAQ,OAAO/nC,GAAIohC,IAA2EpC,IAAGl1B,GAAG80B,GAAG3+B,GAAGA,EAAEyP,OAAO,EAAE+9B,GAAGztC,EAAEC,EAAEsB,EAAE0U,GAAUhW,EAAE4jB,QAA7G5jB,EAAE8hC,YAAY/hC,EAAE+hC,YAAY9hC,EAAEyP,QAAQ,KAAK1P,EAAEmhC,QAAQlrB,EAAE03B,GAAG3tC,EAAEC,EAAEgW,GAAoD,CACla,SAASu4B,GAAGxuC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,GAAGknB,GAAG57B,GAAG,CAAC,IAAI9R,GAAE,EAAGguC,GAAGx9B,EAAE,MAAMxQ,GAAE,EAAW,GAARuxC,GAAG/gC,EAAEgW,GAAM,OAAOhW,EAAEgiB,UAAUwsB,GAAGzuC,EAAEC,GAAGkkC,GAAGlkC,EAAEsB,EAAEuI,GAAG26B,GAAGxkC,EAAEsB,EAAEuI,EAAEmM,GAAGnM,GAAE,OAAQ,GAAG,OAAO9J,EAAE,CAAC,IAAIkW,EAAEjW,EAAEgiB,UAAU/I,EAAEjZ,EAAE+/B,cAAc9pB,EAAEwuB,MAAMxrB,EAAE,IAAI9X,EAAE8U,EAAEorB,QAAQroB,EAAE1X,EAAE6iC,YAAY,kBAAkBnrB,GAAG,OAAOA,EAAEA,EAAEooB,GAAGpoB,GAAyBA,EAAE8jB,GAAG98B,EAA1BgZ,EAAEkkB,GAAG57B,GAAGu7B,GAAGF,GAAE7Y,SAAmB,IAAI3kB,EAAEmC,EAAEojC,yBAAyB1B,EAAE,oBAAoB7jC,GAAG,oBAAoB8W,EAAE0uB,wBAAwB3B,GAAG,oBAAoB/sB,EAAEsuB,kCAAkC,oBAAoBtuB,EAAEquB,4BAC1drrB,IAAIpP,GAAG1I,IAAI6X,IAAIqrB,GAAGrkC,EAAEiW,EAAEpM,EAAEmP,GAAG4oB,IAAG,EAAG,IAAIxgC,EAAEpB,EAAEwjB,cAAcvN,EAAE3N,MAAMlH,EAAE2hC,GAAG/iC,EAAE6J,EAAEoM,EAAED,GAAG7U,EAAEnB,EAAEwjB,cAAcvK,IAAIpP,GAAGzI,IAAID,GAAGy7B,GAAG9Y,SAAS8d,IAAI,oBAAoBziC,IAAImkC,GAAGtjC,EAAEsB,EAAEnC,EAAE0K,GAAG1I,EAAEnB,EAAEwjB,gBAAgBvK,EAAE2oB,IAAImC,GAAG/jC,EAAEsB,EAAE2X,EAAEpP,EAAEzI,EAAED,EAAE6X,KAAKgqB,GAAG,oBAAoB/sB,EAAE2uB,2BAA2B,oBAAoB3uB,EAAE4uB,qBAAqB,oBAAoB5uB,EAAE4uB,oBAAoB5uB,EAAE4uB,qBAAqB,oBAAoB5uB,EAAE2uB,2BAA2B3uB,EAAE2uB,6BAA6B,oBAAoB3uB,EAAE6uB,oBAAoB9kC,EAAEyP,OAAO,WAClf,oBAAoBwG,EAAE6uB,oBAAoB9kC,EAAEyP,OAAO,SAASzP,EAAE+/B,cAAcl2B,EAAE7J,EAAEwjB,cAAcriB,GAAG8U,EAAEwuB,MAAM56B,EAAEoM,EAAE3N,MAAMnH,EAAE8U,EAAEorB,QAAQroB,EAAEnP,EAAEoP,IAAI,oBAAoBhD,EAAE6uB,oBAAoB9kC,EAAEyP,OAAO,SAAS5F,GAAE,EAAG,KAAK,CAACoM,EAAEjW,EAAEgiB,UAAUqgB,GAAGtiC,EAAEC,GAAGiZ,EAAEjZ,EAAE+/B,cAAc/mB,EAAEhZ,EAAEiV,OAAOjV,EAAEm/B,YAAYlmB,EAAEmnB,GAAGpgC,EAAEiV,KAAKgE,GAAGhD,EAAEwuB,MAAMzrB,EAAEgqB,EAAEhjC,EAAEs/B,aAAal+B,EAAE6U,EAAEorB,QAAwB,kBAAhBlgC,EAAEG,EAAE6iC,cAAiC,OAAOhjC,EAAEA,EAAEigC,GAAGjgC,GAAyBA,EAAE27B,GAAG98B,EAA1BmB,EAAE+7B,GAAG57B,GAAGu7B,GAAGF,GAAE7Y,SAAmB,IAAItlB,EAAE8C,EAAEojC,0BAA0BvlC,EAAE,oBAAoBX,GAAG,oBAAoByX,EAAE0uB,0BAC9e,oBAAoB1uB,EAAEsuB,kCAAkC,oBAAoBtuB,EAAEquB,4BAA4BrrB,IAAI+pB,GAAG5hC,IAAID,IAAIkjC,GAAGrkC,EAAEiW,EAAEpM,EAAE1I,GAAGygC,IAAG,EAAGxgC,EAAEpB,EAAEwjB,cAAcvN,EAAE3N,MAAMlH,EAAE2hC,GAAG/iC,EAAE6J,EAAEoM,EAAED,GAAG,IAAIxR,EAAExE,EAAEwjB,cAAcvK,IAAI+pB,GAAG5hC,IAAIoD,GAAGo4B,GAAG9Y,SAAS8d,IAAI,oBAAoBpjC,IAAI8kC,GAAGtjC,EAAEsB,EAAE9C,EAAEqL,GAAGrF,EAAExE,EAAEwjB,gBAAgBxK,EAAE4oB,IAAImC,GAAG/jC,EAAEsB,EAAE0X,EAAEnP,EAAEzI,EAAEoD,EAAErD,KAAI,IAAKhC,GAAG,oBAAoB8W,EAAEw4B,4BAA4B,oBAAoBx4B,EAAEy4B,sBAAsB,oBAAoBz4B,EAAEy4B,qBAAqBz4B,EAAEy4B,oBAAoB7kC,EAAErF,EAAErD,GAAG,oBAAoB8U,EAAEw4B,4BAC5fx4B,EAAEw4B,2BAA2B5kC,EAAErF,EAAErD,IAAI,oBAAoB8U,EAAE04B,qBAAqB3uC,EAAEyP,OAAO,GAAG,oBAAoBwG,EAAE0uB,0BAA0B3kC,EAAEyP,OAAO,QAAQ,oBAAoBwG,EAAE04B,oBAAoB11B,IAAIlZ,EAAEggC,eAAe3+B,IAAIrB,EAAEyjB,gBAAgBxjB,EAAEyP,OAAO,GAAG,oBAAoBwG,EAAE0uB,yBAAyB1rB,IAAIlZ,EAAEggC,eAAe3+B,IAAIrB,EAAEyjB,gBAAgBxjB,EAAEyP,OAAO,MAAMzP,EAAE+/B,cAAcl2B,EAAE7J,EAAEwjB,cAAchf,GAAGyR,EAAEwuB,MAAM56B,EAAEoM,EAAE3N,MAAM9D,EAAEyR,EAAEorB,QAAQlgC,EAAE0I,EAAEmP,IAAI,oBAAoB/C,EAAE04B,oBAAoB11B,IAAIlZ,EAAEggC,eAAe3+B,IACjfrB,EAAEyjB,gBAAgBxjB,EAAEyP,OAAO,GAAG,oBAAoBwG,EAAE0uB,yBAAyB1rB,IAAIlZ,EAAEggC,eAAe3+B,IAAIrB,EAAEyjB,gBAAgBxjB,EAAEyP,OAAO,MAAM5F,GAAE,EAAG,CAAC,OAAO+kC,GAAG7uC,EAAEC,EAAEsB,EAAEuI,EAAEra,EAAEwmB,EAAE,CACnK,SAAS44B,GAAG7uC,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,GAAG8+C,GAAGvuC,EAAEC,GAAG,IAAIiW,EAAE,KAAa,IAARjW,EAAEyP,OAAW,IAAI5F,IAAIoM,EAAE,OAAOD,GAAG0nB,GAAG19B,EAAEsB,GAAE,GAAIosC,GAAG3tC,EAAEC,EAAExQ,GAAGqa,EAAE7J,EAAEgiB,UAAUsrB,GAAGxpB,QAAQ9jB,EAAE,IAAIiZ,EAAEhD,GAAG,oBAAoB3U,EAAEurC,yBAAyB,KAAKhjC,EAAEwP,SAAwI,OAA/HrZ,EAAEyP,OAAO,EAAE,OAAO1P,GAAGkW,GAAGjW,EAAE4jB,MAAMgiB,GAAG5lC,EAAED,EAAE6jB,MAAM,KAAKp0B,GAAGwQ,EAAE4jB,MAAMgiB,GAAG5lC,EAAE,KAAKiZ,EAAEzpB,IAAIg+C,GAAGztC,EAAEC,EAAEiZ,EAAEzpB,GAAGwQ,EAAEwjB,cAAc3Z,EAAEvB,MAAM0N,GAAG0nB,GAAG19B,EAAEsB,GAAE,GAAWtB,EAAE4jB,KAAK,CAAC,SAASirB,GAAG9uC,GAAG,IAAIC,EAAED,EAAEiiB,UAAUhiB,EAAE8uC,eAAezR,GAAGt9B,EAAEC,EAAE8uC,eAAe9uC,EAAE8uC,iBAAiB9uC,EAAEqhC,SAASrhC,EAAEqhC,SAAShE,GAAGt9B,EAAEC,EAAEqhC,SAAQ,GAAI8E,GAAGpmC,EAAEC,EAAE0oB,cAAc,CAC5e,SAASqmB,GAAGhvC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAuC,OAApCiqB,KAAKC,GAAGlqB,GAAGhW,EAAEyP,OAAO,IAAI+9B,GAAGztC,EAAEC,EAAEsB,EAAEuI,GAAU7J,EAAE4jB,KAAK,CAAC,IAaqLorB,GAAGC,GAAGC,GAAGC,GAb1LC,GAAG,CAAC3rB,WAAW,KAAK+b,YAAY,KAAKC,UAAU,GAAG,SAAS4P,GAAGtvC,GAAG,MAAM,CAACkuC,UAAUluC,EAAEmuC,UAAU,KAAKC,YAAY,KAAK,CAClM,SAASmB,GAAGvvC,EAAEC,EAAEsB,GAAG,IAA0D2X,EAAtDpP,EAAE7J,EAAEs/B,aAAatpB,EAAE/K,GAAE6Y,QAAQt0B,GAAE,EAAGymB,EAAE,KAAa,IAARjW,EAAEyP,OAAqJ,IAAvIwJ,EAAEhD,KAAKgD,GAAE,OAAOlZ,GAAG,OAAOA,EAAEyjB,gBAAiB,KAAO,EAAFxN,IAASiD,GAAEzpB,GAAE,EAAGwQ,EAAEyP,QAAQ,KAAY,OAAO1P,GAAG,OAAOA,EAAEyjB,gBAAcxN,GAAG,GAAEymB,GAAExxB,GAAI,EAAF+K,GAAQ,OAAOjW,EAA2B,OAAxB6/B,GAAG5/B,GAAwB,QAArBD,EAAEC,EAAEwjB,gBAA2C,QAAfzjB,EAAEA,EAAE0jB,aAA4B,KAAY,EAAPzjB,EAAE2/B,MAAQ3/B,EAAEkhC,MAAM,EAAE,OAAOnhC,EAAE7H,KAAK8H,EAAEkhC,MAAM,EAAElhC,EAAEkhC,MAAM,WAAW,OAAKjrB,EAAEpM,EAAEmS,SAASjc,EAAE8J,EAAE0lC,SAAgB//C,GAAGqa,EAAE7J,EAAE2/B,KAAKnwC,EAAEwQ,EAAE4jB,MAAM3N,EAAE,CAAC0pB,KAAK,SAAS3jB,SAAS/F,GAAG,KAAO,EAAFpM,IAAM,OAAOra,GAAGA,EAAEsxC,WAAW,EAAEtxC,EAAE8vC,aAC7erpB,GAAGzmB,EAAEggD,GAAGv5B,EAAEpM,EAAE,EAAE,MAAM9J,EAAE4lC,GAAG5lC,EAAE8J,EAAEvI,EAAE,MAAM9R,EAAE8zB,OAAOtjB,EAAED,EAAEujB,OAAOtjB,EAAExQ,EAAEq0B,QAAQ9jB,EAAEC,EAAE4jB,MAAMp0B,EAAEwQ,EAAE4jB,MAAMJ,cAAc6rB,GAAG/tC,GAAGtB,EAAEwjB,cAAc4rB,GAAGrvC,GAAG0vC,GAAGzvC,EAAEiW,IAAqB,GAAG,QAArBD,EAAEjW,EAAEyjB,gBAA2C,QAAfvK,EAAEjD,EAAEyN,YAAqB,OAGpM,SAAY1jB,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,GAAG,GAAG3U,EAAG,OAAW,IAARtB,EAAEyP,OAAiBzP,EAAEyP,QAAQ,IAAwBigC,GAAG3vC,EAAEC,EAAEiW,EAA3BpM,EAAEuiC,GAAGn4C,MAAMogB,EAAE,SAAsB,OAAOrU,EAAEwjB,eAAqBxjB,EAAE4jB,MAAM7jB,EAAE6jB,MAAM5jB,EAAEyP,OAAO,IAAI,OAAKjgB,EAAEqa,EAAE0lC,SAASv5B,EAAEhW,EAAE2/B,KAAK91B,EAAE2lC,GAAG,CAAC7P,KAAK,UAAU3jB,SAASnS,EAAEmS,UAAUhG,EAAE,EAAE,OAAMxmB,EAAEm2C,GAAGn2C,EAAEwmB,EAAEC,EAAE,OAAQxG,OAAO,EAAE5F,EAAEyZ,OAAOtjB,EAAExQ,EAAE8zB,OAAOtjB,EAAE6J,EAAEga,QAAQr0B,EAAEwQ,EAAE4jB,MAAM/Z,EAAE,KAAY,EAAP7J,EAAE2/B,OAASiG,GAAG5lC,EAAED,EAAE6jB,MAAM,KAAK3N,GAAGjW,EAAE4jB,MAAMJ,cAAc6rB,GAAGp5B,GAAGjW,EAAEwjB,cAAc4rB,GAAU5/C,GAAE,GAAG,KAAY,EAAPwQ,EAAE2/B,MAAQ,OAAO+P,GAAG3vC,EAAEC,EAAEiW,EAAE,MAAM,GAAG,OAAOD,EAAE9d,KAAK,CAChd,GADid2R,EAAEmM,EAAE2e,aAAa3e,EAAE2e,YAAYgb,QAC3e,IAAI12B,EAAEpP,EAAE+lC,KAA0C,OAArC/lC,EAAEoP,EAA0Cy2B,GAAG3vC,EAAEC,EAAEiW,EAA/BpM,EAAEuiC,GAAlB58C,EAAEyE,MAAMogB,EAAE,MAAaxK,OAAE,GAA0B,CAAwB,GAAvBoP,EAAE,KAAKhD,EAAElW,EAAE+gC,YAAeK,IAAIloB,EAAE,CAAK,GAAG,QAAPpP,EAAE9G,IAAc,CAAC,OAAOkT,GAAGA,GAAG,KAAK,EAAED,EAAE,EAAE,MAAM,KAAK,GAAGA,EAAE,EAAE,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS,KAAK,SAAS,KAAK,SAASA,EAAE,GAAG,MAAM,KAAK,UAAUA,EAAE,UAAU,MAAM,QAAQA,EAAE,EAChd,KADkdA,EAAE,KAAKA,GAAGnM,EAAEqc,eAAejQ,IAAI,EAAED,IAC5eA,IAAIxmB,EAAEiwC,YAAYjwC,EAAEiwC,UAAUzpB,EAAE2rB,GAAG5hC,EAAEiW,GAAG4tB,GAAG/5B,EAAE9J,EAAEiW,GAAG,GAAG,CAA0B,OAAzB65B,KAAgCH,GAAG3vC,EAAEC,EAAEiW,EAAlCpM,EAAEuiC,GAAGn4C,MAAMogB,EAAE,OAAyB,CAAC,MAAG,OAAO2B,EAAE9d,MAAY8H,EAAEyP,OAAO,IAAIzP,EAAE4jB,MAAM7jB,EAAE6jB,MAAM5jB,EAAE8vC,GAAGzW,KAAK,KAAKt5B,GAAGiW,EAAE+5B,YAAY/vC,EAAE,OAAKD,EAAEvQ,EAAEgwC,YAAYV,GAAGjD,GAAG7lB,EAAE2e,aAAakK,GAAG7+B,EAAE++B,IAAE,EAAGC,GAAG,KAAK,OAAOj/B,IAAIq+B,GAAGC,MAAME,GAAGH,GAAGC,MAAMG,GAAGJ,GAAGC,MAAMC,GAAGC,GAAGx+B,EAAE4pB,GAAG6U,GAAGz+B,EAAEw/B,SAASjB,GAAGt+B,GAAGA,EAAEyvC,GAAGzvC,EAAE6J,EAAEmS,UAAUhc,EAAEyP,OAAO,KAAYzP,EAAC,CALrKgwC,CAAGjwC,EAAEC,EAAEiW,EAAEpM,EAAEoP,EAAEjD,EAAE1U,GAAG,GAAG9R,EAAE,CAACA,EAAEqa,EAAE0lC,SAASt5B,EAAEjW,EAAE2/B,KAAe1mB,GAAVjD,EAAEjW,EAAE6jB,OAAUC,QAAQ,IAAI1iB,EAAE,CAACw+B,KAAK,SAAS3jB,SAASnS,EAAEmS,UAChF,OAD0F,KAAO,EAAF/F,IAAMjW,EAAE4jB,QAAQ5N,IAAGnM,EAAE7J,EAAE4jB,OAAQkd,WAAW,EAAEj3B,EAAEy1B,aAAan+B,EAAEnB,EAAEo/B,UAAU,OAAOv1B,EAAEy7B,GAAGtvB,EAAE7U,IAAK8uC,aAA4B,SAAfj6B,EAAEi6B,aAAuB,OAAOh3B,EAAEzpB,EAAE81C,GAAGrsB,EAAEzpB,IAAIA,EAAEm2C,GAAGn2C,EAAEymB,EAAE3U,EAAE,OAAQmO,OAAO,EAAGjgB,EAAE8zB,OACnftjB,EAAE6J,EAAEyZ,OAAOtjB,EAAE6J,EAAEga,QAAQr0B,EAAEwQ,EAAE4jB,MAAM/Z,EAAEA,EAAEra,EAAEA,EAAEwQ,EAAE4jB,MAA8B3N,EAAE,QAA1BA,EAAElW,EAAE6jB,MAAMJ,eAAyB6rB,GAAG/tC,GAAG,CAAC2sC,UAAUh4B,EAAEg4B,UAAU3sC,EAAE4sC,UAAU,KAAKC,YAAYl4B,EAAEk4B,aAAa3+C,EAAEg0B,cAAcvN,EAAEzmB,EAAEsxC,WAAW/gC,EAAE+gC,YAAYx/B,EAAEtB,EAAEwjB,cAAc4rB,GAAUvlC,CAAC,CAAoO,OAAzN9J,GAAVvQ,EAAEuQ,EAAE6jB,OAAUC,QAAQha,EAAEy7B,GAAG91C,EAAE,CAACmwC,KAAK,UAAU3jB,SAASnS,EAAEmS,WAAW,KAAY,EAAPhc,EAAE2/B,QAAU91B,EAAEq3B,MAAM5/B,GAAGuI,EAAEyZ,OAAOtjB,EAAE6J,EAAEga,QAAQ,KAAK,OAAO9jB,IAAkB,QAAduB,EAAEtB,EAAEo/B,YAAoBp/B,EAAEo/B,UAAU,CAACr/B,GAAGC,EAAEyP,OAAO,IAAInO,EAAE9P,KAAKuO,IAAIC,EAAE4jB,MAAM/Z,EAAE7J,EAAEwjB,cAAc,KAAY3Z,CAAC,CACnd,SAAS4lC,GAAG1vC,EAAEC,GAA8D,OAA3DA,EAAEwvC,GAAG,CAAC7P,KAAK,UAAU3jB,SAAShc,GAAGD,EAAE4/B,KAAK,EAAE,OAAQrc,OAAOvjB,EAASA,EAAE6jB,MAAM5jB,CAAC,CAAC,SAAS0vC,GAAG3vC,EAAEC,EAAEsB,EAAEuI,GAAwG,OAArG,OAAOA,GAAGq2B,GAAGr2B,GAAG+7B,GAAG5lC,EAAED,EAAE6jB,MAAM,KAAKtiB,IAAGvB,EAAE0vC,GAAGzvC,EAAEA,EAAEs/B,aAAatjB,WAAYvM,OAAO,EAAEzP,EAAEwjB,cAAc,KAAYzjB,CAAC,CAGkJ,SAASmwC,GAAGnwC,EAAEC,EAAEsB,GAAGvB,EAAEmhC,OAAOlhC,EAAE,IAAI6J,EAAE9J,EAAE4O,UAAU,OAAO9E,IAAIA,EAAEq3B,OAAOlhC,GAAG6gC,GAAG9gC,EAAEujB,OAAOtjB,EAAEsB,EAAE,CACxc,SAAS6uC,GAAGpwC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,IAAIxmB,EAAEuQ,EAAEyjB,cAAc,OAAOh0B,EAAEuQ,EAAEyjB,cAAc,CAAC4sB,YAAYpwC,EAAEqwC,UAAU,KAAKC,mBAAmB,EAAEC,KAAK1mC,EAAE2mC,KAAKlvC,EAAEmvC,SAASz6B,IAAIxmB,EAAE4gD,YAAYpwC,EAAExQ,EAAE6gD,UAAU,KAAK7gD,EAAE8gD,mBAAmB,EAAE9gD,EAAE+gD,KAAK1mC,EAAEra,EAAEghD,KAAKlvC,EAAE9R,EAAEihD,SAASz6B,EAAE,CAC3O,SAAS06B,GAAG3wC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE7J,EAAEs/B,aAAatpB,EAAEnM,EAAE48B,YAAYj3C,EAAEqa,EAAE2mC,KAAsC,GAAjChD,GAAGztC,EAAEC,EAAE6J,EAAEmS,SAAS1a,GAAkB,KAAO,GAAtBuI,EAAEoB,GAAE6Y,UAAqBja,EAAI,EAAFA,EAAI,EAAE7J,EAAEyP,OAAO,QAAQ,CAAC,GAAG,OAAO1P,GAAG,KAAa,IAARA,EAAE0P,OAAW1P,EAAE,IAAIA,EAAEC,EAAE4jB,MAAM,OAAO7jB,GAAG,CAAC,GAAG,KAAKA,EAAEwU,IAAI,OAAOxU,EAAEyjB,eAAe0sB,GAAGnwC,EAAEuB,EAAEtB,QAAQ,GAAG,KAAKD,EAAEwU,IAAI27B,GAAGnwC,EAAEuB,EAAEtB,QAAQ,GAAG,OAAOD,EAAE6jB,MAAM,CAAC7jB,EAAE6jB,MAAMN,OAAOvjB,EAAEA,EAAEA,EAAE6jB,MAAM,QAAQ,CAAC,GAAG7jB,IAAIC,EAAE,MAAMD,EAAE,KAAK,OAAOA,EAAE8jB,SAAS,CAAC,GAAG,OAAO9jB,EAAEujB,QAAQvjB,EAAEujB,SAAStjB,EAAE,MAAMD,EAAEA,EAAEA,EAAEujB,MAAM,CAACvjB,EAAE8jB,QAAQP,OAAOvjB,EAAEujB,OAAOvjB,EAAEA,EAAE8jB,OAAO,CAACha,GAAG,CAAC,CAAQ,GAAP4yB,GAAExxB,GAAEpB,GAAM,KAAY,EAAP7J,EAAE2/B,MAAQ3/B,EAAEwjB,cAC/e,UAAU,OAAOxN,GAAG,IAAK,WAAqB,IAAV1U,EAAEtB,EAAE4jB,MAAU5N,EAAE,KAAK,OAAO1U,GAAiB,QAAdvB,EAAEuB,EAAEqN,YAAoB,OAAO63B,GAAGzmC,KAAKiW,EAAE1U,GAAGA,EAAEA,EAAEuiB,QAAY,QAAJviB,EAAE0U,IAAYA,EAAEhW,EAAE4jB,MAAM5jB,EAAE4jB,MAAM,OAAO5N,EAAE1U,EAAEuiB,QAAQviB,EAAEuiB,QAAQ,MAAMssB,GAAGnwC,GAAE,EAAGgW,EAAE1U,EAAE9R,GAAG,MAAM,IAAK,YAA6B,IAAjB8R,EAAE,KAAK0U,EAAEhW,EAAE4jB,MAAU5jB,EAAE4jB,MAAM,KAAK,OAAO5N,GAAG,CAAe,GAAG,QAAjBjW,EAAEiW,EAAErH,YAAuB,OAAO63B,GAAGzmC,GAAG,CAACC,EAAE4jB,MAAM5N,EAAE,KAAK,CAACjW,EAAEiW,EAAE6N,QAAQ7N,EAAE6N,QAAQviB,EAAEA,EAAE0U,EAAEA,EAAEjW,CAAC,CAACowC,GAAGnwC,GAAE,EAAGsB,EAAE,KAAK9R,GAAG,MAAM,IAAK,WAAW2gD,GAAGnwC,GAAE,EAAG,KAAK,UAAK,GAAQ,MAAM,QAAQA,EAAEwjB,cAAc,KAAK,OAAOxjB,EAAE4jB,KAAK,CAC7d,SAAS4qB,GAAGzuC,EAAEC,GAAG,KAAY,EAAPA,EAAE2/B,OAAS,OAAO5/B,IAAIA,EAAE4O,UAAU,KAAK3O,EAAE2O,UAAU,KAAK3O,EAAEyP,OAAO,EAAE,CAAC,SAASi+B,GAAG3tC,EAAEC,EAAEsB,GAAyD,GAAtD,OAAOvB,IAAIC,EAAEghC,aAAajhC,EAAEihC,cAAciC,IAAIjjC,EAAEkhC,MAAS,KAAK5/B,EAAEtB,EAAE8gC,YAAY,OAAO,KAAK,GAAG,OAAO/gC,GAAGC,EAAE4jB,QAAQ7jB,EAAE6jB,MAAM,MAAM3vB,MAAMogB,EAAE,MAAM,GAAG,OAAOrU,EAAE4jB,MAAM,CAA4C,IAAjCtiB,EAAEgkC,GAAZvlC,EAAEC,EAAE4jB,MAAa7jB,EAAEu/B,cAAct/B,EAAE4jB,MAAMtiB,EAAMA,EAAEgiB,OAAOtjB,EAAE,OAAOD,EAAE8jB,SAAS9jB,EAAEA,EAAE8jB,SAAQviB,EAAEA,EAAEuiB,QAAQyhB,GAAGvlC,EAAEA,EAAEu/B,eAAgBhc,OAAOtjB,EAAEsB,EAAEuiB,QAAQ,IAAI,CAAC,OAAO7jB,EAAE4jB,KAAK,CAO9a,SAAS+sB,GAAG5wC,EAAEC,GAAG,IAAI++B,GAAE,OAAOh/B,EAAE0wC,UAAU,IAAK,SAASzwC,EAAED,EAAEywC,KAAK,IAAI,IAAIlvC,EAAE,KAAK,OAAOtB,GAAG,OAAOA,EAAE2O,YAAYrN,EAAEtB,GAAGA,EAAEA,EAAE6jB,QAAQ,OAAOviB,EAAEvB,EAAEywC,KAAK,KAAKlvC,EAAEuiB,QAAQ,KAAK,MAAM,IAAK,YAAYviB,EAAEvB,EAAEywC,KAAK,IAAI,IAAI3mC,EAAE,KAAK,OAAOvI,GAAG,OAAOA,EAAEqN,YAAY9E,EAAEvI,GAAGA,EAAEA,EAAEuiB,QAAQ,OAAOha,EAAE7J,GAAG,OAAOD,EAAEywC,KAAKzwC,EAAEywC,KAAK,KAAKzwC,EAAEywC,KAAK3sB,QAAQ,KAAKha,EAAEga,QAAQ,KAAK,CAC5U,SAAS+sB,GAAE7wC,GAAG,IAAIC,EAAE,OAAOD,EAAE4O,WAAW5O,EAAE4O,UAAUiV,QAAQ7jB,EAAE6jB,MAAMtiB,EAAE,EAAEuI,EAAE,EAAE,GAAG7J,EAAE,IAAI,IAAIgW,EAAEjW,EAAE6jB,MAAM,OAAO5N,GAAG1U,GAAG0U,EAAEkrB,MAAMlrB,EAAE8qB,WAAWj3B,GAAkB,SAAfmM,EAAEi6B,aAAsBpmC,GAAW,SAARmM,EAAEvG,MAAeuG,EAAEsN,OAAOvjB,EAAEiW,EAAEA,EAAE6N,aAAa,IAAI7N,EAAEjW,EAAE6jB,MAAM,OAAO5N,GAAG1U,GAAG0U,EAAEkrB,MAAMlrB,EAAE8qB,WAAWj3B,GAAGmM,EAAEi6B,aAAapmC,GAAGmM,EAAEvG,MAAMuG,EAAEsN,OAAOvjB,EAAEiW,EAAEA,EAAE6N,QAAyC,OAAjC9jB,EAAEkwC,cAAcpmC,EAAE9J,EAAE+gC,WAAWx/B,EAAStB,CAAC,CAC7V,SAAS6wC,GAAG9wC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE7J,EAAEs/B,aAAmB,OAANV,GAAG5+B,GAAUA,EAAEuU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,OAAOq8B,GAAE5wC,GAAG,KAAK,KAAK,EAUtD,KAAK,GAAG,OAAOk9B,GAAGl9B,EAAEiV,OAAOmoB,KAAKwT,GAAE5wC,GAAG,KAVqD,KAAK,EAA2Q,OAAzQ6J,EAAE7J,EAAEgiB,UAAUqkB,KAAK7J,GAAEI,IAAIJ,GAAEG,IAAGgK,KAAK98B,EAAEilC,iBAAiBjlC,EAAEw3B,QAAQx3B,EAAEilC,eAAejlC,EAAEilC,eAAe,MAAS,OAAO/uC,GAAG,OAAOA,EAAE6jB,QAAMkc,GAAG9/B,GAAGA,EAAEyP,OAAO,EAAE,OAAO1P,GAAGA,EAAEyjB,cAAciF,cAAc,KAAa,IAARzoB,EAAEyP,SAAazP,EAAEyP,OAAO,KAAK,OAAOuvB,KAAK8R,GAAG9R,IAAIA,GAAG,QAAOiQ,GAAGlvC,EAAEC,GAAG4wC,GAAE5wC,GAAU,KAAK,KAAK,EAAEumC,GAAGvmC,GAAG,IAAIgW,EAAEkwB,GAAGD,GAAGniB,SAC7e,GAATxiB,EAAEtB,EAAEiV,KAAQ,OAAOlV,GAAG,MAAMC,EAAEgiB,UAAUktB,GAAGnvC,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAGjW,EAAEilC,MAAMhlC,EAAEglC,MAAMhlC,EAAEyP,OAAO,IAAIzP,EAAEyP,OAAO,aAAa,CAAC,IAAI5F,EAAE,CAAC,GAAG,OAAO7J,EAAEgiB,UAAU,MAAM/tB,MAAMogB,EAAE,MAAW,OAALu8B,GAAE5wC,GAAU,IAAI,CAAkB,GAAjBD,EAAEmmC,GAAGH,GAAGjiB,SAAYgc,GAAG9/B,GAAG,CAAC6J,EAAE7J,EAAEgiB,UAAU1gB,EAAEtB,EAAEiV,KAAK,IAAIzlB,EAAEwQ,EAAE+/B,cAA+C,OAAjCl2B,EAAEoyB,IAAIj8B,EAAE6J,EAAEqyB,IAAI1sC,EAAEuQ,EAAE,KAAY,EAAPC,EAAE2/B,MAAer+B,GAAG,IAAK,SAASy3B,GAAE,SAASlvB,GAAGkvB,GAAE,QAAQlvB,GAAG,MAAM,IAAK,SAAS,IAAK,SAAS,IAAK,QAAQkvB,GAAE,OAAOlvB,GAAG,MAAM,IAAK,QAAQ,IAAK,QAAQ,IAAImM,EAAE,EAAEA,EAAEwiB,GAAGxnC,OAAOglB,IAAI+iB,GAAEP,GAAGxiB,GAAGnM,GAAG,MAAM,IAAK,SAASkvB,GAAE,QAAQlvB,GAAG,MAAM,IAAK,MAAM,IAAK,QAAQ,IAAK,OAAOkvB,GAAE,QACnhBlvB,GAAGkvB,GAAE,OAAOlvB,GAAG,MAAM,IAAK,UAAUkvB,GAAE,SAASlvB,GAAG,MAAM,IAAK,QAAQqR,EAAGrR,EAAEra,GAAGupC,GAAE,UAAUlvB,GAAG,MAAM,IAAK,SAASA,EAAEmR,cAAc,CAAC+1B,cAAcvhD,EAAEwhD,UAAUjY,GAAE,UAAUlvB,GAAG,MAAM,IAAK,WAAWoS,GAAGpS,EAAEra,GAAGupC,GAAE,UAAUlvB,GAAkB,IAAI,IAAIoM,KAAvBkL,GAAG7f,EAAE9R,GAAGwmB,EAAE,KAAkBxmB,EAAE,GAAGA,EAAE4K,eAAe6b,GAAG,CAAC,IAAIgD,EAAEzpB,EAAEymB,GAAG,aAAaA,EAAE,kBAAkBgD,EAAEpP,EAAEuS,cAAcnD,KAAI,IAAKzpB,EAAEyhD,0BAA0BvW,GAAG7wB,EAAEuS,YAAYnD,EAAElZ,GAAGiW,EAAE,CAAC,WAAWiD,IAAI,kBAAkBA,GAAGpP,EAAEuS,cAAc,GAAGnD,KAAI,IAAKzpB,EAAEyhD,0BAA0BvW,GAAG7wB,EAAEuS,YAC1enD,EAAElZ,GAAGiW,EAAE,CAAC,WAAW,GAAGiD,IAAI1D,EAAGnb,eAAe6b,IAAI,MAAMgD,GAAG,aAAahD,GAAG8iB,GAAE,SAASlvB,EAAE,CAAC,OAAOvI,GAAG,IAAK,QAAQyY,EAAGlQ,GAAG0R,EAAG1R,EAAEra,GAAE,GAAI,MAAM,IAAK,WAAWuqB,EAAGlQ,GAAGsS,GAAGtS,GAAG,MAAM,IAAK,SAAS,IAAK,SAAS,MAAM,QAAQ,oBAAoBra,EAAE0hD,UAAUrnC,EAAEsnC,QAAQxW,IAAI9wB,EAAEmM,EAAEhW,EAAE8hC,YAAYj4B,EAAE,OAAOA,IAAI7J,EAAEyP,OAAO,EAAE,KAAK,CAACwG,EAAE,IAAID,EAAEiH,SAASjH,EAAEA,EAAEwF,cAAc,iCAAiCzb,IAAIA,EAAEsc,GAAG/a,IAAI,iCAAiCvB,EAAE,WAAWuB,IAAGvB,EAAEkW,EAAEL,cAAc,QAAS6G,UAAU,qBAAuB1c,EAAEA,EAAE4c,YAAY5c,EAAE2c,aAC/f,kBAAkB7S,EAAEwX,GAAGthB,EAAEkW,EAAEL,cAActU,EAAE,CAAC+f,GAAGxX,EAAEwX,MAAMthB,EAAEkW,EAAEL,cAActU,GAAG,WAAWA,IAAI2U,EAAElW,EAAE8J,EAAEmnC,SAAS/6B,EAAE+6B,UAAS,EAAGnnC,EAAEunC,OAAOn7B,EAAEm7B,KAAKvnC,EAAEunC,QAAQrxC,EAAEkW,EAAEo7B,gBAAgBtxC,EAAEuB,GAAGvB,EAAEk8B,IAAIj8B,EAAED,EAAEm8B,IAAIryB,EAAEmlC,GAAGjvC,EAAEC,GAAE,GAAG,GAAIA,EAAEgiB,UAAUjiB,EAAEA,EAAE,CAAW,OAAVkW,EAAEmL,GAAG9f,EAAEuI,GAAUvI,GAAG,IAAK,SAASy3B,GAAE,SAASh5B,GAAGg5B,GAAE,QAAQh5B,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,SAAS,IAAK,SAAS,IAAK,QAAQkvB,GAAE,OAAOh5B,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,QAAQ,IAAK,QAAQ,IAAImM,EAAE,EAAEA,EAAEwiB,GAAGxnC,OAAOglB,IAAI+iB,GAAEP,GAAGxiB,GAAGjW,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,SAASkvB,GAAE,QAAQh5B,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,MAAM,IAAK,QAAQ,IAAK,OAAOkvB,GAAE,QAClfh5B,GAAGg5B,GAAE,OAAOh5B,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,UAAUkvB,GAAE,SAASh5B,GAAGiW,EAAEnM,EAAE,MAAM,IAAK,QAAQqR,EAAGnb,EAAE8J,GAAGmM,EAAE6E,EAAG9a,EAAE8J,GAAGkvB,GAAE,UAAUh5B,GAAG,MAAM,IAAK,SAAiL,QAAQiW,EAAEnM,QAAxK,IAAK,SAAS9J,EAAEib,cAAc,CAAC+1B,cAAclnC,EAAEmnC,UAAUh7B,EAAEhN,EAAE,CAAC,EAAEa,EAAE,CAACla,WAAM,IAASopC,GAAE,UAAUh5B,GAAG,MAAM,IAAK,WAAWkc,GAAGlc,EAAE8J,GAAGmM,EAAE8F,GAAG/b,EAAE8J,GAAGkvB,GAAE,UAAUh5B,GAAiC,IAAIvQ,KAAhB2xB,GAAG7f,EAAE0U,GAAGiD,EAAEjD,EAAa,GAAGiD,EAAE7e,eAAe5K,GAAG,CAAC,IAAI2R,EAAE8X,EAAEzpB,GAAG,UAAUA,EAAEywB,GAAGlgB,EAAEoB,GAAG,4BAA4B3R,EAAuB,OAApB2R,EAAEA,EAAEA,EAAE45B,YAAO,IAAgBxe,GAAGxc,EAAEoB,GAAI,aAAa3R,EAAE,kBAAkB2R,GAAG,aAC7eG,GAAG,KAAKH,IAAI4b,GAAGhd,EAAEoB,GAAG,kBAAkBA,GAAG4b,GAAGhd,EAAE,GAAGoB,GAAG,mCAAmC3R,GAAG,6BAA6BA,GAAG,cAAcA,IAAI+lB,EAAGnb,eAAe5K,GAAG,MAAM2R,GAAG,aAAa3R,GAAGupC,GAAE,SAASh5B,GAAG,MAAMoB,GAAG0V,EAAG9W,EAAEvQ,EAAE2R,EAAE8U,GAAG,CAAC,OAAO3U,GAAG,IAAK,QAAQyY,EAAGha,GAAGwb,EAAGxb,EAAE8J,GAAE,GAAI,MAAM,IAAK,WAAWkQ,EAAGha,GAAGoc,GAAGpc,GAAG,MAAM,IAAK,SAAS,MAAM8J,EAAEla,OAAOoQ,EAAEmX,aAAa,QAAQ,GAAG0C,EAAG/P,EAAEla,QAAQ,MAAM,IAAK,SAASoQ,EAAEixC,WAAWnnC,EAAEmnC,SAAmB,OAAVxhD,EAAEqa,EAAEla,OAAc+rB,GAAG3b,IAAI8J,EAAEmnC,SAASxhD,GAAE,GAAI,MAAMqa,EAAEkR,cAAcW,GAAG3b,IAAI8J,EAAEmnC,SAASnnC,EAAEkR,cAClf,GAAI,MAAM,QAAQ,oBAAoB/E,EAAEk7B,UAAUnxC,EAAEoxC,QAAQxW,IAAI,OAAOr5B,GAAG,IAAK,SAAS,IAAK,QAAQ,IAAK,SAAS,IAAK,WAAWuI,IAAIA,EAAEynC,UAAU,MAAMvxC,EAAE,IAAK,MAAM8J,GAAE,EAAG,MAAM9J,EAAE,QAAQ8J,GAAE,EAAG,CAACA,IAAI7J,EAAEyP,OAAO,EAAE,CAAC,OAAOzP,EAAEglC,MAAMhlC,EAAEyP,OAAO,IAAIzP,EAAEyP,OAAO,QAAQ,CAAM,OAALmhC,GAAE5wC,GAAU,KAAK,KAAK,EAAE,GAAGD,GAAG,MAAMC,EAAEgiB,UAAUmtB,GAAGpvC,EAAEC,EAAED,EAAEggC,cAAcl2B,OAAO,CAAC,GAAG,kBAAkBA,GAAG,OAAO7J,EAAEgiB,UAAU,MAAM/tB,MAAMogB,EAAE,MAAsC,GAAhC/S,EAAE4kC,GAAGD,GAAGniB,SAASoiB,GAAGH,GAAGjiB,SAAYgc,GAAG9/B,GAAG,CAAyC,GAAxC6J,EAAE7J,EAAEgiB,UAAU1gB,EAAEtB,EAAE+/B,cAAcl2B,EAAEoyB,IAAIj8B,GAAKxQ,EAAEqa,EAAEqT,YAAY5b,IAC/e,QADofvB,EACvf8+B,IAAY,OAAO9+B,EAAEwU,KAAK,KAAK,EAAEmmB,GAAG7wB,EAAEqT,UAAU5b,EAAE,KAAY,EAAPvB,EAAE4/B,OAAS,MAAM,KAAK,GAAE,IAAK5/B,EAAEggC,cAAckR,0BAA0BvW,GAAG7wB,EAAEqT,UAAU5b,EAAE,KAAY,EAAPvB,EAAE4/B,OAASnwC,IAAIwQ,EAAEyP,OAAO,EAAE,MAAM5F,GAAG,IAAIvI,EAAE2b,SAAS3b,EAAEA,EAAEka,eAAe+1B,eAAe1nC,IAAKoyB,IAAIj8B,EAAEA,EAAEgiB,UAAUnY,CAAC,CAAM,OAAL+mC,GAAE5wC,GAAU,KAAK,KAAK,GAA0B,GAAvBw8B,GAAEvxB,IAAGpB,EAAE7J,EAAEwjB,cAAiB,OAAOzjB,GAAG,OAAOA,EAAEyjB,eAAe,OAAOzjB,EAAEyjB,cAAcC,WAAW,CAAC,GAAGsb,IAAG,OAAOD,IAAI,KAAY,EAAP9+B,EAAE2/B,OAAS,KAAa,IAAR3/B,EAAEyP,OAAWuwB,KAAKC,KAAKjgC,EAAEyP,OAAO,MAAMjgB,GAAE,OAAQ,GAAGA,EAAEswC,GAAG9/B,GAAG,OAAO6J,GAAG,OAAOA,EAAE4Z,WAAW,CAAC,GAAG,OAC5f1jB,EAAE,CAAC,IAAIvQ,EAAE,MAAMyE,MAAMogB,EAAE,MAAqD,KAA7B7kB,EAAE,QAApBA,EAAEwQ,EAAEwjB,eAAyBh0B,EAAEi0B,WAAW,MAAW,MAAMxvB,MAAMogB,EAAE,MAAM7kB,EAAEysC,IAAIj8B,CAAC,MAAMigC,KAAK,KAAa,IAARjgC,EAAEyP,SAAazP,EAAEwjB,cAAc,MAAMxjB,EAAEyP,OAAO,EAAEmhC,GAAE5wC,GAAGxQ,GAAE,CAAE,MAAM,OAAOwvC,KAAK8R,GAAG9R,IAAIA,GAAG,MAAMxvC,GAAE,EAAG,IAAIA,EAAE,OAAe,MAARwQ,EAAEyP,MAAYzP,EAAE,IAAI,CAAC,OAAG,KAAa,IAARA,EAAEyP,QAAkBzP,EAAEkhC,MAAM5/B,EAAEtB,KAAE6J,EAAE,OAAOA,MAAO,OAAO9J,GAAG,OAAOA,EAAEyjB,gBAAgB3Z,IAAI7J,EAAE4jB,MAAMnU,OAAO,KAAK,KAAY,EAAPzP,EAAE2/B,QAAU,OAAO5/B,GAAG,KAAe,EAAVkL,GAAE6Y,SAAW,IAAI0tB,KAAIA,GAAE,GAAG3B,OAAO,OAAO7vC,EAAE8hC,cAAc9hC,EAAEyP,OAAO,GAAGmhC,GAAE5wC,GAAU,MAAK,KAAK,EAAE,OAAOqmC,KACrf4I,GAAGlvC,EAAEC,GAAG,OAAOD,GAAGq5B,GAAGp5B,EAAEgiB,UAAU0G,eAAekoB,GAAE5wC,GAAG,KAAK,KAAK,GAAG,OAAO2gC,GAAG3gC,EAAEiV,KAAKuE,UAAUo3B,GAAE5wC,GAAG,KAA+C,KAAK,GAA0B,GAAvBw8B,GAAEvxB,IAAwB,QAArBzb,EAAEwQ,EAAEwjB,eAA0B,OAAOotB,GAAE5wC,GAAG,KAAuC,GAAlC6J,EAAE,KAAa,IAAR7J,EAAEyP,OAA4B,QAAjBwG,EAAEzmB,EAAE6gD,WAAsB,GAAGxmC,EAAE8mC,GAAGnhD,GAAE,OAAQ,CAAC,GAAG,IAAIgiD,IAAG,OAAOzxC,GAAG,KAAa,IAARA,EAAE0P,OAAW,IAAI1P,EAAEC,EAAE4jB,MAAM,OAAO7jB,GAAG,CAAS,GAAG,QAAXkW,EAAEuwB,GAAGzmC,IAAe,CAAmG,IAAlGC,EAAEyP,OAAO,IAAIkhC,GAAGnhD,GAAE,GAAoB,QAAhBqa,EAAEoM,EAAE6rB,eAAuB9hC,EAAE8hC,YAAYj4B,EAAE7J,EAAEyP,OAAO,GAAGzP,EAAEiwC,aAAa,EAAEpmC,EAAEvI,EAAMA,EAAEtB,EAAE4jB,MAAM,OAAOtiB,GAAOvB,EAAE8J,GAANra,EAAE8R,GAAQmO,OAAO,SAC/d,QAAdwG,EAAEzmB,EAAEmf,YAAoBnf,EAAEsxC,WAAW,EAAEtxC,EAAE0xC,MAAMnhC,EAAEvQ,EAAEo0B,MAAM,KAAKp0B,EAAEygD,aAAa,EAAEzgD,EAAEuwC,cAAc,KAAKvwC,EAAEg0B,cAAc,KAAKh0B,EAAEsyC,YAAY,KAAKtyC,EAAEwxC,aAAa,KAAKxxC,EAAEwyB,UAAU,OAAOxyB,EAAEsxC,WAAW7qB,EAAE6qB,WAAWtxC,EAAE0xC,MAAMjrB,EAAEirB,MAAM1xC,EAAEo0B,MAAM3N,EAAE2N,MAAMp0B,EAAEygD,aAAa,EAAEzgD,EAAE4vC,UAAU,KAAK5vC,EAAEuwC,cAAc9pB,EAAE8pB,cAAcvwC,EAAEg0B,cAAcvN,EAAEuN,cAAch0B,EAAEsyC,YAAY7rB,EAAE6rB,YAAYtyC,EAAEylB,KAAKgB,EAAEhB,KAAKlV,EAAEkW,EAAE+qB,aAAaxxC,EAAEwxC,aAAa,OAAOjhC,EAAE,KAAK,CAACmhC,MAAMnhC,EAAEmhC,MAAMD,aAAalhC,EAAEkhC,eAAe3/B,EAAEA,EAAEuiB,QAA2B,OAAnB4Y,GAAExxB,GAAY,EAAVA,GAAE6Y,QAAU,GAAU9jB,EAAE4jB,KAAK,CAAC7jB,EAClgBA,EAAE8jB,OAAO,CAAC,OAAOr0B,EAAEghD,MAAMrnC,KAAIsoC,KAAKzxC,EAAEyP,OAAO,IAAI5F,GAAE,EAAG8mC,GAAGnhD,GAAE,GAAIwQ,EAAEkhC,MAAM,QAAQ,KAAK,CAAC,IAAIr3B,EAAE,GAAW,QAAR9J,EAAEymC,GAAGvwB,KAAa,GAAGjW,EAAEyP,OAAO,IAAI5F,GAAE,EAAmB,QAAhBvI,EAAEvB,EAAE+hC,eAAuB9hC,EAAE8hC,YAAYxgC,EAAEtB,EAAEyP,OAAO,GAAGkhC,GAAGnhD,GAAE,GAAI,OAAOA,EAAEghD,MAAM,WAAWhhD,EAAEihD,WAAWx6B,EAAEtH,YAAYowB,GAAE,OAAO6R,GAAE5wC,GAAG,UAAU,EAAEmJ,KAAI3Z,EAAE8gD,mBAAmBmB,IAAI,aAAanwC,IAAItB,EAAEyP,OAAO,IAAI5F,GAAE,EAAG8mC,GAAGnhD,GAAE,GAAIwQ,EAAEkhC,MAAM,SAAS1xC,EAAE4gD,aAAan6B,EAAE4N,QAAQ7jB,EAAE4jB,MAAM5jB,EAAE4jB,MAAM3N,IAAa,QAAT3U,EAAE9R,EAAE+gD,MAAcjvC,EAAEuiB,QAAQ5N,EAAEjW,EAAE4jB,MAAM3N,EAAEzmB,EAAE+gD,KAAKt6B,EAAE,CAAC,OAAG,OAAOzmB,EAAEghD,MAAYxwC,EAAExQ,EAAEghD,KAAKhhD,EAAE6gD,UAC9erwC,EAAExQ,EAAEghD,KAAKxwC,EAAE6jB,QAAQr0B,EAAE8gD,mBAAmBnnC,KAAInJ,EAAE6jB,QAAQ,KAAKviB,EAAE2J,GAAE6Y,QAAQ2Y,GAAExxB,GAAEpB,EAAI,EAAFvI,EAAI,EAAI,EAAFA,GAAKtB,IAAE4wC,GAAE5wC,GAAU,MAAK,KAAK,GAAG,KAAK,GAAG,OAAO0xC,KAAK7nC,EAAE,OAAO7J,EAAEwjB,cAAc,OAAOzjB,GAAG,OAAOA,EAAEyjB,gBAAgB3Z,IAAI7J,EAAEyP,OAAO,MAAM5F,GAAG,KAAY,EAAP7J,EAAE2/B,MAAQ,KAAQ,WAAH0O,MAAiBuC,GAAE5wC,GAAkB,EAAfA,EAAEiwC,eAAiBjwC,EAAEyP,OAAO,OAAOmhC,GAAE5wC,GAAG,KAAK,KAAK,GAAe,KAAK,GAAG,OAAO,KAAK,MAAM/L,MAAMogB,EAAE,IAAIrU,EAAEuU,KAAM,CAClX,SAASo9B,GAAG5xC,EAAEC,GAAS,OAAN4+B,GAAG5+B,GAAUA,EAAEuU,KAAK,KAAK,EAAE,OAAO2oB,GAAGl9B,EAAEiV,OAAOmoB,KAAiB,OAAZr9B,EAAEC,EAAEyP,QAAezP,EAAEyP,OAAS,MAAH1P,EAAS,IAAIC,GAAG,KAAK,KAAK,EAAE,OAAOqmC,KAAK7J,GAAEI,IAAIJ,GAAEG,IAAGgK,KAAe,KAAO,OAAjB5mC,EAAEC,EAAEyP,SAAqB,KAAO,IAAF1P,IAAQC,EAAEyP,OAAS,MAAH1P,EAAS,IAAIC,GAAG,KAAK,KAAK,EAAE,OAAOumC,GAAGvmC,GAAG,KAAK,KAAK,GAA0B,GAAvBw8B,GAAEvxB,IAAwB,QAArBlL,EAAEC,EAAEwjB,gBAA2B,OAAOzjB,EAAE0jB,WAAW,CAAC,GAAG,OAAOzjB,EAAE2O,UAAU,MAAM1a,MAAMogB,EAAE,MAAM4rB,IAAI,CAAW,OAAS,OAAnBlgC,EAAEC,EAAEyP,QAAsBzP,EAAEyP,OAAS,MAAH1P,EAAS,IAAIC,GAAG,KAAK,KAAK,GAAG,OAAOw8B,GAAEvxB,IAAG,KAAK,KAAK,EAAE,OAAOo7B,KAAK,KAAK,KAAK,GAAG,OAAO1F,GAAG3gC,EAAEiV,KAAKuE,UAAU,KAAK,KAAK,GAAG,KAAK,GAAG,OAAOk4B,KAC1gB,KAAyB,QAAQ,OAAO,KAAK,CArB7C1C,GAAG,SAASjvC,EAAEC,GAAG,IAAI,IAAIsB,EAAEtB,EAAE4jB,MAAM,OAAOtiB,GAAG,CAAC,GAAG,IAAIA,EAAEiT,KAAK,IAAIjT,EAAEiT,IAAIxU,EAAE6c,YAAYtb,EAAE0gB,gBAAgB,GAAG,IAAI1gB,EAAEiT,KAAK,OAAOjT,EAAEsiB,MAAM,CAACtiB,EAAEsiB,MAAMN,OAAOhiB,EAAEA,EAAEA,EAAEsiB,MAAM,QAAQ,CAAC,GAAGtiB,IAAItB,EAAE,MAAM,KAAK,OAAOsB,EAAEuiB,SAAS,CAAC,GAAG,OAAOviB,EAAEgiB,QAAQhiB,EAAEgiB,SAAStjB,EAAE,OAAOsB,EAAEA,EAAEgiB,MAAM,CAAChiB,EAAEuiB,QAAQP,OAAOhiB,EAAEgiB,OAAOhiB,EAAEA,EAAEuiB,OAAO,CAAC,EAAEorB,GAAG,WAAW,EACxTC,GAAG,SAASnvC,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEjW,EAAEggC,cAAc,GAAG/pB,IAAInM,EAAE,CAAC9J,EAAEC,EAAEgiB,UAAUkkB,GAAGH,GAAGjiB,SAAS,IAA4R7N,EAAxRzmB,EAAE,KAAK,OAAO8R,GAAG,IAAK,QAAQ0U,EAAE6E,EAAG9a,EAAEiW,GAAGnM,EAAEgR,EAAG9a,EAAE8J,GAAGra,EAAE,GAAG,MAAM,IAAK,SAASwmB,EAAEhN,EAAE,CAAC,EAAEgN,EAAE,CAACrmB,WAAM,IAASka,EAAEb,EAAE,CAAC,EAAEa,EAAE,CAACla,WAAM,IAASH,EAAE,GAAG,MAAM,IAAK,WAAWwmB,EAAE8F,GAAG/b,EAAEiW,GAAGnM,EAAEiS,GAAG/b,EAAE8J,GAAGra,EAAE,GAAG,MAAM,QAAQ,oBAAoBwmB,EAAEk7B,SAAS,oBAAoBrnC,EAAEqnC,UAAUnxC,EAAEoxC,QAAQxW,IAAyB,IAAI3hB,KAAzBmI,GAAG7f,EAAEuI,GAASvI,EAAE,KAAc0U,EAAE,IAAInM,EAAEzP,eAAe4e,IAAIhD,EAAE5b,eAAe4e,IAAI,MAAMhD,EAAEgD,GAAG,GAAG,UAAUA,EAAE,CAAC,IAAIC,EAAEjD,EAAEgD,GAAG,IAAI/C,KAAKgD,EAAEA,EAAE7e,eAAe6b,KACjf3U,IAAIA,EAAE,CAAC,GAAGA,EAAE2U,GAAG,GAAG,KAAK,4BAA4B+C,GAAG,aAAaA,GAAG,mCAAmCA,GAAG,6BAA6BA,GAAG,cAAcA,IAAIzD,EAAGnb,eAAe4e,GAAGxpB,IAAIA,EAAE,KAAKA,EAAEA,GAAG,IAAIgC,KAAKwnB,EAAE,OAAO,IAAIA,KAAKnP,EAAE,CAAC,IAAI1I,EAAE0I,EAAEmP,GAAyB,GAAtBC,EAAE,MAAMjD,EAAEA,EAAEgD,QAAG,EAAUnP,EAAEzP,eAAe4e,IAAI7X,IAAI8X,IAAI,MAAM9X,GAAG,MAAM8X,GAAG,GAAG,UAAUD,EAAE,GAAGC,EAAE,CAAC,IAAIhD,KAAKgD,GAAGA,EAAE7e,eAAe6b,IAAI9U,GAAGA,EAAE/G,eAAe6b,KAAK3U,IAAIA,EAAE,CAAC,GAAGA,EAAE2U,GAAG,IAAI,IAAIA,KAAK9U,EAAEA,EAAE/G,eAAe6b,IAAIgD,EAAEhD,KAAK9U,EAAE8U,KAAK3U,IAAIA,EAAE,CAAC,GAAGA,EAAE2U,GAAG9U,EAAE8U,GAAG,MAAM3U,IAAI9R,IAAIA,EAAE,IAAIA,EAAEgC,KAAKwnB,EACpf1X,IAAIA,EAAEH,MAAM,4BAA4B6X,GAAG7X,EAAEA,EAAEA,EAAE45B,YAAO,EAAO9hB,EAAEA,EAAEA,EAAE8hB,YAAO,EAAO,MAAM55B,GAAG8X,IAAI9X,IAAI3R,EAAEA,GAAG,IAAIgC,KAAKwnB,EAAE7X,IAAI,aAAa6X,EAAE,kBAAkB7X,GAAG,kBAAkBA,IAAI3R,EAAEA,GAAG,IAAIgC,KAAKwnB,EAAE,GAAG7X,GAAG,mCAAmC6X,GAAG,6BAA6BA,IAAIzD,EAAGnb,eAAe4e,IAAI,MAAM7X,GAAG,aAAa6X,GAAG+f,GAAE,SAASh5B,GAAGvQ,GAAGypB,IAAI9X,IAAI3R,EAAE,MAAMA,EAAEA,GAAG,IAAIgC,KAAKwnB,EAAE7X,GAAG,CAACG,IAAI9R,EAAEA,GAAG,IAAIgC,KAAK,QAAQ8P,GAAG,IAAI0X,EAAExpB,GAAKwQ,EAAE8hC,YAAY9oB,KAAEhZ,EAAEyP,OAAO,EAAC,CAAC,EAAE0/B,GAAG,SAASpvC,EAAEC,EAAEsB,EAAEuI,GAAGvI,IAAIuI,IAAI7J,EAAEyP,OAAO,EAAE,EAkBlb,IAAImiC,IAAG,EAAGC,IAAE,EAAGC,GAAG,oBAAoBC,QAAQA,QAAQz8B,IAAIvL,GAAE,KAAK,SAASioC,GAAGjyC,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEilC,IAAI,GAAG,OAAO1jC,EAAE,GAAG,oBAAoBA,EAAE,IAAIA,EAAE,KAAK,CAAC,MAAMuI,GAAGooC,GAAElyC,EAAEC,EAAE6J,EAAE,MAAMvI,EAAEwiB,QAAQ,IAAI,CAAC,SAASouB,GAAGnyC,EAAEC,EAAEsB,GAAG,IAAIA,GAAG,CAAC,MAAMuI,GAAGooC,GAAElyC,EAAEC,EAAE6J,EAAE,CAAC,CAAC,IAAIsoC,IAAG,EAIxR,SAASC,GAAGryC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE7J,EAAE8hC,YAAyC,GAAG,QAAhCj4B,EAAE,OAAOA,EAAEA,EAAEs/B,WAAW,MAAiB,CAAC,IAAInzB,EAAEnM,EAAEA,EAAEvY,KAAK,EAAE,CAAC,IAAI0kB,EAAEzB,IAAIxU,KAAKA,EAAE,CAAC,IAAIvQ,EAAEwmB,EAAE0zB,QAAQ1zB,EAAE0zB,aAAQ,OAAO,IAASl6C,GAAG0iD,GAAGlyC,EAAEsB,EAAE9R,EAAE,CAACwmB,EAAEA,EAAE1kB,IAAI,OAAO0kB,IAAInM,EAAE,CAAC,CAAC,SAASwoC,GAAGtyC,EAAEC,GAAgD,GAAG,QAAhCA,EAAE,QAAlBA,EAAEA,EAAE8hC,aAAuB9hC,EAAEmpC,WAAW,MAAiB,CAAC,IAAI7nC,EAAEtB,EAAEA,EAAE1O,KAAK,EAAE,CAAC,IAAIgQ,EAAEiT,IAAIxU,KAAKA,EAAE,CAAC,IAAI8J,EAAEvI,EAAEmoC,OAAOnoC,EAAEooC,QAAQ7/B,GAAG,CAACvI,EAAEA,EAAEhQ,IAAI,OAAOgQ,IAAItB,EAAE,CAAC,CAAC,SAASsyC,GAAGvyC,GAAG,IAAIC,EAAED,EAAEilC,IAAI,GAAG,OAAOhlC,EAAE,CAAC,IAAIsB,EAAEvB,EAAEiiB,UAAiBjiB,EAAEwU,IAA8BxU,EAAEuB,EAAE,oBAAoBtB,EAAEA,EAAED,GAAGC,EAAE8jB,QAAQ/jB,CAAC,CAAC,CAClf,SAASwyC,GAAGxyC,GAAG,IAAIC,EAAED,EAAE4O,UAAU,OAAO3O,IAAID,EAAE4O,UAAU,KAAK4jC,GAAGvyC,IAAID,EAAE6jB,MAAM,KAAK7jB,EAAEq/B,UAAU,KAAKr/B,EAAE8jB,QAAQ,KAAK,IAAI9jB,EAAEwU,MAAoB,QAAdvU,EAAED,EAAEiiB,oBAA4BhiB,EAAEi8B,WAAWj8B,EAAEk8B,WAAWl8B,EAAEg5B,WAAWh5B,EAAEm8B,WAAWn8B,EAAEo8B,MAAMr8B,EAAEiiB,UAAU,KAAKjiB,EAAEujB,OAAO,KAAKvjB,EAAEihC,aAAa,KAAKjhC,EAAEggC,cAAc,KAAKhgC,EAAEyjB,cAAc,KAAKzjB,EAAEu/B,aAAa,KAAKv/B,EAAEiiB,UAAU,KAAKjiB,EAAE+hC,YAAY,IAAI,CAAC,SAAS0Q,GAAGzyC,GAAG,OAAO,IAAIA,EAAEwU,KAAK,IAAIxU,EAAEwU,KAAK,IAAIxU,EAAEwU,GAAG,CACna,SAASk+B,GAAG1yC,GAAGA,EAAE,OAAO,CAAC,KAAK,OAAOA,EAAE8jB,SAAS,CAAC,GAAG,OAAO9jB,EAAEujB,QAAQkvB,GAAGzyC,EAAEujB,QAAQ,OAAO,KAAKvjB,EAAEA,EAAEujB,MAAM,CAA2B,IAA1BvjB,EAAE8jB,QAAQP,OAAOvjB,EAAEujB,OAAWvjB,EAAEA,EAAE8jB,QAAQ,IAAI9jB,EAAEwU,KAAK,IAAIxU,EAAEwU,KAAK,KAAKxU,EAAEwU,KAAK,CAAC,GAAW,EAARxU,EAAE0P,MAAQ,SAAS1P,EAAE,GAAG,OAAOA,EAAE6jB,OAAO,IAAI7jB,EAAEwU,IAAI,SAASxU,EAAOA,EAAE6jB,MAAMN,OAAOvjB,EAAEA,EAAEA,EAAE6jB,KAAK,CAAC,KAAa,EAAR7jB,EAAE0P,OAAS,OAAO1P,EAAEiiB,SAAS,CAAC,CACzT,SAAS0wB,GAAG3yC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEwU,IAAI,GAAG,IAAI1K,GAAG,IAAIA,EAAE9J,EAAEA,EAAEiiB,UAAUhiB,EAAE,IAAIsB,EAAE2b,SAAS3b,EAAEogB,WAAWixB,aAAa5yC,EAAEC,GAAGsB,EAAEqxC,aAAa5yC,EAAEC,IAAI,IAAIsB,EAAE2b,UAAUjd,EAAEsB,EAAEogB,YAAaixB,aAAa5yC,EAAEuB,IAAKtB,EAAEsB,GAAIsb,YAAY7c,GAA4B,QAAxBuB,EAAEA,EAAEsxC,2BAA8B,IAAStxC,GAAG,OAAOtB,EAAEmxC,UAAUnxC,EAAEmxC,QAAQxW,UAAU,GAAG,IAAI9wB,GAAc,QAAV9J,EAAEA,EAAE6jB,OAAgB,IAAI8uB,GAAG3yC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE8jB,QAAQ,OAAO9jB,GAAG2yC,GAAG3yC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE8jB,OAAO,CAC1X,SAASgvB,GAAG9yC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEwU,IAAI,GAAG,IAAI1K,GAAG,IAAIA,EAAE9J,EAAEA,EAAEiiB,UAAUhiB,EAAEsB,EAAEqxC,aAAa5yC,EAAEC,GAAGsB,EAAEsb,YAAY7c,QAAQ,GAAG,IAAI8J,GAAc,QAAV9J,EAAEA,EAAE6jB,OAAgB,IAAIivB,GAAG9yC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE8jB,QAAQ,OAAO9jB,GAAG8yC,GAAG9yC,EAAEC,EAAEsB,GAAGvB,EAAEA,EAAE8jB,OAAO,CAAC,IAAI5Z,GAAE,KAAK6oC,IAAG,EAAG,SAASC,GAAGhzC,EAAEC,EAAEsB,GAAG,IAAIA,EAAEA,EAAEsiB,MAAM,OAAOtiB,GAAG0xC,GAAGjzC,EAAEC,EAAEsB,GAAGA,EAAEA,EAAEuiB,OAAO,CACnR,SAASmvB,GAAGjzC,EAAEC,EAAEsB,GAAG,GAAGikB,IAAI,oBAAoBA,GAAG0tB,qBAAqB,IAAI1tB,GAAG0tB,qBAAqB3tB,GAAGhkB,EAAE,CAAC,MAAM2X,GAAG,CAAC,OAAO3X,EAAEiT,KAAK,KAAK,EAAEs9B,IAAGG,GAAG1wC,EAAEtB,GAAG,KAAK,EAAE,IAAI6J,EAAEI,GAAE+L,EAAE88B,GAAG7oC,GAAE,KAAK8oC,GAAGhzC,EAAEC,EAAEsB,GAAOwxC,GAAG98B,EAAE,QAAT/L,GAAEJ,KAAkBipC,IAAI/yC,EAAEkK,GAAE3I,EAAEA,EAAE0gB,UAAU,IAAIjiB,EAAEkd,SAASld,EAAE2hB,WAAW/E,YAAYrb,GAAGvB,EAAE4c,YAAYrb,IAAI2I,GAAE0S,YAAYrb,EAAE0gB,YAAY,MAAM,KAAK,GAAG,OAAO/X,KAAI6oC,IAAI/yC,EAAEkK,GAAE3I,EAAEA,EAAE0gB,UAAU,IAAIjiB,EAAEkd,SAAS2e,GAAG77B,EAAE2hB,WAAWpgB,GAAG,IAAIvB,EAAEkd,UAAU2e,GAAG77B,EAAEuB,GAAG4nB,GAAGnpB,IAAI67B,GAAG3xB,GAAE3I,EAAE0gB,YAAY,MAAM,KAAK,EAAEnY,EAAEI,GAAE+L,EAAE88B,GAAG7oC,GAAE3I,EAAE0gB,UAAU0G,cAAcoqB,IAAG,EAClfC,GAAGhzC,EAAEC,EAAEsB,GAAG2I,GAAEJ,EAAEipC,GAAG98B,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI67B,KAAoB,QAAhBhoC,EAAEvI,EAAEwgC,cAAsC,QAAfj4B,EAAEA,EAAEs/B,aAAsB,CAACnzB,EAAEnM,EAAEA,EAAEvY,KAAK,EAAE,CAAC,IAAI9B,EAAEwmB,EAAEC,EAAEzmB,EAAEk6C,QAAQl6C,EAAEA,EAAE+kB,SAAI,IAAS0B,IAAI,KAAO,EAAFzmB,IAAe,KAAO,EAAFA,KAAf0iD,GAAG5wC,EAAEtB,EAAEiW,GAAyBD,EAAEA,EAAE1kB,IAAI,OAAO0kB,IAAInM,EAAE,CAACkpC,GAAGhzC,EAAEC,EAAEsB,GAAG,MAAM,KAAK,EAAE,IAAIuwC,KAAIG,GAAG1wC,EAAEtB,GAAiB,oBAAd6J,EAAEvI,EAAE0gB,WAAgCkxB,sBAAsB,IAAIrpC,EAAE46B,MAAMnjC,EAAEy+B,cAAcl2B,EAAEvB,MAAMhH,EAAEkiB,cAAc3Z,EAAEqpC,sBAAsB,CAAC,MAAMj6B,GAAGg5B,GAAE3wC,EAAEtB,EAAEiZ,EAAE,CAAC85B,GAAGhzC,EAAEC,EAAEsB,GAAG,MAAM,KAAK,GAAGyxC,GAAGhzC,EAAEC,EAAEsB,GAAG,MAAM,KAAK,GAAU,EAAPA,EAAEq+B,MAAQkS,IAAGhoC,EAAEgoC,KAAI,OAChfvwC,EAAEkiB,cAAcuvB,GAAGhzC,EAAEC,EAAEsB,GAAGuwC,GAAEhoC,GAAGkpC,GAAGhzC,EAAEC,EAAEsB,GAAG,MAAM,QAAQyxC,GAAGhzC,EAAEC,EAAEsB,GAAG,CAAC,SAAS6xC,GAAGpzC,GAAG,IAAIC,EAAED,EAAE+hC,YAAY,GAAG,OAAO9hC,EAAE,CAACD,EAAE+hC,YAAY,KAAK,IAAIxgC,EAAEvB,EAAEiiB,UAAU,OAAO1gB,IAAIA,EAAEvB,EAAEiiB,UAAU,IAAI8vB,IAAI9xC,EAAE0W,SAAQ,SAAS1W,GAAG,IAAI6J,EAAEupC,GAAG/Z,KAAK,KAAKt5B,EAAEC,GAAGsB,EAAEpH,IAAI8F,KAAKsB,EAAEoU,IAAI1V,GAAGA,EAAEy7B,KAAK5xB,EAAEA,GAAG,GAAE,CAAC,CACzQ,SAASwpC,GAAGtzC,EAAEC,GAAG,IAAIsB,EAAEtB,EAAEo/B,UAAU,GAAG,OAAO99B,EAAE,IAAI,IAAIuI,EAAE,EAAEA,EAAEvI,EAAEtQ,OAAO6Y,IAAI,CAAC,IAAImM,EAAE1U,EAAEuI,GAAG,IAAI,IAAIra,EAAEuQ,EAAEkW,EAAEjW,EAAEiZ,EAAEhD,EAAElW,EAAE,KAAK,OAAOkZ,GAAG,CAAC,OAAOA,EAAE1E,KAAK,KAAK,EAAEtK,GAAEgP,EAAE+I,UAAU8wB,IAAG,EAAG,MAAM/yC,EAAE,KAAK,EAA4C,KAAK,EAAEkK,GAAEgP,EAAE+I,UAAU0G,cAAcoqB,IAAG,EAAG,MAAM/yC,EAAEkZ,EAAEA,EAAEqK,MAAM,CAAC,GAAG,OAAOrZ,GAAE,MAAMhW,MAAMogB,EAAE,MAAM2+B,GAAGxjD,EAAEymB,EAAED,GAAG/L,GAAE,KAAK6oC,IAAG,EAAG,IAAI3xC,EAAE6U,EAAErH,UAAU,OAAOxN,IAAIA,EAAEmiB,OAAO,MAAMtN,EAAEsN,OAAO,IAAI,CAAC,MAAMtK,GAAGi5B,GAAEj8B,EAAEhW,EAAEgZ,EAAE,CAAC,CAAC,GAAkB,MAAfhZ,EAAEiwC,aAAmB,IAAIjwC,EAAEA,EAAE4jB,MAAM,OAAO5jB,GAAGszC,GAAGtzC,EAAED,GAAGC,EAAEA,EAAE6jB,OAAO,CACje,SAASyvB,GAAGvzC,EAAEC,GAAG,IAAIsB,EAAEvB,EAAE4O,UAAU9E,EAAE9J,EAAE0P,MAAM,OAAO1P,EAAEwU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAiB,GAAd8+B,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAQ,EAAF8J,EAAI,CAAC,IAAIuoC,GAAG,EAAEryC,EAAEA,EAAEujB,QAAQ+uB,GAAG,EAAEtyC,EAAE,CAAC,MAAMsB,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,IAAI+wC,GAAG,EAAEryC,EAAEA,EAAEujB,OAAO,CAAC,MAAMjiB,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,CAAC,MAAM,KAAK,EAAEgyC,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAK,IAAF8J,GAAO,OAAOvI,GAAG0wC,GAAG1wC,EAAEA,EAAEgiB,QAAQ,MAAM,KAAK,EAAgD,GAA9C+vB,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAK,IAAF8J,GAAO,OAAOvI,GAAG0wC,GAAG1wC,EAAEA,EAAEgiB,QAAmB,GAARvjB,EAAE0P,MAAS,CAAC,IAAIuG,EAAEjW,EAAEiiB,UAAU,IAAIjF,GAAG/G,EAAE,GAAG,CAAC,MAAM3U,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,CAAC,GAAK,EAAFwI,GAAoB,OAAdmM,EAAEjW,EAAEiiB,WAAmB,CAAC,IAAIxyB,EAAEuQ,EAAEggC,cAAc9pB,EAAE,OAAO3U,EAAEA,EAAEy+B,cAAcvwC,EAAEypB,EAAElZ,EAAEkV,KAAK9T,EAAEpB,EAAE+hC,YACje,GAAnB/hC,EAAE+hC,YAAY,KAAQ,OAAO3gC,EAAE,IAAI,UAAU8X,GAAG,UAAUzpB,EAAEylB,MAAM,MAAMzlB,EAAEc,MAAM8qB,EAAGpF,EAAExmB,GAAG4xB,GAAGnI,EAAEhD,GAAG,IAAI+C,EAAEoI,GAAGnI,EAAEzpB,GAAG,IAAIymB,EAAE,EAAEA,EAAE9U,EAAEnQ,OAAOilB,GAAG,EAAE,CAAC,IAAI9W,EAAEgC,EAAE8U,GAAG+sB,EAAE7hC,EAAE8U,EAAE,GAAG,UAAU9W,EAAE8gB,GAAGjK,EAAEgtB,GAAG,4BAA4B7jC,EAAEod,GAAGvG,EAAEgtB,GAAG,aAAa7jC,EAAE4d,GAAG/G,EAAEgtB,GAAGnsB,EAAGb,EAAE7W,EAAE6jC,EAAEhqB,EAAE,CAAC,OAAOC,GAAG,IAAK,QAAQoC,EAAGrF,EAAExmB,GAAG,MAAM,IAAK,WAAW0sB,GAAGlG,EAAExmB,GAAG,MAAM,IAAK,SAAS,IAAI4R,EAAE4U,EAAEgF,cAAc+1B,YAAY/6B,EAAEgF,cAAc+1B,cAAcvhD,EAAEwhD,SAAS,IAAIxyC,EAAEhP,EAAEG,MAAM,MAAM6O,EAAEkd,GAAG1F,IAAIxmB,EAAEwhD,SAASxyC,GAAE,GAAI4C,MAAM5R,EAAEwhD,WAAW,MAAMxhD,EAAEurB,aAAaW,GAAG1F,IAAIxmB,EAAEwhD,SACnfxhD,EAAEurB,cAAa,GAAIW,GAAG1F,IAAIxmB,EAAEwhD,SAASxhD,EAAEwhD,SAAS,GAAG,IAAG,IAAKh7B,EAAEkmB,IAAI1sC,CAAC,CAAC,MAAM6R,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,CAAC,MAAM,KAAK,EAAgB,GAAdgyC,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAQ,EAAF8J,EAAI,CAAC,GAAG,OAAO9J,EAAEiiB,UAAU,MAAM/tB,MAAMogB,EAAE,MAAM2B,EAAEjW,EAAEiiB,UAAUxyB,EAAEuQ,EAAEggC,cAAc,IAAI/pB,EAAEkH,UAAU1tB,CAAC,CAAC,MAAM6R,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,CAAC,MAAM,KAAK,EAAgB,GAAdgyC,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAQ,EAAF8J,GAAK,OAAOvI,GAAGA,EAAEkiB,cAAciF,aAAa,IAAIS,GAAGlpB,EAAE0oB,cAAc,CAAC,MAAMrnB,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,MAAM,KAAK,EAG4G,QAAQgyC,GAAGrzC,EACnfD,GAAGwzC,GAAGxzC,SAJ4Y,KAAK,GAAGszC,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAqB,MAAlBiW,EAAEjW,EAAE6jB,OAAQnU,QAAajgB,EAAE,OAAOwmB,EAAEwN,cAAcxN,EAAEgM,UAAUwxB,SAAShkD,GAAGA,GAClf,OAAOwmB,EAAErH,WAAW,OAAOqH,EAAErH,UAAU6U,gBAAgBiwB,GAAGtqC,OAAQ,EAAFU,GAAKspC,GAAGpzC,GAAG,MAAM,KAAK,GAAsF,GAAnFZ,EAAE,OAAOmC,GAAG,OAAOA,EAAEkiB,cAAqB,EAAPzjB,EAAE4/B,MAAQkS,IAAG74B,EAAE64B,KAAI1yC,EAAEk0C,GAAGrzC,EAAED,GAAG8xC,GAAE74B,GAAGq6B,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAQ,KAAF8J,EAAO,CAA0B,GAAzBmP,EAAE,OAAOjZ,EAAEyjB,eAAkBzjB,EAAEiiB,UAAUwxB,SAASx6B,KAAK7Z,GAAG,KAAY,EAAPY,EAAE4/B,MAAQ,IAAI51B,GAAEhK,EAAEZ,EAAEY,EAAE6jB,MAAM,OAAOzkB,GAAG,CAAC,IAAI6jC,EAAEj5B,GAAE5K,EAAE,OAAO4K,IAAG,CAAe,OAAVvL,GAAJ4C,EAAE2I,IAAM6Z,MAAaxiB,EAAEmT,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG69B,GAAG,EAAEhxC,EAAEA,EAAEkiB,QAAQ,MAAM,KAAK,EAAE0uB,GAAG5wC,EAAEA,EAAEkiB,QAAQ,IAAI9e,EAAEpD,EAAE4gB,UAAU,GAAG,oBAAoBxd,EAAE0uC,qBAAqB,CAACrpC,EAAEzI,EAAEE,EAAEF,EAAEkiB,OAAO,IAAItjB,EAAE6J,EAAErF,EAAEigC,MACpfzkC,EAAE+/B,cAAcv7B,EAAE8D,MAAMtI,EAAEwjB,cAAchf,EAAE0uC,sBAAsB,CAAC,MAAM7xC,GAAG4wC,GAAEpoC,EAAEvI,EAAED,EAAE,CAAC,CAAC,MAAM,KAAK,EAAE2wC,GAAG5wC,EAAEA,EAAEkiB,QAAQ,MAAM,KAAK,GAAG,GAAG,OAAOliB,EAAEoiB,cAAc,CAACkwB,GAAG1Q,GAAG,QAAQ,EAAE,OAAOxkC,GAAGA,EAAE8kB,OAAOliB,EAAE2I,GAAEvL,GAAGk1C,GAAG1Q,EAAE,CAAC7jC,EAAEA,EAAE0kB,OAAO,CAAC9jB,EAAE,IAAIZ,EAAE,KAAK6jC,EAAEjjC,IAAI,CAAC,GAAG,IAAIijC,EAAEzuB,KAAK,GAAG,OAAOpV,EAAE,CAACA,EAAE6jC,EAAE,IAAIhtB,EAAEgtB,EAAEhhB,UAAUhJ,EAAa,oBAAVxpB,EAAEwmB,EAAEkK,OAA4BC,YAAY3wB,EAAE2wB,YAAY,UAAU,OAAO,aAAa3wB,EAAEmkD,QAAQ,QAAS16B,EAAE+pB,EAAEhhB,UAAkC/L,OAAE,KAA1B9U,EAAE6hC,EAAEjD,cAAc7f,QAAoB,OAAO/e,GAAGA,EAAE/G,eAAe,WAAW+G,EAAEwyC,QAAQ,KAAK16B,EAAEiH,MAAMyzB,QACzf3zB,GAAG,UAAU/J,GAAG,CAAC,MAAM5U,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,CAAC,OAAO,GAAG,IAAI2hC,EAAEzuB,KAAK,GAAG,OAAOpV,EAAE,IAAI6jC,EAAEhhB,UAAU9E,UAAUlE,EAAE,GAAGgqB,EAAEjD,aAAa,CAAC,MAAM1+B,GAAG4wC,GAAElyC,EAAEA,EAAEujB,OAAOjiB,EAAE,OAAO,IAAI,KAAK2hC,EAAEzuB,KAAK,KAAKyuB,EAAEzuB,KAAK,OAAOyuB,EAAExf,eAAewf,IAAIjjC,IAAI,OAAOijC,EAAEpf,MAAM,CAACof,EAAEpf,MAAMN,OAAO0f,EAAEA,EAAEA,EAAEpf,MAAM,QAAQ,CAAC,GAAGof,IAAIjjC,EAAE,MAAMA,EAAE,KAAK,OAAOijC,EAAEnf,SAAS,CAAC,GAAG,OAAOmf,EAAE1f,QAAQ0f,EAAE1f,SAASvjB,EAAE,MAAMA,EAAEZ,IAAI6jC,IAAI7jC,EAAE,MAAM6jC,EAAEA,EAAE1f,MAAM,CAACnkB,IAAI6jC,IAAI7jC,EAAE,MAAM6jC,EAAEnf,QAAQP,OAAO0f,EAAE1f,OAAO0f,EAAEA,EAAEnf,OAAO,CAAC,CAAC,MAAM,KAAK,GAAGwvB,GAAGrzC,EAAED,GAAGwzC,GAAGxzC,GAAK,EAAF8J,GAAKspC,GAAGpzC,GAAS,KAAK,IACtd,CAAC,SAASwzC,GAAGxzC,GAAG,IAAIC,EAAED,EAAE0P,MAAM,GAAK,EAAFzP,EAAI,CAAC,IAAID,EAAE,CAAC,IAAI,IAAIuB,EAAEvB,EAAEujB,OAAO,OAAOhiB,GAAG,CAAC,GAAGkxC,GAAGlxC,GAAG,CAAC,IAAIuI,EAAEvI,EAAE,MAAMvB,CAAC,CAACuB,EAAEA,EAAEgiB,MAAM,CAAC,MAAMrvB,MAAMogB,EAAE,KAAM,CAAC,OAAOxK,EAAE0K,KAAK,KAAK,EAAE,IAAIyB,EAAEnM,EAAEmY,UAAkB,GAARnY,EAAE4F,QAAWsN,GAAG/G,EAAE,IAAInM,EAAE4F,QAAQ,IAAgBojC,GAAG9yC,EAAT0yC,GAAG1yC,GAAUiW,GAAG,MAAM,KAAK,EAAE,KAAK,EAAE,IAAIC,EAAEpM,EAAEmY,UAAU0G,cAAsBgqB,GAAG3yC,EAAT0yC,GAAG1yC,GAAUkW,GAAG,MAAM,QAAQ,MAAMhiB,MAAMogB,EAAE,MAAO,CAAC,MAAMlT,GAAG8wC,GAAElyC,EAAEA,EAAEujB,OAAOniB,EAAE,CAACpB,EAAE0P,QAAQ,CAAC,CAAG,KAAFzP,IAASD,EAAE0P,QAAQ,KAAK,CAAC,SAASmkC,GAAG7zC,EAAEC,EAAEsB,GAAGyI,GAAEhK,EAAE8zC,GAAG9zC,EAAEC,EAAEsB,EAAE,CACvb,SAASuyC,GAAG9zC,EAAEC,EAAEsB,GAAG,IAAI,IAAIuI,EAAE,KAAY,EAAP9J,EAAE4/B,MAAQ,OAAO51B,IAAG,CAAC,IAAIiM,EAAEjM,GAAEva,EAAEwmB,EAAE4N,MAAM,GAAG,KAAK5N,EAAEzB,KAAK1K,EAAE,CAAC,IAAIoM,EAAE,OAAOD,EAAEwN,eAAeouB,GAAG,IAAI37B,EAAE,CAAC,IAAIgD,EAAEjD,EAAErH,UAAUxN,EAAE,OAAO8X,GAAG,OAAOA,EAAEuK,eAAequB,GAAE54B,EAAE24B,GAAG,IAAI54B,EAAE64B,GAAO,GAALD,GAAG37B,GAAM47B,GAAE1wC,KAAK6X,EAAE,IAAIjP,GAAEiM,EAAE,OAAOjM,IAAO5I,GAAJ8U,EAAElM,IAAM6Z,MAAM,KAAK3N,EAAE1B,KAAK,OAAO0B,EAAEuN,cAAcswB,GAAG99B,GAAG,OAAO7U,GAAGA,EAAEmiB,OAAOrN,EAAElM,GAAE5I,GAAG2yC,GAAG99B,GAAG,KAAK,OAAOxmB,GAAGua,GAAEva,EAAEqkD,GAAGrkD,EAAEwQ,EAAEsB,GAAG9R,EAAEA,EAAEq0B,QAAQ9Z,GAAEiM,EAAE47B,GAAG34B,EAAE44B,GAAE74B,CAAC,CAAC+6B,GAAGh0C,EAAM,MAAM,KAAoB,KAAfiW,EAAEi6B,eAAoB,OAAOzgD,GAAGA,EAAE8zB,OAAOtN,EAAEjM,GAAEva,GAAGukD,GAAGh0C,EAAM,CAAC,CACvc,SAASg0C,GAAGh0C,GAAG,KAAK,OAAOgK,IAAG,CAAC,IAAI/J,EAAE+J,GAAE,GAAG,KAAa,KAAR/J,EAAEyP,OAAY,CAAC,IAAInO,EAAEtB,EAAE2O,UAAU,IAAI,GAAG,KAAa,KAAR3O,EAAEyP,OAAY,OAAOzP,EAAEuU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAGs9B,IAAGQ,GAAG,EAAEryC,GAAG,MAAM,KAAK,EAAE,IAAI6J,EAAE7J,EAAEgiB,UAAU,GAAW,EAARhiB,EAAEyP,QAAUoiC,GAAE,GAAG,OAAOvwC,EAAEuI,EAAEi7B,wBAAwB,CAAC,IAAI9uB,EAAEhW,EAAEm/B,cAAcn/B,EAAEiV,KAAK3T,EAAEy+B,cAAcK,GAAGpgC,EAAEiV,KAAK3T,EAAEy+B,eAAel2B,EAAE8kC,mBAAmB34B,EAAE1U,EAAEkiB,cAAc3Z,EAAEmqC,oCAAoC,CAAC,IAAIxkD,EAAEwQ,EAAE8hC,YAAY,OAAOtyC,GAAG0zC,GAAGljC,EAAExQ,EAAEqa,GAAG,MAAM,KAAK,EAAE,IAAIoM,EAAEjW,EAAE8hC,YAAY,GAAG,OAAO7rB,EAAE,CAAQ,GAAP3U,EAAE,KAAQ,OAAOtB,EAAE4jB,MAAM,OAAO5jB,EAAE4jB,MAAMrP,KAAK,KAAK,EACvf,KAAK,EAAEjT,EAAEtB,EAAE4jB,MAAM5B,UAAUkhB,GAAGljC,EAAEiW,EAAE3U,EAAE,CAAC,MAAM,KAAK,EAAE,IAAI2X,EAAEjZ,EAAEgiB,UAAU,GAAG,OAAO1gB,GAAW,EAARtB,EAAEyP,MAAQ,CAACnO,EAAE2X,EAAE,IAAI9X,EAAEnB,EAAE+/B,cAAc,OAAO//B,EAAEiV,MAAM,IAAK,SAAS,IAAK,QAAQ,IAAK,SAAS,IAAK,WAAW9T,EAAEmwC,WAAWhwC,EAAEw1B,QAAQ,MAAM,IAAK,MAAM31B,EAAEjN,MAAMoN,EAAEpN,IAAIiN,EAAEjN,KAAK,CAAC,MAAM,KAAK,EAAQ,KAAK,EAAQ,KAAK,GAAyJ,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAhM,KAAK,GAAG,GAAG,OAAO8L,EAAEwjB,cAAc,CAAC,IAAIxK,EAAEhZ,EAAE2O,UAAU,GAAG,OAAOqK,EAAE,CAAC,IAAI7Z,EAAE6Z,EAAEwK,cAAc,GAAG,OAAOrkB,EAAE,CAAC,IAAI6jC,EAAE7jC,EAAEskB,WAAW,OAAOuf,GAAG9Z,GAAG8Z,EAAE,CAAC,CAAC,CAAC,MAC5c,QAAQ,MAAM/uC,MAAMogB,EAAE,MAAOw9B,IAAW,IAAR7xC,EAAEyP,OAAW6iC,GAAGtyC,EAAE,CAAC,MAAMoB,GAAG6wC,GAAEjyC,EAAEA,EAAEsjB,OAAOliB,EAAE,CAAC,CAAC,GAAGpB,IAAID,EAAE,CAACgK,GAAE,KAAK,KAAK,CAAa,GAAG,QAAfzI,EAAEtB,EAAE6jB,SAAoB,CAACviB,EAAEgiB,OAAOtjB,EAAEsjB,OAAOvZ,GAAEzI,EAAE,KAAK,CAACyI,GAAE/J,EAAEsjB,MAAM,CAAC,CAAC,SAASowB,GAAG3zC,GAAG,KAAK,OAAOgK,IAAG,CAAC,IAAI/J,EAAE+J,GAAE,GAAG/J,IAAID,EAAE,CAACgK,GAAE,KAAK,KAAK,CAAC,IAAIzI,EAAEtB,EAAE6jB,QAAQ,GAAG,OAAOviB,EAAE,CAACA,EAAEgiB,OAAOtjB,EAAEsjB,OAAOvZ,GAAEzI,EAAE,KAAK,CAACyI,GAAE/J,EAAEsjB,MAAM,CAAC,CACvS,SAASwwB,GAAG/zC,GAAG,KAAK,OAAOgK,IAAG,CAAC,IAAI/J,EAAE+J,GAAE,IAAI,OAAO/J,EAAEuU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,IAAIjT,EAAEtB,EAAEsjB,OAAO,IAAI+uB,GAAG,EAAEryC,EAAE,CAAC,MAAMmB,GAAG8wC,GAAEjyC,EAAEsB,EAAEH,EAAE,CAAC,MAAM,KAAK,EAAE,IAAI0I,EAAE7J,EAAEgiB,UAAU,GAAG,oBAAoBnY,EAAEi7B,kBAAkB,CAAC,IAAI9uB,EAAEhW,EAAEsjB,OAAO,IAAIzZ,EAAEi7B,mBAAmB,CAAC,MAAM3jC,GAAG8wC,GAAEjyC,EAAEgW,EAAE7U,EAAE,CAAC,CAAC,IAAI3R,EAAEwQ,EAAEsjB,OAAO,IAAIgvB,GAAGtyC,EAAE,CAAC,MAAMmB,GAAG8wC,GAAEjyC,EAAExQ,EAAE2R,EAAE,CAAC,MAAM,KAAK,EAAE,IAAI8U,EAAEjW,EAAEsjB,OAAO,IAAIgvB,GAAGtyC,EAAE,CAAC,MAAMmB,GAAG8wC,GAAEjyC,EAAEiW,EAAE9U,EAAE,EAAE,CAAC,MAAMA,GAAG8wC,GAAEjyC,EAAEA,EAAEsjB,OAAOniB,EAAE,CAAC,GAAGnB,IAAID,EAAE,CAACgK,GAAE,KAAK,KAAK,CAAC,IAAIkP,EAAEjZ,EAAE6jB,QAAQ,GAAG,OAAO5K,EAAE,CAACA,EAAEqK,OAAOtjB,EAAEsjB,OAAOvZ,GAAEkP,EAAE,KAAK,CAAClP,GAAE/J,EAAEsjB,MAAM,CAAC,CAC7d,IAwBkN2wB,GAxB9MC,GAAG/zC,KAAKE,KAAK8zC,GAAG98B,EAAGyvB,uBAAuBsN,GAAG/8B,EAAGk2B,kBAAkB8G,GAAGh9B,EAAG+R,wBAAwBwZ,GAAE,EAAE7/B,GAAE,KAAKuxC,GAAE,KAAKC,GAAE,EAAElG,GAAG,EAAED,GAAG7R,GAAG,GAAGiV,GAAE,EAAEgD,GAAG,KAAKvR,GAAG,EAAEwR,GAAG,EAAEC,GAAG,EAAEC,GAAG,KAAKC,GAAG,KAAKnB,GAAG,EAAEhC,GAAGoD,IAASC,GAAG,KAAKpI,IAAG,EAAGC,GAAG,KAAKI,GAAG,KAAKgI,IAAG,EAAGC,GAAG,KAAKC,GAAG,EAAEC,GAAG,EAAEC,GAAG,KAAKC,IAAI,EAAEC,GAAG,EAAE,SAAShsC,KAAI,OAAO,KAAO,EAAFu5B,IAAKz5B,MAAK,IAAIisC,GAAGA,GAAGA,GAAGjsC,IAAG,CAChU,SAASw6B,GAAG5jC,GAAG,OAAG,KAAY,EAAPA,EAAE4/B,MAAe,EAAK,KAAO,EAAFiD,KAAM,IAAI2R,GAASA,IAAGA,GAAK,OAAOpU,GAAG5W,YAAkB,IAAI8rB,KAAKA,GAAG7uB,MAAM6uB,IAAU,KAAPt1C,EAAEqJ,IAAkBrJ,EAAiBA,OAAE,KAAjBA,EAAEqT,OAAO6f,OAAmB,GAAGnJ,GAAG/pB,EAAEkV,KAAc,CAAC,SAAS2uB,GAAG7jC,EAAEC,EAAEsB,EAAEuI,GAAG,GAAG,GAAGqrC,GAAG,MAAMA,GAAG,EAAEC,GAAG,KAAKlhD,MAAMogB,EAAE,MAAMqS,GAAG3mB,EAAEuB,EAAEuI,GAAM,KAAO,EAAF+4B,KAAM7iC,IAAIgD,KAAEhD,IAAIgD,KAAI,KAAO,EAAF6/B,MAAO6R,IAAInzC,GAAG,IAAIkwC,IAAG8D,GAAGv1C,EAAEw0C,KAAIgB,GAAGx1C,EAAE8J,GAAG,IAAIvI,GAAG,IAAIshC,IAAG,KAAY,EAAP5iC,EAAE2/B,QAAU8R,GAAGtoC,KAAI,IAAIy0B,IAAIG,MAAK,CAC1Y,SAASwX,GAAGx1C,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEy1C,cA5MzB,SAAYz1C,EAAEC,GAAG,IAAI,IAAIsB,EAAEvB,EAAEmmB,eAAerc,EAAE9J,EAAEomB,YAAYnQ,EAAEjW,EAAE01C,gBAAgBjmD,EAAEuQ,EAAEkmB,aAAa,EAAEz2B,GAAG,CAAC,IAAIymB,EAAE,GAAGuP,GAAGh2B,GAAGypB,EAAE,GAAGhD,EAAE9U,EAAE6U,EAAEC,IAAO,IAAI9U,EAAM,KAAK8X,EAAE3X,IAAI,KAAK2X,EAAEpP,KAAGmM,EAAEC,GAAGqQ,GAAGrN,EAAEjZ,IAAQmB,GAAGnB,IAAID,EAAE21C,cAAcz8B,GAAGzpB,IAAIypB,CAAC,CAAC,CA4MnL08B,CAAG51C,EAAEC,GAAG,IAAI6J,EAAEmc,GAAGjmB,EAAEA,IAAIgD,GAAEwxC,GAAE,GAAG,GAAG,IAAI1qC,EAAE,OAAOvI,GAAG6iB,GAAG7iB,GAAGvB,EAAEy1C,aAAa,KAAKz1C,EAAE61C,iBAAiB,OAAO,GAAG51C,EAAE6J,GAAGA,EAAE9J,EAAE61C,mBAAmB51C,EAAE,CAAgB,GAAf,MAAMsB,GAAG6iB,GAAG7iB,GAAM,IAAItB,EAAE,IAAID,EAAEwU,IA7IsJ,SAAYxU,GAAG69B,IAAG,EAAGE,GAAG/9B,EAAE,CA6I5K81C,CAAGC,GAAGzc,KAAK,KAAKt5B,IAAI+9B,GAAGgY,GAAGzc,KAAK,KAAKt5B,IAAIu7B,IAAG,WAAW,KAAO,EAAFsH,KAAM7E,IAAI,IAAGz8B,EAAE,SAAS,CAAC,OAAOulB,GAAGhd,IAAI,KAAK,EAAEvI,EAAEsjB,GAAG,MAAM,KAAK,EAAEtjB,EAAEwjB,GAAG,MAAM,KAAK,GAAwC,QAAQxjB,EAAE0jB,SAApC,KAAK,UAAU1jB,EAAE8jB,GAAsB9jB,EAAEy0C,GAAGz0C,EAAE00C,GAAG3c,KAAK,KAAKt5B,GAAG,CAACA,EAAE61C,iBAAiB51C,EAAED,EAAEy1C,aAAal0C,CAAC,CAAC,CAC7c,SAAS00C,GAAGj2C,EAAEC,GAAc,GAAXo1C,IAAI,EAAEC,GAAG,EAAK,KAAO,EAAFzS,IAAK,MAAM3uC,MAAMogB,EAAE,MAAM,IAAI/S,EAAEvB,EAAEy1C,aAAa,GAAGS,MAAMl2C,EAAEy1C,eAAel0C,EAAE,OAAO,KAAK,IAAIuI,EAAEmc,GAAGjmB,EAAEA,IAAIgD,GAAEwxC,GAAE,GAAG,GAAG,IAAI1qC,EAAE,OAAO,KAAK,GAAG,KAAO,GAAFA,IAAO,KAAKA,EAAE9J,EAAE21C,eAAe11C,EAAEA,EAAEk2C,GAAGn2C,EAAE8J,OAAO,CAAC7J,EAAE6J,EAAE,IAAImM,EAAE4sB,GAAEA,IAAG,EAAE,IAAIpzC,EAAE2mD,KAAgD,IAAxCpzC,KAAIhD,GAAGw0C,KAAIv0C,IAAE80C,GAAG,KAAKrD,GAAGtoC,KAAI,IAAIitC,GAAGr2C,EAAEC,UAAUq2C,KAAK,KAAK,CAAC,MAAMp9B,GAAGq9B,GAAGv2C,EAAEkZ,EAAE,CAAUynB,KAAKyT,GAAGrwB,QAAQt0B,EAAEozC,GAAE5sB,EAAE,OAAOs+B,GAAEt0C,EAAE,GAAG+C,GAAE,KAAKwxC,GAAE,EAAEv0C,EAAEwxC,GAAE,CAAC,GAAG,IAAIxxC,EAAE,CAAyC,GAAxC,IAAIA,IAAY,KAARgW,EAAEuQ,GAAGxmB,MAAW8J,EAAEmM,EAAEhW,EAAEu2C,GAAGx2C,EAAEiW,KAAQ,IAAIhW,EAAE,MAAMsB,EAAEkzC,GAAG4B,GAAGr2C,EAAE,GAAGu1C,GAAGv1C,EAAE8J,GAAG0rC,GAAGx1C,EAAEoJ,MAAK7H,EAAE,GAAG,IAAItB,EAAEs1C,GAAGv1C,EAAE8J,OAChf,CAAuB,GAAtBmM,EAAEjW,EAAE+jB,QAAQnV,UAAa,KAAO,GAAF9E,KAGnC,SAAY9J,GAAG,IAAI,IAAIC,EAAED,IAAI,CAAC,GAAW,MAARC,EAAEyP,MAAY,CAAC,IAAInO,EAAEtB,EAAE8hC,YAAY,GAAG,OAAOxgC,GAAe,QAAXA,EAAEA,EAAE8nC,QAAiB,IAAI,IAAIv/B,EAAE,EAAEA,EAAEvI,EAAEtQ,OAAO6Y,IAAI,CAAC,IAAImM,EAAE1U,EAAEuI,GAAGra,EAAEwmB,EAAE+yB,YAAY/yB,EAAEA,EAAErmB,MAAM,IAAI,IAAI2kC,GAAG9kC,IAAIwmB,GAAG,OAAM,CAAE,CAAC,MAAMC,GAAG,OAAM,CAAE,CAAC,CAAC,CAAW,GAAV3U,EAAEtB,EAAE4jB,MAAwB,MAAf5jB,EAAEiwC,cAAoB,OAAO3uC,EAAEA,EAAEgiB,OAAOtjB,EAAEA,EAAEsB,MAAM,CAAC,GAAGtB,IAAID,EAAE,MAAM,KAAK,OAAOC,EAAE6jB,SAAS,CAAC,GAAG,OAAO7jB,EAAEsjB,QAAQtjB,EAAEsjB,SAASvjB,EAAE,OAAM,EAAGC,EAAEA,EAAEsjB,MAAM,CAACtjB,EAAE6jB,QAAQP,OAAOtjB,EAAEsjB,OAAOtjB,EAAEA,EAAE6jB,OAAO,CAAC,CAAC,OAAM,CAAE,CAHvX2yB,CAAGxgC,KAAe,KAAVhW,EAAEk2C,GAAGn2C,EAAE8J,MAAmB,KAARra,EAAE+2B,GAAGxmB,MAAW8J,EAAEra,EAAEwQ,EAAEu2C,GAAGx2C,EAAEvQ,KAAK,IAAIwQ,GAAG,MAAMsB,EAAEkzC,GAAG4B,GAAGr2C,EAAE,GAAGu1C,GAAGv1C,EAAE8J,GAAG0rC,GAAGx1C,EAAEoJ,MAAK7H,EAAqC,OAAnCvB,EAAE02C,aAAazgC,EAAEjW,EAAE22C,cAAc7sC,EAAS7J,GAAG,KAAK,EAAE,KAAK,EAAE,MAAM/L,MAAMogB,EAAE,MAAM,KAAK,EAC8B,KAAK,EAAEsiC,GAAG52C,EAAE60C,GAAGE,IAAI,MAD7B,KAAK,EAAU,GAARQ,GAAGv1C,EAAE8J,IAAS,UAAFA,KAAeA,GAAiB,IAAb7J,EAAEyzC,GAAG,IAAItqC,MAAU,CAAC,GAAG,IAAI6c,GAAGjmB,EAAE,GAAG,MAAyB,KAAnBiW,EAAEjW,EAAEmmB,gBAAqBrc,KAAKA,EAAE,CAACR,KAAItJ,EAAEomB,aAAapmB,EAAEmmB,eAAelQ,EAAE,KAAK,CAACjW,EAAE62C,cAAc5b,GAAG2b,GAAGtd,KAAK,KAAKt5B,EAAE60C,GAAGE,IAAI90C,GAAG,KAAK,CAAC22C,GAAG52C,EAAE60C,GAAGE,IAAI,MAAM,KAAK,EAAU,GAARQ,GAAGv1C,EAAE8J,IAAS,QAAFA,KAC9eA,EAAE,MAAqB,IAAf7J,EAAED,EAAE4mB,WAAe3Q,GAAG,EAAE,EAAEnM,GAAG,CAAC,IAAIoM,EAAE,GAAGuP,GAAG3b,GAAGra,EAAE,GAAGymB,GAAEA,EAAEjW,EAAEiW,IAAKD,IAAIA,EAAEC,GAAGpM,IAAIra,CAAC,CAAqG,GAApGqa,EAAEmM,EAAqG,IAA3FnM,GAAG,KAAXA,EAAEV,KAAIU,GAAW,IAAI,IAAIA,EAAE,IAAI,KAAKA,EAAE,KAAK,KAAKA,EAAE,KAAK,IAAIA,EAAE,IAAI,KAAKA,EAAE,KAAK,KAAKqqC,GAAGrqC,EAAE,OAAOA,GAAU,CAAC9J,EAAE62C,cAAc5b,GAAG2b,GAAGtd,KAAK,KAAKt5B,EAAE60C,GAAGE,IAAIjrC,GAAG,KAAK,CAAC8sC,GAAG52C,EAAE60C,GAAGE,IAAI,MAA+B,QAAQ,MAAM7gD,MAAMogB,EAAE,MAAO,CAAC,CAAW,OAAVkhC,GAAGx1C,EAAEoJ,MAAYpJ,EAAEy1C,eAAel0C,EAAE00C,GAAG3c,KAAK,KAAKt5B,GAAG,IAAI,CACrX,SAASw2C,GAAGx2C,EAAEC,GAAG,IAAIsB,EAAEqzC,GAA2G,OAAxG50C,EAAE+jB,QAAQN,cAAciF,eAAe2tB,GAAGr2C,EAAEC,GAAGyP,OAAO,KAAe,KAAV1P,EAAEm2C,GAAGn2C,EAAEC,MAAWA,EAAE40C,GAAGA,GAAGtzC,EAAE,OAAOtB,GAAG8wC,GAAG9wC,IAAWD,CAAC,CAAC,SAAS+wC,GAAG/wC,GAAG,OAAO60C,GAAGA,GAAG70C,EAAE60C,GAAGpjD,KAAK6f,MAAMujC,GAAG70C,EAAE,CAE5L,SAASu1C,GAAGv1C,EAAEC,GAAuD,IAApDA,IAAI00C,GAAG10C,IAAIy0C,GAAG10C,EAAEmmB,gBAAgBlmB,EAAED,EAAEomB,cAAcnmB,EAAMD,EAAEA,EAAE01C,gBAAgB,EAAEz1C,GAAG,CAAC,IAAIsB,EAAE,GAAGkkB,GAAGxlB,GAAG6J,EAAE,GAAGvI,EAAEvB,EAAEuB,IAAI,EAAEtB,IAAI6J,CAAC,CAAC,CAAC,SAASisC,GAAG/1C,GAAG,GAAG,KAAO,EAAF6iC,IAAK,MAAM3uC,MAAMogB,EAAE,MAAM4hC,KAAK,IAAIj2C,EAAEgmB,GAAGjmB,EAAE,GAAG,GAAG,KAAO,EAAFC,GAAK,OAAOu1C,GAAGx1C,EAAEoJ,MAAK,KAAK,IAAI7H,EAAE40C,GAAGn2C,EAAEC,GAAG,GAAG,IAAID,EAAEwU,KAAK,IAAIjT,EAAE,CAAC,IAAIuI,EAAE0c,GAAGxmB,GAAG,IAAI8J,IAAI7J,EAAE6J,EAAEvI,EAAEi1C,GAAGx2C,EAAE8J,GAAG,CAAC,GAAG,IAAIvI,EAAE,MAAMA,EAAEkzC,GAAG4B,GAAGr2C,EAAE,GAAGu1C,GAAGv1C,EAAEC,GAAGu1C,GAAGx1C,EAAEoJ,MAAK7H,EAAE,GAAG,IAAIA,EAAE,MAAMrN,MAAMogB,EAAE,MAAiF,OAA3EtU,EAAE02C,aAAa12C,EAAE+jB,QAAQnV,UAAU5O,EAAE22C,cAAc12C,EAAE22C,GAAG52C,EAAE60C,GAAGE,IAAIS,GAAGx1C,EAAEoJ,MAAY,IAAI,CACvd,SAAS0tC,GAAG92C,EAAEC,GAAG,IAAIsB,EAAEshC,GAAEA,IAAG,EAAE,IAAI,OAAO7iC,EAAEC,EAAE,CAAC,QAAY,KAAJ4iC,GAAEthC,KAAUmwC,GAAGtoC,KAAI,IAAIy0B,IAAIG,KAAK,CAAC,CAAC,SAAS+Y,GAAG/2C,GAAG,OAAOi1C,IAAI,IAAIA,GAAGzgC,KAAK,KAAO,EAAFquB,KAAMqT,KAAK,IAAIj2C,EAAE4iC,GAAEA,IAAG,EAAE,IAAIthC,EAAE+yC,GAAG9qB,WAAW1f,EAAET,GAAE,IAAI,GAAGirC,GAAG9qB,WAAW,KAAKngB,GAAE,EAAErJ,EAAE,OAAOA,GAAG,CAAC,QAAQqJ,GAAES,EAAEwqC,GAAG9qB,WAAWjoB,EAAM,KAAO,GAAXshC,GAAE5iC,KAAa+9B,IAAI,CAAC,CAAC,SAAS2T,KAAKrD,GAAGD,GAAGtqB,QAAQ0Y,GAAE4R,GAAG,CAChT,SAASgI,GAAGr2C,EAAEC,GAAGD,EAAE02C,aAAa,KAAK12C,EAAE22C,cAAc,EAAE,IAAIp1C,EAAEvB,EAAE62C,cAAiD,IAAlC,IAAIt1C,IAAIvB,EAAE62C,eAAe,EAAE1b,GAAG55B,IAAO,OAAOgzC,GAAE,IAAIhzC,EAAEgzC,GAAEhxB,OAAO,OAAOhiB,GAAG,CAAC,IAAIuI,EAAEvI,EAAQ,OAANs9B,GAAG/0B,GAAUA,EAAE0K,KAAK,KAAK,EAA6B,QAA3B1K,EAAEA,EAAEoL,KAAKkoB,yBAA4B,IAAStzB,GAAGuzB,KAAK,MAAM,KAAK,EAAEiJ,KAAK7J,GAAEI,IAAIJ,GAAEG,IAAGgK,KAAK,MAAM,KAAK,EAAEJ,GAAG18B,GAAG,MAAM,KAAK,EAAEw8B,KAAK,MAAM,KAAK,GAAc,KAAK,GAAG7J,GAAEvxB,IAAG,MAAM,KAAK,GAAG01B,GAAG92B,EAAEoL,KAAKuE,UAAU,MAAM,KAAK,GAAG,KAAK,GAAGk4B,KAAKpwC,EAAEA,EAAEgiB,MAAM,CAAqE,GAApEvgB,GAAEhD,EAAEu0C,GAAEv0C,EAAEulC,GAAGvlC,EAAE+jB,QAAQ,MAAMywB,GAAElG,GAAGruC,EAAEwxC,GAAE,EAAEgD,GAAG,KAAKE,GAAGD,GAAGxR,GAAG,EAAE2R,GAAGD,GAAG,KAAQ,OAAOpT,GAAG,CAAC,IAAIvhC,EAC1f,EAAEA,EAAEuhC,GAAGvwC,OAAOgP,IAAI,GAA2B,QAAhB6J,GAARvI,EAAEigC,GAAGvhC,IAAO0hC,aAAqB,CAACpgC,EAAEogC,YAAY,KAAK,IAAI1rB,EAAEnM,EAAEvY,KAAK9B,EAAE8R,EAAE6gC,QAAQ,GAAG,OAAO3yC,EAAE,CAAC,IAAIymB,EAAEzmB,EAAE8B,KAAK9B,EAAE8B,KAAK0kB,EAAEnM,EAAEvY,KAAK2kB,CAAC,CAAC3U,EAAE6gC,QAAQt4B,CAAC,CAAC03B,GAAG,IAAI,CAAC,OAAOxhC,CAAC,CAC3K,SAASu2C,GAAGv2C,EAAEC,GAAG,OAAE,CAAC,IAAIsB,EAAEgzC,GAAE,IAAuB,GAAnB5T,KAAKmG,GAAG/iB,QAAQ+jB,GAAMV,GAAG,CAAC,IAAI,IAAIt9B,EAAE/T,GAAE0tB,cAAc,OAAO3Z,GAAG,CAAC,IAAImM,EAAEnM,EAAEo+B,MAAM,OAAOjyB,IAAIA,EAAEmsB,QAAQ,MAAMt4B,EAAEA,EAAEvY,IAAI,CAAC61C,IAAG,CAAE,CAA4C,GAA3CH,GAAG,EAAEE,GAAED,GAAEnxC,GAAE,KAAKsxC,IAAG,EAAGC,GAAG,EAAE+M,GAAGtwB,QAAQ,KAAQ,OAAOxiB,GAAG,OAAOA,EAAEgiB,OAAO,CAACkuB,GAAE,EAAEgD,GAAGx0C,EAAEs0C,GAAE,KAAK,KAAK,CAACv0C,EAAE,CAAC,IAAIvQ,EAAEuQ,EAAEkW,EAAE3U,EAAEgiB,OAAOrK,EAAE3X,EAAEH,EAAEnB,EAAqB,GAAnBA,EAAEu0C,GAAEt7B,EAAExJ,OAAO,MAAS,OAAOtO,GAAG,kBAAkBA,GAAG,oBAAoBA,EAAEs6B,KAAK,CAAC,IAAIziB,EAAE7X,EAAEhC,EAAE8Z,EAAE+pB,EAAE7jC,EAAEoV,IAAI,GAAG,KAAY,EAAPpV,EAAEwgC,QAAU,IAAIqD,GAAG,KAAKA,GAAG,KAAKA,GAAG,CAAC,IAAI5hC,EAAEjC,EAAEwP,UAAUvN,GAAGjC,EAAE2iC,YAAY1gC,EAAE0gC,YAAY3iC,EAAEqkB,cAAcpiB,EAAEoiB,cACxerkB,EAAE+hC,MAAM9/B,EAAE8/B,QAAQ/hC,EAAE2iC,YAAY,KAAK3iC,EAAEqkB,cAAc,KAAK,CAAC,IAAIhlB,EAAE4uC,GAAGn3B,GAAG,GAAG,OAAOzX,EAAE,CAACA,EAAEiR,QAAQ,IAAI49B,GAAG7uC,EAAEyX,EAAEgD,EAAEzpB,EAAEwQ,GAAU,EAAPxB,EAAEmhC,MAAQsN,GAAGz9C,EAAEwpB,EAAEhZ,GAAOmB,EAAE6X,EAAE,IAAIxU,GAAZxE,EAAExB,GAAcsjC,YAAY,GAAG,OAAOt9B,EAAE,CAAC,IAAInD,EAAE,IAAIiU,IAAIjU,EAAEqU,IAAIvU,GAAGnB,EAAE8hC,YAAYzgC,CAAC,MAAMmD,EAAEkR,IAAIvU,GAAG,MAAMpB,CAAC,CAAM,GAAG,KAAO,EAAFC,GAAK,CAACitC,GAAGz9C,EAAEwpB,EAAEhZ,GAAG6vC,KAAK,MAAM9vC,CAAC,CAACoB,EAAElN,MAAMogB,EAAE,KAAM,MAAM,GAAG0qB,IAAU,EAAP9lB,EAAE0mB,KAAO,CAAC,IAAInG,EAAE4T,GAAGn3B,GAAG,GAAG,OAAOujB,EAAE,CAAC,KAAa,MAARA,EAAE/pB,SAAe+pB,EAAE/pB,OAAO,KAAK49B,GAAG7T,EAAEvjB,EAAEgD,EAAEzpB,EAAEwQ,GAAGkgC,GAAG+L,GAAG9qC,EAAE8X,IAAI,MAAMlZ,CAAC,CAAC,CAACvQ,EAAE2R,EAAE8qC,GAAG9qC,EAAE8X,GAAG,IAAIu4B,KAAIA,GAAE,GAAG,OAAOmD,GAAGA,GAAG,CAACnlD,GAAGmlD,GAAGnjD,KAAKhC,GAAGA,EAAEymB,EAAE,EAAE,CAAC,OAAOzmB,EAAE+kB,KAAK,KAAK,EAAE/kB,EAAEigB,OAAO,MACpfzP,IAAIA,EAAExQ,EAAE0xC,OAAOlhC,EAAkB8iC,GAAGtzC,EAAbi9C,GAAGj9C,EAAE2R,EAAEnB,IAAW,MAAMD,EAAE,KAAK,EAAEkZ,EAAE9X,EAAE,IAAI8B,EAAEzT,EAAEylB,KAAK1Q,EAAE/U,EAAEwyB,UAAU,GAAG,KAAa,IAARxyB,EAAEigB,SAAa,oBAAoBxM,EAAE4pC,0BAA0B,OAAOtoC,GAAG,oBAAoBA,EAAEuoC,oBAAoB,OAAOC,KAAKA,GAAG7yC,IAAIqK,KAAK,CAAC/U,EAAEigB,OAAO,MAAMzP,IAAIA,EAAExQ,EAAE0xC,OAAOlhC,EAAkB8iC,GAAGtzC,EAAbo9C,GAAGp9C,EAAEypB,EAAEjZ,IAAW,MAAMD,CAAC,EAAEvQ,EAAEA,EAAE8zB,MAAM,OAAO,OAAO9zB,EAAE,CAACunD,GAAGz1C,EAAE,CAAC,MAAMy4B,GAAI/5B,EAAE+5B,EAAGua,KAAIhzC,GAAG,OAAOA,IAAIgzC,GAAEhzC,EAAEA,EAAEgiB,QAAQ,QAAQ,CAAC,KAAK,CAAS,CAAC,SAAS6yB,KAAK,IAAIp2C,EAAEo0C,GAAGrwB,QAAsB,OAAdqwB,GAAGrwB,QAAQ+jB,GAAU,OAAO9nC,EAAE8nC,GAAG9nC,CAAC,CACrd,SAAS8vC,KAAQ,IAAI2B,IAAG,IAAIA,IAAG,IAAIA,KAAEA,GAAE,GAAE,OAAOzuC,IAAG,KAAQ,UAAHkgC,KAAe,KAAQ,UAAHwR,KAAea,GAAGvyC,GAAEwxC,GAAE,CAAC,SAAS2B,GAAGn2C,EAAEC,GAAG,IAAIsB,EAAEshC,GAAEA,IAAG,EAAE,IAAI/4B,EAAEssC,KAAqC,IAA7BpzC,KAAIhD,GAAGw0C,KAAIv0C,IAAE80C,GAAG,KAAKsB,GAAGr2C,EAAEC,UAAUg3C,KAAK,KAAK,CAAC,MAAMhhC,GAAGsgC,GAAGv2C,EAAEiW,EAAE,CAAgC,GAAtB0qB,KAAKkC,GAAEthC,EAAE6yC,GAAGrwB,QAAQja,EAAK,OAAOyqC,GAAE,MAAMrgD,MAAMogB,EAAE,MAAiB,OAAXtR,GAAE,KAAKwxC,GAAE,EAAS/C,EAAC,CAAC,SAASwF,KAAK,KAAK,OAAO1C,IAAG2C,GAAG3C,GAAE,CAAC,SAAS+B,KAAK,KAAK,OAAO/B,KAAIjwB,MAAM4yB,GAAG3C,GAAE,CAAC,SAAS2C,GAAGl3C,GAAG,IAAIC,EAAEi0C,GAAGl0C,EAAE4O,UAAU5O,EAAEsuC,IAAItuC,EAAEggC,cAAchgC,EAAEu/B,aAAa,OAAOt/B,EAAE+2C,GAAGh3C,GAAGu0C,GAAEt0C,EAAEo0C,GAAGtwB,QAAQ,IAAI,CAC1d,SAASizB,GAAGh3C,GAAG,IAAIC,EAAED,EAAE,EAAE,CAAC,IAAIuB,EAAEtB,EAAE2O,UAAqB,GAAX5O,EAAEC,EAAEsjB,OAAU,KAAa,MAARtjB,EAAEyP,QAAc,GAAgB,QAAbnO,EAAEuvC,GAAGvvC,EAAEtB,EAAEquC,KAAkB,YAAJiG,GAAEhzC,OAAc,CAAW,GAAG,QAAbA,EAAEqwC,GAAGrwC,EAAEtB,IAAmC,OAAnBsB,EAAEmO,OAAO,WAAM6kC,GAAEhzC,GAAS,GAAG,OAAOvB,EAAmE,OAAXyxC,GAAE,OAAE8C,GAAE,MAA5Dv0C,EAAE0P,OAAO,MAAM1P,EAAEkwC,aAAa,EAAElwC,EAAEq/B,UAAU,IAA4B,CAAa,GAAG,QAAfp/B,EAAEA,EAAE6jB,SAAyB,YAAJywB,GAAEt0C,GAASs0C,GAAEt0C,EAAED,CAAC,OAAO,OAAOC,GAAG,IAAIwxC,KAAIA,GAAE,EAAE,CAAC,SAASmF,GAAG52C,EAAEC,EAAEsB,GAAG,IAAIuI,EAAET,GAAE4M,EAAEq+B,GAAG9qB,WAAW,IAAI8qB,GAAG9qB,WAAW,KAAKngB,GAAE,EAC3Y,SAAYrJ,EAAEC,EAAEsB,EAAEuI,GAAG,GAAGosC,WAAW,OAAOjB,IAAI,GAAG,KAAO,EAAFpS,IAAK,MAAM3uC,MAAMogB,EAAE,MAAM/S,EAAEvB,EAAE02C,aAAa,IAAIzgC,EAAEjW,EAAE22C,cAAc,GAAG,OAAOp1C,EAAE,OAAO,KAA2C,GAAtCvB,EAAE02C,aAAa,KAAK12C,EAAE22C,cAAc,EAAKp1C,IAAIvB,EAAE+jB,QAAQ,MAAM7vB,MAAMogB,EAAE,MAAMtU,EAAEy1C,aAAa,KAAKz1C,EAAE61C,iBAAiB,EAAE,IAAIpmD,EAAE8R,EAAE4/B,MAAM5/B,EAAEw/B,WAA8J,GA1NtT,SAAY/gC,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEkmB,cAAcjmB,EAAED,EAAEkmB,aAAajmB,EAAED,EAAEmmB,eAAe,EAAEnmB,EAAEomB,YAAY,EAAEpmB,EAAE21C,cAAc11C,EAAED,EAAEm3C,kBAAkBl3C,EAAED,EAAEqmB,gBAAgBpmB,EAAEA,EAAED,EAAEsmB,cAAc,IAAIxc,EAAE9J,EAAE4mB,WAAW,IAAI5mB,EAAEA,EAAE01C,gBAAgB,EAAEn0C,GAAG,CAAC,IAAI0U,EAAE,GAAGwP,GAAGlkB,GAAG9R,EAAE,GAAGwmB,EAAEhW,EAAEgW,GAAG,EAAEnM,EAAEmM,IAAI,EAAEjW,EAAEiW,IAAI,EAAE1U,IAAI9R,CAAC,CAAC,CA0N5G2nD,CAAGp3C,EAAEvQ,GAAGuQ,IAAIgD,KAAIuxC,GAAEvxC,GAAE,KAAKwxC,GAAE,GAAG,KAAoB,KAAfjzC,EAAE2uC,eAAoB,KAAa,KAAR3uC,EAAEmO,QAAaslC,KAAKA,IAAG,EAAGgB,GAAG/wB,IAAG,WAAgB,OAALixB,KAAY,IAAI,KAAIzmD,EAAE,KAAa,MAAR8R,EAAEmO,OAAgB,KAAoB,MAAfnO,EAAE2uC,eAAqBzgD,EAAE,CAACA,EAAE6kD,GAAG9qB,WAAW8qB,GAAG9qB,WAAW,KAChf,IAAItT,EAAE7M,GAAEA,GAAE,EAAE,IAAI6P,EAAE2pB,GAAEA,IAAG,EAAEwR,GAAGtwB,QAAQ,KA1CpC,SAAY/jB,EAAEC,GAAgB,GAAb46B,GAAGvR,GAAa8L,GAAVp1B,EAAEg1B,MAAc,CAAC,GAAG,mBAAmBh1B,EAAE,IAAIuB,EAAE,CAAC7M,MAAMsL,EAAE01B,eAAezgC,IAAI+K,EAAE21B,mBAAmB31B,EAAE,CAA8C,IAAI8J,GAAjDvI,GAAGA,EAAEvB,EAAEyb,gBAAgBla,EAAEs0B,aAAaxiB,QAAeyiB,cAAcv0B,EAAEu0B,eAAe,GAAGhsB,GAAG,IAAIA,EAAEksB,WAAW,CAACz0B,EAAEuI,EAAEmsB,WAAW,IAAIhgB,EAAEnM,EAAEosB,aAAazmC,EAAEqa,EAAEqsB,UAAUrsB,EAAEA,EAAEssB,YAAY,IAAI70B,EAAE2b,SAASztB,EAAEytB,QAAQ,CAAC,MAAMwc,GAAGn4B,EAAE,KAAK,MAAMvB,CAAC,CAAC,IAAIkW,EAAE,EAAEgD,GAAG,EAAE9X,GAAG,EAAE6X,EAAE,EAAE7Z,EAAE,EAAE6jC,EAAEjjC,EAAEqB,EAAE,KAAKpB,EAAE,OAAO,CAAC,IAAI,IAAIxB,EAAKwkC,IAAI1hC,GAAG,IAAI0U,GAAG,IAAIgtB,EAAE/lB,WAAWhE,EAAEhD,EAAED,GAAGgtB,IAAIxzC,GAAG,IAAIqa,GAAG,IAAIm5B,EAAE/lB,WAAW9b,EAAE8U,EAAEpM,GAAG,IAAIm5B,EAAE/lB,WAAWhH,GACnf+sB,EAAE9lB,UAAUlsB,QAAW,QAAQwN,EAAEwkC,EAAEtmB,aAAkBtb,EAAE4hC,EAAEA,EAAExkC,EAAE,OAAO,CAAC,GAAGwkC,IAAIjjC,EAAE,MAAMC,EAA8C,GAA5CoB,IAAIE,KAAK0X,IAAIhD,IAAIiD,EAAEhD,GAAG7U,IAAI5R,KAAK2P,IAAI0K,IAAI1I,EAAE8U,GAAM,QAAQzX,EAAEwkC,EAAErO,aAAa,MAAUvzB,GAAJ4hC,EAAE5hC,GAAMsgB,UAAU,CAACshB,EAAExkC,CAAC,CAAC8C,GAAG,IAAI2X,IAAI,IAAI9X,EAAE,KAAK,CAAC1M,MAAMwkB,EAAEjkB,IAAImM,EAAE,MAAMG,EAAE,IAAI,CAACA,EAAEA,GAAG,CAAC7M,MAAM,EAAEO,IAAI,EAAE,MAAMsM,EAAE,KAA+C,IAA1Cu5B,GAAG,CAACvF,YAAYv1B,EAAEw1B,eAAej0B,GAAG+nB,IAAG,EAAOtf,GAAE/J,EAAE,OAAO+J,IAAG,GAAOhK,GAAJC,EAAE+J,IAAM6Z,MAAM,KAAoB,KAAf5jB,EAAEiwC,eAAoB,OAAOlwC,EAAEA,EAAEujB,OAAOtjB,EAAE+J,GAAEhK,OAAO,KAAK,OAAOgK,IAAG,CAAC/J,EAAE+J,GAAE,IAAI,IAAIvF,EAAExE,EAAE2O,UAAU,GAAG,KAAa,KAAR3O,EAAEyP,OAAY,OAAOzP,EAAEuU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GACvK,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,MAA3W,KAAK,EAAE,GAAG,OAAO/P,EAAE,CAAC,IAAInD,EAAEmD,EAAEu7B,cAAcvG,EAAEh1B,EAAEgf,cAActzB,EAAE8P,EAAEgiB,UAAU/e,EAAE/S,EAAEy0C,wBAAwB3kC,EAAEm/B,cAAcn/B,EAAEiV,KAAK5T,EAAE++B,GAAGpgC,EAAEiV,KAAK5T,GAAGm4B,GAAGtpC,EAAE8jD,oCAAoC/wC,CAAC,CAAC,MAAM,KAAK,EAAE,IAAIsB,EAAEvE,EAAEgiB,UAAU0G,cAAc,IAAInkB,EAAE0Y,SAAS1Y,EAAE6X,YAAY,GAAG,IAAI7X,EAAE0Y,UAAU1Y,EAAEixB,iBAAiBjxB,EAAEoY,YAAYpY,EAAEixB,iBAAiB,MAAyC,QAAQ,MAAMvhC,MAAMogB,EAAE,MAAO,CAAC,MAAMolB,GAAGwY,GAAEjyC,EAAEA,EAAEsjB,OAAOmW,EAAE,CAAa,GAAG,QAAf15B,EAAEC,EAAE6jB,SAAoB,CAAC9jB,EAAEujB,OAAOtjB,EAAEsjB,OAAOvZ,GAAEhK,EAAE,KAAK,CAACgK,GAAE/J,EAAEsjB,MAAM,CAAC9e,EAAE2tC,GAAGA,IAAG,CAAW,CAwCldiF,CAAGr3C,EAAEuB,GAAGgyC,GAAGhyC,EAAEvB,GAAGs1B,GAAGwF,IAAIxR,KAAKuR,GAAGC,GAAGD,GAAG,KAAK76B,EAAE+jB,QAAQxiB,EAAEsyC,GAAGtyC,EAAEvB,EAAEiW,GAAGuO,KAAKqe,GAAE3pB,EAAE7P,GAAE6M,EAAEo+B,GAAG9qB,WAAW/5B,CAAC,MAAMuQ,EAAE+jB,QAAQxiB,EAAsF,GAApFyzC,KAAKA,IAAG,EAAGC,GAAGj1C,EAAEk1C,GAAGj/B,GAAGxmB,EAAEuQ,EAAEkmB,aAAa,IAAIz2B,IAAIu9C,GAAG,MAjOmJ,SAAYhtC,GAAG,GAAGwlB,IAAI,oBAAoBA,GAAG8xB,kBAAkB,IAAI9xB,GAAG8xB,kBAAkB/xB,GAAGvlB,OAAE,EAAO,OAAuB,IAAhBA,EAAE+jB,QAAQrU,OAAW,CAAC,MAAMzP,GAAG,CAAC,CAiOxRs3C,CAAGh2C,EAAE0gB,WAAauzB,GAAGx1C,EAAEoJ,MAAQ,OAAOnJ,EAAE,IAAI6J,EAAE9J,EAAEw3C,mBAAmBj2C,EAAE,EAAEA,EAAEtB,EAAEhP,OAAOsQ,IAAI0U,EAAEhW,EAAEsB,GAAGuI,EAAEmM,EAAErmB,MAAM,CAACq9C,eAAeh3B,EAAEyC,MAAM0zB,OAAOn2B,EAAEm2B,SAAS,GAAGO,GAAG,MAAMA,IAAG,EAAG3sC,EAAE4sC,GAAGA,GAAG,KAAK5sC,EAAE,KAAQ,EAAHk1C,KAAO,IAAIl1C,EAAEwU,KAAK0hC,KAAKzmD,EAAEuQ,EAAEkmB,aAAa,KAAO,EAAFz2B,GAAKuQ,IAAIo1C,GAAGD,MAAMA,GAAG,EAAEC,GAAGp1C,GAAGm1C,GAAG,EAAEnX,IAAgB,CAFxFyZ,CAAGz3C,EAAEC,EAAEsB,EAAEuI,EAAE,CAAC,QAAQwqC,GAAG9qB,WAAWvT,EAAE5M,GAAES,CAAC,CAAC,OAAO,IAAI,CAGhc,SAASosC,KAAK,GAAG,OAAOjB,GAAG,CAAC,IAAIj1C,EAAE8mB,GAAGouB,IAAIj1C,EAAEq0C,GAAG9qB,WAAWjoB,EAAE8H,GAAE,IAAmC,GAA/BirC,GAAG9qB,WAAW,KAAKngB,GAAE,GAAGrJ,EAAE,GAAGA,EAAK,OAAOi1C,GAAG,IAAInrC,GAAE,MAAO,CAAmB,GAAlB9J,EAAEi1C,GAAGA,GAAG,KAAKC,GAAG,EAAK,KAAO,EAAFrS,IAAK,MAAM3uC,MAAMogB,EAAE,MAAM,IAAI2B,EAAE4sB,GAAO,IAALA,IAAG,EAAM74B,GAAEhK,EAAE+jB,QAAQ,OAAO/Z,IAAG,CAAC,IAAIva,EAAEua,GAAEkM,EAAEzmB,EAAEo0B,MAAM,GAAG,KAAa,GAAR7Z,GAAE0F,OAAU,CAAC,IAAIwJ,EAAEzpB,EAAE4vC,UAAU,GAAG,OAAOnmB,EAAE,CAAC,IAAI,IAAI9X,EAAE,EAAEA,EAAE8X,EAAEjoB,OAAOmQ,IAAI,CAAC,IAAI6X,EAAEC,EAAE9X,GAAG,IAAI4I,GAAEiP,EAAE,OAAOjP,IAAG,CAAC,IAAI5K,EAAE4K,GAAE,OAAO5K,EAAEoV,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG69B,GAAG,EAAEjzC,EAAE3P,GAAG,IAAIwzC,EAAE7jC,EAAEykB,MAAM,GAAG,OAAOof,EAAEA,EAAE1f,OAAOnkB,EAAE4K,GAAEi5B,OAAO,KAAK,OAAOj5B,IAAG,CAAK,IAAI3I,GAARjC,EAAE4K,IAAU8Z,QAAQrlB,EAAEW,EAAEmkB,OAAa,GAANivB,GAAGpzC,GAAMA,IACnf6Z,EAAE,CAACjP,GAAE,KAAK,KAAK,CAAC,GAAG,OAAO3I,EAAE,CAACA,EAAEkiB,OAAO9kB,EAAEuL,GAAE3I,EAAE,KAAK,CAAC2I,GAAEvL,CAAC,CAAC,CAAC,CAAC,IAAIgG,EAAEhV,EAAEmf,UAAU,GAAG,OAAOnK,EAAE,CAAC,IAAInD,EAAEmD,EAAEof,MAAM,GAAG,OAAOviB,EAAE,CAACmD,EAAEof,MAAM,KAAK,EAAE,CAAC,IAAI4V,EAAEn4B,EAAEwiB,QAAQxiB,EAAEwiB,QAAQ,KAAKxiB,EAAEm4B,CAAC,OAAO,OAAOn4B,EAAE,CAAC,CAAC0I,GAAEva,CAAC,CAAC,CAAC,GAAG,KAAoB,KAAfA,EAAEygD,eAAoB,OAAOh6B,EAAEA,EAAEqN,OAAO9zB,EAAEua,GAAEkM,OAAOjW,EAAE,KAAK,OAAO+J,IAAG,CAAK,GAAG,KAAa,MAApBva,EAAEua,IAAY0F,OAAY,OAAOjgB,EAAE+kB,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG69B,GAAG,EAAE5iD,EAAEA,EAAE8zB,QAAQ,IAAIpzB,EAAEV,EAAEq0B,QAAQ,GAAG,OAAO3zB,EAAE,CAACA,EAAEozB,OAAO9zB,EAAE8zB,OAAOvZ,GAAE7Z,EAAE,MAAM8P,CAAC,CAAC+J,GAAEva,EAAE8zB,MAAM,CAAC,CAAC,IAAIrgB,EAAElD,EAAE+jB,QAAQ,IAAI/Z,GAAE9G,EAAE,OAAO8G,IAAG,CAAK,IAAIxF,GAAR0R,EAAElM,IAAU6Z,MAAM,GAAG,KAAoB,KAAf3N,EAAEg6B,eAAoB,OAClf1rC,EAAEA,EAAE+e,OAAOrN,EAAElM,GAAExF,OAAOvE,EAAE,IAAIiW,EAAEhT,EAAE,OAAO8G,IAAG,CAAK,GAAG,KAAa,MAApBkP,EAAElP,IAAY0F,OAAY,IAAI,OAAOwJ,EAAE1E,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG89B,GAAG,EAAEp5B,GAAG,CAAC,MAAM8gB,GAAIkY,GAAEh5B,EAAEA,EAAEqK,OAAOyW,EAAG,CAAC,GAAG9gB,IAAIhD,EAAE,CAAClM,GAAE,KAAK,MAAM/J,CAAC,CAAC,IAAIy5B,EAAExgB,EAAE4K,QAAQ,GAAG,OAAO4V,EAAE,CAACA,EAAEnW,OAAOrK,EAAEqK,OAAOvZ,GAAE0vB,EAAE,MAAMz5B,CAAC,CAAC+J,GAAEkP,EAAEqK,MAAM,CAAC,CAAU,GAATsf,GAAE5sB,EAAE+nB,KAAQxY,IAAI,oBAAoBA,GAAGkyB,sBAAsB,IAAIlyB,GAAGkyB,sBAAsBnyB,GAAGvlB,EAAE,CAAC,MAAMg6B,GAAI,CAAClwB,GAAE,CAAE,CAAC,OAAOA,CAAC,CAAC,QAAQT,GAAE9H,EAAE+yC,GAAG9qB,WAAWvpB,CAAC,CAAC,CAAC,OAAM,CAAE,CAAC,SAAS03C,GAAG33C,EAAEC,EAAEsB,GAAyBvB,EAAE4iC,GAAG5iC,EAAjBC,EAAEysC,GAAG1sC,EAAfC,EAAEisC,GAAG3qC,EAAEtB,GAAY,GAAY,GAAGA,EAAEqJ,KAAI,OAAOtJ,IAAI2mB,GAAG3mB,EAAE,EAAEC,GAAGu1C,GAAGx1C,EAAEC,GAAG,CACze,SAASiyC,GAAElyC,EAAEC,EAAEsB,GAAG,GAAG,IAAIvB,EAAEwU,IAAImjC,GAAG33C,EAAEA,EAAEuB,QAAQ,KAAK,OAAOtB,GAAG,CAAC,GAAG,IAAIA,EAAEuU,IAAI,CAACmjC,GAAG13C,EAAED,EAAEuB,GAAG,KAAK,CAAM,GAAG,IAAItB,EAAEuU,IAAI,CAAC,IAAI1K,EAAE7J,EAAEgiB,UAAU,GAAG,oBAAoBhiB,EAAEiV,KAAK43B,0BAA0B,oBAAoBhjC,EAAEijC,oBAAoB,OAAOC,KAAKA,GAAG7yC,IAAI2P,IAAI,CAAuB7J,EAAE2iC,GAAG3iC,EAAjBD,EAAE6sC,GAAG5sC,EAAfD,EAAEksC,GAAG3qC,EAAEvB,GAAY,GAAY,GAAGA,EAAEsJ,KAAI,OAAOrJ,IAAI0mB,GAAG1mB,EAAE,EAAED,GAAGw1C,GAAGv1C,EAAED,IAAI,KAAK,CAAC,CAACC,EAAEA,EAAEsjB,MAAM,CAAC,CACnV,SAAS6pB,GAAGptC,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE9J,EAAEmtC,UAAU,OAAOrjC,GAAGA,EAAEie,OAAO9nB,GAAGA,EAAEqJ,KAAItJ,EAAEomB,aAAapmB,EAAEmmB,eAAe5kB,EAAEyB,KAAIhD,IAAIw0C,GAAEjzC,KAAKA,IAAI,IAAIkwC,IAAG,IAAIA,KAAM,UAAF+C,MAAeA,IAAG,IAAIprC,KAAIsqC,GAAG2C,GAAGr2C,EAAE,GAAG20C,IAAIpzC,GAAGi0C,GAAGx1C,EAAEC,EAAE,CAAC,SAAS23C,GAAG53C,EAAEC,GAAG,IAAIA,IAAI,KAAY,EAAPD,EAAE4/B,MAAQ3/B,EAAE,GAAGA,EAAE8lB,GAAU,KAAQ,WAAfA,KAAK,MAAuBA,GAAG,WAAW,IAAIxkB,EAAE+H,KAAc,QAAVtJ,EAAE4hC,GAAG5hC,EAAEC,MAAc0mB,GAAG3mB,EAAEC,EAAEsB,GAAGi0C,GAAGx1C,EAAEuB,GAAG,CAAC,SAASwuC,GAAG/vC,GAAG,IAAIC,EAAED,EAAEyjB,cAAcliB,EAAE,EAAE,OAAOtB,IAAIsB,EAAEtB,EAAEy/B,WAAWkY,GAAG53C,EAAEuB,EAAE,CACjZ,SAAS8xC,GAAGrzC,EAAEC,GAAG,IAAIsB,EAAE,EAAE,OAAOvB,EAAEwU,KAAK,KAAK,GAAG,IAAI1K,EAAE9J,EAAEiiB,UAAchM,EAAEjW,EAAEyjB,cAAc,OAAOxN,IAAI1U,EAAE0U,EAAEypB,WAAW,MAAM,KAAK,GAAG51B,EAAE9J,EAAEiiB,UAAU,MAAM,QAAQ,MAAM/tB,MAAMogB,EAAE,MAAO,OAAOxK,GAAGA,EAAEie,OAAO9nB,GAAG23C,GAAG53C,EAAEuB,EAAE,CAQqK,SAASy0C,GAAGh2C,EAAEC,GAAG,OAAOikB,GAAGlkB,EAAEC,EAAE,CACjZ,SAAS43C,GAAG73C,EAAEC,EAAEsB,EAAEuI,GAAG/V,KAAKygB,IAAIxU,EAAEjM,KAAK8J,IAAI0D,EAAExN,KAAK+vB,QAAQ/vB,KAAK8vB,MAAM9vB,KAAKwvB,OAAOxvB,KAAKkuB,UAAUluB,KAAKmhB,KAAKnhB,KAAKqrC,YAAY,KAAKrrC,KAAKqC,MAAM,EAAErC,KAAKkxC,IAAI,KAAKlxC,KAAKwrC,aAAat/B,EAAElM,KAAKktC,aAAaltC,KAAK0vB,cAAc1vB,KAAKguC,YAAYhuC,KAAKisC,cAAc,KAAKjsC,KAAK6rC,KAAK91B,EAAE/V,KAAKm8C,aAAan8C,KAAK2b,MAAM,EAAE3b,KAAKsrC,UAAU,KAAKtrC,KAAKgtC,WAAWhtC,KAAKotC,MAAM,EAAEptC,KAAK6a,UAAU,IAAI,CAAC,SAASuwB,GAAGn/B,EAAEC,EAAEsB,EAAEuI,GAAG,OAAO,IAAI+tC,GAAG73C,EAAEC,EAAEsB,EAAEuI,EAAE,CAAC,SAAS+jC,GAAG7tC,GAAiB,UAAdA,EAAEA,EAAEzL,aAAuByL,EAAE83C,iBAAiB,CAEpd,SAASvS,GAAGvlC,EAAEC,GAAG,IAAIsB,EAAEvB,EAAE4O,UACuB,OADb,OAAOrN,IAAGA,EAAE49B,GAAGn/B,EAAEwU,IAAIvU,EAAED,EAAEnC,IAAImC,EAAE4/B,OAAQR,YAAYp/B,EAAEo/B,YAAY79B,EAAE2T,KAAKlV,EAAEkV,KAAK3T,EAAE0gB,UAAUjiB,EAAEiiB,UAAU1gB,EAAEqN,UAAU5O,EAAEA,EAAE4O,UAAUrN,IAAIA,EAAEg+B,aAAat/B,EAAEsB,EAAE2T,KAAKlV,EAAEkV,KAAK3T,EAAEmO,MAAM,EAAEnO,EAAE2uC,aAAa,EAAE3uC,EAAE89B,UAAU,MAAM99B,EAAEmO,MAAc,SAAR1P,EAAE0P,MAAenO,EAAEw/B,WAAW/gC,EAAE+gC,WAAWx/B,EAAE4/B,MAAMnhC,EAAEmhC,MAAM5/B,EAAEsiB,MAAM7jB,EAAE6jB,MAAMtiB,EAAEy+B,cAAchgC,EAAEggC,cAAcz+B,EAAEkiB,cAAczjB,EAAEyjB,cAAcliB,EAAEwgC,YAAY/hC,EAAE+hC,YAAY9hC,EAAED,EAAEihC,aAAa1/B,EAAE0/B,aAAa,OAAOhhC,EAAE,KAAK,CAACkhC,MAAMlhC,EAAEkhC,MAAMD,aAAajhC,EAAEihC,cAC/e3/B,EAAEuiB,QAAQ9jB,EAAE8jB,QAAQviB,EAAEnL,MAAM4J,EAAE5J,MAAMmL,EAAE0jC,IAAIjlC,EAAEilC,IAAW1jC,CAAC,CACxD,SAASkkC,GAAGzlC,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,GAAG,IAAIymB,EAAE,EAAM,GAAJpM,EAAE9J,EAAK,oBAAoBA,EAAE6tC,GAAG7tC,KAAKkW,EAAE,QAAQ,GAAG,kBAAkBlW,EAAEkW,EAAE,OAAOlW,EAAE,OAAOA,GAAG,KAAK2X,EAAG,OAAOiuB,GAAGrkC,EAAE0a,SAAShG,EAAExmB,EAAEwQ,GAAG,KAAK2X,EAAG1B,EAAE,EAAED,GAAG,EAAE,MAAM,KAAK4B,EAAG,OAAO7X,EAAEm/B,GAAG,GAAG59B,EAAEtB,EAAI,EAAFgW,IAAOmpB,YAAYvnB,EAAG7X,EAAEmhC,MAAM1xC,EAAEuQ,EAAE,KAAKiY,EAAG,OAAOjY,EAAEm/B,GAAG,GAAG59B,EAAEtB,EAAEgW,IAAKmpB,YAAYnnB,EAAGjY,EAAEmhC,MAAM1xC,EAAEuQ,EAAE,KAAKkY,EAAG,OAAOlY,EAAEm/B,GAAG,GAAG59B,EAAEtB,EAAEgW,IAAKmpB,YAAYlnB,EAAGlY,EAAEmhC,MAAM1xC,EAAEuQ,EAAE,KAAKqY,EAAG,OAAOo3B,GAAGluC,EAAE0U,EAAExmB,EAAEwQ,GAAG,QAAQ,GAAG,kBAAkBD,GAAG,OAAOA,EAAE,OAAOA,EAAEwZ,UAAU,KAAK1B,EAAG5B,EAAE,GAAG,MAAMlW,EAAE,KAAK+X,EAAG7B,EAAE,EAAE,MAAMlW,EAAE,KAAKgY,EAAG9B,EAAE,GACpf,MAAMlW,EAAE,KAAKmY,EAAGjC,EAAE,GAAG,MAAMlW,EAAE,KAAKoY,EAAGlC,EAAE,GAAGpM,EAAE,KAAK,MAAM9J,EAAE,MAAM9L,MAAMogB,EAAE,IAAI,MAAMtU,EAAEA,SAASA,EAAE,KAAuD,OAAjDC,EAAEk/B,GAAGjpB,EAAE3U,EAAEtB,EAAEgW,IAAKmpB,YAAYp/B,EAAEC,EAAEiV,KAAKpL,EAAE7J,EAAEkhC,MAAM1xC,EAASwQ,CAAC,CAAC,SAAS2lC,GAAG5lC,EAAEC,EAAEsB,EAAEuI,GAA2B,OAAxB9J,EAAEm/B,GAAG,EAAEn/B,EAAE8J,EAAE7J,IAAKkhC,MAAM5/B,EAASvB,CAAC,CAAC,SAASyvC,GAAGzvC,EAAEC,EAAEsB,EAAEuI,GAAuE,OAApE9J,EAAEm/B,GAAG,GAAGn/B,EAAE8J,EAAE7J,IAAKm/B,YAAY/mB,EAAGrY,EAAEmhC,MAAM5/B,EAAEvB,EAAEiiB,UAAU,CAACwxB,UAAS,GAAWzzC,CAAC,CAAC,SAASwlC,GAAGxlC,EAAEC,EAAEsB,GAA8B,OAA3BvB,EAAEm/B,GAAG,EAAEn/B,EAAE,KAAKC,IAAKkhC,MAAM5/B,EAASvB,CAAC,CAC5W,SAAS2lC,GAAG3lC,EAAEC,EAAEsB,GAA8J,OAA3JtB,EAAEk/B,GAAG,EAAE,OAAOn/B,EAAEic,SAASjc,EAAEic,SAAS,GAAGjc,EAAEnC,IAAIoC,IAAKkhC,MAAM5/B,EAAEtB,EAAEgiB,UAAU,CAAC0G,cAAc3oB,EAAE2oB,cAAcovB,gBAAgB,KAAKrS,eAAe1lC,EAAE0lC,gBAAuBzlC,CAAC,CACtL,SAAS+3C,GAAGh4C,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAGliB,KAAKygB,IAAIvU,EAAElM,KAAK40B,cAAc3oB,EAAEjM,KAAK2iD,aAAa3iD,KAAKo5C,UAAUp5C,KAAKgwB,QAAQhwB,KAAKgkD,gBAAgB,KAAKhkD,KAAK8iD,eAAe,EAAE9iD,KAAK0hD,aAAa1hD,KAAKg7C,eAAeh7C,KAAKutC,QAAQ,KAAKvtC,KAAK8hD,iBAAiB,EAAE9hD,KAAK6yB,WAAWF,GAAG,GAAG3yB,KAAK2hD,gBAAgBhvB,IAAI,GAAG3yB,KAAKsyB,eAAetyB,KAAK4iD,cAAc5iD,KAAKojD,iBAAiBpjD,KAAK4hD,aAAa5hD,KAAKqyB,YAAYryB,KAAKoyB,eAAepyB,KAAKmyB,aAAa,EAAEnyB,KAAKuyB,cAAcI,GAAG,GAAG3yB,KAAKk4C,iBAAiBniC,EAAE/V,KAAKyjD,mBAAmBvhC,EAAEliB,KAAKkkD,gCAC/e,IAAI,CAAC,SAASC,GAAGl4C,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,EAAEgD,EAAE9X,GAAgN,OAA7MpB,EAAE,IAAIg4C,GAAGh4C,EAAEC,EAAEsB,EAAE2X,EAAE9X,GAAG,IAAInB,GAAGA,EAAE,GAAE,IAAKxQ,IAAIwQ,GAAG,IAAIA,EAAE,EAAExQ,EAAE0vC,GAAG,EAAE,KAAK,KAAKl/B,GAAGD,EAAE+jB,QAAQt0B,EAAEA,EAAEwyB,UAAUjiB,EAAEvQ,EAAEg0B,cAAc,CAACiT,QAAQ5sB,EAAE4e,aAAannB,EAAE42C,MAAM,KAAK/J,YAAY,KAAKgK,0BAA0B,MAAMtW,GAAGryC,GAAUuQ,CAAC,CACzP,SAASq4C,GAAGr4C,GAAG,IAAIA,EAAE,OAAO28B,GAAuB38B,EAAE,CAAC,GAAGsjB,GAA1BtjB,EAAEA,EAAE0jC,mBAA8B1jC,GAAG,IAAIA,EAAEwU,IAAI,MAAMtgB,MAAMogB,EAAE,MAAM,IAAIrU,EAAED,EAAE,EAAE,CAAC,OAAOC,EAAEuU,KAAK,KAAK,EAAEvU,EAAEA,EAAEgiB,UAAUqf,QAAQ,MAAMthC,EAAE,KAAK,EAAE,GAAGm9B,GAAGl9B,EAAEiV,MAAM,CAACjV,EAAEA,EAAEgiB,UAAUyb,0CAA0C,MAAM19B,CAAC,EAAEC,EAAEA,EAAEsjB,MAAM,OAAO,OAAOtjB,GAAG,MAAM/L,MAAMogB,EAAE,KAAM,CAAC,GAAG,IAAItU,EAAEwU,IAAI,CAAC,IAAIjT,EAAEvB,EAAEkV,KAAK,GAAGioB,GAAG57B,GAAG,OAAOg8B,GAAGv9B,EAAEuB,EAAEtB,EAAE,CAAC,OAAOA,CAAC,CACpW,SAASq4C,GAAGt4C,EAAEC,EAAEsB,EAAEuI,EAAEmM,EAAExmB,EAAEymB,EAAEgD,EAAE9X,GAAwK,OAArKpB,EAAEk4C,GAAG32C,EAAEuI,GAAE,EAAG9J,EAAEiW,EAAExmB,EAAEymB,EAAEgD,EAAE9X,IAAKkgC,QAAQ+W,GAAG,MAAM92C,EAAEvB,EAAE+jB,SAAsBt0B,EAAE8yC,GAAhBz4B,EAAER,KAAI2M,EAAE2tB,GAAGriC,KAAeohC,cAAS,IAAS1iC,GAAG,OAAOA,EAAEA,EAAE,KAAK2iC,GAAGrhC,EAAE9R,EAAEwmB,GAAGjW,EAAE+jB,QAAQod,MAAMlrB,EAAE0Q,GAAG3mB,EAAEiW,EAAEnM,GAAG0rC,GAAGx1C,EAAE8J,GAAU9J,CAAC,CAAC,SAASu4C,GAAGv4C,EAAEC,EAAEsB,EAAEuI,GAAG,IAAImM,EAAEhW,EAAE8jB,QAAQt0B,EAAE6Z,KAAI4M,EAAE0tB,GAAG3tB,GAAsL,OAAnL1U,EAAE82C,GAAG92C,GAAG,OAAOtB,EAAEqhC,QAAQrhC,EAAEqhC,QAAQ//B,EAAEtB,EAAE8uC,eAAextC,GAAEtB,EAAEsiC,GAAG9yC,EAAEymB,IAAKwsB,QAAQ,CAAChM,QAAQ12B,GAAuB,QAApB8J,OAAE,IAASA,EAAE,KAAKA,KAAa7J,EAAE0iC,SAAS74B,GAAe,QAAZ9J,EAAE4iC,GAAG3sB,EAAEhW,EAAEiW,MAAc2tB,GAAG7jC,EAAEiW,EAAEC,EAAEzmB,GAAGqzC,GAAG9iC,EAAEiW,EAAEC,IAAWA,CAAC,CAC3b,SAASsiC,GAAGx4C,GAAe,OAAZA,EAAEA,EAAE+jB,SAAcF,OAAyB7jB,EAAE6jB,MAAMrP,IAAoDxU,EAAE6jB,MAAM5B,WAAhF,IAA0F,CAAC,SAASw2B,GAAGz4C,EAAEC,GAAqB,GAAG,QAArBD,EAAEA,EAAEyjB,gBAA2B,OAAOzjB,EAAE0jB,WAAW,CAAC,IAAIniB,EAAEvB,EAAE0/B,UAAU1/B,EAAE0/B,UAAU,IAAIn+B,GAAGA,EAAEtB,EAAEsB,EAAEtB,CAAC,CAAC,CAAC,SAASy4C,GAAG14C,EAAEC,GAAGw4C,GAAGz4C,EAAEC,IAAID,EAAEA,EAAE4O,YAAY6pC,GAAGz4C,EAAEC,EAAE,CAnB7Si0C,GAAG,SAASl0C,EAAEC,EAAEsB,GAAG,GAAG,OAAOvB,EAAE,GAAGA,EAAEggC,gBAAgB//B,EAAEs/B,cAAc1C,GAAG9Y,QAAQqd,IAAG,MAAO,CAAC,GAAG,KAAKphC,EAAEmhC,MAAM5/B,IAAI,KAAa,IAARtB,EAAEyP,OAAW,OAAO0xB,IAAG,EAzE1I,SAAYphC,EAAEC,EAAEsB,GAAG,OAAOtB,EAAEuU,KAAK,KAAK,EAAEs6B,GAAG7uC,GAAGigC,KAAK,MAAM,KAAK,EAAEqG,GAAGtmC,GAAG,MAAM,KAAK,EAAEk9B,GAAGl9B,EAAEiV,OAAOuoB,GAAGx9B,GAAG,MAAM,KAAK,EAAEmmC,GAAGnmC,EAAEA,EAAEgiB,UAAU0G,eAAe,MAAM,KAAK,GAAG,IAAI7e,EAAE7J,EAAEiV,KAAKuE,SAASxD,EAAEhW,EAAE+/B,cAAcpwC,MAAM8sC,GAAE6D,GAAGz2B,EAAE+2B,eAAe/2B,EAAE+2B,cAAc5qB,EAAE,MAAM,KAAK,GAAqB,GAAG,QAArBnM,EAAE7J,EAAEwjB,eAA2B,OAAG,OAAO3Z,EAAE4Z,YAAkBgZ,GAAExxB,GAAY,EAAVA,GAAE6Y,SAAW9jB,EAAEyP,OAAO,IAAI,MAAQ,KAAKnO,EAAEtB,EAAE4jB,MAAMkd,YAAmBwO,GAAGvvC,EAAEC,EAAEsB,IAAGm7B,GAAExxB,GAAY,EAAVA,GAAE6Y,SAA8B,QAAnB/jB,EAAE2tC,GAAG3tC,EAAEC,EAAEsB,IAAmBvB,EAAE8jB,QAAQ,MAAK4Y,GAAExxB,GAAY,EAAVA,GAAE6Y,SAAW,MAAM,KAAK,GAC7d,GADgeja,EAAE,KAAKvI,EACrftB,EAAE8gC,YAAe,KAAa,IAAR/gC,EAAE0P,OAAW,CAAC,GAAG5F,EAAE,OAAO6mC,GAAG3wC,EAAEC,EAAEsB,GAAGtB,EAAEyP,OAAO,GAAG,CAA6F,GAA1E,QAAlBuG,EAAEhW,EAAEwjB,iBAAyBxN,EAAEq6B,UAAU,KAAKr6B,EAAEw6B,KAAK,KAAKx6B,EAAEmzB,WAAW,MAAM1M,GAAExxB,GAAEA,GAAE6Y,SAAYja,EAAE,MAAW,OAAO,KAAK,KAAK,GAAG,KAAK,GAAG,OAAO7J,EAAEkhC,MAAM,EAAE8M,GAAGjuC,EAAEC,EAAEsB,GAAG,OAAOosC,GAAG3tC,EAAEC,EAAEsB,EAAE,CAwE7Go3C,CAAG34C,EAAEC,EAAEsB,GAAG6/B,GAAG,KAAa,OAARphC,EAAE0P,MAAmB,MAAM0xB,IAAG,EAAGpC,IAAG,KAAa,QAAR/+B,EAAEyP,QAAgBivB,GAAG1+B,EAAEm+B,GAAGn+B,EAAE7J,OAAiB,OAAV6J,EAAEkhC,MAAM,EAASlhC,EAAEuU,KAAK,KAAK,EAAE,IAAI1K,EAAE7J,EAAEiV,KAAKu5B,GAAGzuC,EAAEC,GAAGD,EAAEC,EAAEs/B,aAAa,IAAItpB,EAAE8mB,GAAG98B,EAAE28B,GAAE7Y,SAASid,GAAG/gC,EAAEsB,GAAG0U,EAAEyxB,GAAG,KAAKznC,EAAE6J,EAAE9J,EAAEiW,EAAE1U,GAAG,IAAI9R,EAAEs4C,KACvI,OAD4I9nC,EAAEyP,OAAO,EAAE,kBAAkBuG,GAAG,OAAOA,GAAG,oBAAoBA,EAAEqD,aAAQ,IAASrD,EAAEuD,UAAUvZ,EAAEuU,IAAI,EAAEvU,EAAEwjB,cAAc,KAAKxjB,EAAE8hC,YAC1e,KAAK5E,GAAGrzB,IAAIra,GAAE,EAAGguC,GAAGx9B,IAAIxQ,GAAE,EAAGwQ,EAAEwjB,cAAc,OAAOxN,EAAE1N,YAAO,IAAS0N,EAAE1N,MAAM0N,EAAE1N,MAAM,KAAKu5B,GAAG7hC,GAAGgW,EAAEouB,QAAQb,GAAGvjC,EAAEgiB,UAAUhM,EAAEA,EAAEytB,gBAAgBzjC,EAAEwkC,GAAGxkC,EAAE6J,EAAE9J,EAAEuB,GAAGtB,EAAE4uC,GAAG,KAAK5uC,EAAE6J,GAAE,EAAGra,EAAE8R,KAAKtB,EAAEuU,IAAI,EAAEwqB,IAAGvvC,GAAGmvC,GAAG3+B,GAAGwtC,GAAG,KAAKxtC,EAAEgW,EAAE1U,GAAGtB,EAAEA,EAAE4jB,OAAc5jB,EAAE,KAAK,GAAG6J,EAAE7J,EAAEm/B,YAAYp/B,EAAE,CAAqF,OAApFyuC,GAAGzuC,EAAEC,GAAGD,EAAEC,EAAEs/B,aAAuBz1B,GAAVmM,EAAEnM,EAAE6P,OAAU7P,EAAE4P,UAAUzZ,EAAEiV,KAAKpL,EAAEmM,EAAEhW,EAAEuU,IAQtU,SAAYxU,GAAG,GAAG,oBAAoBA,EAAE,OAAO6tC,GAAG7tC,GAAG,EAAE,EAAE,QAAG,IAASA,GAAG,OAAOA,EAAE,CAAc,IAAbA,EAAEA,EAAEwZ,YAAgBxB,EAAG,OAAO,GAAG,GAAGhY,IAAImY,EAAG,OAAO,EAAE,CAAC,OAAO,CAAC,CAR2LygC,CAAG9uC,GAAG9J,EAAEqgC,GAAGv2B,EAAE9J,GAAUiW,GAAG,KAAK,EAAEhW,EAAE+tC,GAAG,KAAK/tC,EAAE6J,EAAE9J,EAAEuB,GAAG,MAAMvB,EAAE,KAAK,EAAEC,EAAEuuC,GAAG,KAAKvuC,EAAE6J,EAAE9J,EAAEuB,GAAG,MAAMvB,EAAE,KAAK,GAAGC,EAAEytC,GAAG,KAAKztC,EAAE6J,EAAE9J,EAAEuB,GAAG,MAAMvB,EAAE,KAAK,GAAGC,EAAE2tC,GAAG,KAAK3tC,EAAE6J,EAAEu2B,GAAGv2B,EAAEoL,KAAKlV,GAAGuB,GAAG,MAAMvB,EAAE,MAAM9L,MAAMogB,EAAE,IACvgBxK,EAAE,IAAK,CAAC,OAAO7J,EAAE,KAAK,EAAE,OAAO6J,EAAE7J,EAAEiV,KAAKe,EAAEhW,EAAEs/B,aAA2CyO,GAAGhuC,EAAEC,EAAE6J,EAArCmM,EAAEhW,EAAEm/B,cAAct1B,EAAEmM,EAAEoqB,GAAGv2B,EAAEmM,GAAc1U,GAAG,KAAK,EAAE,OAAOuI,EAAE7J,EAAEiV,KAAKe,EAAEhW,EAAEs/B,aAA2CiP,GAAGxuC,EAAEC,EAAE6J,EAArCmM,EAAEhW,EAAEm/B,cAAct1B,EAAEmM,EAAEoqB,GAAGv2B,EAAEmM,GAAc1U,GAAG,KAAK,EAAEvB,EAAE,CAAO,GAAN8uC,GAAG7uC,GAAM,OAAOD,EAAE,MAAM9L,MAAMogB,EAAE,MAAMxK,EAAE7J,EAAEs/B,aAA+BtpB,GAAlBxmB,EAAEwQ,EAAEwjB,eAAkBiT,QAAQ4L,GAAGtiC,EAAEC,GAAG+iC,GAAG/iC,EAAE6J,EAAE,KAAKvI,GAAG,IAAI2U,EAAEjW,EAAEwjB,cAA0B,GAAZ3Z,EAAEoM,EAAEwgB,QAAWjnC,EAAEi5B,aAAY,CAAC,GAAGj5B,EAAE,CAACinC,QAAQ5sB,EAAE4e,cAAa,EAAGyvB,MAAMjiC,EAAEiiC,MAAMC,0BAA0BliC,EAAEkiC,0BAA0BhK,YAAYl4B,EAAEk4B,aAAanuC,EAAE8hC,YAAYC,UAChfvyC,EAAEwQ,EAAEwjB,cAAch0B,EAAU,IAARwQ,EAAEyP,MAAU,CAAuBzP,EAAE+uC,GAAGhvC,EAAEC,EAAE6J,EAAEvI,EAAjC0U,EAAEi2B,GAAGh4C,MAAMogB,EAAE,MAAMrU,IAAmB,MAAMD,CAAC,CAAM,GAAG8J,IAAImM,EAAE,CAAuBhW,EAAE+uC,GAAGhvC,EAAEC,EAAE6J,EAAEvI,EAAjC0U,EAAEi2B,GAAGh4C,MAAMogB,EAAE,MAAMrU,IAAmB,MAAMD,CAAC,CAAM,IAAI++B,GAAGjD,GAAG77B,EAAEgiB,UAAU0G,cAAchM,YAAYmiB,GAAG7+B,EAAE++B,IAAE,EAAGC,GAAG,KAAK19B,EAAEukC,GAAG7lC,EAAE,KAAK6J,EAAEvI,GAAGtB,EAAE4jB,MAAMtiB,EAAEA,GAAGA,EAAEmO,OAAe,EAATnO,EAAEmO,MAAS,KAAKnO,EAAEA,EAAEuiB,OAAQ,KAAI,CAAM,GAALoc,KAAQp2B,IAAImM,EAAE,CAAChW,EAAE0tC,GAAG3tC,EAAEC,EAAEsB,GAAG,MAAMvB,CAAC,CAACytC,GAAGztC,EAAEC,EAAE6J,EAAEvI,EAAE,CAACtB,EAAEA,EAAE4jB,KAAK,CAAC,OAAO5jB,EAAE,KAAK,EAAE,OAAOsmC,GAAGtmC,GAAG,OAAOD,GAAG6/B,GAAG5/B,GAAG6J,EAAE7J,EAAEiV,KAAKe,EAAEhW,EAAEs/B,aAAa9vC,EAAE,OAAOuQ,EAAEA,EAAEggC,cAAc,KAAK9pB,EAAED,EAAEgG,SAAS8e,GAAGjxB,EAAEmM,GAAGC,EAAE,KAAK,OAAOzmB,GAAGsrC,GAAGjxB,EAAEra,KAAKwQ,EAAEyP,OAAO,IACnf6+B,GAAGvuC,EAAEC,GAAGwtC,GAAGztC,EAAEC,EAAEiW,EAAE3U,GAAGtB,EAAE4jB,MAAM,KAAK,EAAE,OAAO,OAAO7jB,GAAG6/B,GAAG5/B,GAAG,KAAK,KAAK,GAAG,OAAOsvC,GAAGvvC,EAAEC,EAAEsB,GAAG,KAAK,EAAE,OAAO6kC,GAAGnmC,EAAEA,EAAEgiB,UAAU0G,eAAe7e,EAAE7J,EAAEs/B,aAAa,OAAOv/B,EAAEC,EAAE4jB,MAAMgiB,GAAG5lC,EAAE,KAAK6J,EAAEvI,GAAGksC,GAAGztC,EAAEC,EAAE6J,EAAEvI,GAAGtB,EAAE4jB,MAAM,KAAK,GAAG,OAAO/Z,EAAE7J,EAAEiV,KAAKe,EAAEhW,EAAEs/B,aAA2CmO,GAAG1tC,EAAEC,EAAE6J,EAArCmM,EAAEhW,EAAEm/B,cAAct1B,EAAEmM,EAAEoqB,GAAGv2B,EAAEmM,GAAc1U,GAAG,KAAK,EAAE,OAAOksC,GAAGztC,EAAEC,EAAEA,EAAEs/B,aAAah+B,GAAGtB,EAAE4jB,MAAM,KAAK,EAAmD,KAAK,GAAG,OAAO4pB,GAAGztC,EAAEC,EAAEA,EAAEs/B,aAAatjB,SAAS1a,GAAGtB,EAAE4jB,MAAM,KAAK,GAAG7jB,EAAE,CACxZ,GADyZ8J,EAAE7J,EAAEiV,KAAKuE,SAASxD,EAAEhW,EAAEs/B,aAAa9vC,EAAEwQ,EAAE+/B,cAClf9pB,EAAED,EAAErmB,MAAM8sC,GAAE6D,GAAGz2B,EAAE+2B,eAAe/2B,EAAE+2B,cAAc3qB,EAAK,OAAOzmB,EAAE,GAAG8kC,GAAG9kC,EAAEG,MAAMsmB,IAAI,GAAGzmB,EAAEwsB,WAAWhG,EAAEgG,WAAW4gB,GAAG9Y,QAAQ,CAAC9jB,EAAE0tC,GAAG3tC,EAAEC,EAAEsB,GAAG,MAAMvB,CAAC,OAAO,IAAc,QAAVvQ,EAAEwQ,EAAE4jB,SAAiBp0B,EAAE8zB,OAAOtjB,GAAG,OAAOxQ,GAAG,CAAC,IAAIypB,EAAEzpB,EAAEwxC,aAAa,GAAG,OAAO/nB,EAAE,CAAChD,EAAEzmB,EAAEo0B,MAAM,IAAI,IAAIziB,EAAE8X,EAAEgoB,aAAa,OAAO9/B,GAAG,CAAC,GAAGA,EAAEkgC,UAAUx3B,EAAE,CAAC,GAAG,IAAIra,EAAE+kB,IAAI,EAACpT,EAAEmhC,IAAI,EAAEhhC,GAAGA,IAAKiT,IAAI,EAAE,IAAIyE,EAAExpB,EAAEsyC,YAAY,GAAG,OAAO9oB,EAAE,CAAY,IAAI7Z,GAAf6Z,EAAEA,EAAEkpB,QAAeC,QAAQ,OAAOhjC,EAAEgC,EAAE7P,KAAK6P,GAAGA,EAAE7P,KAAK6N,EAAE7N,KAAK6N,EAAE7N,KAAK6P,GAAG6X,EAAEmpB,QAAQhhC,CAAC,CAAC,CAAC3R,EAAE0xC,OAAO5/B,EAAgB,QAAdH,EAAE3R,EAAEmf,aAAqBxN,EAAE+/B,OAAO5/B,GAAGu/B,GAAGrxC,EAAE8zB,OAClfhiB,EAAEtB,GAAGiZ,EAAEioB,OAAO5/B,EAAE,KAAK,CAACH,EAAEA,EAAE7P,IAAI,CAAC,MAAM,GAAG,KAAK9B,EAAE+kB,IAAI0B,EAAEzmB,EAAEylB,OAAOjV,EAAEiV,KAAK,KAAKzlB,EAAEo0B,WAAW,GAAG,KAAKp0B,EAAE+kB,IAAI,CAAY,GAAG,QAAd0B,EAAEzmB,EAAE8zB,QAAmB,MAAMrvB,MAAMogB,EAAE,MAAM4B,EAAEirB,OAAO5/B,EAAgB,QAAd2X,EAAEhD,EAAEtH,aAAqBsK,EAAEioB,OAAO5/B,GAAGu/B,GAAG5qB,EAAE3U,EAAEtB,GAAGiW,EAAEzmB,EAAEq0B,OAAO,MAAM5N,EAAEzmB,EAAEo0B,MAAM,GAAG,OAAO3N,EAAEA,EAAEqN,OAAO9zB,OAAO,IAAIymB,EAAEzmB,EAAE,OAAOymB,GAAG,CAAC,GAAGA,IAAIjW,EAAE,CAACiW,EAAE,KAAK,KAAK,CAAa,GAAG,QAAfzmB,EAAEymB,EAAE4N,SAAoB,CAACr0B,EAAE8zB,OAAOrN,EAAEqN,OAAOrN,EAAEzmB,EAAE,KAAK,CAACymB,EAAEA,EAAEqN,MAAM,CAAC9zB,EAAEymB,CAAC,CAACu3B,GAAGztC,EAAEC,EAAEgW,EAAEgG,SAAS1a,GAAGtB,EAAEA,EAAE4jB,KAAK,CAAC,OAAO5jB,EAAE,KAAK,EAAE,OAAOgW,EAAEhW,EAAEiV,KAAKpL,EAAE7J,EAAEs/B,aAAatjB,SAAS+kB,GAAG/gC,EAAEsB,GAAWuI,EAAEA,EAAVmM,EAAEorB,GAAGprB,IAAUhW,EAAEyP,OAAO,EAAE+9B,GAAGztC,EAAEC,EAAE6J,EAAEvI,GACpftB,EAAE4jB,MAAM,KAAK,GAAG,OAAgB5N,EAAEoqB,GAAXv2B,EAAE7J,EAAEiV,KAAYjV,EAAEs/B,cAA6BqO,GAAG5tC,EAAEC,EAAE6J,EAAtBmM,EAAEoqB,GAAGv2B,EAAEoL,KAAKe,GAAc1U,GAAG,KAAK,GAAG,OAAOwsC,GAAG/tC,EAAEC,EAAEA,EAAEiV,KAAKjV,EAAEs/B,aAAah+B,GAAG,KAAK,GAAG,OAAOuI,EAAE7J,EAAEiV,KAAKe,EAAEhW,EAAEs/B,aAAatpB,EAAEhW,EAAEm/B,cAAct1B,EAAEmM,EAAEoqB,GAAGv2B,EAAEmM,GAAGw4B,GAAGzuC,EAAEC,GAAGA,EAAEuU,IAAI,EAAE2oB,GAAGrzB,IAAI9J,GAAE,EAAGy9B,GAAGx9B,IAAID,GAAE,EAAGghC,GAAG/gC,EAAEsB,GAAG4iC,GAAGlkC,EAAE6J,EAAEmM,GAAGwuB,GAAGxkC,EAAE6J,EAAEmM,EAAE1U,GAAGstC,GAAG,KAAK5uC,EAAE6J,GAAE,EAAG9J,EAAEuB,GAAG,KAAK,GAAG,OAAOovC,GAAG3wC,EAAEC,EAAEsB,GAAG,KAAK,GAAG,OAAO0sC,GAAGjuC,EAAEC,EAAEsB,GAAG,MAAMrN,MAAMogB,EAAE,IAAIrU,EAAEuU,KAAM,EAYxC,IAAIqkC,GAAG,oBAAoBC,YAAYA,YAAY,SAAS94C,GAAGusC,QAAQ34B,MAAM5T,EAAE,EAAE,SAAS+4C,GAAG/4C,GAAGjM,KAAKilD,cAAch5C,CAAC,CACjI,SAASi5C,GAAGj5C,GAAGjM,KAAKilD,cAAch5C,CAAC,CAC5J,SAASk5C,GAAGl5C,GAAG,SAASA,GAAG,IAAIA,EAAEkd,UAAU,IAAIld,EAAEkd,UAAU,KAAKld,EAAEkd,SAAS,CAAC,SAASi8B,GAAGn5C,GAAG,SAASA,GAAG,IAAIA,EAAEkd,UAAU,IAAIld,EAAEkd,UAAU,KAAKld,EAAEkd,WAAW,IAAIld,EAAEkd,UAAU,iCAAiCld,EAAEmd,WAAW,CAAC,SAASi8B,KAAK,CAExa,SAASC,GAAGr5C,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,IAAIxmB,EAAE8R,EAAEsxC,oBAAoB,GAAGpjD,EAAE,CAAC,IAAIymB,EAAEzmB,EAAE,GAAG,oBAAoBwmB,EAAE,CAAC,IAAIiD,EAAEjD,EAAEA,EAAE,WAAW,IAAIjW,EAAEw4C,GAAGtiC,GAAGgD,EAAErnB,KAAKmO,EAAE,CAAC,CAACu4C,GAAGt4C,EAAEiW,EAAElW,EAAEiW,EAAE,MAAMC,EADxJ,SAAYlW,EAAEC,EAAEsB,EAAEuI,EAAEmM,GAAG,GAAGA,EAAE,CAAC,GAAG,oBAAoBnM,EAAE,CAAC,IAAIra,EAAEqa,EAAEA,EAAE,WAAW,IAAI9J,EAAEw4C,GAAGtiC,GAAGzmB,EAAEoC,KAAKmO,EAAE,CAAC,CAAC,IAAIkW,EAAEoiC,GAAGr4C,EAAE6J,EAAE9J,EAAE,EAAE,MAAK,EAAG,EAAG,GAAGo5C,IAAmF,OAA/Ep5C,EAAE6yC,oBAAoB38B,EAAElW,EAAE45B,IAAI1jB,EAAE6N,QAAQsV,GAAG,IAAIr5B,EAAEkd,SAASld,EAAE2hB,WAAW3hB,GAAG+2C,KAAY7gC,CAAC,CAAC,KAAKD,EAAEjW,EAAEid,WAAWjd,EAAE4c,YAAY3G,GAAG,GAAG,oBAAoBnM,EAAE,CAAC,IAAIoP,EAAEpP,EAAEA,EAAE,WAAW,IAAI9J,EAAEw4C,GAAGp3C,GAAG8X,EAAErnB,KAAKmO,EAAE,CAAC,CAAC,IAAIoB,EAAE82C,GAAGl4C,EAAE,GAAE,EAAG,KAAK,GAAK,EAAG,EAAG,GAAGo5C,IAA0G,OAAtGp5C,EAAE6yC,oBAAoBzxC,EAAEpB,EAAE45B,IAAIx4B,EAAE2iB,QAAQsV,GAAG,IAAIr5B,EAAEkd,SAASld,EAAE2hB,WAAW3hB,GAAG+2C,IAAG,WAAWwB,GAAGt4C,EAAEmB,EAAEG,EAAEuI,EAAE,IAAU1I,CAAC,CACpUk4C,CAAG/3C,EAAEtB,EAAED,EAAEiW,EAAEnM,GAAG,OAAO0uC,GAAGtiC,EAAE,CAHpL+iC,GAAG1kD,UAAU+kB,OAAOy/B,GAAGxkD,UAAU+kB,OAAO,SAAStZ,GAAG,IAAIC,EAAElM,KAAKilD,cAAc,GAAG,OAAO/4C,EAAE,MAAM/L,MAAMogB,EAAE,MAAMikC,GAAGv4C,EAAEC,EAAE,KAAK,KAAK,EAAEg5C,GAAG1kD,UAAUglD,QAAQR,GAAGxkD,UAAUglD,QAAQ,WAAW,IAAIv5C,EAAEjM,KAAKilD,cAAc,GAAG,OAAOh5C,EAAE,CAACjM,KAAKilD,cAAc,KAAK,IAAI/4C,EAAED,EAAE2oB,cAAcouB,IAAG,WAAWwB,GAAG,KAAKv4C,EAAE,KAAK,KAAK,IAAGC,EAAE25B,IAAI,IAAI,CAAC,EACzTqf,GAAG1kD,UAAUilD,2BAA2B,SAASx5C,GAAG,GAAGA,EAAE,CAAC,IAAIC,EAAEinB,KAAKlnB,EAAE,CAACmoB,UAAU,KAAK1zB,OAAOuL,EAAEyoB,SAASxoB,GAAG,IAAI,IAAIsB,EAAE,EAAEA,EAAEqmB,GAAG32B,QAAQ,IAAIgP,GAAGA,EAAE2nB,GAAGrmB,GAAGknB,SAASlnB,KAAKqmB,GAAG6xB,OAAOl4C,EAAE,EAAEvB,GAAG,IAAIuB,GAAGgnB,GAAGvoB,EAAE,CAAC,EAEX+mB,GAAG,SAAS/mB,GAAG,OAAOA,EAAEwU,KAAK,KAAK,EAAE,IAAIvU,EAAED,EAAEiiB,UAAU,GAAGhiB,EAAE8jB,QAAQN,cAAciF,aAAa,CAAC,IAAInnB,EAAEykB,GAAG/lB,EAAEimB,cAAc,IAAI3kB,IAAIslB,GAAG5mB,EAAI,EAAFsB,GAAKi0C,GAAGv1C,EAAEmJ,MAAK,KAAO,EAAFy5B,MAAO6O,GAAGtoC,KAAI,IAAI40B,MAAM,CAAC,MAAM,KAAK,GAAG+Y,IAAG,WAAW,IAAI92C,EAAE2hC,GAAG5hC,EAAE,GAAG,GAAG,OAAOC,EAAE,CAAC,IAAIsB,EAAE+H,KAAIu6B,GAAG5jC,EAAED,EAAE,EAAEuB,EAAE,CAAC,IAAGm3C,GAAG14C,EAAE,GAAG,EAC/bgnB,GAAG,SAAShnB,GAAG,GAAG,KAAKA,EAAEwU,IAAI,CAAC,IAAIvU,EAAE2hC,GAAG5hC,EAAE,WAAW,GAAG,OAAOC,EAAa4jC,GAAG5jC,EAAED,EAAE,UAAXsJ,MAAwBovC,GAAG14C,EAAE,UAAU,CAAC,EAAEinB,GAAG,SAASjnB,GAAG,GAAG,KAAKA,EAAEwU,IAAI,CAAC,IAAIvU,EAAE2jC,GAAG5jC,GAAGuB,EAAEqgC,GAAG5hC,EAAEC,GAAG,GAAG,OAAOsB,EAAasiC,GAAGtiC,EAAEvB,EAAEC,EAAXqJ,MAAgBovC,GAAG14C,EAAEC,EAAE,CAAC,EAAEinB,GAAG,WAAW,OAAO7d,EAAC,EAAE8d,GAAG,SAASnnB,EAAEC,GAAG,IAAIsB,EAAE8H,GAAE,IAAI,OAAOA,GAAErJ,EAAEC,GAAG,CAAC,QAAQoJ,GAAE9H,CAAC,CAAC,EAClSqgB,GAAG,SAAS5hB,EAAEC,EAAEsB,GAAG,OAAOtB,GAAG,IAAK,QAAyB,GAAjBqb,EAAGtb,EAAEuB,GAAGtB,EAAEsB,EAAEhR,KAAQ,UAAUgR,EAAE2T,MAAM,MAAMjV,EAAE,CAAC,IAAIsB,EAAEvB,EAAEuB,EAAEogB,YAAYpgB,EAAEA,EAAEogB,WAAsF,IAA3EpgB,EAAEA,EAAEm4C,iBAAiB,cAAcC,KAAKC,UAAU,GAAG35C,GAAG,mBAAuBA,EAAE,EAAEA,EAAEsB,EAAEtQ,OAAOgP,IAAI,CAAC,IAAI6J,EAAEvI,EAAEtB,GAAG,GAAG6J,IAAI9J,GAAG8J,EAAE+vC,OAAO75C,EAAE65C,KAAK,CAAC,IAAI5jC,EAAEiM,GAAGpY,GAAG,IAAImM,EAAE,MAAM/hB,MAAMogB,EAAE,KAAKmG,EAAG3Q,GAAGwR,EAAGxR,EAAEmM,EAAE,CAAC,CAAC,CAAC,MAAM,IAAK,WAAWkG,GAAGnc,EAAEuB,GAAG,MAAM,IAAK,SAAmB,OAAVtB,EAAEsB,EAAE3R,QAAe+rB,GAAG3b,IAAIuB,EAAE0vC,SAAShxC,GAAE,GAAI,EAAEoiB,GAAGy0B,GAAGx0B,GAAGy0B,GACpa,IAAI+C,GAAG,CAACC,uBAAsB,EAAGC,OAAO,CAACh4B,GAAGwR,GAAGtR,GAAGC,GAAGC,GAAG00B,KAAKmD,GAAG,CAACC,wBAAwB1xB,GAAG2xB,WAAW,EAAEC,QAAQ,SAASC,oBAAoB,aAC1IC,GAAG,CAACH,WAAWF,GAAGE,WAAWC,QAAQH,GAAGG,QAAQC,oBAAoBJ,GAAGI,oBAAoBE,eAAeN,GAAGM,eAAeC,kBAAkB,KAAKC,4BAA4B,KAAKC,4BAA4B,KAAKC,cAAc,KAAKC,wBAAwB,KAAKC,wBAAwB,KAAKC,gBAAgB,KAAKC,mBAAmB,KAAKC,eAAe,KAAKC,qBAAqB3jC,EAAGyvB,uBAAuBmU,wBAAwB,SAASl7C,GAAW,OAAO,QAAfA,EAAE4jB,GAAG5jB,IAAmB,KAAKA,EAAEiiB,SAAS,EAAEi4B,wBAAwBD,GAAGC,yBARjN,WAAc,OAAO,IAAI,EASpUiB,4BAA4B,KAAKC,gBAAgB,KAAKC,aAAa,KAAKC,kBAAkB,KAAKC,gBAAgB,KAAKC,kBAAkB,kCAAkC,GAAG,qBAAqBC,+BAA+B,CAAC,IAAIC,GAAGD,+BAA+B,IAAIC,GAAGC,YAAYD,GAAGE,cAAc,IAAIr2B,GAAGm2B,GAAGG,OAAOvB,IAAI90B,GAAGk2B,EAAE,CAAC,MAAM17C,IAAG,CAAC,CAAC7Q,EAAQooB,mDAAmDuiC,GAC9Y3qD,EAAQ2sD,aAAa,SAAS97C,EAAEC,GAAG,IAAIsB,EAAE,EAAEzN,UAAU7C,aAAQ,IAAS6C,UAAU,GAAGA,UAAU,GAAG,KAAK,IAAIolD,GAAGj5C,GAAG,MAAM/L,MAAMogB,EAAE,MAAM,OAbuH,SAAYtU,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE,EAAEhW,UAAU7C,aAAQ,IAAS6C,UAAU,GAAGA,UAAU,GAAG,KAAK,MAAM,CAAC0lB,SAAS9B,EAAG7Z,IAAI,MAAMiM,EAAE,KAAK,GAAGA,EAAEmS,SAASjc,EAAE2oB,cAAc1oB,EAAEylC,eAAenkC,EAAE,CAa1Rw6C,CAAG/7C,EAAEC,EAAE,KAAKsB,EAAE,EAAEpS,EAAQ6sD,WAAW,SAASh8C,EAAEC,GAAG,IAAIi5C,GAAGl5C,GAAG,MAAM9L,MAAMogB,EAAE,MAAM,IAAI/S,GAAE,EAAGuI,EAAE,GAAGmM,EAAE4iC,GAA4P,OAAzP,OAAO54C,QAAG,IAASA,KAAI,IAAKA,EAAEg8C,sBAAsB16C,GAAE,QAAI,IAAStB,EAAEgsC,mBAAmBniC,EAAE7J,EAAEgsC,uBAAkB,IAAShsC,EAAEu3C,qBAAqBvhC,EAAEhW,EAAEu3C,qBAAqBv3C,EAAEi4C,GAAGl4C,EAAE,GAAE,EAAG,KAAK,EAAKuB,EAAE,EAAGuI,EAAEmM,GAAGjW,EAAE45B,IAAI35B,EAAE8jB,QAAQsV,GAAG,IAAIr5B,EAAEkd,SAASld,EAAE2hB,WAAW3hB,GAAU,IAAI+4C,GAAG94C,EAAE,EACrf9Q,EAAQ+sD,YAAY,SAASl8C,GAAG,GAAG,MAAMA,EAAE,OAAO,KAAK,GAAG,IAAIA,EAAEkd,SAAS,OAAOld,EAAE,IAAIC,EAAED,EAAE0jC,gBAAgB,QAAG,IAASzjC,EAAE,CAAC,GAAG,oBAAoBD,EAAEsZ,OAAO,MAAMplB,MAAMogB,EAAE,MAAiC,MAA3BtU,EAAE5F,OAAOyM,KAAK7G,GAAGtK,KAAK,KAAWxB,MAAMogB,EAAE,IAAItU,GAAI,CAAqC,OAA5BA,EAAE,QAAVA,EAAE4jB,GAAG3jB,IAAc,KAAKD,EAAEiiB,SAAkB,EAAE9yB,EAAQgtD,UAAU,SAASn8C,GAAG,OAAO+2C,GAAG/2C,EAAE,EAAE7Q,EAAQitD,QAAQ,SAASp8C,EAAEC,EAAEsB,GAAG,IAAI43C,GAAGl5C,GAAG,MAAM/L,MAAMogB,EAAE,MAAM,OAAO+kC,GAAG,KAAKr5C,EAAEC,GAAE,EAAGsB,EAAE,EAC/YpS,EAAQktD,YAAY,SAASr8C,EAAEC,EAAEsB,GAAG,IAAI23C,GAAGl5C,GAAG,MAAM9L,MAAMogB,EAAE,MAAM,IAAIxK,EAAE,MAAMvI,GAAGA,EAAE+6C,iBAAiB,KAAKrmC,GAAE,EAAGxmB,EAAE,GAAGymB,EAAE2iC,GAAyO,GAAtO,OAAOt3C,QAAG,IAASA,KAAI,IAAKA,EAAE06C,sBAAsBhmC,GAAE,QAAI,IAAS1U,EAAE0qC,mBAAmBx8C,EAAE8R,EAAE0qC,uBAAkB,IAAS1qC,EAAEi2C,qBAAqBthC,EAAE3U,EAAEi2C,qBAAqBv3C,EAAEq4C,GAAGr4C,EAAE,KAAKD,EAAE,EAAE,MAAMuB,EAAEA,EAAE,KAAK0U,EAAE,EAAGxmB,EAAEymB,GAAGlW,EAAE45B,IAAI35B,EAAE8jB,QAAQsV,GAAGr5B,GAAM8J,EAAE,IAAI9J,EAAE,EAAEA,EAAE8J,EAAE7Y,OAAO+O,IAA2BiW,GAAhBA,GAAP1U,EAAEuI,EAAE9J,IAAOu8C,aAAgBh7C,EAAEi7C,SAAS,MAAMv8C,EAAEg4C,gCAAgCh4C,EAAEg4C,gCAAgC,CAAC12C,EAAE0U,GAAGhW,EAAEg4C,gCAAgCxmD,KAAK8P,EACvhB0U,GAAG,OAAO,IAAIgjC,GAAGh5C,EAAE,EAAE9Q,EAAQmqB,OAAO,SAAStZ,EAAEC,EAAEsB,GAAG,IAAI43C,GAAGl5C,GAAG,MAAM/L,MAAMogB,EAAE,MAAM,OAAO+kC,GAAG,KAAKr5C,EAAEC,GAAE,EAAGsB,EAAE,EAAEpS,EAAQstD,uBAAuB,SAASz8C,GAAG,IAAIm5C,GAAGn5C,GAAG,MAAM9L,MAAMogB,EAAE,KAAK,QAAOtU,EAAE6yC,sBAAqBkE,IAAG,WAAWsC,GAAG,KAAK,KAAKr5C,GAAE,GAAG,WAAWA,EAAE6yC,oBAAoB,KAAK7yC,EAAE45B,IAAI,IAAI,GAAE,KAAG,EAAM,EAAEzqC,EAAQutD,wBAAwB5F,GAC/U3nD,EAAQwtD,oCAAoC,SAAS38C,EAAEC,EAAEsB,EAAEuI,GAAG,IAAIqvC,GAAG53C,GAAG,MAAMrN,MAAMogB,EAAE,MAAM,GAAG,MAAMtU,QAAG,IAASA,EAAE0jC,gBAAgB,MAAMxvC,MAAMogB,EAAE,KAAK,OAAO+kC,GAAGr5C,EAAEC,EAAEsB,GAAE,EAAGuI,EAAE,EAAE3a,EAAQirD,QAAQ,iDChU7L,IAAIh7C,EAAInQ,EAAQ,MAEdE,EAAQ6sD,WAAa58C,EAAE48C,WACvB7sD,EAAQktD,YAAcj9C,EAAEi9C,6BCH1B,SAASO,IAEP,GAC4C,qBAAnCnB,gCAC4C,oBAA5CA,+BAA+BmB,SAcxC,IAEEnB,+BAA+BmB,SAASA,EAC1C,CAAE,MAAO7jD,GAGPwzC,QAAQ34B,MAAM7a,EAChB,CACF,CAKE6jD,GACA1tD,EAAOC,QAAU,EAAjBD,sBCzBW,IAAIO,EAAER,EAAQ,MAASmS,EAAEnH,OAAOwd,IAAI,iBAAiBwB,EAAEhf,OAAOwd,IAAI,kBAAkBrY,EAAEhF,OAAO7F,UAAU8F,eAAeoK,EAAEhV,EAAE8nB,mDAAmDi2B,kBAAkBl5B,EAAE,CAACzW,KAAI,EAAGonC,KAAI,EAAG4X,QAAO,EAAGC,UAAS,GAChP,SAAS7Z,EAAE1hC,EAAEvB,EAAEkW,GAAG,IAAIjW,EAAE6J,EAAE,CAAC,EAAEmM,EAAE,KAAKiD,EAAE,KAAiF,IAAIjZ,UAAhF,IAASiW,IAAID,EAAE,GAAGC,QAAG,IAASlW,EAAEnC,MAAMoY,EAAE,GAAGjW,EAAEnC,UAAK,IAASmC,EAAEilC,MAAM/rB,EAAElZ,EAAEilC,KAAcjlC,EAAEZ,EAAEvN,KAAKmO,EAAEC,KAAKqU,EAAEja,eAAe4F,KAAK6J,EAAE7J,GAAGD,EAAEC,IAAI,GAAGsB,GAAGA,EAAE++B,aAAa,IAAIrgC,KAAKD,EAAEuB,EAAE++B,kBAAe,IAASx2B,EAAE7J,KAAK6J,EAAE7J,GAAGD,EAAEC,IAAI,MAAM,CAACuZ,SAASpY,EAAE8T,KAAK3T,EAAE1D,IAAIoY,EAAEgvB,IAAI/rB,EAAEwrB,MAAM56B,EAAEo7B,OAAOzgC,EAAEsf,QAAQ,CAAC50B,EAAQ4tD,SAAS9jC,EAAE9pB,EAAQ6tD,IAAI/Z,EAAE9zC,EAAQ8tD,KAAKha,gBCD7V,IAAIhqB,EAAEhf,OAAOwd,IAAI,iBAAiBhT,EAAExK,OAAOwd,IAAI,gBAAgBnD,EAAEra,OAAOwd,IAAI,kBAAkBwrB,EAAEhpC,OAAOwd,IAAI,qBAAqBpW,EAAEpH,OAAOwd,IAAI,kBAAkBnW,EAAErH,OAAOwd,IAAI,kBAAkBjT,EAAEvK,OAAOwd,IAAI,iBAAiB3mB,EAAEmJ,OAAOwd,IAAI,qBAAqBvU,EAAEjJ,OAAOwd,IAAI,kBAAkBtnB,EAAE8J,OAAOwd,IAAI,cAAchZ,EAAExE,OAAOwd,IAAI,cAAcnmB,EAAE2I,OAAOC,SACzW,IAAIkP,EAAE,CAACq6B,UAAU,WAAW,OAAM,CAAE,EAAEM,mBAAmB,WAAW,EAAED,oBAAoB,WAAW,EAAEH,gBAAgB,WAAW,GAAGt6B,EAAEjP,OAAO2G,OAAOi4B,EAAE,CAAC,EAAE,SAASyD,EAAEz8B,EAAEC,EAAEgW,GAAGliB,KAAK2wC,MAAM1kC,EAAEjM,KAAKutC,QAAQrhC,EAAElM,KAAKuvC,KAAKtK,EAAEjlC,KAAKswC,QAAQpuB,GAAG7M,CAAC,CACwI,SAASswB,IAAI,CAAyB,SAASgD,EAAE18B,EAAEC,EAAEgW,GAAGliB,KAAK2wC,MAAM1kC,EAAEjM,KAAKutC,QAAQrhC,EAAElM,KAAKuvC,KAAKtK,EAAEjlC,KAAKswC,QAAQpuB,GAAG7M,CAAC,CADxPqzB,EAAEloC,UAAUujD,iBAAiB,CAAC,EACpQrb,EAAEloC,UAAUuY,SAAS,SAAS9M,EAAEC,GAAG,GAAG,kBAAkBD,GAAG,oBAAoBA,GAAG,MAAMA,EAAE,MAAM9L,MAAM,yHAAyHH,KAAKswC,QAAQV,gBAAgB5vC,KAAKiM,EAAEC,EAAE,WAAW,EAAEw8B,EAAEloC,UAAU2oD,YAAY,SAASl9C,GAAGjM,KAAKswC,QAAQN,mBAAmBhwC,KAAKiM,EAAE,cAAc,EAAgB05B,EAAEnlC,UAAUkoC,EAAEloC,UAAsF,IAAIqoC,EAAEF,EAAEnoC,UAAU,IAAImlC,EACrfkD,EAAEtsC,YAAYosC,EAAErzB,EAAEuzB,EAAEH,EAAEloC,WAAWqoC,EAAEsH,sBAAqB,EAAG,IAAIlF,EAAEtjC,MAAMxJ,QAAQunC,EAAEr/B,OAAO7F,UAAU8F,eAAewoC,EAAE,CAAC9e,QAAQ,MAAMza,EAAE,CAACzL,KAAI,EAAGonC,KAAI,EAAG4X,QAAO,EAAGC,UAAS,GACtK,SAAS5xC,EAAElL,EAAEC,EAAEgW,GAAG,IAAInM,EAAEvI,EAAE,CAAC,EAAEH,EAAE,KAAK8X,EAAE,KAAK,GAAG,MAAMjZ,EAAE,IAAI6J,UAAK,IAAS7J,EAAEglC,MAAM/rB,EAAEjZ,EAAEglC,UAAK,IAAShlC,EAAEpC,MAAMuD,EAAE,GAAGnB,EAAEpC,KAAKoC,EAAEw5B,EAAE5nC,KAAKoO,EAAE6J,KAAKR,EAAEjP,eAAeyP,KAAKvI,EAAEuI,GAAG7J,EAAE6J,IAAI,IAAIoM,EAAEpiB,UAAU7C,OAAO,EAAE,GAAG,IAAIilB,EAAE3U,EAAE0a,SAAShG,OAAO,GAAG,EAAEC,EAAE,CAAC,IAAI,IAAIzmB,EAAEiM,MAAMwa,GAAG9W,EAAE,EAAEA,EAAE8W,EAAE9W,IAAI3P,EAAE2P,GAAGtL,UAAUsL,EAAE,GAAGmC,EAAE0a,SAASxsB,CAAC,CAAC,GAAGuQ,GAAGA,EAAEsgC,aAAa,IAAIx2B,KAAKoM,EAAElW,EAAEsgC,kBAAe,IAAS/+B,EAAEuI,KAAKvI,EAAEuI,GAAGoM,EAAEpM,IAAI,MAAM,CAAC0P,SAASP,EAAE/D,KAAKlV,EAAEnC,IAAIuD,EAAE6jC,IAAI/rB,EAAEwrB,MAAMnjC,EAAE2jC,OAAOrC,EAAE9e,QAAQ,CAChV,SAASmjB,EAAElnC,GAAG,MAAM,kBAAkBA,GAAG,OAAOA,GAAGA,EAAEwZ,WAAWP,CAAC,CAAoG,IAAIkuB,EAAE,OAAO,SAASK,EAAExnC,EAAEC,GAAG,MAAM,kBAAkBD,GAAG,OAAOA,GAAG,MAAMA,EAAEnC,IAA7K,SAAgBmC,GAAG,IAAIC,EAAE,CAAC,IAAI,KAAK,IAAI,MAAM,MAAM,IAAID,EAAE0N,QAAQ,SAAQ,SAAS1N,GAAG,OAAOC,EAAED,EAAE,GAAE,CAA+Em9C,CAAO,GAAGn9C,EAAEnC,KAAKoC,EAAExK,SAAS,GAAG,CAC/W,SAASuN,EAAEhD,EAAEC,EAAEgW,EAAEnM,EAAEvI,GAAG,IAAIH,SAASpB,EAAK,cAAcoB,GAAG,YAAYA,IAAEpB,EAAE,MAAK,IAAIkZ,GAAE,EAAG,GAAG,OAAOlZ,EAAEkZ,GAAE,OAAQ,OAAO9X,GAAG,IAAK,SAAS,IAAK,SAAS8X,GAAE,EAAG,MAAM,IAAK,SAAS,OAAOlZ,EAAEwZ,UAAU,KAAKP,EAAE,KAAKxU,EAAEyU,GAAE,GAAI,GAAGA,EAAE,OAAW3X,EAAEA,EAAN2X,EAAElZ,GAASA,EAAE,KAAK8J,EAAE,IAAI09B,EAAEtuB,EAAE,GAAGpP,EAAEk1B,EAAEz9B,IAAI0U,EAAE,GAAG,MAAMjW,IAAIiW,EAAEjW,EAAE0N,QAAQy5B,EAAE,OAAO,KAAKnkC,EAAEzB,EAAEtB,EAAEgW,EAAE,IAAG,SAASjW,GAAG,OAAOA,CAAC,KAAI,MAAMuB,IAAI2lC,EAAE3lC,KAAKA,EADnW,SAAWvB,EAAEC,GAAG,MAAM,CAACuZ,SAASP,EAAE/D,KAAKlV,EAAEkV,KAAKrX,IAAIoC,EAAEglC,IAAIjlC,EAAEilC,IAAIP,MAAM1kC,EAAE0kC,MAAMQ,OAAOllC,EAAEklC,OAAO,CACyQnvC,CAAEwL,EAAE0U,IAAI1U,EAAE1D,KAAKqb,GAAGA,EAAErb,MAAM0D,EAAE1D,IAAI,IAAI,GAAG0D,EAAE1D,KAAK6P,QAAQy5B,EAAE,OAAO,KAAKnnC,IAAIC,EAAExO,KAAK8P,IAAI,EAAyB,GAAvB2X,EAAE,EAAEpP,EAAE,KAAKA,EAAE,IAAIA,EAAE,IAAOk1B,EAAEh/B,GAAG,IAAI,IAAIkW,EAAE,EAAEA,EAAElW,EAAE/O,OAAOilB,IAAI,CAC/e,IAAIzmB,EAAEqa,EAAE09B,EADwepmC,EACrfpB,EAAEkW,GAAeA,GAAGgD,GAAGlW,EAAE5B,EAAEnB,EAAEgW,EAAExmB,EAAE8R,EAAE,MAAM,GAAG9R,EAPsU,SAAWuQ,GAAG,OAAG,OAAOA,GAAG,kBAAkBA,EAAS,KAAsC,oBAAjCA,EAAE1O,GAAG0O,EAAE1O,IAAI0O,EAAE,eAA0CA,EAAE,IAAI,CAO5biJ,CAAEjJ,GAAG,oBAAoBvQ,EAAE,IAAIuQ,EAAEvQ,EAAEoC,KAAKmO,GAAGkW,EAAE,IAAI9U,EAAEpB,EAAEzO,QAAQC,MAA6B0nB,GAAGlW,EAA1B5B,EAAEA,EAAExR,MAA0BqQ,EAAEgW,EAAtBxmB,EAAEqa,EAAE09B,EAAEpmC,EAAE8U,KAAkB3U,QAAQ,GAAG,WAAWH,EAAE,MAAMnB,EAAElC,OAAOiC,GAAG9L,MAAM,mDAAmD,oBAAoB+L,EAAE,qBAAqB7F,OAAOyM,KAAK7G,GAAGtK,KAAK,MAAM,IAAIuK,GAAG,6EAA6E,OAAOiZ,CAAC,CACzZ,SAAS23B,EAAE7wC,EAAEC,EAAEgW,GAAG,GAAG,MAAMjW,EAAE,OAAOA,EAAE,IAAI8J,EAAE,GAAGvI,EAAE,EAAmD,OAAjDyB,EAAEhD,EAAE8J,EAAE,GAAG,IAAG,SAAS9J,GAAG,OAAOC,EAAEpO,KAAKokB,EAAEjW,EAAEuB,IAAI,IAAUuI,CAAC,CAAC,SAAS2nC,EAAEzxC,GAAG,IAAI,IAAIA,EAAEo9C,QAAQ,CAAC,IAAIn9C,EAAED,EAAEq9C,SAAQp9C,EAAEA,KAAMy7B,MAAK,SAASz7B,GAAM,IAAID,EAAEo9C,UAAU,IAAIp9C,EAAEo9C,UAAQp9C,EAAEo9C,QAAQ,EAAEp9C,EAAEq9C,QAAQp9C,EAAC,IAAE,SAASA,GAAM,IAAID,EAAEo9C,UAAU,IAAIp9C,EAAEo9C,UAAQp9C,EAAEo9C,QAAQ,EAAEp9C,EAAEq9C,QAAQp9C,EAAC,KAAI,IAAID,EAAEo9C,UAAUp9C,EAAEo9C,QAAQ,EAAEp9C,EAAEq9C,QAAQp9C,EAAE,CAAC,GAAG,IAAID,EAAEo9C,QAAQ,OAAOp9C,EAAEq9C,QAAQ3tD,QAAQ,MAAMsQ,EAAEq9C,OAAQ,CAC5Z,IAAIvL,EAAE,CAAC/tB,QAAQ,MAAM/Z,EAAE,CAACwf,WAAW,MAAM0oB,EAAE,CAACnL,uBAAuB+K,EAAEzoB,wBAAwBrf,EAAEwjC,kBAAkB3K,GAAG1zC,EAAQmuD,SAAS,CAACC,IAAI1M,EAAEl6B,QAAQ,SAAS3W,EAAEC,EAAEgW,GAAG46B,EAAE7wC,GAAE,WAAWC,EAAEqR,MAAMvd,KAAKD,UAAU,GAAEmiB,EAAE,EAAEunC,MAAM,SAASx9C,GAAG,IAAIC,EAAE,EAAuB,OAArB4wC,EAAE7wC,GAAE,WAAWC,GAAG,IAAUA,CAAC,EAAEw9C,QAAQ,SAASz9C,GAAG,OAAO6wC,EAAE7wC,GAAE,SAASA,GAAG,OAAOA,CAAC,KAAI,EAAE,EAAE09C,KAAK,SAAS19C,GAAG,IAAIknC,EAAElnC,GAAG,MAAM9L,MAAM,yEAAyE,OAAO8L,CAAC,GAAG7Q,EAAQk0C,UAAU5G,EAAEttC,EAAQ4tD,SAASzoC,EACnenlB,EAAQwuD,SAASt8C,EAAElS,EAAQyuD,cAAclhB,EAAEvtC,EAAQ0uD,WAAW5a,EAAE9zC,EAAQ2uD,SAAS56C,EAAE/T,EAAQooB,mDAAmD26B,EAC9I/iD,EAAQ4uD,aAAa,SAAS/9C,EAAEC,EAAEgW,GAAG,GAAG,OAAOjW,QAAG,IAASA,EAAE,MAAM9L,MAAM,iFAAiF8L,EAAE,KAAK,IAAI8J,EAAET,EAAE,CAAC,EAAErJ,EAAE0kC,OAAOnjC,EAAEvB,EAAEnC,IAAIuD,EAAEpB,EAAEilC,IAAI/rB,EAAElZ,EAAEklC,OAAO,GAAG,MAAMjlC,EAAE,CAAoE,QAAnE,IAASA,EAAEglC,MAAM7jC,EAAEnB,EAAEglC,IAAI/rB,EAAE2pB,EAAE9e,cAAS,IAAS9jB,EAAEpC,MAAM0D,EAAE,GAAGtB,EAAEpC,KAAQmC,EAAEkV,MAAMlV,EAAEkV,KAAKorB,aAAa,IAAIpqB,EAAElW,EAAEkV,KAAKorB,aAAa,IAAI7wC,KAAKwQ,EAAEw5B,EAAE5nC,KAAKoO,EAAExQ,KAAK6Z,EAAEjP,eAAe5K,KAAKqa,EAAEra,QAAG,IAASwQ,EAAExQ,SAAI,IAASymB,EAAEA,EAAEzmB,GAAGwQ,EAAExQ,GAAG,CAAC,IAAIA,EAAEqE,UAAU7C,OAAO,EAAE,GAAG,IAAIxB,EAAEqa,EAAEmS,SAAShG,OAAO,GAAG,EAAExmB,EAAE,CAACymB,EAAExa,MAAMjM,GACrf,IAAI,IAAI2P,EAAE,EAAEA,EAAE3P,EAAE2P,IAAI8W,EAAE9W,GAAGtL,UAAUsL,EAAE,GAAG0K,EAAEmS,SAAS/F,CAAC,CAAC,MAAM,CAACsD,SAASP,EAAE/D,KAAKlV,EAAEkV,KAAKrX,IAAI0D,EAAE0jC,IAAI7jC,EAAEsjC,MAAM56B,EAAEo7B,OAAOhsB,EAAE,EAAE/pB,EAAQ6uD,cAAc,SAASh+C,GAAqK,OAAlKA,EAAE,CAACwZ,SAAShV,EAAEq8B,cAAc7gC,EAAEi+C,eAAej+C,EAAEk+C,aAAa,EAAEC,SAAS,KAAKC,SAAS,KAAKC,cAAc,KAAKC,YAAY,OAAQH,SAAS,CAAC3kC,SAASlY,EAAEmY,SAASzZ,GAAUA,EAAEo+C,SAASp+C,CAAC,EAAE7Q,EAAQ0mB,cAAc3K,EAAE/b,EAAQovD,cAAc,SAASv+C,GAAG,IAAIC,EAAEiL,EAAEouB,KAAK,KAAKt5B,GAAY,OAATC,EAAEiV,KAAKlV,EAASC,CAAC,EAAE9Q,EAAQqvD,UAAU,WAAW,MAAM,CAACz6B,QAAQ,KAAK,EAC9d50B,EAAQsvD,WAAW,SAASz+C,GAAG,MAAM,CAACwZ,SAAS1oB,EAAEwoB,OAAOtZ,EAAE,EAAE7Q,EAAQuvD,eAAexX,EAAE/3C,EAAQwvD,KAAK,SAAS3+C,GAAG,MAAM,CAACwZ,SAAS/a,EAAEib,SAAS,CAAC0jC,SAAS,EAAEC,QAAQr9C,GAAG2Z,MAAM83B,EAAE,EAAEtiD,EAAQyvD,KAAK,SAAS5+C,EAAEC,GAAG,MAAM,CAACuZ,SAASrpB,EAAE+kB,KAAKlV,EAAE8tC,aAAQ,IAAS7tC,EAAE,KAAKA,EAAE,EAAE9Q,EAAQ0vD,gBAAgB,SAAS7+C,GAAG,IAAIC,EAAE+J,EAAEwf,WAAWxf,EAAEwf,WAAW,CAAC,EAAE,IAAIxpB,GAAG,CAAC,QAAQgK,EAAEwf,WAAWvpB,CAAC,CAAC,EAAE9Q,EAAQ2vD,aAAa,WAAW,MAAM5qD,MAAM,2DAA4D,EAC1c/E,EAAQ67C,YAAY,SAAShrC,EAAEC,GAAG,OAAO6xC,EAAE/tB,QAAQinB,YAAYhrC,EAAEC,EAAE,EAAE9Q,EAAQ87C,WAAW,SAASjrC,GAAG,OAAO8xC,EAAE/tB,QAAQknB,WAAWjrC,EAAE,EAAE7Q,EAAQu8C,cAAc,WAAW,EAAEv8C,EAAQw8C,iBAAiB,SAAS3rC,GAAG,OAAO8xC,EAAE/tB,QAAQ4nB,iBAAiB3rC,EAAE,EAAE7Q,EAAQ+7C,UAAU,SAASlrC,EAAEC,GAAG,OAAO6xC,EAAE/tB,QAAQmnB,UAAUlrC,EAAEC,EAAE,EAAE9Q,EAAQ48C,MAAM,WAAW,OAAO+F,EAAE/tB,QAAQgoB,OAAO,EAAE58C,EAAQg8C,oBAAoB,SAASnrC,EAAEC,EAAEgW,GAAG,OAAO67B,EAAE/tB,QAAQonB,oBAAoBnrC,EAAEC,EAAEgW,EAAE,EAC7b9mB,EAAQi8C,mBAAmB,SAASprC,EAAEC,GAAG,OAAO6xC,EAAE/tB,QAAQqnB,mBAAmBprC,EAAEC,EAAE,EAAE9Q,EAAQk8C,gBAAgB,SAASrrC,EAAEC,GAAG,OAAO6xC,EAAE/tB,QAAQsnB,gBAAgBrrC,EAAEC,EAAE,EAAE9Q,EAAQm8C,QAAQ,SAAStrC,EAAEC,GAAG,OAAO6xC,EAAE/tB,QAAQunB,QAAQtrC,EAAEC,EAAE,EAAE9Q,EAAQo8C,WAAW,SAASvrC,EAAEC,EAAEgW,GAAG,OAAO67B,EAAE/tB,QAAQwnB,WAAWvrC,EAAEC,EAAEgW,EAAE,EAAE9mB,EAAQq8C,OAAO,SAASxrC,GAAG,OAAO8xC,EAAE/tB,QAAQynB,OAAOxrC,EAAE,EAAE7Q,EAAQs8C,SAAS,SAASzrC,GAAG,OAAO8xC,EAAE/tB,QAAQ0nB,SAASzrC,EAAE,EAAE7Q,EAAQ28C,qBAAqB,SAAS9rC,EAAEC,EAAEgW,GAAG,OAAO67B,EAAE/tB,QAAQ+nB,qBAAqB9rC,EAAEC,EAAEgW,EAAE,EAC/e9mB,EAAQy8C,cAAc,WAAW,OAAOkG,EAAE/tB,QAAQ6nB,eAAe,EAAEz8C,EAAQirD,QAAQ,yBCtBjFlrD,EAAOC,QAAU,EAAjBD,qBCAAA,EAAOC,QAAU,EAAjBD,oBCMW,SAASO,EAAEuQ,EAAEC,GAAG,IAAIsB,EAAEvB,EAAE/O,OAAO+O,EAAEvO,KAAKwO,GAAGD,EAAE,KAAK,EAAEuB,GAAG,CAAC,IAAIuI,EAAEvI,EAAE,IAAI,EAAE0U,EAAEjW,EAAE8J,GAAG,KAAG,EAAEoM,EAAED,EAAEhW,IAA0B,MAAMD,EAA7BA,EAAE8J,GAAG7J,EAAED,EAAEuB,GAAG0U,EAAE1U,EAAEuI,CAAc,CAAC,CAAC,SAASoP,EAAElZ,GAAG,OAAO,IAAIA,EAAE/O,OAAO,KAAK+O,EAAE,EAAE,CAAC,SAASoB,EAAEpB,GAAG,GAAG,IAAIA,EAAE/O,OAAO,OAAO,KAAK,IAAIgP,EAAED,EAAE,GAAGuB,EAAEvB,EAAE++C,MAAM,GAAGx9C,IAAItB,EAAE,CAACD,EAAE,GAAGuB,EAAEvB,EAAE,IAAI,IAAI8J,EAAE,EAAEmM,EAAEjW,EAAE/O,OAAOiS,EAAE+S,IAAI,EAAEnM,EAAE5G,GAAG,CAAC,IAAI9D,EAAE,GAAG0K,EAAE,GAAG,EAAET,EAAErJ,EAAEZ,GAAGqF,EAAErF,EAAE,EAAEjP,EAAE6P,EAAEyE,GAAG,GAAG,EAAEyR,EAAE7M,EAAE9H,GAAGkD,EAAEwR,GAAG,EAAEC,EAAE/lB,EAAEkZ,IAAIrJ,EAAE8J,GAAG3Z,EAAE6P,EAAEyE,GAAGlD,EAAEuI,EAAErF,IAAIzE,EAAE8J,GAAGT,EAAErJ,EAAEZ,GAAGmC,EAAEuI,EAAE1K,OAAQ,MAAGqF,EAAEwR,GAAG,EAAEC,EAAE/lB,EAAEoR,IAA0B,MAAMvB,EAA7BA,EAAE8J,GAAG3Z,EAAE6P,EAAEyE,GAAGlD,EAAEuI,EAAErF,CAAc,EAAC,CAAC,OAAOxE,CAAC,CAC3c,SAASiW,EAAElW,EAAEC,GAAG,IAAIsB,EAAEvB,EAAEg/C,UAAU/+C,EAAE++C,UAAU,OAAO,IAAIz9C,EAAEA,EAAEvB,EAAE4pB,GAAG3pB,EAAE2pB,EAAE,CAAC,GAAG,kBAAkBq1B,aAAa,oBAAoBA,YAAYnzB,IAAI,CAAC,IAAI7S,EAAEgmC,YAAY9vD,EAAQu1B,aAAa,WAAW,OAAOzL,EAAE6S,KAAK,CAAC,KAAK,CAAC,IAAIxX,EAAEuX,KAAKoX,EAAE3uB,EAAEwX,MAAM38B,EAAQu1B,aAAa,WAAW,OAAOpQ,EAAEwX,MAAMmX,CAAC,CAAC,CAAC,IAAI5hC,EAAE,GAAGC,EAAE,GAAGkD,EAAE,EAAE1T,EAAE,KAAK2N,EAAE,EAAEnN,GAAE,EAAG2X,GAAE,EAAGG,GAAE,EAAG4vB,EAAE,oBAAoBkC,WAAWA,WAAW,KAAKuB,EAAE,oBAAoBrB,aAAaA,aAAa,KAAK1B,EAAE,qBAAqBwlB,aAAaA,aAAa,KACnT,SAASxiB,EAAE18B,GAAG,IAAI,IAAIC,EAAEiZ,EAAE5X,GAAG,OAAOrB,GAAG,CAAC,GAAG,OAAOA,EAAE0iC,SAASvhC,EAAEE,OAAQ,MAAGrB,EAAEk/C,WAAWn/C,GAAgD,MAA9CoB,EAAEE,GAAGrB,EAAE++C,UAAU/+C,EAAEm/C,eAAe3vD,EAAE4R,EAAEpB,EAAa,CAACA,EAAEiZ,EAAE5X,EAAE,CAAC,CAAC,SAASs7B,EAAE58B,GAAa,GAAVoJ,GAAE,EAAGszB,EAAE18B,IAAOiJ,EAAE,GAAG,OAAOiQ,EAAE7X,GAAG4H,GAAE,EAAG+1B,EAAEvF,OAAO,CAAC,IAAIx5B,EAAEiZ,EAAE5X,GAAG,OAAOrB,GAAG4iC,EAAEjG,EAAE38B,EAAEk/C,UAAUn/C,EAAE,CAAC,CACra,SAASy5B,EAAEz5B,EAAEC,GAAGgJ,GAAE,EAAGG,IAAIA,GAAE,EAAGqzB,EAAEnzB,GAAGA,GAAG,GAAGhY,GAAE,EAAG,IAAIiQ,EAAE9C,EAAE,IAAS,IAALi+B,EAAEz8B,GAAOnP,EAAEooB,EAAE7X,GAAG,OAAOvQ,MAAMA,EAAEsuD,eAAen/C,IAAID,IAAIkL,MAAM,CAAC,IAAIpB,EAAEhZ,EAAE6xC,SAAS,GAAG,oBAAoB74B,EAAE,CAAChZ,EAAE6xC,SAAS,KAAKlkC,EAAE3N,EAAEuuD,cAAc,IAAIppC,EAAEnM,EAAEhZ,EAAEsuD,gBAAgBn/C,GAAGA,EAAE9Q,EAAQu1B,eAAe,oBAAoBzO,EAAEnlB,EAAE6xC,SAAS1sB,EAAEnlB,IAAIooB,EAAE7X,IAAID,EAAEC,GAAGq7B,EAAEz8B,EAAE,MAAMmB,EAAEC,GAAGvQ,EAAEooB,EAAE7X,EAAE,CAAC,GAAG,OAAOvQ,EAAE,IAAIoS,GAAE,MAAO,CAAC,IAAI9D,EAAE8Z,EAAE5X,GAAG,OAAOlC,GAAGyjC,EAAEjG,EAAEx9B,EAAE+/C,UAAUl/C,GAAGiD,GAAE,CAAE,CAAC,OAAOA,CAAC,CAAC,QAAQpS,EAAE,KAAK2N,EAAE8C,EAAEjQ,GAAE,CAAE,CAAC,CAD1a,qBAAqBguD,gBAAW,IAASA,UAAUC,iBAAY,IAASD,UAAUC,WAAWC,gBAAgBF,UAAUC,WAAWC,eAAelmB,KAAKgmB,UAAUC,YAC2Q,IACzP1O,EAD6P96C,GAAE,EAAGmxC,EAAE,KAAK59B,GAAG,EAAE69B,EAAE,EAAEK,GAAG,EACvc,SAASt8B,IAAI,QAAO/b,EAAQu1B,eAAe8iB,EAAEL,EAAO,CAAC,SAASnkC,IAAI,GAAG,OAAOkkC,EAAE,CAAC,IAAIlnC,EAAE7Q,EAAQu1B,eAAe8iB,EAAExnC,EAAE,IAAIC,GAAE,EAAG,IAAIA,EAAEinC,GAAE,EAAGlnC,EAAE,CAAC,QAAQC,EAAE4wC,KAAK96C,GAAE,EAAGmxC,EAAE,KAAK,CAAC,MAAMnxC,GAAE,CAAE,CAAO,GAAG,oBAAoB2jC,EAAEmX,EAAE,WAAWnX,EAAE12B,EAAE,OAAO,GAAG,qBAAqBy8C,eAAe,CAAC,IAAIhO,EAAE,IAAIgO,eAAe3N,EAAEL,EAAEiO,MAAMjO,EAAEkO,MAAMC,UAAU58C,EAAE6tC,EAAE,WAAWiB,EAAE+N,YAAY,KAAK,CAAC,MAAMhP,EAAE,WAAW7X,EAAEh2B,EAAE,EAAE,EAAE,SAASg8B,EAAEh/B,GAAGknC,EAAElnC,EAAEjK,IAAIA,GAAE,EAAG86C,IAAI,CAAC,SAAShO,EAAE7iC,EAAEC,GAAGqJ,EAAE0vB,GAAE,WAAWh5B,EAAE7Q,EAAQu1B,eAAe,GAAEzkB,EAAE,CAC5d9Q,EAAQm2B,sBAAsB,EAAEn2B,EAAQ21B,2BAA2B,EAAE31B,EAAQi2B,qBAAqB,EAAEj2B,EAAQ+1B,wBAAwB,EAAE/1B,EAAQ2wD,mBAAmB,KAAK3wD,EAAQ61B,8BAA8B,EAAE71B,EAAQk1B,wBAAwB,SAASrkB,GAAGA,EAAE2iC,SAAS,IAAI,EAAExzC,EAAQ4wD,2BAA2B,WAAW92C,GAAG3X,IAAI2X,GAAE,EAAG+1B,EAAEvF,GAAG,EAC1UtqC,EAAQ6wD,wBAAwB,SAAShgD,GAAG,EAAEA,GAAG,IAAIA,EAAEusC,QAAQ34B,MAAM,mHAAmHuzB,EAAE,EAAEnnC,EAAEI,KAAKrN,MAAM,IAAIiN,GAAG,CAAC,EAAE7Q,EAAQy1B,iCAAiC,WAAW,OAAOnmB,CAAC,EAAEtP,EAAQ8wD,8BAA8B,WAAW,OAAO/mC,EAAE7X,EAAE,EAAElS,EAAQ+wD,cAAc,SAASlgD,GAAG,OAAOvB,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAIwB,EAAE,EAAE,MAAM,QAAQA,EAAExB,EAAE,IAAI8C,EAAE9C,EAAEA,EAAEwB,EAAE,IAAI,OAAOD,GAAG,CAAC,QAAQvB,EAAE8C,CAAC,CAAC,EAAEpS,EAAQgxD,wBAAwB,WAAW,EAC9fhxD,EAAQs1B,sBAAsB,WAAW,EAAEt1B,EAAQixD,yBAAyB,SAASpgD,EAAEC,GAAG,OAAOD,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,QAAQA,EAAE,EAAE,IAAIuB,EAAE9C,EAAEA,EAAEuB,EAAE,IAAI,OAAOC,GAAG,CAAC,QAAQxB,EAAE8C,CAAC,CAAC,EAChMpS,EAAQg1B,0BAA0B,SAASnkB,EAAEC,EAAEsB,GAAG,IAAIuI,EAAE3a,EAAQu1B,eAA8F,OAA/E,kBAAkBnjB,GAAG,OAAOA,EAAaA,EAAE,kBAAZA,EAAEA,EAAE8+C,QAA6B,EAAE9+C,EAAEuI,EAAEvI,EAAEuI,EAAGvI,EAAEuI,EAAS9J,GAAG,KAAK,EAAE,IAAIiW,GAAG,EAAE,MAAM,KAAK,EAAEA,EAAE,IAAI,MAAM,KAAK,EAAEA,EAAE,WAAW,MAAM,KAAK,EAAEA,EAAE,IAAI,MAAM,QAAQA,EAAE,IAAmN,OAAzMjW,EAAE,CAAC4pB,GAAGplB,IAAIm+B,SAAS1iC,EAAEo/C,cAAcr/C,EAAEm/C,UAAU59C,EAAE69C,eAAvDnpC,EAAE1U,EAAE0U,EAAoE+oC,WAAW,GAAGz9C,EAAEuI,GAAG9J,EAAEg/C,UAAUz9C,EAAE9R,EAAE6R,EAAEtB,GAAG,OAAOkZ,EAAE7X,IAAIrB,IAAIkZ,EAAE5X,KAAK8H,GAAGqzB,EAAEnzB,GAAGA,GAAG,GAAGF,GAAE,EAAGy5B,EAAEjG,EAAEr7B,EAAEuI,MAAM9J,EAAEg/C,UAAU/oC,EAAExmB,EAAE4R,EAAErB,GAAGiJ,GAAG3X,IAAI2X,GAAE,EAAG+1B,EAAEvF,KAAYz5B,CAAC,EACne7Q,EAAQo1B,qBAAqBrZ,EAAE/b,EAAQmxD,sBAAsB,SAAStgD,GAAG,IAAIC,EAAExB,EAAE,OAAO,WAAW,IAAI8C,EAAE9C,EAAEA,EAAEwB,EAAE,IAAI,OAAOD,EAAEsR,MAAMvd,KAAKD,UAAU,CAAC,QAAQ2K,EAAE8C,CAAC,CAAC,CAAC,kBCf7JrS,EAAOC,QAAU,EAAjBD,2pBCFEqxD,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBE,IAAjBD,EACH,OAAOA,EAAavxD,QAGrB,IAAID,EAASqxD,EAAyBE,GAAY,CAGjDtxD,QAAS,CAAC,GAOX,OAHAyxD,EAAoBH,GAAUvxD,EAAQA,EAAOC,QAASqxD,GAG/CtxD,EAAOC,OACf,CCrBAqxD,EAAoB/7C,EAAKvV,IACxB,IAAIa,EAASb,GAAUA,EAAO2xD,WAC7B,IAAO3xD,EAAiB,QACxB,IAAM,EAEP,OADAsxD,EAAoB12C,EAAE/Z,EAAQ,CAAEiQ,EAAGjQ,IAC5BA,CAAM,ECLdywD,EAAoB12C,EAAI,CAAC3a,EAAS2xD,KACjC,IAAI,IAAIjjD,KAAOijD,EACXN,EAAoBO,EAAED,EAAYjjD,KAAS2iD,EAAoBO,EAAE5xD,EAAS0O,IAC5EzD,OAAOmF,eAAepQ,EAAS0O,EAAK,CAAEuc,YAAY,EAAM7qB,IAAKuxD,EAAWjjD,IAE1E,ECND2iD,EAAoBO,EAAI,CAACnjD,EAAK6T,IAAUrX,OAAO7F,UAAU8F,eAAexI,KAAK+L,EAAK6T,uECM3E,MAAMuvC,EAAe72C,IAAAA,IAAc,EAEnC,MAAM82C,EAIX3wD,WAAAA,CAAYkY,GAAa,KAHjB04C,QAAE,OACFC,QAAE,EAGRptD,KAAKmtD,GAAK/2C,IAAAA,QAAgB,CAAE3B,SAC5BzU,KAAKotD,GAAK55C,IAAAA,QAAa,CAAEgB,MAAOxU,KAAKmtD,GAAG34C,MAAOD,MAAM,GACvD,CAEA84C,MAAAA,CAAOA,GACL,OAAOrtD,KAAKmtD,KAAOE,EAASJ,CAC9B,CAEAK,OAAAA,CAAOC,GAAgC,IAA/B,IAAE1rB,EAAM,EAAC,IAAEzyB,EAAM,GAAGm+C,EAC1B,OAAO1rB,EAAO7hC,KAAKmtD,MAAQ/9C,EAAMyyB,GAAQorB,CAC3C,CAEAz5C,IAAAA,CAAIg6C,GAUQ,IAVP,EACHvhD,EAAC,EACDC,EAAC,IACD21B,EAAM,EAAC,IACPzyB,EAAM,GAMPo+C,EACC,OAAO3rB,EAAM7hC,KAAKotD,GAAGnhD,EAAGC,IAAMkD,EAAMyyB,EACtC,CAEA4rB,UAAAA,CAAWltD,GACT,OAAO8L,KAAKrN,MAAMgB,KAAKstD,QAAQ/sD,GACjC,CAEAmtD,OAAAA,CAAQntD,GACN,OAAO8L,KAAKrN,MAAMgB,KAAKwT,KAAKjT,GAC9B,CAEAotD,aAAAA,CAAiBC,GACf,OAAOA,EAAQ5tD,KAAKytD,WAAW,CAAEr+C,IAAKw+C,EAAQ1wD,SAChD,CAEA2wD,UAAAA,CAAcD,EAAqBE,GAA0C,IAAxC,EAAE7hD,EAAC,EAAEC,GAA6B4hD,EACrE,OAAOF,EAAQ5tD,KAAK0tD,QAAQ,CAAEzhD,EAAGA,EAAGC,EAAGA,EAAGkD,IAAKw+C,EAAQ1wD,SACzD,CAEA6wD,cAAAA,CAAkBC,GAChB,MAAM9hD,EAAI8hD,EAAKC,QAAQC,GAAQA,EAAIA,IAAM,IACnCC,EAAcjiD,EAAEkiD,QAAO,CAACrsD,EAAKmsD,IAAQnsD,EAAMmsD,EAAIA,KAAK,GAC1D,IAAIG,EAAcruD,KAAKstD,QAAQ,CAAEl+C,IAAK++C,IAEtC,IAAK,MAAM,IAAED,EAAG,KAAEI,KAAUpiD,EAE1B,GADAmiD,GAAeH,EACXG,GAAe,EACjB,OAAOC,EAGX,OAAOpiD,EAAEA,EAAEhP,OAAS,GAAGoxD,IACzB,CAEAC,OAAAA,CAAWX,GACT,MAAMtgD,EAAS,GACf,IAAK,IAAItQ,EAAI,EAAGA,EAAI4wD,EAAQ1wD,OAAQF,IAAK,CACvC,MAAMC,EAAIoP,KAAKrN,MAAOgB,KAAKmtD,KAAOnwD,EAAKiwD,GACnCjwD,IAAMC,IACRqQ,EAAEtQ,GAAKsQ,EAAErQ,IAEXqQ,EAAErQ,GAAK2wD,EAAQ5wD,EACjB,CACA,OAAOsQ,CACT,EAGF,IAOKkhD,EAAG,SAAHA,GAAG,OAAHA,EAAAA,EAAG,eAAHA,EAAAA,EAAG,yBAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,yBAAHA,EAAAA,EAAG,iCAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,yCAAHA,EAAAA,EAAG,oCAAHA,EAAAA,EAAG,kCAAHA,EAAAA,EAAG,wBAAHA,EAAAA,EAAG,sCAAHA,EAAAA,EAAG,gCAAHA,EAAAA,EAAG,kCAAHA,EAAAA,EAAG,gBAAHA,EAAAA,EAAG,kCAAHA,EAAAA,EAAG,oBAAHA,EAAAA,EAAG,4CAAHA,EAAAA,EAAG,kBAAHA,EAAAA,EAAG,oBAAHA,EAAAA,EAAG,oCAAHA,EAAAA,EAAG,sCAAHA,CAAG,EAAHA,GAAG,IAkCD,MAAMC,EAOXlyD,WAAAA,CAAYkY,GAAa,KANzBA,UAAI,OACIi6C,WAAK,OAmDbC,cAAiB94B,GAAe71B,KAAKsU,KAAKk6C,EAAIG,cAAe94B,GAAI,KACjE+4B,MAAS/4B,GAAe71B,KAAKsU,KAAKk6C,EAAII,MAAO/4B,GAAI,KACjDg5B,MAASh5B,GAAe71B,KAAKsU,KAAKk6C,EAAIK,MAAOh5B,GAAI,KACjDi5B,MAASj5B,GAAe71B,KAAKsU,KAAKk6C,EAAIM,MAAOj5B,GAAI,KAMjDk5B,kBAAqBl5B,GAAe71B,KAAKsU,KAAKk6C,EAAIO,kBAAmBl5B,GAAI,KACzEm5B,eAAkBn5B,GAAe71B,KAAKsU,KAAKk6C,EAAIQ,eAAgBn5B,GAAI,KACnEo5B,cAAiBp5B,GAAe71B,KAAKsU,KAAKk6C,EAAIS,cAAep5B,GAAI,KACjEq5B,SAAYr5B,GAAe71B,KAAKsU,KAAKk6C,EAAIU,SAAUr5B,GAAI,KACvDs5B,eAAkBt5B,GAAe71B,KAAKsU,KAAKk6C,EAAIW,eAAgBt5B,GAAI,KAEnEu5B,gBAAmBv5B,GAAe71B,KAAKsU,KAAKk6C,EAAIY,gBAAiBv5B,GAAI,KACrEw5B,aAAgBx5B,GAAe71B,KAAKsU,KAAKk6C,EAAIa,aAAcx5B,GAAI,KAC/Dy5B,cAAiBz5B,GAAe71B,KAAKsU,KAAKk6C,EAAIc,cAAez5B,GAAI,KAEjE05B,KAAQ15B,GAAe71B,KAAKsU,KAAKk6C,EAAIe,KAAM15B,GAAI,KAU/C25B,OAAU35B,GAAe71B,KAAKsU,KAAKk6C,EAAIgB,OAAQ35B,GAAI,KACnD45B,mBAAsB55B,GAAe71B,KAAKsU,KAAKk6C,EAAIiB,mBAAoB55B,GAAI,KAC3E65B,gBAAmB75B,GAAe71B,KAAKsU,KAAKk6C,EAAIkB,gBAAiB75B,GA5E/D71B,KAAKyU,KAAOA,EAEC,IAATA,IACFA,EAAO,MAET,MAAM04C,EAAK/2C,IAAAA,QAAgB,CAAE3B,SACvBk7C,EAActpD,OAAOyM,KAAK07C,GAAKtxD,OAC/BwxD,EAAmC,GACzC,IAAK,IAAI1xD,EAAI,EAAGA,EAAI2yD,EAAa3yD,IAC/B0xD,EAAM1xD,GAAK,CAAEyX,KAAM04C,IAAMyC,KAAM,IAEjC5vD,KAAK0uD,MAAQA,CACf,CAEQp6C,IAAAA,CAAKu7C,EAAUztD,GACrB,MAAM0tD,EAAM9vD,KAAK0uD,MAAMmB,GACvB,IAAIviD,EAAIwiD,EAAIF,KAAKxtD,GACjB,IAAKkL,EAAG,CACN,MAAMmH,GAAQq7C,EAAIr7C,KAAgB,KAATrS,EAAgB6qD,GAAgBA,EACzD3/C,EAAI,IAAI4/C,EAAmBz4C,GAC3Bq7C,EAAIF,KAAKxtD,GAAUkL,CACrB,CACA,OAAOA,CACT,CAEAyiD,IAAAA,CAAKl6B,GACH,OAAO71B,KAAKsU,KAAKk6C,EAAIuB,KAAMl6B,EAC7B,CAEA,aAAIm6B,GACF,OAAOhwD,KAAKsU,KAAKk6C,EAAIwB,UAAW,EAClC,CAEA,SAAIC,GACF,OAAOjwD,KAAKsU,KAAKk6C,EAAIyB,MAAO,EAC9B,CAEA,SAAIC,GACF,OAAOlwD,KAAKsU,KAAKk6C,EAAI0B,MAAO,EAC9B,CAEA,aAAIC,GACF,OAAOnwD,KAAKsU,KAAKk6C,EAAI2B,UAAW,EAClC,CAOA,SAAIC,GACF,OAAOpwD,KAAKsU,KAAKk6C,EAAI4B,MAAO,EAC9B,CAcA,UAAIn0B,GACF,OAAOj8B,KAAKsU,KAAKk6C,EAAIvyB,OAAQ,EAC/B,CAEA,iBAAIo0B,GACF,OAAOrwD,KAAKsU,KAAKk6C,EAAI6B,cAAe,EACtC,ECvMF,IAiQK7B,EAAG,SAAHA,GAAG,OAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,2BAAHA,EAAAA,EAAG,6BAAHA,EAAAA,EAAG,iBAAHA,EAAAA,EAAG,yCAAHA,EAAAA,EAAG,uBAAHA,EAAAA,EAAG,6BAAHA,CAAG,EAAHA,GAAG,IAUR,MAAM8B,EAAoB,CACxBC,uBAAwB,EACxBC,wBAAyB,IACzBC,UAAW,GACXC,0BAA2B,EAC3BC,yBAA0B,EAC1BC,sBAAuBvkD,KAAKwkD,GAAK,EACjCC,gBAAiB,IACjBC,gBAAiB,IACjBC,oBAAqB,CAAEh2C,KAAM,IAAMi2C,KAAM,IAAM9lC,MAAO,KACtD+lC,oBAAqB,CAAEl2C,KAAM,IAAMi2C,KAAM,EAAG9lC,MAAO,GACnDgmC,gBAAiB,CAAEn2C,KAAM,KAAMi2C,MAAO,IAAM9lC,OAAQ,KACpDimC,gBAAiB,CAAEp2C,KAAM,IAAMi2C,KAAM,EAAG9lC,MAAO,GAC/CkmC,iBAAkB,CAAEr2C,KAAM,GAAKi2C,KAAM,IAAM9lC,MAAO,IAClDmmC,gBAAiB,CAAEt2C,KAAM,KAAMi2C,KAAM,EAAK9lC,MAAO,GACjDomC,WAAY,CAAC,EACbC,oBAAqB,IACrBC,oBAAqB,IACrBC,gBAAiB,IACjBC,gBAAiB,IACjBC,sBAAuB,EACvBC,cAAe,EACfC,cAAe,EACfC,wBAAyB,GACzBC,wBAAyB,GACzBC,2BAA4B,CAAEpwB,IAAK,GAAIzyB,IAAK,KAC5C8iD,2BAA4B,CAAErwB,IAAK,GAAIzyB,IAAK,KAC5C+iD,gBAAiB,EACjBC,iBAAkB,IAGdC,EAAqB,CACzBC,KAAM,CACJC,0BAA2B,IAC3BC,0BAA2B,IAC3BC,sBAAuB,IACvBC,aAAc,GACdC,aAAc,GACdC,aAAc,IACdC,eAAgB,KAElBC,IAAK,CACHP,0BAA2B,IAC3BC,0BAA2B,IAC3BC,sBAAuB,EACvBC,aAAc,GACdC,aAAc,GACdC,aAAc,GACdC,eAAgB,KAElBE,KAAM,CACJR,0BAA2B,GAC3BC,0BAA2B,IAC3BC,sBAAuB,IACvBC,aAAc,GACdC,aAAc,GACdC,aAAc,IACdC,eAAgB,MAIpB,SAASG,EAAmBC,EAAeC,GACzC,MAAMC,EAAMF,EAAKlD,KAAKvB,EAAI0B,OACpBkD,EAAaD,EAAIzF,QAAQ,CAC7BzhD,EAAG,IACHC,EAAG,OACA,CACDomD,KAAM,CAAEzwB,IAAK,EAAGzyB,IAAK,GACrB0jD,IAAK,CAAEjxB,IAAK,EAAGzyB,IAAK,IACpB2jD,KAAM,CAAElxB,IAAK,EAAGzyB,IAAK,IACrB8jD,KAEEG,EACJD,EAAa,EAAID,EAAI1F,WAAW,CAAE5rB,IAAK,EAAGzyB,IAAKgkD,EAAa,IAAO,EAC/DE,EAAYH,EAAIzF,QAAQ,CAC5BzhD,EAAG,IACHC,EAAG,OACA,CACDomD,KAAM,CAAEzwB,IAAK,EAAGzyB,IAAK,GACrB0jD,IAAK,CAAEjxB,IAAK,EAAGzyB,IAAK,GACpB2jD,KAAM,CAAElxB,IAAK,EAAGzyB,IAAK,KACrB8jD,KAgBJ,MAAO,CAAEE,aAAYC,aAAYC,YAAWC,UAb1CD,EAAY,EACRH,EAAI1F,WAAW,CAAE5rB,IAAK,EAAGzyB,IAAK/C,KAAKw1B,IAAIyxB,EAAY,EAAG,KACtD,EAWiDE,aATrDF,EAAY,EACRH,EAAIzF,QACF,CACE4E,KAAM,CAAErmD,EAAG,GAAKC,EAAG,IAAK21B,IAAK,EAAGzyB,IAAK,GACrC0jD,IAAK,CAAE7mD,EAAG,GAAKC,EAAG,IAAK21B,IAAK,EAAGzyB,IAAK,GACpC2jD,KAAM,CAAE9mD,EAAG,IAAKC,EAAG,IAAK21B,IAAK,EAAGzyB,IAAK,KACrC8jD,IAEJ,EAER,CAEO,SAASO,EACdlzD,GAEA,MAAM0yD,EAAO,IAAIxE,EAAQluD,EAAKkU,MACxBnH,EAAI,CACR4lD,MAAOD,EACJlD,KAAKvB,EAAI0E,OACTvF,cAAc,CAAC,OAAQ,MAAO,SACjC+F,YAAaT,EAAKlD,KAAKvB,EAAIkF,aAAarG,OAAO,KAC/CsG,WAAYV,EAAKlD,KAAKvB,EAAImF,YAAYlG,WAAW,CAAE5rB,IAAK,GAAIzyB,IAAK,QAC9D7O,GAECqzD,EAAcX,EAAKlD,KAAKvB,EAAIoF,aAAavG,OAAO,KAChDwG,EAAWZ,EAAKlD,KAAKvB,EAAIqF,UAAUxG,OACvC,CACEiF,KAAM,IACNQ,IAAK,IACLC,KAAM,KACNzlD,EAAE4lD,QAEAY,EAAoBb,EAAKlD,KAAKvB,EAAIsF,mBAAmBpG,QACzD,CACE4E,KAAM,CAAErmD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,IAAKzyB,IAAK,KACnC0jD,IAAK,CAAE7mD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,IAAKzyB,IAAK,KAClC2jD,KAAM,CAAE9mD,EAAG,EAAGC,EAAG,IAAK21B,IAAK,IAAKzyB,IAAK,MACrC9B,EAAE4lD,QAEN,MAAO,IACF5C,KACA+B,EAAmB/kD,EAAE4lD,UACrBF,EAAmBC,EAAM3lD,EAAE4lD,OAC9BU,cACAC,WACAC,uBACGxmD,EACHymD,UAAW1tD,OAAOyM,KAAKvS,GACpB0tD,QAAQ5gD,GAAY,SAANA,IACd2mD,OAEP,CCzZA,SAAgB,aAAe,4BAA4B,QAAU,uBAAuB,WAAa,0BAA0B,SAAW,wBAAwB,KAAO,oBAAoB,SAAW,wBAAwB,UAAY,yBAAyB,SAAW,wBAAwB,KAAO,oBAAoB,aAAe,4BAA4B,MAAQ,sBCQ7WC,EAAS,CAAC,EAAG,GACbC,EAAQ,CAAC,GAAI,GACbC,EAAa,CAAC,GAAI,GAClBC,EAAO,CAAC,EAAG,GACXC,EAAa,CAAC,EAAG,GACjBC,EAAQ,CAAC,EAAG,GACZC,EAAa,EAAE,EAAG,GAClBC,EAAO,EAAE,EAAG,GACZC,EAAa,EAAE,GAAI,GAEnBC,EAAO,CAACR,EAAOI,EAAOF,EAAMI,GAC5BG,EAAa,CACxBT,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAcK,SAASG,EAAQrH,EAAAC,GAAyC,IAAvCpxD,EAAGsO,GAAS6iD,GAAGpiD,EAAIC,GAAUoiD,EACrD,MAAO,CAACpxD,EAAI+O,EAAIT,EAAIU,EACtB,CAEO,SAAUypD,EAAS5oD,EAAUC,GAClC,IAAI9P,EAAIiQ,KAAKrN,MAAMiN,EAAE,IACjBvB,EAAI2B,KAAKrN,MAAMiN,EAAE,IACrB,MAAM6oD,EAAQzoD,KAAKrN,MAAMkN,EAAE,IACrB6oD,EAAQ1oD,KAAKrN,MAAMkN,EAAE,IAErB8oD,EAAK3oD,KAAKC,IAAIwoD,EAAQ14D,GACtBuV,EAAKmjD,EAAQ14D,EAAI,GAAK,EACtB64D,GAAM5oD,KAAKC,IAAIyoD,EAAQrqD,GACvBkH,EAAKmjD,EAAQrqD,EAAI,GAAK,EAE5B,IAAImV,EAAQm1C,EAAKC,EAEjB,UACQ,CAAC74D,EAAGsO,GAENtO,IAAM04D,GAASpqD,IAAMqqD,GAHd,CAOX,MAAMG,EAAK,EAAIr1C,EACTs1C,EAAQD,GAAMD,EACdG,EAAQF,GAAMF,EAEpB,GAAIG,EAAO,CACT,GAAI/4D,IAAM04D,EACR,MAEFj1C,GAASo1C,EACT74D,GAAKuV,CACP,CAEA,GAAIyjD,EAAO,CAIT,GAHID,SACI,CAAC/4D,EAAGsO,IAERA,IAAMqqD,EACR,MAEFl1C,GAASm1C,EACTtqD,GAAKkH,CACP,CACF,CACF,CAEO,SAASyjD,EAAcC,GAC5B,OAAiB,IAAPA,EAAcjpD,KAAKwkD,GAAK,KAAO,IAAO,GAClD,CAEO,SAAS0E,EAAYzH,GAAwB,IAAtB1xD,EAAGsO,GAASojD,EACxC,MAAO,EAAE1xD,GAAIsO,EACf,CAEO,SAAS8qD,EAAUC,GAAwB,IAAtBr5D,EAAGsO,GAAS+qD,EACtC,MAAO,CAAC/qD,GAAItO,EACd,CAEO,SAASs5D,EAAWC,GAAwB,IAAtBv5D,EAAGsO,GAASirD,EACvC,MAAO,EAAEjrD,EAAGtO,EACd,cC3FO,MAAMw5D,EAASrI,IAAA,IAAgC,GACpDroB,EAAE,QACF0oB,EAAO,OACPiI,EAAM,QACNtoB,EAAO,oBACPuoB,GAIYvI,EAAA,OACZwI,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAIgd,KACJ+wB,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOC,SAASluC,SAC7B0lC,EAAQpE,KAAK6M,IACZ,MAAMC,EAAU,CAACH,EAAOE,QAClBxuC,EAAW0lB,EAAQrI,KAAQmxB,EAC7BxuC,GACFyuC,EAAQ54D,KAAKy4D,EAAOI,UAEtB,MAAMC,GAA4B,OAAnBV,QAAmB,IAAnBA,OAAmB,EAAnBA,EAAsB5wB,MAAQmxB,EAG7C,OAFAC,EAAQ54D,KAAK84D,EAASL,EAAOK,OAASL,EAAOM,WAG3CR,EAAAA,EAAAA,KAAA,UAEEC,UAAWI,EAAQ30D,KAAK,KACxBy7C,QAASA,KACPyY,EAAO,CAAE,CAAC3wB,GAAKrd,OAAW+kC,EAAYyJ,GAAS,EAC/CnuC,SAAA,GAAA0c,OAEEyxB,IAAM,GAAAzxB,OANFyxB,GAOD,QAId,EAGQK,EAAelJ,IAaR,IAADmJ,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,IAbU,GAC3B9xB,EAAE,IACFrD,EAAG,IACHzyB,EAAG,KACH6nD,EAAI,OACJpB,EAAM,QACNtoB,EAAO,oBACPuoB,GAMYtI,EAOZ,OACEuI,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CAAIgd,EAAG,QACP6wB,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CACsB,OAAnB4tC,QAAmB,IAAnBA,GAAyB,QAANa,EAAnBb,EAAsB5wB,UAAG,IAAAyxB,GAAM,QAANC,EAAzBD,EAA2B37C,YAAI,IAAA47C,OAAZ,EAAnBA,EAAiCj8C,QAAQ,GAAG,IAAE,IAC3B,OAAnBm7C,QAAmB,IAAnBA,GAAyB,QAANe,EAAnBf,EAAsB5wB,UAAG,IAAA2xB,GAAM,QAANC,EAAzBD,EAA2B5F,YAAI,IAAA6F,OAAZ,EAAnBA,EAAiCn8C,QAAQ,GAAG,IAAE,IAC3B,OAAnBm7C,QAAmB,IAAnBA,GAAyB,QAANiB,EAAnBjB,EAAsB5wB,UAAG,IAAA6xB,GAAO,QAAPC,EAAzBD,EAA2B5rC,aAAK,IAAA6rC,OAAb,EAAnBA,EAAkCr8C,QAAQ,OAE7Co7C,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOC,SAASluC,SAAA,EAC9B+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOe,MAAMhvC,SACzB,CAAC,OAAQ,OAAQ,SAAmBshC,KAAK1/C,IAAS,IAADqtD,EAAAC,EACjD,MAAMv7D,EAAwC,QAAnCs7D,EAAsB,OAAnBrB,QAAmB,IAAnBA,GAAyB,QAANsB,EAAnBtB,EAAsB5wB,UAAG,IAAAkyB,OAAN,EAAnBA,EAA4BttD,UAAI,IAAAqtD,EAAAA,EAAIt1B,EAClD,OACEo0B,EAAAA,EAAAA,KAAA,SAEEC,UAAWC,EAAOkB,OAClBl2C,KAAK,QACL0gB,IAAKA,EACLzyB,IAAKA,EACL6nD,KAAMA,EACNp7D,MAAOA,EACPuwB,MACE,CACE,eAAe,GAADwY,OAAM,KAAO/oC,EAAQgmC,IAASzyB,EAAMyyB,GAAI,MAG1Dy1B,SAAWC,GAhCzB,SAAqBztD,EAAgCjO,GACnDg6D,EAAO,CACL,CAAC3wB,GAAK,IAAwB,OAAnB4wB,QAAmB,IAAnBA,OAAmB,EAAnBA,EAAsB5wB,MAAe,OAAPqI,QAAO,IAAPA,OAAO,EAAPA,EAAUrI,GAAK,CAACp7B,GAAMjO,IAEnE,CA4BgC27D,CAAY1tD,EAAKytD,EAAG72D,OAAO+2D,gBAZxC3tD,EAaL,MAIPo7B,KAAMqI,GACL0oB,EAAAA,EAAAA,KAAA,UACEC,UAAS,GAAAtxB,OAAKuxB,EAAOuB,KAAI,KAAA9yB,OAAIuxB,EAAOI,UACpCnZ,QAASA,IAAMyY,EAAO,CAAE,CAAC3wB,QAAK0nB,IAAa1kC,SAC5C,UAID+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAS,GAAAtxB,OAAKuxB,EAAOuB,KAAI,KAAA9yB,OAAIuxB,EAAOwB,kBAG5C,EAIMC,EAAS9J,IAiBF,IAAD2H,EAAAoC,EAAA,IAjBI,GACrB3yB,EAAE,IACFrD,EAAG,IACHzyB,EAAG,QACH0oD,EAAO,MACPC,EAAK,KACLd,EAAI,OACJpB,EAAM,QACNtoB,EAAO,oBACPuoB,GAQYhI,EACZ,MAAMjyD,EAAgD,QAA3C45D,EAAc,QAAdoC,EAAGtqB,EAAQrI,UAAG,IAAA2yB,EAAAA,EAAuB,OAAnB/B,QAAmB,IAAnBA,OAAmB,EAAnBA,EAAsB5wB,UAAG,IAAAuwB,EAAAA,EAAI5zB,EAC1D,OACEk0B,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CACGgd,EAAG,IAAE,IACL4yB,GACC/B,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EAAY,IAARrsB,GAAa8e,UAAU,OACzBo9C,GACFhC,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,CAAGmtC,EAAcx5D,GAAO8e,UAAU,UAElC9e,MAGJk6D,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOC,SAASluC,SAAA,EAC9B+tC,EAAAA,EAAAA,KAAA,SACEC,UAAWC,EAAOkB,OAClBl2C,KAAK,QACL0gB,IAAKA,EACLzyB,IAAKA,EACL6nD,KAAMA,IAASa,EAAU,IAAOC,EAAQ1rD,KAAKwkD,GAAK,GAAK,GACvDh1D,MAAOA,EACPuwB,MACE,CACE,eAAe,GAADwY,OAAM,KAAO/oC,EAAQgmC,IAASzyB,EAAMyyB,GAAI,MAG1Dy1B,SAAWC,GAAO1B,EAAO,CAAE,CAAC3wB,GAAKqyB,EAAG72D,OAAO+2D,uBAE5B7K,IAAhBrf,EAAQrI,IACP+wB,EAAAA,EAAAA,KAAA,OAAKC,UAAS,GAAAtxB,OAAKuxB,EAAOuB,KAAI,KAAA9yB,OAAIuxB,EAAOwB,cAEzC1B,EAAAA,EAAAA,KAAA,UACEC,UAAS,GAAAtxB,OAAKuxB,EAAOuB,KAAI,KAAA9yB,OAAIuxB,EAAOI,UACpCnZ,QAASA,IAAMyY,EAAO,CAAE,CAAC3wB,QAAK0nB,IAAa1kC,SAC5C,cAKJ,EC/KM8vC,EAAU,sBACVC,EAAW,UACXC,GAAkB,EAAI,EAAIF,GAAWA,EAG3C,SAASG,EAAIC,EAAMl2C,EAAGm2C,EAAM38D,EAAGypB,GAClC,IAAIsuB,EAAG6kB,EAAMnpB,EAAIopB,EACbC,EAAOt2C,EAAE,GACTu2C,EAAO/8D,EAAE,GACTg9D,EAAS,EACTC,EAAS,EACRF,EAAOD,IAAWC,GAAQD,GAC3B/kB,EAAI+kB,EACJA,EAAOt2C,IAAIw2C,KAEXjlB,EAAIglB,EACJA,EAAO/8D,IAAIi9D,IAEf,IAAIC,EAAS,EACb,GAAIF,EAASN,GAAQO,EAASN,EAc1B,IAbKI,EAAOD,IAAWC,GAAQD,GAC3BF,EAAOE,EAAO/kB,EACdtE,EAAKsE,GAAK6kB,EAAOE,GACjBA,EAAOt2C,IAAIw2C,KAEXJ,EAAOG,EAAOhlB,EACdtE,EAAKsE,GAAK6kB,EAAOG,GACjBA,EAAO/8D,IAAIi9D,IAEfllB,EAAI6kB,EACO,IAAPnpB,IACAhqB,EAAEyzC,KAAYzpB,GAEXupB,EAASN,GAAQO,EAASN,GACxBI,EAAOD,IAAWC,GAAQD,GAC3BF,EAAO7kB,EAAI+kB,EACXD,EAAQD,EAAO7kB,EACftE,EAAKsE,GAAK6kB,EAAOC,IAAUC,EAAOD,GAClCC,EAAOt2C,IAAIw2C,KAEXJ,EAAO7kB,EAAIglB,EACXF,EAAQD,EAAO7kB,EACftE,EAAKsE,GAAK6kB,EAAOC,IAAUE,EAAOF,GAClCE,EAAO/8D,IAAIi9D,IAEfllB,EAAI6kB,EACO,IAAPnpB,IACAhqB,EAAEyzC,KAAYzpB,GAI1B,KAAOupB,EAASN,GACZE,EAAO7kB,EAAI+kB,EACXD,EAAQD,EAAO7kB,EACftE,EAAKsE,GAAK6kB,EAAOC,IAAUC,EAAOD,GAClCC,EAAOt2C,IAAIw2C,GACXjlB,EAAI6kB,EACO,IAAPnpB,IACAhqB,EAAEyzC,KAAYzpB,GAGtB,KAAOwpB,EAASN,GACZC,EAAO7kB,EAAIglB,EACXF,EAAQD,EAAO7kB,EACftE,EAAKsE,GAAK6kB,EAAOC,IAAUE,EAAOF,GAClCE,EAAO/8D,IAAIi9D,GACXllB,EAAI6kB,EACO,IAAPnpB,IACAhqB,EAAEyzC,KAAYzpB,GAMtB,OAHU,IAANsE,GAAsB,IAAXmlB,IACXzzC,EAAEyzC,KAAYnlB,GAEXmlB,CACX,CA4DO,SAASC,EAAInoD,GAChB,OAAO,IAAI5R,aAAa4R,EAC5B,CCvIA,MACMooD,EAAe,sBACfC,EAAe,sBAEf1jD,EAAIwjD,EAAI,GACRG,EAAKH,EAAI,GACTI,EAAKJ,EAAI,IACT5zB,EAAI4zB,EAAI,IACRpoD,EAAIooD,EAAI,GAgKP,SAASK,EAAStpD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,GACzC,MAAMC,GAAWL,EAAKI,IAAOH,EAAKE,GAC5BG,GAAY7pD,EAAK0pD,IAAOD,EAAKE,GAC7BG,EAAMF,EAAUC,EAEhBE,EAASttD,KAAKC,IAAIktD,EAAUC,GAClC,OAAIptD,KAAKC,IAAIotD,IA9KI,sBA8KmBC,EAAeD,GApKvD,SAAuB9pD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,EAAII,GAC3C,IAAIC,EAASC,EAASC,EAASC,EAC3BxB,EAAO/qD,EAAGwsD,EAAKC,EAAKC,EAAKC,EAAKC,EAAIC,EAAIC,EAAI/hD,EAAIgiD,EAAIvrD,EAAIwrD,EAAIC,EAE9D,MAAMC,EAAM9qD,EAAK0pD,EACXqB,EAAMvB,EAAKE,EACXsB,EAAMzB,EAAKI,EACXsB,EAAMxB,EAAKE,EAEjBhhD,EAAKmiD,EAAMG,EACXrtD,EAAIyqD,EAAWyC,EACfV,EAAMxsD,GAAKA,EAAIktD,GACfT,EAAMS,EAAMV,EACZxsD,EAAIyqD,EAAW4C,EACfX,EAAM1sD,GAAKA,EAAIqtD,GACfV,EAAMU,EAAMX,EACZK,EAAKN,EAAME,GAAO5hD,EAAKyhD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDnrD,EAAK4rD,EAAMD,EACXntD,EAAIyqD,EAAW2C,EACfZ,EAAMxsD,GAAKA,EAAIotD,GACfX,EAAMW,EAAMZ,EACZxsD,EAAIyqD,EAAW0C,EACfT,EAAM1sD,GAAKA,EAAImtD,GACfR,EAAMQ,EAAMT,EACZM,EAAKP,EAAME,GAAOnrD,EAAKgrD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDC,EAAKG,EAAKC,EACVjC,EAAQgC,EAAKH,EACb/kD,EAAE,GAAKklD,GAAMH,EAAK7B,IAAUA,EAAQiC,GACpCH,EAAK9hD,EAAK6hD,EACV7B,EAAQ8B,EAAK9hD,EACb+hD,EAAK/hD,GAAM8hD,EAAK9B,IAAU6B,EAAK7B,GAC/B6B,EAAKE,EAAKtrD,EACVupD,EAAQ+B,EAAKF,EACb/kD,EAAE,GAAKilD,GAAMF,EAAK7B,IAAUA,EAAQvpD,GACpCyrD,EAAKJ,EAAKD,EACV7B,EAAQkC,EAAKJ,EACbhlD,EAAE,GAAKglD,GAAMI,EAAKlC,IAAU6B,EAAK7B,GACjCljD,EAAE,GAAKolD,EAEP,IAAIf,ED8ED,SAAkBtB,EAAMl2C,GAC3B,IAAIuxB,EAAIvxB,EAAE,GACV,IAAK,IAAIllB,EAAI,EAAGA,EAAIo7D,EAAMp7D,IAAKy2C,GAAKvxB,EAAEllB,GACtC,OAAOy2C,CACX,CClFcqnB,CAAS,EAAGzlD,GAClB0lD,EAAWjC,EAAea,EAC9B,GAAID,GAAOqB,IAAarB,GAAOqB,EAC3B,OAAOrB,EAYX,GATAnB,EAAQ3oD,EAAK8qD,EACbd,EAAUhqD,GAAM8qD,EAAMnC,IAAUA,EAAQe,GACxCf,EAAQa,EAAKuB,EACbb,EAAUV,GAAMuB,EAAMpC,IAAUA,EAAQe,GACxCf,EAAQY,EAAKyB,EACbf,EAAUV,GAAMyB,EAAMrC,IAAUA,EAAQgB,GACxChB,EAAQc,EAAKwB,EACbd,EAAUV,GAAMwB,EAAMtC,IAAUA,EAAQgB,GAExB,IAAZK,GAA6B,IAAZC,GAA6B,IAAZC,GAA6B,IAAZC,EACnD,OAAOL,EAKX,GAFAqB,EAAWhC,EAAeY,EAASzB,EAAiB7rD,KAAKC,IAAIotD,GAC7DA,GAAQgB,EAAMX,EAAUc,EAAMjB,GAAYgB,EAAMd,EAAUa,EAAMd,GAC5DH,GAAOqB,IAAarB,GAAOqB,EAAU,OAAOrB,EAEhDnhD,EAAKqhD,EAAUiB,EACfrtD,EAAIyqD,EAAW2B,EACfI,EAAMxsD,GAAKA,EAAIosD,GACfK,EAAML,EAAUI,EAChBxsD,EAAIyqD,EAAW4C,EACfX,EAAM1sD,GAAKA,EAAIqtD,GACfV,EAAMU,EAAMX,EACZK,EAAKN,EAAME,GAAO5hD,EAAKyhD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDnrD,EAAK6qD,EAAUc,EACfntD,EAAIyqD,EAAW4B,EACfG,EAAMxsD,GAAKA,EAAIqsD,GACfI,EAAMJ,EAAUG,EAChBxsD,EAAIyqD,EAAW0C,EACfT,EAAM1sD,GAAKA,EAAImtD,GACfR,EAAMQ,EAAMT,EACZM,EAAKP,EAAME,GAAOnrD,EAAKgrD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDC,EAAKG,EAAKC,EACVjC,EAAQgC,EAAKH,EACb3pD,EAAE,GAAK8pD,GAAMH,EAAK7B,IAAUA,EAAQiC,GACpCH,EAAK9hD,EAAK6hD,EACV7B,EAAQ8B,EAAK9hD,EACb+hD,EAAK/hD,GAAM8hD,EAAK9B,IAAU6B,EAAK7B,GAC/B6B,EAAKE,EAAKtrD,EACVupD,EAAQ+B,EAAKF,EACb3pD,EAAE,GAAK6pD,GAAMF,EAAK7B,IAAUA,EAAQvpD,GACpCyrD,EAAKJ,EAAKD,EACV7B,EAAQkC,EAAKJ,EACb5pD,EAAE,GAAK4pD,GAAMI,EAAKlC,IAAU6B,EAAK7B,GACjC9nD,EAAE,GAAKgqD,EACP,MAAMO,EAAQ7C,EAAI,EAAG9iD,EAAG,EAAG5E,EAAGuoD,GAE9BzgD,EAAKmiD,EAAMX,EACXvsD,EAAIyqD,EAAWyC,EACfV,EAAMxsD,GAAKA,EAAIktD,GACfT,EAAMS,EAAMV,EACZxsD,EAAIyqD,EAAW8B,EACfG,EAAM1sD,GAAKA,EAAIusD,GACfI,EAAMJ,EAAUG,EAChBK,EAAKN,EAAME,GAAO5hD,EAAKyhD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDnrD,EAAK4rD,EAAMd,EACXtsD,EAAIyqD,EAAW2C,EACfZ,EAAMxsD,GAAKA,EAAIotD,GACfX,EAAMW,EAAMZ,EACZxsD,EAAIyqD,EAAW6B,EACfI,EAAM1sD,GAAKA,EAAIssD,GACfK,EAAML,EAAUI,EAChBM,EAAKP,EAAME,GAAOnrD,EAAKgrD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDC,EAAKG,EAAKC,EACVjC,EAAQgC,EAAKH,EACb3pD,EAAE,GAAK8pD,GAAMH,EAAK7B,IAAUA,EAAQiC,GACpCH,EAAK9hD,EAAK6hD,EACV7B,EAAQ8B,EAAK9hD,EACb+hD,EAAK/hD,GAAM8hD,EAAK9B,IAAU6B,EAAK7B,GAC/B6B,EAAKE,EAAKtrD,EACVupD,EAAQ+B,EAAKF,EACb3pD,EAAE,GAAK6pD,GAAMF,EAAK7B,IAAUA,EAAQvpD,GACpCyrD,EAAKJ,EAAKD,EACV7B,EAAQkC,EAAKJ,EACb5pD,EAAE,GAAK4pD,GAAMI,EAAKlC,IAAU6B,EAAK7B,GACjC9nD,EAAE,GAAKgqD,EACP,MAAMQ,EAAQ9C,EAAI6C,EAAOhC,EAAI,EAAGvoD,EAAGwoD,GAEnC1gD,EAAKqhD,EAAUG,EACfvsD,EAAIyqD,EAAW2B,EACfI,EAAMxsD,GAAKA,EAAIosD,GACfK,EAAML,EAAUI,EAChBxsD,EAAIyqD,EAAW8B,EACfG,EAAM1sD,GAAKA,EAAIusD,GACfI,EAAMJ,EAAUG,EAChBK,EAAKN,EAAME,GAAO5hD,EAAKyhD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDnrD,EAAK6qD,EAAUC,EACftsD,EAAIyqD,EAAW4B,EACfG,EAAMxsD,GAAKA,EAAIqsD,GACfI,EAAMJ,EAAUG,EAChBxsD,EAAIyqD,EAAW6B,EACfI,EAAM1sD,GAAKA,EAAIssD,GACfK,EAAML,EAAUI,EAChBM,EAAKP,EAAME,GAAOnrD,EAAKgrD,EAAME,EAAMD,EAAMC,EAAMF,EAAMG,GACrDC,EAAKG,EAAKC,EACVjC,EAAQgC,EAAKH,EACb3pD,EAAE,GAAK8pD,GAAMH,EAAK7B,IAAUA,EAAQiC,GACpCH,EAAK9hD,EAAK6hD,EACV7B,EAAQ8B,EAAK9hD,EACb+hD,EAAK/hD,GAAM8hD,EAAK9B,IAAU6B,EAAK7B,GAC/B6B,EAAKE,EAAKtrD,EACVupD,EAAQ+B,EAAKF,EACb3pD,EAAE,GAAK6pD,GAAMF,EAAK7B,IAAUA,EAAQvpD,GACpCyrD,EAAKJ,EAAKD,EACV7B,EAAQkC,EAAKJ,EACb5pD,EAAE,GAAK4pD,GAAMI,EAAKlC,IAAU6B,EAAK7B,GACjC9nD,EAAE,GAAKgqD,EACP,MAAMS,EAAO/C,EAAI8C,EAAOhC,EAAI,EAAGxoD,EAAGw0B,GAElC,OAAOA,EAAEi2B,EAAO,EACpB,CAUYC,CAAcvrD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,EAAII,EAClD,CC7KWd,EAAI,GACJA,EAAI,GACJA,EAAI,GACFA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACLA,EAAI,GACJA,EAAI,GACJA,EAAI,GACNA,EAAI,GAEHA,EAAI,GACHA,EAAI,GACJA,EAAI,GACJA,EAAI,IAENA,EAAI,KACHA,EAAI,KCpBJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACLA,EAAI,GACJA,EAAI,GACAA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACNA,EAAI,GACJA,EAAI,GACJA,EAAI,GACHA,EAAI,GACJA,EAAI,GACJA,EAAI,GAENA,EAAI,GACHA,EAAI,IACHA,EAAI,IACJA,EAAI,IACLA,EAAI,IACHA,EAAI,IACLA,EAAI,IACJA,EAAI,IAENA,EAAI,MACHA,EAAI,MC/BJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GACJA,EAAI,GAEHA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IAEHA,EAAI,MACJA,EAAI,MACJA,EAAI,MACJA,EAAI,MACJA,EAAI,MACHA,EAAI,MACJA,EAAI,MACHA,EAAI,MACLA,EAAI,MAEPA,EAAI,GACHA,EAAI,GACJA,EAAI,GACJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACHA,EAAI,IACLA,EAAI,IACHA,EAAI,KACHA,EAAI,KACJA,EAAI,KACJA,EAAI,KACLA,EAAI,KAgVJA,EAAI,IACJA,EAAI,IACJA,EAAI,IACLA,EAAI,MCpYhB,MAAMuC,EAAU/uD,KAAKoF,IAAI,GAAI,IACvB4pD,EAAa,IAAIz4D,YAAY,KAIpB,MAAM04D,EAEjB,WAAOC,CAAKC,GAAgD,IAAxCC,EAAI17D,UAAA7C,OAAA,QAAA0vD,IAAA7sD,UAAA,GAAAA,UAAA,GAAG27D,GAAaC,EAAI57D,UAAA7C,OAAA,QAAA0vD,IAAA7sD,UAAA,GAAAA,UAAA,GAAG67D,GAC3C,MAAMlrD,EAAI8qD,EAAOt+D,OACX2+D,EAAS,IAAI/8D,aAAiB,EAAJ4R,GAEhC,IAAK,IAAI1T,EAAI,EAAGA,EAAI0T,EAAG1T,IAAK,CACxB,MAAMujB,EAAIi7C,EAAOx+D,GACjB6+D,EAAO,EAAI7+D,GAAKy+D,EAAKl7C,GACrBs7C,EAAO,EAAI7+D,EAAI,GAAK2+D,EAAKp7C,EAC7B,CAEA,OAAO,IAAI+6C,EAAWO,EAC1B,CAEAt/D,WAAAA,CAAYs/D,GACR,MAAMnrD,EAAImrD,EAAO3+D,QAAU,EAC3B,GAAIwT,EAAI,GAA0B,kBAAdmrD,EAAO,GAAiB,MAAM,IAAI17D,MAAM,uCAE5DH,KAAK67D,OAASA,EAGd,MAAMC,EAAezvD,KAAK+C,IAAI,EAAIsB,EAAI,EAAG,GACzC1Q,KAAK+7D,WAAa,IAAIn5D,YAA2B,EAAfk5D,GAClC97D,KAAKg8D,WAAa,IAAIn5D,WAA0B,EAAfi5D,GAGjC97D,KAAKi8D,UAAY5vD,KAAKE,KAAKF,KAAKwE,KAAKH,IACrC1Q,KAAKk8D,UAAY,IAAIt5D,YAAY8N,GACjC1Q,KAAKm8D,UAAY,IAAIv5D,YAAY8N,GACjC1Q,KAAKo8D,SAAW,IAAIx5D,YAAY8N,GAChC1Q,KAAKq8D,UAAY,IAAIx5D,WAAW7C,KAAKi8D,WAGrCj8D,KAAKs8D,KAAO,IAAI15D,YAAY8N,GAC5B1Q,KAAKu8D,OAAS,IAAIz9D,aAAa4R,GAE/B1Q,KAAK61D,QACT,CAEAA,MAAAA,GACI,MAAM,OAACgG,EAAQK,UAAWM,EAAUL,UAAWM,EAAUL,SAAUM,EAASL,UAAWM,GAAa38D,KAC9F0Q,EAAImrD,EAAO3+D,QAAU,EAG3B,IAAI0/D,EAAO7b,IACP8b,EAAO9b,IACP+b,GAAQ/b,IACRgc,GAAQhc,IAEZ,IAAK,IAAI/jD,EAAI,EAAGA,EAAI0T,EAAG1T,IAAK,CACxB,MAAMZ,EAAIy/D,EAAO,EAAI7+D,GACf0N,EAAImxD,EAAO,EAAI7+D,EAAI,GACrBZ,EAAIwgE,IAAMA,EAAOxgE,GACjBsO,EAAImyD,IAAMA,EAAOnyD,GACjBtO,EAAI0gE,IAAMA,EAAO1gE,GACjBsO,EAAIqyD,IAAMA,EAAOryD,GACrB1K,KAAKs8D,KAAKt/D,GAAKA,CACnB,CACA,MAAMs8D,GAAMsD,EAAOE,GAAQ,EACrBvD,GAAMsD,EAAOE,GAAQ,EAE3B,IAAIC,EAAIC,EAAIC,EAGZ,IAAK,IAAIlgE,EAAI,EAAGmgE,EAAUpc,IAAU/jD,EAAI0T,EAAG1T,IAAK,CAC5C,MAAM+Y,EAAIqnD,GAAK9D,EAAIC,EAAIsC,EAAO,EAAI7+D,GAAI6+D,EAAO,EAAI7+D,EAAI,IACjD+Y,EAAIonD,IACJH,EAAKhgE,EACLmgE,EAAUpnD,EAElB,CACA,MAAMsnD,EAAMxB,EAAO,EAAImB,GACjBM,EAAMzB,EAAO,EAAImB,EAAK,GAG5B,IAAK,IAAIhgE,EAAI,EAAGmgE,EAAUpc,IAAU/jD,EAAI0T,EAAG1T,IAAK,CAC5C,GAAIA,IAAMggE,EAAI,SACd,MAAMjnD,EAAIqnD,GAAKC,EAAKC,EAAKzB,EAAO,EAAI7+D,GAAI6+D,EAAO,EAAI7+D,EAAI,IACnD+Y,EAAIonD,GAAWpnD,EAAI,IACnBknD,EAAKjgE,EACLmgE,EAAUpnD,EAElB,CACA,IAAIwnD,EAAM1B,EAAO,EAAIoB,GACjBO,EAAM3B,EAAO,EAAIoB,EAAK,GAEtBQ,EAAY1c,IAGhB,IAAK,IAAI/jD,EAAI,EAAGA,EAAI0T,EAAG1T,IAAK,CACxB,GAAIA,IAAMggE,GAAMhgE,IAAMigE,EAAI,SAC1B,MAAM3vD,EAAIowD,GAAaL,EAAKC,EAAKC,EAAKC,EAAK3B,EAAO,EAAI7+D,GAAI6+D,EAAO,EAAI7+D,EAAI,IACrEsQ,EAAImwD,IACJP,EAAKlgE,EACLygE,EAAYnwD,EAEpB,CACA,IAAIqwD,EAAM9B,EAAO,EAAIqB,GACjBU,EAAM/B,EAAO,EAAIqB,EAAK,GAE1B,GAAIO,IAAc1c,IAAU,CAGxB,IAAK,IAAI/jD,EAAI,EAAGA,EAAI0T,EAAG1T,IACnBgD,KAAKu8D,OAAOv/D,GAAM6+D,EAAO,EAAI7+D,GAAK6+D,EAAO,IAAQA,EAAO,EAAI7+D,EAAI,GAAK6+D,EAAO,GAEhFgC,GAAU79D,KAAKs8D,KAAMt8D,KAAKu8D,OAAQ,EAAG7rD,EAAI,GACzC,MAAMotD,EAAO,IAAIl7D,YAAY8N,GAC7B,IAAIzT,EAAI,EACR,IAAK,IAAID,EAAI,EAAG+gE,GAAMhd,IAAU/jD,EAAI0T,EAAG1T,IAAK,CACxC,MAAM64B,EAAK71B,KAAKs8D,KAAKt/D,GACf+Y,EAAI/V,KAAKu8D,OAAO1mC,GAClB9f,EAAIgoD,IACJD,EAAK7gE,KAAO44B,EACZkoC,EAAKhoD,EAEb,CAIA,OAHA/V,KAAK89D,KAAOA,EAAKE,SAAS,EAAG/gE,GAC7B+C,KAAKi+D,UAAY,IAAIr7D,YAAY,QACjC5C,KAAKk+D,UAAY,IAAIt7D,YAAY,GAErC,CAGA,GAAIs2D,EAASmE,EAAKC,EAAKC,EAAKC,EAAKG,EAAKC,GAAO,EAAG,CAC5C,MAAM5gE,EAAIigE,EACJ7gE,EAAImhE,EACJ7yD,EAAI8yD,EACVP,EAAKC,EACLK,EAAMI,EACNH,EAAMI,EACNV,EAAKlgE,EACL2gE,EAAMvhE,EACNwhE,EAAMlzD,CACV,CAEA,MAAMyzD,EA8Qd,SAAsBvuD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,GACtC,MAAMvE,EAAKoE,EAAKxpD,EACVqlD,EAAKoE,EAAKF,EACViF,EAAK9E,EAAK1pD,EACVyuD,EAAK9E,EAAKJ,EAEVlV,EAAK+Q,EAAKA,EAAKC,EAAKA,EACpB9Q,EAAKia,EAAKA,EAAKC,EAAKA,EACpBtoD,EAAI,IAAOi/C,EAAKqJ,EAAKpJ,EAAKmJ,GAKhC,MAAO,CAAChiE,EAHEwT,GAAMyuD,EAAKpa,EAAKgR,EAAK9Q,GAAMpuC,EAG1BrL,EAFDyuD,GAAMnE,EAAK7Q,EAAKia,EAAKna,GAAMluC,EAGzC,CA5RuBuoD,CAAajB,EAAKC,EAAKC,EAAKC,EAAKG,EAAKC,GACrD59D,KAAKu+D,IAAMJ,EAAO/hE,EAClB4D,KAAKw+D,IAAML,EAAOzzD,EAElB,IAAK,IAAI1N,EAAI,EAAGA,EAAI0T,EAAG1T,IACnBgD,KAAKu8D,OAAOv/D,GAAKogE,GAAKvB,EAAO,EAAI7+D,GAAI6+D,EAAO,EAAI7+D,EAAI,GAAImhE,EAAO/hE,EAAG+hE,EAAOzzD,GAI7EmzD,GAAU79D,KAAKs8D,KAAMt8D,KAAKu8D,OAAQ,EAAG7rD,EAAI,GAGzC1Q,KAAKy+D,WAAazB,EAClB,IAAI0B,EAAW,EAEfjC,EAASO,GAAMR,EAASU,GAAMD,EAC9BR,EAASQ,GAAMT,EAASQ,GAAME,EAC9BT,EAASS,GAAMV,EAASS,GAAMD,EAE9BN,EAAQM,GAAM,EACdN,EAAQO,GAAM,EACdP,EAAQQ,GAAM,EAEdP,EAASgC,MAAM,GACfhC,EAAS38D,KAAK4+D,SAASvB,EAAKC,IAAQN,EACpCL,EAAS38D,KAAK4+D,SAASrB,EAAKC,IAAQP,EACpCN,EAAS38D,KAAK4+D,SAASjB,EAAKC,IAAQV,EAEpCl9D,KAAK6+D,aAAe,EACpB7+D,KAAK8+D,aAAa9B,EAAIC,EAAIC,GAAK,GAAI,GAAI,GAEvC,IAAK,IAAW6B,EAAIC,EAAX3xD,EAAI,EAAWA,EAAIrN,KAAKs8D,KAAKp/D,OAAQmQ,IAAK,CAC/C,MAAMrQ,EAAIgD,KAAKs8D,KAAKjvD,GACdjR,EAAIy/D,EAAO,EAAI7+D,GACf0N,EAAImxD,EAAO,EAAI7+D,EAAI,GAGzB,GAAIqQ,EAAI,GAAKhB,KAAKC,IAAIlQ,EAAI2iE,IAAO3D,GAAW/uD,KAAKC,IAAI5B,EAAIs0D,IAAO5D,EAAS,SAKzE,GAJA2D,EAAK3iE,EACL4iE,EAAKt0D,EAGD1N,IAAMggE,GAAMhgE,IAAMigE,GAAMjgE,IAAMkgE,EAAI,SAGtC,IAAIv8D,EAAQ,EACZ,IAAK,IAAI1D,EAAI,EAAG6M,EAAM9J,KAAK4+D,SAASxiE,EAAGsO,GAAIzN,EAAI+C,KAAKi8D,YAChDt7D,EAAQg8D,GAAU7yD,EAAM7M,GAAK+C,KAAKi8D,YACnB,IAAXt7D,GAAgBA,IAAU87D,EAAS97D,IAFoB1D,KAK/D0D,EAAQ67D,EAAS77D,GACjB,IAAeuuC,EAAXhtB,EAAIvhB,EACR,KAAOuuC,EAAIutB,EAASv6C,GAAIg3C,EAAS98D,EAAGsO,EAAGmxD,EAAO,EAAI35C,GAAI25C,EAAO,EAAI35C,EAAI,GAAI25C,EAAO,EAAI3sB,GAAI2sB,EAAO,EAAI3sB,EAAI,KAAO,GAE1G,GADAhtB,EAAIgtB,EACAhtB,IAAMvhB,EAAO,CACbuhB,GAAK,EACL,KACJ,CAEJ,IAAW,IAAPA,EAAU,SAGd,IAAI3U,EAAIvN,KAAK8+D,aAAa58C,EAAGllB,EAAGy/D,EAASv6C,IAAK,GAAI,EAAGw6C,EAAQx6C,IAG7Dw6C,EAAQ1/D,GAAKgD,KAAKi/D,UAAU1xD,EAAI,GAChCmvD,EAAQx6C,GAAK3U,EACbmxD,IAGA,IAAIhuD,EAAI+rD,EAASv6C,GACjB,KAAOgtB,EAAIutB,EAAS/rD,GAAIwoD,EAAS98D,EAAGsO,EAAGmxD,EAAO,EAAInrD,GAAImrD,EAAO,EAAInrD,EAAI,GAAImrD,EAAO,EAAI3sB,GAAI2sB,EAAO,EAAI3sB,EAAI,IAAM,GACzG3hC,EAAIvN,KAAK8+D,aAAapuD,EAAG1T,EAAGkyC,EAAGwtB,EAAQ1/D,IAAK,EAAG0/D,EAAQhsD,IACvDgsD,EAAQ1/D,GAAKgD,KAAKi/D,UAAU1xD,EAAI,GAChCkvD,EAAS/rD,GAAKA,EACdguD,IACAhuD,EAAIw+B,EAIR,GAAIhtB,IAAMvhB,EACN,KAAOuuC,EAAIstB,EAASt6C,GAAIg3C,EAAS98D,EAAGsO,EAAGmxD,EAAO,EAAI3sB,GAAI2sB,EAAO,EAAI3sB,EAAI,GAAI2sB,EAAO,EAAI35C,GAAI25C,EAAO,EAAI35C,EAAI,IAAM,GACzG3U,EAAIvN,KAAK8+D,aAAa5vB,EAAGlyC,EAAGklB,GAAI,EAAGw6C,EAAQx6C,GAAIw6C,EAAQxtB,IACvDlvC,KAAKi/D,UAAU1xD,EAAI,GACnBmvD,EAAQxtB,GAAK3hC,EACbkvD,EAASv6C,GAAKA,EACdw8C,IACAx8C,EAAIgtB,EAKZlvC,KAAKy+D,WAAajC,EAASx/D,GAAKklB,EAChCu6C,EAASv6C,GAAKs6C,EAAS9rD,GAAK1T,EAC5By/D,EAASz/D,GAAK0T,EAGdisD,EAAS38D,KAAK4+D,SAASxiE,EAAGsO,IAAM1N,EAChC2/D,EAAS38D,KAAK4+D,SAAS/C,EAAO,EAAI35C,GAAI25C,EAAO,EAAI35C,EAAI,KAAOA,CAChE,CAEAliB,KAAK89D,KAAO,IAAIl7D,YAAY87D,GAC5B,IAAK,IAAI1hE,EAAI,EAAGklB,EAAIliB,KAAKy+D,WAAYzhE,EAAI0hE,EAAU1hE,IAC/CgD,KAAK89D,KAAK9gE,GAAKklB,EACfA,EAAIu6C,EAASv6C,GAIjBliB,KAAKi+D,UAAYj+D,KAAK+7D,WAAWiC,SAAS,EAAGh+D,KAAK6+D,cAClD7+D,KAAKk+D,UAAYl+D,KAAKg8D,WAAWgC,SAAS,EAAGh+D,KAAK6+D,aACtD,CAEAD,QAAAA,CAASxiE,EAAGsO,GACR,OAAO2B,KAAKrN,MAgHpB,SAAqBg2D,EAAIC,GACrB,MAAM10C,EAAIy0C,GAAM3oD,KAAKC,IAAI0oD,GAAM3oD,KAAKC,IAAI2oD,IACxC,OAAQA,EAAK,EAAI,EAAI10C,EAAI,EAAIA,GAAK,CACtC,CAnH0B2+C,CAAY9iE,EAAI4D,KAAKu+D,IAAK7zD,EAAI1K,KAAKw+D,KAAOx+D,KAAKi8D,WAAaj8D,KAAKi8D,SACvF,CAEAgD,SAAAA,CAAUhzD,GACN,MAAO8vD,WAAYkC,EAAWjC,WAAYkC,EAAS,OAAErC,GAAU77D,KAE/D,IAAIhD,EAAI,EACJmiE,EAAK,EAGT,OAAa,CACT,MAAMjzD,EAAIgyD,EAAUjyD,GAiBdmzD,EAAKnzD,EAAIA,EAAI,EAGnB,GAFAkzD,EAAKC,GAAMnzD,EAAI,GAAK,GAET,IAAPC,EAAU,CACV,GAAU,IAANlP,EAAS,MACbiP,EAAIovD,IAAar+D,GACjB,QACJ,CAEA,MAAMqiE,EAAKnzD,EAAIA,EAAI,EACb43C,EAAKsb,GAAMnzD,EAAI,GAAK,EACpBg4C,EAAKob,GAAMnzD,EAAI,GAAK,EAEpBozD,EAAKrB,EAAUkB,GACfI,EAAKtB,EAAUhyD,GACfm5C,EAAK6Y,EAAUna,GACf0b,EAAKvB,EAAUha,GAQrB,GANgBwb,GACZ5D,EAAO,EAAIyD,GAAKzD,EAAO,EAAIyD,EAAK,GAChCzD,EAAO,EAAI0D,GAAK1D,EAAO,EAAI0D,EAAK,GAChC1D,EAAO,EAAIzW,GAAKyW,EAAO,EAAIzW,EAAK,GAChCyW,EAAO,EAAI2D,GAAK3D,EAAO,EAAI2D,EAAK,IAEvB,CACTvB,EAAUhyD,GAAKuzD,EACfvB,EAAU/xD,GAAKozD,EAEf,MAAMI,EAAMxB,EAAUja,GAGtB,IAAa,IAATyb,EAAY,CACZ,IAAIx9C,EAAIliB,KAAKy+D,WACb,EAAG,CACC,GAAIz+D,KAAKo8D,SAASl6C,KAAO+hC,EAAI,CACzBjkD,KAAKo8D,SAASl6C,GAAKjW,EACnB,KACJ,CACAiW,EAAIliB,KAAKk8D,UAAUh6C,EACvB,OAASA,IAAMliB,KAAKy+D,WACxB,CACAz+D,KAAK2/D,MAAM1zD,EAAGyzD,GACd1/D,KAAK2/D,MAAMzzD,EAAGgyD,EAAUiB,IACxBn/D,KAAK2/D,MAAMR,EAAIlb,GAEf,MAAMx3B,EAAK4yC,GAAMnzD,EAAI,GAAK,EAGtBlP,EAAIq+D,EAAWn+D,SACfm+D,EAAWr+D,KAAOyvB,EAE1B,KAAO,CACH,GAAU,IAANzvB,EAAS,MACbiP,EAAIovD,IAAar+D,EACrB,CACJ,CAEA,OAAOmiE,CACX,CAEAQ,KAAAA,CAAM1zD,EAAGC,GACLlM,KAAKg8D,WAAW/vD,GAAKC,GACV,IAAPA,IAAUlM,KAAKg8D,WAAW9vD,GAAKD,EACvC,CAGA6yD,YAAAA,CAAa9B,EAAIC,EAAIC,EAAIjxD,EAAGC,EAAGsB,GAC3B,MAAMD,EAAIvN,KAAK6+D,aAYf,OAVA7+D,KAAK+7D,WAAWxuD,GAAKyvD,EACrBh9D,KAAK+7D,WAAWxuD,EAAI,GAAK0vD,EACzBj9D,KAAK+7D,WAAWxuD,EAAI,GAAK2vD,EAEzBl9D,KAAK2/D,MAAMpyD,EAAGtB,GACdjM,KAAK2/D,MAAMpyD,EAAI,EAAGrB,GAClBlM,KAAK2/D,MAAMpyD,EAAI,EAAGC,GAElBxN,KAAK6+D,cAAgB,EAEdtxD,CACX,EASJ,SAAS6vD,GAAKxtD,EAAIupD,EAAIC,EAAIC,GACtB,MAAMrE,EAAKplD,EAAKwpD,EACVnE,EAAKkE,EAAKE,EAChB,OAAOrE,EAAKA,EAAKC,EAAKA,CAC1B,CAEA,SAASwK,GAAS7vD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,EAAIqG,EAAIC,GAC1C,MAAM7K,EAAKplD,EAAKgwD,EACV3K,EAAKkE,EAAK0G,EACVzB,EAAKhF,EAAKwG,EACVvB,EAAKhF,EAAKwG,EACVC,EAAKxG,EAAKsG,EACVG,EAAKxG,EAAKsG,EAGV1vD,EAAKiuD,EAAKA,EAAKC,EAAKA,EACpB2B,EAAKF,EAAKA,EAAKC,EAAKA,EAE1B,OAAO/K,GAAMqJ,EAAK2B,EAAK7vD,EAAK4vD,GACrB9K,GAAMmJ,EAAK4B,EAAK7vD,EAAK2vD,IALjB9K,EAAKA,EAAKC,EAAKA,IAMbmJ,EAAK2B,EAAK1B,EAAKyB,GAAM,CACtC,CAEA,SAASpC,GAAa9tD,EAAIupD,EAAIC,EAAIC,EAAIC,EAAIC,GACtC,MAAMvE,EAAKoE,EAAKxpD,EACVqlD,EAAKoE,EAAKF,EACViF,EAAK9E,EAAK1pD,EACVyuD,EAAK9E,EAAKJ,EAEVlV,EAAK+Q,EAAKA,EAAKC,EAAKA,EACpB9Q,EAAKia,EAAKA,EAAKC,EAAKA,EACpBtoD,EAAI,IAAOi/C,EAAKqJ,EAAKpJ,EAAKmJ,GAE1BhiE,GAAKiiE,EAAKpa,EAAKgR,EAAK9Q,GAAMpuC,EAC1BrL,GAAKsqD,EAAK7Q,EAAKia,EAAKna,GAAMluC,EAEhC,OAAO3Z,EAAIA,EAAIsO,EAAIA,CACvB,CAkBA,SAASmzD,GAAUoC,EAAKC,EAAOt9B,EAAMrmB,GACjC,GAAIA,EAAQqmB,GAAQ,GAChB,IAAK,IAAI5lC,EAAI4lC,EAAO,EAAG5lC,GAAKuf,EAAOvf,IAAK,CACpC,MAAMmjE,EAAOF,EAAIjjE,GACXojE,EAAWF,EAAMC,GACvB,IAAIljE,EAAID,EAAI,EACZ,KAAOC,GAAK2lC,GAAQs9B,EAAMD,EAAIhjE,IAAMmjE,GAAUH,EAAIhjE,EAAI,GAAKgjE,EAAIhjE,KAC/DgjE,EAAIhjE,EAAI,GAAKkjE,CACjB,KACG,CAEH,IAAInjE,EAAI4lC,EAAO,EACX3lC,EAAIsf,EACR8jD,GAAKJ,EAHWr9B,EAAOrmB,GAAU,EAGfvf,GACdkjE,EAAMD,EAAIr9B,IAASs9B,EAAMD,EAAI1jD,KAAS8jD,GAAKJ,EAAKr9B,EAAMrmB,GACtD2jD,EAAMD,EAAIjjE,IAAMkjE,EAAMD,EAAI1jD,KAAS8jD,GAAKJ,EAAKjjE,EAAGuf,GAChD2jD,EAAMD,EAAIr9B,IAASs9B,EAAMD,EAAIjjE,KAAKqjE,GAAKJ,EAAKr9B,EAAM5lC,GAEtD,MAAMmjE,EAAOF,EAAIjjE,GACXojE,EAAWF,EAAMC,GACvB,OAAa,CACT,GAAGnjE,UAAYkjE,EAAMD,EAAIjjE,IAAMojE,GAC/B,GAAGnjE,UAAYijE,EAAMD,EAAIhjE,IAAMmjE,GAC/B,GAAInjE,EAAID,EAAG,MACXqjE,GAAKJ,EAAKjjE,EAAGC,EACjB,CACAgjE,EAAIr9B,EAAO,GAAKq9B,EAAIhjE,GACpBgjE,EAAIhjE,GAAKkjE,EAEL5jD,EAAQvf,EAAI,GAAKC,EAAI2lC,GACrBi7B,GAAUoC,EAAKC,EAAOljE,EAAGuf,GACzBshD,GAAUoC,EAAKC,EAAOt9B,EAAM3lC,EAAI,KAEhC4gE,GAAUoC,EAAKC,EAAOt9B,EAAM3lC,EAAI,GAChC4gE,GAAUoC,EAAKC,EAAOljE,EAAGuf,GAEjC,CACJ,CAEA,SAAS8jD,GAAK/kE,EAAK0B,EAAGC,GAClB,MAAMoD,EAAM/E,EAAI0B,GAChB1B,EAAI0B,GAAK1B,EAAI2B,GACb3B,EAAI2B,GAAKoD,CACb,CAEA,SAASq7D,GAAYn7C,GACjB,OAAOA,EAAE,EACb,CACA,SAASq7C,GAAYr7C,GACjB,OAAOA,EAAE,EACb,CCtdA,SAAS+/C,GAAO//D,GACd,MAAI,YAAaA,EACR8L,KAAKk0D,MAAMhgE,EAAKigE,QAAQ,GAAKjgE,EAAKmK,EAAGnK,EAAKigE,QAAQ,GAAKjgE,EAAKnE,GAEjE,WAAYmE,EACP8L,KAAKk0D,MAAMhgE,EAAKkgE,OAAO,GAAIlgE,EAAKkgE,OAAO,IAE5C,QAASlgE,EACJA,EAAKmgE,SADd,CAIF,CAEA,MAAMC,GAAe,IAcfC,GAAoB,CACxBrjE,EAAG,EACHsjE,MAAO,EACPH,IAAK,EACLI,KAAM,EACNC,OAAQ,EACRC,OAAQ,EACRC,OAAQ,GAGH,SAASC,GACd3gE,GACiB,IAAD4gE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAChB,MAAO,CACLrlE,EAAGmE,EAAKnE,EACRsO,EAAGnK,EAAKmK,EACRnN,EAAS,QAAR4jE,EAAE5gE,EAAKhD,SAAC,IAAA4jE,EAAAA,EAAIP,GAAkBrjE,EAC/BsjE,MAAiB,QAAZO,EAAE7gE,EAAKsgE,aAAK,IAAAO,EAAAA,EAAIR,GAAkBC,MACvCH,IAAiB,QAAdW,EAAEf,GAAO//D,UAAK,IAAA8gE,EAAAA,EAAIT,GAAkBF,IACvCI,KAAe,QAAXQ,EAAE/gE,EAAKugE,YAAI,IAAAQ,EAAAA,EAAIV,GAAkBE,KACrCC,OAAmB,QAAbQ,EAAEhhE,EAAKwgE,cAAM,IAAAQ,EAAAA,EAAIX,GAAkBG,OACzCC,OAAmB,QAAbQ,EAAEjhE,EAAKygE,cAAM,IAAAQ,EAAAA,EAAIZ,GAAkBI,OACzCC,OAAmB,QAAbQ,EAAElhE,EAAK0gE,cAAM,IAAAQ,EAAAA,EAAIb,GAAkBK,OAE7C,CAEO,MAAMS,GACXnhE,GACG2gE,GAAS,IAAK3gE,EAAMnE,EAAGmE,EAAKnE,EAAI,GAAKsO,EAAGnK,EAAKmK,EAAI,KAE/C,SAASi3D,GACdphE,GACiB,IAADqhE,EAChB,MAAMxlE,EAAImE,EAAK4yD,IAAI7F,QAAQ,CAAC,GAAK/sD,EAAKnE,EAChCsO,EAAInK,EAAK4yD,IAAI7F,QAAQ,CAAC,GAAK/sD,EAAKmK,EAChCg2D,EAAkB,QAAfkB,EAAGtB,GAAO//D,UAAK,IAAAqhE,EAAAA,EAAIrhE,EAAK4yD,IAAI7F,QAAQ,CAAEzrB,KAAMx1B,KAAKwkD,GAAIzhD,IAAK/C,KAAKwkD,KACxE,MAAO,IAAK+P,GAAmBxkE,IAAGsO,IAAGg2D,MACvC,CAEA,SAASmB,GACPC,EACAC,EACAC,EACA/iC,EACAgjC,EACA1iC,GAEA,OAAQlzB,KAAK+C,IAAI4yD,EAAI/iC,EAAIgjC,EAAI1iC,GAAMlzB,KAAKw1B,IAAImgC,EAAI/iC,EAAIgjC,EAAI1iC,IAAO,CACjE,CAEA,SAAS2iC,GACP9lE,EACAsO,EACAs3D,EACA/iC,EACAgjC,EACA1iC,GAGA,GAAI70B,GAAK,EAAItO,EAAG,CAId,OAAO4lE,GAFK/iC,EAAK+iC,GAAM5lE,GACX6lE,EAAKD,GAAMt3D,CAEzB,CAIE,OAAO60B,GAFK0iC,EAAK1iC,IAAOnjC,EAAI,IAChB6iC,EAAKM,IAAO70B,EAAI,EAGhC,CAqBO,SAASy3D,GACdjB,EAAwB3T,EAExB6U,EACAC,EACAC,GACS,IAJRn3D,EAAIC,GAAUmiD,EAKf,MAAMnxD,GAAK8kE,EAAS9kE,EAAI+O,GAAMw1D,GACxBj2D,GAAKw2D,EAASx2D,EAAIU,GAAMu1D,GACxBpjE,EACJ2jE,EAAS3jE,EA7Bb,SACEnB,EACAsO,EACA03D,EACAG,GAEA,MAAMC,EAAQn2D,KAAKrN,MAAM5C,GACnBqmE,EAAQp2D,KAAKrN,MAAM0L,GAEzB,OAAOg4D,EADI,CAAEC,OAAQT,GAAkBU,SAAUf,IAAqBU,IAEpEnmE,EAAIomE,EACJ93D,EAAI+3D,EACJL,EAAU5mE,IAAIgnE,EAAOC,GACrBL,EAAU5mE,IAAIgnE,EAAQ,EAAGC,GACzBL,EAAU5mE,IAAIgnE,EAAOC,EAAQ,GAC7BL,EAAU5mE,IAAIgnE,EAAQ,EAAGC,EAAQ,GAErC,CAYiBI,CAAQ3B,EAAS9kE,EAAG8kE,EAASx2D,EAAG03D,EAAWE,GACpDzB,EAAQxL,EAAc6L,EAASL,OAC/BH,EAAMrL,EAAc6L,EAASR,IAAM2B,GACnCvB,EAAOzL,EAAc6L,EAASJ,OAC9B,OAAEC,EAAM,OAAEC,EAAM,OAAEC,GAAWC,EACnC,MACE,kBAAAt8B,OAAkBxoC,EAAEue,QAAQ,GAAE,OAAAiqB,OAAMl6B,EAAEiQ,QAAQ,GAAE,OAAAiqB,OAAMrnC,EAAEod,QAAQ,GAAE,oBAAAiqB,OACnDi8B,EAAMlmD,QAAQ,GAAE,OAAAiqB,OAAM87B,EAAI/lD,QAAQ,GAAE,OAAAiqB,OAAMk8B,EAAKnmD,QAAQ,GAAE,KAAG,WAAAiqB,OAChEm8B,EAAOpmD,QAAQ,GAAE,OAAAiqB,OAAMo8B,EAAOrmD,QAAQ,GAAE,OAAAiqB,OAAMq8B,EAAOtmD,QAAQ,GAE5E,CC7HA,MAAMmoD,GAA4B,CAAC7O,GAC7B8O,GAAuB,CAAC9O,EAAQC,GAChC8O,GAAgC,CAAC/O,EAAQK,EAAOJ,GAChD+O,GAA6B,CAAChP,EAAQG,EAAMF,GAC5CgP,GAA8B,CAACjP,EAAQQ,EAAYD,EAAMN,GAG/D,SAASiP,GAAgBC,EAAoB7V,GAAwB,IAArBpiD,EAAIC,GAAcmiD,EAChE,OAAY,IAARniD,EACKg4D,EAEE,IAAPj4D,EACKi4D,EAAU5Z,IAAIkM,GAEZ,IAAPtqD,EACKg4D,EAAU5Z,IAAI+L,GAGhB6N,EAAU5Z,IAAIgM,EACvB,CASA,MAAM6N,GASJ9mE,WAAAA,CACEs5B,EACAr5B,EACA8mE,EACAC,EACAC,EACAC,EACAL,EACAl2B,GACC,KAjBMrX,QAAE,OACFr5B,UAAI,OACJ8mE,mBAAa,OACbC,cAAQ,OACRC,SAAG,OACHC,cAAQ,OACRL,eAAS,OACTl2B,kBAAY,OAoBrBw2B,OAMiBnjE,IAAI,IAAAojE,EAAAC,EAAAC,EAAA,MAAM,IACtBnC,GAAenhE,GAClBujE,SAAU9jE,KACV+jE,WAAYZ,GAAgBnjE,KAAKojE,UAAW7iE,EAAKkgE,QAAQjX,KAAIgE,IAAA,IAAEpxD,EAAGsO,GAAE8iD,EAAA,MAAK,CACvEpxD,EAAImE,EAAKnE,EACTsO,EAAInK,EAAKmK,EACV,IACDs5D,MAAiB,QAAZL,EAAEpjE,EAAKyjE,aAAK,IAAAL,EAAAA,EAAI,EACrBM,YAA6B,QAAlBL,EAAErjE,EAAK0jE,mBAAW,IAAAL,GAAAA,EAC7BM,gBAAqC,QAAtBL,EAAEtjE,EAAK2jE,uBAAe,IAAAL,GAAAA,EACtC,EAzBC7jE,KAAK61B,GAAKA,EACV71B,KAAKxD,KAAOA,EACZwD,KAAKsjE,cAAgBA,EACrBtjE,KAAKujE,SAAWA,EAChBvjE,KAAKwjE,IAAMA,EACXxjE,KAAKyjE,SAAWA,EAChBzjE,KAAKojE,UAAYA,EACjBpjE,KAAKktC,aAAeA,CACtB,EAoBK,MAAMi3B,GAAa,IAAId,GAC5B,sBACA,aACA,KACA,EACA,EACA,EACAN,GACA,IAEWqB,GAAe,IAAIf,GAC9B,wBACA,eACA,KACA,EACA,EACA,EACAN,GACA,CAACoB,KAIUE,GAAQ,IAAIhB,GACvB,kBACA,QACA,KACA,EACA,EACA,EACAN,GACA,CAACoB,KAIUG,GAAU,IAAIjB,GACzB,oBACA,UACA,KACA,EACA,GACA,EACAL,GACA,CAACmB,KAIUI,GAAgB,IAAIlB,GAC/B,yBACA,gBACA,KACA,EACA,GACA,EACAJ,GACA,CAACkB,GAAYC,KAEFI,GAAkB,IAAInB,GACjC,2BACA,kBACA,KACA,EACA,GACA,EACAN,GACA,CAACoB,GAAYC,GAAcG,KAEhBE,GAAkB,IAAIpB,GACjC,2BACA,kBACA,KACA,EACA,GACA,EACAN,GACA,CAACoB,GAAYC,GAAcG,KAGhBG,GAAoB,IAAIrB,GACnC,6BACA,oBACA,KACA,EACA,GACA,EACAN,GACA,CAACoB,GAAYC,GAAcG,KAGhBI,GAAe,IAAItB,GAC9B,wBACA,eACA,KACA,EACA,GACA,EACAL,GACA,CAACmB,GAAYC,GAAcG,KAEhBK,GAAe,IAAIvB,GAC9B,wBACA,eACA,KACA,EACA,GACA,EACAP,GACA,CAACqB,GAAYC,GAAcG,GAAeC,KAG/BK,GAAiB,IAAIxB,GAChC,0BACA,iBACA,KACA,EACA,GACA,EACAH,GACA,CAACiB,GAAYC,GAAcG,GAAeC,KCtNrC,IAAKM,GAAQ,SAARA,GAAQ,OAARA,EAAAA,EAAQ,eAARA,EAAAA,EAAQ,mBAARA,EAAAA,EAAQ,eAARA,EAAAA,EAAQ,iBAARA,EAAAA,EAAQ,eAARA,EAAAA,EAAQ,eAARA,EAAAA,EAAQ,iBAARA,CAAQ,MAsBpB,MAwBaC,GAxBC,CACZC,MAAoB,CAACnvC,GAAK,EAAGr5B,KAAM,eAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKC,KAAoB,CAAC3vC,GAAK,EAAGr5B,KAAM,OAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAU,EAAMC,QAAQ,EAAOC,SAAkB,EAAGC,SAAU,GACpKE,MAAoB,CAAC5vC,GAAI,GAAIr5B,KAAM,QAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAU,EAAMC,QAAQ,EAAOC,SAAkB,EAAGC,SAAU,GACpKG,KAAoB,CAAC7vC,GAAI,GAAIr5B,KAAM,OAAuByoE,aAAc,EAAGC,SAAUJ,GAASY,KAAQN,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKI,WAAoB,CAAC9vC,GAAI,GAAIr5B,KAAM,aAAuByoE,aAAc,EAAGC,SAAUJ,GAASc,MAAQR,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKM,UAAoB,CAAChwC,GAAI,GAAIr5B,KAAM,YAAuByoE,aAAc,EAAGC,SAAUJ,GAASgB,KAAQV,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKQ,WAAoB,CAAClwC,GAAI,GAAIr5B,KAAM,aAAuByoE,aAAc,EAAGC,SAAUJ,GAASkB,MAAQZ,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKU,SAAoB,CAACpwC,GAAK,EAAGr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKY,SAAoB,CAACtwC,GAAK,EAAGr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKa,SAAoB,CAACvwC,GAAK,EAAGr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKc,SAAoB,CAACxwC,GAAK,EAAGr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKe,UAAoB,CAACzwC,GAAI,GAAIr5B,KAAM,kBAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAS,EAAOC,QAAQ,EAAOC,SAAiB,GAAIC,SAAU,GACpKgB,WAAoB,CAAC1wC,GAAI,GAAIr5B,KAAM,aAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAS,EAAOC,QAAQ,EAAOC,SAAiB,GAAIC,SAAU,GACpKiB,WAAoB,CAAC3wC,GAAI,GAAIr5B,KAAM,aAAuByoE,aAAc,EAAGC,SAAUJ,GAASK,KAAQC,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKkB,mBAAoB,CAAC5wC,GAAI,GAAIr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKmB,mBAAoB,CAAC7wC,GAAI,GAAIr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKoB,mBAAoB,CAAC9wC,GAAI,GAAIr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKqB,mBAAoB,CAAC/wC,GAAI,GAAIr5B,KAAM,SAAuByoE,aAAc,EAAGC,SAAUJ,GAASoB,OAAQd,SAAS,EAAOC,QAAQ,EAAOC,cAAU1Y,EAAW2Y,SAAU,GACpKsB,aAAoB,CAAChxC,GAAI,GAAIr5B,KAAM,sBAAuByoE,aAAc,EAAGC,SAAUJ,GAASgC,KAAQ1B,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKwB,SAAoB,CAAClxC,GAAI,GAAIr5B,KAAM,WAAuByoE,aAAc,EAAGC,SAAUJ,GAASgC,KAAQ1B,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,GACpKyB,cAAoB,CAACnxC,GAAI,GAAIr5B,KAAM,gBAAuByoE,aAAc,EAAGC,SAAUJ,GAASkB,MAAQZ,SAAS,EAAOC,QAAS,EAAMC,cAAU1Y,EAAW2Y,SAAU,ICtC/J,MAAM0B,GAIX1qE,WAAAA,CAAYs5B,EAAYr5B,EAAc8mE,GAAwB,KAHrDztC,QAAE,OACFr5B,UAAI,OACJ8mE,mBAAa,EAEpBtjE,KAAK61B,GAAKA,EACV71B,KAAKxD,KAAOA,EACZwD,KAAKsjE,cAAgBA,CACvB,EAGK,MAAM4D,GAAe,IAAID,GAC9B,wBACA,eACA,MAEWE,GAAc,IAAIF,GAC7B,uBACA,cACA,MAEWG,GAAe,IAAIH,GAC9B,wBACA,eACA,MAEWI,GAAa,IAAIJ,GAC5B,sBACA,aACA,MAE0B,IAAIA,GAC9B,wBACA,eACA,MAEiB,IAAIA,GAAiB,gBAAiB,MAAO,MAEzD,SAASK,GAAgBpU,GAC9B,OAAQA,GACN,IAAK,OACH,OAAOgU,GACT,IAAK,MACH,OAAOC,GACT,IAAK,OACH,OAAOC,GAEb,CAQO,MAAMG,GAAgBhrE,WAAAA,GAAA,KACnBs5B,GAAa,CAAE,CACvB8f,MAAAA,CACEp1C,GAEA,MAAO,CAAEinE,OAAO,KAAUjnE,EAAMs1B,GAAI71B,KAAK61B,KAC3C,EC9CK,SAAS4xC,GACdpqE,EACAqlE,GAEA,IAAK,IAAI1lE,EAAI,EAAGA,EAAIK,EAAGH,OAAS,EAAGF,IACjC0lE,EAAGrlE,EAAGL,GAAIK,EAAGL,EAAI,GAAIA,EAEzB,CACO,SAAS0qE,GACdrqE,EACAqlE,GAEA,MAAMiF,EAAc,GAEpB,OADAF,GAASpqE,GAAI,CAAC4O,EAAGC,EAAGlP,IAAM2qE,EAAOjqE,KAAKglE,EAAGz2D,EAAGC,EAAGlP,MACxC2qE,CACT,CAEO,SAASC,GAAgBvqE,GAC9B,OAAOA,EAAG4wD,QAAQv9C,GAAMA,GAC1B,CC/BO,SAASm3D,GACdC,EACA7Z,GAEA,IAAK,IAAIx4C,EAAK,EAAGA,EAAKqyD,EAAKC,WAAW7qE,OAAQuY,IAAM,CAClD,MAAMuyD,EAAQF,EAAKC,WAAWtyD,GACxB9U,EAAQmnE,EAAKjyC,IAAMmyC,EAAM9qE,OAAS,GACxC,IAAK,IAAIF,EAAI2D,EAAO3D,EAAIgrE,EAAM9qE,OAAQF,IACpC,GAAIixD,KAAU+Z,EAAMhrE,IAClB,OAAOgrE,EAAMhrE,GAGjB,IAAK,IAAIA,EAAI,EAAGA,EAAI2D,EAAO3D,IACzB,GAAIixD,KAAU+Z,EAAMhrE,IAClB,OAAOgrE,EAAMhrE,EAGnB,CAEF,CAkCA,SAASirE,GACPC,EACAJ,EACAre,EACA0J,EACAgV,EACA1yD,EACA2yD,GAEA,MAAMC,EAAaT,GACjBE,EAAKC,WAAWtyD,GAAI+zC,KAAI+D,IAAa,IAAD+a,EAAA,IAAVlsE,EAAGsO,GAAE6iD,EAC7B,MAAMhgD,EAAI26D,EAAOK,MAAM/sE,IAAIY,EAAGsO,GAC9B,IACgB,KAAb,OAAD6C,QAAC,IAADA,OAAC,EAADA,EAAG83D,UACF8C,EAAS/rE,EAAGsO,EAAG6C,IAEJ,QAFM+6D,EAClBJ,EAAOM,cACJhtE,IAAIY,EAAGsO,UAAE,IAAA49D,GADZA,EAEIG,MAAK,CAACC,EAAG1rE,IAAMA,IAAM8qE,EAAKjyC,IAA+B,SAAzBqyC,EAAOS,MAAM3rE,GAAG4rE,OAEpD,OAAO,KAET,MAAMC,EAASnU,EAAKoU,MAClBtb,IAAA,IAAAub,EAAAC,EAAA,IAAE79D,EAAIC,GAAGoiD,EAAA,OACyB,QAAhCub,EAAAb,EAAOK,MAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAA29D,OAAA,EAAhCA,EAAkC1D,UACM,QAAxC2D,EAAAd,EAAOM,cAAchtE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAA49D,OAAA,EAAxCA,EAA2ClB,EAAKjyC,OAAQuyC,CAAG,IAE/D,OAAKS,EAGE,CAACzsE,EAAGsO,EAAGm+D,GAFL,IAEY,KAGzB,OAAO1V,EACJ5E,QAAQ8Z,GACRpa,QAAO,CAACya,EAAG1rE,IAAMA,EAAIysD,IACrBD,KAAIsE,IAAyB,IAAvBmb,EAAIC,GAAKt5D,EAAIupD,IAAIrL,EAOtB,OAAOoT,GAAS,CAAE9kE,EALhB6sE,EAAK9V,EAAI7F,QAAQ,CAAEl+C,IAAY,IAAPQ,EAAW,EAAI,OAAWA,EAAK,EAAI,IAAO,GAK/ClF,EAHnBw+D,EAAK/V,EAAI7F,QAAQ,CAAEl+C,IAAY,IAAP+pD,EAAW,EAAI,OAAWA,EAAK,EAAI,IAAO,GAG5CqH,QAAS,CAFtByI,GAAa,IAAPr5D,EAAWujD,EAAI7F,QAAQ,CAAEzrB,KAAM,EAAGzyB,IAAK,KAAa,EAANQ,GACpDs5D,GAAa,IAAP/P,EAAWhG,EAAI7F,QAAQ,CAAEzrB,KAAM,EAAGzyB,IAAK,KAAa,EAAN+pD,KACnB,GAElD,CClGA,MAAMgQ,GAAwB,CAC5B7W,KAAMA,CAACoW,EAAGU,EAAI77D,KAAOA,EAAE63D,QACvBtS,IAAKA,CAAC4V,EAAGU,EAAI77D,IAAMA,IAAMw3D,GAAKS,KAC9BzS,KAAMA,CAAC2V,EAAGU,EAAI77D,IAAMA,IAAMw3D,GAAKU,OAK3B4D,GAAe,CACnBC,MD6BK,SACLpB,EACAJ,EACAre,EACA0J,EACAgV,GAEA,IAAK,IAAI1yD,EAAK,EAAGA,EAAKqyD,EAAKC,WAAW7qE,OAAQuY,IAAM,CAClD,MAAMnI,EAAI26D,GAAgBC,EAAQJ,EAAMre,EAAO0J,EAAKgV,EAAU1yD,EAAIA,EAAK,GACvE,GAAInI,EAAEpQ,OACJ,OAAOoQ,CAEX,CACA,MAAO,EACT,EC1CEi8D,MDYK,SACLrB,EACAJ,EACAre,EACA0J,EACAgV,GAEA,IAAK,IAAI1yD,EAAKqyD,EAAKC,WAAW7qE,OAAS,EAAGuY,GAAM,EAAGA,IAAM,CACvD,MAAMnI,EAAI26D,GAAgBC,EAAQJ,EAAMre,EAAO0J,EAAKgV,EAAU1yD,EAAIA,EAAK,GACvE,GAAInI,EAAEpQ,OACJ,OAAOoQ,CAEX,CACA,MAAO,EACT,GCvBO,SAASk8D,GACdjpE,EACA4yD,EACA1J,GAEC,IADDggB,EAA4B1pE,UAAA7C,OAAA,QAAA0vD,IAAA7sD,UAAA,GAAAA,UAAA,GAAG,QAE/B,IAAKQ,EAAK2nE,OAAO36B,QAAQmmB,YACvB,OAEF,MAAMoQ,EAAWwD,GAAgB/mE,EAAK2nE,OAAO36B,QAAQ2lB,OAC/CiV,EAAWgB,GAAsB5oE,EAAK2nE,OAAO36B,QAAQ2lB,OACrD5lD,EAAI+7D,GAAaI,GACrBlpE,EAAK2nE,OACL3nE,EAAKunE,KACLre,EACA0J,EACAgV,GACA3e,KAAKvtC,GACL1b,EAAKmpE,gBAAgB/zB,OAAO,IAAK15B,EAAK6nD,WAAU0D,OAAO,MAEzDjnE,EAAKopE,UAAUjsE,QAAQ4P,EACzB,CAEO,SAASs8D,GACdrpE,EACA6T,GAIC,IAADy1D,EAAAC,EACA,MAAM3W,EAAM5yD,EAAK2nE,OAAOjV,KAAK9D,eAAe5uD,EAAKunE,KAAKjyC,IAChDroB,EACO,QADNq8D,EACD,OAAJz1D,QAAI,IAAJA,OAAI,EAAJA,EAAMq1C,aAAK,IAAAogB,EAAAA,EACV1W,EAAI9F,OAAO9sD,EAAK2nE,OAAO36B,QAAQ,GAAD3I,OAAIrkC,EAAKunE,KAAKc,KAAI,uBAC7C,EACA,EAMN,IALA,IAAIP,EACc,QADJyB,EACR,OAAJ11D,QAAI,IAAJA,OAAI,EAAJA,EAAMi0D,kBAAU,IAAAyB,EAAAA,EAChBvpE,EAAKunE,KAAKC,WAAWgC,SAAS/B,GAC5BA,EAAM/Z,QAAQhyC,GAAQ1b,EAAKgoE,MAAM/sE,OAAOygB,KAAS8oD,GAAKC,UAEjDhoE,EAAI,EAAGA,GAAKwQ,GAAO66D,EAAWnrE,OAAQF,IAAK,CAClD,MAAOZ,EAAGsO,GAAKyoD,EAAIxF,cAAc0a,GAEjC,GADA9nE,EAAKgoE,MAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKuB,WACtBtpE,IAAMwQ,EACR,OAGF66D,EAAaA,EAAWpa,QACtBV,IAAA,IAAEyc,EAAIn4D,GAAG07C,EAAA,OAAKyc,EAAK5tE,EAAI,GAAK4tE,EAAK5tE,EAAI,GAAKyV,EAAKnH,EAAI,GAAKmH,EAAKnH,EAAI,CAAC,GAEtE,CACF,CCxEO,MAAMu/D,GAEX1tE,WAAAA,CAAY2tE,GAAmB,KADtBA,cAAQ,EAEflqE,KAAKkqE,SAAWA,CAClB,CAEA,OAAIpgE,GACF,OAAO9J,KAAKkqE,SAASvvD,QAAQ,EAC/B,EAGK,MAAMwvD,GAGX5tE,WAAAA,CAAY2tE,EAAkBE,GAAuB,KAF5CF,cAAQ,OACRE,kBAAY,EAEnBpqE,KAAKkqE,SAAWA,EAChBlqE,KAAKoqE,aAAeA,CACtB,CAEA,OAAItgE,GACF,MAAM,GAAN86B,OAAU5kC,KAAKkqE,SAASvvD,QAAQ,GAAE,KAAAiqB,OAAI5kC,KAAKoqE,aAAazvD,QAAQ,GAClE,ECfF,MAAM0vD,GAAsC,MAC1C,MAAM/8D,EAAY,GAIlB,OAHAA,EAAEy3D,GAAKW,KAAK7vC,KAAM,EAClBvoB,EAAEy3D,GAAKY,WAAW9vC,KAAM,EACxBvoB,EAAEy3D,GAAKc,UAAUhwC,KAAM,EAChBvoB,CACR,EAN2C,GAUrC,SAAS8hD,GACdkb,EAA2C/c,GAU1C,IATD,OACE2a,EAAM,KACNJ,EAAI,WACJyC,GAKDhd,EAED,MAAM4F,EAAM+U,EAAOjV,KAAK7D,gBAAgB0Y,EAAKjyC,IAIvC20C,EAASrX,EAAI7F,QAAQ,CAAEzrB,IAAK,GAAKzyB,IAAK,KAE5C04D,EAAKC,WACFgC,SAAS/B,GAAUA,IACnB/Z,QACEwc,IAAK,IAAAC,EAAA3B,EAAA,OACHwB,EAAW/uE,OAAOivE,IACnBJ,GAAiD,QAA/BK,EAA2B,QAA3B3B,EAACb,EAAOK,MAAM/sE,OAAOivE,UAAM,IAAA1B,OAAA,EAA1BA,EAA4BlzC,UAAE,IAAA60C,EAAAA,GAAK,IACtDvX,EAAI9F,OAAOmd,EAAO,IAErB5nD,SAAS6nD,IACR,MAAMP,EAAW/W,EAAIzF,QAAQ,IACxB4c,EACHr+D,EA/BS,GA+BKu+D,EACdt+D,EAhCS,IAgCM,EAAIs+D,KAErBD,EAAWzuE,OAAO2uE,EAAO,IAAIR,GAAUC,GAAU,GAEvD,CCxCA,MAAMS,GAAW,CACf,CAAC5F,GAAKgB,WAAWlwC,KAAK,EACtB,CAACkvC,GAAKc,UAAUhwC,KAAK,EACrB,CAACkvC,GAAKY,WAAW9vC,KAAK,EACtB,CAACkvC,GAAKW,KAAK7vC,KAAK,GAIlB,SAAS+0C,GACPC,EACAC,EACA3X,EACAoV,EACAwC,EACAC,EACAvhB,GAEA,IAAK,IAAIwhB,EAAYxhB,EAAOwhB,EAAY,EAAGA,IAAa,CAAC,IAADC,EAAAC,EACtD,MAAO/uE,EAAGsO,GAAKmgE,IACTt9D,EAAmB,QAAlB29D,EAAG3C,EAAM/sE,IAAIY,EAAGsO,UAAE,IAAAwgE,EAAAA,EAAInG,GAAKgB,WAClC,GACEkF,GAAa,IACZ19D,IAAMw3D,GAAKgB,YACTx4D,EAAEsoB,MAAM80C,IAAYG,EAAW,GAAK3X,EAAI9F,OAAOyd,IAClD,CACAvC,EAAMzsE,IAAIM,EAAGsO,EAAGsgE,GAChBC,GAAa,EACb,QACF,CACI19D,IAAMw3D,GAAKgB,YACbwC,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKY,YAEvB,MAAMr4D,EAAsB,QAArB69D,EAAGJ,EAASvvE,IAAIY,EAAGsO,UAAE,IAAAygE,EAAAA,EAAI,EAC5B79D,GAAK,GAAKC,EAAEsoB,MAAM80C,IACpBpC,EAAMzsE,IAAIM,EAAGsO,EAAGsgE,GAChBD,EAASjvE,IAAIM,EAAGsO,EAAG4C,EAAI,IAEvBy9D,EAASjvE,IAAIM,EAAGsO,EAAG4C,EAAI,EAE3B,CACF,CAEO,SAAS89D,GACd7qE,EACA6T,GAKC,IAADi3D,EAAAC,EAAAzB,EACA,MAAM1W,EAAM5yD,EAAK2nE,OAAOjV,KAAKhE,cAAc1uD,EAAKunE,KAAKjyC,IACrD,OAAO+0C,GACc,QADNS,EACT,OAAJj3D,QAAI,IAAJA,OAAI,EAAJA,EAAMy2D,qBAAa,IAAAQ,EAAAA,EAAIE,GAAqBpY,EAAK5yD,GACnC,QADwC+qE,EAClD,OAAJl3D,QAAI,IAAJA,OAAI,EAAJA,EAAM02D,gBAAQ,IAAAQ,EAAAA,EAAI/qE,EAAK2nE,OAAO36B,QAAQ,GAAD3I,OAAIrkC,EAAKunE,KAAKc,KAAI,oBACvDzV,EACA5yD,EAAKgoE,MACLhoE,EAAKkjE,SACLsB,GAAK8B,aACM,QADMgD,EACb,OAAJz1D,QAAI,IAAJA,OAAI,EAAJA,EAAMq1C,aAAK,IAAAogB,EAAAA,EACTtpE,EAAKunE,KAAKrE,SACRljE,EAAKunE,KAAK0D,UAAUC,qBAAqBlrE,EAAKunE,KAAK4D,UAE3D,CAEO,SAASC,GACdprE,EACA6T,GAKC,IAADw3D,EAAAC,EAAAC,EACA,MAAM3Y,EAAM5yD,EAAK2nE,OAAOjV,KAAK/D,SAAS3uD,EAAKunE,KAAKjyC,IAChD,OAAO+0C,GACc,QADNgB,EACT,OAAJx3D,QAAI,IAAJA,OAAI,EAAJA,EAAMy2D,qBAAa,IAAAe,EAAAA,EAAIL,GAAqBpY,EAAK5yD,GACnC,QADwCsrE,EAClD,OAAJz3D,QAAI,IAAJA,OAAI,EAAJA,EAAM02D,gBAAQ,IAAAe,EAAAA,EAAItrE,EAAK2nE,OAAO36B,QAAQ,GAAD3I,OAAIrkC,EAAKunE,KAAKc,KAAI,gBACvDzV,EACA5yD,EAAKgoE,MACLhoE,EAAKijE,IACLuB,GAAKgC,SACM,QADE+E,EACT,OAAJ13D,QAAI,IAAJA,OAAI,EAAJA,EAAMq1C,aAAK,IAAAqiB,EAAAA,EAAIvrE,EAAKunE,KAAKtE,IAE7B,CAEO,SAASuI,GAAkBxrE,GAKhC,OAAOA,EAAKunE,KAAKkE,WAAWjC,SAAS/B,GACnCA,EACGxe,KAAK8E,IAAU,IAAD2d,EACb,MAAMC,EAA8B,QAA1BD,EAAG1rE,EAAKgoE,MAAM/sE,OAAO8yD,UAAK,IAAA2d,EAAAA,EAAIlH,GAAKgB,WAC7C,GAAImG,IAASnH,GAAKgB,WAAY,CAC5B,IAAIoG,EAAoB,EACpBC,EAAiB,EACrB,IAAK,MAAMhqE,KAAUsyD,EAAM,CAAC,IAAD2X,EACzB,MAAMC,EACqC,QAD7BD,EACZ9rE,EAAKgoE,MAAM/sE,OAAOo5D,EAAStG,EAAMlsD,WAAQ,IAAAiqE,EAAAA,EAAItH,GAAKgB,WAChDuG,IAAavH,GAAKiC,cACpBmF,IACSG,IAAavH,GAAKgB,YAC3BqG,GAEJ,CAGA,MAAO,CAAE9d,OAAMJ,IADbie,EAAoBC,GAAkB,EAAI,EAAIA,EAElD,CACA,OACEF,IAASnH,GAAKW,MACdwG,IAASnH,GAAKY,YACduG,IAASnH,GAAKc,UAEP,CAAEvX,OAAMJ,IAAK,GAEf,CAAEI,OAAMJ,IAAK,EAAG,IAExBD,QAAOV,IAAA,IAAC,IAAEW,GAAKX,EAAA,OAAKW,EAAM,CAAC,IAC3B1E,KAAIgE,IAAoB,IAAD+e,EAAAC,EAAAC,EAAAC,EAAA,IAAlB,KAAEpe,EAAI,IAAEJ,GAAKV,EAKjB,MAAO,CAAEc,OAAMJ,IAAKA,IAH6C,QAD3Cqe,EACkB,QADlBC,EACpBjsE,EAAK2nE,OAAOM,cAAchtE,OAAO8yD,UAAK,IAAAke,OAAA,EAAtCA,EAAwCpe,QAAQ19C,GAAMA,EAAI,GAAG,UAAE,IAAA67D,EAAAA,EAAI,IAEJ,QAD3CE,EACkB,QADlBC,EACpBnsE,EAAK2nE,OAAOyE,cAAcnxE,OAAO8yD,UAAK,IAAAoe,OAAA,EAAtCA,EAAwCte,QAAQ19C,GAAMA,EAAI,GAAG,UAAE,IAAA+7D,EAAAA,EAAI,IACJ,KAGzE,CAEO,SAASG,GACdC,EACAtE,GAEA,OAAOsE,EAAU5e,QAAOH,IAAa,IAAX1xD,EAAGsO,GAAEojD,EAC7B,MAAMvgD,EAAIg7D,EAAM/sE,IAAIY,EAAGsO,GACvB,OAAO6C,IAAMw3D,GAAKW,MAAQn4D,IAAMw3D,GAAKY,YAAcp4D,IAAMw3D,GAAKc,SAAS,GAE3E,CAEO,SAAS0F,GACdpY,EACA5yD,GAMA,MAAMytD,EAAO4e,GACXrsE,EAAKunE,KAAKC,WAAWgC,SAAS/B,GAAUA,IACxCznE,EAAKgoE,OAEP,GAAIva,EAAK9wD,OAAS,EAChB,MAAO,IAAMi2D,EAAIxF,cAAcK,GAEjC,MAAM8e,EAAQf,GAAkBxrE,GAChC,GAAIusE,EACF,MAAO,IAAM3Z,EAAIpF,eAAe+e,GAElC,MAAM,IAAI3sE,MAAM,4BAClB,CAEO,SAAS4sE,GACdtjB,GAEA,OAAQlpD,IACN,MAAM4yD,EAAM5yD,EAAK2nE,OAAOjV,KAAKlE,kBAAkBxuD,EAAKunE,KAAKjyC,IACnDroB,EACC,OAALi8C,QAAK,IAALA,EAAAA,EACC0J,EAAI9F,OACgB,SAAnB9sD,EAAKunE,KAAKc,KACNroE,EAAK2nE,OAAO36B,QAAQglB,0BACpBhyD,EAAK2nE,OAAO36B,QAAQilB,2BAEtB,EACA,EACN,GAAIhlD,EAAI,EACN,IAAK,IAAIxQ,EAAI,EAAGA,EAAIwQ,EAAGxQ,IAAK,CAC1B,MAAMgxD,EAAO+d,GAAkBxrE,GAAM0tD,QAAOwH,IAAA,IAAC,IAAEvH,GAAKuH,EAAA,OAAKvH,GAAO,CAAC,IACjE,GAAoB,IAAhBF,EAAK9wD,OACPs7C,QAAQ1mB,IAAI,4CAA6CvxB,EAAKunE,UACzD,CACL,MAAO1rE,EAAGsO,GAAKyoD,EAAIpF,eAAeC,GAClCztD,EAAKgoE,MAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKiC,cAC5B,CACF,CACF,CAEJ,CAEO,SAASgG,GAAgBrX,GAU5B,IAV6B,MAC/B4S,EAAK,SACL9E,EAAQ,UACRwJ,EAAS,SACTC,GAMDvX,EACKroD,EAAI,EAKR,OAJK,OAALi7D,QAAK,IAALA,GAAAA,EAAO3lD,SAASrV,GAAOD,GAAKC,EAAE03D,eACtB,OAARxB,QAAQ,IAARA,GAAAA,EAAU7gD,SAASuqD,GAAQ7/D,GAAK6/D,IACvB,OAATF,QAAS,IAATA,GAAAA,EAAWrqD,SAAS1W,GAAOoB,GAAKpB,EAAE43D,SAASL,WACnC,OAARyJ,QAAQ,IAARA,GAAAA,EAAUtqD,SAAS7lB,GAAOuQ,GAAKvQ,EAAE+mE,SAASL,WACnCn2D,CACT,CAEO,SAAS8/D,GAAWC,GAMvB,IANwB,MAC1B9E,EAAK,IACL/E,GAID6J,EACK//D,EAAI,EAGR,OAFK,OAALi7D,QAAK,IAALA,GAAAA,EAAO3lD,SAASrV,GAAOD,GAAKC,EAAEg4D,WAC3B,OAAH/B,QAAG,IAAHA,GAAAA,EAAK5gD,SAASuqD,GAAQ7/D,GAAK6/D,IACpB7/D,CACT,CCvNO,MAAOggE,GAAsBC,IAClC,CACE,CACEC,oBAAqB,0BACrBC,uBAAwB,6BACxBC,YAAa,mBAEf,CACEF,oBAAqB,0BACrBC,uBAAwB,6BACxBC,YAAa,oBAGjBlkB,KACA+D,IAAA,IAAC,oBAAEigB,EAAmB,uBAAEC,EAAsB,YAAEC,GAAangB,EAAA,MAC1D,CACCmgB,YAAalgB,IAAA,IAAC,OAAE0a,GAAQ1a,EAAA,OAAK0a,EAAO36B,QAAQmgC,EAAY,EACxDC,gBAAiB7f,IAAA,IAAC,KAAEga,GAAMha,EAAA,OAAKga,EAAK8F,gBAAkB9F,EAAK+F,SAAS,EACpEpC,qBAAsBA,IAAM,EAC5BjI,IAAK/N,IAAA,IAAC,KAAEqS,GAAMrS,EAAA,OAAKqS,EAAKgG,YAAchG,EAAK+F,SAAS,EACpDjf,MAAOA,KAAe,EACtBG,kBAAmBge,KACnB/d,eAAgBA,OAChBC,cAAgB1uD,GACP6qE,GAAiB7qE,GAE1B2uD,SAAW3uD,GACForE,GAAYprE,GAErB4uD,eAAe5uD,GACNqpE,GAAkBrpE,GAE3B6uD,gBAAkB7uD,IAEdA,EAAK2nE,OAAOjV,KACT7D,gBAAgB7uD,EAAKunE,KAAKjyC,IAC1Bw3B,OAAO9sD,EAAK2nE,OAAO36B,QAAQigC,KAE9Bpe,GAAgB7uD,EAAK2nE,OAAO36B,QAAQkgC,GAAyBltE,EAC/D,EAEF8uD,aAAe9uD,GFHd,SACL2pE,EACAE,EAAoB5c,GAUnB,IATD,OACE0a,EAAM,KACNJ,EAAI,QACJiG,GAKDvgB,EAED,GAAIsa,EAAKkG,WAAY,CACnB,MAAM7uC,EAAQ,IAAIgrC,GAAQD,EAAUE,GACpCtC,EAAKC,WAAWnlD,SAASolD,GACvBA,EAAMplD,SAAS6nD,IAAW,IAADwD,GACqB,KAAd,QAA1BA,EAAA/F,EAAOK,MAAM/sE,OAAOivE,UAAM,IAAAwD,OAAA,EAA1BA,EAA4B7I,UAC9B2I,EAAQjyE,OAAO2uE,EAAOtrC,EACxB,KAGN,CACF,CEpB8BkwB,CAAa,GAAI,GAAI9uD,GAC7C+uD,cAAeA,OACf4e,WAAYA,KAAe,EAC3B5I,cAAU1Y,EACVyD,cAAeA,KAAe,EAC9Bb,OAAQA,KAAe,EACvBC,mBAAoBA,KAAe,EACnCC,gBAAiBA,KACnB,EAAC,ICxDE,MAAMye,GAGX5xE,WAAAA,CAAY6H,GAAuC,KAF3CA,UAAI,EAGVpE,KAAKoE,KAAO,IAAIuvB,IAAIvvB,EACtB,CAEAmQ,IAAAA,GACE,OAAO,IAAI45D,GAAYnuE,KAAKoE,KAC9B,CAEA5I,GAAAA,CAAIY,EAAWsO,GACb,OAAO1K,KAAKoE,KAAK5I,IAAI,GAADopC,OAAIxoC,EAAC,KAAAwoC,OAAIl6B,GAC/B,CAEA5O,GAAAA,CAAIM,EAAWsO,EAAW7O,GACxBmE,KAAKoE,KAAKtI,IAAI,GAAD8oC,OAAIxoC,EAAC,KAAAwoC,OAAIl6B,GAAK7O,EAC7B,CAEA,QAAIyhD,GACF,OAAOt9C,KAAKoE,KAAKk5C,IACnB,CAEA,UAAI8wB,GACF,MAAM9gE,EAAqB,CAAC,EAa5B,OAZAtN,KAAK4iB,SAAQ,CAAC8lD,EAAGtsE,EAAGsO,KACZtO,GAAKkR,EAAEs1B,KAEAxmC,EAAI,GAAKkR,EAAEiP,QACtBjP,EAAEiP,MAAQngB,EAAI,GAFdkR,EAAEs1B,KAAOxmC,EAILsO,GAAK4C,EAAEw1B,IAEAp4B,EAAI,GAAK4C,EAAE+gE,SACtB/gE,EAAE+gE,OAAS3jE,EAAI,GAFf4C,EAAEw1B,IAAMp4B,CAGV,IAEK4C,CACT,CAEAsV,OAAAA,CAAQ8/C,GACN1iE,KAAKoE,KAAKwe,SAAQ,CAAC7lB,EAAGsQ,KACpB,MAAOjR,EAAGsO,GAAK2C,EAAEsV,MAAM,KACvB+/C,EAAG3lE,EAAGke,SAAS7e,GAAI6e,SAASvQ,GAAG,GAEnC,CAEA8+C,GAAAA,CAAOkZ,GACL,MAAMiF,EAAc,GAEpB,OADA3nE,KAAK4iB,SAAQ,kBAAa+kD,EAAOjqE,KAAKglE,KAAG3iE,WAAS,IAC3C4nE,CACT,CAEAoC,OAAAA,CAAWrH,GACT,MAAMiF,EAAc,GAEpB,OADA3nE,KAAK4iB,SAAQ,kBAAa+kD,EAAOjqE,QAAQglE,KAAG3iE,WAAS,IAC9C4nE,CACT,CAEAvZ,MAAAA,CACEsU,EACA5gE,GAEA,IAAI6lE,EAAY7lE,EAEhB,OADA9B,KAAK4iB,SAAQ,mBAAA0rD,EAAAvuE,UAAA7C,OAAIqD,EAAI,IAAAoH,MAAA2mE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJhuE,EAAIguE,GAAAxuE,UAAAwuE,GAAA,OAAM5G,EAASjF,EAAGiF,KAAWpnE,EAAK,IAChDonE,CACT,EC7CK,SAAS6G,GAAYjhB,EAAAC,GAWzB,IAVD,KACE+N,EAAI,GACJxoD,EAAE,MACFohC,GAKDoZ,GACD,OAAE2a,EAAM,KAAEJ,EAAI,MAAES,GAAwD/a,EAExE,MAAMihB,EAAS,IAAIN,GACbO,EAAU,IAAIP,GACdhb,EAAM+U,EAAOjV,KAAKjE,eAAe8Y,EAAKjyC,IACtC8xC,EAAqB,GAE3BlqE,EAAM,IAAK,IAAIgY,EAAS,OAAJ8lD,QAAI,IAAJA,EAAAA,EAAQ,EAAG9lD,GAAQ,OAAF1C,QAAE,IAAFA,EAAAA,EAAM+0D,EAAKC,WAAW7qE,QAASuY,IAAM,CACxEqyD,EAAKC,WAAWtyD,EAAK,GAAGmN,SAAQkrC,IAAA,IAAE1xD,EAAGsO,GAAEojD,EAAA,OAAK4gB,EAAQ5yE,IAAIM,EAAGsO,EAAG+K,EAAG,IAEjE,IAAK,MAAOrZ,EAAGsO,KAAMyoD,EAAI5E,QAAQuZ,EAAKC,WAAWtyD,GAAI0H,SAEnDstD,EAAO,IAAK,IAAIztE,EAAI,EAAGA,EAAIm3C,EAAMj3C,OAAQF,IAAK,CAC5C,MAAM0lE,EAAKvuB,EAAMn3C,GAEjB,IAAK,MAAMyjE,KAAU/L,EAAM,CACzB,MAAOvpD,EAAIC,GAAMq1D,EAEjB,GAAIiO,EAAQlzE,IAAIY,EAAI+O,EAAIT,EAAIU,KAAQqK,EAClC,SAGF,MAAMvJ,EAAIw2D,EAAG,CAAEtmE,IAAGsO,IAAG+1D,WAErB,IACEv0D,EAAE63D,WAAW0E,MACXhT,IAAA,IAAEr5D,EAAGsO,GAAE+qD,EAAA,OAAKgZ,EAAOjzE,IAAIY,EAAGsO,IAAM69D,EAAM/sE,IAAIY,EAAGsO,KAAOq6D,GAAKC,KAAK,MAOhE94D,EAAE43D,WAAaO,IACfkE,EAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,KAAQ25D,GAAKU,OAFrC,CAUA,GAHAkC,EAAOjqE,KAAKwO,GACZA,EAAE63D,WAAWnhD,SAAQ+yC,IAAA,IAAEv5D,EAAGsO,GAAEirD,EAAA,OAAK8Y,EAAO3yE,IAAIM,EAAGsO,GAAG,EAAK,IACvDypC,EAAMuR,OAAO1oD,EAAG,GACK,IAAjBm3C,EAAMj3C,OACR,MAAMO,EAER,MAAMgtE,CARN,CASF,CACF,CAEJ,CACA,OAAO9C,CACT,CCvEO,SAASgH,GAAUC,EAA8BC,GACtDA,GAAkB,EAClB,MAAMC,EAAaF,EAAOxgB,QAAO,CAAC7gD,EAACggD,KAAA,IAAE,MAAE7xC,GAAO6xC,EAAA,OAAKhgD,EAAImO,CAAK,GAAE,GACxDqzD,EAAcH,EAAOxgB,QAAO,CAAC7gD,EAACigD,KAAA,IAAE,OAAEwhB,GAAQxhB,EAAA,OAAKjgD,EAAIyhE,CAAM,GAAE,GAC3DC,EAAYL,EAAOxgB,QAAO,CAAC7gD,EAACugD,KAAA,IAAE,KAAEohB,GAAMphB,EAAA,OAAKvgD,EAAI2hE,CAAI,GAAE,GAC3D,IAAIC,EAAa,EACbC,EAAe,EACfP,EAASC,GAAcC,EAAc,EAWvCK,GACGN,EAAaD,GACdD,EAAOxgB,QAAO,CAAC7gD,EAACkoD,KAAA,IAAE,MAAE/5C,EAAK,OAAEszD,GAAQvZ,EAAA,OAAKloD,EAAImO,EAAQszD,CAAM,GAAE,GACrDH,EAASC,GAAcG,EAAY,IAO5CE,GAAcN,EAASC,GAAcG,GAGvC,IAAItH,EAAS,GACTx4D,EAAI,EACR,IAAK,MAAM,GAAE+1B,EAAE,MAAExpB,EAAK,OAAEszD,EAAM,KAAEE,KAAUN,EAExC,IADAz/D,EAAIA,EAAIuM,EAAQrP,KAAK+C,IAAI,EAAG,EAAI4/D,EAASI,GAAgBF,EAAOC,EACzD9iE,KAAKgjE,MAAMlgE,GAAK,GACrBw4D,EAAOjqE,KAAKwnC,GACZ/1B,GAAK,EAIT,OAAOw4D,CACT,CCvDA,SAAS2H,GAAE/hB,GAgBe,IAhBd,MACVvuD,EAAK,KACLuwE,EAAI,UACJC,EAAS,SACTC,EAAQ,UACRC,EAAS,MACTC,EAAK,KACL5c,GASDxF,EACC,MAAMjgD,EAAiB,GAsBvB,OArBItO,IACFsO,EAAEy3D,GAAKC,MAAMnvC,IAAM72B,GAEjBuwE,IACFjiE,EAAEy3D,GAAKW,KAAK7vC,IAAM05C,GAEhBC,IACFliE,EAAEy3D,GAAKY,WAAW9vC,IAAM25C,GAEtBC,IACFniE,EAAEy3D,GAAKc,UAAUhwC,IAAM45C,GAErBC,IACFpiE,EAAEy3D,GAAKgB,WAAWlwC,IAAM65C,GAEtBC,IACFriE,EAAEy3D,GAAKU,MAAM5vC,IAAM85C,GAEjB5c,IACFzlD,EAAEy3D,GAAKS,KAAK3vC,IAAMk9B,GAEZ3sD,IAAS,IAAAwpE,EAAA,OAAc,QAAdA,EAAKtiE,EAAElH,EAAIyvB,WAAG,IAAA+5C,EAAAA,EAAI,IAAI,CACzC,CAEA,SAASC,GAAkB98D,GACzB,OAAOu8D,GAAG,CACRtwE,MAAO+T,EACPw8D,KAAMx8D,EACNy8D,UAAWz8D,EACX08D,SAAU18D,EACV28D,UAAW38D,GAEf,CAEO,MAKM+8D,GACX,mBAAAC,EAAAhwE,UAAA7C,OAAoBqD,EAAI,IAAAoH,MAAAooE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJzvE,EAAIyvE,GAAAjwE,UAAAiwE,GAAA,MACxB,CAAC5pE,EAAQ+sD,IACPA,EAAIpF,eAAextD,EAAnB4yD,CAAyB/sD,EAAK+sD,EAAK,EAEjC8c,GAAS,CAEbC,KAAMA,IAAM,KAEZC,aAAcA,IAAMpL,GAAKC,MACzBoL,YAAaA,IAAMrL,GAAKW,KACxB2K,kBAAmBA,IAAMtL,GAAKY,WAC9B2K,iBAAkBA,IAAMvL,GAAKc,UAC7B0K,kBAAmBA,IAAMxL,GAAKgB,WAC9ByK,aAAcA,IAAMzL,GAAKU,MACzBgL,YAAaA,IAAM1L,GAAKS,KAExBkL,aAAcpB,GAAG,CACfE,UAAWzK,GAAKW,KAChB+J,SAAU1K,GAAKW,KACfgK,UAAW3K,GAAKW,OAElBiL,mBAAoBrB,GAAG,CACrBG,SAAU1K,GAAKY,WACf+J,UAAW3K,GAAKY,aAElBiL,kBAAmBtB,GAAG,CAAEI,UAAW3K,GAAKc,YAExCb,MAAO6K,GAAkB9K,GAAKC,OAC9BU,KAAMmK,GAAkB9K,GAAKW,MAC7BC,WAAYkK,GAAkB9K,GAAKY,YACnCE,UAAWgK,GAAkB9K,GAAKc,WAClCE,WAAY8J,GAAkB9K,GAAKgB,YACnCN,MAAOoK,GAAkB9K,GAAKU,OAC9BD,KAAMqK,GAAkB9K,GAAKS,MAE7BqL,mBAAoBvB,GAAG,CACrBtwE,MAAO+lE,GAAKW,KACZ+J,SAAU1K,GAAKY,WACf+J,UAAW3K,GAAKY,aAGlBmL,mBAAoBxB,GAAG,CACrBtwE,MAAO+lE,GAAKY,WACZ4J,KAAMxK,GAAKY,WACX+J,UAAW3K,GAAKc,YAMlBkL,gBAAiBzB,GAAG,CAClBC,KAAMxK,GAAKC,MACXwK,UAAWzK,GAAKC,MAChByK,SAAU1K,GAAKC,MACf0K,UAAW3K,GAAKU,QAElBuL,eAAgB1B,GAAG,CACjBC,KAAMxK,GAAKC,MACXwK,UAAWzK,GAAKC,MAChByK,SAAU1K,GAAKC,MACf0K,UAAW3K,GAAKS,OAGlByL,eAAgB3B,GAAG,CACjBC,KAAMxK,GAAKC,MACXwK,UAAWzK,GAAKC,MAChByK,SAAU1K,GAAKC,MACf0K,UAAW3K,GAAKW,OAGlBwL,qBAAsB5B,GAAG,CACvBC,KAAMxK,GAAKC,MACXwK,UAAWzK,GAAKC,MAChByK,SAAU1K,GAAKC,MACf0K,UAAW3K,GAAKY,cAIPwL,GAAQ,IAChBlB,GACHmB,oBAAqBtB,GACnB,CAAExhB,KAAM2hB,GAAOvK,KAAMxX,IAAK,GAC1B,CAAEI,KAAM2hB,GAAOtK,WAAYzX,IAAK,IAElCmjB,oBAAqBvB,GACnB,CAAExhB,KAAM2hB,GAAOtK,WAAYzX,IAAK,GAChC,CAAEI,KAAM2hB,GAAOa,mBAAoB5iB,IAAK,IAE1CojB,WAAYxB,GACV,CAAExhB,KAAM2hB,GAAOU,mBAAoBziB,IAAK,IACxC,CAAEI,KAAM2hB,GAAOW,kBAAmB1iB,IAAK,GACvC,CAAEI,KAAM2hB,GAAOC,KAAMhiB,IAAK,KASvB,SAASqjB,KAEkC,IAAD,IAAAC,EAAAzxE,UAAA7C,OAD5CqD,EAAI,IAAAoH,MAAA6pE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJlxE,EAAIkxE,GAAA1xE,UAAA0xE,GAEP,MAAM7C,EDxJD,SAAsBA,GAC3B,OAAOA,EAAOplB,KAAK/zC,IAAE,CAAQiG,MAAO,EAAGszD,OAAQ,EAAGE,KAAM,KAAMz5D,KAChE,CCsJiBi8D,CAAUnxE,GA4BzB,MAAO,CAAEoxE,YAzBP/C,EAAOA,EAAO1xE,OAAS,GAAGgoC,KAAOisC,GAAMjB,KAClCpI,IACC,MAAMryD,EAAKk5D,GAAOC,EAAQ9G,EAAK8J,aAC/B,IAAK,IAAI50E,EAAIyY,EAAGvY,OAAS,EAAGF,EAAI,EAAGA,IACjC,GAAIyY,EAAGzY,KAAOm0E,GAAMjB,KAClB,OAAOlzE,EAGX,OAAO,CAAC,EAET8qE,GAASA,EAAK8J,YAeC9iB,MAbiBtB,IAA8B,IAA7B,OAAE0a,EAAM,KAAEJ,EAAI,MAAES,GAAO/a,EAC7D,MAAM2F,EAAM+U,EAAOjV,KAAKnE,MAAMgZ,EAAKjyC,IAC7Bg8C,EAAelD,GAAOC,EAAQ9G,EAAK8J,aACzC9J,EAAKC,WAAWnlD,SAAQ,CAAColD,EAAOhrE,KAC9BgrE,EAAMplD,SAAQkrC,IAAa,IAADod,EAAA,IAAV9uE,EAAGsO,GAAEojD,EACnB,MAAMxgD,EAAIukE,EAAa70E,GAAkB,QAAhBkuE,EAAC3C,EAAM/sE,IAAIY,EAAGsO,UAAE,IAAAwgE,EAAAA,EAAInG,GAAKgB,WAAY5S,GAC1D7lD,GACFi7D,EAAMzsE,IAAIM,EAAGsO,EAAG4C,EAClB,GACA,GACF,EAIN,CC5LO,SAASwkE,GACdC,EACAj/D,GAEA,MAAMxF,EAAyB,CAAC,EAEhC,OADAwF,EAAK8P,SAASvV,GAAOC,EAAED,GAAE,GAAAu3B,OAAMmtC,EAAM,KAAAntC,OAAIv3B,KAClCC,CACT,CAEO,SAAS0kE,GACd9J,EAAoB3a,GAEI,IADvBnxD,EAAGsO,GAAS6iD,EAEb,MAAM,GAAN3oB,OAAUl6B,EAAIw9D,EAAOplC,IAAG,KAAA8B,OAAIxoC,EAAI8rE,EAAOtlC,KACzC,CAIO,SAASqvC,KAA6C,IAAD,IAAA3D,EAAAvuE,UAAA7C,OAA1Bg1E,EAAI,IAAAvqE,MAAA2mE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ2D,EAAI3D,GAAAxuE,UAAAwuE,GACpC,OAAO2D,EAAKjkB,QAAQ/+C,GAAMA,IAAGvN,KAAK,KACpC,CAEO,SAASwwE,GAAW31E,GAAkD,IAAD,IAAAuzE,EAAAhwE,UAAA7C,OAAhCg1E,EAAI,IAAAvqE,MAAAooE,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJkC,EAAIlC,EAAA,GAAAjwE,UAAAiwE,GAC9C,MAAM,GAANprC,OAAUpoC,EAAI,SAAAooC,OAAQqtC,MAAkBC,GAAK,KAC/C,CAEO,SAASE,GAAaljE,GAC3B,OAAOA,EAAEyK,QAAQ,MAAO,IAAIA,QAAQ,KAAM,MAC5C,CC/BO,SAAS04D,GACdnK,EACAJ,GAEA,IAAK,IAAI9qE,EAAI,EAAGA,EAAI8qE,EAAKC,WAAW7qE,OAAQF,IAAK,CAC/C,MAAMgrE,EAAQF,EAAKC,WAAW/qE,GAC9B,IAAK,IAAIC,EAAI,EAAGA,EAAI+qE,EAAM9qE,OAAQD,IAAK,CACrC,MAAMwtE,EAAQzC,EAAM/qE,GACdq1E,EAAKpK,EAAOqK,eAAe/2E,OAAOivE,GACxC,GAAI6H,EACF,OAAOA,EAAGE,iBAAc5lB,EAAY6d,CAExC,CACF,CACF,CCaA,MAEMgI,GAAe,CAACtO,IAChBuO,GAAe,CAACtO,GAAcG,GAAeC,IAC7CmO,GAAe,CAAClO,GAAiBC,GAAmBL,IACpDuO,GAAe,CACnBtO,GACAM,GACAA,GACAA,IAGIiO,GAAUJ,GAAav1E,OAS7B,SAAS41E,GACPC,EACAC,GAEA,OAAOzlB,IAAuB,IAAtB,OAAE2a,EAAM,KAAEJ,GAAMva,EAQtB,MAAO,CAAE0lB,oBAPG/K,EAAOjV,KAAKrE,MAAMkZ,EAAKjyC,IACH63B,QAAQ,CACtCzhD,EAAG,EACHC,EAAG,KACH21B,IAAK,EACLzyB,IAAK2jE,IAEuBC,OAAMvyD,IAAK,KAAM,CAEnD,CAEA,SAASyyD,GAAiB1lB,GAGmB,IAHlB,WACzB2lB,GAAa,EAAK,KAClB5X,EAAO,GACR/N,EACC,OAAQjtD,IACN,MAAM6yE,EAAS7yE,EAAKunE,KAAK4D,SAASsH,KAC5BK,GAAW9yE,EAAKunE,KAAK7W,KAAK/zD,OAG1Bi2D,EAAM5yD,EAAK2nE,OAAOjV,KAAKjE,eAAezuD,EAAKunE,KAAKjyC,IAChDy9C,EAAK,IACNb,MACCY,IAAYD,EAASV,GAAevf,EAAI5E,QAAQmkB,OACjDvf,EAAI5E,QAAQokB,OACZxf,EAAI5E,QAAQqkB,KAIjB,IAAIW,EAAgBhzE,EAAKunE,KAAK4D,SAASuH,oBACvC,MAAMO,EAAuB,GAC7BF,EAAG7K,MAAK,CAACrb,EAAIpwD,KAqBX,GAnBMowD,IAAO+W,MAGPoP,EAAgBnmB,EAAGqW,aAIrBrW,IAAOiX,KACN9jE,EAAKunE,KAAK2L,WAAWhL,MACpB,CAACC,EAAG1rE,IAAMuD,EAAK2nE,OAAOS,MAAM3rE,GAAG02E,QAAU3O,GAAKU,YAK9C2N,GAAUp2E,IAAM61E,KAQpB,GAFAW,EAAG91E,MAAMue,GAAQmxC,EAAGsW,OAAOznD,KAC3Bs3D,GAAiBnmB,EAAGqW,SAChB8P,GAAiB,EACnB,OAAO,OAEAH,GACTI,EAAG91E,MAAMue,IAAG,IAAWmxC,EAAGsW,OAAOznD,GAAM03D,eAAe,MAExD,OAAO,CAAK,IAId,MAAM1G,EAAYuB,GAAa,CAAEjT,OAAMpnB,MAAOq/B,GAAMjzE,GAE9C2sC,EAAe,IAAI1rB,IACvByrD,EAAUlD,SAAS79D,GAAMA,EAAE43D,SAAS52B,gBAItC,IAAK,IAAIlwC,EAAI,EAAGA,EAAIiwE,EAAU/vE,OAAQF,IAAK,CACzC,MAAM4lE,EAAWqK,EAAUjwE,GAC3B,IAAI42E,EACA,kBAAmBhR,EACrBgR,EAAQ7O,GAAKsB,UAEbuN,EAAQ7O,GAAKwB,WACTr5B,EAAa9mC,IAAIw8D,EAASkB,UAC5BvjE,EAAK0sE,UAAUvvE,KAAK,IAAKklE,EAAUoB,MAAO,IAE1CzjE,EAAK0sE,UAAUvvE,KAAKklE,IAGxBA,EAASmB,WAAWnhD,SAAQkrC,IAAA,IAAE1xD,EAAGsO,GAAEojD,EAAA,OAAKvtD,EAAKgoE,MAAMzsE,IAAIM,EAAGsO,EAAGkpE,EAAM,GACrE,CAGA,MAAMC,EAAoC3nE,GACxCA,EAAE63D,WAAW73D,EAAE63D,WAAW7mE,OAAS,GAC/B42E,EAAUA,CAACjhE,EAAkBkhE,KACjC,IAAK,MAAMtJ,KAAS5V,EAASgf,EAAShhE,GAASghE,EAASE,IAClDxzE,EAAKgoE,MAAM/sE,OAAOivE,KAAW1F,GAAKC,OACpCzkE,EAAKgoE,MAAMzsE,OACN2uE,EACH2I,GAAUjgB,EAAI9F,OA1HE,KA2HZ0X,GAAK0B,mBACL1B,GAAKyB,WAGf,EAEF,GAAIyG,EAAU/vE,OAAS,EAAG,CACxB,MAAMs+D,EAASyR,EAAUlD,QAAQ8J,GAC3BG,EAAW,IAAI1Y,EAAWE,GAChC,IAAK,IAAIx+D,EAAI,EAAGA,EAAIg3E,EAAS/V,UAAU/gE,OAAQF,IAC7C,GAAIA,EAAIg3E,EAAS9V,UAAUlhE,GAAI,CAI7B82E,EAHe7G,EAAU+G,EAAS/V,UAAUjhE,IAE1CiwE,EAAU+G,EAAS/V,UAAUjhE,GAAKA,EAAI,IAAM,GAAK,EAAI,KAEzD,CAEJ,MAAWiwE,EAAU/vE,OAAS,GAC5B42E,EAAQ7G,EAAU,GAAIA,EAAU,IAgClC,GA5BImG,GACF7yE,EAAKunE,KAAKC,WAAWnlD,SAASolD,GAC5BA,EAAMplD,SAAS6nD,IACTlqE,EAAKgoE,MAAM/sE,OAAOivE,KAAW1F,GAAKC,OACpCzkE,EAAKgoE,MAAMzsE,OACN2uE,EACHtX,EAAItF,WACF,CACEkX,GAAKC,MACLD,GAAK6B,mBACL7B,GAAK4B,mBACL5B,GAAK2B,mBACL3B,GAAK0B,oBAEP,CAAEx6D,EAAG,EAAGC,EAAG,IAGjB,MAMFinE,GACF5yE,EAAK0zE,cAAcn4E,OAAOmxE,EAAU,GAAGlJ,WAAW,IAAI,GAIpDsP,EAAS,CACX,MAAOa,EAAIC,GAAMlH,EAAU7e,QACzB,CAAAqH,EAASvpD,KAAC,IAAR9P,EAAGsO,GAAE+qD,EAAA,MAAQ,CAACr5D,EAAI8P,EAAE9P,EAAGsO,EAAIwB,EAAExB,EAAE,GACjC,CAAC,EAAG,IAENnK,EAAK6zE,kBACHlT,GAAS,CACP9kE,EAAG6wE,EAAU,GAAG7wE,EAChBsO,EAAGuiE,EAAU,GAAGviE,EAChB81D,QAAS,CAAC0T,EAAKjH,EAAU/vE,OAAQi3E,EAAKlH,EAAU/vE,QAChD2jE,MAAOx0D,KAAKwkD,GAAK,IAGvB,CAGI0iB,EAAgB,GAClBnI,GAAiB7qE,EAAM,CAAEkpD,MAAO8pB,EAAezI,SAAU,GAC3D,CAEJ,CAEO,MAAMuJ,GAAUvC,GAAO,UAAW,CAAC,YAEpCwC,GAGF,CACFpG,WAAYA,KAAA,CACVqG,UAAW,CACT,CACEC,UAAU,GAAD5vC,OAAKyvC,GAAQI,QAAO,MAC7BC,YAAa,iCAGjBC,YAAY,IAEdtkB,cAAeA,IACb4hB,GAAe,qBAAqB,OAADrtC,OAASyvC,GAAQI,QAAO,OAC7DjlB,MAAAA,CAAMmG,GAAoB,IAAnB,OAAEuS,EAAM,KAAEJ,GAAMnS,EACrB,MAAMif,EAAavC,GAAkBnK,EAAQJ,GAC7C,IAAK8M,EACH,MAAM,IAAIz0E,MAAM,0DAGlB,MAAM00E,EAAW/M,EAAKgN,KAAKC,WAAW3mB,QAAO,CAAC9gD,EAAGiT,IACxCjT,EAAEskE,YAAcrxD,EAAEqxD,YAActkE,EAAIiT,IAC1C49C,OAEGphE,EAAI+0E,GAAO,IAADltC,OAAKkjC,EAAKjyC,GAAE,UAAU,CAAC,kBAAmB,eACpDuiB,EAAU8vB,EAAO3Y,KAAKklB,QAAQvM,EAAOjV,MAAMr0B,KAEjD,OAAOqzC,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,uBAAA+O,OACH7nC,EAAEi4E,gBAAe,MAAApwC,OAAKwtC,GAAah6B,GAAQ,kBAAAxT,OACxCotC,GAAe9J,EAAQ0M,GAAW,MAAAhwC,OAAK7nC,EAAEk4E,WAAU,KAChE9C,GACEp1E,EAAEk4E,WAAW,OAADrwC,OACL7nC,EAAEi4E,gBAAe,YAAApwC,OACjBotC,GAAe9J,EAAQ2M,GAAS,kBAAAjwC,OAEpCyvC,GAAQI,QAAO,QAGxB,GAGIS,GACmD,IACpD5H,MACAiE,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMnM,MAAOtpD,MAAO,EAAGwzD,KAAM,GACnC,CAAEhqC,GAAIisC,GAAMzL,KAAMhqD,MAAO,EAAGwzD,KAAM,IAClC,CAAEhqC,GAAIisC,GAAMN,mBAAoB3B,KAAM,KACtC,CAAEhqC,GAAIisC,GAAME,oBAAqBnC,KAAM,MAEzCzD,qBAAuBC,GAAaA,EAASuH,oBAC7ClkB,kBAAmBge,GAAsB,GACzCzH,SAAU,IAoDZ,GAjD8B,CAC5B,CACE9oE,KAAM,0BACH04E,GACHtmB,MAAOkkB,GAAS,IAAI,GACpB9jB,eAAgBkkB,GAAkB,CAAEC,YAAY,IAChDgC,SAAU9H,IAAA,IAAC,KAAEvF,GAAMuF,EAAA,OAAMvF,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,EAAG,GAEpE,CACEp1E,KAAM,qBACH04E,GACHtmB,MAAOkkB,GAAS,IAAI,GACpB9jB,eAAgBkkB,GAAkB,CAChCC,YAAY,EACZ5X,KAAM,IAERnM,gBAAkB7uD,GAAS6uD,GAAgB,CAAEvtB,IAAK,GAAIzyB,IAAK,IAAM7O,GACjE40E,SAAUC,IAAA,IAAC,KAAEtN,GAAMsN,EAAA,OAAMtN,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,EAAG,GAEpE,CACEp1E,KAAM,yBACH04E,GACHtmB,MAAOkkB,GAAS,IAAI,GACpB9jB,eAAgBkkB,GAAkB,CAAC,GACnCmC,QAASC,IAAA,IAAC,KAAExN,EAAI,KAAE7W,EAAI,MAAE0X,GAAO2M,EAAA,OAC5BxN,EAAK4L,OACN5L,EAAK8J,YAAc,GACnB3gB,EAAK/zD,QA7QM,IA8QV+zD,EAAKwX,MAAM5yC,GAAO8yC,EAAM9yC,GAAI69C,UAC5B/K,EAAMF,MAAMloD,IAAC,IAAAg1D,EAAA,MAAyB,QAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,IAAY,KAC3C,EAAG,KACF6zD,IAEL,CACE93E,KAAM,oBACH04E,GACHtmB,MAAOkkB,GAAS,IAAI,GACpB9jB,eAAgBkkB,GAAkB,CAAE3X,KAAM,IAC1CnM,gBAAkB7uD,GAAS6uD,GAAgB,CAAEvtB,IAAK,GAAIzyB,IAAK,KAAO7O,GAClE80E,QAASG,IAAA,IAAAC,EAAA,IAAC,KAAE3N,EAAI,KAAE7W,EAAI,MAAE0X,GAAO6M,EAAA,OAC5B1N,EAAK4L,OACN5L,EAAK8J,YAAc,GACnB3gB,EAAK/zD,QA5RM,IA6RVyrE,EAAMF,MAAMloD,IAAC,IAAAm1D,EAAA,MAAyB,QAAV,QAAVA,EAAAn1D,EAAEmrD,gBAAQ,IAAAgK,OAAA,EAAVA,EAAYj1D,IAAY,MACT,YAAV,QAAvBg1D,EAAA9M,EAAM1X,EAAK,IAAIya,gBAAQ,IAAA+J,OAAA,EAAvBA,EAAyBh1D,KAAmB,EAAI,GAAI,KACpD6zD,KC/SDpgE,GAAQ,CAEZyhE,UAAW,EAEXC,QAAS,EAETC,eAAgB,EAEhBC,SAAU,EAEVC,MAAO,GAGHC,GAAkB,CACtBC,UAAW,CAAEC,kBAAmBhiE,GAAM4hE,UACtCK,MAAO,CAAED,kBAAmBhiE,GAAM2hE,iBAmD7B,SAASpmB,GACdlvD,EACA6T,GAEA,OAAOgiE,GAAoB71E,EAAM,CAC/B81E,SAAU/O,GAAgB/mE,EAAK2nE,OAAO36B,QAAQ2lB,OAC9CojB,cAAe,YACfnjB,IAAK5yD,EAAK2nE,OAAOjV,KAAKxD,mBAAmBlvD,EAAKunE,KAAKjyC,IACnD0gD,qBAAqB,KAClBniE,GAEP,CAEO,SAASs7C,GACdnvD,EACA6T,GAEA,OAAOgiE,GAAoB71E,EAAM,CAC/B81E,SAAUhP,GACVmP,aAAc,CAAEx7D,KAAM,GACtBs7D,cAAe,YACfnjB,IAAK5yD,EAAK2nE,OAAOjV,KAAKvD,gBAAgBnvD,EAAKunE,KAAKjyC,IAChD0gD,qBAAqB,KAClBniE,GAEP,CAEA,SAASgiE,GAAmB7oB,EAE1Bn5C,GACC,IAADqiE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,IAFA,OAAE9O,EAAM,KAAEJ,GAAoDva,EAG9D,MAAMxwD,EAAI+0E,GAAO,IAADltC,OAAKkjC,EAAKjyC,IAAE+O,OAAGxwB,EAAKiiE,SAAS/S,cAAa,MAAM,CAC9D,QACA,cACA,UACA,eACA,QACA,iBAGI2T,EACS,QADDR,EACZriE,EAAK6iE,gBAAQ,IAAAR,EAAAA,EACbriE,EAAK++C,IAAIzF,QAAQ,CACfzhD,EAAG,EACHC,EAAG,EACH21B,IAAK,EACLzyB,IAAmD,MAA5B,QAAlBsnE,EAACtiE,EAAK8iE,oBAAY,IAAAR,EAAAA,EAAI5O,EAAKxW,mBAE9BhF,EAAQ,CAAEzqB,IAAK,EAAIo1C,EAAU7nE,IAAK,GAAK6nE,GAEvCE,EAAgB,GAAKF,GADK,QAAjBN,EAAGviE,EAAKgjE,iBAAS,IAAAT,EAAAA,EAAI7O,EAAKzW,kBAGnCgmB,EAAwB,QAAhBT,EAAGxiE,EAAKijE,gBAAQ,IAAAT,EAAAA,EAAI75E,EAAEu6E,MAC9BC,EAAcnjE,EAAKijE,SACrB,GA1EN,SACEnP,EACAJ,EACA0P,GAEA,MAAMC,EAAiBpF,GAAkBnK,EAAQJ,GACjD,OAAI2P,EAGK,CAAC,aAAD7yC,OAAcotC,GAAe9J,EAAQuP,GAAe,MAAA7yC,OAAK4yC,EAAK,MAGhE,CAAC,cAAD5yC,OAAe4yC,EAAK,KAC7B,CA8DME,CAAexP,EAAQJ,EAAMuP,GAC3BM,EAAiBR,EAAe,EAChCjN,EAAW,CACfroC,IAAKs1C,EAAeQ,EACpBvoE,IAAK+nE,EAAeQ,GAEhBC,EA9FR,SACEA,EACAzkB,EACA8jB,GAEA,MAAMtP,EAAmB,GACzB,KAAOA,EAAOzqE,OAAS+5E,GACrBtP,EAAOjqE,QAAQy1D,EAAI5E,QAAQqpB,IAG7B,OADAjQ,EAAOzqE,OAAS+5E,EACTtP,CACT,CAmFkBkQ,CACF,QADchB,EAC1BziE,EAAKwjE,eAAO,IAAAf,EAAAA,EAtGhB,SAAoB/O,GAClB,OAAOA,EAAKgN,KAAKC,WAAWvrB,KAAKr5C,IAC/B,MAAO/T,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAO,CAAE/hE,EAAGiQ,KAAKrN,MAAM5C,GAAIsO,EAAG2B,KAAKrN,MAAM0L,GAAImkE,OAAQ1+D,EAAGyhE,YAAa,GAEzE,CAiGoBkG,CAAWhQ,GAC3B1zD,EAAK++C,IACL8jB,GAEIc,EAAgC,IAAzB3jE,EAAK4jE,gBACZC,EAAkC,QAArBnB,EAAG1iE,EAAK6jE,qBAAa,IAAAnB,EAAAA,EAxE1C,SAA0B5O,EAAyBJ,GAEjD,OAAOA,EAAKkE,WAAW,GAAG/d,QAAQwc,GAAUvC,EAAOK,MAAM/sE,OAAOivE,IAClE,CAqE8CyN,CAAiBhQ,EAAQJ,GAE/DqQ,GAA0BJ,QAAiCnrB,IAAzBx4C,EAAK4jE,gBACvCI,IAAsBL,GAAQ3jE,EAAKmiE,qBAEzC,OAAOtE,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,YAAA+O,OAAWxwB,EAAKiiE,SAAS75E,KAAI,MAAAooC,OAAKqyC,GAE/C,OAAAryC,OACO7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM0hE,SACxBuC,GAAsB,OAAAvzC,OAAW7nC,EAAEs7E,aAAY,WACdzrB,KAAhB,QAAjBmqB,EAAA3iE,EAAKoiE,oBAAY,IAAAO,OAAA,EAAjBA,EAAmBuB,YAAuB,OAAA1zC,OACjC7nC,EAAEy5E,aAAY,KAAA5xC,OAAIxwB,EAAKoiE,aAAax7D,SAG1Cu8D,EACHpF,GACEkF,EACAjjE,EAAKmkE,iBAAe,eAAA3zC,OACHxwB,EAAKmkE,gBAAgB12C,IAAIlnB,QAAQ,GAAE,MAAAiqB,OAAKxwB,EAAKmkE,gBAAgBnpE,IAAIuL,QAAQ,GAAE,MACrE,IAAvB48D,EAAYr6E,QAAY,KAAA0nC,OAAS7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM0hE,QAAO,aAAY,GAADhxC,OACjE7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM6hE,MAAK,KACzB3hE,EAAKmiE,qBAAmB,GAAA3xC,OAAO7nC,EAAEy7E,QAAO,SAItCJ,EACAH,EAAczuB,KACXihB,GAAK,cAAA7lC,OACUotC,GAAe9J,EAAQuC,GAAM,MAAA7lC,OAAK7nC,EAAEy7E,QAAO,OAE7D,GACJrG,GACEp1E,EAAEy7E,QAEF,KAAA5zC,OACK7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM6hE,MAAK,aAC3B3hE,EAAKoiE,cAAY,cAAA5xC,OACDxwB,EAAKoiE,aAAa8B,UAAYv7E,EAAEy5E,aAAepiE,EAAKoiE,aAAax7D,KAAI,aAErF,GAAA4pB,OACG7nC,EAAEyX,MAAK,KAAAowB,OAAIoxC,GAAgB5hE,EAAKkiE,eAAeJ,kBAAiB,KACnEiC,GAAsB,GAAAvzC,OAAO7nC,EAAEs7E,aAAY,aACVzrB,KAAhB,QAAjBoqB,EAAA5iE,EAAKoiE,oBAAY,IAAAQ,OAAA,EAAjBA,EAAmBsB,YAAuB,GAAA1zC,OACrC7nC,EAAEy5E,aAAY,cAAA5xC,OAAaxwB,EAAKoiE,aAAa8B,UAAS,QAGvDV,EAAQ7N,SAAS0O,GAAW,CAAC,eAAD7zC,OACf0nB,EAAMzqB,IAAIlnB,QAAQ,GAAE,MAAAiqB,OAAK0nB,EAAMl9C,IAAIuL,QAAQ,GAAE,gBAAAiqB,OAClDotC,GAAe9J,EAAQ,CAACuQ,EAAOr8E,EAAGq8E,EAAO/tE,IAAG,OAAAk6B,OAAMxwB,EAAKiiE,SAASxgD,GAAE,KAAA+O,OAAI6zC,EAAO5J,OAAM,QAI/FkJ,EAAI,GAAAnzC,OACG7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAMyhE,UAAS,UACJ/oB,IAAzBx4C,EAAK4jE,iBAA6B,KAAApzC,OAC3B7nC,EAAEs7E,aAAY,MAAAzzC,OAAKxwB,EAAK4jE,gBAAe,MAAApzC,OAAK7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAMyhE,UAAS,MAEhFoC,GAAI,eAAAnzC,OACYslC,EAASroC,IAAIlnB,QAAQ,GAAE,MAAAiqB,OAAKslC,EAAS96D,IAAIuL,QAAQ,GAAE,OAEnEo9D,GAAI,KAAAnzC,OACE7nC,EAAEyX,MAAK,MAAAowB,OAAK1wB,GAAM4hE,SAAQ,OAAAlxC,OAAM7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM6hE,MAAK,MAAAnxC,OAAK7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAMyhE,UAAS,UAKzFoC,GAA+B,UAAvB3jE,EAAKkiE,cAWd,GAVA,IACKxO,EAAKC,WAAW,GAAGve,KACnBihB,GAAK,cAAA7lC,OACUotC,GAAe9J,EAAQuC,GAAM,KAAA7lC,OAAIxwB,EAAKiiE,SAASxgD,GAAE,MAAA+O,OAAK7nC,EAAE27E,YAAW,OAErFvG,GACEp1E,EAAE27E,YAAY,KAAD9zC,OACR7nC,EAAEyX,MAAK,MAAAowB,OAAK1wB,GAAM2hE,eAAc,MAAAjxC,OAAK7nC,EAAEyX,MAAK,KAAAowB,OAAI1wB,GAAM4hE,SAAQ,OAK/E,CC/NA,MAAM6C,GAAW,CAAEl4D,IAAK,WAcxB,MAAMm4D,GAAS9Q,GACbgK,GAAO,IAADltC,OAAKkjC,EAAKjyC,GAAE,WAAW,CAC3B,aAAa,SAAD,wBAIZ,cAGEq/C,GAA0C,IAC3C3H,GACH3e,MAAOA,IAAM+pB,GACbnpB,OAAQjC,IAAuB,IAAtB,OAAE2a,EAAM,KAAEJ,GAAMva,EACvB,MAAMxwD,EAAI67E,GAAM9Q,GACV+Q,EA1BV,SAA4B3Q,EAA0BJ,GACpD,MAAMgR,EAAe,GACrB,OAAOhR,EAAKC,WAAW,GAAG9Z,QAAQhyC,IAChC,MAAMq2D,EAAKpK,EAAOqK,eAAe/2E,OAAOygB,GACxC,SAAKq2D,GAAMA,EAAGE,aAAesG,EAAKxG,EAAGz8C,OAGrCijD,EAAKxG,EAAGz8C,KAAM,GACP,EAAI,GAEf,CAgB4BkjD,CAAmB7Q,EAAQJ,GAC7CkR,EAAQlR,EAAKC,WAAW,GAAG17D,KAAKrN,MAAM8oE,EAAKC,WAAW,GAAG7qE,OAAS,IAClEi2D,EAAM+U,EAAOjV,KAAKzD,OAAOsY,EAAKjyC,IAE9BojD,EAAcnR,EAAKC,WAAW,GAAG9Z,QAAQhyC,IAAS,IAAD8sD,EACrD,MAAMx7D,EAA4B,QAA3Bw7D,EAAGb,EAAOK,MAAM/sE,OAAOygB,UAAI,IAAA8sD,EAAAA,EAAIhE,GAAKgB,WAC3C,OAAOx4D,EAAE83D,QAAU93D,EAAE23D,SAAWJ,GAASkB,KAAK,IAE1CkT,EAAQ7sE,KAAKE,MAAMssE,EAAgB37E,OAAS+7E,EAAY/7E,QAAU,GAExE,OAAO+0E,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,oBAAA+O,OACN7nC,EAAEo8E,UAAS,gBAAAv0C,OACR7nC,EAAEq8E,cAAa,MAAAx0C,OAAKwtC,GAAalK,EAAO3Y,KAAK8pB,0BAA0BlmB,GAAKv0B,MAAK,QACxFi6C,EAAgBrvB,KAChBvtC,GAAG,aAAA2oB,OAAkBotC,GAAe9J,EAAQjsD,GAAI,MAAA2oB,OAAK7nC,EAAEu8E,OAAM,UAE7DL,EAAYzvB,KACZvtC,GAAG,YAAA2oB,OAAiBotC,GAAe9J,EAAQjsD,GAAI,MAAA2oB,OAAK7nC,EAAEu8E,OAAM,OAE/DnH,GACEp1E,EAAEu8E,OAAO,GAAD10C,OACL7nC,EAAEo8E,UAAS,aAAAv0C,OACT7nC,EAAEo8E,UAAS,MAAAv0C,OAAKs0C,EAAK,qDAAAt0C,OAGnB7nC,EAAEq8E,cAAa,+CAAAx0C,OAGfotC,GAAe9J,EAAQ8Q,GAAM,6BAGjClR,EAAKC,WAAW,GAChB9Z,QAAQhyC,IAAG,IAAAgyD,EAAA,OAA6B,QAA7BA,EAAK/F,EAAOK,MAAM/sE,OAAOygB,UAAI,IAAAgyD,OAAA,EAAxBA,EAA0B5I,MAAM,IAChD7b,KACEvtC,GAAG,SAAA2oB,OAAcotC,GAAe9J,EAAQjsD,GAAI,OAEjDisD,EAAO36B,QAAQmmB,aAAW,GAAA9uB,OAAO7nC,EAAEw8E,MAAK,MAE3C,EAEH9pB,mBAAqBlvD,IACnB,MAAMi5E,EAAMj5E,EAAKunE,KAAKgN,KAAKC,WACrB0E,EAAO,CAACD,EAAI,GAAIA,EAAIA,EAAIt8E,OAAS,IACvC,OAAOuyD,GAAmBlvD,EAAM,CAC9B82E,SAAUuB,GAAMr4E,EAAKunE,MAAMyR,MAC3B3B,QAAS6B,EAAKjwB,KAAKr5C,IACjB,MAAO/T,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAO,CAAE/hE,EAAGiQ,KAAKrN,MAAM5C,GAAIsO,EAAG2B,KAAKrN,MAAM0L,GAAImkE,OAAQ1+D,EAAGyhE,YAAa,IAEvEoG,gBAAiB,EACjBzB,qBAAqB,GACrB,GAkBN,GAdgB,CACd,CACE/5E,KAAM,kBACH04E,MACA3D,GAAQ,CAAErsC,GAAIisC,GAAMpL,YAAc,CAAE7gC,GAAIisC,GAAMjB,KAAMhB,KAAM,IAC7DwK,QAASlsB,IAAA,IAAC,KAAEsa,EAAI,MAAEa,GAAOnb,EAAA,OACtBsa,EAAK4L,OACa,cAAnB5L,EAAKgN,KAAKlM,MACVd,EAAKgN,KAAK6E,uBAAyB,IAClC7R,EAAK2L,WAAWhL,MAAK,CAACC,EAAG1rE,KAAC,IAAA48E,EAAA,MAAgC,aAAV,QAAjBA,EAAAjR,EAAM3rE,GAAG0uE,gBAAQ,IAAAkO,OAAA,EAAjBA,EAAmBn5D,IAAiB,KACpE,CAAC,IC7GA,SAASo5D,GACdlR,EACAb,EACA4L,GAEA,OAAO/K,EAAMF,MAAMloD,GAAMunD,EAAK2L,WAAWlzD,EAAEsV,KAAOtV,EAAEmzD,QAAUA,GAChE,CAEO,SAASoG,GACdnR,EACAb,EACA4L,GAEA,OAAQ/K,EAAMF,MAAMloD,GAAMunD,EAAK2L,WAAWlzD,EAAEsV,KAAOtV,EAAEmzD,QAAUA,GACjE,CAEO,SAASqG,GAAUjS,GACxB,OAAOA,EAAK2L,WAAWrlB,QAAO,CAAC9gD,EAAGoD,IAAMpD,GAAKoD,EAAI,EAAI,IAAI,IAAM,CACjE,CCZA,MAAMwkE,GAAoC,IACrC5H,GACHne,cAAAA,GAAkB,EAClBM,kBAAAA,CAAmBlvD,GACjB,IAAkC,QAA9BA,EAAK2nE,OAAO36B,QAAQ2lB,OAAmB3yD,EAAKunE,KAAK4L,QAAU3O,GAAKS,QAGlC,SAA9BjlE,EAAK2nE,OAAO36B,QAAQ2lB,OAAoB3yD,EAAKunE,KAAK4L,QAAU3O,GAAKS,MAGrE,OAAO/V,GAAmBlvD,EAC5B,GAiKF,GA9JgB,CACd,CACE/D,KAAM,UACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM1L,MAAOyJ,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMnM,MAAOgK,OAAQ,EAAGE,KAAM,GACpC,CAAEhqC,GAAIisC,GAAMxL,YACZ,CACEzgC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMxL,WAAYzX,IAAK,IAC/B,CAAEI,KAAM6iB,GAAML,mBAAoB5iB,IAAK,MAI7CmnB,QAAS9nB,IAAA,IAAC,KAAEua,GAAMva,EAAA,OAChBua,EAAK4L,QAAU3O,GAAKU,OAASqC,EAAK8J,YAAc,IAAM,CAAC,GAE3D,CACEp1E,KAAM,iCACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM1L,MAAOyJ,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMxL,YACZ,CAAEzgC,GAAIisC,GAAML,qBAEduE,QAAS7nB,IAAA,IAAC,OAAE0a,EAAM,KAAEJ,GAAMta,EAAA,OACxB0a,EAAO36B,QAAQmmB,aACU,QAAzBwU,EAAO36B,QAAQ2lB,OACf4U,EAAK4L,QAAU3O,GAAKU,OACpBqC,EAAKgN,KAAKC,WAAW73E,OAAS,GAC9B4qE,EAAK8J,YAAc,GACnB9J,EAAK8J,YAAc,IACnB,CAAC,EACHtiB,aAAAA,CAAc/uD,GACZ,MAAM4yD,EAAM5yD,EAAK2nE,OAAOjV,KAAK3D,cAAc/uD,EAAKunE,KAAKjyC,IAErD2zC,GAAsBjpE,EAAM4yD,EADd9mD,KAAKE,KAAiC,IAA5BhM,EAAKunE,KAAKxW,iBAEpC,GAEF,CACE90D,KAAM,YACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmB30D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMf,YAAalB,KAAM,IAC/B,CAAEhqC,GAAIisC,GAAMhB,aAAcjB,KAAM,IAChC,CAAEhqC,GAAIisC,GAAM1L,MAAOyJ,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMxL,YACZ,CAAEzgC,GAAIisC,GAAMG,aAEd+D,QAASvnB,IAAA,IAAC,KAAEga,GAAMha,EAAA,OAChBga,EAAK4L,QAAU3O,GAAKU,OAASqC,EAAK8J,YAAc,GAAK,CAAC,GAE1D,CACEp1E,KAAM,eACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM3L,KAAM0J,KAAM,GACxB,CAAEhqC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMxL,WAAYqJ,OAAQ,GAChC,CAAE9pC,GAAIisC,GAAML,qBAEduE,QAAS5f,IAAA,IAAC,KAAEqS,GAAMrS,EAAA,OAChBqS,EAAK4L,QAAU3O,GAAKS,MAAQsC,EAAK8J,YAAc,IAAM,CAAC,GAE1D,CACEp1E,KAAM,iBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmB30D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,IAC1C,CAAEhqC,GAAIisC,GAAM3L,KAAM0J,KAAM,GACxB,CAAEhqC,GAAIisC,GAAMnM,MAAOkK,KAAM,IACzB,CAAEhqC,GAAIisC,GAAMxL,YACZ,CAAEzgC,GAAIisC,GAAML,qBAEduE,QAAS1f,IAAA,IAAC,KAAEmS,GAAMnS,EAAA,OAChBmS,EAAK4L,QAAU3O,GAAKS,MAAQsC,EAAK8J,YAAc,GAAK,CAAC,GAEzD,CACEp1E,KAAM,eACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmB30D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMf,YAAa10D,MAAO,EAAGwzD,KAAM,IACzC,CAAEhqC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,IAC1C,CAAEhqC,GAAIisC,GAAMJ,gBAAiB7B,KAAM,GACnC,CAAEhqC,GAAIisC,GAAMxL,YACZ,CAAEzgC,GAAIisC,GAAMG,aAEd+D,QAAShI,IAAA,IAAC,MAAE1E,EAAK,KAAEb,GAAMuF,EAAA,OACvBvF,EAAK4L,QAAU3O,GAAKU,OACpBqC,EAAK8J,YAAc,GACnBmI,GAAUjS,IACVgS,GAAenR,EAAOb,EAAM,OAC5B,CAAC,GAEL,CACEtrE,KAAM,oBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,IAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmBnB,KAAM,IACrC,CAAEhqC,GAAIisC,GAAMhB,aAAcjB,KAAM,IAChC,CAAEhqC,GAAIisC,GAAMH,eAAgB9B,KAAM,GAClC,CAAEhqC,GAAIisC,GAAMP,oBAEdyE,QAASD,IAAA,IAAC,MAAEzM,EAAK,KAAEb,GAAMsN,EAAA,OACvBtN,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAK8J,YAAc,GACnBmI,GAAUjS,IACVgS,GAAenR,EAAOb,EAAM,OAC5B,CAAC,GAEL,CACEtrE,KAAM,0BACH04E,GACHvH,gBAAiB2H,IAAA,IAAC,KAAExN,GAAMwN,EAAA,OAAKxN,EAAK8F,gBAAkB9F,EAAK+F,UAAY,CAAC,KACrE0D,GACD,CACErsC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMf,YAAaliB,IAAK,KAChC,CAAEI,KAAM6iB,GAAMd,kBAAmBniB,IAAK,IACtC,CAAEI,KAAM6iB,GAAM3L,KAAMtX,IAAK,IAE3BxyC,MAAO,EACPwzD,KAAM,GAER,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMT,aAAcxiB,IAAK,KACjC,CAAEI,KAAM6iB,GAAMR,mBAAoBziB,IAAK,KAG3C,CAAEhpB,GAAIisC,GAAMP,oBAEd3hB,aAAAA,CAAc1uD,GACZ6qE,GAAiB7qE,EAAM,CACrBuqE,SAAUz+D,KAAK+C,IAAI7O,EAAK2nE,OAAO36B,QAAQikB,oBAAqB,KAEhE,EACA6jB,QAASG,IAAA,IAAC,KAAE1N,GAAM0N,EAAA,OAChB1N,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAKkG,YACLlG,EAAK8J,YAAc,GACnB,EAAG,IC1GT,MAAMoI,GAAW,CACf,CACEx9E,KAAM,mBA7DgC,IACrC+wE,OAGL,SAAoBhgB,GAMjB,IANkB,YACnBokB,EAAW,MACX7iB,GAC8CvB,EAiD9C,MAAO,CAAEokB,cAAa7iB,MA7C6BvuD,IAIjD,SAAS05E,EAASh+D,GAChB,MAAM1gB,EAAMgF,EAAK2nE,OAAOM,cAAchtE,OAAOygB,GAG7C,OAAO1gB,IAAQA,EAAIktE,MAAK,CAACC,EAAG1rE,IAAMA,IAAMuD,EAAKunE,KAAKjyC,IACpD,CARAi5B,EAAMvuD,GAUN,MAAM25E,EAAW35E,EAAKunE,KAAK2L,WACxBjqB,KAAI,CAACkf,EAAG7yC,IAAOt1B,EAAK2nE,OAAOS,MAAM9yC,KACjCo4B,QAAQ1tC,GAAiB,SAAXA,EAAEqoD,OAChB5U,MAAK,CAAC/nD,EAAGC,IAAMD,EAAEglD,KAAK/zD,OAASgP,EAAE+kD,KAAK/zD,SAEnCi9E,EAAK9tE,KAAKw1B,OAAOq4C,EAAS1wB,KAAK4wB,GAAOA,EAAGpO,WAAW9uE,UAAW,EACrE,IAAK,IAAIF,EAAI,EAAGA,EAAIm9E,EAAIn9E,IACtB,IAAK,MAAMq9E,KAAWH,EAAU,CAE9B,MAAMI,EAAQD,EAAQrO,WAAWhvE,GAAGixD,OAAOgsB,GAC3C,KAAIK,EAAMp9E,OAASqD,EAAKunE,KAAK8J,aAoB7B,OAjBA0I,EAAM13D,SAAS3G,GAAQ1b,EAAKgoE,MAAMzsE,OAAOmgB,EAAK8oD,GAAKgB,mBAGnDsU,EAAQrO,WAAWhvE,EAAI,GACpBixD,OAAOgsB,GACPhsB,QACCT,IAAA,IAAEpxD,EAAGsO,GAAE8iD,EAAA,OACLkH,EAAKtG,QACH,CAAC9gD,EAACwgD,KAAA,IAAAme,EAAA,IAAG9gE,EAAIC,GAAG0iD,EAAA,OACqB,QAA/Bme,EAAC1rE,EAAKgoE,MAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAA6gE,EAAAA,EAAIlH,GAAKgB,cACxChB,GAAKgB,WACDz4D,EAAI,EACJA,CAAC,GACP,GACE,CAAC,IAERsV,SAAS3G,GAAQ1b,EAAKgoE,MAAMzsE,OAAOmgB,EAAK8oD,GAAKgB,aAElD,CACF,EAGJ,CAMOwU,CACDhJ,GACE,CAAErsC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMP,mBACZ,CAAE1rC,GAAIisC,GAAMjB,KAAMhB,KAAM,KAG5BwK,QAASjkB,IAAA,IAAC,KAAEqS,GAAMrS,EAAA,OACfqS,EAAK4L,OACN5L,EAAK8J,YAAc,GACA,cAAnB9J,EAAKgN,KAAKlM,MACVd,EAAKgN,KAAK6E,uBAAyB,GACnC,CAAC,IAIP,MChFMa,GAAO,CACXC,KAAM,YACNC,IAAK,WACLC,IAAK,aAGA,MAAMC,GAQXr+E,WAAAA,CACEs5B,EACAr5B,EACA8mE,EACAuX,EACAjS,EACAnF,EACAqX,GACC,KAfMjlD,QAAE,OACFr5B,UAAI,OACJ8mE,mBAAa,OACbuX,WAAK,OACLjS,UAAI,OACJnF,cAAQ,OACRqX,cAAQ,EAUf96E,KAAK61B,GAAKA,EACV71B,KAAKxD,KAAOA,EACZwD,KAAKsjE,cAAgBA,EACrBtjE,KAAK66E,MAAQA,EACb76E,KAAK4oE,KAAOA,EACZ5oE,KAAKyjE,SAAWA,EAChBzjE,KAAK86E,SAAWA,CAClB,CAEA,OAAIC,GACF,OAAOP,GAAKx6E,KAAK4oE,KACnB,EAGK,MAAMoS,GAAc,IAAIJ,GAC7B,sBACA,cACA,OACA,QACA,OACA,EACA,CAAC,aAEUK,GAAe,IAAIL,GAC9B,uBACA,eACA,OACA,QACA,OACA,EACA,CAAC,WAAY,YAEFM,GAAwB,IAAIN,GACvC,+BACA,wBACA,OACA,QACA,OACA,EACA,CAAC,WAAY,gBAEFO,GAAc,IAAIP,GAC7B,sBACA,cACA,OACA,QACA,MACA,EACA,CAAC,aAAc,gBAEJQ,GAAO,IAAIR,GACtB,gBACA,4BACA,OACA,QACA,OACA,EACA,CAAC,WAAY,YAEFS,GAAe,IAAIT,GAC9B,uBACA,eACA,OACA,QACA,MACA,EACA,CAAC,eAEyB,IAAIA,GAC9B,uBACA,eACA,OACA,QACA,OACA,EACA,CAAC,aAE4B,IAAIA,GACjC,0BACA,kBACA,OACA,QACA,OACA,EACA,CAAC,WAAY,YAEc,IAAIA,GAC/B,wBACA,gBACA,OACA,QACA,MACA,EACA,CAAC,aAEiB,IAAIA,GACtB,gBACA,4BACA,OACA,QACA,OACA,EACA,CAAC,WAAY,UAAW,aAEI,IAAIA,GAChC,yBACA,iBACA,OACA,QACA,OACA,EACA,CAAC,WAAY,UAAW,UAAW,cAEL,IAAIA,GAClC,2BACA,mBACA,OACA,QACA,MACA,GACA,IAWK,MAAMU,GAAe/+E,WAAAA,GAAA,KAClBs5B,GAAa,CAAE,CACvB8f,MAAAA,CACEp1C,GAKA,MAAO,CACLg7E,WAAW,EACXC,SAAU,KACVV,SAAU,MACPv6E,EACHs1B,GAAI71B,KAAK61B,KAEb,EChJK,MAAM4lD,GAAc3J,GAAO,cAAe,CAC/C,iBACA,aACA,kBACA,SAGK,SAAS4J,GAAgBxT,GAC9B,IAAIyT,EAAqB,EACrBC,EAAyB,EAO7B,OANA1T,EAAOS,MAAM/lD,SAASklD,IAAU,IAAD+T,EACF,gBAAV,QAAbA,EAAA/T,EAAK4D,gBAAQ,IAAAmQ,OAAA,EAAbA,EAAep7D,OACjBm7D,IACAD,GAAc7T,EAAK4D,SAASoQ,YAC9B,IAEK,CAAEH,aAAYC,iBACvB,CAEA,SAASG,GACP7T,EAAwB3a,EAExByuB,EACAlU,GACQ,IAHPmU,EAASC,GAAe3uB,EAIzB,IAAKua,EAAK7W,KAAK/zD,OACb,MAAM,IAAIiD,MAAM,sCAIlB,MAAMg8E,EAAejU,EAAOS,MAAMb,EAAK7W,KAAK6W,EAAK7W,KAAK/zD,OAAS,IAEzDyqE,EAASwU,EAAapU,WACzBgC,SAAS/B,GAAUA,IAGnB/Z,QAAOT,IAAa,IAAXpxD,EAAGsO,GAAE8iD,EACb,MAAM8kB,EAAKpK,EAAOqK,eAAe/2E,IAAIY,EAAGsO,GACxC,OAAO4nE,GAAMA,IAAO0J,CAAQ,IAI7BxyB,KACCsE,IAAA,IAAE1xD,EAAGsO,GAAEojD,EAAA,MACL,CAAC1xD,EAAGsO,GAAItO,EAAI6/E,IAAY,GAAKvxE,EAAIwxE,IAAY,EAAE,IAMlD9tB,QACC,CAAC9gD,EAAoCiT,IAAOjT,GAAKA,EAAE,GAAKiT,EAAE,GAAKjT,EAAIiT,GACnE,MAIJ,OAAIonD,EACK,CAACA,EAAO,GAAIA,EAAO,IAIrBoU,GAAmB7T,EAAQ,CAAC+T,EAASC,GAAUF,EAAUG,EAClE,CAmCA,MAAMC,GAAiBA,CACrBtU,EAAenS,KAAA,IACf,MACE4S,EAAK,eACLgK,GAID5c,EAAA,OAEDkS,GAAUC,GAAM,CAAC1rE,EAAGsO,KAAO,IAAD2xE,EACxB,MAAM9uE,EAAIg7D,EAAM/sE,IAAIY,EAAGsO,GACvB,QAAS,OAAD6C,QAAC,IAADA,GAAAA,EAAG83D,WAAY,OAAD93D,QAAC,IAADA,GAAAA,EAAG63D,YAAoC,QAAzBiX,EAAC9J,EAAe/2E,IAAIY,EAAGsO,UAAE,IAAA2xE,GAAxBA,EAA0B7J,YAAW,GAC1E,EAEE0C,GAA6C,IAC9C5H,GACH1e,MAAOye,IAAuB,IAAtB,OAAEnF,EAAM,KAAEJ,GAAMuF,EAGtB,MAAO,CAAE5sD,IAAK,aAAcq7D,YAFhB5T,EAAOjV,KAAKrE,MAAMkZ,EAAKjyC,IACX63B,QAAQ,CAAEzhD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,EAAGzyB,IAAK,IAClB,EAE3CkgD,cAAe8lB,IAOR,IAADkH,EAAA,IAPU,OACdpU,EAAM,KACNJ,EAAI,OACJyU,EAAM,aACNC,EAAY,SACZtP,EAAQ,eACRuP,GACDrH,EACC,MAAMjiB,EAAM+U,EAAOjV,KAAK3D,cAAcwY,EAAKjyC,KAEpCz5B,EAAGsO,GACoB,QADlB4xE,EACVF,GAAetU,EAAMI,UAAO,IAAAoU,EAAAA,EAC5B,MACE,MAAM,IAAIn8E,MAAM,+BACjB,EAFD,GAGImyE,EAAKpK,EAAOqK,eAAe/2E,IAAIY,EAAGsO,GACxC,IAAK4nE,EACH,MAAM,IAAInyE,MAAM,yCAElB,GAAImyE,EAAGE,YACL,MAAM,IAAIryE,MAAM,4CAElB,IAAK,IAAInD,EAAI,EAAGA,EAAI8qE,EAAK4D,SAASoQ,YAAa9+E,IAC7Cu/E,EAAO7+E,KAAK8+E,EAAa7mC,OAAO,IAAKgsB,GAAe,CAAEvlE,IAAGsO,IAAGyoD,YA9ElE,SACE+U,EACAJ,EAAerS,EAEfyX,EACAuP,EACAtpB,GACC,IAJA/2D,EAAGsO,GAAS+qD,EAKb,MAAMyW,EAAOhE,EAAOK,MAAM/sE,IAAIY,EAAGsO,GAC3BgpE,EAAQxH,IAASnH,GAAKS,MAAQ0G,IAASnH,GAAKU,MAAQyG,EAAO,KAC3DpI,EAAW3Q,EAAIpF,eAAuC,CAC1D,CAAEO,KAAM0sB,GAAa9sB,IAAKwlB,EAAQ,EAAI,GACtC,CAAEplB,KAAM2sB,GAAc/sB,IAAKwlB,EAAQ,EAAI,IACvC,CAAEplB,KAAM4sB,GAAuBhtB,IAAKwlB,EAAQ,EAAI,KAChD,CAAEplB,KAAM6sB,GAAajtB,IAAKwlB,IAAU3O,GAAKU,MAAQ,EAAI,GACrD,CAAEnX,KAAM+sB,GAAcntB,IAAK,KAC3B,CAAEI,KAAM,KAAMJ,IAAK,SAEjB4V,GACFoJ,EAASxvE,KACP++E,EAAe9mC,OAAO,IACjBgsB,GAAe,CAChBvlE,IACAsO,IACA81D,QAASsH,EAAKgN,KAAKC,WAAW,GAAG5W,OACjChL,QAEF2Q,aAIR,CAmDI4Y,CACExU,EACAJ,EAHsBiU,GAAmB7T,EAAQ,CAAC9rE,EAAGsO,GAAI4nE,EAAIxK,GAK7DoF,EACAuP,EACAtpB,EACD,EAEH+a,WAAYoH,IAAiB,IAAhB,OAAEpN,GAAQoN,EACrB,MAAM,WAAEqG,EAAU,eAAEC,GAAmBF,GAAgBxT,GACjDwM,EACW,IAAfiH,EACI,4BACmB,IAAnBC,EACE,2CAA0C,QAAAh3C,OAClC+2C,EAAU,sBAC1B,MAAO,CACLpH,UAAW,CAAC,CAAEC,UAAU,GAAD5vC,OAAK62C,GAAYh+E,KAAI,MAAMi3E,gBAClDC,YAAY,EACb,EAEHtkB,aAAAA,CAAamlB,GAAc,IAAb,OAAEtN,GAAQsN,EACtB,MAAM,eAAEoG,GAAmBF,GAAgBxT,GACrC9vB,EAAU8vB,EAAO3Y,KAAKotB,mBAAmBzU,EAAOjV,MAAMr0B,KAC5D,OAAOqzC,GAAe,yBAEpB2J,EAAiB,GAAC,OAAAh3C,OACT62C,GAAYmB,eAAc,KAAAh4C,OAAIg3C,GAAiB,OAADh3C,OAChD62C,GAAYh+E,KAAI,gBAAAmnC,OACb62C,GAAYoB,gBAAe,MAAAj4C,OAAKwtC,GAAah6B,GAAQ,KAC/D+5B,GACEsJ,GAAYqB,WAAW,OAADl4C,OACf62C,GAAYoB,gBAAe,kBAAAj4C,OAE/B62C,GAAYh+E,KAAI,QAGzB,EACA+xD,MAAAA,CAAMutB,GAAoB,IAAnB,OAAE7U,EAAM,KAAEJ,GAAMiV,EACrB,MAAMC,EAAkBhL,GACtB9J,EACAkU,GAAetU,EAAMI,KAEjB,eAAE0T,GAAmBF,GAAgBxT,GACrCnrE,EAAI+0E,GAAO,IAADltC,OAAKkjC,EAAKjyC,GAAE,cAAc,CACxC,kBACA,aACA,iBAEF,GAAuB,IAAnB+lD,EACF,OAAO3J,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,0CAAA+O,OACAo4C,EAAe,MAAAp4C,OAAK7nC,EAAEk4E,WAAU,KAC7C9C,GACEp1E,EAAEk4E,WAAW,OAADrwC,OACLo4C,EAAe,QAAAp4C,OACnB62C,GAAYqB,WAAU,OAI/B,MAAM3pB,EAAM+U,EAAOjV,KAAKzD,OAAOsY,EAAKjyC,IAC9BuiB,EAAU8vB,EAAO3Y,KAAK0tB,gBAC1B9pB,EACA2U,EAAK4D,SAASoQ,aACdl9C,KACF,OAAOqzC,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,6CAAA+O,OACH7nC,EAAEi4E,gBAAe,MAAApwC,OAAKwtC,GAAah6B,GAAQ,kBAAAxT,OACxCo4C,EAAe,MAAAp4C,OAAK7nC,EAAEk4E,WAAU,KAC7C9C,GACEp1E,EAAEk4E,WAAW,OAADrwC,OACLo4C,EAAe,QAAAp4C,OACnB62C,GAAYmB,eAAc,aAAAh4C,OACxB62C,GAAYmB,eAAc,SAAAh4C,OAAQ7nC,EAAEmgF,aAAY,MAAAt4C,OAAK62C,GAAYqB,WAAU,OAElF3K,GAAWp1E,EAAEmgF,aAAa,OAADt4C,OAAS7nC,EAAEi4E,gBAAe,MAEvD,GAKImI,GAAc,CAAE7qB,KAAM,EAAKQ,IAAK,IAAKC,KAAM,IAyBjD,GAvBoB,CAClB,CACEv2D,KAAM,iBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMd,kBAAmBnB,KAAM,GACrC,CAAEhqC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAAS+H,IAAA,IAAC,OAAElV,EAAM,KAAEjX,EAAI,MAAE0X,EAAK,KAAEb,GAAMsV,EAAA,OACpCtV,EAAK4L,OACN5L,EAAK8J,YAAc,GACnB9J,EAAK8J,YAAc,IACnB3gB,EAAK/zD,OAAS,GACd+zD,EAAK/zD,QAAU,GACf68E,GAAUjS,IACVa,EAAMva,QACJ,CAAC9gD,EAAGiT,KAAC,IAAAg1D,EAAA,MAA0B,gBAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,KAAuBnT,EAAI,EAAIA,CAAC,GACvD,GACE,GACJ6vE,GAAYjV,EAAO36B,QAAQ2lB,MAAM,IC7PjCmqB,GAAe,CACnB,CAAE/uB,KAAM0sB,GAAa9sB,IAAK,GAC1B,CAAEI,KAAM2sB,GAAc/sB,IAAK,GAC3B,CAAEI,KAAM4sB,GAAuBhtB,IAAK,GACpC,CAAEI,KAAM8sB,GAAMltB,IAAK,GACnB,CAAEI,KAAM+sB,GAAcntB,IAAK,GAC3B,CAAEI,KAAM,KAAMJ,IAAK,IAGRovB,GAAUxL,GAAO,UAAW,CACvC,mBACA,cACA,SACA,cAGIoD,GAAyC,IAC1C5H,GACHK,gBAAiBA,IAAM,EACvBlC,qBAAuBC,GACrBA,EAASwB,SAAS9e,QAAO,CAAC9gD,EAAGvQ,IAAMuQ,EAAIvQ,EAAE0mE,UAAU,GACrD7U,MAAOrB,IAAuB,IAAtB,OAAE2a,EAAM,KAAEJ,GAAMva,EACtB,MAAM4F,EAAM+U,EAAOjV,KAAKrE,MAAMkZ,EAAKjyC,IAGnC,MAAO,CAAEpV,IAAK,SAAUq7D,YAFJ3oB,EAAIzF,QAAQ,CAAEzhD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,EAAGzyB,IAAK,IAEtB89D,SADpBtF,GAAa,CAACzU,EAAIpF,eAAesvB,MACH,EAEjDtuB,kBAAmBge,GAAsB,GACzC/d,eAAgBxB,IAA6C,IAAD+vB,EAAA,IAA3C,OAAErV,EAAM,KAAEJ,EAAI,MAAES,EAAK,cAAE0L,GAAezmB,EACrDymB,EAAcn4E,OACT+rE,GAAUC,GAAM,CAAC1rE,EAAGsO,KACrB,MAAM6C,EAAIg7D,EAAM/sE,IAAIY,EAAGsO,GACvB,QAAS6C,IAAMA,EAAE83D,MAAM,KAEzB,GAIsC,QADxCkY,EAAArV,EAAOS,MACJG,MAAMvoD,IAAC,IAAAg1D,EAAA,MAAyB,QAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,IAAY,WAAC,IAAA88D,GADxCA,EAEItsB,KAAKruC,SAAS46D,IACd/V,GAASS,EAAOS,MAAM6U,GAAO1I,KAAKC,YAAY,CAAC9oE,EAAGC,KAChD,IAAK,MAAM+P,KAAO44C,EAAS5oD,EAAEkyD,OAAQjyD,EAAEiyD,QACjCoK,EAAM/sE,OAAOygB,KAAS8oD,GAAKc,WAC7B0C,EAAMzsE,OAAOmgB,EAAK8oD,GAAKY,WAE3B,GACA,GACF,EAENrW,cAAexB,IAQR,IARS,OACdoa,EAAM,KACNJ,EAAI,OACJyU,EAAM,aACNC,EAAY,SACZtP,EAAQ,eACRuP,EAAc,kBACdrI,GACDtmB,EACC,MAAMqF,EAAM+U,EAAOjV,KAAK3D,cAAcwY,EAAKjyC,KACpCz5B,EAAGsO,GAAKm9D,GACbC,GACA,CAAC1rE,EAAGsO,KAAC,IAAA+yE,EAAA,QAE8B,QAA/BA,EAAAvV,EAAOqK,eAAe/2E,IAAIY,EAAGsO,UAAE,IAAA+yE,IAA/BA,EAAiCjL,aAChCtK,EAAOK,MAAM/sE,IAAIY,EAAGsO,GAAI06D,QAC1B,IAECsY,EAAiB5V,EAAK4D,SAASwB,SAAS1jB,KAAKsa,IACjD,GAAsB,QAAlBA,EAAS8E,KAAgB,CAC3B,MAAMroD,EAAIsnD,GACRC,GACA,CAAC1rE,EAAGsO,KAAC,IAAAizE,EAAA,QAE8B,QAA/BA,EAAAzV,EAAOqK,eAAe/2E,IAAIY,EAAGsO,UAAE,IAAAizE,IAA/BA,EAAiCnL,aACjCtK,EAAOK,MAAM/sE,IAAIY,EAAGsO,KAAOq6D,GAAKU,MACjC,IAEL,IAAKllD,EACH,MAAM,IAAIpgB,MAAM,uCAADykC,OAAwCkjC,EAAKjyC,KAE9D,OAAO4mD,EAAe9mC,OAAO,IACxBgsB,GAAe,CAAEvlE,EAAGmkB,EAAE,GAAI7V,EAAG6V,EAAE,GAAI4yC,QACtC2Q,YAEJ,CACA,OAAO2Y,EAAe9mC,OAAO,IACxBgsB,GAAe,CAAEvlE,IAAGsO,IAAGyoD,QAC1B2Q,YACA,IAEE8Z,EAAwB,GAC9B,IAAK,IAAI5gF,EAAI,EAAGA,EAAI8qE,EAAK4D,SAASoQ,YAAa9+E,IAAK,CAClD,MAAM6gF,EAAUH,EAAe1gF,GACzBif,EAAM4hE,EAAU3c,GAAS2c,GAAWlc,GAAe,CAAEvlE,IAAGsO,IAAGyoD,QAC3D2qB,EAAqBlW,GAAa,CACtC,SACO,IAAN5qE,GAAWm2D,EAAI9F,OAAO,OAAU,eAC1B,OAAPwwB,QAAO,IAAPA,OAAO,EAAPA,EAAS/Z,SAASiX,MAEdgD,EAAQvB,EAAa7mC,OAAO,IAC7B15B,EACH6hE,YAEEJ,EAAe1gF,KACjB0gF,EAAe1gF,GAAK,IAAK0gF,EAAe1gF,GAAIw+E,SAAUuC,EAAMloD,KAE9D+nD,EAAalgF,KAAKqgF,EACpB,CACA7Q,EAASxvE,QAAQggF,GACjBnB,EAAO7+E,QAAQkgF,GACfxJ,EACElT,GAAS,CACP9kE,EAAGwhF,EAAa,GAAGxhF,EACnBsO,EAAGkzE,EAAa,GAAGlzE,EACnB81D,QAASsH,EAAKgN,KAAKC,WAAW,GAAG5W,OACjC0C,MAAOx0D,KAAKwkD,GAAK,IAEpB,EAEHR,aAAAA,CAAaoF,GAAc,IAAb,OAAEyS,GAAQzS,EACtB,GAAIyS,EAAOS,MAAMF,MAAMX,IAAI,IAAA+T,EAAA,MAA4B,QAAV,QAAbA,EAAA/T,EAAK4D,gBAAQ,IAAAmQ,OAAA,EAAbA,EAAep7D,IAAY,IAEzD,OAAOwxD,GACL,iCAAiC,cAADrtC,OAClB04C,GAAQU,OAAM,KAC5B7L,GACEmL,GAAQU,OACR,kBACA,qBACA,qBACA,MAADp5C,OACKyvC,GAAQI,QAAO,QAAA7vC,OAAO04C,GAAQW,UAAS,KAC7C9L,GACEmL,GAAQW,UACR,iBACA,oBACA,qBAMN,MAAMC,EAAM9L,GAAalK,EAAO3Y,KAAK4uB,cAAcjW,EAAOjV,MAAMr0B,MAEhE,OAAOqzC,GACL,2BAA2B,UAADrtC,OAChB04C,GAAQc,iBAAgB,MAAAx5C,OAAKs5C,EAAG,WAAAt5C,OACpC4/B,GAAgB3uC,GAAE,UAAA+O,OAAS04C,GAAQe,YAAW,KACpDlM,GAAWmL,GAAQe,YAAY,OAADz5C,OAAS04C,GAAQc,iBAAgB,MAEnE,GA2DF,GAxDoB,CAClB,CACE5hF,KAAM,iBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMG,aAEd3D,gBAAiBhY,IAAA,IAAC,KAAEmS,GAAMnS,EAAA,OACxBtpD,KAAK+C,IAAI04D,EAAK8F,gBAAkB9F,EAAK+F,UAAW,EAAE,EACpDrK,IAAK6J,IAAA,IAAC,KAAEvF,GAAMuF,EAAA,OAAKhhE,KAAK+C,IAAI04D,EAAKgG,YAAchG,EAAK+F,UAAW,GAAG,EAClE3e,SAAW3uD,GACForE,GAAYprE,EAAM,CAAEuqE,SAAU,IAEvCqK,SAAUC,IAAA,IAAC,OAAElN,EAAM,KAAEJ,GAAMsN,EAAA,OACxBtN,EAAK4L,OACN5L,EAAK8J,YAAc,GACnBkI,GAAe5R,EAAOS,MAAOb,EAAM,QAClCiS,GAAUjS,GAAQ,EAAI,GAAI,GAE/B,CACEtrE,KAAM,2BACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcjB,KAAM,GAChC,CAAEhqC,GAAIisC,GAAMJ,gBAAiBr1D,MAAO,EAAGwzD,KAAM,IAC7C,CAAEhqC,GAAIisC,GAAMnM,OACZ,CAAE9/B,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMG,aAEd1iB,MAAOA,KAAA,CAASnuC,IAAK,SAAUq7D,YAAa,EAAG5O,SAAU,CAACiO,MAC1DhG,SAAUG,IAAA,IAAC,OAAEpN,EAAM,KAAEJ,GAAMwN,EAAA,OACzBxN,EAAK4L,QAAU3O,GAAKU,OACpBqC,EAAK8J,YAAc,GACnBiI,GAAc3R,EAAOS,MAAOb,EAAM,OAClC,EAAG,GAEP,CACEtrE,KAAM,gCACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcjB,KAAM,GAChC,CAAEhqC,GAAIisC,GAAMH,eAAgBt1D,MAAO,EAAGwzD,KAAM,IAC5C,CAAEhqC,GAAIisC,GAAMnM,OACZ,CAAE9/B,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMP,oBAEdhiB,MAAOA,KAAA,CAASnuC,IAAK,SAAUq7D,YAAa,EAAG5O,SAAU,CAACmO,MAC1DlG,SAAUK,IAAA,IAAC,OAAEtN,EAAM,KAAEJ,GAAM0N,EAAA,OACzB1N,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAK8J,YAAc,GACnBiI,GAAc3R,EAAOS,MAAOb,EAAM,OAClC,EAAG,IC5OHoN,GAAoC,IACrC5H,GACH7d,mBAAqBlvD,GAASkvD,GAAmBlvD,IAgHnD,GA7GoB,CAClB,CACE/D,KAAM,iBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMzL,KAAMhqD,MAAO,EAAGwzD,KAAM,KAClC,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMzL,KAAMxX,IAAK,KACzB,CAAEI,KAAM6iB,GAAMxL,WAAYzX,IAAK,KAC/B,CAAEI,KAAM6iB,GAAMN,mBAAoB3iB,IAAK,KAEzCghB,KAAM,GAER,CAAEhqC,GAAIisC,GAAML,qBAEduE,QAAS9nB,IAAA,IAAC,KAAEua,GAAMva,EAAA,OAAMua,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,GAAI,GAEpE,CACEp1E,KAAM,eACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMT,aAAch1D,MAAO,EAAGwzD,KAAM,IAC1C,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMT,aAAcxiB,IAAK,KACjC,CAAEI,KAAM6iB,GAAMR,mBAAoBziB,IAAK,IAEzCghB,KAAM,GAER,CAAEhqC,GAAIisC,GAAMG,YACZ,CAAEpsC,GAAIisC,GAAMjB,KAAMx0D,MAAO,EAAGwzD,KAAM,KAEpCmG,QAAS7nB,IAAA,IAAC,MAAEmb,EAAK,KAAEb,GAAMta,EAAA,OACtBsa,EAAK4L,OACN5L,EAAK8J,YAAc,IACnBkI,GAAenR,EAAOb,EAAM,OAC5B,CAAC,GAEL,CACEtrE,KAAM,gBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMzL,KAAMhqD,MAAO,EAAGwzD,KAAM,IAClC,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMzL,KAAMxX,IAAK,KACzB,CAAEI,KAAM6iB,GAAMxL,WAAYzX,IAAK,IAEjCghB,KAAM,GAER,CAAEhqC,GAAIisC,GAAME,oBAAqBnC,KAAM,IACvC,CAAEhqC,GAAIisC,GAAMjB,KAAMx0D,MAAO,EAAGwzD,KAAM,KAEpCmG,QAASvnB,IAAA,IAAC,KAAEga,GAAMha,EAAA,OAAMga,EAAK4L,OAAS5L,EAAK8J,YAAc,IAAM,CAAC,GAElE,CACEp1E,KAAM,4BACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOtpD,MAAO,EAAGwzD,KAAM,IACnC,CAAEhqC,GAAIisC,GAAMD,qBAAsBhC,KAAM,IACxC,CAAEhqC,GAAIisC,GAAMF,eAAgB/B,KAAM,GAClC,CAAEhqC,GAAIisC,GAAMR,oBACZ,CAAEzrC,GAAIisC,GAAMP,mBACZ,CAAE1rC,GAAIisC,GAAMjB,KAAMx0D,MAAO,EAAGwzD,KAAM,KAEpCmG,QAAS5f,IAAA,IAAC,MAAEkT,EAAK,KAAEb,GAAMrS,EAAA,OACtBqS,EAAK4L,OACN5L,EAAK8J,YAAc,GACa,IAAhC9J,EAAKgN,KAAKC,WAAW73E,QACrByrE,EAAMF,MAAMloD,GAAMunD,EAAK2L,WAAWlzD,EAAEsV,KAAOtV,EAAEmzD,SAC7C,CAAC,GAEL,CACEl3E,KAAM,mBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmBrB,KAAM,IACrC,CAAEhqC,GAAIisC,GAAMb,iBAAkBpB,KAAM,IACpC,CAAEhqC,GAAIisC,GAAMxL,WAAYjqD,MAAO,EAAGwzD,KAAM,IACxC,CAAEhqC,GAAIisC,GAAMnM,MAAOtpD,MAAO,EAAGwzD,KAAM,GACnC,CAAEhqC,GAAIisC,GAAMzL,KAAMhqD,MAAO,EAAGwzD,KAAM,IAClC,CAAEhqC,GAAIisC,GAAMxL,YACZ,CAAEzgC,GAAIisC,GAAMP,oBAEdyE,QAAS1f,IAAA,IAAC,KAAEmS,GAAMnS,EAAA,OAAMmS,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,EAAG,GAEnE,CACEp1E,KAAM,qBACH04E,MACA3D,GACD,CACErsC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMf,YAAaliB,IAAK,KAChC,CAAEI,KAAM6iB,GAAMd,kBAAmBniB,IAAK,KACtC,CAAEI,KAAM6iB,GAAMnM,MAAO9W,IAAK,IAE5BxyC,MAAO,EACPwzD,KAAM,GAER,CAAEhqC,GAAIisC,GAAMC,oBAAqBlC,KAAM,GACvC,CAAEhqC,GAAIisC,GAAME,oBAAqBnC,KAAM,MAEzCmG,QAAShI,IAAA,IAAC,KAAEvF,GAAMuF,EAAA,OAAMvF,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,EAAG,IC7G/DsD,GAAoC,IACrC3H,IAoHL,GAjHoB,CAClB,CACE/wE,KAAM,eACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMP,mBACZ,CAAE1rC,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAASnsB,IAAA,IAAC,KAAEua,GAAMva,EAAA,OAAMua,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,CAAC,GAEjE,CACEp1E,KAAM,6BACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOkK,KAAM,GACzB,CAAEhqC,GAAIisC,GAAMP,mBACZ,CAAE1rC,GAAIisC,GAAMjB,OAEdwJ,QAASlsB,IAAA,IAAC,OAAE0a,EAAM,KAAEJ,GAAMta,EAAA,OACxB0a,EAAO36B,QAAQmmB,cACdoU,EAAK4L,OACN5L,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAK6E,uBAAyB,GACnC,EAAG,EACLrqB,aAAAA,CAAc/uD,GACZ,MAAM4yD,EAAM5yD,EAAK2nE,OAAOjV,KAAK3D,cAAc/uD,EAAKunE,KAAKjyC,IAErD2zC,GAAsBjpE,EAAM4yD,EADd9mD,KAAKE,KAAKhM,EAAKunE,KAAKxW,gBAAkB,GAEtD,GAEF,CACE90D,KAAM,iBACH04E,MACA3D,GACD,CACErsC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMnM,MAAO9W,IAAK,GAC1B,CAAEI,KAAM6iB,GAAMzL,KAAMxX,IAAK,IACzB,CAAEI,KAAM6iB,GAAMxL,WAAYzX,IAAK,MAGnC,CAAEhpB,GAAIisC,GAAMG,YACZ,CAAEpsC,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAAS5rB,IAAA,IAAC,KAAEga,GAAMha,EAAA,OAAMga,EAAK4L,OAAS5L,EAAK8J,YAAc,GAAK,CAAC,GAEjE,CACEp1E,KAAM,WACH04E,GACHvH,gBAAiBlY,IAAA,IAAC,KAAEqS,GAAMrS,EAAA,OAAK,EAAIqS,EAAK8F,gBAAkB9F,EAAK+F,SAAS,KACrE0D,GACD,CAAErsC,GAAIisC,GAAM1L,MAAO/pD,MAAO,EAAGwzD,KAAM,GACnC,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMP,kBAAmB1iB,IAAK,GACtC,CAAEI,KAAM6iB,GAAMjB,KAAMhiB,IAAK,MAG7B,CAAEhpB,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BjgB,aAAAA,CAAc1uD,GACZ6qE,GAAiB7qE,EAAM,CACrBuqE,SAAUz+D,KAAK+C,IAAI7O,EAAK2nE,OAAO36B,QAAQkkB,oBAAqB,MAEhE,EACAioB,QAAS/jB,IAAA,IAAC,KAAEmS,GAAMnS,EAAA,OAAKmS,EAAK4L,QAAU3O,GAAKU,OAAS,CAAC,GAEvD,CACEjpE,KAAM,YACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM1L,MAAOyJ,KAAM,IACzB,CAAEhqC,GAAIisC,GAAMnM,MAAOkK,KAAM,IAAMF,OAAQ,GACvC,CAAE9pC,GAAIisC,GAAMN,mBAAoB3B,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMP,kBAAmB5B,OAAQ,IAEzC0K,QAASrM,IAAA,IAAC,MAAE1E,EAAK,KAAEb,GAAMuF,EAAA,OACvBvF,EAAK4L,QAAU3O,GAAKU,OAASqU,GAAenR,EAAOb,EAAM/C,GAAKU,QAAU,CAAC,GAE7E,CACEjpE,KAAM,gBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM3L,KAAM9pD,MAAO,EAAGwzD,KAAM,GAClC,CAAEhqC,GAAIisC,GAAMP,kBAAmBl1D,MAAO,EAAGwzD,KAAM,GAC/C,CAAEhqC,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAAStE,IAAA,IAAC,KAAEtN,GAAMsN,EAAA,OAAKtN,EAAK4L,QAAU3O,GAAKS,MAAQ,CAAC,GAEtD,CACEhpE,KAAM,mCACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAM3L,KAAM9pD,MAAO,EAAGwzD,KAAM,GAClC,CAAEhqC,GAAIisC,GAAMP,mBACZ,CAAE1rC,GAAIisC,GAAMjB,OAEdwJ,QAASpE,IAAA,IAAC,OAAEpN,EAAM,KAAEJ,GAAMwN,EAAA,OACxBpN,EAAO36B,QAAQmmB,aACU,SAAzBwU,EAAO36B,QAAQ2lB,OACf4U,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAK6E,uBAAyB,GACnC,CAAC,EACHrqB,aAAAA,CAAc/uD,GACZ,MAAM4yD,EAAM5yD,EAAK2nE,OAAOjV,KAAK3D,cAAc/uD,EAAKunE,KAAKjyC,IAErD2zC,GAAsBjpE,EAAM4yD,EADd9mD,KAAKE,KAAKhM,EAAKunE,KAAKxW,gBAAkB,GAEtD,IC9GE4jB,GAAoC,IACrC5H,GACHK,gBAAiBA,IAAM,EACvB5e,kBAAmBge,GAAsB,GACzC/d,eAAiBzuD,IACf,MAAO+9E,GAAa9P,GAClB,CACEr6B,MAAO,CAAEl4B,GAAQkoD,GAAWT,OAAO,IAAKznD,EAAKioD,iBAAiB,MAEhE3jE,GAEF+9E,EAAUva,WAAWnhD,SAAQ2qC,IAAA,IAAEnxD,EAAGsO,GAAE6iD,EAAA,OAClChtD,EAAKgoE,MAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKwB,WAAW,IAEvChmE,EAAK0sE,UAAUvvE,KAAK4gF,GACpB/9E,EAAK0zE,cAAcn4E,OAAOwiF,EAAUva,WAAW,IAAI,GACnDxjE,EAAK6zE,kBACHlT,GAAS,CACP9kE,EAAGkiF,EAAUliF,EACbsO,EAAG4zE,EAAU5zE,EACbg2D,IAAK4d,EAAU5d,IAAgB,IAAVr0D,KAAKwkD,GAC1BgQ,MAAOx0D,KAAKwkD,GAAK,IAEpB,EAEH1B,eAAiB5uD,IACf,MAAMkpD,EAAQlpD,EAAK2nE,OAAO36B,QAAQsmB,SAC9BtzD,EAAK2nE,OAAOjV,KACT9D,eAAe5uD,EAAKunE,KAAKjyC,IACzB63B,QAAQ,CAAEzhD,EAAG,IAAKC,EAAG,EAAG21B,IAAK,EAAGzyB,IAAK,SACxCw9C,EACJgd,GAAkBrpE,EAAM,CAAEkpD,SAAQ,EAEpCiG,gBAAkBnvD,GAChBmvD,GAAgBnvD,EAAM,CACpBg4E,gBAAiB,CAAE12C,IAAK,IAAKzyB,IAAK,KAClConE,aAAc,CAAEx7D,KAAM,EAAGs9D,UAAW,GACpClB,UAAW,GACXH,SAAU,IAEd3R,SAAU,IAGNiZ,GAAOhN,GACX,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMR,mBAAoBzB,KAAM,GACtC,CAAEhqC,GAAIisC,GAAMG,aAuCd,GApCqB,CACnB,CACE90E,KAAM,gBACH04E,MACAqJ,GACHpJ,SAAU3nB,IAAA,IAAC,OAAE0a,EAAM,KAAEJ,GAAMta,EAAA,OACxBsa,EAAK4L,OACN5L,EAAK8J,YAAc,GACnBkI,GAAe5R,EAAOS,MAAOb,EAAM,OACnC,CAAC,GAEL,CACEtrE,KAAM,WACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMxL,WAAYuJ,KAAM,GAC9B,CAAEhqC,GAAIisC,GAAMG,aAEd6D,SAAUrnB,IAAA,IAAC,OAAEoa,EAAM,KAAEJ,GAAMha,EAAA,OACxBga,EAAK4L,OACN5L,EAAK8J,YAAc,GACnBkI,GAAe5R,EAAOS,MAAOb,EAAM,OACnC,CAAC,GAEL,CAIEtrE,KAAM,oCACH04E,MACAqJ,GACH5Q,gBAAiBA,IAAM,EACvBwH,SAAU1f,IAAA,IAAC,KAAEqS,GAAMrS,EAAA,OAAMqS,EAAK4L,OAAS5L,EAAK8J,aAAe,GAAK,GAAI,ICzElE4M,GAAgBj+E,GACpBA,EAAKunE,KAAKC,WAAWgC,SAAS/B,GAC5BA,EAAM/Z,QAAQhyC,GAAQ1b,EAAK2nE,OAAOK,MAAM/sE,OAAOygB,KAAS8oD,GAAKuB,cAG3DmY,GAAqB,CACzBh+D,IAAK,YAGDi+D,GAAyD,IAC1DpR,GACH1e,MAAOA,IAAM6vB,GACbxvB,aAAAA,CAAc1uD,GACZ6qE,GAAiB7qE,EAAM,CACrBuqE,SAAUz+D,KAAK+C,IAAI7O,EAAK2nE,OAAO36B,QAAQikB,oBAAqB,KAEhE,EACArC,cAAAA,CAAe5uD,GACb,MAAMkpD,EAAQlpD,EAAK2nE,OAAOjV,KACvB9D,eAAe5uD,EAAKunE,KAAKjyC,IACzB63B,QAAQ,CAAEzhD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,EAAGzyB,IAAK,IACtCw6D,GAAkBrpE,EAAM,CAAEkpD,SAC5B,EACAiG,gBAAkBnvD,IAChB,MAAMo+E,EAAYH,GAAaj+E,GAAMrD,OACrC,OAAOwyD,GAAgBnvD,EAAM,CAC3Bg4E,gBAAiB,CAAE12C,IAAK,GAAIzyB,IAAK,IACjC4oE,gBAAiB,EACjBxB,aAAc,CAAEx7D,KAAM3O,KAAKrN,MAAMguE,GAAiBzsE,EAAK2nE,QAAU,KACjEqO,qBAAqB,EACrBU,SAAU0H,GACV,EAEJnvB,OAAQjC,IAAuB,IAAtB,OAAE2a,EAAM,KAAEJ,GAAMva,EACvB,MAAMqnB,EAAavC,GAAkBnK,EAAQJ,GAC7C,IAAK8M,EACH,OAGF,MAAM73E,EAAI+0E,GAAO,IAADltC,OAAKkjC,EAAKjyC,GAAE,UAAU,CAAC,kBAAmB,eACpDuiB,EAAU8vB,EAAO3Y,KAAKqvB,sBAAsB1W,EAAOjV,MAAMr0B,KAE/D,OAAOqzC,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,yBAAA+O,OACH7nC,EAAEi4E,gBAAe,MAAApwC,OAAKwtC,GAAah6B,GAAQ,kBAAAxT,OACxCotC,GAAe9J,EAAQ0M,GAAW,MAAAhwC,OAAK7nC,EAAEk4E,WAAU,KAChE9C,GACEp1E,EAAEk4E,WAAW,OAADrwC,OACL7nC,EAAEi4E,gBAAe,YAAApwC,OACjBotC,GAAe9J,EAAQ0M,GAAW,MAE5C,GAICiK,GAAyC,IAC1CtR,GACHI,gBAAiBngB,IAAA,IAAC,KAAEsa,GAAMta,EAAA,OACxBnhD,KAAK+C,IAAI04D,EAAK8F,gBAAkB9F,EAAK+F,UAAW,EAAE,EACpD5e,aAAAA,CAAc1uD,GACZ6qE,GAAiB7qE,EAAM,CACrBuqE,SAAUz+D,KAAK+C,IAAI7O,EAAK2nE,OAAO36B,QAAQkkB,oBAAqB,MAEhE,EACAtC,cAAAA,CAAe5uD,GACb,MAAMkpD,EAAQlpD,EAAK2nE,OAAOjV,KACvB9D,eAAe5uD,EAAKunE,KAAKjyC,IACzB63B,QAAQ,CAAEzhD,EAAG,EAAGC,EAAG,EAAG21B,IAAK,EAAGzyB,IAAK,IAChCi5D,EAAa9nE,EAAKunE,KAAKC,WAAWgC,SAAS/B,GAC/CA,EAAM/Z,QACHhyC,IAAG,IAAAswD,EAAA,OACFhsE,EAAKgoE,MAAM/sE,OAAOygB,KAAS8oD,GAAKC,SAElB,QADduH,EAAChsE,EAAK2nE,OAAOM,cACVhtE,OAAOygB,UAAI,IAAAswD,GADbA,EAEG9D,MAAK,CAACC,EAAG1rE,IAAMA,IAAMuD,EAAKunE,KAAKjyC,KAAG,MAG5C+zC,GAAkBrpE,EAAM,CAAEkpD,QAAO4e,cACnC,EACA3Y,gBAAkBnvD,IAChB,MAAMu+E,EAAQN,GAAaj+E,GAC3B,OAAOmvD,GAAgBnvD,EAAM,CAC3Bq3E,QAASkH,EAAMt1B,KAAIsE,IAAA,IAAE1xD,EAAGsO,GAAEojD,EAAA,MAAM,CAAE1xD,IAAGsO,IAAGmkE,OAAQ,EAAG,IACnD0J,gBAAiB,CAAE12C,IAAK,GAAIzyB,IAAK,KACjConE,aAAc,CACZx7D,KAA2B,EAArBza,EAAKunE,KAAKrE,SAChB6U,UAAW/3E,EAAKunE,KAAKrE,UAEvBwU,cAAe6G,EACf7H,SAAU6H,EAAM5hF,QAChB,GAmDN,GA/Cc,CACZ,CACEV,KAAM,eACHkiF,MACAnN,GACD,CAAErsC,GAAIisC,GAAMnM,MAAOtpD,MAAO,EAAGwzD,KAAM,GACnC,CAAEhqC,GAAIisC,GAAMT,aAAch1D,MAAO,EAAGwzD,KAAM,IAC1C,CACEhqC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMzL,KAAMxX,IAAK,KACzB,CAAEI,KAAM6iB,GAAMxL,WAAYzX,IAAK,IAEjCghB,KAAM,GAER,CAAEhqC,GAAIisC,GAAME,oBAAqBnC,KAAM,MAEzCmG,QAAS5f,IAAA,IAAC,OAAEyS,EAAM,MAAES,EAAK,KAAEb,GAAMrS,EAAA,OAC/ByS,EAAO36B,QAAQsmB,UACfiU,EAAK8J,aAAe,GACY,IAAhC9J,EAAKgN,KAAKC,WAAW73E,SACpB4qE,EAAK4L,QACL5L,EAAKkG,YACN8L,GAAenR,EAAOb,EAAM,QAC3Ba,EAAMF,MAAMloD,IAAC,IAAAg1D,EAAA,MAAyB,cAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,IAAkB,KACjD,GAAI,GAER,CACEjkB,KAAM,eACHqiF,MACAtN,GACD,CAAErsC,GAAIisC,GAAMnM,OACZ,CACE9/B,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAML,mBAAoB5iB,IAAK,GACvC,CAAEI,KAAM6iB,GAAMtL,UAAW3X,IAAK,KAGlC,CAAEhpB,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAAS/jB,IAAA,IAAC,OAAEuS,EAAM,KAAEJ,GAAMnS,EAAA,OACxBuS,EAAO36B,QAAQsmB,UACfiU,EAAKgN,KAAK6E,uBAAyB,IAClC7R,EAAK4L,QACL5L,EAAKkG,YACN,CAAC,ICtJDkH,GAAoC,IACrC3H,IAGCwR,GACJxa,GAAcd,SACde,GAAgBf,SAChB,EACAoB,GAAepB,SACf,EACA,EA2CF,GAzCkB,CAChB,CACEjnE,KAAM,oBACH04E,MACA3D,GACD,CAAErsC,GAAIisC,GAAMnM,OACZ,CACE9/B,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMP,kBAAmB1iB,IAAK,GACtC,CAAEI,KAAM6iB,GAAMjB,KAAMhiB,IAAK,MAG7B,CAAEhpB,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAASnsB,IAAA,IAAC,KAAEua,GAAMva,EAAA,OAAMua,EAAK4L,OAAS,EAAG,GAE3C,CACEl3E,KAAM,sBACH04E,MACA3D,GACD,CACErsC,GAAI4qC,GACF,CAAExhB,KAAM6iB,GAAMnM,MAAO9W,IAAK,GAC1B,CAAEI,KAAM6iB,GAAMxL,WAAYzX,IAAK,MAGnC,CAAEhpB,GAAIisC,GAAMjB,KAAMhB,KAAM,IAE1BwK,QAASlsB,IAAA,IAAC,KAAEsa,GAAMta,EAAA,OAAMsa,EAAK4L,OAAS,EAAG,GAE3C,CACEl3E,KAAM,yBACH04E,MACA3D,GAAQ,CAAErsC,GAAIisC,GAAMtL,WAAa,CAAE3gC,GAAIisC,GAAMjB,KAAMhB,KAAM,IAC5DwK,QAAS5rB,IAAA,IAAC,KAAEga,EAAI,cAAEkX,GAAelxB,EAAA,OAC9Bga,EAAK4L,OACNsL,GAAiBD,IACjBjX,EAAKgN,KAAK6E,uBAAyB,IACnC,EAAG,IC3CHhB,GAAW,CACfl4D,IAAK,YAGDy0D,GAA0C,IAC3C5H,GACH1e,MAAOA,IAAM+pB,GACbzK,WAAY3gB,IAAiB,IAAhB,OAAE2a,GAAQ3a,EACrB,MAAMkW,EAAWyE,EAAOS,MACrB1a,QAAQ6Z,IAAI,IAAA+T,EAAA,MAA4B,cAAV,QAAbA,EAAA/T,EAAK4D,gBAAQ,IAAAmQ,OAAA,EAAbA,EAAep7D,IAAkB,IAClD2tC,QAAO,CAAC9gD,EAAGw6D,IAASz7D,KAAK+C,IAAI9B,EAAGw6D,EAAKrE,WAAW,GACnD,KAAIA,EAAW,IAGf,MAAO,CAAEA,SAAqC,EAA3Bp3D,KAAKrN,MAAMykE,EAAW,GAAQkR,YAAY,EAAO,GAIlExyD,GAAI2vD,GAAO,SAAU,CAAC,eAAgB,UAAW,sBAEjDmN,GAAqB,IACtB/J,GACHvH,gBAAiBngB,IAAA,IAAC,KAAEsa,GAAMta,EAAA,OAAKsa,EAAK8F,gBAAkB9F,EAAK+F,UAAY,CAAC,EACxE5e,aAAAA,CAAc1uD,GACZ,MAAM2+E,EAAWtS,GACfrsE,EAAKunE,KAAKC,WAAWgC,SAAS/B,GAAUA,IACxCznE,EAAKgoE,OAED4W,EACJ5+E,EAAKunE,KAAKC,WAAW,GAAG7qE,OAAS,EAC7BqD,EAAKunE,KAAKC,WAAW,GACrB,IAAIxnE,EAAKunE,KAAKC,WAAW,MAAOxnE,EAAKunE,KAAKC,WAAW,IACrD/Z,EAAO,IACRkxB,EAAS11B,KAAK8E,IAAI,CAAQJ,IAAK,EAAIgxB,EAAShiF,OAAQoxD,cACpD6wB,EAAa31B,KAAK8E,IAAI,CAAQJ,IAAK,EAAIixB,EAAajiF,OAAQoxD,YAE3D6E,EAAM5yD,EAAK2nE,OAAOjV,KAAKhE,cAAc1uD,EAAKunE,KAAKjyC,IACrDu1C,GAAiB7qE,EAAM,CACrBsqE,cAAeA,IAAM1X,EAAIpF,eAAeC,GACxC8c,SAAU,GAEd,EACA3b,cAAAA,GAAkB,EAClBG,aAAAA,CAAc/uD,GACZ,GAAIA,EAAKunE,KAAK8J,YAAc,EAAG,CAC7B,MAAMze,EAAM5yD,EAAK2nE,OAAOjV,KAAK3D,cAAc/uD,EAAKunE,KAAKjyC,IAErD2zC,GAAsBjpE,EAAM4yD,EADd9mD,KAAKE,KAAKhM,EAAKunE,KAAKxW,gBAAkB,GAEtD,CACF,EACA7B,mBAAqBlvD,GACnBkvD,GAAmBlvD,EAAM,CACvB22E,aAA0C,IAA5B32E,EAAKunE,KAAKxW,gBACxBglB,cAAe,QACfnjB,IAAK5yD,EAAK2nE,OAAOjV,KAAKxD,mBAAmBlvD,EAAKunE,KAAKjyC,IACnDuhD,UAAwC,IAA7B72E,EAAKunE,KAAKzW,mBAEzBhB,aAAAA,CAAavC,GAAc,IAAb,OAAEoa,GAAQpa,EACtB,GAAKoa,EAAOgG,WAAWzK,SAGvB,OAAOwO,GACL,mBAAmB,QAADrtC,OACVziB,GAAEi9D,aAAY,oBAAAx6C,OACZziB,GAAEi2B,QAAO,MAAAxT,OAAKsjC,EAAO3Y,KAAK8vB,WAAWnX,EAAOjV,MAAMr0B,KAAI,YAAAgG,OACzDziB,GAAEm9D,kBAAiB,MAE9B,EACA9vB,MAAAA,CAAMiG,GAAoB,IAAnB,OAAEyS,EAAM,KAAEJ,GAAMrS,EACrB,IAAKyS,EAAOgG,WAAWzK,SACrB,OAEF,MAAM8b,EAAgBrX,EAAOS,MAAMF,MAChCloD,IAAC,IAAAg1D,EAAA,MAAyB,gBAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,IAAoB,IAKnC++D,EAAcxN,GAAe9J,EAAQJ,EAAKC,WAAW,GAAG,IACxDhrE,EAAI+0E,GAAO,IAADltC,OAAKkjC,EAAKjyC,GAAE,SAAS,CAAC,eAAgB,OAEtD,OAAOo8C,GAAe,MAADrtC,OACbkjC,EAAKjyC,GAAE,wBAAA+O,OACA46C,EAAW,MAAA56C,OAAK7nC,EAAE0iF,aAAY,KAC3CtN,GACEp1E,EAAE0iF,aAAa,KAAD76C,OACTziB,GAAEi9D,aAAY,gBAAAx6C,OAChBziB,GAAEi9D,aAAY,uBAAAx6C,OAEdziB,GAAEi9D,aAAY,WAGjBG,GAAa,KAAA36C,OAAS62C,GAAYh+E,KAAI,eACtC,GAAAmnC,OACGziB,GAAEm9D,kBAAiB,wBACtB,KAAA16C,OACKziB,GAAEm9D,kBAAiB,MAAA16C,OAAKsjC,EAAOgG,WAAWzK,SAAQ,MAAA7+B,OAAK7nC,EAAE2iF,GAAE,MAElEvN,GAAWp1E,EAAE2iF,GAAG,OAAD96C,OAASziB,GAAEi2B,QAAO,YAAAxT,OAAY46C,EAAW,MAE5D,GAGIG,GAAoB,IACrBzK,GACHzlB,mBAAqBlvD,GACnBkvD,GAAmBlvD,EAAM,CACvB22E,aAA0C,IAA5B32E,EAAKunE,KAAKxW,gBACxB8lB,UAAwC,EAA7B72E,EAAKunE,KAAKzW,oBCvGduuB,GAAa,IACrBC,MACAC,MACAC,MACA/F,MACAgG,MACAC,MACAC,MACAC,MACAC,MACAC,MACAC,MDgGY,CACf,CACE9jF,KAAM,gBACHyiF,MACA1N,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMxL,WAAYqJ,OAAQ,GAChC,CAAE9pC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAAS1f,IAAA,IAAC,MAAEgT,EAAK,KAAEb,GAAMnS,EAAA,OACtBmS,EAAK4L,OAC0B,IAAhC5L,EAAKgN,KAAKC,WAAW73E,QACrB68E,GAAUjS,IACVgS,GAAenR,EAAOb,EAAM,OAC5B,EAAG,GAEP,CACEtrE,KAAM,kBACHyiF,MACA1N,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMd,mBACZ,CAAEnrC,GAAIisC,GAAMb,iBAAkBpB,KAAM,KAEtCmG,QAAShI,IAAA,IAAC,KAAEvF,GAAMuF,EAAA,OACfvF,EAAK4L,OAC0B,IAAhC5L,EAAKgN,KAAKC,WAAW73E,QACrB68E,GAAUjS,IACV,EAAG,GAEP,CACEtrE,KAAM,oBACHmjF,MACApO,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,GAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMxL,WAAYuJ,KAAM,GAC9B,CAAEhqC,GAAIisC,GAAMnM,MAAOtpD,MAAO,EAAGszD,OAAQ,EAAGE,KAAM,GAC9C,CAAEhqC,GAAIisC,GAAMxL,WAAYqJ,OAAQ,GAChC,CAAE9pC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAASD,IAAA,IAAC,KAAEtN,GAAMsN,EAAA,OACftN,EAAK4L,OAAS5L,EAAKgN,KAAKC,WAAW73E,QAAU,GAAK68E,GAAUjS,IAAS,CAAC,GAE3E,CACEtrE,KAAM,iBACHmjF,MACApO,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,GAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmBnB,KAAM,GACrC,CAAEhqC,GAAIisC,GAAM1L,MAAO/pD,MAAO,EAAGwzD,KAAM,GACnC,CAAEhqC,GAAIisC,GAAMxL,WAAYqJ,OAAQ,GAChC,CAAE9pC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAASC,IAAA,IAAC,KAAExN,GAAMwN,EAAA,OAChBxN,EAAK4L,QAAU3O,GAAKU,OACpBqC,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAKC,WAAW73E,QAAU,GAC/B68E,GAAUjS,IACV,EAAG,EACLxY,aAAAA,CAAc/uD,GACZ,MAAM4yD,EAAM5yD,EAAK2nE,OAAOjV,KAAK3D,cAAc/uD,EAAKunE,KAAKjyC,IACrD,GAAkC,QAA9Bt1B,EAAK2nE,OAAO36B,QAAQ2lB,OAAmBC,EAAI9F,OAAO,IAAM,CAE1Dmc,GAAsBjpE,EAAM4yD,EADd9mD,KAAKE,KAAKhM,EAAKunE,KAAKxW,gBAAkB,GACZ,QAC1C,CACF,GAEF,CACE90D,KAAM,qBACHyiF,MACA1N,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMJ,gBAAiBr1D,MAAO,EAAGwzD,KAAM,GAC7C,CAAEhqC,GAAIisC,GAAMxL,WAAYqJ,OAAQ,GAChC,CAAE9pC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAASG,IAAA,IAAC,MAAE7M,EAAK,KAAEb,GAAM0N,EAAA,OACvB1N,EAAK4L,QAAU3O,GAAKU,OACpBqC,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAKC,WAAW73E,QAAU,GAC/B68E,GAAUjS,IACVgS,GAAenR,EAAOb,EAAM,OAC5B,EAAG,GAEP,CACEtrE,KAAM,sBACHmjF,MACApO,GACD,CAAErsC,GAAIisC,GAAMZ,kBAAmB70D,MAAO,EAAGwzD,KAAM,GAC/C,CAAEhqC,GAAIisC,GAAMb,iBAAkB50D,MAAO,EAAGwzD,KAAM,IAC9C,CAAEhqC,GAAIisC,GAAMd,kBAAmBnB,KAAM,GACrC,CAAEhqC,GAAIisC,GAAM3L,KAAM9pD,MAAO,EAAGwzD,KAAM,GAClC,CAAEhqC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAAS0H,IAAA,IAAC,KAAEjV,GAAMiV,EAAA,OAChBjV,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAKC,WAAW73E,QAAU,GAC/B68E,GAAUjS,IACV,EAAG,GAEP,CACEtrE,KAAM,0BACHyiF,MACA1N,GACD,CAAErsC,GAAIisC,GAAMhB,aAAcz0D,MAAO,EAAGwzD,KAAM,GAC1C,CAAEhqC,GAAIisC,GAAMH,eAAgBt1D,MAAO,EAAGwzD,KAAM,GAC5C,CAAEhqC,GAAIisC,GAAMtL,UAAWqJ,KAAM,KAE/BmG,QAAS+H,IAAA,IAAC,MAAEzU,EAAK,KAAEb,GAAMsV,EAAA,OACvBtV,EAAK4L,QAAU3O,GAAKS,MACpBsC,EAAK8J,YAAc,GACnB9J,EAAKgN,KAAKC,WAAW73E,QAAU,GAC/B68E,GAAUjS,IACVgS,GAAenR,EAAOb,EAAM,OAC5B,EAAG,KEhPIyY,GAAkBhzB,IAAsC,IAArC,OAAEsI,EAAM,QAAEtoB,GAAqBggB,EAC7D,SAASizB,EACP12E,EACAjO,GAEA,MAAMyR,EAAI,IAAKigC,EAAQgkB,YACvB,QAAc3E,IAAV/wD,GAIF,GAHIiO,KAAOwD,UACFA,EAAExD,GAEmB,IAA1BzD,OAAOyM,KAAKxF,GAAGpQ,OAEjB,YADA24D,EAAO,CAAEtE,gBAAY3E,SAInBt/C,EAAExD,KAASjO,IACbyR,EAAExD,GAAOjO,GAGbg6D,EAAO,CAAEtE,WAAYjkD,GACvB,CAEA,MAAO,IAAIsyE,IACR5rB,MAAK,CAAC/nD,EAAGC,IAAMD,EAAEzP,KAAKikF,cAAcv0E,EAAE1P,QACtCgtD,KAAKv9C,IAAO,IAADy0E,EACV,MAAMlsE,EAA0B,QAArBksE,EAAGnzC,EAAQgkB,kBAAU,IAAAmvB,OAAA,EAAlBA,EAAqBz0E,EAAEzP,MACrC,OACEu5D,EAAAA,EAAAA,MAAC4qB,EAAAA,SAAc,CAAAz4D,SAAA,EACb+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAIjc,EAAEzP,QACNu5D,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOC,SAASluC,SAAA,EAC9B+tC,EAAAA,EAAAA,KAAA,UACEC,UAAS,GAAAtxB,OAAKuxB,EAAOE,OAAM,KAAAzxB,OAAc,cAAVpwB,EAAwB2hD,EAAOI,SAAWJ,EAAOM,UAChFrZ,QAASA,IACPojC,EACEv0E,EAAEzP,KACQ,cAAVgY,OAAwBo4C,EAAY,aAEvC1kC,SACF,eAGD+tC,EAAAA,EAAAA,KAAA,UACEC,UAAS,GAAAtxB,OAAKuxB,EAAOE,OAAM,KAAAzxB,OAAc,YAAVpwB,EAAsB2hD,EAAOI,SAAWJ,EAAOM,UAC9ErZ,QAASA,IACPojC,EACEv0E,EAAEzP,KACQ,YAAVgY,OAAsBo4C,EAAY,WAErC1kC,SACF,iBAtBgBjc,EAAEzP,KA0BN,GAEnB,ECrDAokF,GAAe9oD,KAAKC,MAAQk1B,EAElC,SAAS4zB,GAAU9jF,GACjB,MAAMmS,EAAInS,EAAE4c,QAAQ,iBAAkB,IAChClF,EAAa,KAANvF,GAAY,EAAI+L,SAAS/L,EAAG,IACzC,OAAOuF,GAAQ,GAAKA,EAAOw4C,EAAex4C,OAAOm4C,CACnD,CAEA,SAASk0B,GAAY/jF,EAAW4lB,GAC9B,MAAMzT,EAAInS,EAAE2E,SAAS,IAAIq/E,SAAS,EAAG,KAAKrnE,cAC1C,OAAOiJ,EAAK,GAAAiiB,OACL11B,EAAEmN,UAAU,EAAG,GAAE,KAAAuoB,OAAI11B,EAAEmN,UAAU,EAAG,GAAE,KAAAuoB,OAAI11B,EAAEmN,UAAU,IACzDnN,CACN,CAEA,MAAM8xE,GAAsBlrB,GACZA,EAAoBrF,WAChBqF,EAAoBrF,UAAY,IAEhDqF,EAAoBpF,0BACpBoF,EAAoBnF,0BAMjB,SAASswB,GAAkB1zB,GAI9B,IAAD2zB,EAAA,IAJgC,cACjCC,GAGD5zB,EACC,MAAO6zB,EAAcC,IAAmB3pC,EAAAA,EAAAA,WAAS,IAC1CnK,EAASsoB,IAAUre,EAAAA,EAAAA,aACxB,CACE8pC,EACA/gF,KAIA,GAAa,UAATA,EACF,MAAO,CAAEkU,KAAM6sE,EAAI7sE,MAErB,MAAMnH,EAAI,IAAKg0E,KAAQ/gF,GACvB,IAAK,MAAMuJ,KAAOzD,OAAOyM,KAAKxF,QACbs/C,IAAXt/C,EAAExD,IACAA,KAAOwD,UACFA,EAAExD,GAIf,OAAOwD,CAAC,GAEV,CAAEmH,KAAqC,QAAjCysE,EAAEL,GAAUvhE,OAAOqc,SAAS4lD,aAAK,IAAAL,EAAAA,EAAIN,MAG7CzpC,EAAAA,EAAAA,YAAU,KACR,MAAMurB,EAAKA,KACT,MAAMjuD,EAAOosE,GAAUvhE,OAAOqc,SAAS4lD,WAC1B30B,IAATn4C,GACFohD,EAAO,CAAEphD,KAAMA,GACjB,EAGF,OADA6K,OAAOuP,iBAAiB,aAAc6zC,GAC/B,KACLpjD,OAAOwP,oBAAoB,aAAc4zC,EAAG,CAC7C,GACA,KAEHvrB,EAAAA,EAAAA,YAAU,KACR73B,OAAOqc,SAAS4lD,KAAOT,GAAYvzC,EAAQ94B,MAAM,EAAM,GACtD,CAAC84B,EAAQ94B,QAEZ0iC,EAAAA,EAAAA,YACE,IAAMgqC,EAAc,CAAE5zC,QAASkmB,EAAqBlmB,MACpD,CAACA,EAAS4zC,IAEZ,MAAMrrB,EAAsBrC,EAAqBlmB,GAC3C2kC,EAAO,CAAErc,SAAQtoB,UAASuoB,uBAEhC,OACEC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOqrB,aAAat5D,SAAA,EAClC6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOC,SAASluC,SAAA,EAC9B+tC,EAAAA,EAAAA,KAAA,SACE90C,KAAK,OACL+0C,UAAWC,EAAO1hD,KAClB5Y,MAAOilF,GAAmB,OAAPvzC,QAAO,IAAPA,OAAO,EAAPA,EAAS94B,MAAM,GAClC6iD,SAAWC,IACT,MAAM9iD,EAAOosE,GAAUtpB,EAAG72D,OAAO7E,YACpB+wD,IAATn4C,GACFohD,EAAO,CAAEphD,KAAMA,GACjB,EAEFgtE,YAAY,KAEdxrB,EAAAA,EAAAA,KAAA,UACEC,UAAWC,EAAOuB,KAClBta,QAASA,IACPyY,EAAO,CAAEphD,KAAMpI,KAAKrN,MAAMqN,KAAK+M,SAAW6zC,KAC3C/kC,SACF,YAIH+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOC,SAASluC,UAC9B6tC,EAAAA,EAAAA,MAAA,UACEG,UAAS,GAAAtxB,OAAKuxB,EAAOirB,aAAY,KAAAx8C,OAAIv+B,OAAOyM,KAAKy6B,GAASrwC,OAAS,IAAMkkF,EAAejrB,EAAOI,SAAW,IAC1GnZ,QAASA,IAAMikC,GAAiBtkF,IAAOA,IAAGmrB,SAAA,EAE1C+tC,EAAAA,EAAAA,KAAA,QAAA/tC,SAAM,cACN+tC,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,EAAOuB,KAAKxvC,SAC1Bk5D,EAAe,cAAgB,qBAIrCA,IACCrrB,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOurB,QAAQx5D,UAC7B6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOC,SAASluC,SAC7B4tC,EAAoB/B,UAAU72D,QAC7B+4D,EAAAA,EAAAA,KAAA,UACEC,UAAWC,EAAOI,SAClBnZ,QAASA,IAAMyY,EAAO,SAAS3tC,SAChC,yBAID+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,EAAOwB,eAG3B1B,EAAAA,EAAAA,KAACL,EAAM,CAAC1wB,GAAG,QAAQ0oB,QAAS,CAAC,OAAQ,MAAO,WAAaskB,KACzDjc,EAAAA,EAAAA,KAACL,EAAM,CAAC1wB,GAAG,cAAc0oB,QAAS,EAAC,GAAM,MAAYskB,KACrDjc,EAAAA,EAAAA,KAACL,EAAM,CAAC1wB,GAAG,WAAW0oB,QAAS,EAAC,GAAM,MAAYskB,KAClDjc,EAAAA,EAAAA,KAACL,EAAM,CAAC1wB,GAAG,cAAc0oB,QAAS,EAAC,GAAM,MAAYskB,UAGzDnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOurB,QAAQx5D,SAAA,EAC7B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,cACJ6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,eACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,aAAarD,IAAK,GAAIzyB,IAAK,OAAS8iE,KAC/Cjc,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,yBAAyBrD,IAAK,EAAGzyB,IAAK,MAAQ8iE,KACzDjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,0BACHrD,IAAK,EACLzyB,IAAK,EACL0oD,SAAO,KACHoa,QAGRnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,kBACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,YAAYrD,IAAK,EAAGzyB,IAAK,MAAQ8iE,QAE9Cnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,WACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,4BACHrD,IAAK,EACLzyB,IAAK0mD,EAAoBrF,aACrByhB,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,2BACHrD,IAAK,EACLzyB,IAAK0mD,EAAoBrF,aACrByhB,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,wBACHrD,IAAK,EACLzyB,IAAK/C,KAAKwkD,GACVkH,OAAK,KACDma,WAIVnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOurB,QAAQx5D,SAAA,EAC7B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,cACJ6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,WACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,aACHrD,IAAK,EACLzyB,IAAK4xE,GAAmBlrB,MACpBoc,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,YACHrD,IAAK,EACLzyB,IAAK4xE,GAAmBlrB,MACpBoc,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,aACHrD,IAAK,EACLzyB,IAAK0mD,EAAoBrF,aACrByhB,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,YACHrD,IAAK,EACLzyB,IAAK0mD,EAAoBrF,aACrByhB,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,eACHrD,IAAK,EACLzyB,IAAK4xE,GAAmBlrB,MACpBoc,QAGRnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,cAEF,CACE,sBACA,sBACA,kBACA,kBACA,oBAEFshC,KAAKtkB,IACL+wB,EAAAA,EAAAA,KAACS,EAAY,CAEXxxB,GAAIA,EACJrD,KAAM,GACNzyB,IAAK,IACL6nD,KAAM,OACFib,GALChtC,MAQT+wB,EAAAA,EAAAA,KAACS,EAAY,CACXxxB,GAAG,kBACHrD,KAAM,EACNzyB,IAAK,EACL6nD,KAAM,OACFib,KAENjc,EAAAA,EAAAA,KAACsqB,GAAe,IAAKrO,QAEvBnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,WACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,kBAAkBrD,IAAK,EAAGzyB,IAAK,EAAG0oD,SAAO,KAAKoa,KACzDjc,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,kBAAkBrD,IAAK,EAAGzyB,IAAK,EAAG0oD,SAAO,KAAKoa,WAG7Dnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOurB,QAAQx5D,SAAA,EAC7B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aACJ6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,SAEF,CACE,4BACA,4BACA,sBACA,sBACA,kBACA,kBACA,wBACA,yBAEFshC,KAAKtkB,IACL+wB,EAAAA,EAAAA,KAAC2B,EAAM,CAEL1yB,GAAIA,EACJrD,IAAK,EACLzyB,IAAK,EACL0oD,SAAO,EACPjC,OAAQA,EACRtoB,QAASA,EACTuoB,oBAAqBA,GAPhB5wB,YAYb6wB,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOurB,QAAQx5D,SAAA,EAC7B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aACJ6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,gBACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,oBACHrD,IAAK,EACLzyB,IAAK,IACL6nD,KAAM,KACFib,KAENjc,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,gBAAgBrD,IAAK,EAAGzyB,IAAK,GAAI6nD,KAAM,KAAOib,QAE3Dnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,gBACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAI,gBAAiBrD,IAAK,EAAGzyB,IAAK,MAAQ8iE,IAEhD,CACE,eACA,eACA,eACA,kBAEF1oB,KAAKtkB,IACL+wB,EAAAA,EAAAA,KAAC2B,EAAM,CAAU1yB,GAAIA,EAAIrD,IAAK,EAAGzyB,IAAK,OAAS8iE,GAAlChtC,SAGjB6wB,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aAEF,CAAC,0BAA2B,2BAC5BshC,KAAKtkB,IACL+wB,EAAAA,EAAAA,KAAC2B,EAAM,CAEL1yB,GAAIA,EACJrD,IAAK,EACLzyB,IAAK,EACL0oD,SAAO,EACPjC,OAAQA,EACRtoB,QAASA,EACTuoB,oBAAqBA,GAPhB5wB,YAYb6wB,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOurB,QAAQx5D,SAAA,EAC7B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,cACJ6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,YACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CACL1yB,GAAG,kBACHrD,IAAK,EACLzyB,IAAK,EACL6nD,KAAM,MACFib,QAGRnc,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,EAAOwrB,WAAWz5D,SAAA,EAChC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,YACJ+tC,EAAAA,EAAAA,KAAC2B,EAAM,CAAC1yB,GAAG,mBAAmBrD,IAAK,EAAGzyB,IAAK,EAAG0oD,SAAO,KAAKoa,eAOxE,CC5VA,UAAgB,cAAgB,6BAA6B,WAAa,0BAA0B,IAAM,mBAAmB,KAAO,oBAAoB,UAAY,yBAAyB,GAAK,kBAAkB,cAAgB,6BAA6B,GAAK,kBAAkB,SAAW,wBAAwB,SAAW,wBAAwB,KAAO,oBAAoB,aAAe,4BAA4B,cAAgB,6BAA6B,KAAO,oBAAoB,iBAAmB,gCAAgC,kBAAoB,iCAAiC,OAAS,sBAAsB,QAAU,uBAAuB,KAAO,oBAAoB,MAAQ,qBAAqB,OAAS,sBAAsB,QAAU,uBAAuB,MAAQ,qBAAqB,WAAa,0BAA0B,WAAa,0BAA0B,MAAQ,qBAAqB,OAAS,sBAAsB,OAAS,sBAAsB,OAAS,sBAAsB,OAAS,sBAAsB,MAAQ,qBAAqB,KAAO,oBAAoB,OAAS,sBAAsB,OAAS,sBAAsB,MAAQ,qBAAqB,OAAS,sBAAsB,aAAe,4BAA4B,MAAQ,qBAAqB,MAAQ,sBCG5wC0P,GAAQ,EAEC,SAASC,GAAgBt0B,GAIpC,IAJqC,UACvCu0B,GAGDv0B,EACC,OACEwI,EAAAA,EAAAA,MAAA,KAEEG,UAAS,GAAAtxB,OAAKuxB,GAAO2rB,UAAS,KAAAl9C,OAAIuxB,GAAO,GAADvxB,OAAIk9C,EAAUlZ,KAAI,UAAU1gD,SAAA,EAEpE+tC,EAAAA,EAAAA,KAAA,QACEC,UAAWC,GAAO3sB,GAClBptC,EAAG0lF,EAAUl/C,KAAOg/C,GACpBl3E,EAAGo3E,EAAUh/C,IAAM8+C,GACnBlmE,MAAOomE,EAAUpmE,MAAQkmE,GACzB3lD,OAAQ6lD,EAAU7lD,OAAS2lD,MAE7B3rB,EAAAA,EAAAA,KAAA,QACEC,UAAWC,GAAOrsB,GAClB1tC,EAAG0lF,EAAUl/C,KAAOg/C,GACpBl3E,EAAGo3E,EAAUh/C,IAAM8+C,GAAQ,EAAE15D,SAE5B45D,EAAUjsD,OACN,KAAA+O,OAhBGk9C,EAAUjsD,IAmB1B,CC5BA,MAAM+rD,GAAQ,EAEC,SAASG,GAAWx0B,GAA4B,IAA3B,KAAEunB,GAAsBvnB,EAC1D,MAAMx3C,EAAI++D,EAAKC,WACZvrB,KAAI,CAACr5C,EAAInT,KACR,MAAOZ,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAM,GAANv5B,OAAgB,IAAN5nC,EAAU,IAAM,KAAG4nC,OAAGxoC,EAAIwlF,GAAK,KAAAh9C,OAAIl6B,EAAIk3E,GAAK,IAEvDjgF,KAAK,KACR,OACEo0D,EAAAA,EAAAA,MAAA,KAEEG,UAAS,GAAAtxB,OAAKuxB,GAAO2e,KAAI,KAAAlwC,OAAIuxB,GAAO,GAADvxB,OAAIkwC,EAAKlM,KAAI,UAAU1gD,SAAA,EAE1D+tC,EAAAA,EAAAA,KAAA,QAAMpgC,GAAE,OAAA+O,OAASkwC,EAAKj/C,IAAM9f,EAAGA,EAAG4oD,KAAK,UACvC1I,EAAAA,EAAAA,KAAA,QAAA/tC,UACE+tC,EAAAA,EAAAA,KAAA,YAAU70B,KAAI,QAAAwD,OAAUkwC,EAAKj/C,IAAMmsD,YAAY,MAAK95D,SACjD4sD,EAAKj/C,SAEH,OAAA+O,OARKkwC,EAAKj/C,IAWvB,CCpBA,MAAM+rD,GAAQ,EAEd,SAASK,GAAOja,GACd,GAAqB,IAAjBA,EAAM9qE,OACR,MAAO,GAET,MAAMyqE,EAASD,GAAQM,GAAO,CAAAza,EAAAC,KAAyB,IAAvBwc,EAAIn4D,GAAG07C,GAAG33C,EAAIssE,GAAG10B,EAC/C,MAAM20B,G9CyBkBl2E,E8CzBA,CAAC+9D,EAAIn4D,G9CyBK3F,E8CzBA,CAAC0J,EAAIssE,G9C0BlC71E,KAAKC,IAAIL,EAAE,GAAKC,EAAE,KAAO,GAAKG,KAAKC,IAAIL,EAAE,GAAKC,EAAE,KAAO,E8C1Bd,IAAM,K9CyBjD,IAAqBD,EAAUC,E8CxBlC,MAAM,GAAN04B,OAAUu9C,GAAGv9C,QAAIhvB,EAAK,IAAOgsE,GAAK,KAAAh9C,QAAKs9C,EAAK,IAAON,GAAK,KAEnDQ,EAAIC,GAAMra,EAAM,GACvB,MAAM,IAANpjC,QAAYw9C,EAAK,IAAOR,GAAK,KAAAh9C,QAAKy9C,EAAK,IAAOT,GAAK,KAAAh9C,OAAI+iC,EAAOhmE,KAAK,KACrE,CAEe,SAAS2gF,GAAYx0B,GAMhC,IANiC,KACnCga,EAAI,MACJjZ,GAIDf,EACC,MAAMy0B,EAAe,eAAV1zB,EAAyBiZ,EAAKC,WAAW7qE,OAAS,EAC7D,OACE+4D,EAAAA,EAAAA,KAAA,KACEC,UAAS,GAAAtxB,OAAKuxB,GAAOtH,MAAK,KAAAjqB,OAAIuxB,GAAOtH,GAAM,KAAAjqB,OAAIuxB,GAAO,GAADvxB,OAAIkjC,EAAKc,KAAI,UAAU1gD,SAE3E4/C,EAAKjZ,GAAOrF,KAAI,CAACwe,EAAOhrE,KACvBi5D,EAAAA,EAAAA,KAAA,QAEEC,UAAS,GAAAtxB,OAAKuxB,GAAO6R,MAAK,KAAApjC,OAAIuxB,GAAO,QAADvxB,QAAU5nC,EAAIulF,GAAM,KACxDxsE,EAAGksE,GAAOja,GACVrJ,KAAK,QAHA3hE,MAQf,CCpCA,MAAM4kF,GAAQ,EAERY,GAAe,EAEfC,GAAe,CACnBlY,WAAY,IACZwD,QAAS,KAGX,SAASltB,GAAGtzC,GACV,MAAM,OAANq3B,OAAcr3B,EAAEsoB,GAClB,CAEA,SAAS0pB,GAAGhyC,GACV,OAAIA,IAAMw3D,GAAKU,OAASl4D,IAAMw3D,GAAKS,KAC1B,SAEFj4D,EAAE83D,OAAS,QAAU,QAC9B,CAEA,SAASzkB,GAAG1xC,GACV,MAAM,QAAN01B,OAAev4B,KAAKw1B,IAAIx1B,KAAKrN,MAAMkQ,GAAIszE,GAAe,GACxD,CAoIe,SAASE,GAAYn1B,GAMhC,IANiC,OACnC2a,EAAM,WACNya,GAIDp1B,EACC,OAAK2a,EAAOK,OAAUoa,GAIpB1sB,EAAAA,EAAAA,KAAA,KAAGC,UAAWC,GAAOoS,MAAOn8C,MAAO,CAAEw2D,MAAM,GAADh+C,OAAKg9C,KAAU15D,SACtDggD,EAAOK,MAAM/e,KAAI,CAACj8C,EAAGnR,EAAGsO,KACvB,MAAMi0D,EA/Id,SACEuJ,EACAya,EACAp1E,EACAnR,EACAsO,GACgB,IAADm4E,EAAAC,EACf,OAAQH,GACN,IAAK,WACH,IAAK,IAAIx3E,GAAM,EAAGA,GAAM,EAAGA,IACzB,IAAK,IAAIC,GAAM,EAAGA,GAAM,EAAGA,IAAM,CAAC,IAADqyE,EAAAE,EAC/B,GAAyB,QAAzBF,EAAIvV,EAAOqK,sBAAc,IAAAkL,GAAqB,QAArBE,EAArBF,EAAuBjiF,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAAuyE,GAA1CA,EAA4CnL,YAC9C,OAAO3xB,GAAGtzC,EAEd,CAEF,OAAO,KAET,IAAK,WACH,OAAIA,IAAMw3D,GAAKwB,YAAch5D,IAAMw3D,GAAKyB,WAC/B3lB,GAAGtzC,GAELgyC,GAAGhyC,GACZ,IAAK,QACH,OAAOszC,GAAGtzC,GACZ,IAAK,WAAY,CAAC,IAADw1E,EAAAC,EACf,GAAIz1E,EAAE03D,aAAe,EACnB,OAAOpkB,GAAGtzC,GAEZ,MAAMC,EAA8B,QAA7Bu1E,EAAkB,QAAlBC,EAAG9a,EAAOzE,gBAAQ,IAAAuf,OAAA,EAAfA,EAAiBxnF,IAAIY,EAAGsO,UAAE,IAAAq4E,EAAAA,EAAI,EACxC,OAAIv1E,EAAI,EACCozC,GAAGpzC,EAAI,GAET+xC,GAAGhyC,EACZ,CACA,IAAK,MAAO,CAAC,IAAD01E,EAAAC,EACV,GAAI31E,EAAEg4D,SAAW,EACf,OAAO1kB,GAAGtzC,GAEZ,MAAMy/C,GAA0B,QAAtBi2B,EAAW,QAAXC,EAAChb,EAAO1E,WAAG,IAAA0f,OAAA,EAAVA,EAAY1nF,IAAIY,EAAGsO,UAAE,IAAAu4E,EAAAA,EAAI,GAAK11E,EAAEg4D,SAC3C,OAAIvY,EAAI,EACCpM,GAAGoM,EAAI,GAETzN,GAAGhyC,EACZ,CACA,IAAK,YAAa,CAAC,IAAD41E,EAChB,MAAM7Q,EAA0B,QAAxB6Q,EAAGjb,EAAOqK,sBAAc,IAAA4Q,OAAA,EAArBA,EAAuB3nF,IAAIY,EAAGsO,GACzC,OAAI4nE,EACKA,EAAGE,YAAc,SAAW,SAE9BjzB,GAAGhyC,EACZ,CACA,IAAK,UACH,GAAIA,IAAMw3D,GAAKU,OAASl4D,IAAMw3D,GAAKS,KACjC,OAAO3kB,GAAGtzC,GAGd,IAAK,aACH,MAAM28D,EAA6B,QAArB2Y,EAAG3a,EAAOya,UAAW,IAAAE,GAAW,QAAXC,EAAlBD,EAAoBrnF,IAAIY,EAAGsO,UAAE,IAAAo4E,OAAX,EAAlBA,EAA+B5Y,SAChD,OAAIA,EACKtpB,IACJ4hC,GAAe,GACdn2E,KAAK+C,IAAI,EAAG,EAAI86D,EAAWuY,GAAaE,KAGvCpjC,GAAGhyC,GACZ,IAAK,SAAW,IAAD61E,EAAAC,EAEb,OADmC,QAArBD,EAAGlb,EAAOob,mBAAW,IAAAF,OAAA,EAAlBA,EAAoB5nF,IAAIY,EAAGsO,IAIzB,QAAnB24E,EAAInb,EAAOzE,gBAAQ,IAAA4f,GAAfA,EAAiB7nF,IAAIY,EAAGsO,GACnB,OAEF6C,EAAE83D,OAASxkB,GAAGtzC,GAAK,OALjBgyC,GAAGhyC,GAOd,IAAK,SACH,OAAOgyC,GAAGhyC,GAEd,OAAO,IACT,CA+DqBg2E,CAAQrb,EAAQya,EAAYp1E,EAAGnR,EAAGsO,GAC/C,IAAKi0D,EACH,OAAO,KAET,MAAM6kB,EAjEd,SACEtb,EACAya,EACAp1E,EACAnR,EACAsO,GACY,IAAD+4E,EACX,OAAQd,GACN,IAAK,WAAY,CAAC,IAADe,EAAAC,EACf,MAAMn2E,EAA8B,QAA7Bk2E,EAAkB,QAAlBC,EAAGzb,EAAOzE,gBAAQ,IAAAkgB,OAAA,EAAfA,EAAiBnoF,IAAIY,EAAGsO,UAAE,IAAAg5E,EAAAA,EAAI,EAClC3tE,EAAIxI,EAAE03D,aACZ,OACEz3D,EAAIuI,EAAI,GAAC,GAAA6uB,OACNr3B,EAAE83D,OAAS,UAAY,IAAEzgC,OAAGp3B,GAACo3B,OAAG7uB,EAAI,EAAC,MAAA6uB,OAAS7uB,EAAC,UAAA6uB,OAASr3B,EAAE/Q,MAAS,GAE1E,CACA,IAAK,MAAO,CAAC,IAADonF,EAAAC,EACV,MAAM72B,EAAyB,QAAxB42B,EAAa,QAAbC,EAAG3b,EAAO1E,WAAG,IAAAqgB,OAAA,EAAVA,EAAYroF,IAAIY,EAAGsO,UAAE,IAAAk5E,EAAAA,EAAI,EAC7B7tE,EAAIxI,EAAEg4D,SACZ,OACEvY,EAAIj3C,EAAI,GAAC,GAAA6uB,OACNr3B,EAAE83D,OAAS,UAAY,IAAEzgC,OAAGooB,GAACpoB,OAAG7uB,EAAI,EAAC,MAAA6uB,OAAS7uB,EAAC,UAAA6uB,OAASr3B,EAAE/Q,MAAS,GAE1E,CACA,IAAK,aAAc,CAAC,IAADsnF,EACjB,MAAM7zE,EAAsB,QAApB6zE,EAAG5b,EAAOqC,kBAAU,IAAAuZ,OAAA,EAAjBA,EAAmBtoF,IAAIY,EAAGsO,GACrC,OAAOuF,GAAE,GAAA20B,OAAO30B,EAAGi6D,SAAQ,gBAC7B,CACA,IAAK,UAAW,CAAC,IAAD6Z,EACd,MAAMC,EAAmB,QAAjBD,EAAG7b,EAAO6F,eAAO,IAAAgW,OAAA,EAAdA,EAAgBvoF,IAAIY,EAAGsO,GAClC,OACEs5E,GAAE,GAAAp/C,OACCo/C,EAAG9Z,SAAQ,oBAAAtlC,OAAmBo/C,EAAG5Z,aAAY,qBAEpD,CACA,IAAK,YACH,MAAMkI,EAA0B,QAAxBmR,EAAGvb,EAAOqK,sBAAc,IAAAkR,OAAA,EAArBA,EAAuBjoF,IAAIY,EAAGsO,GACzC,OACE4nE,GAAE,GAAA1tC,OAAO0tC,EAAGE,YAAc,SAAW,sBAAqB,KAAA5tC,OAAI0tC,EAAGz8C,IAErE,IAAK,WACL,IAAK,QACH,OAAOtoB,EAAE/Q,KACX,QACE,OAAO,KAEb,CAmBsBynF,CAAS/b,EAAQya,EAAYp1E,EAAGnR,EAAGsO,GACjD,OACEurD,EAAAA,EAAAA,KAAA,QAEEC,UAAWC,GAAO+V,KAClBvN,KAAI,aAAA/5B,OAAe+5B,EAAI,KACvBviE,EAAGA,EACHsO,EAAGA,EACHgR,MAAO,EACPugB,OAAQ,EAAE/T,SAETs7D,IAASvtB,EAAAA,EAAAA,KAAA,SAAA/tC,SAAQs7D,KAAc,GAAA5+C,OARxBxoC,EAAC,KAAAwoC,OAAIl6B,GASR,MArBN,IA0BX,CC9KA,MAAMk3E,GAAQ,EAyCd,SAASqC,GAASthB,GAA2B,IAADuhB,EAAAC,EAAAC,EAKtCl1E,EAJJ,OAAO04D,GAAa,CACH,QADGsc,EAClBvhB,EAAOmB,gBAAQ,IAAAogB,OAAA,EAAfA,EAAiB1nF,KACjBmmE,EAAO0hB,QAAW1hB,EAAOmb,SAAW,cACpCnb,EAAOqB,OAAK,KAAAp/B,OAAS+9B,EAAOqB,QAC1B90D,EACA04D,GAAa,CACXjF,EAAO6E,OAAS,WAChB7E,EAAO4Y,WAAa,SACF,QAAlB4I,EAAIxhB,EAAOmb,eAAO,IAAAqG,EAAAA,EAAI,MACH,QAAnBC,EAAIzhB,EAAOmY,gBAAQ,IAAAsJ,EAAAA,EAAI,KACtBziF,KAAK,MANFuN,GAAC,IAAA01B,OAAQ11B,EAAC,QAQjBvN,KAAK,IACV,CAEe,SAAS2iF,GAAa/2B,GAA0C,IAADg3B,EAAAC,EAAA,IAAxC,OAAE7hB,EAAM,OAAEuF,EAAM,WAAEya,GAAoBp1B,EAC1E,MAAMx3C,GAAIwhC,EAAAA,EAAAA,UAAQ,IAlDpB,SACEusB,GAMA,MAAMlB,IAAqB,OAARkB,QAAQ,IAARA,IAAAA,EAAUV,WACvBqhB,IAAoB,OAAR3gB,QAAQ,IAARA,IAAAA,EAAU+W,OACtB6J,EAAU9hB,GAAY6hB,EAEtBr5E,EAAKw3D,EAAWgf,GAAQ,EAAIA,GAAQ,EACpC9+C,EAAMghC,IAAae,IAAkBz5D,EAAKw2E,IAASx2E,EACnDijE,EAASvK,IAAaS,GAAgBn5D,EAAKw2E,GAAQx2E,EAEnDD,EAAKs5E,EAAU7C,GAAQ,EAAIx2E,EAC3Bw3B,EAAOkhC,IAAaa,IAAgBx5D,EAAKy2E,IAASz2E,EAClDoR,EAAQunD,IAAaY,GAAoBv5D,EAAKy2E,GAAQz2E,EAE5D,OAAOy8D,GAAa,CAAC,IAADhjC,OACdhC,EAAI,KAAAgC,OAAI9B,GACZ4hD,GAAO,IAAA9/C,OAAQroB,EAAK,KAAAqoB,OAAI9B,GACxBA,KAAS13B,GAAE,IAAAw5B,OAAQroB,EAAQqlE,GAAQ,EAAC,MAAAh9C,QAAMg9C,IAC1C9d,IAAac,IAAY,IAAAhgC,OAAQroB,EAAQqlE,GAAQ,EAAC,MAClD8C,GAAO,IAAA9/C,OAAQroB,EAAK,KAAAqoB,OAAIx5B,GACxBijE,IAAWjjE,GAAE,IAAAw5B,OAAQroB,EAAK,KAAAqoB,OAAIypC,GAAS,IAADzpC,OAClChC,EAAI,KAAAgC,OAAIypC,IACXqW,GAAO,IAAA9/C,QAASg9C,GAAQ,EAAC,OACzB9d,IAAaO,IAASP,IAAaQ,KAAO,IAAA1/B,OAAShC,EAAOg/C,GAAQ,EAAC,MAAK,MAExEjgF,KAAK,GACV,CAmB0BgjF,CAAWhiB,EAAOmB,WAAW,CAACnB,EAAOmB,WAC7B,IAAD2Z,EAAAE,EAA/B,GAAmB,aAAfgF,GACF,GACwB,QAAtBlF,EAACvV,EAAOqK,sBAAc,IAAAkL,GAAiD,QAAjDE,EAArBF,EAAuBjiF,IAAI6Q,KAAKrN,MAAM2jE,EAAOvmE,GAAIiQ,KAAKrN,MAAM2jE,EAAOj4D,WAAG,IAAAizE,IAAtEA,EACGnL,YAEJ,OAAO,UAEJ,GAAmB,aAAfmQ,EACT,OAAO,KAET,OACE5sB,EAAAA,EAAAA,MAAA,KACEG,UAAS,GAAAtxB,OAAKuxB,GAAOwM,OAAM,KAAA/9B,OAAI,UAAW+9B,EAASxM,GAAOyuB,MAAQ,IAClEC,UAAS,aAAAjgD,OAAe+9B,EAAOvmE,EAAIwlF,GAAK,KAAAh9C,OAAI+9B,EAAOj4D,EAAIk3E,GAAK,aAAAh9C,OAAYywB,EAAcsN,EAAOjC,KAAI,KAAIx4C,SAAA,EAErG+tC,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO2uB,OAAQ/uE,EAAGA,EAAEmS,UACnC+tC,EAAAA,EAAAA,KAAA,SAAA/tC,SAAQ+7D,GAASthB,QAEH,QAAf4hB,EAAA5hB,EAAOmB,gBAAQ,IAAAygB,OAAA,EAAfA,EAAiBjhB,iBAChBrN,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO4uB,MAAO3oF,EAAG,EAAGsO,EAAG,IAAKwd,SAC3B,QAD2Bs8D,EAC1C7hB,EAAOmB,gBAAQ,IAAA0gB,OAAA,EAAfA,EAAiBlhB,kBAK5B,CCrGA,MAAMse,GAAQ,EAEC,SAASoD,GAAmBz3B,GAMvC,IANwC,EAC1CnxD,EAAC,EACDsO,GAID6iD,EACC,OACE0I,EAAAA,EAAAA,KAAA,QACEC,UAAWC,GAAO8uB,aAClBlvE,EAAC,2BACD8uE,UAAS,aAAAjgD,QAAgBxoC,EAAI,IAAOwlF,GAAK,KAAAh9C,QAAKl6B,EAAI,IAAOk3E,GAAK,MAGpE,CCnBO,MAAMsD,GAAiB,CAC5B,EAAE,GAAI,GACN,CAAC,GAAI,GACL,EAAE,EAAG,GACL,CAAC,EAAG,IAGOC,IAAc,IACdC,GAAa,ICApBxD,GAAQ,EAEd,SAASyD,GAAQlgE,GACf,MAAMpoB,GAAKooB,EAAIggE,KAAeC,GAAaD,IACrCG,EAAU,IAAJvoF,EAEZ,MAAM,OAAN6nC,QADY,GAAK,KAAO,EAAI7nC,IACV4d,UAAS,SAAAiqB,OAAQ0gD,EAAI3qE,UAAS,KAClD,CAEe,SAAS4qE,GAAah4B,GAAwC,IAAvC,OAAEtxB,GAAkCsxB,EACxE,OACE0I,EAAAA,EAAAA,KAAA,KAAGC,UAAWC,GAAOl6B,OAAQ7P,MAAO,CAAEw2D,MAAM,GAADh+C,OAAKg9C,KAAU15D,SACvD+T,EAAOutB,KAAI,CAACrkC,EAAG/oB,EAAGsO,KAEfurD,EAAAA,EAAAA,KAAA,QAEE0I,KAAM0mB,GAAQlgE,GACd/oB,EAAGA,EAAI,GACPsO,EAAGA,EAAI,GACPgR,MAAO,EACPugB,OAAQ,EAAE/T,UAEV+tC,EAAAA,EAAAA,KAAA,SAAA/tC,SAAQ/C,KAAU,GAAAyf,OAPVxoC,EAAC,KAAAwoC,OAAIl6B,OAazB,CCvBA,SAAS86E,GAAaj4B,GAIlB,IAJmB,SACrBk4B,GAGDl4B,EACC,MAAMm4B,EAAkC,CAAC,EAMzC,OALQ,OAARD,QAAQ,IAARA,GAAAA,EAAU7iE,SAASV,IAAO,IAADyjE,EACvB,MAAMz2E,EAAIgT,EAAE4hD,SAASR,cACrBoiB,EAAOx2E,IAAe,QAAVy2E,EAACD,EAAOx2E,UAAE,IAAAy2E,EAAAA,EAAI,GAAK,CAAC,KAIhC5vB,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACI7hB,OAAOrF,QAAQ0kF,GAAQxoF,QAAU,MAClCmJ,OAAOrF,QAAQ0kF,GACbl8B,KAAIgE,IAAA,IAAEngD,EAAGtQ,GAAEywD,EAAA,SAAA5oB,OAAQv3B,GAACu3B,OAAG7nC,EAAI,EAAC,IAAA6nC,OAAO7nC,GAAM,GAAE,IAC3C4E,KAAK,OAGd,CAEe,SAASikF,GAAK93B,GAMzB,IAN0B,OAC5Boa,EAAM,WACNya,GAID70B,EACC,MAAM9wC,EAAU,EAAC6oE,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,KACf,OAAQzD,GACN,IAAK,WACH,OACE5sB,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,CACGggD,EAAOme,YACNtwB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CACGggD,EAAOoe,SAAS,IAAEpe,EAAOme,cAGd,QAAfR,EAAA3d,EAAOqe,gBAAQ,IAAAV,OAAA,EAAfA,EAAiBW,SAChBvwB,EAAAA,EAAAA,KAAA,KAAA/tC,SAAIggD,EAAOqe,SAASC,MAAM7sE,QAAQ,MAAO,aAIjD,IAAK,QACH,OACEo8C,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,kBAAkC,QAAnB49D,EAAa,QAAbC,EAAC7d,EAAOK,aAAK,IAAAwd,OAAA,EAAZA,EAAczoC,YAAI,IAAAwoC,EAAAA,EAAI,MAC1C/vB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,UACkB,QAAb89D,EAAC9d,EAAOK,aAAK,IAAAyd,OAAA,EAAZA,EAAc53B,QAAO,CAAC9gD,EAAGC,IAAOA,EAAE83D,OAAS/3D,EAAI,EAAIA,GAAI,SAIvE,IAAK,WAAa,IAADm5E,EAAAC,EACf,OACE3wB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,WAA8B,QAAtBu+D,EAAc,QAAdC,EAACxe,EAAOqU,cAAM,IAAAmK,OAAA,EAAbA,EAAexpF,cAAM,IAAAupF,EAAAA,EAAI,MACtC1wB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,eACS+tC,EAAAA,EAAAA,KAACuvB,GAAa,CAACC,SAAUvd,EAAO+E,gBAE7ClX,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,cACQ+tC,EAAAA,EAAAA,KAACuvB,GAAa,CAACC,SAAUvd,EAAOgF,eAE5CnX,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,eACS+tC,EAAAA,EAAAA,KAACuvB,GAAa,CAACC,SAAUvd,EAAOyB,kBAKnD,IAAK,WACH,OACE5T,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,aAAW8kD,GAAiB9E,MACd,QAAjB+d,EAAA/d,EAAOgG,kBAAU,IAAA+X,GAAjBA,EAAmBxiB,UAClB1N,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,SAAwB,QAAlBg+D,EAAChe,EAAOgG,kBAAU,IAAAgY,OAAA,EAAjBA,EAAmBziB,YAC5B,QAGV,IAAK,MACH,OACE1N,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,cAAYklD,GAAYlF,MACV,QAAjBie,EAAAje,EAAOgG,kBAAU,IAAAiY,GAAjBA,EAAmB3iB,KAClBzN,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,SAAwB,QAAlBk+D,EAACle,EAAOgG,kBAAU,IAAAkY,OAAA,EAAjBA,EAAmB5iB,OAC5B,QAGV,IAAK,aAAc,CAAC,IAADsgB,EACjB,GAAsB,QAAlBA,EAAC5b,EAAOqC,kBAAU,IAAAuZ,IAAjBA,EAAmBxmC,KACtB,OAAO,KAET,MAAMmM,EAAQye,EAAOqC,WAAWjtB,KAC1BqpC,EACJze,EAAOqC,WAAWnc,QAAO,CAAC9gD,EAAG2C,IAAO3C,EAAI2C,EAAGi6D,UAAU,GAAKzgB,EAC5D,OACEsM,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,eAAauhC,KAChBk9B,IACC5wB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,iBAAey+D,EAAYhsE,QAAQ,GAAG,gBAIlD,CACA,IAAK,UAAW,CAAC,IAADisE,EAAA7C,EAAA8C,EAAAC,EACd,MAAMr9B,EAA4B,QAAvBm9B,EAAiB,QAAjB7C,EAAG7b,EAAO6F,eAAO,IAAAgW,OAAA,EAAdA,EAAgBzmC,YAAI,IAAAspC,EAAAA,EAAI,EAChCD,EAAcze,EAAO6F,QACvB7F,EAAO6F,QAAQ3f,QAAO,CAAC9gD,EAAG2C,IAAO3C,EAAI2C,EAAGi6D,UAAU,GAAKzgB,EACvD,KACJ,OACEsM,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,SACK,IACM,QADH2+D,EACT3e,EAAOK,aAAK,IAAAse,OAAA,EAAZA,EAAcz4B,QACb,CAAC9gD,EAAGC,IAAOA,IAAMw3D,GAAKU,MAAQn4D,EAAI,EAAIA,GACtC,OAGJyoD,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,QACI,IACO,QADJ4+D,EACR5e,EAAOK,aAAK,IAAAue,OAAA,EAAZA,EAAc14B,QAAO,CAAC9gD,EAAGC,IAAOA,IAAMw3D,GAAKS,KAAOl4D,EAAI,EAAIA,GAAI,OAEjEyoD,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,YAAUuhC,KACbk9B,IACC5wB,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,iBAAey+D,EAAYhsE,QAAQ,GAAG,gBAIlD,CACA,IAAK,SACH,OAAKutD,EAAOjsC,QAIV85B,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,OACG,IACJggD,EAAOjsC,OAAOmyB,QAAO,CAAC9gD,EAAG6X,IAAOA,EAAI7X,EAAI6X,EAAI7X,GAAI,GAAGqN,cAEtDo7C,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,QACI,IACL,MACC,IAAIiwC,EAAM,EACN1O,EAAQ,EAKZ,OAJAye,EAAOjsC,OAAOrZ,SAASuC,IACrBgzC,GAAOhzC,EACPskC,GAAS,CAAC,KAEJ0O,EAAM1O,GAAO9uC,QAAQ,EAC9B,EARA,OAUHo7C,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,OACG,IACJggD,EAAOjsC,OAAOmyB,QAAO,CAAC9gD,EAAG6X,IAAOA,EAAI7X,EAAI6X,EAAI7X,GAAI,GAAGqN,gBAtBjD,KA2BX,IAAK,SAAW,IAADosE,EAAAC,EACb,OAAOjxB,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CAAG,WAAiC,QAAzB6+D,EAAc,QAAdC,EAAC9e,EAAO+e,cAAM,IAAAD,OAAA,EAAbA,EAAerlF,KAAK,YAAI,IAAAolF,EAAAA,EAAI,cAEjD,QACE,OAAO,KAEZ,EAtIe,GAuIhB,OAAO/pE,IAAWi5C,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAO+wB,MAAMh/D,SAAElL,GACnD,CCxKA,MAAM4kE,GAAQ,EAEd,SAASuF,GAAcrf,GAA2B,IAADsf,EAC/C,MAAM95E,EAAI,CAAC6oD,GAAO2R,MAKlB,OAJAA,EAAKc,MAAQt7D,EAAE5P,KAAKy4D,GAAO,GAADvxB,OAAIkjC,EAAKc,KAAI,WAC9B,QAATwe,EAAAtf,EAAKgN,YAAI,IAAAsS,OAAA,EAATA,EAAWxe,OAAQt7D,EAAE5P,KAAKy4D,GAAO,GAADvxB,OAAIkjC,EAAKgN,KAAKlM,KAAI,cAClDd,EAAK4L,OAASpmE,EAAE5P,KAAKy4D,GAAO,QAADvxB,OAASkjC,EAAK4L,MAAM79C,MAC/CiyC,EAAKkG,YAAc1gE,EAAE5P,KAAK,cACnB4P,EAAE3L,KAAK,IAChB,CAEA,SAAS0lF,GAAWzV,GAClB,OAAOA,EAAc,CACvB,CAEA,SAAS0V,GAAqBxf,GAC5B,MAAO1rE,EAAGsO,GAAKo9D,EAAKgN,KAAMC,WAAW,GAAG5W,OACxC,OACElI,EAAAA,EAAAA,KAAA,UACEC,UAAWC,GAAO3sB,GAClB8vB,GAAIl9D,EAAIwlF,GACRroB,GAAI7uD,EAAIk3E,GACRt0E,EAAG+5E,GAAWvf,EAAK8J,aAAgBgQ,IAGzC,CAEA,SAAS2F,GACPt7E,EACAC,GAYID,EAAE4iE,OAAS3iE,EAAE2iE,UACd5iE,EAAGC,GAAK,CAACA,EAAGD,IAGf,MAAO+oD,EAAIC,GAAM,CAAC/oD,EAAE9P,EAAI6P,EAAE7P,EAAG8P,EAAExB,EAAIuB,EAAEvB,GAC/B88E,EAAWn7E,KAAKo7E,MAAMzyB,EAAIC,GAC1ByyB,EAAUr7E,KAAKk0D,MAAMtL,EAAID,GAMzB2yB,EAAW17E,EAAE4iE,OAAS3iE,EAAE2iE,OACxB+Y,EAAWv7E,KAAKw7E,KAAKF,EAAWH,GAGhCM,EACDz7E,KAAK07E,IAAIL,EAAUE,GADlBE,EAEDz7E,KAAK27E,IAAIN,EAAUE,GAElBK,EACD57E,KAAK07E,IAAIL,EAAUE,GADlBK,EAED57E,KAAK27E,IAAIN,EAAUE,GAElBM,EAAU,CAACj8E,EAAE7P,EAAI6P,EAAE4iE,OAASiZ,EAAU77E,EAAEvB,EAAIuB,EAAE4iE,OAASiZ,GACvDK,EAAU,CAACl8E,EAAE7P,EAAI6P,EAAE4iE,OAASoZ,EAAUh8E,EAAEvB,EAAIuB,EAAE4iE,OAASoZ,GACvDG,EAAU,CAACl8E,EAAE9P,EAAI8P,EAAE2iE,OAASiZ,EAAU57E,EAAExB,EAAIwB,EAAE2iE,OAASiZ,GACvDO,EAAU,CAACn8E,EAAE9P,EAAI8P,EAAE2iE,OAASoZ,EAAU/7E,EAAExB,EAAIwB,EAAE2iE,OAASoZ,GAG7D,MAAO,CAAC,KAADrjD,OACAujD,EAAQxmF,KAAK,MAAI,KAAAijC,OACjB34B,EAAE4iE,OAAM,KAAAjqC,OAAI34B,EAAE4iE,OAAM,WAAAjqC,OAAUsjD,EAAQvmF,KAAK,MAAI,KAAAijC,OAC/CwjD,EAAQzmF,KAAK,MAAI,KAAAijC,OACjB14B,EAAE2iE,OAAM,KAAAjqC,OAAI14B,EAAE2iE,OAAM,WAAAjqC,OAAUyjD,EAAQ1mF,KAAK,KAAI,OACpDA,KAAK,GACT,CAEA,SAAS2mF,GAAsBxgB,GAC7B,MAAO77D,EAAGC,GAAK47D,EAAKgN,KAAMC,WAAWvrB,KAAKr5C,IACxC,MAAO/T,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAO,CACL/hE,EAAGA,EAAIwlF,GACPl3E,EAAGA,EAAIk3E,GACP/S,OAAQwY,GAAWl3E,EAAGyhE,aAAegQ,GACtC,IAGH,OAAO3rB,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO3sB,GAAIzzB,EAAGwxE,GAAUt7E,EAAGC,IACrD,CAEA,SAASq8E,GAAKzgB,GACZ,MACM/xD,EADM+xD,EAAKgN,KAAMC,WAEpBvrB,KAAI,CAACr5C,EAAInT,KACR,MAAOZ,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAM,GAANv5B,OAAgB,IAAN5nC,EAAU,IAAM,KAAG4nC,OAAGxoC,EAAIwlF,GAAK,KAAAh9C,OAAIl6B,EAAIk3E,GAAK,IAEvDjgF,KAAK,KACR,OACEs0D,EAAAA,EAAAA,KAAA,QACEC,UAAWC,GAAO3sB,GAClBzzB,EAAGA,EACH4oD,KAAK,OACL3yC,YAA6C,EAAhCq7D,GAAWvf,EAAK8J,aAAoBgQ,IAGvD,CAEe,SAAS4G,GAAYj7B,GAMhC,IANiC,OACnC2a,EAAM,WACNya,GAIDp1B,EACC,IAAK2a,EAAOS,MACV,OAAO,KAGT,MAAM8f,EAAsB,GAC5BvgB,EAAOS,MAAM/lD,SAASklD,IACpB,MAAM33D,EAAK23D,EAAKgN,KAAKC,WAEf/3E,EAAIqP,KAAKrN,OAAOmR,EAAGjT,OAAS,GAAK,GACjCD,EAAIoP,KAAKrN,MAAMmR,EAAGjT,OAAS,GACjC,GAAIF,IAAMC,EACRwrF,EAAW3gB,EAAKjyC,IAAM1lB,EAAGnT,GAAGmhE,WACvB,CACL,MAAOpzD,EAAIC,GAAMmF,EAAGnT,GAAGmhE,QAChBuqB,EAAIC,GAAMx4E,EAAGlT,GAAGkhE,OACvBsqB,EAAW3gB,EAAKjyC,IAAM,EAAE9qB,EAAK29E,GAAM,GAAI19E,EAAK29E,GAAM,EACpD,KAGF,MAAMpsE,EAAQ,IAAI2rD,EAAOS,OACzBpsD,EAAMy3C,MAAK,CAAC/nD,EAAGC,IAAMu8E,EAAWv8E,EAAE2pB,IAAI,GAAK4yD,EAAWx8E,EAAE4pB,IAAI,KAC5D,MAAM+M,EAAOrmB,EAAMmpC,OAAOr5C,KAAKrN,MAAMud,EAAMrf,OAAS,IAQpD,SAAS0rF,EACPjgB,EACA7tD,EACAo7C,GAEA,GAAmB,WAAfysB,EACF,OAAO,KAET,GAAmB,aAAfA,EACF,OAAOha,EAAMnf,KAAKse,IAChB,MAAM0R,EAAM1R,EAAKgN,KAAKC,WACtB,GAAIyE,EAAIt8E,QAAU,EAAG,CACnB,MAAOd,EAAGsO,GAAK8uE,EAAI,GAAGrb,OACtB,OACElI,EAAAA,EAAAA,KAAA,KAEEC,UAAS,GAAAtxB,OAAKuxB,GAAO0yB,OAAM,KAAAjkD,OAAIuiD,GAAcrf,IAAQ5/C,UAErD6tC,EAAAA,EAAAA,MAAA,QAAMG,UAAWC,GAAO4uB,MAAO3oF,EAAGA,EAAIwlF,GAAOl3E,EAAGA,EAAIk3E,GAAM15D,SAAA,CACvD,cAAe4/C,GAAQA,EAAK0D,UAAUhvE,KAAK,IAAEsrE,EAAKjyC,OAJhDiyC,EAAKjyC,GAQhB,CACA,MAAM9f,EAAIyjE,EACPhwB,KAAI,CAACr5C,EAAInT,KACR,MAAOZ,EAAGsO,GAAKyF,EAAGguD,OAClB,MAAM,GAANv5B,OAAgB,IAAN5nC,EAAU,IAAM,KAAG4nC,OAAGxoC,EAAIwlF,GAAK,KAAAh9C,OAAIl6B,EAAIk3E,GAAK,IAEvDjgF,KAAK,KACR,OACEo0D,EAAAA,EAAAA,MAAA,KAEEG,UAAS,GAAAtxB,OAAKuxB,GAAO0yB,OAAM,KAAAjkD,OAAIuiD,GAAcrf,IAAQ5/C,SAAA,EAErD+tC,EAAAA,EAAAA,KAAA,QAAMpgC,GAAE,YAAA+O,OAAckjC,EAAKjyC,IAAM9f,EAAGA,EAAG4oD,KAAK,UAC5C1I,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO4uB,MAAM78D,UAC5B6tC,EAAAA,EAAAA,MAAA,YAAU30B,KAAI,aAAAwD,OAAekjC,EAAKjyC,IAAMmsD,YAAY,MAAK95D,SAAA,CACtD,cAAe4/C,GAAQA,EAAK0D,UAAUhvE,KAAK,IAAEsrE,EAAKjyC,UANlDiyC,EAAKjyC,GASR,IAIV,IAAIgqC,GAAM9e,IACV,OAAO4nB,EAAMnf,KAAI,CAACse,EAAM9qE,KACtB,MAAM4iE,EAAKgiB,GAAQ6G,EAAW3gB,EAAKjyC,IAAI,GACvCgqC,EAAKxzD,KAAK+C,IAAIwyE,GAAQ6G,EAAW3gB,EAAKjyC,IAAI,GAAIgqC,EAAK,GACnD,MAAMrqD,GAAOosE,GAAQ1Z,EAAO36B,QAAQomB,WAAc,EAAI,IAAM74C,EACtDrF,EACJmsE,GAAQ1Z,EAAO36B,QAAQomB,aAAe32D,EAAI,GAAK2rE,EAAMzrE,OAAS,IAC1Dk8D,EAAK5jD,EAAyB,IAApBnJ,KAAKC,IAAIuzD,EAAKpqD,GAAaqF,EACrC/E,EAAI6xD,GAAa,CAAC,KAADhjC,OAChBpvB,EAAK,GAAKsF,EAAI,KAAA8pB,OAAInvB,GAAE,KAAAmvB,OACpBpvB,EAAE,KAAAovB,OAAInvB,GACX2jD,EAAKt+C,EAAO8kD,EAAK9kD,GAAI,KAAA8pB,OAASw0B,EAAE,KAAAx0B,OAAIi7B,GAAK,KAADj7B,OACnCg7B,EAAE,KAAAh7B,OAAIi7B,KACVl+D,KAAK,IACR,OACEo0D,EAAAA,EAAAA,MAAA,KAAiBG,UAAS,GAAAtxB,OAAKsxB,EAAS,KAAAtxB,OAAIuiD,GAAcrf,IAAQ5/C,SAAA,EAChE+tC,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO2yB,QAAS/yE,EAAGA,KACpCkgD,EAAAA,EAAAA,KAAA,QAAMC,UAAWC,GAAO4uB,MAAO3oF,EAAGoZ,EAAK,GAAKsF,EAAMpQ,EAAG+K,EAAGyS,SACrD,cAAe4/C,GACd/R,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,CACG4/C,EAAK0D,UAAUhvE,MACdsrE,EAAK7W,KAAK/zD,QAAU,IAAI,IAAE4qE,EAAKjyC,OAGnCogC,EAAAA,EAAAA,KAAAD,EAAAA,SAAA,CAAA9tC,SAAG4/C,EAAKjyC,SATNiyC,EAAKjyC,GAYT,GAGV,CAEA,OApFAtZ,EAAMy3C,MAAK,CAAC/nD,EAAGC,IAAMu8E,EAAWx8E,EAAE4pB,IAAI,GAAK4yD,EAAWv8E,EAAE2pB,IAAI,KAC5D+M,EAAKoxB,MACH,CAAC/nD,EAAGC,IACFu8E,EAAWx8E,EAAE4pB,IAAI,GAAK4yD,EAAWv8E,EAAE2pB,IAAI,IACvC4yD,EAAWx8E,EAAE4pB,IAAI,GAAK4yD,EAAWv8E,EAAE2pB,IAAI,MAiFzCkgC,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,CACGggD,EAAOS,MAAMnf,KAAKse,IAAU,IAADihB,EAC1B,MAAI,gBAAiBjhB,GAEjB7R,EAAAA,EAAAA,KAAA,KAAiBC,UAAWixB,GAAcrf,GAAM5/C,SAC/B,SAAd4/C,EAAKc,KAC8B,IAAhCd,EAAKgN,KAAKC,WAAW73E,OACnBorF,GAAsBxgB,GACtBwf,GAAqBxf,GACvBygB,GAAKzgB,IALHA,EAAKjyC,IASc,QAA/BkzD,EAAIjhB,EAAKgN,KAAKC,WAAW73E,cAAM,IAAA6rF,GAAAA,GACtB9yB,EAAAA,EAAAA,KAAC8rB,GAAW,CAAejN,KAAMhN,EAAKgN,MAApBhN,EAAKjyC,IAEzB,IAAI,IAEZ+yD,EAAWhmD,GAAO,EAAGuzB,GAAOvzB,MAC5BgmD,EAAWrsE,EAAO,EAAG45C,GAAO55C,SAGnC,CC9PA,UAAgB,OAAS,uBAAuB,IAAM,oBAAoB,KAAO,qBAAqB,QAAU,wBAAwB,cAAgB,8BAA8B,KAAO,qBAAqB,MAAQ,sBAAsB,UAAY,0BAA0B,KAAO,qBAAqB,UAAY,0BAA0B,MAAQ,uBCW1VqlE,GAAQ,EAEd,SAAS9kE,GAAM0yC,GACb,OAAOA,EAAO7sC,MAAM,MAAM6mC,KAAKw/B,IAC7B,GAAIA,EAAKC,WAAW,KAClB,MAAO,CAAErgB,KAAM,OAAQltC,KAAMstD,GAE/B,IAAKA,EACH,MAAO,CAAEpgB,KAAM,OAAQltC,KAAM,QAE/B,MAAMrwB,EAAI29E,EAAKjsE,MAAM,+CACrB,GAAI1R,EAAG,CAEL,MAAO,CACLu9D,KAFgC,MAArBv9D,EAAE69E,OAAQnX,OAAiB,YAAc,QAGpDr2C,KAAMstD,EACN/sE,IAAK,CAAChB,SAAS5P,EAAE69E,OAAQ9sF,EAAG,IAAK6e,SAAS5P,EAAE69E,OAAQx+E,IAExD,CACA,MAAO,CAAEk+D,KAAM,OAAQltC,KAAMstD,EAAM,GAEvC,CAEA,SAASG,GAAeC,GACtB,MAAMzhB,EAAS,GACT0hB,EAAQ1hF,MAAM4zD,KAClB6tB,EAAUE,uBAAuBnzB,GAAO6yB,OAE1C,IAAIhsF,EAAI,EACR,KAAOA,EAAIqsF,EAAMnsF,UACXmsF,EAAMrsF,GAAGusF,UAAYF,EAAMrsF,GAAGwsF,cAAgBJ,EAAUrmD,WADrC/lC,KAKzB,KAAOA,EAAIqsF,EAAMnsF,UACXmsF,EAAMrsF,GAAGusF,WAAaH,EAAUrmD,UAAYqmD,EAAUI,cADnCxsF,IAIvB2qE,EAAO3qE,GACLqsF,EAAMrsF,GAAGusF,UACTF,EAAMrsF,GAAGwsF,aAAe,EACxBJ,EAAUI,aAAe,EACzBJ,EAAUrmD,UAEd,OAAO4kC,CACT,CAEe,SAAS8hB,GAAal8B,GAUjC,IAVkC,OACpC2a,EAAM,qBACNwhB,EAAoB,kBACpBC,EAAiB,qBACjBC,GAMDr8B,EACC,MAAMrc,GAAMuZ,EAAAA,EAAAA,cACZnT,EAAAA,EAAAA,kBAAgB,KACd,MAAM8xC,EAAYl4C,EAAIlhB,QACjBo5D,GAGLM,EAAqBP,GAAeC,GAAW,GAC9C,CAACl4C,EAAKw4C,IACT,MAAMG,GAAatyC,EAAAA,EAAAA,UACjB,IAAa,OAAN2wB,QAAM,IAANA,GAAAA,EAAQ1Y,OAAS1yC,GAAMorD,EAAO1Y,aAAU5C,GAC/C,CAACsb,IAEH,OACEnS,EAAAA,EAAAA,MAAA,OACEG,UAAWC,GAAO3G,OAClBte,IAAKA,EACL44C,SAAUA,IAAMJ,EAAqBP,GAAej4C,EAAIlhB,UAAW9H,SAAA,EAEnE+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,YACJ+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAO/1D,IAAI8nB,SACd,OAAV2hE,QAAU,IAAVA,OAAU,EAAVA,EAAYrgC,KAAI,CAAAgE,EAAsBxwD,KAAO,IAA5B,KAAE0+B,EAAI,IAAEzf,EAAG,KAAE2sD,GAAMpb,EACnC,MAAM0I,EAAY0R,GAAa,CAC7BzR,GAAO6yB,KACPW,IAAsB3sF,GAAKm5D,GAAO4zB,QAClC5zB,GAAOyS,KACNjnE,KAAK,KACR,OACEs0D,EAAAA,EAAAA,KAAA,OACEC,UAAWA,EACX8zB,YAAa/tE,EAAM,IAAM2tE,EAAqB5sF,QAAK4vD,EAAU1kC,SAE5DwT,GACG,QAMlB,CAEO,SAASuuD,GAAan8B,GAUzB,IAV0B,OAC5Boa,EAAM,kBACNgiB,EAAiB,kBACjBP,EAAiB,MACjB/G,GAMD90B,EACC,MAAM+7B,GAAatyC,EAAAA,EAAAA,UACjB,IAAa,OAAN2wB,QAAM,IAANA,GAAAA,EAAQ1Y,OAAS1yC,GAAMorD,EAAO1Y,aAAU5C,GAC/C,CAACsb,IAEH,GAAW,OAANA,QAAM,IAANA,IAAAA,EAAQ1Y,OACX,OAAO,KAET,MAAMrkD,EAAK+8D,EAAOtlC,KACZx3B,EAAK88D,EAAOplC,IAClB,OACEizB,EAAAA,EAAAA,MAAA,KAAGG,UAAWC,GAAOg0B,cAAcjiE,SAAA,CAChC2hE,EAAYrgC,KAAI,CAAAiM,EAAgBz4D,KAAO,IAAtB,KAAE4rE,EAAI,IAAE3sD,GAAKw5C,EAC7B,IAAKx5C,QAAgC2wC,IAAzBs9B,EAAkBltF,GAC5B,OAAO,KAET,MAAMk5D,EAAY0R,GAAa,CAC7BzR,GAAO+V,KACPyd,IAAsB3sF,GAAKm5D,GAAO4zB,QAClC5zB,GAAOyS,KACNjnE,KAAK,KACR,OACEs0D,EAAAA,EAAAA,KAAA,QAEEC,UAAWA,EACX95D,GAAI6f,EAAI,GAAK9Q,GAAMy2E,GACnBl3E,GAAIuR,EAAI,GAAK7Q,GAAMw2E,GACnBlmE,MAAOkmE,GACP3lD,OAAQ2lD,IALH5kF,EAML,IAGL8f,GAAMorD,EAAO1Y,QAAQhG,KAAI,CAAAmM,EAAgB34D,KAAO,IAAtB,KAAE4rE,EAAI,IAAE3sD,GAAK05C,EACtC,IACG15C,GACD0tE,IAAsB3sF,QACG4vD,IAAzBs9B,EAAkBltF,GAElB,OAAO,KAET,MACMyY,EAAKy0E,EAAkBltF,GAAK4lF,EAC5BhjB,GAAM3jD,EAAI,GAAK9Q,EAAK,IAAOy2E,GAC3B/hB,GAAM5jD,EAAI,GAAK7Q,EAAK,IAAOw2E,GAC3BxoB,EAAKwG,EAAyB,GAApBvzD,KAAKC,IAAIuzD,EAAKpqD,GACxBM,EAAI6xD,GAAa,CAAC,KAADhjC,OAChBg7B,EAAE,KAAAh7B,OAAIi7B,GAAE,KAAAj7B,OACRw0B,EAAE,KAAAx0B,OAAInvB,GAAE,KAAAmvB,QAPH,KAQH,KAAAA,OAAInvB,KACV9T,KAAK,IAGR,OACEo0D,EAAAA,EAAAA,MAAC/M,EAAAA,SAAQ,CAAA9gC,SAAA,EACP+tC,EAAAA,EAAAA,KAAA,QAAMC,UAAS,GAAAtxB,OAAKuxB,GAAOi0B,MAAK,KAAAxlD,OAAIuxB,GAAOyS,IAAS7yD,EAAGA,KACvDkgD,EAAAA,EAAAA,KAAA,UACEC,UAAS,GAAAtxB,OAAKuxB,GAAOk0B,UAAS,KAAAzlD,OAAIuxB,GAAOyS,IACzCtP,GAAIsG,EACJrG,GAAIsG,EACJvyD,EATK,MAWP2oD,EAAAA,EAAAA,KAAA,QACEC,UAAS,GAAAtxB,OAAKuxB,GAAO+V,KAAI,KAAAtnC,OAAIuxB,GAAOyS,IACpCxsE,EAAGwjE,EAZE,EAaLl1D,EAAGm1D,EAbE,EAcLnkD,MAAO,EACPugB,OAAQ,MAbGj/B,EAeJ,MAKrB,CCrIA,SAASstF,GAAapiB,EAAgBya,EAAwBC,GAC5D,GAAmB,aAAfD,IAA8Bza,EAAOqiB,eACvC,MAAO,CACL,cAAe3H,GAGnB,MAAM,EAAExmF,EAAC,EAAEsO,EAAC,IAAEg2D,EAAG,MAAEG,GAAUqH,EAAOqiB,eACpC,MAAO,CACL,cAAe,EACf,cAAc,GAAD3lD,OAAKi8B,EAAK,OACvB,YAAY,GAADj8B,OAAKv4B,KAAKwkD,IAAO6P,EAAgB,IAAVr0D,KAAKwkD,KAAuB,EAAVxkD,KAAKwkD,IAAQ,OACjE,aAAmB,GAAJz0D,EACf,aAAmB,GAAJsO,EAEnB,CAEe,SAAS8/E,GAAaj9B,GAUjC,IAADk9B,EAAAC,EAAAC,EAAAC,EAAAlE,EAAAmE,EAAAC,EAAAC,EAAAC,EAAA,IAVmC,OACpC9iB,EAAM,WACNya,EAAU,aACVsI,EAAY,WACZC,GAMD39B,EACC,MAAOo8B,EAAmBC,IAAwBlyC,EAAAA,EAAAA,WAAU,IACrDwyC,EAAmBR,IAAwBlyC,EAAAA,EAAAA,aAChD,CAAC8pC,EAAevpD,KACd,GAAIupD,EAAIpkF,SAAW66B,EAAI76B,OACrB,OAAO66B,EAET,IAAK,IAAI/6B,EAAI,EAAGA,EAAIskF,EAAIpkF,OAAQF,IAC9B,GAAIskF,EAAItkF,KAAO+6B,EAAI/6B,GACjB,OAAO+6B,EAGX,OAAOupD,CAAG,GAEZ,IAGI6J,GAAgB1gC,EAAAA,EAAAA,cACfm4B,EAAOwI,IAAY1zC,EAAAA,EAAAA,UAAS,GAYnC,QAVAJ,EAAAA,EAAAA,kBAAgB,KACd,MAAMorB,EAAKA,IACT0oB,EAvEN,SACEljB,EACAya,EACAsI,EACAI,GACC,IAADC,EAAAC,EAAAC,EAAAC,EACA,IAAKJ,QAA8Bz+B,IAAhBsb,EAAOtlC,KACxB,OAAO,EAET,MAAM8oD,EAAKr/E,KAAK+C,KAAK,GAAgB,QAAfk8E,EAAIpjB,EAAOtlC,YAAI,IAAA0oD,EAAAA,EAAI,GAAI,GAAiB,QAAhBC,EAAIrjB,EAAO3rD,aAAK,IAAAgvE,EAAAA,EAAI,IAAM,EAClEl6C,EAAKhlC,KAAK+C,KAAK,GAAe,QAAdo8E,EAAItjB,EAAOplC,WAAG,IAAA0oD,EAAAA,EAAI,GAAI,GAAkB,QAAjBC,EAAIvjB,EAAOmG,cAAM,IAAAod,EAAAA,EAAI,IAAM,EAGlEE,EAAK,GAAQD,GADjBxjB,EAAOS,OAASsiB,GAA+B,WAAftI,EAA0B,IAAM,GAE5D7yC,EAAK,GAAQuB,EACnB,OAAOhlC,KAAK+C,IACV/C,KAAKrN,MACmE,EAAtEqN,KAAKw1B,IAAIwpD,EAAWO,YAAcD,EAAIN,EAAW7B,aAAe15C,IAC9D,EACJ,GAEJ,CAmDQ+7C,CAAS3jB,EAAQya,EAAYsI,EAAcE,EAAcn7D,UAI7D,OAFA1Q,OAAOuP,iBAAiB,SAAU6zC,GAClCA,IACO,IAAMpjD,OAAOwP,oBAAoB,SAAU4zC,EAAG,GACpD,CAACwF,EAAQya,EAAYsI,EAAcE,IAE9BxI,GACN,IAAK,QACL,IAAK,OACH,OAAO,KAIX,MAAM1mD,EAAqC,EAA5BisC,EAAO36B,QAAQomB,WAAiB,EACzCj4C,EAAQrP,KAAK+C,IAAI6sB,EAAoC,EAA5BisC,EAAO36B,QAAQomB,WAAiB,KAE/D,OACEoC,EAAAA,EAAAA,MAAA,OACEG,UAAWC,GAAO21B,cAClB1/D,MAAOk+D,GAAapiB,EAAQya,EAAYC,GAAO16D,SAAA,CAE/B,WAAfy6D,IACC1sB,EAAAA,EAAAA,KAACwzB,GAAa,CACZvhB,OAAQA,EACRwhB,qBAAsBA,EACtBC,kBAAmBA,EACnBC,qBAAsBA,KAG1B3zB,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAOk1B,WAAYn6C,IAAKi6C,EAAcjjE,UACpD6tC,EAAAA,EAAAA,MAAA,OACEG,UAAS,GAAAtxB,OAAKuxB,GAAO3M,IAAG,KAAA5kB,OAAIsjC,EAAO6M,YAAc7M,EAAOS,MAAQ,GAAKxS,GAAO41B,MAC5E3/D,MAAO,CACL0W,IAAI,cAAD8B,OAAgB3I,EAAS,EAAC,OAC7B2G,KAAK,cAADgC,OAAgBlpB,EAAQ,EAAC,OAC7BA,MAAOA,EACPugB,OAAQA,GAEV+vD,QAAO,GAAApnD,OAAKlpB,GAAS,EAAC,KAAAkpB,OAAI3I,GAAU,EAAC,KAAA2I,OAAIlpB,EAAK,KAAAkpB,OAAI3I,GAClDgwD,MAAM,6BAA4B/jE,SAAA,EAEjC+tC,EAAAA,EAAAA,KAACysB,GAAY,CAACxa,OAAQA,EAAQya,WAAYA,IAC3B,WAAfA,GAA2Bza,EAAOjsC,SACjCg6B,EAAAA,EAAAA,KAACsvB,GAAa,CAACtpD,OAAQisC,EAAOjsC,SAE/BgvD,IACkB,QADNR,EACXviB,EAAO6M,kBAAU,IAAA0V,OAAA,EAAjBA,EAAmBjhC,KAAKr5C,IACtB8lD,EAAAA,EAAAA,KAAC4rB,GAAgB,CAAaC,UAAW3xE,GAAlBA,EAAG0lB,OAE7Bo1D,IACa,QADDP,EACXxiB,EAAOgkB,aAAK,IAAAxB,OAAA,EAAZA,EAAclhC,KAAKxmC,IAAOizC,EAAAA,EAAAA,KAAC8rB,GAAW,CAAajN,KAAM9xD,GAAbA,EAAG6S,OAChC,QADiD80D,EACjEziB,EAAO+E,iBAAS,IAAA0d,OAAA,EAAhBA,EAAkBnhC,KAAI,CAACt9C,EAAGlP,KACzBi5D,EAAAA,EAAAA,KAACquB,GAAa,CAEZ3hB,OAAQz2D,EACRy2E,WAAYA,EACZza,OAAQA,GAHHlrE,KAMQ,QADf4tF,EACD1iB,EAAOyB,iBAAS,IAAAihB,OAAA,EAAhBA,EAAkBphC,KAAKh8C,IACtByoD,EAAAA,EAAAA,KAACquB,GAAa,CAEZ3hB,OAAQn1D,EACRm1E,WAAYA,EACZza,OAAQA,GAHH16D,EAAEqoB,MAMG,QADZ6wD,EACDxe,EAAOqU,cAAM,IAAAmK,OAAA,EAAbA,EAAel9B,KAAKn+C,IACnB4qD,EAAAA,EAAAA,KAACquB,GAAa,CAEZ3hB,OAAQt3D,EACRs3E,WAAYA,EACZza,OAAQA,GAHH78D,EAAEwqB,MAMK,QADdg1D,EACD3iB,EAAOgF,gBAAQ,IAAA2d,OAAA,EAAfA,EAAiBrhC,KAAKzsD,IACrBk5D,EAAAA,EAAAA,KAACquB,GAAa,CAEZ3hB,OAAQ5lE,EACR4lF,WAAYA,EACZza,OAAQA,GAHHnrE,EAAE84B,MAMK,cAAf8sD,IACqB,QADKmI,EACzB5iB,EAAO+L,qBAAa,IAAA6W,OAAA,EAApBA,EAAsBthC,KAAI,CAACkf,EAAGtsE,EAAGsO,KAC/BurD,EAAAA,EAAAA,KAAC+uB,GAAmB,CAAmB5oF,EAAGA,EAAGsO,EAAGA,GAAE,GAAAk6B,OAArBxoC,EAAC,KAAAwoC,OAAIl6B,OAEtB,WAAfi4E,IACC1sB,EAAAA,EAAAA,KAACg0B,GAAa,CACZ/hB,OAAQA,EACRgiB,kBAAmBA,EACnBP,kBAAmBA,EACnB/G,MAAOA,IAGVqI,GAAgB/iB,EAAOS,QACtB1S,EAAAA,EAAAA,KAACuyB,GAAY,CAACtgB,OAAQA,EAAQya,WAAYA,IAE3CuI,IACa,QADHH,EACT7iB,EAAOS,aAAK,IAAAoiB,OAAA,EAAZA,EACI98B,QAAQ7I,GAAO,eAAgBA,IAChCoE,KAAKpE,IACJ6Q,EAAAA,EAAAA,KAACqsB,GAAY,CAEXxa,KAAM1iB,EACNyJ,MAAO,cAFFzJ,EAAGvvB,OAKfq1D,IACa,QADHF,EACT9iB,EAAOS,aAAK,IAAAqiB,OAAA,EAAZA,EACI/8B,QAAQ7I,GAAO,eAAgBA,IAChCoE,KAAKpE,IACJ6Q,EAAAA,EAAAA,KAACqsB,GAAY,CAEXxa,KAAM1iB,EACNyJ,MAAO,cAFFzJ,EAAGvvB,aAOpBogC,EAAAA,EAAAA,KAAC2vB,GAAK,CAAC1d,OAAQA,EAAQya,WAAYA,MAGzC,CC7NA,MAAMwJ,GAEJ5vF,WAAAA,CAAY6vF,GAAwB,KAD5BA,SAAG,EAETpsF,KAAKosF,IAAMA,CACb,CACQC,QAAAA,CACN1kB,EACA3qE,GACuB,IAADsvF,EAAAC,EACtB,MAAM/vF,EAAO,CAAC,GAADooC,OACR5nC,EAAC,KAAA4nC,OAAI5kC,KAAKosF,IAAIlvF,QACI,QADEovF,EACR,QADQC,EACvBvsF,KAAKosF,IAAIpvF,EAAI,UAAE,IAAAuvF,OAAA,EAAfA,EAAiB/vF,YAAI,IAAA8vF,EAAAA,EAAI,OACzBtvF,EAAIgD,KAAKosF,IAAIlvF,OAAM,UAAA0nC,OAAa5kC,KAAKosF,IAAIpvF,GAAGR,KAAI,UAAMowD,GACtDjrD,KAAK,KACD6qF,EAAWxvF,EAAIgD,KAAKosF,IAAIlvF,OACxBM,EACJR,EAAIgD,KAAKosF,IAAIlvF,OACT,IAAM8C,KAAKqsF,SAASrsF,KAAKosF,IAAIpvF,GAAG2qE,GAAS3qE,EAAI,GAC7C,KACN,MAAO,CAAE2qE,SAAQnrE,OAAMgwF,WAAUhvF,OACnC,CACAivF,KAAAA,CAAM9kB,GACJ,OAAO3nE,KAAKqsF,SAAS1kB,EAAQ,EAC/B,CACA+kB,KAAAA,CACEC,GAEA,OAAO,IAAIR,GAAU,IACfnsF,KAAKosF,OACLO,EAAKP,KAEb,CACAzkD,IAAAA,CAAc+6B,GACZ,OAAO,IAAIypB,GAAU,IACfnsF,KAAKosF,IACT1pB,GAEJ,EAGK,SAAS98B,GAAc88B,GAE5B,OAAO,IAAIypB,GADC,CAACzpB,GAEf,CClDO,MAAMkqB,GAQXrwF,WAAAA,CACEs5B,EACA+M,EACAE,EACAvmB,EACA8xD,EACAzF,GACC,KAdM/yC,QAAE,OACF+M,UAAI,OACJE,SAAG,OACHvmB,WAAK,OACL8xD,YAAM,OACNzF,UAAI,EAUX5oE,KAAK61B,GAAKA,EACV71B,KAAK4iC,KAAOA,EACZ5iC,KAAK8iC,IAAMA,EACX9iC,KAAKuc,MAAQA,EACbvc,KAAKquE,OAASA,EACdruE,KAAK4oE,KAAOA,CACd,CAEA,SAAIltD,GACF,OAAO1b,KAAKuc,MAAQvc,KAAK4iC,IAC3B,CAEA,UAAI3G,GACF,OAAOj8B,KAAKquE,OAASruE,KAAK8iC,GAC5B,CAEA,QAAItW,GACF,OAAOxsB,KAAK0b,MAAQ1b,KAAKi8B,MAC3B,CAEA,UAAIkiC,GACF,MAAO,CAACn+D,KAAK4iC,KAAO5iC,KAAK0b,MAAQ,EAAG1b,KAAK8iC,IAAM9iC,KAAKi8B,OAAS,EAC/D,CAEA4wD,QAAAA,CAASjkB,GACP,OAAO,IAAIgkB,GACT5sF,KAAK61B,GACL71B,KAAK4iC,KACL5iC,KAAK8iC,IACL9iC,KAAKuc,MACLvc,KAAKquE,OACLzF,EAEJ,CAEA,eAAIgJ,GACF,OAAOvlE,KAAKw1B,IAAI7hC,KAAK0b,MAAO1b,KAAKi8B,SAAW,CAC9C,EC/CF,MAAM6wD,GAQJvwF,WAAAA,CAAWgxD,GAAgE,IAA/D,QAAEhgB,EAAO,KAAE0lB,GAAiD1F,EAAA,KAPvDhgB,aAAO,OACPw/C,sBAAgB,OAChB55B,SAAG,OACHhf,WAAK,OACL64C,YAAM,OACfC,OAAiB,EAGvBjtF,KAAKutC,QAAUA,EACfvtC,KAAKmzD,IAAMF,EAAKjD,UAChBhwD,KAAK+sF,iBAAmB1gF,KAAK+C,IAC3B/C,KAAKgjE,MAAM9hC,EAAQomB,WAAapmB,EAAQijB,yBACxC,GAGF,MAAM08B,EAAQ3/C,EAAQomB,YAAc,EACpC3zD,KAAKm0C,MAAQ,CACX,IAAIy4C,GAAU5sF,KAAK61B,MAAOq3D,GAAQA,EAAOA,EAAOA,EAAO,UAEzDltF,KAAKgtF,OAAS,EAChB,CAEQn3D,EAAAA,GACN,OAAO71B,KAAKitF,QACd,CAEQE,KAAAA,CACNh9E,EACA0lB,EACAt1B,GAMC,IAAD6sF,EAAAC,EAAAC,EAAAC,EACA,MAAMjgF,EAAI,IAAIs/E,GACZ/2D,EACS,QADPu3D,EACF7sF,EAAKqiC,YAAI,IAAAwqD,EAAAA,EAAIj9E,EAAGyyB,KACR,QADYyqD,EACpB9sF,EAAKuiC,WAAG,IAAAuqD,EAAAA,EAAIl9E,EAAG2yB,IACL,QADQwqD,EAClB/sF,EAAKgc,aAAK,IAAA+wE,EAAAA,EAAIn9E,EAAGoM,MACN,QADWgxE,EACtBhtF,EAAK8tE,cAAM,IAAAkf,EAAAA,EAAIp9E,EAAGk+D,OAClB,SAEEhiE,KAAKw1B,IAAIv0B,EAAEoO,MAAOpO,EAAE2uB,SAhDD,GAiDrBj8B,KAAKm0C,MAAMz2C,KAAK4P,EAEpB,CAEA,cAAWynE,GACT,MAAO,IAAI/0E,KAAKm0C,SAAUn0C,KAAKgtF,OACjC,CAEA,QAAWvvF,GACT,OAA6B,IAAtBuC,KAAKm0C,MAAMj3C,MACpB,CAGO+5D,IAAAA,GACL,MAAM9iB,EAAQ,IAAIn0C,KAAKm0C,OACvBn0C,KAAKm0C,MAAMj3C,OAAS,EACpB,IAAK,MAAMiT,KAAMgkC,EACfn0C,KAAK2iB,MAAMxS,EAEf,CAEQwS,KAAAA,CAAMxS,GACZ,GAAIA,EAAGuL,MAAoB,EAAZvL,EAAG8rB,OAAY,CAE5B,MAAM7/B,EAAI4D,KAAKmzD,IAAIzF,QAAQ,CACzBzhD,EAAG,EACHC,EAAG,EACH21B,IAAK1xB,EAAGyyB,KAAO,EACfxzB,IAAKe,EAAGoM,QAEVvc,KAAKmtF,MAAMh9E,EAAIA,EAAG0lB,GAAI,CAAEtZ,MAAOngB,IAC/B4D,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAE+M,KAAMxmC,GACpC,MAAO,GAAI+T,EAAG8rB,OAAoB,EAAX9rB,EAAGuL,MAAW,CAEnC,MAAMhR,EAAI1K,KAAKmzD,IAAIzF,QAAQ,CACzBzhD,EAAG,EACHC,EAAG,EACH21B,IAAK1xB,EAAG2yB,IAAM,EACd1zB,IAAKe,EAAGk+D,SAEVruE,KAAKmtF,MAAMh9E,EAAIA,EAAG0lB,GAAI,CAAEw4C,OAAQ3jE,IAChC1K,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAEiN,IAAKp4B,GACnC,KAAO,CAEL,IAAIyE,EAAInP,KAAKmzD,IAAIzF,QAAQ,CACvBzhD,EAAG,EACHC,EAAG,IACH21B,IAAK,EACLzyB,IAAK/C,KAAKw1B,IAAI7hC,KAAK+sF,iBAAkB58E,EAAGuL,SAEtCyJ,EAAInlB,KAAKmzD,IAAIzF,QAAQ,CACvBzhD,EAAG,EACHC,EAAG,IACH21B,IAAK,EACLzyB,IAAK/C,KAAKw1B,IAAI7hC,KAAK+sF,iBAAkB58E,EAAG8rB,UAG1C9sB,EAAI9C,KAAKw1B,IAAI1yB,EAAGgW,EAAInlB,KAAKutC,QAAQgjB,wBACjCprC,EAAI9Y,KAAKw1B,IAAI1c,EAAGhW,EAAInP,KAAKutC,QAAQgjB,wBAEjC,MAAMyZ,EAAKhqE,KAAKmzD,IAAI1F,WAAW,CAAE5rB,IAAK1xB,EAAGyyB,KAAMxzB,IAAKe,EAAGoM,MAAQpN,IACzD0C,EAAK7R,KAAKmzD,IAAI1F,WAAW,CAAE5rB,IAAK1xB,EAAG2yB,IAAK1zB,IAAKe,EAAGk+D,OAASlpD,IACzDvP,EAAKo0D,EAAK76D,EACV+yE,EAAKrwE,EAAKsT,EAEZ9Y,KAAKw1B,IAAI1yB,EAAGgW,IAlHK,IAmHf9Y,KAAK+C,IAAID,EAAGgW,IAAMnlB,KAAK+sF,iBACzB/sF,KAAKgtF,OAAOtvF,KAAK,IAAIkvF,GAAUz8E,EAAG0lB,GAAIm0C,EAAIn4D,EAAI+D,EAAIssE,EAAI,cAEtDliF,KAAKm0C,MAAMz2C,KAAK,IAAIkvF,GAAUz8E,EAAG0lB,GAAIm0C,EAAIn4D,EAAI+D,EAAIssE,EAAI,WAIrDliF,KAAKmzD,IAAI9F,OAAO,KAClBrtD,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAEtZ,MAAOytD,EAAIqE,OAAQ6T,IAC/CliF,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAE+M,KAAMonC,EAAIqE,OAAQx8D,IAC9C7R,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAE+M,KAAMhtB,EAAIktB,IAAKjxB,IAC3C7R,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAEtZ,MAAO3G,EAAIktB,IAAKo/C,MAE5CliF,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAEtZ,MAAO3G,EAAIy4D,OAAQx8D,IAC/C7R,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAE+M,KAAMhtB,EAAIy4D,OAAQ6T,IAC9CliF,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAE+M,KAAMonC,EAAIlnC,IAAKo/C,IAC3CliF,KAAKmtF,MAAMh9E,EAAInQ,KAAK61B,KAAM,CAAEtZ,MAAOytD,EAAIlnC,IAAKjxB,IAEhD,CACF,ECzIF,SAAS27E,GAASvhF,EAAcC,GAC9B,MAAO89D,EAAIn4D,GAAM5F,EAAEkyD,QACZvoD,EAAIssE,GAAMh2E,EAAEiyD,OACbnJ,EAAKgV,EAAKp0D,EACVq/C,EAAKpjD,EAAKqwE,EAChB,OAAO71E,KAAKo7E,MAAMzyB,EAAIC,EACxB,CAGO,MAAMw4B,GAKXlxF,WAAAA,CAAYs5B,EAAY+yC,EAAgBmM,GAAmC,KAJlEl/C,QAAE,OACF+yC,UAAI,OACJmM,gBAAU,EAGjB/0E,KAAK61B,GAAKA,EACV71B,KAAK4oE,KAAOA,EACZ5oE,KAAK+0E,WAAaA,CACpB,CAEA,UAAW2Y,GACT,OAAO1tF,KAAK+0E,WAAW,EACzB,CAEA,eAAW4Y,GACT,OAAO3tF,KAAK+0E,WAAW/0E,KAAK+0E,WAAW73E,OAAS,EAClD,CAGA,eAAW0wF,GACT,OAAOJ,GAASxtF,KAAK0tF,OAAQ1tF,KAAK2tF,YACpC,CAGA,iBAAWE,GACT,OAAOnmB,GAAQ1nE,KAAK+0E,WAAYyY,IAAUp/B,QAAO,CAACniD,EAAGC,IAAMD,EAAIC,GAAG,EACpE,CAEA,0BAAWytE,GACT,OAAOttE,KAAK+C,IACVpP,KAAK6tF,cACH7tF,KAAK0tF,OAAO9b,YACZ5xE,KAAK2tF,YAAY/b,YACnB,EAEJ,ECzCK,MAAMkc,GAAaloD,IFwIX,SAAmBsiC,GAChC,MAAM6lB,EAAc,IAAIjB,GAAY5kB,GACpC,MAAQ6lB,EAAYtwF,MAClBswF,EAAY92B,OAEd,MAAO,IAAKiR,EAAQ6M,WAAYgZ,EAAYhZ,WAC9C,IE7IGptC,MCRY,SACbugC,GAEA,MAAM6M,EAAa,IAAI7M,EAAO6M,YACxBiZ,EAAQ9lB,EAAO6M,WAClBvrB,KAAI,CAACr5C,EAAInT,IAAM,CAACmT,EAAGqc,KAAMxvB,KACzBg3D,MAAK,CAAAzG,EAAAC,KAAA,IAAEvhD,GAAEshD,GAAGrhD,GAAEshD,EAAA,OAAKthD,EAAID,CAAC,IACrBw9C,EAAQp9C,KAAKw1B,IAAIqmC,EAAO36B,QAAQkjB,UAAWskB,EAAW73E,OAAS,GACrE,IAAK,IAAIF,EAAI,EAAGA,EAAIysD,EAAOzsD,IAAK,CAC9B,MAAMC,EAAI+wF,EAAMhxF,GAAG,GACnB+3E,EAAW93E,GAAK83E,EAAW93E,GAAG4vF,SAAS,OACzC,CACA,MAAO,IAAK3kB,EAAQ6M,aACtB,IDJGptC,MECY,SACbugC,GAEA,MAAM+lB,EAAiB/lB,EAAO6M,WAAW9mB,QAAQ99C,GAAmB,SAAZA,EAAGy4D,OACrDpN,EAASyyB,EAAelkB,SAAS55D,GAAOA,EAAGguD,SAC3C6V,EAAW,IAAI1Y,EAAWE,GAC1B0wB,EAAgB,GACtB,IAAK,IAAIlvF,EAAI,EAAGA,EAAIg3E,EAAS/V,UAAU/gE,OAAQF,IAC7C,GAAIA,EAAIg3E,EAAS9V,UAAUlhE,GAAI,CAC7B,MAAM64B,EAAKq2D,EAAMhvF,OACX2V,EAASo7E,EAAeja,EAAS/V,UAAUjhE,IAC3C+2E,EACJka,EAAeja,EAAS/V,UAAUjhE,GAAKA,EAAI,IAAM,GAAK,EAAI,KAC5DkvF,EAAMr2D,GAAM,IAAI43D,GAAK53D,EAAI,YAAa,CAAChjB,EAAQkhE,GACjD,CAEF,MAAO,IAAK7L,EAAQgkB,QACtB,IFjBGvkD,MGFY,SAAcugC,GAC3B,MAAMgmB,EAAqB,GAC3B,IAAIC,EAAc,EAElB,MAAMjC,EAAQ,GAEd,IAAK,MAAMpX,IAAQ,IAAI5M,EAAOgkB,OAAOl4B,MACnC,CAAC/nD,EAAGC,IAAMD,EAAE2hF,YAAc1hF,EAAE0hF,cAC3B,CACD,MAAMr4C,EAAKu/B,EAAK4Y,OAAO73D,GACjBue,EAAK0gC,EAAK6Y,YAAY93D,GACtBnE,EAAKw8D,EAAS34C,GACd9kB,EAAKy9D,EAAS95C,GACpB,GAAI1iB,GAAMjB,EAAI,CACZ,GAAIiB,IAAOjB,EAAI,CAEby7D,EAAMpX,EAAKj/C,IAAMi/C,EACjB,QACF,CAEAoZ,EAAStrE,SAAQ,CAACpV,EAAGxQ,KACfwQ,IAAMijB,IACRy9D,EAASlxF,GAAK00B,EAChB,GAEJ,MAAWA,EAETw8D,EAAS95C,GAAM1iB,EACNjB,EAETy9D,EAAS34C,GAAM9kB,GAGfy9D,EAAS34C,GAAM44C,EACfD,EAAS95C,GAAM+5C,EACfA,KAEFjC,EAAMpX,EAAKj/C,IAAM,IAAI43D,GAAK3Y,EAAKj/C,GAAI,WAAYi/C,EAAKC,WACtD,CACA,MAAO,IAAK7M,EAAQgkB,MAAOA,EAAMj+B,QAAQ1tC,GAAMA,IACjD,IHrCGonB,MILY,SAAcugC,GAC3B,MAAM2G,EAAS3G,EAAO36B,QAAQomB,WAAa,EACrCy6B,EAAWvf,EAASA,EACpBqd,EAAgBhkB,EAAOgkB,MAAMj+B,QAChC6mB,GACe,aAAdA,EAAKlM,OACJkM,EAAKC,WAAWtM,MAAMt4D,IACrB,MAAO/T,EAAGsO,GAAKyF,EAAGguD,OAClB,OAAO/hE,EAAIA,EAAIsO,EAAIA,EAAI0jF,CAAQ,MAGrC,MAAO,IAAKlmB,EAAQgkB,QACtB,IJNGvkD,MKNY,SAAcugC,GAC3B,MAAMmmB,EAA0C,CAAC,EAEjD,IAAK,MAAMl+E,KAAM+3D,EAAO6M,WACtB,IAAK,IAAI34E,EAAI+T,EAAGyyB,KAAMxmC,EAAI+T,EAAGoM,MAAOngB,IAClC,IAAK,IAAIsO,EAAIyF,EAAG2yB,IAAKp4B,EAAIyF,EAAGk+D,OAAQ3jE,IAClC2jF,EAAS,GAADzpD,OAAIxoC,EAAC,KAAAwoC,OAAIl6B,IAAOyF,EA8B9B,MAAM+7E,EAAQhkB,EAAOgkB,MAAM1iC,KAAKsrB,GACvB,IAAI2Y,GAAK3Y,EAAKj/C,GAAIi/C,EAAKlM,KAAMjhE,MAAM4zD,KA1B5C,UAAwBuZ,GACtB,IAAIr4B,EAAOq4B,EAAK4Y,OAChB,MAAMY,EAAO,IAAI9sE,IAAI,CAACi7B,IAItB,UAFMA,IAGJ,IAAK,MAAOrgD,EAAGsO,KAAMmqD,EAASpY,EAAK0hB,OAAQ2W,EAAK6Y,YAAYxvB,QAAS,CACnE,MAAMhuD,EAAKk+E,EAAS,GAADzpD,OAAIxoC,EAAC,KAAAwoC,OAAIl6B,IAC5B,GAAIyF,IAAO2kE,EAAK6Y,YAEd,kBADMx9E,GAGR,GAAIA,IAAOm+E,EAAKloF,IAAI+J,KAClBm+E,EAAK1sE,IAAIzR,GACO,SAAZA,EAAGy4D,MAAiB,CACtBnsB,EAAOtsC,QACDssC,EACN,KACF,CAEJ,CAEJ,CAGiD8xC,CAAczZ,OAE/D,MAAO,IAAK5M,EAAQgkB,QACtB,ILjCGvkD,MMyDY,SAAeugC,GAC5B,MAAM/U,EAAM+U,EAAOjV,KAAKhD,MAClBu+B,EAjER,SAAkBtC,GAChB,MAAMvkB,EAAsB,GACtBjqE,EAAOA,CACXo3E,EACA10E,EACA5C,EACAu2E,KACI,IAAD0a,EACH,MAAO7+E,EAAIupD,GAAM/4D,EAAI+9D,QACd/E,EAAIC,GAAM77D,EAAK2gE,OAChBuwB,EAAQriF,KAAKk0D,MAAMlH,EAAKF,EAAIC,EAAKxpD,GACjC49E,EAAW1Y,EAAK+Y,eACrBlmB,EAAM8mB,EAACruF,EAAIy1B,MAAX8xC,EAAM8mB,GAAa,CAAEruF,MAAKuuF,MAAO,MAAMA,MAAM7Z,EAAKj/C,IAAM,CACvD64D,QACAlB,WACAzZ,OACD,EAOH,OALAmY,EAAMtpE,SAASkyD,IACb,MAAM0E,EAAM1E,EAAKC,WACjBr3E,EAAKo3E,EAAM0E,EAAI,GAAIA,EAAI,GAAIA,EAAIA,EAAIt8E,OAAS,IAC5CQ,EAAKo3E,EAAM0E,EAAIA,EAAIt8E,OAAS,GAAIs8E,EAAIA,EAAIt8E,OAAS,GAAIs8E,EAAI,GAAG,IAEvD7R,CACT,CAyCgBinB,CAAS1mB,EAAOgkB,OACxBA,EAAgB,GAChB2C,EAA4B,GAOlC,SAASC,EAASha,EAAYl0C,GAC5B,MAAM8tD,EAAQ9tD,EAAK+tD,MAAM7Z,EAAKj/C,IAAI64D,MAClC,OAAO9tD,EAAK+tD,MAAMvgC,QAAO,CAAC9gD,EAACkgD,EAAgBuhC,KAAY,IAADC,EAAA,IAAvBN,MAAOnhF,GAAGigD,EACvC,MAAMyhC,EAAwB,QAAhBD,EAAG9C,EAAM6C,UAAO,IAAAC,OAAA,EAAbA,EAAepmB,KAChC,MAAiB,aAAbqmB,GAAwC,cAAbA,EACtB5iF,KAAKw1B,IAtBpB,SAAmB7yB,EAAYwB,GAC7B,MAAMlD,EAAIjB,KAAKC,IAAI0C,EAAKwB,GAExB,OAAOlD,EAAIjB,KAAKwkD,GAAK,EAAIxkD,KAAKwkD,GAAKvjD,EAAIA,CACzC,CAkBwB4hF,CAAUR,EAAOnhF,GAAID,GAEhCA,CAAC,GACPyzC,IACL,CAGA,SAASouC,IACP,IAAI7uC,GAAK,EAeT,OAdA4rC,EACGj+B,QAAQ6mB,GAAuB,cAAdA,EAAKlM,OACtBhmD,SAASkyD,IAENzoE,KAAKw1B,IACHitD,EAASha,EAAM0Z,EAAM1Z,EAAK4Y,OAAO73D,KACjCi5D,EAASha,EAAM0Z,EAAM1Z,EAAK6Y,YAAY93D,MACpCqyC,EAAO36B,QAAQqjB,6BAEZs7B,EAAMpX,EAAKj/C,IAElByqB,GAAK,CACP,IAEGA,CACT,CAGA,SAAS8uC,IACP,MAAMC,EAAYb,EAAMhlC,KAAIsE,IAAA,IAAC,IAAE1tD,GAAK0tD,EAAA,OAjFxC,SAAyB0gC,EAAoBtC,EAAe9rF,GAC1D,MAAMivF,EAAsB,GACtBl7C,EAAqB,GACrBwzB,EAAkE,GAMxE,IAJA0nB,EAAUjvF,EAAIy1B,IAAM,EACpBse,EAAMz2C,KAAK0C,GAGJ+zC,EAAMj3C,QAAQ,CACnB,MAAM0jC,EAAOuT,EAAMnf,QACnB2yC,EAAOnhC,QAAQ,CAAEpmC,MAAK2zE,KAAMnzC,EAAM4sD,SAAU6B,EAAUzuD,EAAK/K,MAC3D24D,EAAM5tD,EAAK/K,IAAI84D,MAAM/rE,SAAQ,CAAA2qC,EAAqBwhC,KAAY,IAADO,EAAA,IAA/B,SAAE9B,EAAQ,KAAEzZ,GAAMxmB,EAC9C,MAAM0hC,EAAwB,QAAhBK,EAAGpD,EAAM6C,UAAO,IAAAO,OAAA,EAAbA,EAAe1mB,KAChC,GAAiB,aAAbqmB,GAAwC,cAAbA,EAA0B,CACvD,MAAMl5E,EAAIs5E,EAAUzuD,EAAK/K,IAAM23D,OACJ5gC,IAAvByiC,EAAUtb,EAAKl+C,KACjBse,EAAMz2C,KAAKq2E,GACXsb,EAAUtb,EAAKl+C,IAAM9f,GACZA,EAAIs5E,EAAUtb,EAAKl+C,MAC5Bw5D,EAAUtb,EAAKl+C,IAAM9f,EAEzB,KAEFo+B,EAAM6f,MAAK,CAAC/nD,EAAGC,IAAMmjF,EAAUpjF,EAAE4pB,IAAMw5D,EAAUnjF,EAAE2pB,KACrD,CAEA,OAAO8xC,CACT,CAsDM4nB,CAAgBf,EAAOtC,EAAO9rF,EAAI,IAEpC,OAAa,CACX,MAAM,IAAEA,EAAG,KAAE2zE,GAASsb,EACnBjhC,QAAO,CAAC7tC,EAAG/S,IAAO+S,EAAE,GAAGitE,SAAWhgF,EAAE,GAAGggF,SAAWjtE,EAAI/S,IACtDwnB,QACG8/C,EAAOoX,EAAM2C,EAAczuF,EAAIy1B,IAAIk+C,EAAKl+C,KAC9C,GAAmB,eAAX,OAAJi/C,QAAI,IAAJA,OAAI,EAAJA,EAAMlM,MAAsB,CAC9BsjB,EAAMpX,EAAKj/C,IAAM,IAAI43D,GAAK3Y,EAAKj/C,GAAI,YAAai/C,EAAKC,YACrD,KACF,CACF,CACF,CAEA,SAASya,IACP,MAAM1a,EAAO3hB,EAAItF,WACfq+B,EACGj+B,QAAQ6mB,GAAuB,cAAdA,EAAKlM,OACtBpf,KAAKsrB,IAAI,CACRA,OACA5xD,GAAI4rE,EAASha,EAAM0Z,EAAM1Z,EAAK4Y,OAAO73D,KACrCtU,GAAIutE,EAASha,EAAM0Z,EAAM1Z,EAAK6Y,YAAY93D,SAE3Cm+B,MAAK,CAAC/nD,EAAGC,IAAMD,EAAEiX,GAAKjX,EAAEsV,GAAKrV,EAAEgX,GAAKhX,EAAEqV,KACzC,CAAEtV,EAAG,EAAGC,EAAG,IACX4oE,KACFoX,EAAMpX,EAAKj/C,IAAM,IAAI43D,GAAK3Y,EAAKj/C,GAAI,YAAai/C,EAAKC,WACvD,CAnEA7M,EAAOgkB,MAAMtpE,SAASkyD,IAAU,IAAD2a,EAAAC,EAC7BxD,EAAMpX,EAAKj/C,IAAMi/C,GAChB+Z,EAAaY,EAAC3a,EAAK4Y,OAAO73D,MAA1Bg5D,EAAaY,GAAqB,KAAI3a,EAAK6Y,YAAY93D,IAAMi/C,EAAKj/C,IAClEg5D,EAAaa,EAAC5a,EAAK6Y,YAAY93D,MAA/Bg5D,EAAaa,GAA0B,KAAI5a,EAAK4Y,OAAO73D,IAAMi/C,EAAKj/C,EAAE,IAkEvE,IAAK,IAAI74B,EAAI,EAAGA,EAAIkrE,EAAO36B,QAAQmjB,0BAA2B1zD,IAC5DmyF,KAAkBC,IAEpB,IAAK,IAAIpyF,EAAI,EAAGA,EAAIkrE,EAAO36B,QAAQojB,yBAA0B3zD,IAC3DmyF,KAAkBK,IAGpB,MAAO,IAAKtnB,EAAQgkB,MAAOA,EAAMj+B,QAAQ6mB,GAASA,IACpD,ICjIA,SAAS6a,GAAY1jF,EAAcC,GACjC,IAAK,MAAOqX,EAAI8J,EAAIuiE,EAAKC,EAAKC,EAAKC,IAAQ,CACzC,CAAC9jF,EAAEsQ,MAAOrQ,EAAE02B,KAAM32B,EAAE62B,IAAK72B,EAAEoiE,OAAQniE,EAAE42B,IAAK52B,EAAEmiE,QAC5C,CAACpiE,EAAEoiE,OAAQniE,EAAE42B,IAAK72B,EAAE22B,KAAM32B,EAAEsQ,MAAOrQ,EAAE02B,KAAM12B,EAAEqQ,QAE7C,GACEgH,IAAO8J,GACPhhB,KAAKw1B,IAAIguD,EAAKE,GAAO1jF,KAAK+C,IAAIwgF,EAAKE,GACjCzjF,KAAK+C,IAAIygF,EAAMD,EAAKG,EAAMD,GAAO,EAEnC,OAAO,EAGX,OAAO,CACT,CCNA,SAASE,GAAO94B,EAAcvmB,GAC5B,OAAOumB,EAAMl8C,KAAOk8C,EAAMjG,KAAOtgB,EAAMsgB,KAAOiG,EAAM/rC,MAAQwlB,EAAMxlB,KACpE,CCbO,MAAM8kE,WAAkB9hB,GAC7B+hB,OAAAA,CAAQloB,GACN,MAAML,EAAkB,GAMxB,OALA3nE,KAAK4iB,SAAQ,CAACnN,EAAIrZ,EAAGsO,KACf+K,IAAOuyD,GACTL,EAAOjqE,KAAK,CAACtB,EAAGsO,GAClB,IAEKi9D,CACT,CAEA7rE,GAAAA,CAAIM,EAAWsO,EAAWs9D,GACxB,MAAM5hE,EAAMpG,KAAKxE,IAAIY,EAAGsO,SACZkiD,IAARxmD,GAAqB4hE,EAAQ5hE,IAC/B+pF,MAAMr0F,IAAIM,EAAGsO,EAAGs9D,EAEpB,EAGK,SAASooB,GAAYC,EAAiBvoB,GAC3CL,GAASK,EAAKgN,KAAKC,YAAY,CAAC9oE,EAAGC,KACjC,IAAK,MAAO9P,EAAGsO,KAAMmqD,EAAS5oD,EAAEkyD,OAAQjyD,EAAEiyD,QACxCkyB,EAAKv0F,IAAIM,EAAGsO,EAAG,EACjB,GAEJ,CAEO,SAAS4lF,GAAYD,EAAiBvoB,GAG3CA,EAAKgN,KAAKC,WAAWnyD,SAASzS,IAC5B,MAAM63D,EAAQF,EAAK8J,YAAczhE,EAAGyhE,YAG9BzmE,EAAKkB,KAAKw1B,IAAI1xB,EAAGyhE,YAAczhE,EAAGuL,MAAQ,GAAM,GAChDtQ,EAAKiB,KAAKw1B,IAAI1xB,EAAGyhE,YAAczhE,EAAG8rB,OAAS,GAAM,GACvD,IAAK,IAAI7/B,EAAI+T,EAAGyyB,KAAOz3B,EAAI/O,EAAI+T,EAAGoM,MAAQpR,EAAI/O,IAC5C,IAAK,IAAIsO,EAAIyF,EAAG2yB,IAAM13B,EAAIV,EAAIyF,EAAGk+D,OAASjjE,EAAIV,IAC5C2lF,EAAKv0F,IAAIM,EAAGsO,EAAGs9D,EAEnB,IAGFP,GAASK,EAAKgN,KAAKC,YAAY,CAAC9oE,EAAGC,KACjC,MAAM87D,EAAQF,EAAK8J,YAAcvlE,KAAKw1B,IAAI51B,EAAE2lE,YAAa1lE,EAAE0lE,aAC3D,IAAK,MAAOx1E,EAAGsO,KAAMmqD,EAAS5oD,EAAEkyD,OAAQjyD,EAAEiyD,QACxCkyB,EAAKv0F,IAAIM,EAAGsO,EAAGs9D,EACjB,GAEJ,CAoEA,SAASuoB,GACPF,EACAl9B,EACAua,EACA1F,GAEA,OAAOqoB,EAAKH,QAAQloB,EAAQ,GAAG+B,SAAQjc,IAAA,IAAE1xD,EAAGsO,GAAEojD,EAAA,OAC5C4G,EAAKqV,SAAQtU,IAAe,IAAD+6B,EAAA,IAAZrlF,EAAIC,GAAGqqD,EACpB,OAA6B,QAAzB+6B,EAACH,EAAK70F,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAAolF,EAAAA,GAAK,IAAM,EAC/B,GA3ER,SACLH,EACAl9B,EACAua,EACA1F,EACAhI,GAEA,MAAM2H,EAAkB,GACxB,KAAO3H,GAAI,CACT,MAAM,EAAE5jE,EAAC,EAAEsO,EAAC,GAAE+lF,EAAE,GAAEC,GAAO1wB,EAGzBqwB,EAAKv0F,IAAIM,EAAGsO,EAAGs9D,GACfL,EAAOjqE,KAAK,CAACtB,EAAGsO,IAMhB,MAAMimF,EAAa,CACjB,CAACxlF,GAAM,EAAGC,GAAM,EAAGqlF,IAAKC,EAAIA,GAAKD,GACjC,CAACtlF,IAAKulF,EAAItlF,GAAKqlF,EAAIA,GAAKA,EAAIC,GAAKA,GACjC,CAACvlF,GAAM,EAAGC,GAAM,EAAGqlF,GAAKA,EAAIC,GAAKA,GACjC,CAACvlF,GAAKulF,EAAItlF,IAAKqlF,EAAIA,GAAKA,EAAIC,GAAKA,GACjC,CAACvlF,GAAM,EAAGC,GAAM,EAAGqlF,GAAKC,EAAIA,IAAKD,IACjCjnC,KAAKonC,IAAE,IAAUA,EAAIx0F,EAAGA,EAAIw0F,EAAGzlF,GAAKylF,EAAGH,GAAI/lF,EAAGA,EAAIkmF,EAAGxlF,GAAKwlF,EAAGF,OAEzDG,EAAOF,EAAWloB,MAAKlb,IAAe,IAADujC,EAAA,IAAb,EAAE10F,EAAC,EAAEsO,GAAG6iD,EAIpC,IAAmB,QAAfujC,EAACT,EAAK70F,IAAIY,EAAGsO,UAAE,IAAAomF,EAAAA,GAAK,GAAK9oB,EAE3B,OAAO,EAET,IAAK,IAAIhrE,EAAI2qE,EAAOzqE,OAAS,EAAGF,EAAIqP,KAAK+C,IAAIu4D,EAAOzqE,OAAS,EAAG,GAAIF,IAAK,CACvE,MAAO+zF,EAAIC,GAAMrpB,EAAO3qE,GACxB,GAAI+zF,IAAO30F,GAAK40F,IAAOtmF,EAErB,OAAO,CAEX,CAEA,OAAO,CAAI,IAEb,GAAImmF,EACF,MAGF7wB,EAAK2wB,EAAW7nB,MAAKtb,IAAe,IAADyjC,EAAA,IAAb,EAAE70F,EAAC,EAAEsO,GAAG8iD,EAG5B,SAAmB,QAAfyjC,EAACZ,EAAK70F,IAAIY,EAAGsO,UAAE,IAAAumF,EAAAA,GAAK,IAAM,MAI1BvjB,EAAc,GAAKva,EAAI9F,OAAOqgB,GAIvB,GAEf,CACA,OAAO/F,CACT,CAaeupB,CAAMb,EAAMl9B,EAAKua,EAAa1F,EAAO,CAC1C5rE,EAAGA,EAAI+O,EACPT,EAAGA,EAAIU,EACPqlF,IAAKrlF,EACLslF,GAAIvlF,GAER,GACA,GAEN,CCxJO,MAAMgmF,GAAcvrD,IHqCZ,SACbsiC,GAEA,MAAMkpB,EAAwB,GACxBj9C,EAA8C,CAAC,GAAI,GAAI,IAEvC,IACjB+zB,EAAOgkB,MAAMj+B,QAAQ6mB,GAAuB,aAAdA,EAAKlM,UACnCV,EAAOgkB,MAAMj+B,QAAQ6mB,GAAuB,cAAdA,EAAKlM,QAGlChmD,SAASkyD,IACb,GAA+B,IAA3BA,EAAKC,WAAW73E,OAAc,CAChC,MAAO+O,EAAGC,GAAK4oE,EAAKC,WACpB,IACGqc,EAAcnlF,EAAE4pB,MAChBu7D,EAAcllF,EAAE2pB,MAChB85D,GAAY1jF,EAAGC,IAAMyjF,GAAYzjF,EAAGD,IAKrC,OAHAmlF,EAAcnlF,EAAE4pB,KAAM,EACtBu7D,EAAcllF,EAAE2pB,KAAM,OACtBse,EAAM,GAAGz2C,KAAK,CAAEo3E,OAAMlM,KAAM,QAGhC,CACAz0B,EAAM,GAAGz2C,KAAK,CAAEo3E,OAAMlM,KAAM,QAAS,IAGvCz0B,EAAM,GAAK+zB,EAAO6M,WACf9mB,QAAQ99C,GAAmB,SAAZA,EAAGy4D,OAAoBwoB,EAAcjhF,EAAG0lB,MACvD2zB,KAAKr5C,IAAE,CAAQ2kE,KAAM,IAAI2Y,IAAM,EAAG,SAAU,CAACt9E,IAAMy4D,KAAM,WAE5D,MAAMD,EAA0Bx0B,EAC7B41B,SAAS99D,GAAMA,IACfu9C,KAAI,CAACse,EAAMjyC,KAAE,IAAWiyC,EAAMjyC,SAEjC,MAAO,CAAE0X,QAAS26B,EAAO36B,QAAS0lB,KAAMiV,EAAOjV,KAAM0V,QACvD,IGzEGhhC,MCMY,SACbugC,GAEA,MAAMmpB,EAA0B,GAChCnpB,EAAOS,MAAM/lD,SAASklD,IACpBA,EAAKgN,KAAKC,WAAWnyD,SAASzS,IAAE,IAAAmhF,EAAA,OAC7BD,EAAWC,EAACnhF,EAAG0lB,MAAfw7D,EAAWC,GAAY,KAAI5zF,KAAKoqE,EAAKjyC,GAAG,GAC1C,IAEH,MAAM8yC,EAAQT,EAAOS,MAAMnf,KAAKse,IAC9B,MAAM2L,EAAqB,GAC3B3L,EAAKgN,KAAKC,WACPhL,SAAS55D,GAAOkhF,EAAYlhF,EAAG0lB,MAC/Bo4B,QAAQsjC,GAASA,IAASzpB,EAAKjyC,KAC/BjT,SAAS2uE,GAAU9d,EAAW8d,IAAQ,IAEzC,MAAM3f,GAA6B,SAAd9J,EAAKc,KAAkBv8D,KAAK+C,IAAM/C,KAAKw1B,QACvDimC,EAAKgN,KAAKC,WAAWvrB,KAAKr5C,GAAOA,EAAGyhE,eAiBnC/D,EAAYxhE,KAAKgjE,MACP,SAAdvH,EAAKc,KACDv8D,KAAKwkD,IACFxkD,KAAKw1B,IAAI+vC,EAAa9J,EAAKgN,KAAK4Y,OAAO9b,aACtCvlE,KAAKw1B,IAAI+vC,EAAa9J,EAAKgN,KAAK6Y,YAAY/b,cACpB,EAA1B9J,EAAKgN,KAAK+Y,cACZ,EAAI/lB,EAAKgN,KAAK6E,wBAEpB,MAAO,IAAK7R,EAAM2L,aAAY7B,cAAa/D,YAAW,IAExD,MAAO,IAAK3F,EAAQS,QACtB,IDlDGhhC,ME8CY,SACbugC,GAEA,MAAM/U,EAAM+U,EAAOjV,KAAK/C,MAClBshC,EAvCR,SACEtpB,EACA/U,GAEA,MAAMwV,EAAQxV,EAAI5E,QAChB2Z,EAAOS,MAAM1a,QAAQ6Z,GAAuB,SAAdA,EAAKc,QAG/BzjD,EAAIA,CACRuuD,EACA+d,EACAC,EACAC,IAEIF,EAAY,EACP,GAMF/pB,GAAQ,CAAC,KAJFvU,EACX5E,QAAQ,IAAI5mD,MAAM8pF,EAAY,GAAG9yB,KAAK,GAAGnV,KAAI,CAACkf,EAAG1rE,IAAMA,EAAI,KAC3DixD,QAAO,CAACya,EAAG1rE,IAAMA,EAAI00F,EAAY,IACjC19B,OAC0By9B,IAAY,CAACxlF,EAAGC,KAAC,CAC5CwnE,QACAzI,UAAW/+D,EAAID,EACf0lF,aACAhtE,MAAO,CAACgkD,EAAM3d,WAIlB,MAAO,IACF7lC,EAAE4/C,GAAKU,MAAOyC,EAAO36B,QAAQ6lB,WAAY8U,EAAO36B,QAAQ8lB,WAAY,OACpEluC,EAAE4/C,GAAKS,KAAM0C,EAAO36B,QAAQ+lB,UAAW4U,EAAO36B,QAAQgmB,UAAW,IAExE,CAMgBq+B,CAAS1pB,EAAQ/U,GACzB0+B,EAAoC,GACpCC,EAAoD,GAC1D,IAAK,MAAMC,KAAQP,EACjBM,EAAOC,EAAKptE,MAAM,GAAGkR,IAAMk8D,EAE7B,IAAIC,GAAU,EACd,KAAOA,GAAS,CACdA,GAAU,EACV,IAAK,MAAMD,KAAQP,EAAO,CACxB,GAAIO,EAAK9mB,WAAa,GAA2B,IAAtB8mB,EAAKptE,MAAMznB,OACpC,SAEF,MAAM4qE,EAAOiqB,EAAKptE,MAAMqmC,MACpB8mC,EAAOhqB,EAAKjyC,MAAQk8D,IAGxBC,GAAU,EACND,EAAKptE,MAAMznB,OAAS,GAAKi2D,EAAI9F,OAAO0kC,EAAKJ,YAC3CI,EAAKptE,MAAM6hB,QAAQshC,IAGrBiqB,EAAK9mB,YACL4mB,EAAO/pB,EAAKjyC,IAAMk8D,EAAKre,MACvB5L,EAAK2L,WACFjqB,KAAI,CAACkf,EAAG1rE,IAAMkrE,EAAOS,MAAM3rE,KAC3BixD,QAAQ1tC,GAAMA,EAAEqoD,OAASd,EAAKc,OAC9BhmD,SAASrC,IACJuxE,EAAOvxE,EAAEsV,IACPi8D,EAAOvxE,EAAEsV,MAAQk8D,IACnBD,EAAOvxE,EAAEsV,IAAM,SAGjBi8D,EAAOvxE,EAAEsV,IAAMk8D,EACfA,EAAKptE,MAAMjnB,KAAK6iB,GAClB,KAEN,CACF,CACA,MAAMwtD,EAAkB,GAClBkkB,EAA6B,IAC9BT,EAAMznB,SAASgoB,GAAUA,EAAKre,QAAU3O,GAAKS,KAAOusB,EAAKptE,MAAQ,QACjEktE,EAAO9nB,SAAQ,CAACruE,EAAGsB,IAAOtB,IAAMqpE,GAAKS,KAAO,CAAC0C,EAAOS,MAAM3rE,IAAM,MAErE,IACE,IAAIiuE,EAAY/C,EAAO36B,QAAQimB,aAC/ByX,GAAa,GAAKgnB,EAAW/0F,OAAS,EACtC+tE,IACA,CACA,MAAOnD,GAAQmqB,EAAWvsC,OACxByN,EAAI1F,WAAW,CAAE5rB,IAAK,EAAGzyB,IAAK6iF,EAAW/0F,SACzC,GAEF6wE,EAAQjG,EAAKjyC,KAAM,EACnBiyC,EAAK2L,WACFjqB,KAAI,CAACkf,EAAG1rE,IAAMkrE,EAAOS,MAAM3rE,KAC3BixD,QAAQ1tC,GAAMA,EAAEqoD,OAASd,EAAKc,OAC9BhmD,SAASrC,IACHuxE,EAAOvxE,EAAEsV,MACZi8D,EAAOvxE,EAAEsV,IAAM,UACfo8D,EAAWv0F,KAAK6iB,GAClB,GAEN,CAEA,MAAMooD,EAAQT,EAAOS,MAAMnf,KAAKse,IAAI,IAAAoqB,EAAA,MAAM,IACrCpqB,EACH4L,MAAsB,QAAjBwe,EAAEL,EAAO/pB,EAAKjyC,WAAG,IAAAq8D,EAAAA,EAAI,KAC1BlkB,aAAcD,EAAQjG,EAAKjyC,IAC5B,IACD,MAAO,IAAKqyC,EAAQS,QACtB,IFxHGhhC,MF6CY,SACbugC,GAEA,MAAM3W,EArBR,SACEA,EACA2W,GAEA,OAAO3W,EACJtD,QAAQhiD,IAAC,IAAAkmF,EAAA,MAA6C,aAAf,QAAzBA,EAAAjqB,EAAO36B,QAAQgkB,kBAAU,IAAA4gC,OAAA,EAAzBA,EAA4BlmF,EAAEzP,MAAmB,IAC/DgtD,KAAKv9C,IAAO,IAADmmF,EACV,GAA4C,eAAf,QAAzBA,EAAAlqB,EAAO36B,QAAQgkB,kBAAU,IAAA6gC,OAAA,EAAzBA,EAA4BnmF,EAAEzP,OAAuB,CACvD,MAAM8Q,EAAI,IAAKrB,GAIf,OAHAqB,EAAE+nE,QAAW90E,IAAI,IAAA8xF,EAAA,QAAgB,QAAVA,EAACpmF,EAAEopE,eAAO,IAAAgd,IAATA,EAAAv0F,KAAAmO,EAAY1L,KAAS,MAAM,EACnD+M,EAAEosE,QAAWn5E,IAAI,IAAA+xF,EAAA,QAAgB,QAAVA,EAACrmF,EAAEytE,eAAO,IAAA4Y,IAATA,EAAAx0F,KAAAmO,EAAY1L,KAAS,MAAM,EACnD+M,EAAE6nE,SAAY50E,IAAI,IAAAgyF,EAAA,QAAiB,QAAXA,EAACtmF,EAAEkpE,gBAAQ,IAAAod,IAAVA,EAAAz0F,KAAAmO,EAAa1L,KAAS,MAAM,EAC9C+M,CACT,CACA,OAAOrB,CAAC,GAEd,CAKqBumF,CAAiB5S,GAAY1X,GAG1CqR,EAAQrR,EAAOjV,KAAK9C,UAAUpC,eAClCwD,EACGtD,QAAQud,GAAcA,EAAU2J,WAChCpL,SAASyB,GACRtD,EAAOS,MACJ1a,QAAQ1tC,GAAiB,SAAXA,EAAEqoD,OAChBpf,KAAKse,IAAI,CACRxZ,KAAM,IAAKwZ,EAAM0D,aACjBtd,IAAKsd,EAAU2J,SAAU,CAAEjN,SAAQJ,UAAW,SAmClD2qB,EA5BN,WACE,MAAMC,EAAmB,GACzBA,EAASnZ,EAAM1jD,KAAM,EACrB,MAAMse,EAA0D,CAC9D,CAAE2zB,KAAMyR,EAAOtoB,KAAM,KAEjB0W,EAAuB,GAE7B,IAAK,IAAItlE,EAAQ,EAAG8xC,EAAMj3C,OAAS,EAAGmF,IAAS,CAC7C,MAAM,KAAEylE,EAAI,KAAE7W,GAAS9c,EAAMnf,QAEvB29D,EAAY7qB,EAAK2L,WACpBjqB,KAAI,CAACt9C,EAAG2pB,IAAQ3pB,EAAI2pB,GAAM,IAC1Bo4B,QACEp4B,GACCA,GAAM,IAAM68D,EAAS78D,IAAOqyC,EAAOS,MAAM9yC,GAAI+yC,OAASd,EAAKc,OAEjE+pB,EAAU/vE,SAASiT,GAAQ68D,EAAS78D,IAAM,IAC1Cse,EAAMz2C,QACDi1F,EAAUnpC,KAAK3zB,IAAE,CAClBiyC,KAAMI,EAAOS,MAAM9yC,GACnBo7B,KAAM,IAAIA,EAAM6W,EAAKjyC,SAGzB8xC,EAAOjqE,KAAK,CAAEoqE,OAAM7W,OAAM5uD,SAC5B,CACA,OAAOslE,CACT,CACgBirB,GAEVjqB,EACJT,EAAOS,MAAMxrD,QACf,IAAI6hE,EAAgB,EAEpB,MAAM6T,EAAWJ,EAAQv1F,OAAS,EAC5B41F,EAAUL,EAAQA,EAAQv1F,OAAS,GAAG+zD,KAAK/zD,OAgEjD,OAFAu1F,EAAQ7vE,SAASklD,GAjBjB,SAA4CA,GAC1C,MAAMvnE,EAAO,CAAE2nE,SAAQJ,OAAMkX,iBACvBtR,EAAc5F,EAAK0D,UAAUkC,YAAYntE,GACzCkjE,EAAWp3D,KAAKgjE,MACpBvH,EAAK0D,UAAUmC,gBAAgBptE,GAC7BunE,EAAK0D,UAAUC,qBAAqB3D,EAAK4D,WAE7CsT,GAAiBvb,EACjB,MAAMD,EAAMn3D,KAAKgjE,MAAMvH,EAAK0D,UAAUhI,IAAIjjE,IACpCwyF,EAAkC,IACnCjrB,EACH4F,cACAjK,WACAD,OAEFmF,EAAMb,EAAKjyC,IAAMk9D,CACnB,CAC0BC,CA7D1B,SAAoBzlC,GAIkB,IAJjB,KACnBua,EAAI,KACJ7W,EAAI,MACJ5uD,GACWkrD,EACX,MAAM5c,EAAQ,CAAEsgB,KAAMA,EAAK/zD,OAAS41F,EAAS3nE,MAAO9oB,EAAQwwF,GACtDrnB,EACJ1D,EAAK0D,WACLtD,EAAOjV,KAAKtE,cAAcmZ,EAAKjyC,IAAIk4B,eACjCwD,EAAW/H,KAAKgiB,IACd,MAAMtd,EACU,SAAd4Z,EAAKc,KAAkB4C,EAAU6J,QAAU7J,EAAUkO,QACvD,MAAO,CACLprB,KAAMkd,EACNtd,KAAQ,OAAHA,QAAG,IAAHA,OAAG,EAAHA,EAAM,CAAEga,SAAQJ,OAAMa,QAAO1X,OAAM+tB,oBAAoB,EAC7D,KAGDtT,EAAWF,EAAU5c,MAAM,CAAEsZ,SAAQJ,SACrC8F,EAAkBoiB,GACR,SAAdloB,EAAKc,KACDV,EAAO36B,QAAQyjB,oBACfkX,EAAO36B,QAAQ2jB,oBACnBvgB,GAEIm9B,EAAckiB,GACJ,SAAdloB,EAAKc,KACDV,EAAO36B,QAAQ4jB,gBACf+W,EAAO36B,QAAQ6jB,gBACnBzgB,GAEI0gB,EAAmB2+B,GAAO9nB,EAAO36B,QAAQ8jB,iBAAkB1gB,GAC3D2gB,EAAkB0+B,GAAO9nB,EAAO36B,QAAQ+jB,gBAAiB3gB,GAC/D,MAAO,IACFm3B,EACH7W,OACAua,YACAE,WACAkC,kBACAE,cACAzc,mBACAC,kBAEJ,CAkBsC2hC,CAAYnrB,MAE3C,IAAKI,EAAQS,MAAOA,EAC7B,IErKGhhC,MDsJY,SACbugC,GAEA,MAAMS,EAAQT,EAAOS,MAAMnf,KAAKse,IAC9B,MAAM3U,EAAM+U,EAAOjV,KAAKpE,MAAMiZ,EAAKjyC,IAC7Bw6D,EAAkB,IAAIJ,IACb,SAAdnoB,EAAKc,KAAkB0nB,GAAcF,IAAaC,EAAMvoB,GACzD,MAAMC,EAAwB,CAACsoB,EAAK7mC,KAAI,CAACkf,EAAGtsE,EAAGsO,IAAM,CAACtO,EAAGsO,MACnDshE,EAAwB,GACxB4F,EAAc9J,EAAK0D,UAAUmG,YAAY7J,GAC/C,IAAK,IAAI9qE,EAAI,EAAGA,EAAI40E,EAAa50E,IAC/B+qE,EAAWrqE,KAAK6yF,GAASF,EAAMl9B,EAAK2U,EAAK4F,YAAa1wE,IAEpD40E,EAAc,GAChB7J,EAAWrqE,KAAK6yF,GAASF,EAAMl9B,EAAK,EAAGye,IAEzC,IAAK,IAAI50E,EAAI,EAAGA,EAAI,EAAGA,IACrBgvE,EAAWtuE,KAAK6yF,GAASF,EAAMl9B,EAAK,EAAGn2D,EAAI40E,IAE7C,MAAO,IAAK9J,EAAMC,aAAYiE,aAAY,IAE5C,MAAO,IAAK9D,EAAQS,QACtB,II7KO,SAASuqB,GAAkB3qB,GAChC,MAAMZ,EAAS,IAAIwG,GACbh6B,EACJo0B,EAAM/e,KAAI,CAACkf,EAAGtsE,EAAGsO,KAAC,CAAQtO,IAAGsO,IAAGyoF,KAAM,SACxC,IAAIC,EAAW,EACf,KAAOj/C,EAAMj3C,OAAS,GAAG,CAAC,IAADguE,EACvB,IAAI,EAAE9uE,EAAC,EAAEsO,EAAC,KAAEyoF,GAASh/C,EAAMnf,QAC3B,QAAyB43B,IAArB+a,EAAOnsE,IAAIY,EAAGsO,KAAgD,KAAb,QAAfwgE,EAAA3C,EAAM/sE,IAAIY,EAAGsO,UAAE,IAAAwgE,OAAA,EAAfA,EAAiB7F,QAAkB,CAClE8tB,IACHA,EAAO,CAAEt9D,GAAIu9D,IAAY5gB,aAAa,IAExC7K,EAAO7rE,IAAIM,EAAGsO,EAAGyoF,GACjB,MAAMR,EAAYh+B,EAAWnL,KAAI+D,IAAA,IAAEpiD,EAAIC,GAAGmiD,EAAA,MAAM,CAC9CnxD,EAAGA,EAAI+O,EACPT,EAAGA,EAAIU,EACP+nF,OACD,IACDh/C,EAAM3N,WAAWmsD,EACnB,CACF,CACA,OAAOhrB,CACT,CChBA,MAAM0rB,GAAW,CACf,IAAIn/B,EAAO,GACX,IAAIC,EAAY,GAChB,IAAIC,EAAM,GACV,IAAIC,EAAY,GAChB,IAAIC,EAAO,GACX,IAAIC,EAAY,GAChB,IAAIC,EAAM,GACV,IAAIC,EAAY,ICnBlB,SAAS6+B,GAASC,GAChB,GAA6B,IAAzBA,EAAcr2F,OAAc,CAC9B,MAAO+O,EAAGC,GAAKqnF,EACf,OAAOtnF,EAAE,KAAOC,EAAE,IAAMD,EAAE,KAAOC,EAAE,EACrC,CACA,OAAOqnF,EAAcr2F,OAAS,CAChC,CCDO,MAAMs2F,GAAa5tD,ICDX,SACbsiC,GAEA,MAAMM,EAAgB,IAAI2F,GACpBxB,EAAgB,IAAIwB,GAiB1B,OAhBAjG,EAAOS,MAAM/lD,SAASklD,IACpBA,EAAKC,WAAWnlD,SAAQ,CAAColD,EAAOhrE,IAC9BgrE,EAAMplD,SAAQ2qC,IAAa,IAAXnxD,EAAGsO,GAAE6iD,EACnB,MAAMxwD,EAAIyrE,EAAchtE,IAAIY,EAAGsO,IAAM,GACrC3N,EAAE+qE,EAAKjyC,IAAM74B,EACbwrE,EAAc1sE,IAAIM,EAAGsO,EAAG3N,EAAE,MAG9B+qE,EAAKkE,WAAWppD,SAAQ,CAAColD,EAAOhrE,IAC9BgrE,EAAMplD,SAAQ4qC,IAAa,IAAXpxD,EAAGsO,GAAE8iD,EACnB,MAAMzwD,EAAI4vE,EAAcnxE,IAAIY,EAAGsO,IAAM,GACrC3N,EAAE+qE,EAAKjyC,IAAM74B,EACb2vE,EAAc7wE,IAAIM,EAAGsO,EAAG3N,EAAE,KAE7B,IAEI,IAAKmrE,EAAQM,gBAAemE,gBACrC,IDpBGhlC,MEFY,SACbugC,GAEA,MAAMK,EAAQ,IAAI4F,GAIlB,OAHAjG,EAAOS,MAAM/lD,SAASklD,IACpBA,EAAK0D,UAAU1c,MAAM,CAAEoZ,SAAQJ,OAAMS,SAAQ,IAExC,IAAKL,EAAQK,QACtB,IFLG5gC,MGLY,SAAeugC,GAC5B,MAAM/U,EAAM+U,EAAOjV,KAAK7C,MAClBmY,EAAQL,EAAOK,MAAMh0D,OACrBg+D,EAAiB2gB,GAAkB3qB,GACnCkrB,EAA6B,IAAItlB,GACjCh6B,EACJo0B,EAAMwB,SAAQ,CAACrB,EAAGtsE,EAAGsO,IAAM,CACzB,CAAEtO,IAAGsO,IAAG+1D,OAAQ,SACb/L,EAAKlL,KAAK9tD,IAAC,CAAQU,EAAGA,EAAIV,EAAE,GAAIgP,EAAGA,EAAIhP,EAAE,GAAI+kE,OAAQ,YAE5D,KAAOtsB,EAAMj3C,QAAQ,CAAC,IAADw2F,EAAAxoB,EACnB,MAAM,EAAE9uE,EAAC,EAAEsO,EAAC,OAAE+1D,GAAWtsB,EAAM6W,MAC/B,IAAKyoC,EAAQj4F,IAAIY,EAAGsO,KAA8B,QAA5BgpF,EAAoB,QAApBxoB,EAAK3C,EAAM/sE,IAAIY,EAAGsO,UAAE,IAAAwgE,OAAA,EAAfA,EAAiB7F,cAAM,IAAAquB,GAAAA,GAAW,CAC3D,MAAMf,EAAYj+B,EAAKlL,KAAK9tD,IAAC,CAC3BU,EAAGA,EAAIV,EAAE,GACTgP,EAAGA,EAAIhP,EAAE,GACT+kE,OAAQ/kE,MAEJi4F,EAAgBhB,EAAU1kC,QAC9BV,IAAA,IAAAqmC,EAAAC,EAAA,IAAC,EAAEz3F,EAAC,EAAEsO,GAAG6iD,EAAA,OAA4B,QAA5BqmC,EAAoB,QAApBC,EAAKtrB,EAAM/sE,IAAIY,EAAGsO,UAAE,IAAAmpF,OAAA,EAAfA,EAAiBxuB,cAAM,IAAAuuB,GAAAA,CAAQ,IAG/C,IAAKD,EAAcz2F,OAAQ,CACzB,MAAMwT,EAAIyiD,EAAIxF,cAAcglC,GAC5BpqB,EAAMzsE,IAAI4U,EAAEtU,EAAGsU,EAAEhG,EAAGq6D,GAAKW,MACzBiuB,EAAcj2F,KAAKgT,EACrB,CAaA,GAXmBojF,MACjB,GAA6B,IAAzBH,EAAcz2F,OAAc,CAC9B,MAAO+O,EAAGC,GAAKynF,EACf,OACG1nF,EAAE7P,IAAM8P,EAAE9P,GAAK6P,EAAEvB,IAAMwB,EAAExB,IAC1B6nE,EAAe/2E,IAAIyQ,EAAE7P,EAAG6P,EAAEvB,KAAO6nE,EAAe/2E,IAAI0Q,EAAE9P,EAAG8P,EAAExB,EAE/D,CACA,OAAOipF,EAAcz2F,OAAS,CAAC,EAG7B42F,GAAc,CAChB,MAAO3oF,EAAIC,GAAMq1D,GAAUkzB,EAAc,GAAGlzB,OAAOjX,KAAKzsD,IAAOA,IACzD2T,EAAI,CAAEtU,EAAGA,EAAIgP,EAAIV,EAAGA,EAAIS,EAAIs1D,OAAQ,EAAEr1D,EAAID,IAChDo9D,EAAMzsE,IAAI4U,EAAEtU,EAAGsU,EAAEhG,EAAGq6D,GAAKW,MACzBiuB,EAAcj2F,KAAKgT,EACrB,CAEA+iF,EAAQ33F,IAAIM,EAAGsO,GAAG,GAClBypC,EAAMz2C,QAAQi2F,EAAc1lC,QAAOT,IAAA,IAAC,EAAEpxD,EAAC,EAAEsO,GAAG8iD,EAAA,OAAK+a,EAAM/sE,IAAIY,EAAGsO,EAAE,IAClE,CACF,CACA,MAAO,IAAKw9D,EAAQK,QACtB,IH7CG5gC,MF4BY,SAAeugC,GAC5B,MAAMK,EAAQL,EAAOK,MAAMh0D,OAyB3B,OAxBA2zD,EAAOK,MAAM3lD,SAAQ,CAACrV,EAAGnR,EAAGsO,KAGxB6C,IAAMw3D,GAAKgB,YACVrR,EAAK+T,MAAKlb,IAAe,IAAbpiD,EAAIC,GAAGmiD,EAClB,MAAMwmC,EAAKxrB,EAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,GACjC,OAAO2oF,GAAMA,IAAOhvB,GAAKc,WAAakuB,IAAOhvB,GAAKgB,UAAU,KAM7Dx4D,EAAE83D,QA5BT,SAAgBkD,EAAmBnsE,EAAWsO,GAC5C,IAAI4C,EAAI,EACR,IAAK,IAAItQ,EAAI,EAAGA,EAAIq2F,GAASn2F,OAAQF,IAAK,CAAC,IAADkuE,EACxC,MAAO//D,EAAIC,EAAIrO,GAAKs2F,GAASr2F,GAI7B,IAH0C,KAAb,QAAzBkuE,EAAA3C,EAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAA8/D,OAAA,EAAzBA,EAA2B7F,UAC7B/3D,GAAKvQ,GAEHuQ,GAAK,EACP,OAAO,CAEX,CACA,OAAO,CACT,CAiBM0mF,CAAOzrB,EAAOnsE,EAAGsO,GAEjB69D,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKW,MAGrBn4D,EAAE63D,UACD1Q,EAAK+T,MAAKjb,IAAA,IAAAqmC,EAAA,IAAE1oF,EAAIC,GAAGoiD,EAAA,OAA8B,QAA9BqmC,EAAKtrB,EAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAAyoF,OAAA,EAAzBA,EAA2BzuB,OAAO,KAE3DmD,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKC,OAZrBuD,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKc,UAavB,IAEK,IAAKqC,EAAQK,QACtB,IEtDG5gC,MITY,SAAcugC,GAC3B,MAAMK,EAAQL,EAAOK,MAAMh0D,OAa3B,OAZA2zD,EAAOK,MAAM3lD,SAAQ,CAACrV,EAAGnR,EAAGsO,KAGxB6C,IAAMw3D,GAAKc,WACVnR,EAAK+T,MAAKlb,IAAe,IAAbpiD,EAAIC,GAAGmiD,EAClB,MAAMwmC,EAAKxrB,EAAM/sE,IAAIY,EAAI+O,EAAIT,EAAIU,GACjC,OAAQ2oF,GAAMA,IAAOhvB,GAAKc,WAAakuB,IAAOhvB,GAAKgB,UAAU,KAG/DwC,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKY,WACvB,IAEK,IAAKuC,EAAQK,QACtB,IJLG5gC,MKGY,SAAcugC,GAC3B,IAAIqiB,EACJ,MAAMnW,EAAqBn4D,GAAyBsuE,EAAiBtuE,EAC/Dg4E,EAAU,CACd/rB,SACAK,MAAOL,EAAOK,MAAMh0D,OACpBkvD,SAAU,IAAI0K,GACd3K,IAAK,IAAI2K,GACTlB,UAAW,GACXgH,cAAe,IAAI9F,IAUrB,OARAjG,EAAOS,MAAM/lD,SAAgCklD,IAC3C,MAAMvnE,EAAO,IAAK0zF,EAAS7f,oBAAmBtM,QAC9CA,EAAK0D,UAAUzc,kBAAkBxuD,GACjCunE,EAAK0D,UAAUxc,eAAezuD,GAC9BunE,EAAK0D,UAAUvc,cAAc1uD,GAC7BunE,EAAK0D,UAAUtc,SAAS3uD,GACxBunE,EAAK0D,UAAUrc,eAAe5uD,EAAK,IAE9B,IAAK2nE,KAAW+rB,EAAS1J,iBAClC,ILtBG5iD,MDHY,SAAeugC,GAC5B,MAAMK,EAAQL,EAAOK,MAAMh0D,OACrB4/B,EAAQ+zB,EAAOK,MAAMwB,SAAQ,CAACrB,EAAGtsE,EAAGsO,IACxCgqD,EAAKlL,KAAI+D,IAAA,IAAEpiD,EAAIC,GAAGmiD,EAAA,MAAK,CAACnxD,EAAI+O,EAAIT,EAAIU,EAAG,MAEzC,KAAO+oC,EAAMj3C,QAAQ,CACnB,MAAOd,EAAGsO,GAAKypC,EAAMnf,QACrB,GAAIuzC,EAAM/sE,IAAIY,EAAGsO,GACf,SAEF,MAAM6oF,EAAgB7+B,EAAKlL,KACzBgE,IAAA,IAAEriD,EAAIC,GAAGoiD,EAAA,MAAK,CAACpxD,EAAI+O,EAAIT,EAAIU,EAAG,IAC9B6iD,QAAQhyC,IAASssD,EAAM/sE,OAAOygB,KAC5Bq3E,GAASC,KAEXhrB,EAAMzsE,IAAIM,EAAGsO,EAAGq6D,GAAKgB,YACrB5xB,EAAMz2C,QAAQ61F,GAElB,CACA,MAAO,IAAKrrB,EAAQK,QACtB,IOFO,MAAM2rB,GAAa33F,WAAAA,GAAA,KAChBs5B,GAAa,CAAE,CACvB8f,MAAAA,CACEp1C,GAGA,MAAO,CACLg7E,WAAW,EACXvX,MAAO,EACP8Z,QAAS,CAAC,SACVuG,OAAQ,QACL9jF,EACHs1B,GAAI71B,KAAK61B,KAEb,ECxCF,MAAMs+D,GAAS,CACb,EAAE,GAAI,GACN,EAAE,EAAG,GACL,CAAC,GAAI,GACL,CAAC,EAAG,IAyFN,SAAS3pB,GAAOtC,EAA0BjsC,GACxC,MAAM0rC,EAAS,IAAIwG,GACnB,IAAK,IAAI/xE,EAAI8rE,EAAOtlC,KAAO,EAAGxmC,EAAI8rE,EAAO3rD,MAAOngB,IAC9C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAM,EAAGp4B,EAAIw9D,EAAOmG,OAAQ3jE,IAAK,CACnD,MAAMwF,EAAK+rB,EAAOzgC,IAAIY,EAAGsO,GACzB,GAAIwF,EACFy3D,EAAO7rE,IAAIM,EAAGsO,EAAGwF,OACZ,CACL,IAAIioD,EAAM,EACN1O,EAAQ,EACZiL,EAAK9xC,SAAQ4qC,IAAe,IAAbriD,EAAIC,GAAGoiD,EACpB,MAAMroC,EAAI8W,EAAOzgC,IAAIY,EAAI+O,EAAIT,EAAIU,QACvBwhD,IAANznC,IACFgzC,GAAOhzC,EACPskC,IACF,IAEEA,GACFke,EAAO7rE,IAAIM,EAAGsO,EAAGytD,EAAM1O,EAE3B,CACF,CAEF,OAAOke,CACT,CCvGA,MAAMysB,GAAQ73F,WAAAA,GAAA,KACK6H,KAAO,IAAIuvB,GAGxB,CAEJn4B,GAAAA,CACEwuE,EACAn4D,EACA+D,EACAssE,GAEA,GAAIlY,EAAKp0D,GAAOo0D,IAAOp0D,GAAM/D,GAAMqwE,EAAK,CACtC,MAAM50E,EAAItN,KAAKoE,KAAK5I,IAAI,GAADopC,OAAIolC,EAAE,KAAAplC,OAAI/yB,EAAE,KAAA+yB,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,IAC7C,OAAO50E,GAAK,CAAE+mF,OAAQ/mF,EAAEgnF,QAASC,QAASjnF,EAAEknF,SAC9C,CACA,MAAMlnF,EAAItN,KAAKoE,KAAK5I,IAAI,GAADopC,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,EAAE,KAAAt9C,OAAIolC,EAAE,KAAAplC,OAAI/yB,IAC7C,OAAOvE,GAAK,CAAE+mF,OAAQ/mF,EAAEknF,SAAUD,QAASjnF,EAAEgnF,QAC/C,CACAx4F,GAAAA,CACEkuE,EACAn4D,EACA+D,EACAssE,EACAmS,EACAE,GAEA,GAAIvqB,IAAOp0D,GAAM/D,IAAOqwE,EAGxB,GAAIlY,EAAKp0D,GAAOo0D,IAAOp0D,GAAM/D,EAAKqwE,EAAK,CACrC,MAAM50E,EAAItN,KAAKoE,KAAK5I,IAAI,GAADopC,OAAIolC,EAAE,KAAAplC,OAAI/yB,EAAE,KAAA+yB,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,IACzC50E,GACFA,EAAEgnF,QAAUjoF,KAAKw1B,IAAIv0B,EAAEgnF,QAASD,GAChC/mF,EAAEknF,SAAWnoF,KAAKw1B,IAAIv0B,EAAEknF,SAAUD,IAElCv0F,KAAKoE,KAAKtI,IAAI,GAAD8oC,OAAIolC,EAAE,KAAAplC,OAAI/yB,EAAE,KAAA+yB,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,GAAM,CACvClY,KACAn4D,KACA+D,KACAssE,KACAoS,QAASD,EACTG,SAAUD,GAGhB,KAAO,CACL,MAAMjnF,EAAItN,KAAKoE,KAAK5I,IAAI,GAADopC,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,EAAE,KAAAt9C,OAAIolC,EAAE,KAAAplC,OAAI/yB,IACzCvE,GACFA,EAAEgnF,QAAUjoF,KAAKw1B,IAAIv0B,EAAEgnF,QAASC,GAChCjnF,EAAEknF,SAAWnoF,KAAKw1B,IAAIv0B,EAAEknF,SAAUH,IAElCr0F,KAAKoE,KAAKtI,IAAI,GAAD8oC,OAAIhvB,EAAE,KAAAgvB,OAAIs9C,EAAE,KAAAt9C,OAAIolC,EAAE,KAAAplC,OAAI/yB,GAAM,CACvCm4D,GAAIp0D,EACJ/D,GAAIqwE,EACJtsE,GAAIo0D,EACJkY,GAAIrwE,EACJyiF,QAASC,EACTC,SAAUH,GAGhB,CACF,CACA1F,KAAAA,GACE,MAAMhnB,EAAS,IAAIwG,GACnB,SAAS3yE,EAAIY,EAAWsO,GACtB,IAAI4C,EAAIq6D,EAAOnsE,IAAIY,EAAGsO,GAKtB,OAJK4C,IACHA,EAAI,GACJq6D,EAAO7rE,IAAIM,EAAGsO,EAAG4C,IAEZA,CACT,CAKA,OAJAtN,KAAKoE,KAAKwe,SAAQ2qC,IAA4C,IAA3C,GAAEyc,EAAE,GAAEn4D,EAAE,GAAE+D,EAAE,GAAEssE,EAAE,QAAEoS,EAAO,SAAEE,GAAUjnC,EACtD/xD,EAAIwuE,EAAIn4D,GAAInU,KAAK,CAAEqV,GAAI,CAAC6C,EAAIssE,GAAKmS,OAAQC,EAASC,QAASC,IAC3Dh5F,EAAIoa,EAAIssE,GAAIxkF,KAAK,CAAEqV,GAAI,CAACi3D,EAAIn4D,GAAKwiF,OAAQG,EAAUD,QAASD,GAAU,IAEjE3sB,CACT,EA4Da,SAAS8sB,GAAWvsB,GACjC,MAAMymB,EAAQ,IAAIyF,GAWlB,OAlEF,SAAuBlsB,GACrB,MAAMP,EAAS,IAAIwG,GAGbumB,EAAgBroF,KAAK+C,IACzB84D,EAAO36B,QAAQmlB,aACfwV,EAAO36B,QAAQolB,cAEXgiC,EAAkBzsB,EAAOS,MAAMnf,KAAKse,IAAI,IAAA8sB,EAAA,OAC5CvoF,KAAKw1B,IACHimC,EAAKkG,WAAa,EAAIjtB,IACC,QADO6zC,EAC9B9sB,EAAK0D,UAAUlG,gBAAQ,IAAAsvB,EAAAA,EAAI7zC,IACb,SAAd+mB,EAAKc,KACDV,EAAO36B,QAAQmlB,aACfwV,EAAO36B,QAAQolB,aACpB,IAEH,IAAK,IAAIv2D,EAAI8rE,EAAOtlC,KAAMxmC,EAAI8rE,EAAO3rD,MAAOngB,IAC1C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAKp4B,EAAIw9D,EAAOmG,OAAQ3jE,IAAK,CAAC,IAAD49D,EAAAU,EAC/C,IAAI6rB,EAAQ9zC,IACZ,MAAMmrB,EAAOhE,EAAOK,MAAM/sE,IAAIY,EAAGsO,GACtB,IAADoqF,EAERD,EAFE3oB,EAEM7/D,KAAKw1B,IAAIgzD,EAAoB,QAAfC,EAAE5oB,EAAK5G,gBAAQ,IAAAwvB,EAAAA,EAAI/zC,KAIvC3kD,EAAI8rE,EAAOtlC,MACXxmC,GAAK8rE,EAAO3rD,OACZ7R,EAAIw9D,EAAOplC,KACXp4B,GAAKw9D,EAAOmG,OAEJhiE,KAAKw1B,IAAIgzD,EAAO3sB,EAAO36B,QAAQslB,gBAE/BxmD,KAAKw1B,IAAIgzD,EAAO3sB,EAAO36B,QAAQqlB,cAI3CiiC,EAAQxoF,KAAKw1B,IACXgzD,EAOG,QAPEvsB,EAEO,QAFPU,EACLd,EAAOM,cACJhtE,IAAIY,EAAGsO,UAAE,IAAAs+D,OAAA,EADZA,EAEI5a,QACA,CAAC9gD,EAAuBo7D,EAAG1rE,IACzBqP,KAAKw1B,IAAK,OAADv0B,QAAC,IAADA,EAAAA,EAAKyzC,IAAU4zC,EAAgB33F,UAC1C4vD,UACD,IAAA0b,EAAAA,EAAIosB,GAET/sB,EAAO7rE,IAAIM,EAAGsO,EAAGmqF,EACnB,CAEF,OAAOltB,CACT,CAKEotB,CAAc7sB,GAAQtlD,SAAQ,CAACiyE,EAAO7qB,EAAIn4D,KACxC,MAAM+D,EAAKo0D,EAAK,EACVkY,EAAKrwE,EAAK,EAChB88E,EAAM7yF,IAAIkuE,EAAIn4D,EAAI+D,EAAI/D,EAAIgjF,EAAOA,GACjClG,EAAM7yF,IAAIkuE,EAAIn4D,EAAIm4D,EAAIkY,EAAI2S,EAAOA,GACjClG,EAAM7yF,IAAI8Z,EAAI/D,EAAI+D,EAAIssE,EAAI2S,EAAOA,GACjClG,EAAM7yF,IAAIkuE,EAAIkY,EAAItsE,EAAIssE,EAAI2S,EAAOA,EAAM,IAGlClG,CACT,CCtHA,SAASqG,GAAO9sB,EAA4B9rE,EAAWsO,GACrD,MAAMhK,EAASwnE,EAAOjsC,OAAOzgC,IAAIY,EAAGsO,GAI9BuqF,EACJ74F,IAAM8rE,EAAOtlC,MACbxmC,IAAM8rE,EAAO3rD,OACb7R,IAAMw9D,EAAOplC,KACbp4B,IAAMw9D,EAAOmG,OACf,MAAO,CACL3tE,SACAiyF,UAAW,GACXuC,QAAS,CAAC,CAAC94F,EAAGsO,IACdyqF,eAAgBF,EAChBpzD,IAAKozD,EAAW,EAAI9P,GACpB/1E,IAAK6lF,EAAW,EAAI7P,GACpB3mD,MAAOw2D,EAAW,EAAI7P,GAAaD,GAEvC,CA0Be,SAASiQ,GAASltB,GAI/B,MAAMmtB,EA3ER,SAAkBntB,GAChB,MAAMP,EAAS,IAAIwG,GAsBnB,OArBAjG,EAAOK,MAAM3lD,SAAQ,CAACspD,EAAM9vE,EAAGsO,KAAO,IAAD49D,EACnC,IAAIhrB,EACJ,GAAI4uB,IAASnH,GAAKU,MAChBnoB,EAAO,OACF,GAAI4uB,IAASnH,GAAKS,KACvBloB,EAAO,MACF,IACyB,QADzBgrB,EACLJ,EAAOM,cAAchtE,IAAIY,EAAGsO,UAAE,IAAA49D,IAA9BA,EAAgCG,MAAK,CAACC,EAAG1rE,IAAMkrE,EAAOS,MAAM3rE,GAAGgxE,aAI/D,OAFA1wB,EAAO,CAGT,CACA4nC,GAAetiE,SAAQ2qC,IAAe,IAAD+nC,EAAA,IAAZnqF,EAAIC,GAAGmiD,EAC9Boa,EAAO7rE,IACLM,EAAI+O,EACJT,EAAIU,EACJiB,KAAK+C,IAAIkuC,EAAgC,QAA5Bg4C,EAAE3tB,EAAOnsE,IAAIY,EAAI+O,EAAIT,EAAIU,UAAG,IAAAkqF,EAAAA,EAAI,GAC9C,GACD,IAEG3tB,CACT,CAmDgB4tB,CAASrtB,GACjBstB,EA7BR,SAA0BttB,EAA4BmtB,GACpD,MAAM1tB,EAAS,IAAIwG,GAEbh6B,EAA6DkhD,EAAM7rC,KACvE,CAACkf,EAAGtsE,EAAGsO,KAAC,CAAQtO,IAAGsO,IAAGk2B,KAAM,SAE9B,KAAOuT,EAAMj3C,OAAS,GAAG,CACvB,IAAI,EAAEd,EAAC,EAAEsO,EAAC,KAAEk2B,GAASuT,EAAMnf,QAC3B,IAAK2yC,EAAOnsE,IAAIY,EAAGsO,GAAI,CAChBk2B,IACHA,EAAOo0D,GAAO9sB,EAAQ9rE,EAAGsO,IAE3Bi9D,EAAO7rE,IAAIM,EAAGsO,EAAGk2B,GACjB,MAAM+xD,EAAYj+B,EAAKlL,KAAIgE,IAAA,IAAEriD,EAAIC,GAAGoiD,EAAA,MAAM,CACxCpxD,EAAGA,EAAI+O,EACPT,EAAGA,EAAIU,EACPw1B,OACD,IAAGqtB,QAAOH,IAAA,IAAG1xD,EAAGwZ,EAAIlL,EAAGw3E,GAAIp0B,EAAA,OAAKunC,EAAM75F,IAAIoa,EAAIssE,EAAG,IAClD/tC,EAAM3N,WAAWmsD,EACnB,CACF,CACA,OAAOhrB,CACT,CAOgB8tB,CAAiBvtB,EAAQmtB,GAGvC,IAAK,IAAIj5F,EAAI8rE,EAAOtlC,KAAMxmC,GAAK8rE,EAAO3rD,MAAOngB,IAC3C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAKp4B,GAAKw9D,EAAOmG,OAAQ3jE,IAAK,CAChD,MAAMk2B,EAAO40D,EAAMh6F,IAAIY,EAAGsO,GACtBk2B,EACFA,EAAKs0D,QAAQx3F,KAAK,CAACtB,EAAGsO,IAEtB8qF,EAAM15F,IAAIM,EAAGsO,EAAGsqF,GAAO9sB,EAAQ9rE,EAAGsO,GAEtC,CAIF,MAAMikF,EAAQ8F,GAAWvsB,GA2BzB,OAxBAmtB,EAAMzyE,SAAQ,CAAC06B,EAAMlhD,EAAGsO,KACtB,MAAMwE,EAAIouC,EAAO,EACjB,IAAK,IAAInyC,GAAM+D,EAAG/D,GAAM+D,EAAG/D,IACzB,IAAK,IAAIC,GAAM8D,EAAG9D,GAAM8D,EAAG9D,IACzBujF,EAAM7yF,IAAIM,EAAGsO,EAAGtO,EAAI+O,EAAIT,EAAIU,EAAI21C,IAAU,EAE9C,IAIF4tC,EAAMA,QAAQ/rE,SAAQ,CAACV,EAAG8nD,EAAIn4D,KAC5B,MAAM+uB,EAAO40D,EAAMh6F,IAAIwuE,EAAIn4D,GAC3B,GAAI+uB,EAAM,CACR,MAAM+xD,EAAYzwE,EACfsnC,KAAIiM,IAAA,IAAC,GAAE1iD,EAAE,OAAEshF,EAAM,QAAEE,GAAS9+B,EAAA,MAAM,CACjC70B,KAAM40D,EAAMh6F,OAAOuX,GACnBshF,SACAE,UACD,IACAtmC,QAAO0H,IAAA,IAAG/0B,KAAMlwB,GAAGilD,EAAA,OAAKjlD,GAAKA,IAAMkwB,CAAI,IACzCA,EAAK+xD,UAA+Cj1F,QAAQi1F,EAC/D,KAGK6C,CACT,CCxHA,SAASE,GAAUxtB,GACjB,MAAMP,EAAS,IAAIwG,GACnB,IAAK,IAAI/xE,EAAI8rE,EAAOtlC,KAAMxmC,GAAK8rE,EAAO3rD,MAAOngB,IAC3C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAKp4B,GAAKw9D,EAAOmG,OAAQ3jE,IAC3Ci9D,EAAO7rE,IAAIM,EAAGsO,EAAG,GAGrB,OAAOi9D,CACT,CCxBO,MAAMguB,GAAa/vD,ICEX,SAAesiC,GAC5B,IAAI,KAAEtlC,EAAI,IAAEE,EAAG,MAAEvmB,EAAK,OAAE8xD,GAAWnG,EAAOK,MAAM6F,OAChD,MAAM1yD,EAAQa,EAAQqmB,EAChB3G,EAASoyC,EAASvrC,EAClBwa,EAAOjxC,KAAK+C,IAAIsM,EAAOugB,GAO7B,OALA2G,EAAOA,EAAOv2B,KAAKrN,OAAOs+C,EAAO5hC,GAAS,GAAK,EAC/ConB,EAAMA,EAAMz2B,KAAKrN,OAAOs+C,EAAOrhB,GAAU,GAAK,EAC9C1f,EAAQqmB,EAAO0a,EAAO,EACtB+wB,EAASvrC,EAAMwa,EAAO,EAEf,IAAK4qB,EAAQtlC,OAAME,MAAKvmB,QAAO8xD,SACxC,IDbG1mC,MEAY,SAAkBugC,GAC/B,MAAMqK,EAAiB2gB,GAAkBhrB,EAAOK,OAIhD,OAHAL,EAAO+L,cAAcrxD,SACnB,CAAC8lD,EAAGtsE,EAAGsO,IAAO6nE,EAAe/2E,IAAIY,EAAGsO,GAAI8nE,aAAc,IAEjD,IAAKtK,EAAQqK,iBACtB,IFLG5qC,MJkHY,SACbugC,GAEA,GAAIA,EAAO36B,QAAQumB,mBAAqB,EACtC,MAAO,IAAKoU,EAAQjsC,OAAQ,IAAIkyC,IAElC,IAAIlyC,EA9EN,SAAuBisC,GACrB,MAAM0tB,EAlCR,SAAuB1tB,GACrB,MAAMpU,EAAoB,CACxBjyB,KAAMqmC,EAAO36B,QAAQumB,kBACrB1kD,IAAK84D,EAAO36B,QAAQumB,mBAGhB+hC,EAAiB,GACjBluB,EAAmB,GACnBxU,EAAM+U,EAAOjV,KAAKh3B,OAElBkY,EAAQ+zB,EAAOS,MAAM1a,QAAQ6Z,IAAUA,EAAK7W,KAAK/zD,SAEvD,IADAi3C,EAAMvxB,SAASklD,GAAU+tB,EAAO/tB,EAAKjyC,KAAM,IACpCse,EAAMj3C,QAAQ,CAAC,IAAD44F,EACnB,MAAMhuB,EAAO3zB,EAAMnf,QACb7P,EACW,QADV2wE,EACLnuB,EAAOG,EAAKjyC,WAAG,IAAAigE,EAAAA,EACA,SAAdhuB,EAAKc,KAAkBzV,EAAI1F,WAAWqG,GAAqB,KAC9D6T,EAAOG,EAAKjyC,IAAM1Q,EAClB2iD,EAAK2L,WAAW7wD,SAAQ,CAAC7lB,EAAGC,KAC1B,MAAMujB,EAAI2nD,EAAOS,MAAM3rE,GACnB64F,EAAO74F,IAAMujB,EAAEqoD,OAASd,EAAKc,QAG7Bd,EAAK4L,OAASnzD,EAAEmzD,SAClB/L,EAAO3qE,GAAKmoB,GAEd0wE,EAAO74F,IAAK,EACZm3C,EAAMz2C,KAAK6iB,GAAE,GAEjB,CACA,OAAOonD,CACT,CAGqBouB,CAAc7tB,GAC3B8tB,EAAc9tB,EAAO36B,QAAQumB,mBAAqB,EAClD6T,EAAS,IAAIwG,GACnB,IAAK,IAAI/xE,EAAI8rE,EAAOtlC,KAAMxmC,EAAI8rE,EAAO3rD,MAAOngB,IAC1C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAKp4B,EAAIw9D,EAAOmG,OAAQ3jE,IAAK,CAAC,IAADq+D,EAAAT,EAC/C,IAAInQ,EAAM,EACN1O,EAAQ,EACR2b,IAAkC,QAAvB2D,EAACb,EAAOK,MAAM/sE,IAAIY,EAAGsO,UAAE,IAAAq+D,IAAtBA,EAAwB3D,SACV,QAA9BkD,EAAAJ,EAAOM,cAAchtE,IAAIY,EAAGsO,UAAE,IAAA49D,GAA9BA,EAAgC1lD,SAAQ,CAAC8lD,EAAG1rE,KAC1C,MAAMmoB,EAAIywE,EAAW54F,GACZ,MAALmoB,IACFgzC,GAAOhzC,EACPskC,KAEF2b,IAAAA,EAAY8C,EAAOS,MAAM3rE,GAAGgxE,WAAU,IAEpCvkB,GACFke,EAAO7rE,IAAIM,EAAGsO,EAAG2B,KAAKgjE,MAAMlX,EAAM1O,IAAU2b,EAAU4wB,EAAc,GAExE,CAEF,OAAOruB,CACT,CAuDesuB,CAAc/tB,GAC3BjsC,EAtDF,SAAyBisC,EAA0BguB,GACjD,MAAMvuB,EAAS,IAAIwG,GACnB,IAAK,IAAI/xE,EAAI8rE,EAAOtlC,KAAMxmC,GAAK8rE,EAAO3rD,MAAOngB,IAC3C,IAAK,IAAIsO,EAAIw9D,EAAOplC,IAAKp4B,GAAKw9D,EAAOmG,OAAQ3jE,IAAK,CAChD,IAAIytD,EAAM,EACN1O,EAAQ,EACZ0qC,GAAOvxE,SAAQ2qC,IAAe,IAAbpiD,EAAIC,GAAGmiD,EACtB,MAAMpoC,EAAI+wE,EAAW16F,IAAIY,EAAI+O,EAAIT,EAAIU,QAC3BwhD,IAANznC,IACFgzC,GAAOhzC,EACPskC,IACF,IAEEA,GACFke,EAAO7rE,IAAIM,EAAGsO,EAAGytD,EAAM1O,EAE3B,CAEF,OAAOke,CACT,CAmCWwuB,CAAgBjuB,EAAQjsC,GACjC,IAAK,IAAIj/B,EAAI,EAAGA,EAAIkrE,EAAO36B,QAAQskB,cAAe70D,IAChDi/B,EAASuuC,GAAOtC,EAAQjsC,GAG1B,MAAO,IAAKisC,EAAQjsC,SACtB,II9HG0L,MDmDY,SACbugC,GAGA,GAAIA,EAAO36B,QAAQumB,mBAAqB,EACtC,MAAO,IAAKoU,EAAQjsC,OAAQy5D,GAAUxtB,IAGxC,MAAMstB,EAAQJ,GAASltB,GACjBjsC,EAAS,IAAIkyC,GACbhb,EAAM+U,EAAOjV,KAAKh3B,OAIlBm6D,EAA8BZ,EACjChsC,KAAKh8C,GAAMA,IACXygD,QAAQzgD,GAAMA,EAAE2nF,iBAEbrjC,EAAgBoW,EAAO36B,QAAQukB,cAa/BukC,EAAWA,KACf,MAAMz1D,EAZIoqB,MACV,IAAI19C,EAAI,EACR,IAAK,IAAItQ,EAAI,EAAGA,EAAIo5F,EAAcl5F,OAAQF,IACpCo5F,EAAcp5F,GAAGyhC,OAAS23D,EAAc9oF,GAAGmxB,QAC7CnxB,EAAItQ,GAGR,OAAOo5F,EAAc1wC,OAAOp4C,EAAG,GAAG,EAAE,EAKvB09C,GACP7lC,EA7DV,SACEyb,EACAuyB,EACArB,GAEA,GAAIlxB,EAAKiB,MAAQjB,EAAKxxB,IACpB,OAAOwxB,EAAKiB,IAEd,MAAMy0D,OACgB1pC,IAAhBhsB,EAAKlgC,OACA,GAELkgC,EAAKlgC,QAAUkgC,EAAKiB,IACf,EAELjB,EAAKlgC,QAAUkgC,EAAKxxB,IACf,GAEDwxB,EAAKlgC,OAASkgC,EAAKiB,MAAQjB,EAAKxxB,IAAMwxB,EAAKiB,KAErD,OAAOsxB,EAAIzF,QAAQ,CACjBzhD,EAAG,EAAI6lD,EAAgBwkC,EACvBpqF,EAAG,EAAI4lD,GAAiB,EAAIwkC,GAC5Bz0D,IAAKjB,EAAKiB,IACVzyB,IAAKwxB,EAAKxxB,IAAM,GAEpB,CAmCcmnF,CAAgB31D,EAAMuyB,EAAKrB,GACrC,IAAK,IAAI90D,EAAI,EAAGA,EAAI4jC,EAAKs0D,QAAQh4F,OAAQF,IACvCi/B,EAAOngC,OAAO8kC,EAAKs0D,QAAQl4F,GAAImoB,GAKjC,OAHAyb,EAAKiB,IAAM1c,EACXyb,EAAKxxB,IAAM+V,EACXyb,EAAKnC,MAAQ,EACNmC,CAAI,EAMb,KAAOw1D,EAAcl5F,QAAQ,CAG3B,MAAMs5F,EAAc,CAACH,KACrB,KAAOG,EAAYt5F,QAAQ,CAEzB,MAAM0jC,EAAO41D,EAAYxhE,QAEzB,IAAK,IAAIh4B,EAAI,EAAGA,EAAI4jC,EAAK+xD,UAAUz1F,OAAQF,IAAK,CAC9C,MAAMsvE,EAAW1rC,EAAK+xD,UAAU31F,GAEhC,IAAKsvE,EAAS1rC,KAAKnC,MACjB,SAIF6tC,EAAS1rC,KAAKiB,IAAMx1B,KAAK+C,IACvBk9D,EAAS1rC,KAAKiB,IACdjB,EAAKiB,IAAMyqC,EAASioB,SAEtBjoB,EAAS1rC,KAAKxxB,IAAM/C,KAAKw1B,IACvByqC,EAAS1rC,KAAKxxB,IACdwxB,EAAKxxB,IAAMk9D,EAAS+nB,QAEtB,MAAM51D,EAAQ6tC,EAAS1rC,KAAKxxB,IAAMk9D,EAAS1rC,KAAKiB,IAE5CpD,EAAQ6tC,EAAS1rC,KAAKnC,QACxB6tC,EAAS1rC,KAAKnC,MAAQA,EAEtB+3D,EAAY94F,KAAK4uE,EAAS1rC,MAErB0rC,EAAS1rC,KAAKu0D,iBACjB7oB,EAAS1rC,KAAKu0D,gBAAiB,EAC/BiB,EAAc14F,KAAK4uE,EAAS1rC,OAGlC,CACF,CACF,CAEA,MAAO,IAAKsnC,EAAQjsC,SACtB,ICzIG0L,MGQY,SAAkBugC,GAC/B,IAAIqiB,EAA6CriB,EAAOqiB,eACxD,MAAMnW,EAAqBn4D,GAAyBsuE,EAAiBtuE,EAC/Dg4E,EAAU,CACd/rB,SACAqC,WAAY,IAAI4D,GAChBJ,QAAS,IAAII,GACbzE,gBAAiB,IAAInC,GACrBoC,UAAW,GACX6S,aAAc,IAAI0X,GAClB3X,OAAQ,GACRE,eAAgB,IAAInB,GACpBpO,SAAU,IAQZ,GANAhF,EAAOS,MAAM/lD,SAAgCklD,IAC3C,MAAMvnE,EAAO,IAAK0zF,EAAS7f,oBAAmBtM,QAC9CA,EAAK0D,UAAUpc,gBAAgB7uD,GAC/BunE,EAAK0D,UAAUnc,aAAa9uD,GAC5BunE,EAAK0D,UAAUlc,cAAc/uD,EAAK,KAE/BgqF,EACH,MAAM,IAAIpqF,MACR,uHAIJ,MAAO,IAAK+nE,KAAW+rB,EAAS1J,iBAClC,IC7BA,MAGMkM,GAAW,IAGXC,GAEE,EAFFA,GAGa,IAHbA,GAMQ,EANRA,GAOc,EAPdA,GAQQ,GARRA,GASU,GATVA,GAWM,EAXNA,GAaU,GAbVA,GAec,GAfdA,GAgBgB,IAhBhBA,GAiBiB,IAjBjBA,GAkBmB,ICxBzB,MAAMC,GAA2Bp6F,WAAAA,GAAA,KACtBq6F,QAAuB,GAAG,KAC1BC,OAAS,IAAIr1E,GAAwB,CAE9Cs1E,MAAAA,CACEl4D,EACAm4D,GAEA,MAAMD,EAAS,CACbjhE,GAAI71B,KAAK42F,QAAQ15F,OACjB0hC,KAAMA,EACNm4D,SAAkB,OAARA,QAAQ,IAARA,EAAAA,EAAY,KACtBC,MAAO,GACPC,OAAQ,GACRC,gBAAiB,CAAC,EAClBxoD,MAAO,GAMT,OAJA1uC,KAAK42F,QAAQl5F,KAAKo5F,GACdC,GAAyB,UAAbA,GAAqC,QAAbA,GACtC/2F,KAAK62F,OAAOj1E,IAAIm1E,GAEXD,CACT,EAQF,SAASK,GACPlrF,EACAC,GAEA,IAAIlP,EAAI,EACJC,EAAI,EACJqQ,EAAI,GACR,OACE,GAAItQ,GAAKiP,EAAE/O,OAAQ,CACjB,GAAID,GAAKiP,EAAEhP,OACT,OAAOoQ,EAETA,EAAE5P,KAAKwO,EAAEjP,KACX,MAAWA,GAAKiP,EAAEhP,QAAU+O,EAAEjP,GAAG64B,GAAK3pB,EAAEjP,GAAG44B,GACzCvoB,EAAE5P,KAAKuO,EAAEjP,MACAiP,EAAEjP,GAAG64B,GAAK3pB,EAAEjP,GAAG44B,GACxBvoB,EAAE5P,KAAKwO,EAAEjP,OAETqQ,EAAE5P,KAAKuO,EAAEjP,MACTC,IAGN,CAEA,MAAMm6F,GAMJ76F,WAAAA,CACEQ,EACAs6F,EACAC,EACAC,GACC,KAVcx6F,OAAC,OACDs6F,WAAK,OACLC,WAAK,OACLC,UAAI,EAQnBv3F,KAAKjD,EAAIA,EACTiD,KAAKq3F,MAAQA,EACbr3F,KAAKs3F,MAAQA,EACbt3F,KAAKu3F,KAAOA,CACd,CAEA,aAAOC,CACLC,EACAl3F,GAEA,MAAMq+B,EAAiB,GACjB42D,EAAqB,GAC3B,IAAK,MAAMl7E,KAAO/Z,GACf+Z,aAAe88E,GAAS5B,EAAQ52D,GAAMlhC,KAAK4c,GAE9C,GAAqB,IAAjBk7E,EAAMt4F,OAAc,CACtB,MAAMqjB,EAAI,CAACk3E,EAAUX,OAAOl4D,IAC5B,OAAO,IAAIw4D,GAAOK,EAAWl3E,EAAGA,GAAG,EACrC,CACA,MAAM82E,EAAQ7B,EAAMzrB,SAASr5D,GAAMA,EAAE2mF,QAAOrjC,MAAK,CAAC/nD,EAAGC,IAAMD,EAAE4pB,GAAK3pB,EAAE2pB,KAC9DyhE,EAAQ9B,EAAMzrB,SAASr5D,GAAMA,EAAE4mF,QAAOtjC,MAAK,CAAC/nD,EAAGC,IAAMD,EAAE4pB,GAAK3pB,EAAE2pB,KAC9D0hE,EAAO/B,EAAM/sB,MAAM/3D,GAAMA,EAAE6mF,OACjC,GAAI34D,EAAK1hC,OAAS,EAAG,CACnB,MAAM45F,EAASW,EAAUX,OAAOl4D,GAChCy4D,EAAM35F,KAAKo5F,GACXQ,EAAM55F,KAAKo5F,EACb,CACA,OAAO,IAAIM,GAAOK,EAAWJ,EAAOC,EAAOC,EAC7C,CAEA5vD,IAAAA,GAAyC,IAAD,IAAA2mC,EAAAvuE,UAAA7C,OAAhCqD,EAAI,IAAAoH,MAAA2mE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJhuE,EAAIguE,GAAAxuE,UAAAwuE,GACV,MAAMoe,EAAOyK,GAAOI,OAAOx3F,KAAKjD,EAAGwD,GACnC,IAAK,MAAMgN,KAAKvN,KAAKs3F,MACnB,IAAK,MAAMnyE,KAAKwnE,EAAK0K,MA1EkBnrF,EA2E7BiZ,GA3EelZ,EA2ElBsB,GA1ETypF,MAAMt5F,KAAKwO,GACbA,EAAE+qF,OAAOv5F,KAAKuO,GAFhB,IAA+BA,EAAcC,EA8EzC,OAAO,IAAIkrF,GACTp3F,KAAKjD,EACLiD,KAAKu3F,KAAOJ,GAAMn3F,KAAKq3F,MAAO1K,EAAK0K,OAASr3F,KAAKq3F,MACjD1K,EAAK4K,KAAOJ,GAAMn3F,KAAKs3F,MAAO3K,EAAK2K,OAAS3K,EAAK2K,MACjDt3F,KAAKu3F,MAAQ5K,EAAK4K,KAEtB,EAkFF,SAASG,GAAoCZ,GAC3C,MAAMa,EAA0C,CAAC,EACjD,IAAK,MAAM1rF,KAAK6qF,EAAOE,MACrB3wF,OAAO2G,OAAO2qF,EAAgB1rF,EAAEirF,iBAGlC,GAA2C,IAAvC7wF,OAAOyM,KAAK6kF,GAAgBz6F,OAC9B,OAAO45F,EAAOC,SAAW,CAAE,CAACD,EAAOC,WAAW,GAAS,CAAC,EAG1D,IAAKD,EAAOC,SACV,OAAOY,EAGT,MAAMC,EAAqC,CAAC,EAC5C,IAAK,MAAM/0E,KAAM80E,EAAgB,CAC/B,MAAMd,EAASh0E,EAAGF,MAAM,KACnBk0E,EAAOpuB,MAAMv5D,GAAMA,IAAM4nF,EAAOC,aACnCF,EAAOn5F,KAAKo5F,EAAOC,UACnBF,EAAO7iC,OACP4jC,EAAUf,EAAOl1F,KAAK,OAAQ,EAElC,CACA,OAAOi2F,CACT,CAiBA,MAAMC,GAAmB,CACvB,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,GAGFC,GAAiB,CACrB,MAAM,GAGFC,GAAkB,CACtB,KAAK,EACL,KAAK,EACL,KAAK,EACL,KAAK,EACL,MAAM,GAiCD,MAAMC,GAKXz7F,WAAAA,CACEoE,EACAi2F,EACAC,GACC,KARKl2F,WAAK,OACJi2F,aAAO,OACPC,YAAM,EAOb72F,KAAKW,MAAQA,EACbX,KAAK42F,QAAUA,EACf52F,KAAK62F,OAASA,CAChB,CAEAoB,QAAAA,CACE9kC,EACA+kC,EACAC,GAEA,MAAMtB,EAAS,IAAI72F,KAAK62F,OAAQ,QAAS,OACnCuB,EAA6C,CACjDz3F,OAAO,EACPO,KAAK,GAEP,IAAK,MAAMgO,KAAKlP,KAAK62F,OACfqB,EAAahpF,KACfkpF,EAAelpF,IAAK,GAGxB,MAAMmpF,EAA6B,CAACr4F,KAAKW,OACzC,OAAa,CACX,MAAMm2F,EAASuB,EAAcA,EAAcn7F,OAAS,GACpD,GAAwB,QAApB45F,EAAOC,SACT,MACSD,EAAOC,WAChBqB,EAAetB,EAAOC,WAAY,GAEpC,MAAMuB,EAAezB,EAClB5oC,QAAQ/+C,GAAMkpF,EAAelpF,KAC7B8kD,OACAryD,KAAK,KACF42F,EAAgBzB,EAAOE,MAAM/oC,QAChChiD,GAAMqsF,KAAgBrsF,EAAEirF,kBAE3B,GAA6B,IAAzBqB,EAAcr7F,OAMhB,MALAs7C,QAAQ1mB,IACN,uCACAwmE,EACAxB,GAEI,IAAI32F,MAAM,uBAADykC,OACU0zD,EAAY,eAAA1zD,OAAckyD,EAAOjhE,KAG5DwiE,EAAc36F,KAAKy1D,EAAIxF,cAAc4qC,GACvC,CACA,MAAMC,EAASH,EAAc7uC,KAAKstC,IAAM,CACtCA,SACA2B,UACE3B,EAAOl4D,KAAK1hC,OAAS,EACjBi2D,EAAI1F,WAAW,CAAEr+C,IAAK0nF,EAAOl4D,KAAK1hC,UACjC,MAEH0hC,EAnEKxhC,EAACwhC,EAAcu5D,IAC5Bv5D,EAAKjlB,QAAQ,0BAA0B,CAAC+uD,EAAG5+D,IAAQquF,EAAWruF,KAkE/C1M,CA9FjB,SACEo7F,GAEA,MAAMlrF,EAAc,GACpB,IAAIorF,GAAiB,EACjBC,GAAkB,EACtB,IAAK,MAAM,OAAE7B,EAAM,UAAE2B,KAAeD,EAAQ,CAC1C,MAAM55D,EAAOk4D,EAAOl4D,KAAK65D,GACzB,IAAK75D,EACH,SAEE+5D,KAAqB/5D,EAAKzjB,OAAO,KAAM48E,KACzCzqF,EAAE5P,KAAK,KAELg7F,GACFprF,EAAE5P,KAAKkhC,EAAK,GAAGllB,eACfpM,EAAE5P,KAAKkhC,EAAKzhB,MAAM,KAElB7P,EAAE5P,KAAKkhC,GAET,MAAMg6D,EAAWh6D,EAAKzjB,OAAOyjB,EAAK1hC,OAAS,GAC3Cw7F,EAAiBE,KAAYf,GAC7Bc,IAAoBC,KAAYd,GAClC,CACA,OAAOxqF,EAAE3L,KAAK,GAChB,CAqEwBk3F,CAAUL,GAASL,GACvC,MAAO,CAAEK,SAAQ55D,OACnB,EAYa,SAASk6D,GACtBp2B,GAEA,MAAM+0B,EAAY,IAAId,GAkBtBj0B,EAAG,CAAEn4B,GAhBM,mBAAAwlC,EAAAhwE,UAAA7C,OAAIqD,EAAI,IAAAoH,MAAAooE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJzvE,EAAIyvE,GAAAjwE,UAAAiwE,GAAA,OACjBonB,GAAOI,OAAOC,EAAWl3F,EAAM,EAexBiU,MAdK,WAA+C,IAAD,IAAAg9D,EAAAzxE,UAAA7C,OAA1CqD,EAAI,IAAAoH,MAAA6pE,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJlxE,EAAIkxE,GAAA1xE,UAAA0xE,GACpB,MAAMmlB,EAAUr2F,EAAKipD,KAAKlvC,GAAQm9E,EAAUX,OAAO,GAAIx8E,KACvD,OAAO,IAAI88E,GAAOK,EAAWb,EAASA,GAAS,EACjD,EAWgBj2F,MAVF,IAAIy2F,GAChBK,EACA,GACA,CAACA,EAAUX,OAAO,GAAI,WACtB,GAMqB51F,IAJX,IAAIk2F,GAAOK,EAAW,CAACA,EAAUX,OAAO,GAAI,QAAS,IAAI,GAIzCiC,IAHhB,IAAI3B,GAAOK,EAAW,GAAI,IAAI,GAGTF,KAFpB,IAAIH,GAAOK,EAAW,GAAI,IAAI,KAI3C,MAAMb,EA7QR,SACEA,GAEA,MAAMoC,EAAmC,GACnCr0E,EAAQiyE,EAAQ3oC,QAAQ6oC,GAAoC,IAAzBA,EAAOG,OAAO/5F,SACjDu1F,EAAgC,GAEtC,KAAO9tE,EAAMznB,OAAS,GAAG,CACvB,MAAM45F,EAASnyE,EAAMqQ,QACrB,QAA4B43B,IAAxBosC,EAASlC,EAAOjhE,IAClB,SAEF,MAAMohE,EAASH,EAAOG,OAAOhpC,QAAQ/hD,UAA2B0gD,IAAnBosC,EAAS9sF,EAAE2pB,OACpDohE,EAAO/5F,OAAS,EAClBynB,EAAM6hB,WAAWywD,EAAQH,IAEzBkC,EAASlC,EAAOjhE,IAAM48D,EAAQv1F,OAC9Bu1F,EAAQ/0F,KAAK,IAAKo5F,EAAQjhE,GAAI48D,EAAQv1F,SACtCynB,EAAM6hB,WAAWswD,EAAOE,OAE5B,CAcA,OATAvE,EAAQ7vE,SAASk0E,IACfA,EAAOE,MAAQF,EAAOE,MACnBxtC,KAAKv9C,GAAMwmF,EAAQuG,EAAS/sF,EAAE4pB,OAC9Bm+B,MAAK,CAAC/nD,EAAGC,IAAMD,EAAE4pB,GAAK3pB,EAAE2pB,KAC3BihE,EAAOG,OAASH,EAAOG,OACpBztC,KAAKt9C,GAAMumF,EAAQuG,EAAS9sF,EAAE2pB,OAC9Bm+B,MAAK,CAAC/nD,EAAGC,IAAMD,EAAE4pB,GAAK3pB,EAAE2pB,IAAG,IAGzB48D,CACT,CA0OkBz+B,CAAKyjC,EAAUb,UAvOjC,SAAgCA,GAC9B,MAAMjyE,EAA8BiyE,EAAQ3oC,QACzCrtB,GAAgC,IAAvBA,EAAKq2D,OAAO/5F,SAElB+7F,EAA0B,GAChC,IAAK,IAAIj8F,EAAI,EAAGA,EAAI45F,EAAQ15F,OAAQF,IAClCi8F,EAAcj8F,GAAK,GAGrB,SAASk8F,EAASpC,GAChBpoD,EAAM,IAAK,IAAIA,EAAO,GAAKA,IAAQ,CACjC,GAAIooD,EAAOG,OAAO/5F,OAAS,EACzB,IAAK,IAAIF,EAAI85F,EAAOG,OAAO,GAAGphE,GAAK,EAAG74B,GAAK85F,EAAOjhE,GAAI74B,IACpD,GAAIi8F,EAAcj8F,GAAG0xC,GACnB,SAASA,EAIf,OAAOA,CACT,CACF,CAEA,KAAO/pB,EAAMznB,OAAS,GAAG,CACvB,MAAM45F,EAASnyE,EAAMqQ,QACrB,GAAI8hE,EAAOpoD,MAAQ,EACjB,SAEF,MAAMA,EAAOwqD,EAASpC,GACtB,GAAIA,EAAOG,OAAO/5F,OAAS,EAAG,CAC5B,IAAK,IAAIF,EAAI85F,EAAOG,OAAO,GAAGphE,GAAK,EAAG74B,EAAI85F,EAAOjhE,GAAI74B,IACnDi8F,EAAcj8F,GAAG0xC,IAAQ,EAE3B/pB,EAAM6hB,WAAWswD,EAAOG,OAC1B,CACAgC,EAAcnC,EAAOjhE,IAAI6Y,IAAQ,EACjCooD,EAAOpoD,KAAOA,EACd/pB,EAAM6hB,WAAWswD,EAAOE,MAC1B,CACF,CAkMEmC,CAAMvC,GAtKR,SAAmCA,GACjC,IAAK,IAAI55F,EAAI45F,EAAQ15F,OAAS,EAAGF,GAAK,EAAGA,IAAK,CAC5C,MAAM85F,EAASF,EAAQ55F,GACvB85F,EAAOI,gBAAkBQ,GAAmBZ,EAC9C,CACF,CAkKEsC,CAASxC,GACT,MAAMyC,EAAWzC,EAAQ9tB,MAAMguB,GAA+B,UAApBA,EAAOC,WAC3CF,EAASlvF,MAAM4zD,KAAKk8B,EAAUZ,OAAOyC,UAAUtlC,OAErD,OAAO,IAAIgkC,GAAYqB,EAAUzC,EAASC,EAC5C,CCjZA,SAAS3oB,GAAU3gB,GAGkB,IAHA,GACnChjB,EAAE,MACF/1B,GACgC+4C,EAChC,MAAMgsC,EAAmBhvD,EACvB/1B,EAAM,iBAAiBmzB,KAAK,6BAC5BnzB,EAAM,qBAAsB,mBAAmBmzB,KAC7C,+BAIE6xD,EAAgBhlF,EAAM,qBAAqBmzB,KAC/C,8BACA,qCAKF,OAFA4xD,EAAiB5xD,KAAK,OAAOA,KAAK6xD,GAE3BjvD,EAAGgvD,EAAkBC,GAAe7xD,MAC7C,CAEA,MAAM8xD,GAAgB,CACpB,aACA,aACA,eACA,iCACA,mCACA,sCACA,yCAGWC,GAAUZ,IACrBtrC,IAA2C,IAA1C,GAAEjjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAM/pC,EACnC,MACE,MAAMmsC,EAAUnlF,EAAM,WAAWmzB,KAAK,UAAW8xD,IAC3C/lC,EAAcl/C,EAAM,eAAemzB,KACvC,0CACA,kDAEIiyD,EAAiBrvD,EACrB,oBACA,yBACA,mCAGF,OADAmpB,EAAY/rB,KAAKiyD,GACVj5F,EACJgnC,KAAK4vD,EAAMoC,EAASjmC,GACpB/rB,KACC4vD,EACA/iF,EAAM,cAAe,mBAAmBmzB,KAAKiyD,GAElD,EAlBD,GAmBGjyD,KAAK,OACLA,KACC4C,EAAG,aAAc,gBACd5C,KAAKumC,GAAW,CAAE3jC,KAAI/1B,WACtBmzB,KACC,IACAnzB,EAAM,eAAemzB,KAAK,sCAE9B,MACE,MAAMkyD,EAAerlF,EAAM,UAAUmzB,KAAK,kBACpCmyD,EAAWtlF,EAAM,YAAYmzB,KACjC,8BACA,kCAGF,OADAkyD,EAAalyD,KAAKmyD,GACXvvD,IACJ5C,KAAKkyD,EAAcC,GACnBnyD,KAAK,OACLA,KACC4C,EACE/1B,EAAM,iBAAiBmzB,KACrB,6BACA,gCAEFnzB,EAAM,qBAAsB,mBAAmBmzB,KAC7C,8BACA,kCAEFA,KACA,oBACA,wCACAnzB,EAAM,qBAAqBmzB,KACzB,wCACA,2DACA,2DAGJnzB,EAAM,qBAAqBmzB,KACzB,6BACA,iCACA,4BAGP,EAnCD,IAqCDA,KAAK,QACLA,KACC4vD,EACA/iF,EAAM,WAAWmzB,KACf,gCACA,4CACG8xD,KAGN9xD,KAAK,qBACLA,KAAK4vD,EAAM/iF,EAAM,gBACjBmzB,KAAK4vD,EAAM/iF,EAAM,oBACjBmzB,KAAKzmC,EAAI,IAIH64F,GAAUjB,IACrBhrC,IAA2C,IAA1C,GAAEvjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMzpC,EACnCntD,EACGgnC,KAAK4vD,EAAM,YAAa,aACxB5vD,KACC,aACA,eACA,qBACA,8BAEDA,KAAKumC,GAAW,CAAE3jC,KAAI/1B,WACtBmzB,KAAK,KACLA,KACC4vD,EACA,2BACAhtD,EAAGgtD,EAAM,mBAAmB5vD,KAAK,gCAElCA,KAAK,uBACLA,KAAKzmC,EAAI,ICnIH84F,GAAclB,IACzBvrC,IAA2C,IAA1C,GAAEhjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMhqC,EAKnC5sD,EACGgnC,KACC,4BACA,oCACA,8DAEDA,KACC4C,EACE,0DACA,mDACA,+BAEF/1B,EAAM,oBAAoBmzB,KACxB,qDACA,0EAEFnzB,EAAM,eAAemzB,KACnB,qEACA,0EAGHA,KAAKnzB,EAAM,kBAAmB,oBAAqB+iF,GACnD5vD,KAAKnzB,EAAM,eAAgB+iF,GAC3B5vD,KAAKzmC,EAAI,IAIH+4F,GAAWnB,IACtBtrC,IAA2C,IAA1C,GAAEjjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAM/pC,EACnC,MAAM0sC,EAAoBv5F,EAAMgnC,KAC9B,wCACA,qBAGIwyD,EAAmBx5F,EAAMgnC,KAC7B,gCACA,gBAGI+U,EAAOnS,EAAGgtD,EAAM/iF,EAAM,sBAAsBmzB,KAAKzmC,GAEvDqpC,EACEA,EAAG2vD,EAAmBC,GAAkBxyD,KACtC,QACA,6BAEFwyD,EACGxyD,KACCnzB,EAAM,eAAemzB,KACnB,6BACA,qCAGHA,KACC,+CACA,2BACA4C,EACE,mCACA,0CACA,wDAEC5C,KACC4vD,EACA/iF,EAAM,gBAAiB,qBAAsB,oBAE9CmzB,KAAK+U,KAEZ/U,KACA4C,EACE/1B,EAAM,iBAAiBmzB,KAAK,8BAC5BnzB,EAAM,qBAAsB,mBAAmBmzB,KAC7C,kCAEFA,KAAK+U,GACPloC,EAAM,qBACHmzB,KAAK,2BAA4B,uCACjCA,KAAKzmC,GACT,IAIQk5F,GAAoBtB,IAC/BhrC,IAA2C,IAA1C,GAAEvjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMzpC,EACnCntD,EACGgnC,KACCnzB,EAAM,kBAAkBmzB,KACtB,2CACA,gCACA,2CAEFnzB,EAAM,uBAAuBmzB,KAC3B,wFACA,iDACA,gDAGHA,KAAK4vD,EAAM,cAAe,0BAC1B5vD,KAAK,+DACLA,KAAKzmC,EAAI,IAIHm5F,GAAwBvB,IACnCrjC,IAA2C,IAA1C,GAAElrB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAM9hC,EACnC90D,EACGgnC,KACC,wDACA,iDACA,oDACAnzB,EAAM,iBAAiBmzB,KACrB,mCACA,sCAEFnzB,EAAM,sBAAsBmzB,KAC1B,sEACA,iDACA,kDAGHA,KACC4vD,EACA/iF,EAAM,qBAAqBmzB,KAAK,kCAEjCA,KAAKzmC,EAAI,IAIHo5F,GAAiBxB,IAC5BnjC,IAA2C,IAA1C,GAAEprB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAM5hC,EACnCh1D,EACGgnC,KAAK,0CAA2C,qBAChDA,KACCnzB,EAAM,iBACHmzB,KAAK4vD,EAAM/iF,EAAM,sBACjBmzB,KAAK,uCACRnzB,EAAM,qBAAsB,mBACzBmzB,KAAK4vD,EAAM/iF,EAAM,sBACjBmzB,KAAK,yCACRnzB,EAAM,qBAAqBmzB,KACzB,gCACA,wDAGHA,KAAK4vD,EAAM/iF,EAAM,gBACjBmzB,KAAKzmC,GAERP,EACGgnC,KAAK,8DACLA,KACCnzB,EAAM,iBACHmzB,KAAK4vD,EAAM/iF,EAAM,sBACjBmzB,KAAK,kCACRnzB,EAAM,qBAAsB,mBACzBmzB,KAAK4vD,EAAM/iF,EAAM,sBACjBmzB,KAAK,oCACRnzB,EAAM,qBAAqBmzB,KAAK,gCAEjCA,KACC4vD,EACA/iF,EAAM,eAAemzB,KACnB4vD,EACA,iFAEA,+CAGH5vD,KAAKzmC,EAAI,IAIHq5F,GAAkBzB,IAC7BzrB,IAA2C,IAA1C,GAAE9iC,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMlqB,EACnC1sE,EACGgnC,KACC,iCACA,gBACA,YACA,4BAEDA,KACC,oCACA,6CAEDA,KAAKzmC,EAAI,IC/LH0T,GAAOkkF,IAClBvrC,IAA2C,IAA1C,GAAEhjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMhqC,EACnC,SAAS7xD,EAAC8xD,GAYN,IAZO,KACT8E,EAAI,IACJQ,EAAG,KACHC,EAAI,IACJynC,EAAG,KACH/9C,GAOD+Q,EACC7sD,EACGgnC,KACCnzB,EAAM,aAAamzB,QAAQ2qB,GAC3BQ,EAAMt+C,EAAM,YAAYmzB,QAAQmrB,GAAOimC,EACvChmC,EAAOv+C,EAAM,aAAamzB,QAAQorB,GAAQgmC,GAE3CpxD,KAAK4vD,KAAUiD,GAAO,IACtB7yD,QAAQ8U,GACR9U,KAAKzmC,EACV,CAEAxF,EAAE,CACA42D,KAAM,CAAC,WAAY,aAAc,aACjCQ,IAAK,CAAC,SAAU,aAChBC,KAAM,CAAC,WAAY,SACnBtW,KAAM,CAAC,QAAS,SAAU,QAAS,YAGrC/gD,EAAE,CACA42D,KAAM,CAAC,SAAU,WAAY,UAAW,UAAW,UAAW,WAC9DQ,IAAK,CAAC,YACNrW,KAAM,CAAC,UAAW,QAAS,SAAU,QAAS,UAAW,YAG3D/gD,EAAE,CACA42D,KAAM,CAAC,QAAS,YAAa,OAAQ,WACrCS,KAAM,CAAC,UAAW,UAClBtW,KAAM,CACJ,WACA,QACA,SACA,QACA,WACA,YACA,YAIJ/gD,EAAE,CACA42D,KAAM,CAAC,UAAW,UAAW,WAAY,UACzCQ,IAAK,CAAC,SACNrW,KAAM,CAAC,SAAU,OAAQ,UAAW,UAAW,WAGjD/gD,EAAE,CACA42D,KAAM,CAAC,UAAW,aAClBS,KAAM,CAAC,SACPtW,KAAM,CAAC,SAAU,WAAY,aAAc,aAG7C/gD,EAAE,CACA42D,KAAM,CAAC,aAAc,UAAW,SAChCQ,IAAK,CAAC,YAAa,UACnBrW,KAAM,CAAC,QAAS,SAAU,UAG5B/gD,EAAE,CACA42D,KAAM,CAAC,SAAU,UAAW,YAAa,UACzCQ,IAAK,CAAC,WACNrW,KAAM,CAAC,WAAY,aAGrB/gD,EAAE,CACA42D,KAAM,CAAC,eAAgB,WAAY,UAAW,aAC9CS,KAAM,CAAC,OAAQ,aACftW,KAAM,CAAC,YAAa,OAAQ,UAG9B/gD,EAAE,CACA42D,KAAM,CAAC,SAAU,cAAe,UAAW,YAC3CQ,IAAK,CAAC,WACNC,KAAM,CAAC,QAAS,SAAU,UAC1BynC,IAAK,CAAC,OAAQ,QACd/9C,KAAM,CAAC,SAAU,OAAQ,WAAY,SAAU,YAGjD/gD,EAAE,CACA42D,KAAM,CAAC,cAAe,UACtBQ,IAAK,CAAC,aAAc,SACpBC,KAAM,CAAC,cAAe,YACtBtW,KAAM,CAAC,UAAW,QAAS,MAAO,SAAU,YAG9C/gD,EAAE,CACA42D,KAAM,CACJ,YACA,SACA,cACA,QACA,SACA,OACA,QACA,cAEFQ,IAAK,CAAC,YAAa,WACnB0nC,IAAK,CAAC,SACN/9C,KAAM,CAAC,WAAY,QAAS,WAAY,WAG1C/gD,EAAE,CACA42D,KAAM,CAAC,OAAQ,YAAa,YAC5BQ,IAAK,CAAC,QAAS,UAAW,UAC1B0nC,IAAK,CAAC,UACN/9C,KAAM,CAAC,UAAW,SAAU,YAC5B,ICDN,GApHeq8C,IAAmBvrC,IAA2C,IAA1C,GAAEhjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMhqC,EACrE,MAAMktC,EAAoBlwD,EACxB,2BACA,gEAGImwD,EAAUnwD,EACd,2BACA,wCAGImS,EAAOnS,EACXgtD,EACA,gBACA,uBACA,0BACA5vD,KAAKzmC,GAEPP,EACGgnC,KACCnzB,EAAM,eACHmzB,KAAK4vD,EAAM/iF,EAAM,aACjBmzB,KACC,4BACA,yBACA,yBAEDA,KAAK,OACRnzB,EAAM,YACHmzB,KAAK,4BAA6B,yBAClCA,KAAK,OACR4C,EACEgtD,EACA/iF,EAAM,mBAAmBmzB,KACvB,mCACA,yCAEFnzB,EAAM,aACHmzB,KAAKnzB,EAAM,WAAY,oBACvBmzB,KAAK,0BAA2B,mCAElCA,KACC,2BACA,qBACAnzB,EAAM,aAAamzB,KACjB,2CACA4C,EAAG,gCACA5C,KAAK8yD,GACL9yD,KAAKoxD,GACRvkF,EAAM,YAAYmzB,KAChB,qBACA,6CAGJnzB,EAAM,UACHmzB,KAAK,2BAA4B,mBACjCA,KACC4vD,EACA/iF,EAAM,YAAYmzB,KAChB,wBACA,cACA,oCAIPA,KACC,MACA,gBACA,4BACA4C,EACE/1B,EAAM,eAAemzB,KAAKnzB,EAAM,YAAa+iF,GAC7C/iF,EAAM,aAELmzB,KAAK,oBAAqB,yCAC1BA,KAAK,QAAS+yD,EAAQ/yD,KAAKoxD,MAGnCpxD,KACC8yD,EACAlwD,EACE,8BACA,sBACA,+BACA,sBAEC5C,KAAK+yD,GACL/yD,KAAKoxD,GACRxuD,EAAG,OAAQ,SAAU,yBAClB5C,KACCnzB,EAAM,iBACHmzB,KAAK,MAAO,QACZA,KAAK,mBAAoB,uBAC5BnzB,EAAM,sBACHmzB,KAAK,MAAO,QACZA,KACC,oCACA,iCAEJnzB,EAAM,mBACHmzB,KAAK,MAAO,SACZA,KAAK,oBAAqB,yBAE9BA,KAAK,IAAKnzB,EAAM,eAAemzB,KAAK,8BACpCA,KACC+U,EACAnS,EACE,0BACA,kBACA,uBACA5C,KAAK+yD,EAASD,KAIxBlwD,EAAGmwD,EAASD,GAAmB9yD,KAAKnzB,EAAM,sBAAsBmzB,KAAK+U,EAAK,ICkO5E,GAnVgBo8C,IAAmBvrC,IAA2C,IAA1C,GAAEhjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMhqC,EAEtE5sD,EACGgnC,KACC,kGAEA,wDACA,yEAEDA,KAAKzmC,GAER,MAAMy5F,EAAWh6F,EAAMgnC,KACrB4C,EACE,sCACA,uBACA,8CACA,wBACA,0CACA/1B,EAAM,oBAAoBmzB,KACxB,6BACA,6CAEFnzB,EAAM,mBAAmBmzB,KACvB,6CACA,+CAEFA,KAAK,QACP4vD,GAGIqD,EAAqB,MACzB,MAAMC,EAAkBrmF,EAAM,mBAAmBmzB,KAC/C,oDACA,yEACA,sGAGImzD,EAAmBvwD,EACvB/1B,EAAM,eAAemzB,KAAK4vD,EAAM/iF,EAAM,aACtCA,EAAM,aACNmzB,KACA,4EACA,yDACA,kDACA,8EAIF,OADAkzD,EAAgBlzD,KAAK,SAASA,KAAKmzD,GAC5BvwD,EAAGswD,EAAiBC,GAAkBnzD,KAAK,KAAKA,KAAKzmC,EAC7D,EAnB0B,GAuB3By5F,EACGhzD,KAAKnzB,EAAM,WACXmzB,KAAK4vD,EAAM/iF,EAAM,oBACjBmzB,KAAK4vD,EAAM/iF,EAAM,kBAAmB,qBACpCmzB,KAAK4vD,EAAM/iF,EAAM,kBAAmB,0BACpCmzB,KACC,8GAEA,mJAGA,kNAIAnzB,EAAM,eACHmzB,KAAK4vD,EAAM/iF,EAAM,aACjBmzB,KACC,oMAGA,4LAIJnzB,EAAM,YAAYmzB,KAChB,6LAGA,mNAMHA,KAAKzmC,GAGRy5F,EACGhzD,KACC4C,EAAG,gBAAiB,qCAAqC5C,KACvD,QACA,iBACA,iBAEF4C,EAAG,KAAM,eAAgB,2CAA2C5C,KAClE,aACA,eACA,oBAGHA,KACCnzB,EAAM,mBAAmBmzB,KACvB,6CACA,sDAEFnzB,EAAM,oBAAoBmzB,KACxB,mDACA,sDAEF,8DAEDA,KACC4C,EAAG,KAAK5C,KAAKzmC,GACbqpC,EACE,iBACA,uBACA,8BACA,sBACA,iBACA,kCACA,sCACA5C,KAAKizD,GACPpmF,EAAM,aACHmzB,KACC,gDACA,gCAEDA,KACC4C,EACE,eACA,qBACA,4BACA,oBACA,2BACA,4CACA5C,KAAKizD,GACP15F,GAEJqpC,EACE/1B,EAAM,mBAAmBmzB,KACvB,yEAGFnzB,EAAM,yBAAyBmzB,KAC7B,4FAEA,iEAGDA,KACC4vD,EACAhtD,EACE/1B,EAAM,eAAemzB,KAAK4vD,EAAM/iF,EAAM,aACtCA,EAAM,aACNmzB,KACA,gFAEA,iGAIHA,KAAK4vD,EAAM/iF,EAAM,oBACjBmzB,KAAKzmC,IAGZ,MAAM65F,EAAmBxwD,EACvBowD,EACAh6F,EACGgnC,KACC,gDACA,mBACA,4BACA,aAEDA,KAAK,SAGJqzD,EAAyBzwD,EAC7B,QACA,8BACA,kBACA5C,KAAKizD,GAEDK,EAAW1wD,EACf,sCACA,iDACA/1B,EAAM,eAAemzB,KACnB,iDACA,sEAGDA,KAAKnzB,EAAM,mBAAoB+iF,GAC/B5vD,KAAKzmC,GAEFg6F,EAAgB3wD,EACpB,4CACA/1B,EAAM,eAAemzB,KACnB,0DAGDA,KAAKnzB,EAAM,mBAAoB+iF,GAC/B5vD,KAAKzmC,GAIR65F,EACGpzD,KAAKnzB,EAAM,kBAAmB,oBAAqB+iF,GACnD5vD,KACC4vD,EACA/iF,EAAM,YAAa,UAAUmzB,KAC3B,yCACA,2EAIHA,KACCnzB,EAAM,mBAAmBmzB,KACvB,yEACA,gIAEA,sEAEFnzB,EAAM,yBAAyBmzB,KAC7B,oFAEA,mIAGF4C,EACE/1B,EAAM,iBAAiBmzB,KACrB,+EAEA,gIAEA,sEAEFnzB,EAAM,sBAAsBmzB,KAC1B,mFAEA,mIAGFnzB,EAAM,mBAAmBmzB,KACvB,oGAEA,2HAGFA,KAAK4vD,EAAM0D,EAAStzD,KAAKoxD,IAC3BvkF,EAAM,kBAAmB,yBACtBmzB,KAAKnzB,EAAM,gBAAiB,qBAAsB,oBAClDmzB,KACC,oFAGDA,KAAK4vD,EAAM2D,EAAcvzD,KAAKoxD,KAElCpxD,KACC4C,EACE,wEAEA,oDACA5C,KAAKizD,GACPI,GAKJD,EACGpzD,KAAKnzB,EAAM,aACXmzB,KAAKnzB,EAAM,kBAAmB,oBAAqB+iF,GACnD5vD,KAAKnzB,EAAM,YAAa+iF,GACxB5vD,KACC,yDACA,kGAEAnzB,EAAM,eAAemzB,KACnB,sDAGHA,KACC4C,EAAG,SACA5C,KAAK4vD,EAAM/iF,EAAM,YAAa,WAC9BmzB,KACC4C,EACE/1B,EAAM,iBAAiBmzB,KAAK,uCAC5BnzB,EAAM,sBAAsBmzB,KAC1B,wCACA,iEAEFnzB,EAAM,mBAAmBmzB,KACvB,yCACA,wDAEFA,KAAK4vD,EAAM0D,EAAStzD,KAAKoxD,IAC3BvkF,EAAM,kBAAmB,yBACtBmzB,KACCnzB,EAAM,gBAAiB,qBAAsB,oBAE9CmzB,KACC,gEAEDA,KAAK4vD,EAAM2D,EAAcvzD,KAAKoxD,KAElCpxD,KAAKqzD,EAAwBJ,GAChCrwD,EACE,qCACA,wCACA,4BACA,+BAEC5C,KACCnzB,EAAM,UAAUmzB,KACd,gDACA,4FAEAnzB,EAAM,mBAAmBmzB,KACvB,+CACA,gEACA,0EAGFnzB,EAAM,yBAAyBmzB,KAC7B,4CACA,6DAGJnzB,EAAM,aAAamzB,KACjB,iCACA,yDAGHA,KAAKizD,EAAoB15F,GAC7B,ICnVQi6F,GAAqBrC,IAChCvrC,IAA2C,IAA1C,GAAEhjB,EAAE,MAAE/1B,EAAK,MAAE7T,EAAK,IAAEO,EAAG,IAAE63F,EAAG,KAAExB,GAAMhqC,EACnC5sD,EACGgnC,KAAK,iCAAkC,2BAA4B4vD,GACnE5vD,KACC,4DACA,8DAEDA,KACC,yBACA,wCACA,+CAEDA,KAAKzmC,EAAI,ICGsC,IAqCjDstD,GAAG,SAAHA,GAAG,OAAHA,EAAAA,EAAG,qBAAHA,EAAAA,EAAG,mBAAHA,EAAAA,EAAG,qBAAHA,EAAAA,EAAG,qBAAHA,EAAAA,EAAG,2BAAHA,EAAAA,EAAG,qBAAHA,EAAAA,EAAG,2CAAHA,EAAAA,EAAG,iCAAHA,EAAAA,EAAG,iCAAHA,EAAAA,EAAG,eAAHA,CAAG,EAAHA,IAAG,IAgCR,SAAS4sC,GAAUC,GAAwD,IAAtCC,EAAmBv7F,UAAA7C,OAAA,QAAA0vD,IAAA7sD,UAAA,GAAAA,UAAA,GAAG,MACzD,OAAsB,IAAlBs7F,EAAOn+F,OACF,GAEa,IAAlBm+F,EAAOn+F,OACFm+F,EAAO,GAEV,GAANz2D,OAAUy2D,EAAOl+E,MAAM,GAAI,GAAGxb,KAAK,MAAK,KAAAijC,OAAI02D,EAAW,KAAA12D,OAAIy2D,EAAOA,EAAOn+F,OAAS,GACpF,CAEA,MAAMq+F,GAAO,CACX,MACA,MACA,QACA,OACA,OACA,MACA,QACA,QACA,OACA,MACA,SACA,SACA,WACA,WACA,UACA,UACA,YACA,WACA,YAEIC,GAAO,CACX,SACA,SACA,QACA,QACA,QACA,UACA,SACA,UAGF,SAASC,GAAY/qF,GACnB,GAAIA,EAAI,KAAOA,EAAI,EACjB,OAAOA,EAAEhP,WAEX,GAAU,IAANgP,EACF,MAAO,OAET,MAAMi3D,EAAmB,GAazB,OAZIj3D,GAAK,MACPi3D,EAAOjqE,KAAK,GAADknC,OAAI62D,GAAYpvF,KAAKrN,MAAM0R,EAAI,MAAK,aAC/CA,GAAK,KAEHA,GAAK,KACPi3D,EAAOjqE,KAAK89F,GAAKnvF,KAAKrN,MAAM0R,EAAI,IAAM,IACtCA,GAAK,IAEHA,EAAI,IACNi3D,EAAOjqE,KAAK69F,GAAK7qF,EAAI,IACrBA,EAAI,GAECi3D,EAAOhmE,KAAK,IACrB,CAEA,SAAS+5F,GAAkBxzB,GACzB,MAAMj8D,EAAI,CACR,CAAEw9C,MAAOye,EAAOgG,WAAWzK,SAAUjnE,KAAM,mBAC3C,CAAEitD,MAAOye,EAAOgG,WAAW1K,IAAKhnE,KAAM,OACtC,CAAEitD,MAAOye,EAAOgG,WAAWytB,MAAOn/F,KAAM,mBACxCyxD,QAAOV,IAAA,IAAC,MAAE9D,GAAO8D,EAAA,OAAK9D,EAAQ,CAAC,IACjC,MAAO,CACLmyC,aAAcR,GACZnvF,EAAEu9C,KAAIgE,IAAA,IAAC,MAAE/D,EAAK,KAAEjtD,GAAMgxD,EAAA,SAAA5oB,OAAQ62D,GAAYhyC,GAAM,KAAA7kB,OAAIpoC,EAAI,KAE1Dq/F,sBAAuBT,GAAUnvF,EAAEu9C,KAAIsE,IAAA,IAAC,KAAEtxD,GAAMsxD,EAAA,OAAKtxD,CAAI,KAE7D,CAEO,MAAMs/F,GAGXv/F,WAAAA,CAAY2rE,GAAwB,IAAD6zB,EAAA,KAF1BvnF,WAAK,OACLwnF,UAAI,EAEX,MAAMC,EAtGV,SAAqB/zB,GACnB,IAAInV,EAAO,EACP4c,EAAQ,EACZ,IAAK,MAAM7H,KAAQI,EAAOS,MACpBb,EAAK4L,QAAU3O,GAAKS,KACtBzS,IACS+U,EAAK4L,QAAU3O,GAAKU,OAC7BkK,IAGJ,OAAI5c,EAAOmV,EAAOS,MAAMzrE,OAAS,GACxB6nE,GAAKS,KAEVmK,EAAQzH,EAAOS,MAAMzrE,OAAS,GACzB6nE,GAAKU,MAEP,IACT,CAqFsBy2B,CAAYh0B,IAExB,WAAEyT,EAAU,eAAEC,GAAmBF,GAAgBxT,GAEjDqR,EAAQrR,EAAOS,MAAMG,MAAMvoD,IAAOA,EAAE0wC,KAAK/zD,SAEzCi/F,EAAKj0B,EAAOS,MAAMG,MACrBvoD,IAAC,IAAAg1D,EAAA,MAAyB,QAAV,QAAVA,EAAAh1D,EAAEmrD,gBAAQ,IAAA6J,OAAA,EAAVA,EAAY90D,IAAY,IAE3B27E,EAAY7iB,IAAU4iB,EACtBE,IAAWF,IAAOC,EAClBtC,IAAe,OAAFqC,QAAE,IAAFA,IAAAA,EAAIzwB,SAASsH,MAE1BspB,EACoB,YAAV,QAAdP,EAAAxiB,EAAM7N,gBAAQ,IAAAqwB,OAAA,EAAdA,EAAgBt7E,KACX84D,EAAM7N,SAASoQ,YAChB,EAEAygB,EAAYr0B,EAAOS,MAAMva,QAC7B,CAAC9gD,EAAGw6D,KAAI,IAAA+T,EAAA,MAA6B,cAAV,QAAbA,EAAA/T,EAAK4D,gBAAQ,IAAAmQ,OAAA,EAAbA,EAAep7D,KAAqBnT,EAAI,EAAIA,CAAC,GAC3D,GAGFtN,KAAKwU,MAAQ,CACXgoF,iBAAkBP,IAAcl3B,GAAKU,MACrCg3B,gBAAiBR,IAAcl3B,GAAKS,KACpCk3B,cAA8B,IAAf/gB,EACfghB,mBAAoBhhB,EAAa,GAAwB,IAAnBC,EACtCghB,gBAAiBhhB,EAAiB,EAClCihB,kBACE30B,EAAOgG,WAAWzK,SAAW,GAC7ByE,EAAOgG,WAAW1K,IAAM,GACxB0E,EAAOgG,WAAWytB,MAAQ,EAC5BjoC,YAAawU,EAAO36B,QAAQmmB,YAC5BG,SAAUqU,EAAO36B,QAAQsmB,SACzBgnC,gBAAiBthB,EAAMvL,WACvBouB,YACAC,SACAvC,WACAgD,gBAA4B,IAAXR,EACjBS,sBAAuBT,EAAS,EAChCU,gBAA+B,IAAdT,EACjBU,iBAAkBV,EAAY,EAC9BW,UAAoC,SAAzBh1B,EAAO36B,QAAQ2lB,MAC1BiqC,SAAmC,QAAzBj1B,EAAO36B,QAAQ2lB,MACzBkqC,UAAoC,SAAzBl1B,EAAO36B,QAAQ2lB,OAG5B,MAAMmqC,EAAUz1B,GAAa,CAC3BM,EAAO36B,QAAQmmB,aACb,CACEpB,KAAM,gBACNQ,IAAK,eACLC,KAAM,iBACNmV,EAAO36B,QAAQ2lB,OACnBgV,EAAO36B,QAAQsmB,UAAY,gBAC1BlyD,KAAK,SAER3B,KAAKg8F,KAAO,CACVqB,UACAC,gBAAiB7B,GAAY9f,GAC7B4hB,oBAAqB9B,GAAY7f,MAC9B8f,GAAkBxzB,GAEzB,CAEAs1B,SAAAA,CAAUvqC,GACR,MAAO,CACLz2D,KAAMoY,GAAKqjF,SAAShlC,EAAK1D,KAAKf,GAAIhyD,MAAOwD,KAAKwU,MAAOxU,KAAKg8F,MAC1DyB,QAASC,GAAQzF,SAAShlC,EAAK1D,KAAKf,GAAIivC,SAAUz9F,KAAKwU,MAAOxU,KAAKg8F,MACnE2B,OAAQC,GAAO3F,SAAShlC,EAAK1D,KAAKf,GAAImvC,QAAS39F,KAAKwU,MAAOxU,KAAKg8F,MAChE6B,QAASnE,GAAQzB,SACfhlC,EAAK1D,KAAKf,GAAIqvC,SACd,IAAK79F,KAAKwU,MAAOmlF,SAAS,GAC1B35F,KAAKg8F,MAEP8B,QAAS/D,GAAQ9B,SAAShlC,EAAK1D,KAAKf,GAAIsvC,SAAU99F,KAAKwU,MAAOxU,KAAKg8F,MAEvE,CAEA3c,UAAAA,CAAWpsB,GACT,OAAO+mC,GAAY/B,SACjBhlC,EAAK1D,KAAKf,GAAI6wB,YACdr/E,KAAKwU,MACLxU,KAAKg8F,KAET,CAEAvnB,OAAAA,CAAQxhB,GACN,OAAOgnC,GAAShC,SAAShlC,EAAK1D,KAAKf,GAAIimB,SAAUz0E,KAAKwU,MAAOxU,KAAKg8F,KACpE,CAEA/e,eAAAA,CAAgB9pB,EAAyB4qC,GACvC,OAAO3D,GAAkBnC,SACvB9kC,EACA,IACKnzD,KAAKwU,MACRwpF,eAAgBD,GAAoB,EACpCE,oBAAqBF,EAAmB,GAE1C,IACK/9F,KAAKg8F,KACR+B,iBAAkBA,EAAiBpjF,WAGzC,CAEAgiE,kBAAAA,CAAmB1pB,GACjB,OAAOonC,GAAsBpC,SAC3BhlC,EAAK1D,KAAKf,GAAImuB,oBACd38E,KAAKwU,MACLxU,KAAKg8F,KAET,CAEA7d,aAAAA,CAAclrB,GACZ,OAAOqnC,GAAerC,SACpBhlC,EAAK1D,KAAKf,GAAI2vB,eACdn+E,KAAKwU,MACLxU,KAAKg8F,KAET,CAEApd,qBAAAA,CAAsB3rB,GACpB,OAAOsnC,GAAgBtC,SACrBhlC,EAAK1D,KAAKf,GAAI0vC,eACdl+F,KAAKwU,MACLxU,KAAKg8F,KAET,CAEA3iB,yBAAAA,CAA0BlmB,GACxB,OAAOgoC,GAAmBlD,SAAS9kC,EAAKnzD,KAAKwU,MAAOxU,KAAKg8F,KAC3D,ECjSF,MAAMmC,GAAoB,CACxB,UACA,UACA,kBACA,iBACA,kBACA,iBACA,kBACA,WACA,WACA,eACA,KACA,eACA,oBACA,iBACA,mBACA,YACA,SACA,UACA,YACA,WACA,QACA,aACA,WACA,UACA,eACA,WACA,WACA,cACA,eACA,mBACA,iBACA,kBACA,aACA,YACA,WACA,YACA,mBClCF,MAAMC,GAAqB,CAAC,kBAAmB,YAAa,OAmB5D,SAASC,GAAS7iC,EAAejO,EAAmB1hB,GAA4B,IAA5C1gC,EAAIC,GAAUmiD,EAChD,OAAOiO,EACJhS,KAAIgE,IAAa,IAAXpxD,EAAGsO,GAAE8iD,EACV,MAAM8wC,GAAMliG,EAAI+O,GAAIwP,UACd4jF,GAAM7zF,EAAIU,GAAIuP,UACpB,MAAgB,OAATkxB,EAAa,GAAAjH,OAAM05D,EAAE,KAAA15D,OAAI25D,EAAE,QAAA35D,OAAS25D,EAAE,KAAA35D,OAAI05D,EAAE,IAAG,IAEvD38F,MACL,CAEA,SAAS0uF,GACPnoB,EACAs2B,EACA97B,GAEA,MAAMiF,EAAmB,GACzB,IAAK,IAAIj9D,EAAIw9D,EAAOplC,IAAKp4B,EAAIw9D,EAAOmG,OAASmwB,EAAW9zF,IAAK,CAC3D,MAAM+zF,EAAgB,GACtB,IAAK,IAAIriG,EAAI8rE,EAAOtlC,KAAMxmC,EAAI8rE,EAAO3rD,MAAQiiF,EAAWpiG,IACtDqiG,EAAI/gG,KAAK,GAADknC,OAAI89B,EAAGtmE,EAAGsO,GAAE,MAEtBi9D,EAAOjqE,KAAK+gG,EAAI98F,KAAK,IACvB,CACA,OAAOgmE,EAAOhmE,KAAK,KACrB,CAEO,SAAS+8F,GACdC,EACAv8F,GAEA,MAAM9E,EAAM,IAAIq2B,IAShB,OARAgrE,EAAQ/7E,SAAQ,CAACuC,EAAG/oB,EAAGsO,KACrB,MAAMZ,EAAMqb,EAAErb,IACVxM,EAAI8I,IAAI0D,GACVxM,EAAI9B,IAAIsO,GAAMpM,KAAK,CAACtB,EAAGsO,IAEvBpN,EAAIxB,IAAIgO,EAAK,CAAC,CAAC1N,EAAGsO,IACpB,IAEK/C,MAAM4zD,KAAKj+D,EAAI0D,WACnBgzD,MAAK,CAAAlG,EAAA2H,KAAA,IAAExpD,GAAE6hD,GAAG5hD,GAAEupD,EAAA,OAAKx6C,SAAS/O,GAAK+O,SAAShP,EAAE,IAC5Cu9C,KAAImM,IAAA,IAAE7rD,EAAK0xD,GAAO7F,EAAA,SAAA/wB,OAAQ96B,EAAG,KAAA86B,OAAIy5D,GAAS7iC,EAAQp5D,EAAQ,MAAK,IAC/DT,KAAK,KACV,CCzEO,MAAMi9F,GAAch5D,IXqDZ,SAAgBsiC,GAC7B,IAAKA,EAAO36B,QAAQqmB,YAClB,MAAO,IAAKsU,EAAQ+e,OAAQ,KAAM3D,YAAa,MAGjD,MAAMub,EAAkB38E,IAAiB,IAAAy7D,EAAA,OACoB,QADpBA,EACvCzV,EAAOqK,eAAe/2E,IAAI6Q,KAAKrN,MAAMkjB,EAAE9lB,GAAIiQ,KAAKrN,MAAMkjB,EAAExX,WAAG,IAAAizE,OAAA,EAA3DA,EAA6DnL,WAAW,EAEpEvF,EAAY/E,EAAO+E,UAAUhf,OAAO4wC,GACpC3xB,EAAWhF,EAAOgF,SAASjf,OAAO4wC,GAExC,IAAIC,GAAiB,EACjBC,GAAkB,EAClBC,GAAoB,EAEpBtkB,EAAM,EACNlX,EAAM,EACNC,EAAW,EAEf,MAAM6f,EAAc,IAAInV,GAExBlB,EAAUrqD,SAAS1W,IACjB4yF,IAAAA,EAAmB5yF,EAAE43D,WAAaM,IAClC26B,IAAAA,EAAoB7yF,EAAE43D,WAAaS,IACnCy6B,IAAAA,EAAsB9yF,EAAE43D,WAAaU,IAErCf,GAAYv3D,EAAE43D,SAASL,QAAQ,IAEjCyJ,EAAStqD,SAAS7lB,IAEhB0mE,GAAY1mE,EAAE+mE,SAASL,QAAQ,IAIjCiX,GAAO,EAAIgc,GACXlzB,GAAO,EAIPC,GAAYc,GAAcd,SAAWe,GAAgBf,SAAW,EAG3Dq7B,IACHpkB,GAAOgc,GACPlzB,GAAO,EAAIY,GAAaZ,KAErBu7B,IACHrkB,GAAOgc,GACPlzB,GAAO,EAAIe,GAAcf,KAEtBw7B,IACHtkB,GAAOgc,GACPlzB,GAAO,EAAIgB,GAAgBhB,KAG7BC,EAAWp3D,KAAKw1B,IAAI4hC,GAAW,GAE/B,MAAMiqB,EAzER,SAAmBxlB,GACjB,MAAMud,EAAW,IACZvd,EAAO+E,UAAUhf,QAAQ/hD,GAAMA,EAAE43D,WAAaK,QAC9C+D,EAAO+E,aACP/E,EAAOqU,UACPrU,EAAOgF,UAEZ,IAAK,MAAMhrD,KAAKujE,EAAU,CAAC,IAADhI,EACxB,MAAMxhE,EAAM,CAAC5P,KAAKrN,MAAMkjB,EAAE9lB,GAAIiQ,KAAKrN,MAAMkjB,EAAExX,IAC3C,GAAqC,QAArC+yE,EAAIvV,EAAOqK,eAAe/2E,OAAOygB,UAAI,IAAAwhE,GAAjCA,EAAmCjL,YACrC,OAAOv2D,CAEX,CACA,MAAM,IAAI9b,MAAM,uDAClB,CA2DiB8+F,CAAU/2B,GAEzB,SAASg3B,EAAY3xF,GACnB,OAAIA,IAAMw3D,GAAKW,KACNgxB,GAELnpF,IAAMw3D,GAAKY,WACN+wB,GAELnpF,IAAMw3D,GAAK8B,cAAgBt5D,IAAMw3D,GAAKgC,SACjC2vB,QADT,CAIF,CAEA,CACE,MAAMlJ,EAAW,IAAIrf,GACrBqf,EAAS1xF,OAAO4xF,EAAQ,GAExB,MAAMyR,EAAqB,CAACzR,GACtB0R,EAAsB,GACtBC,EAAyB,GAE/B,SAASC,EAAQljG,EAAWsO,EAAWqL,GACrC,QAA2B62C,IAAvB4gC,EAAShyF,IAAIY,EAAGsO,GAAkB,CACpC8iF,EAAS1xF,IAAIM,EAAGsO,EAAGqL,GACnB,MAAMxI,EAAI26D,EAAOK,MAAM/sE,IAAIY,EAAGsO,GAC1B6C,IAAMA,EAAE63D,UACL73D,EAAE83D,OAEI65B,EAAY3xF,GACrB6xF,EAAW1hG,KAAK,CAACtB,EAAGsO,IACX6C,IAAMw3D,GAAKc,WACpBw5B,EAAc3hG,KAAK,CAACtB,EAAGsO,IAJvBy0F,EAAUzhG,KAAK,CAACtB,EAAGsO,IAOzB,CACF,CAEA,KAAO84D,EAAM,GAAKC,EAAW,GAC3B,GAAI07B,EAAUjiG,OAAQ,CACpB,MAAOd,EAAGsO,GAAKy0F,EAAUnqE,QACzBsuD,EAAYxnF,IAAIM,EAAGsO,GAAG,GACtB,MAAMqL,EAAIy3E,EAAShyF,IAAIY,EAAGsO,GAE1BgqD,EAAK9xC,SAAQ2qC,IAAA,IAAEpiD,EAAIC,GAAGmiD,EAAA,OAAK+xC,EAAQljG,EAAI+O,EAAIT,EAAIU,EAAI2K,EAAI,EAAE,GAC3D,KAAO,KAAIqpF,EAAWliG,SAAUmiG,EAAcniG,OAoC5C,OADAs7C,QAAQ1mB,IAAI,sDACL,IAAKo2C,EAAQ+e,OAAQ,CApLf,SAoL6C3D,eApCN,CACpD,MAAMic,GAAeH,EAAWliG,QACzBd,EAAGsO,IAAM60F,EAAcF,EAAgBD,GAAYpqE,QAC1DsuD,EAAYxnF,IAAIM,EAAGsO,GAAG,GACtB,MAAMqL,EAAIy3E,EAAShyF,IAAIY,EAAGsO,GACpB6C,EAAI26D,EAAOK,MAAM/sE,IAAIY,EAAGsO,GAS9B,GALEgwE,GAHE6kB,EAGKxpF,GAAK2gF,GAAcA,IAA0BA,GAG7CwI,EAAY3xF,GAEjBi2D,EAAM,EAAG,CAAC,IAADyf,EACX,MAAM1d,EAAWh4D,EAAEg4D,UAAgC,QAAxB0d,EAAI/a,EAAO1E,IAAIhoE,IAAIY,EAAGsO,UAAE,IAAAu4E,EAAAA,EAAI,GACvDzf,GAAO+B,EACPmV,GACEnV,EAAWxvD,GAAK2gF,GAAcA,IAC9BA,EACJ,CACA,GAAIjzB,EAAW,EAAG,CAAC,IAADsf,EAChB,MAAM9d,EACJ13D,EAAE03D,cAAyC,QAA7B8d,EAAI7a,EAAOzE,SAASjoE,IAAIY,EAAGsO,UAAE,IAAAq4E,EAAAA,EAAI,GACjDtf,GAAYwB,EACZyV,GAAOzV,EAAelvD,GAAK2gF,GAAcA,GAC3C,CAKAyI,EAAUzhG,KAAK,CAACtB,EAAGsO,GACrB,CAKA,CAEJ,CAEA,MAAM6uE,EAAQrR,EAAOS,MAAMG,MAAMhB,IAAUA,EAAK7W,KAAK/zD,SAEjDgrE,EAAO36B,QAAQmmB,cACjBgnB,GAASgc,GAAsBnd,EAAMloB,iBAAoB,IAAOqpB,EAAM,IAIxEA,GAAOxS,EAAO36B,QAAQ4kB,gBACtBuoB,EAAMruE,KAAK+C,IAnMY,IAmMU/C,KAAKE,KAAKmuE,EAAM+b,IAAYA,IAG7D,MAAM+I,EAASnzF,KAAK+C,IAClBsrE,EAtMgB,IAwMhBruE,KAAKE,KAAkC,GAA5B27D,EAAO36B,QAAQomB,WAAmB8iC,IAAYA,IAG3D,MAAO,IAAKvuB,EAAQ+e,OAAQ,CAACvM,EAAK8kB,GAASlc,cAC7C,IWtNG37C,MCCY,SAAgBugC,GAC7B,MAAMgG,EAAahG,EAAOS,MACvBva,QAAO,CAAC9gD,EAAmCw6D,KAC1C,MAAMpF,EAAKoF,EAAK0D,UAAU0C,WAI1B,OAHK5gE,EAAEm7D,MAAM/sE,GAAM2K,OAAOknB,GAAGm1C,EAAIhnE,MAC/B4R,EAAE5P,KAAKglE,GAEFp1D,CAAC,GACP,IACFk8C,KAAKkZ,GAAOA,EAAG,CAAEwF,aACjB9Z,QACC,CAAC9gD,EAAyCzD,KAAG,IAAA41F,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAAC,EAAA,MAAM,CACjDt8B,SAAUp3D,KAAK+C,IAAc,QAAXqwF,EAACnyF,EAAEm2D,gBAAQ,IAAAg8B,EAAAA,EAAI,EAAgB,QAAfC,EAAK,OAAH71F,QAAG,IAAHA,OAAG,EAAHA,EAAK45D,gBAAQ,IAAAi8B,EAAAA,EAAI,GACrDl8B,IAAKn3D,KAAK+C,IAAS,QAANuwF,EAACryF,EAAEk2D,WAAG,IAAAm8B,EAAAA,EAAI,EAAW,QAAVC,EAAK,OAAH/1F,QAAG,IAAHA,OAAG,EAAHA,EAAK25D,WAAG,IAAAo8B,EAAAA,EAAI,GACtCjE,MAAOtvF,KAAK+C,IAAW,QAARywF,EAACvyF,EAAEquF,aAAK,IAAAkE,EAAAA,EAAI,EAAa,QAAZC,EAAK,OAAHj2F,QAAG,IAAHA,OAAG,EAAHA,EAAK8xF,aAAK,IAAAmE,EAAAA,EAAI,GAC5CvrB,UAAW,IAAIjnE,EAAEinE,aAA6B,QAAlBwrB,EAAO,OAAHl2F,QAAG,IAAHA,OAAG,EAAHA,EAAK0qE,iBAAS,IAAAwrB,EAAAA,EAAI,IAClDprB,cAAernE,EAAEqnE,YAAiB,OAAH9qE,QAAG,IAAHA,GAAAA,EAAK8qE,YACrC,GACD,CACElR,SAAU,EACVD,IAAK,EACLm4B,MAAO,EACPpnB,UAAW,GACXI,YAAY,IAYlB,OARKzG,EAAWyG,aACdzG,EAAWzK,SAAWp3D,KAAK+C,IACzB8+D,EAAWzK,SAGP,EAFJp3D,KAAKrN,MACFguE,GAAiB9E,GAAUA,EAAO36B,QAAQ6kB,iBAAoB,KAI9D,IAAK8V,EAAQgG,aACtB,IDpCGvmC,MF6DY,SAAkBugC,GAC/B,MAAM83B,EAAe93B,EAAO36B,QAAQwmB,UAAU72D,OAExCopF,EAAW,MACf,MAAM7xE,EAAOyzD,EAAO36B,QAAQ94B,KAAK/S,SAAS,IAAIq/E,SAAS,EAAG,KAC1D,MAAO,CACL,KACAtsE,EAAK4H,UAAU,EAAG,GAClB5H,EAAK4H,UAAU,EAAG,GAClB,CACE5H,EAAK4H,UAAU,GACf,CAAEi2C,KAAM,IAAKQ,IAAK,IAAKC,KAAM,KAAMmV,EAAO36B,QAAQ2lB,OAClD8sC,EAAe,IAAM,IACrBr+F,KAAK,KACPA,KAAK,IACR,EAZgB,GAcX4tD,EAAO,IAAIusC,GAAK5zB,IAChB,KAAE1rE,EAAI,QAAEihG,EAAO,OAAEE,EAAM,QAAEE,EAAO,QAAEC,GAAYvuC,EAAKiuC,UACvDt1B,EAAOjV,MAEHozB,EAAY2Z,EAAY,GAAAp7D,OACvBpoC,EAAKoiC,KAAI,MAAAgG,OArClB,SAAwB2I,GACtB,MAAMr+B,EAAI,IAAIq+B,EAAQwmB,WACnBC,OACAxK,KAAKn8C,GAAC,GAAAu3B,OAAQv3B,EAAC,KAAAu3B,OAAIghB,KAAKC,UAAUtY,EAAQlgC,OAC1C1L,KAAK,KAER,IAAI5E,EAAI,EACR,IAAK,IAAIC,EAAI,EAAGA,EAAIkS,EAAEhS,OAAQF,IAC5BD,GAAKA,GAAK,GAAKA,EAAImS,EAAE+wF,WAAWjjG,GAChCD,GAAK,EAGP,OADAA,EAAIsP,KAAKC,IAAIvP,GAAKohG,GAAkBjhG,OAC7BihG,GAAkBphG,EAC3B,CAwBuBmjG,CAAeh4B,EAAO36B,SAAQ,KAC/C/wC,EAAKoiC,KACH2nD,EAAW,CACfC,MAAM,GAAD5hD,OAAK64D,EAAQ7+D,KAAI,QAAAgG,OAAO+4D,EAAO/+D,MACpCi/D,QAASA,EAAQj/D,KACjBk/D,QAASA,EAAQl/D,MAEnB,MAAO,IAAKspC,EAAQoe,WAAU/2B,OAAM82B,YAAWE,WACjD,IE1FG5+C,MEFY,SAAiBugC,GAE9B,MASMi4B,EAAcv4B,GATDjgE,MAAM4zD,KACvB2M,EAAOS,MAAMva,QAAO,CAAC9gD,EAAsCw6D,KACzD,MAAMpF,EAAKoF,EAAK0D,UAAUnb,cAI1B,OAHK/iD,EAAEm7D,MAAM/sE,GAAM2K,OAAOknB,GAAGm1C,EAAIhnE,MAC/B4R,EAAE5P,KAAKglE,GAEFp1D,CAAC,GACP,KAEuCk8C,KAAKkZ,GAAOA,EAAG,CAAEwF,cACvDk4B,EAAcx4B,GAClBM,EAAOS,MAAMnf,KAAKse,GAASA,EAAK0D,UAAUhc,OAAO,CAAE0Y,SAAQJ,YAEvDu4B,EAAWn4B,EAAO36B,QAAQmmB,YAC5BkU,GACEM,EAAOS,MAAMnf,KAAKse,GAChBA,EAAK0D,UAAU/b,mBAAmB,CAAEyY,SAAQJ,YAGhD,GACEw4B,EAAQp4B,EAAO36B,QAAQsmB,SACzB+T,GACEM,EAAOS,MAAMnf,KAAKse,GAChBA,EAAK0D,UAAU9b,gBAAgB,CAAEwY,SAAQJ,YAG7C,GACE7hC,EAAK,CAAC,QAAS,IACfupB,EAAS,CACb,4BACI2wC,EAAYjjG,OAASijG,EAAcl6D,EACvC,6BACIm6D,EAAYljG,OAASkjG,EAAcn6D,EACvC,2BACIo6D,EAASnjG,OAASmjG,EAAWp6D,EACjC,uBACIq6D,EAAMpjG,OAASojG,EAAQr6D,GAC3BtkC,KAAK,MAEP,MAAO,IAAKumE,EAAQ1Y,SACtB,IFvCG7nB,MDmFY,SAAmBugC,GAChC,MAAM9lE,EAAgB,EAAE8lE,EAAOtlC,MAAOslC,EAAOplC,KAEvCy9D,EAAU,cAAA37D,QA7EFvnC,EAOhB,SAAkB6qE,GAChB,MAAM,kCAANtjC,OAAyC47D,SAA6B,6DAAA57D,OAE5DghB,KAAKC,UAAUqiB,EAAO36B,QAAS,KAAM,GACjD,CAmESkzD,CAASv4B,GA9EU6J,EA8ED,KA7ElB10E,EACJslB,MAAM,SACN6mC,KAAKw/B,GAAI,GAAApkD,OAAQmtC,GAAMntC,OAAGokD,KAC1BrnF,KAAK,OA0EsB,yBAAAijC,QAGpBsjC,EAAO3rD,MAAQ2rD,EAAOtlC,MAAMjoB,UAAS,eAAAiqB,QACrCsjC,EAAOmG,OAASnG,EAAOplC,KAAKnoB,UAAS,gBAAAiqB,OACrCu9B,GAAkB+F,EAAOqiB,eAAgBnoF,EAAQ8lE,EAAOjsC,OAAQ,EAAG,UAAS,YAAA2I,OAChFsjC,EAAO36B,QAAQ2lB,MAAK,mCAAAtuB,OAEhBsjC,EAAOme,UAAS,gBAAAzhD,OAChBy5D,GACRn2B,EAAO+L,cAAczqB,KAAI,CAACkf,EAAGtsE,EAAGsO,IAAM,CAACtO,EAAGsO,KAC1CtI,EACA,MACD,MAAAwiC,OACDsjC,EAAO+e,OAAM,UAAAriD,OAAasjC,EAAO+e,OAAOtlF,KAAK,MAAS,GAAE,+CAAAijC,OAMjD,uBAAyB,iBAAAA,OAIhCyrD,GAAKnoB,EAAQ,GAAG,CAAC9rE,EAAGsO,KAAO,IAADq+D,EAAA0U,EAC1B,MAAMvR,EAA6B,QAAzBnD,EAAGb,EAAOK,MAAM/sE,IAAIY,EAAGsO,UAAE,IAAAq+D,EAAAA,EAAIhE,GAAKgB,WACtC3jE,EACH8pE,EAAK7G,QAA0C,QAAhCoY,EAACvV,EAAOqK,eAAe/2E,IAAIY,EAAGsO,UAAE,IAAA+yE,GAA/BA,EAAiCjL,YAAoB,EAAN,IAClE,OAAQtG,EAAKr2C,GAAKzzB,GAAQuY,SAAS,IACnC,kBAAAiqB,OAGAyrD,GAAKnoB,EAAQ,GAAG,CAAC9rE,EAAGsO,IAAMw9D,EAAOjsC,OAAOzgC,IAAIY,EAAGsO,GAAIiQ,YAAU,gCAAAiqB,OAI7DyrD,GAAKnoB,EAAQ,GAAG,CAAC9rE,EAAGsO,KAAC,IAAAq4E,EAAA,OAA+B,QAA1BA,EAAC7a,EAAOzE,SAASjoE,IAAIY,EAAGsO,UAAE,IAAAq4E,EAAAA,EAAI,GAAGpoE,SAAS,IAAC,YAAAiqB,OAErEyrD,GAAKnoB,EAAQ,GAAG,CAAC9rE,EAAGsO,KAAC,IAAAu4E,EAAA,OAA0B,QAArBA,EAAC/a,EAAO1E,IAAIhoE,IAAIY,EAAGsO,UAAE,IAAAu4E,EAAAA,EAAI,GAAGtoE,SAAS,IAAC,sBAAAiqB,OI9H3D,SAA4B2oB,GAKX,IALY,SAClCkW,EAAQ,IACRD,EAAG,MACHm4B,EAAK,UACLpnB,GACWhnB,EACX,MAAMoa,EAAS4M,EAAU/qB,KACvBgE,IAAA,IAAC,UAAEgnB,EAAS,YAAEE,GAAalnB,EAAA,kBAAA5oB,OAAiB4vC,EAAS,KAAA5vC,OAAI8vC,EAAW,IAOtE,OALIjR,GAAYD,GAAOm4B,IACrBh0B,EAAOjqE,KAAK,cAADknC,OACK6+B,EAAS9oD,UAAS,KAAAiqB,OAAI4+B,EAAI7oD,UAAS,KAAAiqB,OAAI+2D,EAAMhhF,YAGxDgtD,EAAOhmE,KAAK,KACrB,CJkHE++F,CAAoBx4B,EAAOgG,YAAW,qBAAAtpC,OAGtCsjC,EAAO+E,UAAUzjB,KAAKt9C,G7FqFjB,SACL02D,EACAxgE,EACAggE,GAEA,MAAO,CACLQ,EAASkB,SAASjuC,GAClBssC,GAAkBS,EAAUxgE,EAAQggE,EAAW/1D,KAAKwkD,GAAK,EAAG,YAC5D+R,EAASoB,MAAQ,GAAC,SAAAp/B,OAAag+B,EAASoB,MAAMrpD,WAC9CioD,EAASqB,aAAe,iBACxBrB,EAASsB,iBAAmB,iBAE3BjW,QAAQv9C,GAAMA,IACd/O,KAAK,IACV,C6FnG8Bg/F,CAAkBz0F,EAAG9J,EAAQ8lE,EAAOjsC,UAASt6B,KAAK,MAAK,8BAAAijC,OAGnF85D,GAAiBx2B,EAAOqC,WAAYnoE,GAAO,sBAAAwiC,OAG3C85D,GAAiBx2B,EAAO6F,QAAS3rE,GAAO,qBAAAwiC,OAGxCsjC,EAAOyB,UAAUngB,KAAKh8C,G3FlFjB,SACL6oE,EACAj0E,EACAggE,GAEA,MAAM,GAANx9B,OAAUyxC,EAASvS,SAASjuC,GAAE,MAAA+O,OAC9Bu9B,GAAkBkU,EAAUj0E,EAAQggE,EAAW,EAAG,UAAS,SAAAx9B,OACxDyxC,EAASxgD,GAAGlb,WAASiqB,OAAGyxC,EAAS7O,MAAQ,cAAgB,GAC9D,C2F0E8Bo5B,CAAkBpzF,EAAGpL,EAAQ8lE,EAAOjsC,UAASt6B,KAAK,MAAK,kBAAAijC,OAGnFsjC,EAAOqU,OAAO/yB,KAAKn+C,GnB3Gd,SACL0yE,EACA37E,EACAggE,GAEA,MAAO,CAAC,MAADx9B,OACCm5C,EAAMloD,GAAGlb,WAASiqB,OAAGm5C,EAAMsG,OAAM,IAAAz/C,OAAOm5C,EAAMsG,QAAW,IAC/DliB,GAAkB4b,EAAO37E,EAAQggE,EAAW,EAAG,UAC/C,IAAI2b,EAAMD,WAAY,IAAIn2E,MAAMo2E,EAAM/Z,MAAQ,GAAGrF,KAAK,UACnDnV,KAAKtkC,GAAC,GAAA0f,OAAQ1f,EAAC,OACfvjB,KAAK,IACRo8E,EAAMxC,WAAa,kBAElBttB,QAAQv9C,GAAMA,IACd/O,KAAK,IACV,CmB4F2Bk/F,CAAex1F,EAAGjJ,EAAQ8lE,EAAOjsC,UAASt6B,KAAK,MAAK,oBAAAijC,OAG7EsjC,EAAOgF,SAAS1jB,KAAKzsD,GvE4BhB,SACL0nF,EACAriF,EACAggE,GAEA,MAAO,CACLqiB,EAAQ3gB,SAASjuC,GACjBssC,GAAkBsiB,EAASriF,EAAQggE,EAAW,EAAG,UACjDqiB,EAAQ3J,SAAStxB,KAAK/4C,GAAC,GAAAm0B,OAAQn0B,EAAC,OAAK9O,KAAK,IACrB,OAArB8iF,EAAQjJ,UAAiB,UAAA52C,OAAc6/C,EAAQjJ,SAAS7gE,WACxD8pE,EAAQlJ,WAAa,iBAAiB,MAAD32C,OAC/B6/C,EAAQ5uD,GAAGlb,YAEhBszC,QAAQv9C,GAAMA,IACd/O,KAAK,IACV,CuE3C6Bm/F,CAAiB/jG,EAAGqF,EAAQ8lE,EAAOjsC,UAASt6B,KAAK,MAAK,oBAAAijC,OAGjFsjC,EAAOqe,SAASC,MAAK,2BAAA5hD,OAGrBsjC,EAAOqe,SAASsX,QAAO,2BAAAj5D,OAGvBsjC,EAAOqe,SAASuX,QAAO,8BAAAl5D,OAOvBsjC,EAAO1Y,OAAM,SAzJf,IAAgBnyD,EAAY00E,EA+J1B,OAjGF,SAA8BwuB,GAC5BA,EAAW59E,MAAM,MAAMC,SAAQ,CAAComE,EAAMhsF,KACpCohG,GAAmBx7E,SAASm+E,IAC1B,GAAI/X,EAAK3jE,SAAS07E,GAChB,MAAM,IAAI5gG,MAAM,2BAADykC,OACcghB,KAAKC,UAAUk7C,GAAW,aAAAn8D,OAAY5nC,EAAC,OAAA4nC,OAAMokD,GAE5E,GACA,GAEN,CAsFEgY,CAAqBT,GACd,IAAKr4B,EAAQq4B,aACtB,IK9KaU,GAAYnT,GAAWpB,MAAMyE,IACvCzE,MAAM8G,IACN9G,MAAMiJ,IACNjJ,MAAMkS,ICRT,IAAgB,eAAiB,+BAA+B,QAAU,wBAAwB,KAAO,qBAAqB,MAAQ,sBAAsB,QAAU,wBAAwB,MAAQ,sBAAsB,QAAU,yBCGvN,SAASsC,GAAW3zC,GAKiC,IALhC,SAClC+4B,EAAQ,UACRD,EAAS,SACTE,EAAQ,OACR/2B,GAC+DjC,EAC/D,MAAM4zC,EAAsB,OAAN3xC,QAAM,IAANA,OAAM,EAANA,EAClB7sC,MAAM,MACP6mC,KAAKt6C,GACJA,EAAE6N,MACA,qEAGN,OAAMwpE,GAAY/2B,GAIhByG,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAOirC,eAAel5E,UACpC6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAO5G,KAAKrnC,SAAA,EAC1B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAKm+D,KACLpwB,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,cACJ+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,kBACJ+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAY,OAARq+D,QAAQ,IAARA,OAAQ,EAARA,EAAUC,SACdvwB,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aACJ+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAY,OAARq+D,QAAQ,IAARA,OAAQ,EAARA,EAAUsX,WACd5nC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aACJ+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAY,OAARq+D,QAAQ,IAARA,OAAQ,EAARA,EAAUuX,UACbqD,IAAiBlrC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,oBACR,OAAbi5E,QAAa,IAAbA,OAAa,EAAbA,EAAe33C,KAAKn+C,IACnB,IAAKA,EACH,OAAO,KAET,MAAM,KAAE7O,EAAI,MAAEX,GAAUwP,EAAE69E,OAC1B,OACEnzB,EAAAA,EAAAA,MAAC/M,EAAAA,SAAQ,CAAA9gC,SAAA,EACP+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAK1rB,KACLy5D,EAAAA,EAAAA,KAAA,KAAA/tC,SAAIrsB,MAFSW,EAGJ,SAvBZ,IA6BX,CC5CA,MA+BA,GA/Bc6kG,KACZprC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAOirC,eAAel5E,UACpC6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAOmrC,MAAMp5E,SAAA,EAC3B6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,cAAYs4E,aAChBvqC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAG,iDACH6tC,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CAAG,MACG,KACJ+tC,EAAAA,EAAAA,KAAA,KACE70B,KAAK,8CACL1gC,OAAO,SACP6gG,IAAI,aAAYr5E,SACjB,kBAEI,IAAI,MACL,KACJ+tC,EAAAA,EAAAA,KAAA,KACE70B,KAAK,qDACL1gC,OAAO,SACP6gG,IAAI,aAAYr5E,SACjB,kBAEI,IAAI,iBAGX+tC,EAAAA,EAAAA,KAAA,KAAA/tC,SAAG,wHC1BT,IAAgB,IAAM,iBAAiB,SAAW,sBAAsB,UAAY,uBAAuB,cAAgB,2BAA2B,UAAY,uBAAuB,KAAO,kBAAkB,aAAa,wBAAwB,QAAU,qBAAqB,SAAW,sBAAsB,SAAW,sBAAsB,YAAc,yBAAyB,SAAW,sBAAsB,SAAW,sBAAsB,OAAS,oBAAoB,SAAW,sBAAsB,aAAe,0BAA0B,OAAS,qBCG3iBs5E,GAAe,yDAEN,SAASC,GAAYl0C,GAMhC,IANiC,MACnC1tC,EAAK,QACL0tB,GAIDggB,EACC,MAAOm0C,EAAMC,IAAWjqD,EAAAA,EAAAA,WAAS,IAC1BkqD,EAAWC,IAAgBnqD,EAAAA,EAAAA,WAAS,GAC3C,IAAKgqD,EACH,OAAO,KAET,MAAMI,EAAY,CAAC,UAADl9D,OACN/kB,EAAMu4B,SAAO,sBAAAxT,OACD47D,UAA6B,SAAA57D,OACnC,OAAP2I,QAAO,IAAPA,OAAO,EAAPA,EAAS94B,KAAK/S,SAAS,IAAIq/E,SAAS,EAAG,KAAKrnE,eAAa,cAAAkrB,QAC7C,OAAP2I,QAAO,IAAPA,OAAO,EAAPA,EAASwmB,UAAUpyD,KAAK,QAAS,UAAQ,UAAAijC,OAC7C/kB,EAAM8E,OAAK,YAAAigB,OACTghB,KAAKC,UAAUtY,KAC3B5rC,KAAK,MACDogG,EAAO,GAAAn9D,OAAM48D,GAAY,UAAA58D,OAAStjB,mBAAmB,oCAADsjB,OAAqCk9D,KAC/F,OACE7rC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAOirC,eAAel5E,UACpC6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAOt2C,MAAMqI,SAAA,EAC3B+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,8BACJ+tC,EAAAA,EAAAA,KAAA,KAAGC,UAAWC,GAAO/d,QAAQlwB,SAAErI,EAAMu4B,WACrC2d,EAAAA,EAAAA,MAAA,KAAA7tC,SAAA,CAAG,iDAC8C,KAC/C+tC,EAAAA,EAAAA,KAAA,KAAG70B,KAAM2gE,EAASrhG,OAAO,SAAS6gG,IAAI,aAAYr5E,SAAC,iBAE/C,QAGN6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,EACE6tC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,sBAAoBs4E,aACxBzqC,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,SACY,OAAPqlB,QAAO,IAAPA,OAAO,EAAPA,EAAS94B,KAAK/S,SAAS,IAAIq/E,SAAS,EAAG,KAAKrnE,kBAErDq8C,EAAAA,EAAAA,MAAA,MAAA7tC,SAAA,CAAI,eAAmB,OAAPqlB,QAAO,IAAPA,OAAO,EAAPA,EAASwmB,UAAUpyD,KAAK,QAAS,aACjDs0D,EAAAA,EAAAA,KAAA,MAAA/tC,UACE+tC,EAAAA,EAAAA,KAAA,KAAG70B,KAAM2gE,EAASrhG,OAAO,SAAS6gG,IAAI,aAAYr5E,SAAC,wDAIrD+tC,EAAAA,EAAAA,KAAA,MAAA/tC,UACE6tC,EAAAA,EAAAA,MAAA,UACE3Y,QAASA,IACPmO,UAAUy2C,UACPC,UAAUH,GACVn6D,MAAK,IAAMk6D,GAAa,KAC5B35E,SAAA,CACF,kBAEE05E,GAAa,qBAGlB3rC,EAAAA,EAAAA,KAAA,MAAA/tC,UACE+tC,EAAAA,EAAAA,KAAA,UAAQ7Y,QAASA,IAAMukD,GAAQ,GAAOz5E,SAAC,0BAG1CrI,EAAM8E,QACLoxC,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,WACJ+tC,EAAAA,EAAAA,KAAA,KAAGC,UAAWC,GAAOxxC,MAAMuD,SAAErI,EAAM8E,WAGtC4oB,IACCwoB,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACE+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,aACJ+tC,EAAAA,EAAAA,KAAA,KAAGC,UAAWC,GAAO5oB,QAAQrlB,SAAE09B,KAAKC,UAAUtY,YAM1D,CC7DA,MAAM20D,GAIA,CACJ,CAAEh9D,GAAI,WAAY6/C,MAAO,WAAYod,QAAU30F,IAAM,GACrD,CAAE03B,GAAI,QAAS6/C,MAAO,QAASod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAG+6D,QACpD,CAAErjC,GAAI,WAAY6/C,MAAO,WAAYod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGi2D,WAC1D,CAAEv+B,GAAI,MAAO6/C,MAAO,MAAOod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGg2D,MAChD,CAAEt+B,GAAI,WAAY6/C,MAAO,WAAYod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGy/D,YAC1D,CAAE/nC,GAAI,YAAa6/C,MAAO,YAAaod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAG+kE,iBAC5D,CAAErtC,GAAI,SAAU6/C,MAAO,SAAUod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGyuB,SACtD,CAAEiJ,GAAI,aAAc6/C,MAAO,aAAcod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAG+8D,aAC9D,CAAErlC,GAAI,UAAW6/C,MAAO,UAAWod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGugE,UACxD,CAAE7oC,GAAI,SAAU6/C,MAAO,SAAUod,QAAU30F,QAAoBo/C,KAAb,OAADp/C,QAAC,IAADA,OAAC,EAADA,EAAGy5E,SACpD,CAAE/hD,GAAI,OAAQ6/C,MAAO,OAAQod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAG+hD,OAClD,CAAErqB,GAAI,SAAU6/C,MAAO,SAAUod,QAAU30F,KAAS,OAADA,QAAC,IAADA,IAAAA,EAAGgiD,SACtD,CAAEtqB,GAAI,QAAS6/C,MAAO,QAASod,QAAU30F,IAAM,IA4LjD,SA7KA,WAAgB,IAAD40F,EAAAC,EAAAC,EAAAC,EAAAh1C,EAAAi1C,EACb,MAAOhuF,EAAO2sE,IAAiB3pC,EAAAA,EAAAA,aAC7B,CAAC8pC,EAAY9sC,KACX,GAAI,YAAaA,EAAQ,CACvB,MAAM0zB,EAAS,CACb36B,QAASiH,EAAOjH,QAChB0lB,KAAM,IAAIxE,EAAQja,EAAOjH,QAAQ94B,OAE7BnH,EAAI2zF,GAAUxU,MAAMvkB,GAC1B,MAAO,CACLA,OAAQ56D,EAAEq6D,OACVnrE,KAAM8Q,EAAE9Q,KACRgB,KAAM8P,EAAE9P,WAAQovD,EAEpB,CAAO,MAAI,UAAWpY,EACb,CAAE0zB,OAAQoZ,EAAIpZ,UAAW1zB,GAE3BA,CAAM,GAEf,CAAC,IAGIiuD,EAAcC,IAAmBhrD,EAAAA,EAAAA,WAAS,IAC1CirC,EAAYggB,IAAiBjrD,EAAAA,EAAAA,UAAqB,aAClDuzC,EAAc2X,IAAmBlrD,EAAAA,EAAAA,WAAS,IAC1CwzC,EAAY2X,IAAiBnrD,EAAAA,EAAAA,WAAS,GAEvCwb,EAAa,OAAL1+C,QAAK,IAALA,GAAa,QAAR4tF,EAAL5tF,EAAO0zD,cAAM,IAAAk6B,OAAR,EAALA,EAAe70D,QAAQ2lB,MAU/B+D,GAAOhgB,EAAAA,EAAAA,cAAY,KACvB,IACE,MAAM3pC,EAAIkH,EAAMhX,OAChB2jF,EAAc,CACZjZ,OAAQ56D,EAAEq6D,OACVnrE,KAAM8Q,EAAE9Q,KACRgwF,SAAUl/E,EAAEk/E,SACZhvF,KAAM8P,EAAE9P,WAAQovD,GAEpB,CAAE,MAAO/sC,GACP24B,QAAQ34B,MAAMA,GACVA,aAAiB1f,OACnBghF,EAAc,CAAEthE,SAEpB,IACC,CAACrL,IAEEsuF,GAAQ7rD,EAAAA,EAAAA,cAAY,KACxByrD,GAAgB,GACZluF,EAAM0zD,QACRiZ,EAAc,CAAE5zC,QAAS/4B,EAAM0zD,OAAO36B,SACxC,GACC,CAAC/4B,KAEJ2iC,EAAAA,EAAAA,YAAU,KACJ3iC,EAAMhX,MAAQilG,GAChBxrC,GACF,GACC,CAACwrC,EAAcjuF,EAAOyiD,KAEzB9f,EAAAA,EAAAA,YAAU,KACP73B,OAAe4oD,OAAS1zD,EAAM0zD,MAAM,GACpC,CAAC1zD,IAEJ,MAAMuuF,EACHN,KAA6B,QAAbJ,EAAC7tF,EAAM0zD,cAAM,IAAAm6B,GAAZA,EAAc9B,aAA8B,UAAf5d,EAEjD,OACE5sB,EAAAA,EAAAA,MAAA,OAAKG,UAAS,GAAAtxB,OAAKuxB,GAAO6sC,IAAG,KAAAp+D,OAAIuxB,GAAO,GAADvxB,OAAIsuB,EAAK,WAAWhrC,SAAA,EACzD+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAO8sC,cAAc/6E,UACnC+tC,EAAAA,EAAAA,KAACgrB,GAAkB,CAACE,cAAeA,OAErCprB,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAO+sC,UAAUh7E,SAAA,EAC/B+tC,EAAAA,EAAAA,KAAA,OACEC,UAAW0R,GAAa,CACtBzR,GAAOk6B,KACP0S,GAAa5sC,GAAOgtC,QACpB3uF,EAAMqL,OAASs2C,GAAOitC,WACrBzhG,KAAK,OAET6S,EAAM0zD,SACLjS,EAAAA,EAAAA,KAACu0B,GAAa,CACZtiB,OAAQ1zD,EAAM0zD,OACdya,WAAYA,EACZsI,aAAcA,EACdC,WAAYA,IAGfuX,QAAmC71C,IAAnBp4C,EAAMg4E,WACrBv2B,EAAAA,EAAAA,KAAA,OACEC,UAAS,GAAAtxB,OAAKuxB,GAAOktC,YAAW,KAAAz+D,OAAIpwB,EAAMg4E,SAAW,EAAI,GAAKr2B,GAAOmtC,UACrEl3E,MACE,CACE,aAAa,GAADwY,QAAuB,IAAjBpwB,EAAMg4E,UAAgB7xE,UAAS,QAKzC,UAAfgoE,IAA0B1sB,EAAAA,EAAAA,KAACorC,GAAK,IACjB,SAAf1e,IAAyB1sB,EAAAA,EAAAA,KAACirC,GAAW,IAAK1sF,EAAM0zD,SAChD1zD,EAAMqL,QACLo2C,EAAAA,EAAAA,KAACwrC,GAAY,CAAC5hF,MAAOrL,EAAMqL,MAAO0tB,QAAqB,QAAd+0D,EAAE9tF,EAAM0zD,cAAM,IAAAo6B,OAAA,EAAZA,EAAc/0D,WAEzDk1D,GAAgBjuF,EAAMhY,OACtBy5D,EAAAA,EAAAA,KAAA,OAAKC,UAAWC,GAAOotC,SAASr7E,SAAE1T,EAAMhY,QAE1Cu5D,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAOqtC,SAASt7E,SAAA,CAC7B1T,EAAMhX,MACLu4D,EAAAA,EAAAA,MAAAC,EAAAA,SAAA,CAAA9tC,SAAA,EACIu6E,IAAgBxsC,EAAAA,EAAAA,KAAA,UAAQ7Y,QAAS6Z,EAAK/uC,SAAC,UACzC+tC,EAAAA,EAAAA,KAAA,UAAQ7Y,QAxFpB,WAEIslD,GADED,EAKN,EAkFuCv6E,SACxBu6E,EAAe,QAAU,mBAI9BxsC,EAAAA,EAAAA,KAAA,UAAQ7Y,QAAS0lD,EAAM56E,SAAC,gBAEb,QAAZq6E,EAAA/tF,EAAM0zD,cAAM,IAAAq6B,GAAZA,EAAchC,YACbtqC,EAAAA,EAAAA,KAAA,KACEC,UAAWC,GAAOh9B,OAClBiI,MA3IWqiE,EA2IWjvF,EAAM0zD,OAAOq4B,WA1IzC,iCAAN37D,OAAwCtjB,mBAAmBmiF,KA2I/CC,SAAQ,GAAA9+D,OAAoD,QAApD2oB,EAA0B,QAA1Bi1C,EAAKhuF,EAAM0zD,OAAOoe,gBAAQ,IAAAkc,EAAAA,EAAIhuF,EAAM0zD,OAAOme,iBAAS,IAAA94B,EAAAA,EAAI,YAAW,QAAOrlC,SACnF,cAID+tC,EAAAA,EAAAA,KAAA,OAAKC,UAAS,GAAAtxB,OAAKuxB,GAAOh9B,OAAM,KAAAyL,OAAIuxB,GAAOpuC,UAAWG,SAAC,oBAM7D6tC,EAAAA,EAAAA,MAAA,OAAKG,UAAWC,GAAOwtC,aAAaz7E,SAAA,EAClC+tC,EAAAA,EAAAA,KAAA,MAAA/tC,SAAI,UACJ+tC,EAAAA,EAAAA,KAAA,UACEC,UAAW+0B,EAAe90B,GAAOK,OAASL,GAAOM,SACjDrZ,QAASA,IAAMwlD,GAAiB7lG,IAAOA,IAAGmrB,SAC3C,cAGD+tC,EAAAA,EAAAA,KAAA,UACEC,UAAWg1B,EAAa/0B,GAAOK,OAASL,GAAOM,SAC/CrZ,QAASA,IAAMylD,GAAe9lG,IAAOA,IAAGmrB,SACzC,WAGAg6E,GAAoB14C,KAAIgE,IAAA,IAAC,GAAEtoB,EAAE,MAAE6/C,EAAK,QAAEod,GAAS30C,EAAA,OAC9CyI,EAAAA,EAAAA,KAAA,UAEEC,UACEysB,IAAez9C,EACXixB,GAAOK,OACP2rC,EAAQ3tF,EAAM0zD,QACZ/R,GAAOM,SACPN,GAAOpuC,SAEfq1B,QAASA,IAAMulD,GAAe5lG,GAAOA,IAAMmoC,EAAK,WAAaA,IAAKhd,SAEjE68D,GAVI7/C,EAWE,UAlLnB,IAAyBu+D,CAuLzB,EC1NaG,EAAAA,WAAoB5iF,SAAS6iF,eAAe,SACpDt+E,QACH0wC,EAAAA,EAAAA,KAAC0qB,EAAAA,WAAgB,CAAAz4D,UACf+tC,EAAAA,EAAAA,KAAC+sC,GAAG","sources":["../node_modules/@stdlib/array-base-accessor-getter/lib/index.js","../node_modules/@stdlib/array-base-accessor-getter/lib/main.js","../node_modules/@stdlib/array-base-accessor-setter/lib/index.js","../node_modules/@stdlib/array-base-accessor-setter/lib/main.js","../node_modules/@stdlib/array-base-arraylike2object/lib/index.js","../node_modules/@stdlib/array-base-arraylike2object/lib/main.js","../node_modules/@stdlib/array-base-assert-is-accessor-array/lib/index.js","../node_modules/@stdlib/array-base-assert-is-accessor-array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex128array/lib/index.js","../node_modules/@stdlib/array-base-assert-is-complex128array/lib/main.js","../node_modules/@stdlib/array-base-assert-is-complex64array/lib/index.js","../node_modules/@stdlib/array-base-assert-is-complex64array/lib/main.js","../node_modules/@stdlib/array-base-getter/lib/index.js","../node_modules/@stdlib/array-base-getter/lib/main.js","../node_modules/@stdlib/array-base-setter/lib/index.js","../node_modules/@stdlib/array-base-setter/lib/main.js","../node_modules/@stdlib/array-complex128/lib/from_array.js","../node_modules/@stdlib/array-complex128/lib/from_iterator.js","../node_modules/@stdlib/array-complex128/lib/from_iterator_map.js","../node_modules/@stdlib/array-complex128/lib/index.js","../node_modules/@stdlib/array-complex128/lib/main.js","../node_modules/@stdlib/array-complex64/lib/from_array.js","../node_modules/@stdlib/array-complex64/lib/from_iterator.js","../node_modules/@stdlib/array-complex64/lib/from_iterator_map.js","../node_modules/@stdlib/array-complex64/lib/index.js","../node_modules/@stdlib/array-complex64/lib/main.js","../node_modules/@stdlib/array-dtype/lib/ctor2dtype.js","../node_modules/@stdlib/array-dtype/lib/ctors.js","../node_modules/@stdlib/array-dtype/lib/dtypes.js","../node_modules/@stdlib/array-dtype/lib/index.js","../node_modules/@stdlib/array-dtype/lib/main.js","../node_modules/@stdlib/array-float32/lib/index.js","../node_modules/@stdlib/array-float32/lib/main.js","../node_modules/@stdlib/array-float32/lib/polyfill.js","../node_modules/@stdlib/array-float64/lib/index.js","../node_modules/@stdlib/array-float64/lib/main.js","../node_modules/@stdlib/array-float64/lib/polyfill.js","../node_modules/@stdlib/array-int16/lib/index.js","../node_modules/@stdlib/array-int16/lib/main.js","../node_modules/@stdlib/array-int16/lib/polyfill.js","../node_modules/@stdlib/array-int32/lib/index.js","../node_modules/@stdlib/array-int32/lib/main.js","../node_modules/@stdlib/array-int32/lib/polyfill.js","../node_modules/@stdlib/array-int8/lib/index.js","../node_modules/@stdlib/array-int8/lib/main.js","../node_modules/@stdlib/array-int8/lib/polyfill.js","../node_modules/@stdlib/array-to-json/lib/ctors.js","../node_modules/@stdlib/array-to-json/lib/index.js","../node_modules/@stdlib/array-to-json/lib/main.js","../node_modules/@stdlib/array-to-json/lib/type.js","../node_modules/@stdlib/array-uint16/lib/index.js","../node_modules/@stdlib/array-uint16/lib/main.js","../node_modules/@stdlib/array-uint16/lib/polyfill.js","../node_modules/@stdlib/array-uint32/lib/index.js","../node_modules/@stdlib/array-uint32/lib/main.js","../node_modules/@stdlib/array-uint32/lib/polyfill.js","../node_modules/@stdlib/array-uint8/lib/index.js","../node_modules/@stdlib/array-uint8/lib/main.js","../node_modules/@stdlib/array-uint8/lib/polyfill.js","../node_modules/@stdlib/array-uint8c/lib/index.js","../node_modules/@stdlib/array-uint8c/lib/main.js","../node_modules/@stdlib/array-uint8c/lib/polyfill.js","../node_modules/@stdlib/assert-has-float32array-support/lib/float32array.js","../node_modules/@stdlib/assert-has-float32array-support/lib/index.js","../node_modules/@stdlib/assert-has-float32array-support/lib/main.js","../node_modules/@stdlib/assert-has-float64array-support/lib/float64array.js","../node_modules/@stdlib/assert-has-float64array-support/lib/index.js","../node_modules/@stdlib/assert-has-float64array-support/lib/main.js","../node_modules/@stdlib/assert-has-function-name-support/lib/foo.js","../node_modules/@stdlib/assert-has-function-name-support/lib/index.js","../node_modules/@stdlib/assert-has-function-name-support/lib/main.js","../node_modules/@stdlib/assert-has-int16array-support/lib/index.js","../node_modules/@stdlib/assert-has-int16array-support/lib/int16array.js","../node_modules/@stdlib/assert-has-int16array-support/lib/main.js","../node_modules/@stdlib/assert-has-int32array-support/lib/index.js","../node_modules/@stdlib/assert-has-int32array-support/lib/int32array.js","../node_modules/@stdlib/assert-has-int32array-support/lib/main.js","../node_modules/@stdlib/assert-has-int8array-support/lib/index.js","../node_modules/@stdlib/assert-has-int8array-support/lib/int8array.js","../node_modules/@stdlib/assert-has-int8array-support/lib/main.js","../node_modules/@stdlib/assert-has-iterator-symbol-support/lib/index.js","../node_modules/@stdlib/assert-has-iterator-symbol-support/lib/main.js","../node_modules/@stdlib/assert-has-own-property/lib/index.js","../node_modules/@stdlib/assert-has-own-property/lib/main.js","../node_modules/@stdlib/assert-has-symbol-support/lib/index.js","../node_modules/@stdlib/assert-has-symbol-support/lib/main.js","../node_modules/@stdlib/assert-has-tostringtag-support/lib/index.js","../node_modules/@stdlib/assert-has-tostringtag-support/lib/main.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/index.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/main.js","../node_modules/@stdlib/assert-has-uint16array-support/lib/uint16array.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/index.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/main.js","../node_modules/@stdlib/assert-has-uint32array-support/lib/uint32array.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/index.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/main.js","../node_modules/@stdlib/assert-has-uint8array-support/lib/uint8array.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/index.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/main.js","../node_modules/@stdlib/assert-has-uint8clampedarray-support/lib/uint8clampedarray.js","../node_modules/@stdlib/assert-instance-of/lib/index.js","../node_modules/@stdlib/assert-instance-of/lib/main.js","../node_modules/@stdlib/assert-is-arguments/lib/detect.js","../node_modules/@stdlib/assert-is-arguments/lib/index.js","../node_modules/@stdlib/assert-is-arguments/lib/main.js","../node_modules/@stdlib/assert-is-arguments/lib/polyfill.js","../node_modules/@stdlib/assert-is-array-like-object/lib/index.js","../node_modules/@stdlib/assert-is-array-like-object/lib/main.js","../node_modules/@stdlib/assert-is-array/lib/index.js","../node_modules/@stdlib/assert-is-array/lib/main.js","../node_modules/@stdlib/assert-is-arraybuffer/lib/index.js","../node_modules/@stdlib/assert-is-arraybuffer/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/index.js","../node_modules/@stdlib/assert-is-boolean/lib/main.js","../node_modules/@stdlib/assert-is-boolean/lib/object.js","../node_modules/@stdlib/assert-is-boolean/lib/primitive.js","../node_modules/@stdlib/assert-is-boolean/lib/tostring.js","../node_modules/@stdlib/assert-is-boolean/lib/try2serialize.js","../node_modules/@stdlib/assert-is-buffer/lib/index.js","../node_modules/@stdlib/assert-is-buffer/lib/main.js","../node_modules/@stdlib/assert-is-collection/lib/index.js","../node_modules/@stdlib/assert-is-collection/lib/main.js","../node_modules/@stdlib/assert-is-complex-like/lib/index.js","../node_modules/@stdlib/assert-is-complex-like/lib/main.js","../node_modules/@stdlib/assert-is-complex-typed-array/lib/ctors.js","../node_modules/@stdlib/assert-is-complex-typed-array/lib/index.js","../node_modules/@stdlib/assert-is-complex-typed-array/lib/main.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/has_string_enumerability_bug.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/index.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/main.js","../node_modules/@stdlib/assert-is-enumerable-property/lib/native.js","../node_modules/@stdlib/assert-is-float32array/lib/index.js","../node_modules/@stdlib/assert-is-float32array/lib/main.js","../node_modules/@stdlib/assert-is-float64array/lib/index.js","../node_modules/@stdlib/assert-is-float64array/lib/main.js","../node_modules/@stdlib/assert-is-function/lib/index.js","../node_modules/@stdlib/assert-is-function/lib/main.js","../node_modules/@stdlib/assert-is-int16array/lib/index.js","../node_modules/@stdlib/assert-is-int16array/lib/main.js","../node_modules/@stdlib/assert-is-int32array/lib/index.js","../node_modules/@stdlib/assert-is-int32array/lib/main.js","../node_modules/@stdlib/assert-is-int8array/lib/index.js","../node_modules/@stdlib/assert-is-int8array/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/index.js","../node_modules/@stdlib/assert-is-integer/lib/integer.js","../node_modules/@stdlib/assert-is-integer/lib/main.js","../node_modules/@stdlib/assert-is-integer/lib/object.js","../node_modules/@stdlib/assert-is-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-little-endian/lib/ctors.js","../node_modules/@stdlib/assert-is-little-endian/lib/index.js","../node_modules/@stdlib/assert-is-little-endian/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/index.js","../node_modules/@stdlib/assert-is-nan/lib/main.js","../node_modules/@stdlib/assert-is-nan/lib/object.js","../node_modules/@stdlib/assert-is-nan/lib/primitive.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/index.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/main.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/object.js","../node_modules/@stdlib/assert-is-nonnegative-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-number/lib/index.js","../node_modules/@stdlib/assert-is-number/lib/main.js","../node_modules/@stdlib/assert-is-number/lib/object.js","../node_modules/@stdlib/assert-is-number/lib/primitive.js","../node_modules/@stdlib/assert-is-number/lib/tostring.js","../node_modules/@stdlib/assert-is-number/lib/try2serialize.js","../node_modules/@stdlib/assert-is-object-like/lib/index.js","../node_modules/@stdlib/assert-is-object-like/lib/main.js","../node_modules/@stdlib/assert-is-object/lib/index.js","../node_modules/@stdlib/assert-is-object/lib/main.js","../node_modules/@stdlib/assert-is-plain-object/lib/index.js","../node_modules/@stdlib/assert-is-plain-object/lib/main.js","../node_modules/@stdlib/assert-is-positive-integer/lib/index.js","../node_modules/@stdlib/assert-is-positive-integer/lib/main.js","../node_modules/@stdlib/assert-is-positive-integer/lib/object.js","../node_modules/@stdlib/assert-is-positive-integer/lib/primitive.js","../node_modules/@stdlib/assert-is-positive-number/lib/index.js","../node_modules/@stdlib/assert-is-positive-number/lib/main.js","../node_modules/@stdlib/assert-is-positive-number/lib/object.js","../node_modules/@stdlib/assert-is-positive-number/lib/primitive.js","../node_modules/@stdlib/assert-is-string/lib/index.js","../node_modules/@stdlib/assert-is-string/lib/main.js","../node_modules/@stdlib/assert-is-string/lib/object.js","../node_modules/@stdlib/assert-is-string/lib/primitive.js","../node_modules/@stdlib/assert-is-string/lib/try2valueof.js","../node_modules/@stdlib/assert-is-string/lib/valueof.js","../node_modules/@stdlib/assert-is-typed-array/lib/ctors.js","../node_modules/@stdlib/assert-is-typed-array/lib/index.js","../node_modules/@stdlib/assert-is-typed-array/lib/main.js","../node_modules/@stdlib/assert-is-uint16array/lib/index.js","../node_modules/@stdlib/assert-is-uint16array/lib/main.js","../node_modules/@stdlib/assert-is-uint32array/lib/index.js","../node_modules/@stdlib/assert-is-uint32array/lib/main.js","../node_modules/@stdlib/assert-is-uint8array/lib/index.js","../node_modules/@stdlib/assert-is-uint8array/lib/main.js","../node_modules/@stdlib/assert-is-uint8clampedarray/lib/index.js","../node_modules/@stdlib/assert-is-uint8clampedarray/lib/main.js","../node_modules/@stdlib/assert-tools-array-function/lib/index.js","../node_modules/@stdlib/assert-tools-array-function/lib/main.js","../node_modules/@stdlib/blas-base-gcopy/lib/accessors.js","../node_modules/@stdlib/blas-base-gcopy/lib/index.js","../node_modules/@stdlib/blas-base-gcopy/lib/main.js","../node_modules/@stdlib/blas-base-gcopy/lib/ndarray.js","../node_modules/@stdlib/boolean-ctor/lib/index.js","../node_modules/@stdlib/boolean-ctor/lib/main.js","../node_modules/@stdlib/complex-float32/lib/index.js","../node_modules/@stdlib/complex-float32/lib/main.js","../node_modules/@stdlib/complex-float32/lib/tojson.js","../node_modules/@stdlib/complex-float32/lib/tostring.js","../node_modules/@stdlib/complex-float64/lib/index.js","../node_modules/@stdlib/complex-float64/lib/main.js","../node_modules/@stdlib/complex-float64/lib/tojson.js","../node_modules/@stdlib/complex-float64/lib/tostring.js","../node_modules/@stdlib/complex-imag/lib/index.js","../node_modules/@stdlib/complex-imag/lib/main.js","../node_modules/@stdlib/complex-imagf/lib/index.js","../node_modules/@stdlib/complex-imagf/lib/main.js","../node_modules/@stdlib/complex-real/lib/index.js","../node_modules/@stdlib/complex-real/lib/main.js","../node_modules/@stdlib/complex-realf/lib/index.js","../node_modules/@stdlib/complex-realf/lib/main.js","../node_modules/@stdlib/constants-array-max-array-length/lib/index.js","../node_modules/@stdlib/constants-array-max-typed-array-length/lib/index.js","../node_modules/@stdlib/constants-float64-exponent-bias/lib/index.js","../node_modules/@stdlib/constants-float64-high-word-abs-mask/lib/index.js","../node_modules/@stdlib/constants-float64-high-word-exponent-mask/lib/index.js","../node_modules/@stdlib/constants-float64-high-word-sign-mask/lib/index.js","../node_modules/@stdlib/constants-float64-high-word-significand-mask/lib/index.js","../node_modules/@stdlib/constants-float64-ln-two/lib/index.js","../node_modules/@stdlib/constants-float64-max-base2-exponent-subnormal/lib/index.js","../node_modules/@stdlib/constants-float64-max-base2-exponent/lib/index.js","../node_modules/@stdlib/constants-float64-max-safe-integer/lib/index.js","../node_modules/@stdlib/constants-float64-min-base2-exponent-subnormal/lib/index.js","../node_modules/@stdlib/constants-float64-ninf/lib/index.js","../node_modules/@stdlib/constants-float64-pinf/lib/index.js","../node_modules/@stdlib/constants-float64-smallest-normal/lib/index.js","../node_modules/@stdlib/constants-int16-max/lib/index.js","../node_modules/@stdlib/constants-int16-min/lib/index.js","../node_modules/@stdlib/constants-int32-max/lib/index.js","../node_modules/@stdlib/constants-int32-min/lib/index.js","../node_modules/@stdlib/constants-int8-max/lib/index.js","../node_modules/@stdlib/constants-int8-min/lib/index.js","../node_modules/@stdlib/constants-uint16-max/lib/index.js","../node_modules/@stdlib/constants-uint32-max/lib/index.js","../node_modules/@stdlib/constants-uint8-max/lib/index.js","../node_modules/@stdlib/math-base-assert-is-even/lib/index.js","../node_modules/@stdlib/math-base-assert-is-even/lib/main.js","../node_modules/@stdlib/math-base-assert-is-infinite/lib/index.js","../node_modules/@stdlib/math-base-assert-is-infinite/lib/main.js","../node_modules/@stdlib/math-base-assert-is-integer/lib/index.js","../node_modules/@stdlib/math-base-assert-is-integer/lib/main.js","../node_modules/@stdlib/math-base-assert-is-nan/lib/index.js","../node_modules/@stdlib/math-base-assert-is-nan/lib/main.js","../node_modules/@stdlib/math-base-assert-is-odd/lib/index.js","../node_modules/@stdlib/math-base-assert-is-odd/lib/main.js","../node_modules/@stdlib/math-base-assert-is-positive-zero/lib/index.js","../node_modules/@stdlib/math-base-assert-is-positive-zero/lib/main.js","../node_modules/@stdlib/math-base-ops-umul/lib/index.js","../node_modules/@stdlib/math-base-ops-umul/lib/main.js","../node_modules/@stdlib/math-base-special-abs/lib/index.js","../node_modules/@stdlib/math-base-special-abs/lib/main.js","../node_modules/@stdlib/math-base-special-ceil/lib/index.js","../node_modules/@stdlib/math-base-special-ceil/lib/main.js","../node_modules/@stdlib/math-base-special-copysign/lib/index.js","../node_modules/@stdlib/math-base-special-copysign/lib/main.js","../node_modules/@stdlib/math-base-special-exp/lib/expmulti.js","../node_modules/@stdlib/math-base-special-exp/lib/index.js","../node_modules/@stdlib/math-base-special-exp/lib/main.js","../node_modules/@stdlib/math-base-special-exp/lib/polyval_p.js","../node_modules/@stdlib/math-base-special-floor/lib/index.js","../node_modules/@stdlib/math-base-special-floor/lib/main.js","../node_modules/@stdlib/math-base-special-ldexp/lib/index.js","../node_modules/@stdlib/math-base-special-ldexp/lib/main.js","../node_modules/@stdlib/math-base-special-ln/lib/index.js","../node_modules/@stdlib/math-base-special-ln/lib/main.js","../node_modules/@stdlib/math-base-special-ln/lib/polyval_p.js","../node_modules/@stdlib/math-base-special-ln/lib/polyval_q.js","../node_modules/@stdlib/math-base-special-max/lib/index.js","../node_modules/@stdlib/math-base-special-max/lib/main.js","../node_modules/@stdlib/math-base-special-pow/lib/index.js","../node_modules/@stdlib/math-base-special-pow/lib/log2ax.js","../node_modules/@stdlib/math-base-special-pow/lib/logx.js","../node_modules/@stdlib/math-base-special-pow/lib/main.js","../node_modules/@stdlib/math-base-special-pow/lib/polyval_l.js","../node_modules/@stdlib/math-base-special-pow/lib/polyval_p.js","../node_modules/@stdlib/math-base-special-pow/lib/polyval_w.js","../node_modules/@stdlib/math-base-special-pow/lib/pow2.js","../node_modules/@stdlib/math-base-special-pow/lib/x_is_zero.js","../node_modules/@stdlib/math-base-special-pow/lib/y_is_huge.js","../node_modules/@stdlib/math-base-special-pow/lib/y_is_infinite.js","../node_modules/@stdlib/math-base-special-sqrt/lib/index.js","../node_modules/@stdlib/math-base-special-sqrt/lib/main.js","../node_modules/@stdlib/math-base-special-trunc/lib/index.js","../node_modules/@stdlib/math-base-special-trunc/lib/main.js","../node_modules/@stdlib/number-ctor/lib/index.js","../node_modules/@stdlib/number-ctor/lib/main.js","../node_modules/@stdlib/number-float64-base-exponent/lib/index.js","../node_modules/@stdlib/number-float64-base-exponent/lib/main.js","../node_modules/@stdlib/number-float64-base-from-words/lib/index.js","../node_modules/@stdlib/number-float64-base-from-words/lib/indices.js","../node_modules/@stdlib/number-float64-base-from-words/lib/main.js","../node_modules/@stdlib/number-float64-base-get-high-word/lib/high.js","../node_modules/@stdlib/number-float64-base-get-high-word/lib/index.js","../node_modules/@stdlib/number-float64-base-get-high-word/lib/main.js","../node_modules/@stdlib/number-float64-base-normalize/lib/assign.js","../node_modules/@stdlib/number-float64-base-normalize/lib/index.js","../node_modules/@stdlib/number-float64-base-normalize/lib/main.js","../node_modules/@stdlib/number-float64-base-set-high-word/lib/high.js","../node_modules/@stdlib/number-float64-base-set-high-word/lib/index.js","../node_modules/@stdlib/number-float64-base-set-high-word/lib/main.js","../node_modules/@stdlib/number-float64-base-set-low-word/lib/index.js","../node_modules/@stdlib/number-float64-base-set-low-word/lib/low.js","../node_modules/@stdlib/number-float64-base-set-low-word/lib/main.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/index.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/main.js","../node_modules/@stdlib/number-float64-base-to-float32/lib/polyfill.js","../node_modules/@stdlib/number-float64-base-to-words/lib/assign.js","../node_modules/@stdlib/number-float64-base-to-words/lib/index.js","../node_modules/@stdlib/number-float64-base-to-words/lib/indices.js","../node_modules/@stdlib/number-float64-base-to-words/lib/main.js","../node_modules/@stdlib/number-uint32-base-to-int32/lib/index.js","../node_modules/@stdlib/number-uint32-base-to-int32/lib/main.js","../node_modules/@stdlib/object-assign/lib/builtin.js","../node_modules/@stdlib/object-assign/lib/has_object_assign.js","../node_modules/@stdlib/object-assign/lib/index.js","../node_modules/@stdlib/object-assign/lib/polyfill.js","../node_modules/@stdlib/object-ctor/lib/index.js","../node_modules/@stdlib/object-ctor/lib/main.js","../node_modules/@stdlib/random-base-beta/lib/beta.js","../node_modules/@stdlib/random-base-beta/lib/factory.js","../node_modules/@stdlib/random-base-beta/lib/index.js","../node_modules/@stdlib/random-base-beta/lib/main.js","../node_modules/@stdlib/random-base-beta/lib/sample1.js","../node_modules/@stdlib/random-base-beta/lib/sample2.js","../node_modules/@stdlib/random-base-beta/lib/sample3.js","../node_modules/@stdlib/random-base-beta/lib/standard_gamma.js","../node_modules/@stdlib/random-base-beta/lib/validate.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/coords_array.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/factory.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/improved_ziggurat.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/index.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/main.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/ratio_array.js","../node_modules/@stdlib/random-base-improved-ziggurat/lib/sample_tail.js","../node_modules/@stdlib/random-base-mt19937/lib/factory.js","../node_modules/@stdlib/random-base-mt19937/lib/index.js","../node_modules/@stdlib/random-base-mt19937/lib/main.js","../node_modules/@stdlib/random-base-mt19937/lib/rand_uint32.js","../node_modules/@stdlib/regexp-function-name/lib/index.js","../node_modules/@stdlib/regexp-function-name/lib/main.js","../node_modules/@stdlib/regexp-function-name/lib/regexp.js","../node_modules/@stdlib/strided-base-reinterpret-complex128/lib/index.js","../node_modules/@stdlib/strided-base-reinterpret-complex128/lib/main.js","../node_modules/@stdlib/strided-base-reinterpret-complex64/lib/index.js","../node_modules/@stdlib/strided-base-reinterpret-complex64/lib/main.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_double.js","../node_modules/@stdlib/string-base-format-interpolate/lib/format_integer.js","../node_modules/@stdlib/string-base-format-interpolate/lib/index.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_number.js","../node_modules/@stdlib/string-base-format-interpolate/lib/is_string.js","../node_modules/@stdlib/string-base-format-interpolate/lib/main.js","../node_modules/@stdlib/string-base-format-interpolate/lib/space_pad.js","../node_modules/@stdlib/string-base-format-interpolate/lib/zero_pad.js","../node_modules/@stdlib/string-base-format-tokenize/lib/index.js","../node_modules/@stdlib/string-base-format-tokenize/lib/main.js","../node_modules/@stdlib/string-format/lib/index.js","../node_modules/@stdlib/string-format/lib/is_string.js","../node_modules/@stdlib/string-format/lib/main.js","../node_modules/@stdlib/symbol-ctor/lib/index.js","../node_modules/@stdlib/symbol-ctor/lib/main.js","../node_modules/@stdlib/symbol-iterator/lib/index.js","../node_modules/@stdlib/symbol-iterator/lib/main.js","../node_modules/@stdlib/utils-constant-function/lib/index.js","../node_modules/@stdlib/utils-constant-function/lib/main.js","../node_modules/@stdlib/utils-constructor-name/lib/index.js","../node_modules/@stdlib/utils-constructor-name/lib/main.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/index.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-accessor/lib/main.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/index.js","../node_modules/@stdlib/utils-define-nonenumerable-read-only-property/lib/main.js","../node_modules/@stdlib/utils-define-nonenumerable-read-write-accessor/lib/index.js","../node_modules/@stdlib/utils-define-nonenumerable-read-write-accessor/lib/main.js","../node_modules/@stdlib/utils-define-property/lib/builtin.js","../node_modules/@stdlib/utils-define-property/lib/define_property.js","../node_modules/@stdlib/utils-define-property/lib/has_define_property_support.js","../node_modules/@stdlib/utils-define-property/lib/index.js","../node_modules/@stdlib/utils-define-property/lib/polyfill.js","../node_modules/@stdlib/utils-enumerable-properties/lib/index.js","../node_modules/@stdlib/utils-enumerable-properties/lib/main.js","../node_modules/@stdlib/utils-function-name/lib/index.js","../node_modules/@stdlib/utils-function-name/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/detect.js","../node_modules/@stdlib/utils-get-prototype-of/lib/index.js","../node_modules/@stdlib/utils-get-prototype-of/lib/main.js","../node_modules/@stdlib/utils-get-prototype-of/lib/native.js","../node_modules/@stdlib/utils-get-prototype-of/lib/polyfill.js","../node_modules/@stdlib/utils-get-prototype-of/lib/proto.js","../node_modules/@stdlib/utils-global/lib/browser.js","../node_modules/@stdlib/utils-global/lib/codegen.js","../node_modules/@stdlib/utils-global/lib/global_this.js","../node_modules/@stdlib/utils-global/lib/self.js","../node_modules/@stdlib/utils-global/lib/window.js","../node_modules/@stdlib/utils-index-of/lib/index.js","../node_modules/@stdlib/utils-index-of/lib/main.js","../node_modules/@stdlib/utils-keys/lib/builtin.js","../node_modules/@stdlib/utils-keys/lib/builtin_wrapper.js","../node_modules/@stdlib/utils-keys/lib/has_arguments_bug.js","../node_modules/@stdlib/utils-keys/lib/has_automation_equality_bug.js","../node_modules/@stdlib/utils-keys/lib/has_builtin.js","../node_modules/@stdlib/utils-keys/lib/has_enumerable_prototype_bug.js","../node_modules/@stdlib/utils-keys/lib/has_non_enumerable_properties_bug.js","../node_modules/@stdlib/utils-keys/lib/has_window.js","../node_modules/@stdlib/utils-keys/lib/index.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype.js","../node_modules/@stdlib/utils-keys/lib/is_constructor_prototype_wrapper.js","../node_modules/@stdlib/utils-keys/lib/main.js","../node_modules/@stdlib/utils-keys/lib/polyfill.js","../node_modules/@stdlib/utils-keys/lib/window.js","../node_modules/@stdlib/utils-native-class/lib/index.js","../node_modules/@stdlib/utils-native-class/lib/main.js","../node_modules/@stdlib/utils-native-class/lib/polyfill.js","../node_modules/@stdlib/utils-native-class/lib/tostring.js","../node_modules/@stdlib/utils-native-class/lib/tostringtag.js","../node_modules/@stdlib/utils-noop/lib/index.js","../node_modules/@stdlib/utils-noop/lib/main.js","../node_modules/@stdlib/utils-property-symbols/lib/builtin.js","../node_modules/@stdlib/utils-property-symbols/lib/has_builtin.js","../node_modules/@stdlib/utils-property-symbols/lib/index.js","../node_modules/@stdlib/utils-property-symbols/lib/polyfill.js","../node_modules/@stdlib/utils-type-of/lib/check.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/nodelist.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/re.js","../node_modules/@stdlib/utils-type-of/lib/fixtures/typedarray.js","../node_modules/@stdlib/utils-type-of/lib/index.js","../node_modules/@stdlib/utils-type-of/lib/main.js","../node_modules/@stdlib/utils-type-of/lib/polyfill.js","../node_modules/react-dom/cjs/react-dom.production.min.js","../node_modules/react-dom/client.js","../node_modules/react-dom/index.js","../node_modules/react/cjs/react-jsx-runtime.production.min.js","../node_modules/react/cjs/react.production.min.js","../node_modules/react/index.js","../node_modules/react/jsx-runtime.js","../node_modules/scheduler/cjs/scheduler.production.min.js","../node_modules/scheduler/index.js","../webpack/bootstrap","../webpack/runtime/compat get default export","../webpack/runtime/define property getters","../webpack/runtime/hasOwnProperty shorthand","core/common/prng.ts","core/common/context.ts","webpack://groundhog/./src/webui/components/context_editor/style.module.scss?ad05","core/common/geometry.ts","webui/components/context_editor/controls.tsx","../node_modules/robust-predicates/esm/util.js","../node_modules/robust-predicates/esm/orient2d.js","../node_modules/robust-predicates/esm/orient3d.js","../node_modules/robust-predicates/esm/incircle.js","../node_modules/robust-predicates/esm/insphere.js","../node_modules/delaunator/index.js","core/models/position.ts","core/models/building.ts","core/models/tiles.ts","core/models/creature.ts","core/common/utils.ts","core/architects/utils/placement.ts","core/architects/utils/creatures.ts","core/models/hazards.ts","core/architects/utils/hazards.ts","core/architects/utils/resources.ts","core/architects/default.ts","core/common/grid.ts","core/architects/utils/buildings.ts","core/architects/utils/oyster.ts","core/architects/utils/rough.ts","core/architects/utils/script.ts","core/architects/utils/discovery.ts","core/architects/established_hq.ts","core/architects/utils/creature_spawners.ts","core/architects/fissure.ts","core/architects/utils/intersects.ts","core/architects/flooded.ts","core/architects/loopback.ts","core/models/vehicle.ts","core/architects/lost_miners.ts","core/architects/nomads.ts","core/architects/simple_cave.ts","core/architects/simple_hall.ts","core/architects/simple_spawn.ts","core/architects/slugs.ts","core/architects/thin_hall.ts","core/architects/treasure.ts","core/architects/index.ts","webui/components/context_editor/architects.tsx","webui/components/context_editor/index.tsx","webpack://groundhog/./src/webui/components/map_preview/style.module.scss?c9d1","webui/components/map_preview/baseplate.tsx","webui/components/map_preview/path.tsx","webui/components/map_preview/pearl.tsx","webui/components/map_preview/tiles.tsx","webui/components/map_preview/entity.tsx","webui/components/map_preview/open_cave_flag.tsx","core/transformers/03_plastic/03_strataflux/base.ts","webui/components/map_preview/height.tsx","webui/components/map_preview/stats.tsx","webui/components/map_preview/plan.tsx","webpack://groundhog/./src/webui/components/map_preview/script_preview/styles.module.scss?0993","webui/components/map_preview/script_preview/index.tsx","webui/components/map_preview/index.tsx","core/common/transform.ts","core/models/baseplate.ts","core/transformers/00_outlines/00_partition.ts","core/models/path.ts","core/transformers/00_outlines/index.ts","core/transformers/00_outlines/01_discriminate.ts","core/transformers/00_outlines/02_triangulate.ts","core/transformers/00_outlines/03_span.ts","core/transformers/00_outlines/04_clip.ts","core/transformers/00_outlines/05_bore.ts","core/transformers/00_outlines/06_weave.ts","core/transformers/01_planning/00_negotiate.ts","core/transformers/01_planning/03_establish.ts","core/transformers/01_planning/04_pearl.ts","core/transformers/01_planning/index.ts","core/transformers/01_planning/01_measure.ts","core/transformers/01_planning/02_flood.ts","core/models/discovery_zone.ts","core/transformers/02_masonry/03_grout.ts","core/transformers/02_masonry/06_annex.ts","core/transformers/02_masonry/index.ts","core/transformers/02_masonry/00_foundation.ts","core/transformers/02_masonry/01_rough.ts","core/transformers/02_masonry/02_brace.ts","core/transformers/02_masonry/04_sand.ts","core/transformers/02_masonry/05_fine.ts","core/models/miner.ts","core/transformers/03_plastic/02_strataform.ts","core/transformers/03_plastic/03_strataflux/edges.ts","core/transformers/03_plastic/03_strataflux/nodes.ts","core/transformers/03_plastic/03_strataflux/index.ts","core/transformers/03_plastic/index.ts","core/transformers/03_plastic/00_fence.ts","core/transformers/03_plastic/01_discover.ts","core/transformers/03_plastic/04_populate.ts","core/transformers/04_ephemera/00_aerate.ts","core/lore/builder.ts","core/lore/graphs/conclusions.ts","core/lore/graphs/events.ts","core/lore/graphs/names.ts","core/lore/graphs/orders.ts","core/lore/graphs/premise.ts","core/lore/graphs/seismic.ts","core/lore/lore.ts","core/transformers/04_ephemera/02_enscribe.ts","core/transformers/04_ephemera/04_serialize.ts","core/transformers/04_ephemera/index.ts","core/transformers/04_ephemera/01_adjure.ts","core/transformers/04_ephemera/03_program.ts","core/models/objectives.ts","core/transformers/index.ts","webpack://groundhog/./src/webui/components/popovers/styles.module.scss?55be","webui/components/popovers/lore.tsx","webui/components/popovers/about.tsx","webpack://groundhog/./src/webui/App.module.scss?9a46","webui/components/popovers/error.tsx","webui/App.tsx","index.tsx"],"sourcesContent":["/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @module @stdlib/array-base-accessor-getter\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var dtype = require( '@stdlib/array-dtype' );\n* var getter = require( '@stdlib/array-base-accessor-getter' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'complex128': getComplex128,\n\t'complex64': getComplex64,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex128( arr, 1 );\n* // returns \n*\n* var re = real( v );\n* // returns 3.0\n*\n* var im = imag( v );\n* // returns 4.0\n*/\nfunction getComplex128( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getComplex64( arr, 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\nfunction getComplex64( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n/**\n* Returns an element from an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr.get( idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var dtype = require( '@stdlib/array-dtype' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 3.0\n*\n* var im = imagf( v );\n* // returns 4.0\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @module @stdlib/array-base-accessor-setter\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var dtype = require( '@stdlib/array-dtype' );\n* var setter = require( '@stdlib/array-base-accessor-setter' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'complex128': setComplex128,\n\t'complex64': setComplex64,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Complex128Array`.\n*\n* @private\n* @param {Complex128Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex128( arr, 1, new Complex128( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns \n*\n* var re = real( v );\n* // returns 10.0\n*\n* var im = imag( v );\n* // returns 11.0\n*/\nfunction setComplex128( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in a `Complex64Array`.\n*\n* @private\n* @param {Complex64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* setComplex64( arr, 1, new Complex64( 10.0, 11.0 ) );\n* var v = arr.get( 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\nfunction setComplex64( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n/**\n* Sets an element in an array-like object supporting the get/set protocol.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* function get( idx ) {\n* return arr[ idx ];\n* }\n*\n* function set( value, idx ) {\n* arr[ idx ] = value;\n* }\n*\n* arr.get = get;\n* arr.set = set;\n*\n* setArrayLike( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr.set( value, idx );\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an array-like object supporting the get/set protocol.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var dtype = require( '@stdlib/array-dtype' );\n*\n* var arr = new Complex64Array( [ 1, 2, 3, 4 ] );\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 1, new Complex64( 10.0, 11.0 ) );\n*\n* var v = arr.get( 1 );\n* // returns \n*\n* var re = realf( v );\n* // returns 10.0\n*\n* var im = imagf( v );\n* // returns 11.0\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an array-like object to an object likely to have the same \"shape\".\n*\n* @module @stdlib/array-base-arraylike2object\n*\n* @example\n* var arraylike2object = require( '@stdlib/array-base-arraylike2object' );\n*\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isAccessorArray = require( '@stdlib/array-base-assert-is-accessor-array' );\nvar getter = require( '@stdlib/array-base-getter' );\nvar setter = require( '@stdlib/array-base-setter' );\nvar accessorGetter = require( '@stdlib/array-base-accessor-getter' );\nvar accessorSetter = require( '@stdlib/array-base-accessor-setter' );\nvar dtype = require( '@stdlib/array-dtype' );\n\n\n// MAIN //\n\n/**\n* Converts an array-like to an object likely to have the same \"shape\".\n*\n* ## Notes\n*\n* - This function is intended as a potential performance optimization. In V8, for example, even if two objects share common properties, if those properties were added in different orders or if one object has additional properties not shared by the other object, then those objects will have different \"hidden\" classes. If a function is provided many objects having different \"shapes\", some JavaScript VMs (e.g., V8) will consider the function \"megamorphic\" and fail to perform various runtime optimizations. Accordingly, the intent of this function is to standardize the \"shape\" of the object holding array meta data to ensure that internal functions operating on arrays are provided consistent argument \"shapes\".\n*\n* - The returned object has the following properties:\n*\n* - **data**: reference to the input array.\n* - **dtype**: array data type.\n* - **accessorProtocol**: `boolean` indicating whether the input array uses accessors for getting and setting elements.\n* - **accessors**: a two-element array whose first element is an accessor for retrieving an array element and whose second element is an accessor for setting an array element.\n*\n* @param {Collection} x - array-like object\n* @returns {Object} object containing array meta data\n*\n* @example\n* var obj = arraylike2object( [ 1, 2, 3, 4 ] );\n* // returns {...}\n*/\nfunction arraylike2object( x ) {\n\tvar dt = dtype( x );\n\tif ( isAccessorArray( x ) ) {\n\t\treturn {\n\t\t\t'data': x,\n\t\t\t'dtype': dt,\n\t\t\t'accessorProtocol': true,\n\t\t\t'accessors': [\n\t\t\t\taccessorGetter( dt ),\n\t\t\t\taccessorSetter( dt )\n\t\t\t]\n\t\t};\n\t}\n\treturn {\n\t\t'data': x,\n\t\t'dtype': dt,\n\t\t'accessorProtocol': false,\n\t\t'accessors': [\n\t\t\tgetter( dt ),\n\t\t\tsetter( dt )\n\t\t]\n\t};\n}\n\n\n// EXPORTS //\n\nmodule.exports = arraylike2object;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if an array-like object supports the accessor (get/set) protocol.\n*\n* @module @stdlib/array-base-assert-is-accessor-array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128array' );\n* var isAccessorArray = require( '@stdlib/array-base-assert-is-accessor-array' );\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isAccessorArray( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar TYPE = 'function';\n\n\n// MAIN //\n\n/**\n* Tests if an array-like object supports the accessor (get/set) protocol.\n*\n* @param {Object} value - value to test\n* @returns {boolean} boolean indicating whether a value is an accessor array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var bool = isAccessorArray( new Complex128Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isAccessorArray( [] );\n* // returns false\n*/\nfunction isAccessorArray( value ) {\n\treturn ( typeof value.get === TYPE && typeof value.set === TYPE ); // eslint-disable-line valid-typeof\n}\n\n\n// EXPORTS //\n\nmodule.exports = isAccessorArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a `Complex128Array`.\n*\n* @module @stdlib/array-base-assert-is-complex128array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n* var isComplex128Array = require( '@stdlib/array-base-assert-is-complex128array' );\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 16; // 8 bytes per float64 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex128Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex128Array`\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var bool = isComplex128Array( new Complex128Array( 10 ) );\n* // returns true\n*\n* bool = isComplex128Array( [] );\n* // returns false\n*/\nfunction isComplex128Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex128Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex128array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex128Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a `Complex64Array`.\n*\n* @module @stdlib/array-base-assert-is-complex64array\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var isComplex64Array = require( '@stdlib/array-base-assert-is-complex64array' );\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2024 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = 8; // 4 bytes per float32 x (1 real + 1 imag component)\n\n\n// MAIN //\n\n/**\n* Returns a boolean indicating if a value is a `Complex64Array`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `Complex64Array`\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var bool = isComplex64Array( new Complex64Array( 10 ) );\n* // returns true\n*\n* bool = isComplex64Array( [] );\n* // returns false\n*/\nfunction isComplex64Array( value ) {\n\t// Note: the following is not robust and that is intentional. In this case, we are seeking a lower cost way to reasonably determine whether an input value is a `Complex64Array` in order to avoid walking the prototype chain and resolving constructors, which is necessary for robust identification of cross-realm instances. For more robust validation, see `@stdlib/assert/is-complex64array`.\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\tvalue.constructor.name === 'Complex64Array' &&\n\t\tvalue.BYTES_PER_ELEMENT === BYTES_PER_ELEMENT\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for retrieving an element from an indexed array-like object.\n*\n* @module @stdlib/array-base-getter\n*\n* @example\n* var dtype = require( '@stdlib/array-dtype' );\n* var getter = require( '@stdlib/array-base-getter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar GETTERS = {\n\t'float64': getFloat64,\n\t'float32': getFloat32,\n\t'int32': getInt32,\n\t'int16': getInt16,\n\t'int8': getInt8,\n\t'uint32': getUint32,\n\t'uint16': getUint16,\n\t'uint8': getUint8,\n\t'uint8c': getUint8c,\n\t'generic': getGeneric,\n\t'default': getArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Returns an element from a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var arr = new Float64Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat64( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat64( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Float32Array = require( '@stdlib/array-float32' );\n*\n* var arr = new Float32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getFloat32( arr, 2 );\n* // returns 3.0\n*/\nfunction getFloat32( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int32Array = require( '@stdlib/array-int32' );\n*\n* var arr = new Int32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt32( arr, 2 );\n* // returns 3\n*/\nfunction getInt32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int16Array = require( '@stdlib/array-int16' );\n*\n* var arr = new Int16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt16( arr, 2 );\n* // returns 3\n*/\nfunction getInt16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Int8Array = require( '@stdlib/array-int8' );\n*\n* var arr = new Int8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getInt8( arr, 2 );\n* // returns 3\n*/\nfunction getInt8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint32Array = require( '@stdlib/array-uint32' );\n*\n* var arr = new Uint32Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint32( arr, 2 );\n* // returns 3\n*/\nfunction getUint32( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint16Array = require( '@stdlib/array-uint16' );\n*\n* var arr = new Uint16Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint16( arr, 2 );\n* // returns 3\n*/\nfunction getUint16( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint8Array = require( '@stdlib/array-uint8' );\n*\n* var arr = new Uint8Array( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8( arr, 2 );\n* // returns 3\n*/\nfunction getUint8( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {number} element value\n*\n* @example\n* var Uint8ClampedArray = require( '@stdlib/array-uint8c' );\n*\n* var arr = new Uint8ClampedArray( [ 1, 2, 3, 4 ] );\n*\n* var v = getUint8c( arr, 2 );\n* // returns 3\n*/\nfunction getUint8c( arr, idx ) { // eslint-disable-line stdlib/jsdoc-doctest-decimal-point\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getGeneric( arr, 2 );\n* // returns 3\n*/\nfunction getGeneric( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n/**\n* Returns an element from an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @returns {*} element value\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var v = getArrayLike( arr, 2 );\n* // returns 3\n*/\nfunction getArrayLike( arr, idx ) {\n\treturn arr[ idx ];\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for retrieving an element from an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var dtype = require( '@stdlib/array-dtype' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var get = getter( dtype( arr ) );\n* var v = get( arr, 2 );\n* // returns 3\n*/\nfunction getter( dtype ) {\n\tvar f = GETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn GETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an accessor function for setting an element in an indexed array-like object.\n*\n* @module @stdlib/array-base-setter\n*\n* @example\n* var dtype = require( '@stdlib/array-dtype' );\n* var set = require( '@stdlib/array-base-setter' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 10 );\n*\n* var v = arr[ 2 ];\n* // returns 10\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar SETTERS = {\n\t'float64': setFloat64,\n\t'float32': setFloat32,\n\t'int32': setInt32,\n\t'int16': setInt16,\n\t'int8': setInt8,\n\t'uint32': setUint32,\n\t'uint16': setUint16,\n\t'uint8': setUint8,\n\t'uint8c': setUint8c,\n\t'generic': setGeneric,\n\t'default': setArrayLike\n};\n\n\n// FUNCTIONS //\n\n/**\n* Sets an element in a `Float64Array`.\n*\n* @private\n* @param {Float64Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var arr = new Float64Array( 4 );\n*\n* setFloat64( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat64( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Float32Array`.\n*\n* @private\n* @param {Float32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Float32Array = require( '@stdlib/array-float32' );\n*\n* var arr = new Float32Array( 4 );\n*\n* setFloat32( arr, 2, 3.0 );\n*\n* var v = arr[ 2 ];\n* // returns 3.0\n*/\nfunction setFloat32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int32Array`.\n*\n* @private\n* @param {Int32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int32Array = require( '@stdlib/array-int32' );\n*\n* var arr = new Int32Array( 4 );\n*\n* setInt32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int16Array`.\n*\n* @private\n* @param {Int16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int16Array = require( '@stdlib/array-int16' );\n*\n* var arr = new Int16Array( 4 );\n*\n* setInt16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an `Int8Array`.\n*\n* @private\n* @param {Int8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Int8Array = require( '@stdlib/array-int8' );\n*\n* var arr = new Int8Array( 4 );\n*\n* setInt8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setInt8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint32Array`.\n*\n* @private\n* @param {Uint32Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint32Array = require( '@stdlib/array-uint32' );\n*\n* var arr = new Uint32Array( 4 );\n*\n* setUint32( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint32( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint16Array`.\n*\n* @private\n* @param {Uint16Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint16Array = require( '@stdlib/array-uint16' );\n*\n* var arr = new Uint16Array( 4 );\n*\n* setUint16( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint16( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8Array`.\n*\n* @private\n* @param {Uint8Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint8Array = require( '@stdlib/array-uint8' );\n*\n* var arr = new Uint8Array( 4 );\n*\n* setUint8( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a `Uint8ClampedArray`.\n*\n* @private\n* @param {Uint8ClampedArray} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {number} value - value to set\n*\n* @example\n* var Uint8ClampedArray = require( '@stdlib/array-uint8c' );\n*\n* var arr = new Uint8ClampedArray( 4 );\n*\n* setUint8c( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setUint8c( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in a generic `Array`.\n*\n* @private\n* @param {Array} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setGeneric( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setGeneric( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n/**\n* Sets an element in an indexed array-like object.\n*\n* @private\n* @param {Collection} arr - input array\n* @param {NonNegativeInteger} idx - element index\n* @param {*} value - value to set\n*\n* @example\n* var arr = [ 1, 2, 3, 4 ];\n*\n* setArrayLike( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setArrayLike( arr, idx, value ) {\n\tarr[ idx ] = value;\n}\n\n\n// MAIN //\n\n/**\n* Returns an accessor function for setting an element in an indexed array-like object.\n*\n* @param {string} dtype - array dtype\n* @returns {Function} accessor\n*\n* @example\n* var dtype = require( '@stdlib/array-dtype' );\n*\n* var arr = [ 1, 2, 3, 4 ];\n*\n* var set = setter( dtype( arr ) );\n* set( arr, 2, 3 );\n*\n* var v = arr[ 2 ];\n* // returns 3\n*/\nfunction setter( dtype ) {\n\tvar f = SETTERS[ dtype ];\n\tif ( typeof f === 'function' ) {\n\t\treturn f;\n\t}\n\treturn SETTERS.default;\n}\n\n\n// EXPORTS //\n\nmodule.exports = setter;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar real = require( '@stdlib/complex-real' );\nvar imag = require( '@stdlib/complex-imag' );\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float64Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float64Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = real( v );\n\t\tbuf[ j+1 ] = imag( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar format = require( '@stdlib/string-format' );\nvar real = require( '@stdlib/complex-real' );\nvar imag = require( '@stdlib/complex-imag' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar format = require( '@stdlib/string-format' );\nvar real = require( '@stdlib/complex-real' );\nvar imag = require( '@stdlib/complex-imag' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( real( z ), imag( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 128-bit complex number array.\n*\n* @module @stdlib/array-complex128\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var arr = new Complex128Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var arr = new Complex128Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert-is-arraybuffer' );\nvar isObject = require( '@stdlib/assert-is-object' );\nvar isArray = require( '@stdlib/assert-is-array' );\nvar isString = require( '@stdlib/assert-is-string' );\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar isEven = require( '@stdlib/math-base-assert-is-even' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar isComplex64Array = require( '@stdlib/array-base-assert-is-complex64array' );\nvar isComplex128Array = require( '@stdlib/array-base-assert-is-complex128array' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert-has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol-iterator' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar Complex128 = require( '@stdlib/complex-float64' );\nvar real = require( '@stdlib/complex-real' );\nvar imag = require( '@stdlib/complex-imag' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar reinterpret64 = require( '@stdlib/strided-base-reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided-base-reinterpret-complex128' );\nvar getter = require( '@stdlib/array-base-getter' );\nvar accessorGetter = require( '@stdlib/array-base-accessor-getter' );\nvar format = require( '@stdlib/string-format' );\nvar fromIterator = require( './from_iterator.js' );\nvar fromIteratorMap = require( './from_iterator_map.js' );\nvar fromArray = require( './from_array.js' );\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float64Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex128Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex128Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex64Array...\n\t\tvalue.name === 'Complex64Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float64Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex128} complex number\n*/\nfunction getComplex128( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex128( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 128-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `16`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `16`\n* @throws {TypeError} view length must be a positive multiple of `16`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var arr = new Complex128Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex128Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex128Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex128Array( buf, 16 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 64 );\n* var arr = new Complex128Array( buf, 16, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex128Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex128Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex128Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex128Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex128Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex128Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float64Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float64Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float64Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float64Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float64Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float64Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var nbytes = Complex128Array.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex128Array\n* @readonly\n* @type {string}\n* @default 'Complex128Array'\n*\n* @example\n* var name = Complex128Array.name;\n* // returns 'Complex128Array'\n*/\nsetReadOnly( Complex128Array, 'name', 'Complex128Array' );\n\n/**\n* Creates a new 128-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex128Array\n* @type {Function}\n* @param {(Collection|Object)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function clbk( v ) {\n* return new Complex128( real(v)*2.0, imag(v)*2.0 );\n* }\n*\n* var arr = Complex128Array.from( [ new Complex128( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex128Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = real( v );\n\t\t\t\t\tbuf[ j+1 ] = imag( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 128-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex128Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} 128-bit complex number array\n*\n* @example\n* var arr = Complex128Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex128Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = real( z );\n* // returns 9.0\n*\n* im = imag( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 160\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 16\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 16\n*/\nsetReadOnly( Complex128Array.prototype, 'BYTES_PER_ELEMENT', Complex128Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} modified array\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex128( 1.0, 1.0 ), 0 );\n* arr.set( new Complex128( 2.0, 2.0 ), 1 );\n* arr.set( new Complex128( 3.0, 3.0 ), 2 );\n* arr.set( new Complex128( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = [\n* new Complex128( 1.0, 1.0 ),\n* new Complex128( 2.0, 2.0 ),\n* new Complex128( 3.0, 3.0 )\n* ];\n* arr = new Complex128Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex128( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.fill( new Complex128( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*\n* z = arr.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = real( value );\n\tim = imag( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex128Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex128|void)} array element or undefined\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex128( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex128Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex128( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex128|void)} array element\n*\n* @example\n* var arr = new Complex128Array( 10 );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex128Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex128( this._buffer, idx );\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex128Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex128Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex128Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex128( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex128( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex128( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex128( 4.0, -4.0 ), -3 );\n* // returns 3\n*/\nsetReadOnly( Complex128Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex128( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex128( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex128( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex128Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = real( searchElement );\n\tim = imag( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function scale( v, i ) {\n* return new Complex128( 2.0*real( v ), 2.0*imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 2.0\n*\n* var im = imag( z );\n* // returns -2.0\n*/\nsetReadOnly( Complex128Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex128( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = real( v );\n\t\t\toutbuf[ (2*i)+1 ] = imag( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n* var cadd = require( '@stdlib/math-base-ops-cadd' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( cadd );\n* // returns \n*\n* var re = real( z );\n* // returns 6.0\n*\n* var im = imag( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex128( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex128( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values as intended.\n*\n* @name set\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 0.0\n*\n* var im = imag( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = real( value );\n\t\tbuf[ idx+1 ] = imag( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float64Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float64Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = real( v );\n\t\t\tbuf[ idx+1 ] = imag( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex128Array} complex number array\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* function predicate( v ) {\n* return ( real( v ) === imag( v ) );\n* }\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex128Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex128( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 1.0\n*\n* var im = imag( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 5.0\n*\n* im = imag( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = real( z );\n* // returns 3.0\n*\n* im = imag( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex128Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex128Array} reversed array\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 3.0\n*\n* var im = imag( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = real( z );\n* // returns 2.0\n*\n* im = imag( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = real( z );\n* // returns 1.0\n*\n* im = imag( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex128Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex128Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex128Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex128( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex128Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex128Array} new typed array\n*\n* @example\n* var real = require( '@stdlib/complex-real' );\n* var imag = require( '@stdlib/complex-imag' );\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var arr = new Complex128Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex128( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = real( z );\n* // returns 4.0\n*\n* var im = imag( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex128Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = real( value );\n\tbuf[ (2*index)+1 ] = imag( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nmodule.exports = Complex128Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar realf = require( '@stdlib/complex-realf' );\nvar imagf = require( '@stdlib/complex-imagf' );\n\n\n// MAIN //\n\n/**\n* Returns a strided array of real and imaginary components.\n*\n* @private\n* @param {Float32Array} buf - output array\n* @param {Array} arr - array containing complex numbers\n* @returns {(Float32Array|null)} output array or null\n*/\nfunction fromArray( buf, arr ) {\n\tvar len;\n\tvar v;\n\tvar i;\n\tvar j;\n\n\tlen = arr.length;\n\tj = 0;\n\tfor ( i = 0; i < len; i++ ) {\n\t\tv = arr[ i ];\n\t\tif ( !isComplexLike( v ) ) {\n\t\t\treturn null;\n\t\t}\n\t\tbuf[ j ] = realf( v );\n\t\tbuf[ j+1 ] = imagf( v );\n\t\tj += 2; // stride\n\t}\n\treturn buf;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar realf = require( '@stdlib/complex-realf' );\nvar imagf = require( '@stdlib/complex-imagf' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIterator( it ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\n\tout = [];\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\tz = v.value;\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIterator;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar realf = require( '@stdlib/complex-realf' );\nvar imagf = require( '@stdlib/complex-imagf' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns an array of iterated values.\n*\n* @private\n* @param {Object} it - iterator\n* @param {Function} clbk - callback to invoke for each iterated value\n* @param {*} thisArg - invocation context\n* @returns {(Array|TypeError)} array or an error\n*/\nfunction fromIteratorMap( it, clbk, thisArg ) {\n\tvar out;\n\tvar v;\n\tvar z;\n\tvar i;\n\n\tout = [];\n\ti = -1;\n\twhile ( true ) {\n\t\tv = it.next();\n\t\tif ( v.done ) {\n\t\t\tbreak;\n\t\t}\n\t\ti += 1;\n\t\tz = clbk.call( thisArg, v.value, i );\n\t\tif ( isArrayLikeObject( z ) && z.length >= 2 ) {\n\t\t\tout.push( z[ 0 ], z[ 1 ] );\n\t\t} else if ( isComplexLike( z ) ) {\n\t\t\tout.push( realf( z ), imagf( z ) );\n\t\t} else {\n\t\t\treturn new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', z ) );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromIteratorMap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 64-bit complex number array.\n*\n* @module @stdlib/array-complex64\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var arr = new Complex64Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var arr = new Complex64Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/* eslint-disable no-restricted-syntax, max-lines, no-invalid-this */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;\nvar isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isArrayBuffer = require( '@stdlib/assert-is-arraybuffer' );\nvar isObject = require( '@stdlib/assert-is-object' );\nvar isArray = require( '@stdlib/assert-is-array' );\nvar isString = require( '@stdlib/assert-is-string' ).isPrimitive;\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar isComplexLike = require( '@stdlib/assert-is-complex-like' );\nvar isEven = require( '@stdlib/math-base-assert-is-even' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar isComplex64Array = require( '@stdlib/array-base-assert-is-complex64array' );\nvar isComplex128Array = require( '@stdlib/array-base-assert-is-complex128array' );\nvar hasIteratorSymbolSupport = require( '@stdlib/assert-has-iterator-symbol-support' );\nvar ITERATOR_SYMBOL = require( '@stdlib/symbol-iterator' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar Float32Array = require( '@stdlib/array-float32' );\nvar Complex64 = require( '@stdlib/complex-float32' );\nvar format = require( '@stdlib/string-format' );\nvar realf = require( '@stdlib/complex-realf' );\nvar imagf = require( '@stdlib/complex-imagf' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar reinterpret64 = require( '@stdlib/strided-base-reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided-base-reinterpret-complex128' );\nvar getter = require( '@stdlib/array-base-getter' );\nvar accessorGetter = require( '@stdlib/array-base-accessor-getter' );\nvar fromIterator = require( './from_iterator.js' );\nvar fromIteratorMap = require( './from_iterator_map.js' );\nvar fromArray = require( './from_array.js' );\n\n\n// VARIABLES //\n\nvar BYTES_PER_ELEMENT = Float32Array.BYTES_PER_ELEMENT * 2;\nvar HAS_ITERATOR_SYMBOL = hasIteratorSymbolSupport();\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if a value is a complex typed array.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*/\nfunction isComplexArray( value ) {\n\treturn (\n\t\tvalue instanceof Complex64Array ||\n\t\t(\n\t\t\ttypeof value === 'object' &&\n\t\t\tvalue !== null &&\n\t\t\t(\n\t\t\t\tvalue.constructor.name === 'Complex64Array' ||\n\t\t\t\tvalue.constructor.name === 'Complex128Array'\n\t\t\t) &&\n\t\t\ttypeof value._length === 'number' && // eslint-disable-line no-underscore-dangle\n\n\t\t\t// NOTE: we don't perform a more rigorous test here for a typed array for performance reasons, as robustly checking for a typed array instance could require walking the prototype tree and performing relatively expensive constructor checks...\n\t\t\ttypeof value._buffer === 'object' // eslint-disable-line no-underscore-dangle\n\t\t)\n\t);\n}\n\n/**\n* Returns a boolean indicating if a value is a complex typed array constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array constructor\n*/\nfunction isComplexArrayConstructor( value ) {\n\treturn (\n\t\tvalue === Complex64Array ||\n\n\t\t// NOTE: weaker test in order to avoid a circular dependency with Complex128Array...\n\t\tvalue.name === 'Complex128Array'\n\t);\n}\n\n/**\n* Retrieves a complex number from a complex number array buffer.\n*\n* @private\n* @param {Float32Array} buf - array buffer\n* @param {NonNegativeInteger} idx - element index\n* @returns {Complex64} complex number\n*/\nfunction getComplex64( buf, idx ) {\n\tidx *= 2;\n\treturn new Complex64( buf[ idx ], buf[ idx+1 ] );\n}\n\n\n// MAIN //\n\n/**\n* 64-bit complex number array constructor.\n*\n* @constructor\n* @param {(NonNegativeInteger|Collection|ArrayBuffer|Iterable)} [arg] - length, typed array, array-like object, buffer, or an iterable\n* @param {NonNegativeInteger} [byteOffset=0] - byte offset\n* @param {NonNegativeInteger} [length] - view length\n* @throws {RangeError} ArrayBuffer byte length must be a multiple of `8`\n* @throws {RangeError} array-like object and typed array input arguments must have a length which is a multiple of two\n* @throws {TypeError} if provided only a single argument, must provide a valid argument\n* @throws {TypeError} byte offset must be a nonnegative integer\n* @throws {RangeError} byte offset must be a multiple of `8`\n* @throws {TypeError} view length must be a positive multiple of `8`\n* @throws {RangeError} must provide sufficient memory to accommodate byte offset and view length requirements\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var arr = new Complex64Array();\n* // returns \n*\n* var len = arr.length;\n* // returns 0\n*\n* @example\n* var arr = new Complex64Array( 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var arr = new Complex64Array( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 16 );\n* var arr = new Complex64Array( buf, 8 );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var buf = new ArrayBuffer( 32 );\n* var arr = new Complex64Array( buf, 8, 2 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nfunction Complex64Array() {\n\tvar byteOffset;\n\tvar nargs;\n\tvar buf;\n\tvar len;\n\n\tnargs = arguments.length;\n\tif ( !(this instanceof Complex64Array) ) {\n\t\tif ( nargs === 0 ) {\n\t\t\treturn new Complex64Array();\n\t\t}\n\t\tif ( nargs === 1 ) {\n\t\t\treturn new Complex64Array( arguments[0] );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\treturn new Complex64Array( arguments[0], arguments[1] );\n\t\t}\n\t\treturn new Complex64Array( arguments[0], arguments[1], arguments[2] );\n\t}\n\t// Create the underlying data buffer...\n\tif ( nargs === 0 ) {\n\t\tbuf = new Float32Array( 0 ); // backward-compatibility\n\t} else if ( nargs === 1 ) {\n\t\tif ( isNonNegativeInteger( arguments[0] ) ) {\n\t\t\tbuf = new Float32Array( arguments[0]*2 );\n\t\t} else if ( isCollection( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tlen = buf.length;\n\n\t\t\t// If provided a \"generic\" array, peak at the first value, and, if the value is a complex number, try to process as an array of complex numbers, falling back to \"normal\" typed array initialization if we fail and ensuring consistency if the first value had not been a complex number...\n\t\t\tif ( len && isArray( buf ) && isComplexLike( buf[0] ) ) {\n\t\t\t\tbuf = fromArray( new Float32Array( len*2 ), buf );\n\t\t\t\tif ( buf === null ) {\n\t\t\t\t\t// We failed and we are now forced to allocate a new array :-(\n\t\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t\t}\n\t\t\t\t\t// We failed, so fall back to directly setting values...\n\t\t\t\t\tbuf = new Float32Array( arguments[0] );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tif ( isComplex64Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret64( buf, 0 );\n\t\t\t\t} else if ( isComplex128Array( buf ) ) {\n\t\t\t\t\tbuf = reinterpret128( buf, 0 );\n\t\t\t\t} else if ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.', len ) );\n\t\t\t\t}\n\t\t\t\tbuf = new Float32Array( buf );\n\t\t\t}\n\t\t} else if ( isArrayBuffer( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( !isInteger( buf.byteLength/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.', BYTES_PER_ELEMENT, buf.byteLength ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else if ( isObject( arguments[0] ) ) {\n\t\t\tbuf = arguments[ 0 ];\n\t\t\tif ( HAS_ITERATOR_SYMBOL === false ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tif ( !isFunction( buf[ ITERATOR_SYMBOL ] ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) );\n\t\t\t}\n\t\t\tbuf = buf[ ITERATOR_SYMBOL ]();\n\t\t\tif ( !isFunction( buf.next ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', buf ) ); // FIXME: `buf` is what is returned from above, NOT the original value\n\t\t\t}\n\t\t\tbuf = fromIterator( buf );\n\t\t\tif ( buf instanceof Error ) {\n\t\t\t\tthrow buf;\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf );\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.', arguments[0] ) );\n\t\t}\n\t} else {\n\t\tbuf = arguments[ 0 ];\n\t\tif ( !isArrayBuffer( buf ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an ArrayBuffer. Value: `%s`.', buf ) );\n\t\t}\n\t\tbyteOffset = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( byteOffset ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.', byteOffset ) );\n\t\t}\n\t\tif ( !isInteger( byteOffset/BYTES_PER_ELEMENT ) ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Byte offset must be a multiple of %u. Value: `%u`.', BYTES_PER_ELEMENT, byteOffset ) );\n\t\t}\n\t\tif ( nargs === 2 ) {\n\t\t\tlen = buf.byteLength - byteOffset;\n\t\t\tif ( !isInteger( len/BYTES_PER_ELEMENT ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.', BYTES_PER_ELEMENT, len ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset );\n\t\t} else {\n\t\t\tlen = arguments[ 2 ];\n\t\t\tif ( !isNonNegativeInteger( len ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Length must be a nonnegative integer. Value: `%s`.', len ) );\n\t\t\t}\n\t\t\tif ( (len*BYTES_PER_ELEMENT) > (buf.byteLength-byteOffset) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.', len*BYTES_PER_ELEMENT ) );\n\t\t\t}\n\t\t\tbuf = new Float32Array( buf, byteOffset, len*2 );\n\t\t}\n\t}\n\tsetReadOnly( this, '_buffer', buf );\n\tsetReadOnly( this, '_length', buf.length/2 );\n\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var nbytes = Complex64Array.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array, 'BYTES_PER_ELEMENT', BYTES_PER_ELEMENT );\n\n/**\n* Constructor name.\n*\n* @name name\n* @memberof Complex64Array\n* @readonly\n* @type {string}\n* @default 'Complex64Array'\n*\n* @example\n* var str = Complex64Array.name;\n* // returns 'Complex64Array'\n*/\nsetReadOnly( Complex64Array, 'name', 'Complex64Array' );\n\n/**\n* Creates a new 64-bit complex number array from an array-like object or an iterable.\n*\n* @name from\n* @memberof Complex64Array\n* @type {Function}\n* @param {(Collection|Iterable)} src - array-like object or iterable\n* @param {Function} [clbk] - callback to invoke for each source element\n* @param {*} [thisArg] - context\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an array-like object or an iterable\n* @throws {TypeError} second argument must be a function\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {TypeError} an iterator must return either a two element array containing real and imaginary components or a complex number\n* @throws {TypeError} when provided an iterator, a callback must return either a two element array containing real and imaginary components or a complex number\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.from( [ 1.0, -1.0 ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ] );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function clbk( v ) {\n* return new Complex64( realf(v)*2.0, imagf(v)*2.0 );\n* }\n*\n* var arr = Complex64Array.from( [ new Complex64( 1.0, 1.0 ) ], clbk );\n* // returns \n*\n* var len = arr.length;\n* // returns 1\n*/\nsetReadOnly( Complex64Array, 'from', function from( src ) {\n\tvar thisArg;\n\tvar nargs;\n\tvar clbk;\n\tvar out;\n\tvar buf;\n\tvar tmp;\n\tvar get;\n\tvar len;\n\tvar flg;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tnargs = arguments.length;\n\tif ( nargs > 1 ) {\n\t\tclbk = arguments[ 1 ];\n\t\tif ( !isFunction( clbk ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', clbk ) );\n\t\t}\n\t\tif ( nargs > 2 ) {\n\t\t\tthisArg = arguments[ 2 ];\n\t\t}\n\t}\n\tif ( isComplexArray( src ) ) {\n\t\tlen = src.length;\n\t\tif ( clbk ) {\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, src.get( i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isCollection( src ) ) {\n\t\tif ( clbk ) {\n\t\t\t// Note: array contents affect how we iterate over a provided data source. If only complex number objects, we can extract real and imaginary components. Otherwise, for non-complex number arrays (e.g., `Float64Array`, etc), we assume a strided array where real and imaginary components are interleaved. In the former case, we expect a callback to return real and imaginary components (possibly as a complex number). In the latter case, we expect a callback to return *either* a real or imaginary component.\n\n\t\t\tlen = src.length;\n\t\t\tif ( src.get && src.set ) {\n\t\t\t\tget = accessorGetter( 'default' );\n\t\t\t} else {\n\t\t\t\tget = getter( 'default' );\n\t\t\t}\n\t\t\t// Detect whether we've been provided an array which returns complex number objects...\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tif ( !isComplexLike( get( src, i ) ) ) {\n\t\t\t\t\tflg = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t// If an array does not contain only complex number objects, then we assume interleaved real and imaginary components...\n\t\t\tif ( flg ) {\n\t\t\t\tif ( !isEven( len ) ) {\n\t\t\t\t\tthrow new RangeError( format( 'invalid argument. First argument must have a length which is a multiple of %u. Length: `%u`.', 2, len ) );\n\t\t\t\t}\n\t\t\t\tout = new this( len/2 );\n\t\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\t\tbuf[ i ] = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\t}\n\t\t\t\treturn out;\n\t\t\t}\n\t\t\t// If an array contains only complex number objects, then we need to extract real and imaginary components...\n\t\t\tout = new this( len );\n\t\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\t\tv = clbk.call( thisArg, get( src, i ), i );\n\t\t\t\tif ( isComplexLike( v ) ) {\n\t\t\t\t\tbuf[ j ] = realf( v );\n\t\t\t\t\tbuf[ j+1 ] = imagf( v );\n\t\t\t\t} else if ( isArrayLikeObject( v ) && v.length >= 2 ) {\n\t\t\t\t\tbuf[ j ] = v[ 0 ];\n\t\t\t\t\tbuf[ j+1 ] = v[ 1 ];\n\t\t\t\t} else {\n\t\t\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t\t\t}\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn out;\n\t\t}\n\t\treturn new this( src );\n\t}\n\tif ( isObject( src ) && HAS_ITERATOR_SYMBOL && isFunction( src[ ITERATOR_SYMBOL ] ) ) { // eslint-disable-line max-len\n\t\tbuf = src[ ITERATOR_SYMBOL ]();\n\t\tif ( !isFunction( buf.next ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n\t\t}\n\t\tif ( clbk ) {\n\t\t\ttmp = fromIteratorMap( buf, clbk, thisArg );\n\t\t} else {\n\t\t\ttmp = fromIterator( buf );\n\t\t}\n\t\tif ( tmp instanceof Error ) {\n\t\t\tthrow tmp;\n\t\t}\n\t\tlen = tmp.length / 2;\n\t\tout = new this( len );\n\t\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tbuf[ i ] = tmp[ i ];\n\t\t}\n\t\treturn out;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.', src ) );\n});\n\n/**\n* Creates a new 64-bit complex number array from a variable number of arguments.\n*\n* @name of\n* @memberof Complex64Array\n* @type {Function}\n* @param {...*} element - array elements\n* @throws {TypeError} `this` context must be a constructor\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} 64-bit complex number array\n*\n* @example\n* var arr = Complex64Array.of( 1.0, 1.0, 1.0, 1.0 );\n* // returns \n*\n* var len = arr.length;\n* // returns 2\n*/\nsetReadOnly( Complex64Array, 'of', function of() {\n\tvar args;\n\tvar i;\n\tif ( !isFunction( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` context must be a constructor.' );\n\t}\n\tif ( !isComplexArrayConstructor( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\targs = [];\n\tfor ( i = 0; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn new this( args );\n});\n\n/**\n* Returns an array element with support for both nonnegative and negative integer indices.\n*\n* @name at\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide an integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var z = arr.at( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 9.0, -9.0 ], 9 );\n*\n* z = arr.at( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.at( -1 );\n* // returns \n*\n* re = realf( z );\n* // returns 9.0\n*\n* im = imagf( z );\n* // returns -9.0\n*\n* z = arr.at( 100 );\n* // returns undefined\n*\n* z = arr.at( -100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'at', function at( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide an integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx < 0 ) {\n\t\tidx += this._length;\n\t}\n\tif ( idx < 0 || idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Pointer to the underlying data buffer.\n*\n* @name buffer\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {ArrayBuffer}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var buf = arr.buffer;\n* // returns \n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'buffer', function get() {\n\treturn this._buffer.buffer;\n});\n\n/**\n* Size (in bytes) of the array.\n*\n* @name byteLength\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteLength = arr.byteLength;\n* // returns 80\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteLength', function get() {\n\treturn this._buffer.byteLength;\n});\n\n/**\n* Offset (in bytes) of the array from the start of its underlying `ArrayBuffer`.\n*\n* @name byteOffset\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var byteOffset = arr.byteOffset;\n* // returns 0\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'byteOffset', function get() {\n\treturn this._buffer.byteOffset;\n});\n\n/**\n* Size (in bytes) of each array element.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {PositiveInteger}\n* @default 8\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var nbytes = arr.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex64Array.prototype, 'BYTES_PER_ELEMENT', Complex64Array.BYTES_PER_ELEMENT );\n\n/**\n* Copies a sequence of elements within the array to the position starting at `target`.\n*\n* @name copyWithin\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} target - index at which to start copying elements\n* @param {integer} start - source index at which to copy elements from\n* @param {integer} [end] - source index at which to stop copying elements from\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} modified array\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 4 );\n*\n* // Set the array elements:\n* arr.set( new Complex64( 1.0, 1.0 ), 0 );\n* arr.set( new Complex64( 2.0, 2.0 ), 1 );\n* arr.set( new Complex64( 3.0, 3.0 ), 2 );\n* arr.set( new Complex64( 4.0, 4.0 ), 3 );\n*\n* // Copy the first two elements to the last two elements:\n* arr.copyWithin( 2, 0, 2 );\n*\n* // Get the last array element:\n* var z = arr.get( 3 );\n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'copyWithin', function copyWithin( target, start ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\t// FIXME: prefer a functional `copyWithin` implementation which addresses lack of universal browser support (e.g., IE11 and Safari) or ensure that typed arrays are polyfilled\n\tif ( arguments.length === 2 ) {\n\t\tthis._buffer.copyWithin( target*2, start*2 );\n\t} else {\n\t\tthis._buffer.copyWithin( target*2, start*2, arguments[2]*2 );\n\t}\n\treturn this;\n});\n\n/**\n* Returns an iterator for iterating over array key-value pairs.\n*\n* @name entries\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Iterator} iterator\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = [\n* new Complex64( 1.0, 1.0 ),\n* new Complex64( 2.0, 2.0 ),\n* new Complex64( 3.0, 3.0 )\n* ];\n* arr = new Complex64Array( arr );\n*\n* // Create an iterator:\n* var it = arr.entries();\n*\n* // Iterate over the key-value pairs...\n* var v = it.next().value;\n* // returns [ 0, ]\n*\n* v = it.next().value;\n* // returns [ 1, ]\n*\n* v = it.next().value;\n* // returns [ 2, ]\n*\n* var bool = it.next().done;\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'entries', function entries() {\n\tvar buffer;\n\tvar self;\n\tvar iter;\n\tvar len;\n\tvar FLG;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tself = this;\n\tbuffer = this._buffer;\n\tlen = this._length;\n\n\t// Initialize the iteration indices:\n\ti = -1;\n\tj = -2;\n\n\t// Create an iterator protocol-compliant object:\n\titer = {};\n\tsetReadOnly( iter, 'next', next );\n\tsetReadOnly( iter, 'return', end );\n\n\tif ( ITERATOR_SYMBOL ) {\n\t\tsetReadOnly( iter, ITERATOR_SYMBOL, factory );\n\t}\n\treturn iter;\n\n\t/**\n\t* Returns an iterator protocol-compliant object containing the next iterated value.\n\t*\n\t* @private\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction next() {\n\t\tvar z;\n\t\ti += 1;\n\t\tif ( FLG || i >= len ) {\n\t\t\treturn {\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\tj += 2;\n\t\tz = new Complex64( buffer[ j ], buffer[ j+1 ] );\n\t\treturn {\n\t\t\t'value': [ i, z ],\n\t\t\t'done': false\n\t\t};\n\t}\n\n\t/**\n\t* Finishes an iterator.\n\t*\n\t* @private\n\t* @param {*} [value] - value to return\n\t* @returns {Object} iterator protocol-compliant object\n\t*/\n\tfunction end( value ) {\n\t\tFLG = true;\n\t\tif ( arguments.length ) {\n\t\t\treturn {\n\t\t\t\t'value': value,\n\t\t\t\t'done': true\n\t\t\t};\n\t\t}\n\t\treturn {\n\t\t\t'done': true\n\t\t};\n\t}\n\n\t/**\n\t* Returns a new iterator.\n\t*\n\t* @private\n\t* @returns {Iterator} iterator\n\t*/\n\tfunction factory() {\n\t\treturn self.entries();\n\t}\n});\n\n/**\n* Tests whether all elements in an array pass a test implemented by a predicate function.\n*\n* @name every\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether all elements pass a test\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var bool = arr.every( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'every', function every( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( !predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n});\n\n/**\n* Returns a modified typed array filled with a fill value.\n*\n* @name fill\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} value - fill value\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @throws {TypeError} third argument must be an integer\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.fill( new Complex64( 1.0, 1.0 ), 1 );\n*\n* var z = arr.get( 1 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*\n* z = arr.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'fill', function fill( value, start, end ) {\n\tvar buf;\n\tvar len;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t} else {\n\t\t\tend = len;\n\t\t}\n\t} else {\n\t\tstart = 0;\n\t\tend = len;\n\t}\n\tre = realf( value );\n\tim = imagf( value );\n\tfor ( i = start; i < end; i++ ) {\n\t\tidx = 2*i;\n\t\tbuf[ idx ] = re;\n\t\tbuf[ idx+1 ] = im;\n\t}\n\treturn this;\n});\n\n/**\n* Returns a new array containing the elements of an array which pass a test implemented by a predicate function.\n*\n* @name filter\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.filter( predicate );\n* // returns \n*\n* var len = out.length;\n* // returns 1\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2.0\n*\n* var im = imagf( z );\n* // returns 2.0\n*/\nsetReadOnly( Complex64Array.prototype, 'filter', function filter( predicate, thisArg ) {\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tout = [];\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\tout.push( z );\n\t\t}\n\t}\n\treturn new this.constructor( out );\n});\n\n/**\n* Returns the first element in an array for which a predicate function returns a truthy value.\n*\n* @name find\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.find( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'find', function find( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the first element in an array for which a predicate function returns a truthy value.\n*\n* @name findIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var idx = arr.findIndex( predicate );\n* // returns 2\n*/\nsetReadOnly( Complex64Array.prototype, 'findIndex', function findIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLast\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {(Complex64|void)} array element or undefined\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.findLast( predicate );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'findLast', function findLast( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn z;\n\t\t}\n\t}\n});\n\n/**\n* Returns the index of the last element in an array for which a predicate function returns a truthy value.\n*\n* @name findLastIndex\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var idx = arr.findLastIndex( predicate );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'findLastIndex', function findLastIndex( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = this._length-1; i >= 0; i-- ) {\n\t\tz = getComplex64( buf, i );\n\t\tif ( predicate.call( thisArg, z, i, this ) ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Invokes a function once for each array element.\n*\n* @name forEach\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - function to invoke\n* @param {*} [thisArg] - function invocation context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* function log( v, i ) {\n* console.log( '%s: %s', i, v.toString() );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* arr.forEach( log );\n*/\nsetReadOnly( Complex64Array.prototype, 'forEach', function forEach( fcn, thisArg ) {\n\tvar buf;\n\tvar i;\n\tvar z;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tz = getComplex64( buf, i );\n\t\tfcn.call( thisArg, z, i, this );\n\t}\n});\n\n/**\n* Returns an array element.\n*\n* @name get\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {NonNegativeInteger} idx - element index\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} must provide a nonnegative integer\n* @returns {(Complex64|void)} array element\n*\n* @example\n* var arr = new Complex64Array( 10 );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*\n* z = arr.get( 100 );\n* // returns undefined\n*/\nsetReadOnly( Complex64Array.prototype, 'get', function get( idx ) {\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isNonNegativeInteger( idx ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a nonnegative integer. Value: `%s`.', idx ) );\n\t}\n\tif ( idx >= this._length ) {\n\t\treturn;\n\t}\n\treturn getComplex64( this._buffer, idx );\n});\n\n/**\n* Returns a boolean indicating whether an array includes a provided value.\n*\n* @name includes\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - search element\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {boolean} boolean indicating whether an array includes a provided value\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var bool = arr.includes( new Complex64( 3.0, -3.0 ) );\n* // returns true\n*\n* bool = arr.includes( new Complex64( 3.0, -3.0 ), 3 );\n* // returns false\n*\n* bool = arr.includes( new Complex64( 4.0, -4.0 ), -3 );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'includes', function includes( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @name indexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex=0] - starting index (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = new Complex64Array( 10 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var idx = arr.indexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 2\n*\n* idx = arr.indexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns -1\n*\n* idx = arr.indexOf( new Complex64( 4.0, -4.0 ), -3 );\n* // returns -1\n*/\nsetReadOnly( Complex64Array.prototype, 'indexOf', function indexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t\tif ( fromIndex < 0 ) {\n\t\t\t\tfromIndex = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfromIndex = 0;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i < this._length; i++ ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Returns a new string by concatenating all array elements.\n*\n* @name join\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {string} [separator=','] - element separator\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a string\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.join();\n* // returns '1 + 1i,2 + 2i'\n*\n* str = arr.join( '/' );\n* // returns '1 + 1i/2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'join', function join( separator ) {\n\tvar out;\n\tvar buf;\n\tvar sep;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( arguments.length === 0 ) {\n\t\tsep = ',';\n\t} else if ( isString( separator ) ) {\n\t\tsep = separator;\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', separator ) );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( sep );\n});\n\n/**\n* Returns the last index at which a given element can be found.\n*\n* @name lastIndexOf\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {ComplexLike} searchElement - element to find\n* @param {integer} [fromIndex] - index at which to start searching backward (inclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a complex number\n* @throws {TypeError} second argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 3.0, -3.0 ], 4 );\n*\n* var idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ) );\n* // returns 4\n*\n* idx = arr.lastIndexOf( new Complex64( 3.0, -3.0 ), 3 );\n* // returns 2\n*\n* idx = arr.lastIndexOf( new Complex64( 5.0, -5.0 ), 3 );\n* // returns -1\n*\n* idx = arr.lastIndexOf( new Complex64( 2.0, -2.0 ), -3 );\n* // returns 1\n*/\nsetReadOnly( Complex64Array.prototype, 'lastIndexOf', function lastIndexOf( searchElement, fromIndex ) {\n\tvar buf;\n\tvar idx;\n\tvar re;\n\tvar im;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isComplexLike( searchElement ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a complex number. Value: `%s`.', searchElement ) );\n\t}\n\tif ( arguments.length > 1 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= this._length ) {\n\t\t\tfromIndex = this._length - 1;\n\t\t} else if ( fromIndex < 0 ) {\n\t\t\tfromIndex += this._length;\n\t\t}\n\t} else {\n\t\tfromIndex = this._length - 1;\n\t}\n\tre = realf( searchElement );\n\tim = imagf( searchElement );\n\tbuf = this._buffer;\n\tfor ( i = fromIndex; i >= 0; i-- ) {\n\t\tidx = 2 * i;\n\t\tif ( re === buf[ idx ] && im === buf[ idx+1 ] ) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n});\n\n/**\n* Number of array elements.\n*\n* @name length\n* @memberof Complex64Array.prototype\n* @readonly\n* @type {NonNegativeInteger}\n*\n* @example\n* var arr = new Complex64Array( 10 );\n*\n* var len = arr.length;\n* // returns 10\n*/\nsetReadOnlyAccessor( Complex64Array.prototype, 'length', function get() {\n\treturn this._length;\n});\n\n/**\n* Returns a new array with each element being the result of a provided callback function.\n*\n* @name map\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} fcn - callback function\n* @param {*} [thisArg] - callback function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function scale( v, i ) {\n* return new Complex64( 2.0*realf( v ), 2.0*imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var out = arr.map( scale );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 2\n*\n* var im = imagf( z );\n* // returns -2\n*/\nsetReadOnly( Complex64Array.prototype, 'map', function map( fcn, thisArg ) {\n\tvar outbuf;\n\tvar buf;\n\tvar out;\n\tvar i;\n\tvar v;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( fcn ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', fcn ) );\n\t}\n\tbuf = this._buffer;\n\tout = new this.constructor( this._length );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tv = fcn.call( thisArg, getComplex64( buf, i ), i, this );\n\t\tif ( isComplexLike( v ) ) {\n\t\t\toutbuf[ 2*i ] = realf( v );\n\t\t\toutbuf[ (2*i)+1 ] = imagf( v );\n\t\t} else if ( isArrayLikeObject( v ) && v.length === 2 ) {\n\t\t\toutbuf[ 2*i ] = v[ 0 ];\n\t\t\toutbuf[ (2*i)+1 ] = v[ 1 ];\n\t\t} else {\n\t\t\tthrow new TypeError( format( 'invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.', v ) );\n\t\t}\n\t}\n\treturn out;\n});\n\n/**\n* Applies a provided callback function to each element of the array, in order, passing in the return value from the calculation on the preceding element and returning the accumulated result upon completion.\n*\n* @name reduce\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} reducer - callback function\n* @param {*} [initialValue] - initial value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @throws {Error} if not provided an initial value, the array must have at least one element\n* @returns {*} accumulated result\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var caddf = require( '@stdlib/math-base-ops-caddf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var z = arr.reduce( caddf );\n* // returns \n*\n* var re = realf( z );\n* // returns 6.0\n*\n* var im = imagf( z );\n* // returns 6.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reduce', function reduce( reducer, initialValue ) {\n\tvar buf;\n\tvar acc;\n\tvar len;\n\tvar v;\n\tvar i;\n\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( reducer ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', reducer ) );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length > 1 ) {\n\t\tacc = initialValue;\n\t\ti = 0;\n\t} else {\n\t\tif ( len === 0 ) {\n\t\t\tthrow new Error( 'invalid operation. If not provided an initial value, an array must contain at least one element.' );\n\t\t}\n\t\tacc = getComplex64( buf, 0 );\n\t\ti = 1;\n\t}\n\tfor ( ; i < len; i++ ) {\n\t\tv = getComplex64( buf, i );\n\t\tacc = reducer( acc, v, i, this );\n\t}\n\treturn acc;\n});\n\n/**\n* Reverses an array in-place.\n*\n* @name reverse\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.reverse();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'reverse', function reverse() {\n\tvar buf;\n\tvar tmp;\n\tvar len;\n\tvar N;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tbuf = this._buffer;\n\tN = floor( len / 2 );\n\tfor ( i = 0; i < N; i++ ) {\n\t\tj = len - i - 1;\n\t\ttmp = buf[ (2*i) ];\n\t\tbuf[ (2*i) ] = buf[ (2*j) ];\n\t\tbuf[ (2*j) ] = tmp;\n\t\ttmp = buf[ (2*i)+1 ];\n\t\tbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t\tbuf[ (2*j)+1 ] = tmp;\n\t}\n\treturn this;\n});\n\n/**\n* Sets an array element.\n*\n* ## Notes\n*\n* - When provided a typed array, real or complex, we must check whether the source array shares the same buffer as the target array and whether the underlying memory overlaps. In particular, we are concerned with the following scenario:\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* In the above, as we copy values from `src`, we will overwrite values in the `src` view, resulting in duplicated values copied into the end of `buf`, which is not intended. Hence, to avoid overwriting source values, we must **copy** source values to a temporary array.\n*\n* In the other overlapping scenario,\n*\n* ```text\n* buf: ---------------------\n* src: ---------------------\n* ```\n*\n* by the time we begin copying into the overlapping region, we are copying from the end of `src`, a non-overlapping region, which means we don't run the risk of copying copied values, rather than the original `src` values, as intended.\n*\n* @name set\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {(Collection|Complex|ComplexArray)} value - value(s)\n* @param {NonNegativeInteger} [i=0] - element index at which to start writing values\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be either a complex number, an array-like object, or a complex number array\n* @throws {TypeError} index argument must be a nonnegative integer\n* @throws {RangeError} array-like objects must have a length which is a multiple of two\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {RangeError} target array lacks sufficient storage to accommodate source values\n* @returns {void}\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 10 );\n*\n* var z = arr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 0.0\n*\n* var im = imagf( z );\n* // returns 0.0\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n*\n* z = arr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns -1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'set', function set( value ) {\n\t/* eslint-disable no-underscore-dangle */\n\tvar sbuf;\n\tvar idx;\n\tvar buf;\n\tvar tmp;\n\tvar flg;\n\tvar N;\n\tvar v;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tif ( arguments.length > 1 ) {\n\t\tidx = arguments[ 1 ];\n\t\tif ( !isNonNegativeInteger( idx ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Index argument must be a nonnegative integer. Value: `%s`.', idx ) );\n\t\t}\n\t} else {\n\t\tidx = 0;\n\t}\n\tif ( isComplexLike( value ) ) {\n\t\tif ( idx >= this._length ) {\n\t\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%u`.', idx ) );\n\t\t}\n\t\tidx *= 2;\n\t\tbuf[ idx ] = realf( value );\n\t\tbuf[ idx+1 ] = imagf( value );\n\t\treturn;\n\t}\n\tif ( isComplexArray( value ) ) {\n\t\tN = value._length;\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tsbuf = value._buffer;\n\n\t\t// Check for overlapping memory...\n\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\tif (\n\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t(\n\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t)\n\t\t) {\n\t\t\t// We need to copy source values...\n\t\t\ttmp = new Float32Array( sbuf.length );\n\t\t\tfor ( i = 0; i < sbuf.length; i++ ) {\n\t\t\t\ttmp[ i ] = sbuf[ i ];\n\t\t\t}\n\t\t\tsbuf = tmp;\n\t\t}\n\t\tidx *= 2;\n\t\tj = 0;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\tidx += 2; // stride\n\t\t\tj += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tif ( isCollection( value ) ) {\n\t\t// Detect whether we've been provided an array of complex numbers...\n\t\tN = value.length;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tif ( !isComplexLike( value[ i ] ) ) {\n\t\t\t\tflg = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t// If an array does not contain only complex numbers, then we assume interleaved real and imaginary components...\n\t\tif ( flg ) {\n\t\t\tif ( !isEven( N ) ) {\n\t\t\t\tthrow new RangeError( format( 'invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.', N ) );\n\t\t\t}\n\t\t\tif ( idx+(N/2) > this._length ) {\n\t\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t\t}\n\t\t\tsbuf = value;\n\n\t\t\t// Check for overlapping memory...\n\t\t\tj = buf.byteOffset + (idx*BYTES_PER_ELEMENT);\n\t\t\tif (\n\t\t\t\tsbuf.buffer === buf.buffer &&\n\t\t\t\t(\n\t\t\t\t\tsbuf.byteOffset < j &&\n\t\t\t\t\tsbuf.byteOffset+sbuf.byteLength > j\n\t\t\t\t)\n\t\t\t) {\n\t\t\t\t// We need to copy source values...\n\t\t\t\ttmp = new Float32Array( N );\n\t\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\t\ttmp[ i ] = sbuf[ i ]; // TODO: handle accessor arrays\n\t\t\t\t}\n\t\t\t\tsbuf = tmp;\n\t\t\t}\n\t\t\tidx *= 2;\n\t\t\tN /= 2;\n\t\t\tj = 0;\n\t\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\t\tbuf[ idx ] = sbuf[ j ];\n\t\t\t\tbuf[ idx+1 ] = sbuf[ j+1 ];\n\t\t\t\tidx += 2; // stride\n\t\t\t\tj += 2; // stride\n\t\t\t}\n\t\t\treturn;\n\t\t}\n\t\t// If an array contains only complex numbers, then we need to extract real and imaginary components...\n\t\tif ( idx+N > this._length ) {\n\t\t\tthrow new RangeError( 'invalid arguments. Target array lacks sufficient storage to accommodate source values.' );\n\t\t}\n\t\tidx *= 2;\n\t\tfor ( i = 0; i < N; i++ ) {\n\t\t\tv = value[ i ];\n\t\t\tbuf[ idx ] = realf( v );\n\t\t\tbuf[ idx+1 ] = imagf( v );\n\t\t\tidx += 2; // stride\n\t\t}\n\t\treturn;\n\t}\n\tthrow new TypeError( format( 'invalid argument. First argument must be either a complex number, an array-like object, or a complex number array. Value: `%s`.', value ) );\n\n\t/* eslint-enable no-underscore-dangle */\n});\n\n/**\n* Copies a portion of a typed array to a new typed array.\n*\n* @name slice\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [start=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} complex number array\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var out = arr.slice();\n* // returns \n*\n* var len = out.length;\n* // returns 5\n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* out = arr.slice( 1, -2 );\n* // returns \n*\n* len = out.length;\n* // returns 2\n*\n* z = out.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = out.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'slice', function slice( start, end ) {\n\tvar outlen;\n\tvar outbuf;\n\tvar out;\n\tvar idx;\n\tvar buf;\n\tvar len;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tstart = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( start ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', start ) );\n\t\t}\n\t\tif ( start < 0 ) {\n\t\t\tstart += len;\n\t\t\tif ( start < 0 ) {\n\t\t\t\tstart = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( start < end ) {\n\t\toutlen = end - start;\n\t} else {\n\t\toutlen = 0;\n\t}\n\tout = new this.constructor( outlen );\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < outlen; i++ ) {\n\t\tidx = 2*(i+start);\n\t\toutbuf[ 2*i ] = buf[ idx ];\n\t\toutbuf[ (2*i)+1 ] = buf[ idx+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Tests whether at least one element in an array passes a test implemented by a predicate function.\n*\n* @name some\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {Function} predicate - test function\n* @param {*} [thisArg] - predicate function execution context\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be a function\n* @returns {boolean} boolean indicating whether at least one element passes a test\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* function predicate( v ) {\n* return ( realf( v ) === imagf( v ) );\n* }\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n*\n* var bool = arr.some( predicate );\n* // returns true\n*/\nsetReadOnly( Complex64Array.prototype, 'some', function some( predicate, thisArg ) {\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isFunction( predicate ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a function. Value: `%s`.', predicate ) );\n\t}\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tif ( predicate.call( thisArg, getComplex64( buf, i ), i, this ) ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n});\n\n/**\n* Creates a new typed array view over the same underlying `ArrayBuffer` and with the same underlying data type as the host array.\n*\n* @name subarray\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} [begin=0] - starting index (inclusive)\n* @param {integer} [end] - ending index (exclusive)\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {TypeError} second argument must be an integer\n* @returns {Complex64Array} subarray\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 5 );\n*\n* arr.set( [ 1.0, -1.0 ], 0 );\n* arr.set( [ 2.0, -2.0 ], 1 );\n* arr.set( [ 3.0, -3.0 ], 2 );\n* arr.set( [ 4.0, -4.0 ], 3 );\n* arr.set( [ 5.0, -5.0 ], 4 );\n*\n* var subarr = arr.subarray();\n* // returns \n*\n* var len = subarr.length;\n* // returns 5\n*\n* var z = subarr.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 1.0\n*\n* var im = imagf( z );\n* // returns -1.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 5.0\n*\n* im = imagf( z );\n* // returns -5.0\n*\n* subarr = arr.subarray( 1, -2 );\n* // returns \n*\n* len = subarr.length;\n* // returns 2\n*\n* z = subarr.get( 0 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns -2.0\n*\n* z = subarr.get( len-1 );\n* // returns \n*\n* re = realf( z );\n* // returns 3.0\n*\n* im = imagf( z );\n* // returns -3.0\n*/\nsetReadOnly( Complex64Array.prototype, 'subarray', function subarray( begin, end ) {\n\tvar offset;\n\tvar buf;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tbuf = this._buffer;\n\tlen = this._length;\n\tif ( arguments.length === 0 ) {\n\t\tbegin = 0;\n\t\tend = len;\n\t} else {\n\t\tif ( !isInteger( begin ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', begin ) );\n\t\t}\n\t\tif ( begin < 0 ) {\n\t\t\tbegin += len;\n\t\t\tif ( begin < 0 ) {\n\t\t\t\tbegin = 0;\n\t\t\t}\n\t\t}\n\t\tif ( arguments.length === 1 ) {\n\t\t\tend = len;\n\t\t} else {\n\t\t\tif ( !isInteger( end ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Second argument must be an integer. Value: `%s`.', end ) );\n\t\t\t}\n\t\t\tif ( end < 0 ) {\n\t\t\t\tend += len;\n\t\t\t\tif ( end < 0 ) {\n\t\t\t\t\tend = 0;\n\t\t\t\t}\n\t\t\t} else if ( end > len ) {\n\t\t\t\tend = len;\n\t\t\t}\n\t\t}\n\t}\n\tif ( begin >= len ) {\n\t\tlen = 0;\n\t\toffset = buf.byteLength;\n\t} else if ( begin >= end ) {\n\t\tlen = 0;\n\t\toffset = buf.byteOffset + (begin*BYTES_PER_ELEMENT);\n\t} else {\n\t\tlen = end - begin;\n\t\toffset = buf.byteOffset + ( begin*BYTES_PER_ELEMENT );\n\t}\n\treturn new this.constructor( buf.buffer, offset, ( len < 0 ) ? 0 : len );\n});\n\n/**\n* Returns a new typed array containing the elements in reversed order.\n*\n* @name toReversed\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {Complex64Array} reversed array\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.toReversed();\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 3.0\n*\n* var im = imagf( z );\n* // returns 3.0\n*\n* z = out.get( 1 );\n* // returns \n*\n* re = realf( z );\n* // returns 2.0\n*\n* im = imagf( z );\n* // returns 2.0\n*\n* z = out.get( 2 );\n* // returns \n*\n* re = realf( z );\n* // returns 1.0\n*\n* im = imagf( z );\n* // returns 1.0\n*/\nsetReadOnly( Complex64Array.prototype, 'toReversed', function toReversed() {\n\tvar outbuf;\n\tvar out;\n\tvar len;\n\tvar buf;\n\tvar i;\n\tvar j;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tlen = this._length;\n\tout = new this.constructor( len );\n\tbuf = this._buffer;\n\toutbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tfor ( i = 0; i < len; i++ ) {\n\t\tj = len - i - 1;\n\t\toutbuf[ (2*i) ] = buf[ (2*j) ];\n\t\toutbuf[ (2*i)+1 ] = buf[ (2*j)+1 ];\n\t}\n\treturn out;\n});\n\n/**\n* Serializes an array as a string.\n*\n* @name toString\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @throws {TypeError} `this` must be a complex number array\n* @returns {string} string representation\n*\n* @example\n* var arr = new Complex64Array( 2 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n*\n* var str = arr.toString();\n* // returns '1 + 1i,2 + 2i'\n*/\nsetReadOnly( Complex64Array.prototype, 'toString', function toString() {\n\tvar out;\n\tvar buf;\n\tvar i;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tout = [];\n\tbuf = this._buffer;\n\tfor ( i = 0; i < this._length; i++ ) {\n\t\tout.push( getComplex64( buf, i ).toString() );\n\t}\n\treturn out.join( ',' );\n});\n\n/**\n* Returns a new typed array with the element at a provided index replaced with a provided value.\n*\n* @name with\n* @memberof Complex64Array.prototype\n* @type {Function}\n* @param {integer} index - element index\n* @param {ComplexLike} value - new value\n* @throws {TypeError} `this` must be a complex number array\n* @throws {TypeError} first argument must be an integer\n* @throws {RangeError} index argument is out-of-bounds\n* @throws {TypeError} second argument must be a complex number\n* @returns {Complex64Array} new typed array\n*\n* @example\n* var realf = require( '@stdlib/complex-realf' );\n* var imagf = require( '@stdlib/complex-imagf' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var arr = new Complex64Array( 3 );\n*\n* arr.set( [ 1.0, 1.0 ], 0 );\n* arr.set( [ 2.0, 2.0 ], 1 );\n* arr.set( [ 3.0, 3.0 ], 2 );\n*\n* var out = arr.with( 0, new Complex64( 4.0, 4.0 ) );\n* // returns \n*\n* var z = out.get( 0 );\n* // returns \n*\n* var re = realf( z );\n* // returns 4.0\n*\n* var im = imagf( z );\n* // returns 4.0\n*/\nsetReadOnly( Complex64Array.prototype, 'with', function copyWith( index, value ) {\n\tvar buf;\n\tvar out;\n\tvar len;\n\tif ( !isComplexArray( this ) ) {\n\t\tthrow new TypeError( 'invalid invocation. `this` is not a complex number array.' );\n\t}\n\tif ( !isInteger( index ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an integer. Value: `%s`.', index ) );\n\t}\n\tlen = this._length;\n\tif ( index < 0 ) {\n\t\tindex += len;\n\t}\n\tif ( index < 0 || index >= len ) {\n\t\tthrow new RangeError( format( 'invalid argument. Index argument is out-of-bounds. Value: `%s`.', index ) );\n\t}\n\tif ( !isComplexLike( value ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be a complex number. Value: `%s`.', value ) );\n\t}\n\tout = new this.constructor( this._buffer );\n\tbuf = out._buffer; // eslint-disable-line no-underscore-dangle\n\tbuf[ 2*index ] = realf( value );\n\tbuf[ (2*index)+1 ] = imagf( value );\n\treturn out;\n});\n\n\n// EXPORTS //\n\nmodule.exports = Complex64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Mapping from array constructors to data types...\nvar ctor2dtypes = {\n\t'Float32Array': 'float32',\n\t'Float64Array': 'float64',\n\t'Array': 'generic',\n\t'Int16Array': 'int16',\n\t'Int32Array': 'int32',\n\t'Int8Array': 'int8',\n\t'Uint16Array': 'uint16',\n\t'Uint32Array': 'uint32',\n\t'Uint8Array': 'uint8',\n\t'Uint8ClampedArray': 'uint8c',\n\t'Complex64Array': 'complex64',\n\t'Complex128Array': 'complex128'\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctor2dtypes;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( '@stdlib/array-float64' );\nvar Float32Array = require( '@stdlib/array-float32' );\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Int32Array = require( '@stdlib/array-int32' );\nvar Uint16Array = require( '@stdlib/array-uint16' );\nvar Int16Array = require( '@stdlib/array-int16' );\nvar Uint8Array = require( '@stdlib/array-uint8' );\nvar Uint8ClampedArray = require( '@stdlib/array-uint8c' );\nvar Int8Array = require( '@stdlib/array-int8' );\nvar Complex64Array = require( '@stdlib/array-complex64' );\nvar Complex128Array = require( '@stdlib/array-complex128' );\n\n\n// MAIN //\n\n// Note: order should match `dtypes` order\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray,\n\tComplex64Array,\n\tComplex128Array\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n// Note: order should match `ctors` order\nvar DTYPES = [\n\t'float64',\n\t'float32',\n\t'int32',\n\t'uint32',\n\t'int16',\n\t'uint16',\n\t'int8',\n\t'uint8',\n\t'uint8c',\n\t'complex64',\n\t'complex128'\n];\n\n\n// EXPORTS //\n\nmodule.exports = DTYPES;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the data type of an array.\n*\n* @module @stdlib/array-dtype\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var dtype = require( '@stdlib/array-dtype' );\n*\n* var arr = new Float64Array( 10 );\n*\n* var dt = dtype( arr );\n* // returns 'float64'\n*\n* dt = dtype( {} );\n* // returns null\n*\n* dt = dtype( 'beep' );\n* // returns null\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isBuffer = require( '@stdlib/assert-is-buffer' );\nvar isArray = require( '@stdlib/assert-is-array' );\nvar constructorName = require( '@stdlib/utils-constructor-name' );\nvar ctor2dtype = require( './ctor2dtype.js' );\nvar CTORS = require( './ctors.js' );\nvar DTYPES = require( './dtypes.js' );\n\n\n// VARIABLES //\n\nvar NTYPES = DTYPES.length;\n\n\n// MAIN //\n\n/**\n* Returns the data type of an array.\n*\n* @param {*} value - input value\n* @returns {(string|null)} data type\n*\n* @example\n* var dt = dtype( [ 1, 2, 3 ] );\n* // returns 'generic'\n*\n* var dt = dtype( 'beep' );\n* // returns null\n*/\nfunction dtype( value ) {\n\tvar i;\n\tif ( isArray( value ) ) {\n\t\treturn 'generic';\n\t}\n\tif ( isBuffer( value ) ) {\n\t\treturn null;\n\t}\n\tfor ( i = 0; i < NTYPES; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn DTYPES[ i ];\n\t\t}\n\t}\n\t// If the above failed, fall back to a more robust (and significantly slower) means for resolving underlying data types:\n\treturn ctor2dtype[ constructorName( value ) ] || null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = dtype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of single-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float32\n*\n* @example\n* var ctor = require( '@stdlib/array-float32' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasFloat32ArraySupport = require( '@stdlib/assert-has-float32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float32Array === 'function' ) ? Float32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of single-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of double-precision floating-point numbers in the platform byte order.\n*\n* @module @stdlib/array-float64\n*\n* @example\n* var ctor = require( '@stdlib/array-float64' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasFloat64ArraySupport = require( '@stdlib/assert-has-float64array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasFloat64ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Float64Array === 'function' ) ? Float64Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of double-precision floating-point numbers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int16\n*\n* @example\n* var ctor = require( '@stdlib/array-int16' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt16ArraySupport = require( '@stdlib/assert-has-int16array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int16Array === 'function' ) ? Int16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 16-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int32\n*\n* @example\n* var ctor = require( '@stdlib/array-int32' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt32ArraySupport = require( '@stdlib/assert-has-int32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int32Array === 'function' ) ? Int32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 32-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @module @stdlib/array-int8\n*\n* @example\n* var ctor = require( '@stdlib/array-int8' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt8ArraySupport = require( '@stdlib/assert-has-int8array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasInt8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Int8Array === 'function' ) ? Int8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of twos-complement 8-bit signed integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Int8Array = require( '@stdlib/array-int8' );\nvar Uint8Array = require( '@stdlib/array-uint8' );\nvar Uint8ClampedArray = require( '@stdlib/array-uint8c' );\nvar Int16Array = require( '@stdlib/array-int16' );\nvar Uint16Array = require( '@stdlib/array-uint16' );\nvar Int32Array = require( '@stdlib/array-int32' );\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float32Array = require( '@stdlib/array-float32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar Complex64Array = require( '@stdlib/array-complex64' );\nvar Complex128Array = require( '@stdlib/array-complex128' );\n\n\n// MAIN //\n\nvar CTORS = [\n\t[ Float64Array, 'Float64Array' ],\n\t[ Float32Array, 'Float32Array' ],\n\t[ Int32Array, 'Int32Array' ],\n\t[ Uint32Array, 'Uint32Array' ],\n\t[ Int16Array, 'Int16Array' ],\n\t[ Uint16Array, 'Uint16Array' ],\n\t[ Int8Array, 'Int8Array' ],\n\t[ Uint8Array, 'Uint8Array' ],\n\t[ Uint8ClampedArray, 'Uint8ClampedArray' ],\n\t[ Complex64Array, 'Complex64Array' ],\n\t[ Complex128Array, 'Complex128Array' ]\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a JSON representation of a typed array.\n*\n* @module @stdlib/array-to-json\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var typedarray2json = require( '@stdlib/array-to-json' );\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isTypedArray = require( '@stdlib/assert-is-typed-array' );\nvar isComplexTypedArray = require( '@stdlib/assert-is-complex-typed-array' );\nvar reinterpret64 = require( '@stdlib/strided-base-reinterpret-complex64' );\nvar reinterpret128 = require( '@stdlib/strided-base-reinterpret-complex128' );\nvar format = require( '@stdlib/string-format' );\nvar typeName = require( './type.js' );\n\n\n// MAIN //\n\n/**\n* Returns a JSON representation of a typed array.\n*\n* ## Notes\n*\n* - We build a JSON object representing a typed array similar to how Node.js `Buffer` objects are represented. See [Buffer][1].\n*\n* [1]: https://nodejs.org/api/buffer.html#buffer_buf_tojson\n*\n* @param {TypedArray} arr - typed array to serialize\n* @throws {TypeError} first argument must be a typed array\n* @returns {Object} JSON representation\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var arr = new Float64Array( [ 5.0, 3.0 ] );\n* var json = typedarray2json( arr );\n* // returns { 'type': 'Float64Array', 'data': [ 5.0, 3.0 ] }\n*/\nfunction typedarray2json( arr ) {\n\tvar data;\n\tvar out;\n\tvar i;\n\n\tif ( isTypedArray( arr ) ) {\n\t\tdata = arr;\n\t} else if ( isComplexTypedArray( arr ) ) {\n\t\tif ( arr.BYTES_PER_ELEMENT === 8 ) {\n\t\t\tdata = reinterpret64( arr, 0 );\n\t\t} else { // arr.BYTES_PER_ELEMENT === 16\n\t\t\tdata = reinterpret128( arr, 0 );\n\t\t}\n\t} else {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a typed array. Value: `%s`.', arr ) );\n\t}\n\tout = {\n\t\t'type': typeName( arr ),\n\t\t'data': []\n\t};\n\tfor ( i = 0; i < data.length; i++ ) {\n\t\tout.data.push( data[ i ] );\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = typedarray2json;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar instanceOf = require( '@stdlib/assert-instance-of' );\nvar ctorName = require( '@stdlib/utils-constructor-name' );\nvar getPrototypeOf = require( '@stdlib/utils-get-prototype-of' );\nvar CTORS = require( './ctors.js' );\n\n\n// MAIN //\n\n/**\n* Returns the typed array type.\n*\n* @private\n* @param {TypedArray} arr - typed array\n* @returns {(string|void)} typed array type\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n*\n* var arr = new Float64Array( 5 );\n* var str = typeName( arr );\n* // returns 'Float64Array'\n*/\nfunction typeName( arr ) {\n\tvar v;\n\tvar i;\n\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( instanceOf( arr, CTORS[ i ][ 0 ] ) ) {\n\t\t\treturn CTORS[ i ][ 1 ];\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired native class...\n\twhile ( arr ) {\n\t\tv = ctorName( arr );\n\t\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\t\tif ( v === CTORS[ i ][ 1 ] ) {\n\t\t\t\treturn CTORS[ i ][ 1 ];\n\t\t\t}\n\t\t}\n\t\tarr = getPrototypeOf( arr );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 16-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint16\n*\n* @example\n* var ctor = require( '@stdlib/array-uint16' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint16ArraySupport = require( '@stdlib/assert-has-uint16array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint16ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint16Array === 'function' ) ? Uint16Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 16-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 32-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint32\n*\n* @example\n* var ctor = require( '@stdlib/array-uint32' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint32ArraySupport = require( '@stdlib/assert-has-uint32array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint32ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint32Array === 'function' ) ? Uint32Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 32-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order.\n*\n* @module @stdlib/array-uint8\n*\n* @example\n* var ctor = require( '@stdlib/array-uint8' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint8ArraySupport = require( '@stdlib/assert-has-uint8array-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8Array === 'function' ) ? Uint8Array : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Typed array constructor which returns a typed array representing an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @module @stdlib/array-uint8c\n*\n* @example\n* var ctor = require( '@stdlib/array-uint8c' );\n*\n* var arr = new ctor( 10 );\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint8ClampedArraySupport = require( '@stdlib/assert-has-uint8clampedarray-support' ); // eslint-disable-line id-length\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar ctor;\nif ( hasUint8ClampedArraySupport() ) {\n\tctor = builtin;\n} else {\n\tctor = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar ctor = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = ctor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: write polyfill\n\n// MAIN //\n\n/**\n* Typed array which represents an array of 8-bit unsigned integers in the platform byte order clamped to 0-255.\n*\n* @throws {Error} not implemented\n*/\nfunction polyfill() {\n\tthrow new Error( 'not implemented' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = polyfill;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float32Array === 'function' ) ? Float32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Float32Array` support.\n*\n* @module @stdlib/assert-has-float32array-support\n*\n* @example\n* var hasFloat32ArraySupport = require( '@stdlib/assert-has-float32array-support' );\n*\n* var bool = hasFloat32ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasFloat32ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasFloat32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFloat32Array = require( '@stdlib/assert-is-float32array' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar GlobalFloat32Array = require( './float32array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Float32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float32Array` support\n*\n* @example\n* var bool = hasFloat32ArraySupport();\n* // returns \n*/\nfunction hasFloat32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat32Array( [ 1.0, 3.14, -3.14, 5.0e40 ] );\n\t\tbool = (\n\t\t\tisFloat32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.140000104904175 &&\n\t\t\tarr[ 2 ] === -3.140000104904175 &&\n\t\t\tarr[ 3 ] === PINF\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasFloat32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Float64Array === 'function' ) ? Float64Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Float64Array` support.\n*\n* @module @stdlib/assert-has-float64array-support\n*\n* @example\n* var hasFloat64ArraySupport = require( '@stdlib/assert-has-float64array-support' );\n*\n* var bool = hasFloat64ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasFloat64ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFloat64Array = require( '@stdlib/assert-is-float64array' );\nvar GlobalFloat64Array = require( './float64array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Float64Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Float64Array` support\n*\n* @example\n* var bool = hasFloat64ArraySupport();\n* // returns \n*/\nfunction hasFloat64ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalFloat64Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalFloat64Array( [ 1.0, 3.14, -3.14, NaN ] );\n\t\tbool = (\n\t\t\tisFloat64Array( arr ) &&\n\t\t\tarr[ 0 ] === 1.0 &&\n\t\t\tarr[ 1 ] === 3.14 &&\n\t\t\tarr[ 2 ] === -3.14 &&\n\t\t\tarr[ 3 ] !== arr[ 3 ]\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasFloat64ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Dummy function.\n*\n* @private\n*/\nfunction foo() {\n\t// No-op...\n}\n\n\n// EXPORTS //\n\nmodule.exports = foo;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native function `name` support.\n*\n* @module @stdlib/assert-has-function-name-support\n*\n* @example\n* var hasFunctionNameSupport = require( '@stdlib/assert-has-function-name-support' );\n*\n* var bool = hasFunctionNameSupport();\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar foo = require( './foo.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native function `name` support.\n*\n* @returns {boolean} boolean indicating if an environment has function `name` support\n*\n* @example\n* var bool = hasFunctionNameSupport();\n* // returns \n*/\nfunction hasFunctionNameSupport() {\n\treturn ( foo.name === 'foo' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasFunctionNameSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Int16Array` support.\n*\n* @module @stdlib/assert-has-int16array-support\n*\n* @example\n* var hasInt16ArraySupport = require( '@stdlib/assert-has-int16array-support' );\n*\n* var bool = hasInt16ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt16ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int16Array === 'function' ) ? Int16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInt16Array = require( '@stdlib/assert-is-int16array' );\nvar INT16_MAX = require( '@stdlib/constants-int16-max' );\nvar INT16_MIN = require( '@stdlib/constants-int16-min' );\nvar GlobalInt16Array = require( './int16array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Int16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int16Array` support\n*\n* @example\n* var bool = hasInt16ArraySupport();\n* // returns \n*/\nfunction hasInt16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt16Array( [ 1, 3.14, -3.14, INT16_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT16_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasInt16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Int32Array` support.\n*\n* @module @stdlib/assert-has-int32array-support\n*\n* @example\n* var hasInt32ArraySupport = require( '@stdlib/assert-has-int32array-support' );\n*\n* var bool = hasInt32ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt32ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int32Array === 'function' ) ? Int32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInt32Array = require( '@stdlib/assert-is-int32array' );\nvar INT32_MAX = require( '@stdlib/constants-int32-max' );\nvar INT32_MIN = require( '@stdlib/constants-int32-min' );\nvar GlobalInt32Array = require( './int32array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Int32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int32Array` support\n*\n* @example\n* var bool = hasInt32ArraySupport();\n* // returns \n*/\nfunction hasInt32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt32Array( [ 1, 3.14, -3.14, INT32_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT32_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasInt32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Int8Array` support.\n*\n* @module @stdlib/assert-has-int8array-support\n*\n* @example\n* var hasInt8ArraySupport = require( '@stdlib/assert-has-int8array-support' );\n*\n* var bool = hasInt8ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasInt8ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Int8Array === 'function' ) ? Int8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInt8Array = require( '@stdlib/assert-is-int8array' );\nvar INT8_MAX = require( '@stdlib/constants-int8-max' );\nvar INT8_MIN = require( '@stdlib/constants-int8-min' );\nvar GlobalInt8Array = require( './int8array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Int8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Int8Array` support\n*\n* @example\n* var bool = hasInt8ArraySupport();\n* // returns \n*/\nfunction hasInt8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalInt8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalInt8Array( [ 1, 3.14, -3.14, INT8_MAX+1 ] );\n\t\tbool = (\n\t\t\tisInt8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === -3 && // truncation\n\t\t\tarr[ 3 ] === INT8_MIN // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasInt8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Symbol.iterator` support.\n*\n* @module @stdlib/assert-has-iterator-symbol-support\n*\n* @example\n* var hasIteratorSymbolSupport = require( '@stdlib/assert-has-iterator-symbol-support' );\n*\n* var bool = hasIteratorSymbolSupport();\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar Symbol = require( '@stdlib/symbol-ctor' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Symbol.iterator` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol.iterator` support\n*\n* @example\n* var bool = hasIteratorSymbolSupport();\n* // returns \n*/\nfunction hasIteratorSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol' &&\n\t\thasOwnProp( Symbol, 'iterator' ) &&\n\t\ttypeof Symbol.iterator === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasIteratorSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether an object has a specified property.\n*\n* @module @stdlib/assert-has-own-property\n*\n* @example\n* var hasOwnProp = require( '@stdlib/assert-has-own-property' );\n*\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* bool = hasOwnProp( beep, 'bop' );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\nvar has = Object.prototype.hasOwnProperty;\n\n\n// MAIN //\n\n/**\n* Tests if an object has a specified property.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object has a specified property\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = hasOwnProp( beep, 'bap' );\n* // returns false\n*/\nfunction hasOwnProp( value, property ) {\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\treturn has.call( value, property );\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasOwnProp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Symbol` support.\n*\n* @module @stdlib/assert-has-symbol-support\n*\n* @example\n* var hasSymbolSupport = require( '@stdlib/assert-has-symbol-support' );\n*\n* var bool = hasSymbolSupport();\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests for native `Symbol` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Symbol` support\n*\n* @example\n* var bool = hasSymbolSupport();\n* // returns \n*/\nfunction hasSymbolSupport() {\n\treturn (\n\t\ttypeof Symbol === 'function' &&\n\t\ttypeof Symbol( 'foo' ) === 'symbol'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasSymbolSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `toStringTag` support.\n*\n* @module @stdlib/assert-has-tostringtag-support\n*\n* @example\n* var hasToStringTagSupport = require( '@stdlib/assert-has-tostringtag-support' );\n*\n* var bool = hasToStringTagSupport();\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasSymbols = require( '@stdlib/assert-has-symbol-support' );\n\n\n// VARIABLES //\n\nvar FLG = hasSymbols();\n\n\n// MAIN //\n\n/**\n* Tests for native `toStringTag` support.\n*\n* @returns {boolean} boolean indicating if an environment has `toStringTag` support\n*\n* @example\n* var bool = hasToStringTagSupport();\n* // returns \n*/\nfunction hasToStringTagSupport() {\n\treturn ( FLG && typeof Symbol.toStringTag === 'symbol' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasToStringTagSupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Uint16Array` support.\n*\n* @module @stdlib/assert-has-uint16array-support\n*\n* @example\n* var hasUint16ArraySupport = require( '@stdlib/assert-has-uint16array-support' );\n*\n* var bool = hasUint16ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint16ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isUint16Array = require( '@stdlib/assert-is-uint16array' );\nvar UINT16_MAX = require( '@stdlib/constants-uint16-max' );\nvar GlobalUint16Array = require( './uint16array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint16Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint16Array` support\n*\n* @example\n* var bool = hasUint16ArraySupport();\n* // returns \n*/\nfunction hasUint16ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint16Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT16_MAX+1, UINT16_MAX+2 ];\n\t\tarr = new GlobalUint16Array( arr );\n\t\tbool = (\n\t\t\tisUint16Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT16_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasUint16ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint16Array === 'function' ) ? Uint16Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Uint32Array` support.\n*\n* @module @stdlib/assert-has-uint32array-support\n*\n* @example\n* var hasUint32ArraySupport = require( '@stdlib/assert-has-uint32array-support' );\n*\n* var bool = hasUint32ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint32ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isUint32Array = require( '@stdlib/assert-is-uint32array' );\nvar UINT32_MAX = require( '@stdlib/constants-uint32-max' );\nvar GlobalUint32Array = require( './uint32array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint32Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint32Array` support\n*\n* @example\n* var bool = hasUint32ArraySupport();\n* // returns \n*/\nfunction hasUint32ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint32Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT32_MAX+1, UINT32_MAX+2 ];\n\t\tarr = new GlobalUint32Array( arr );\n\t\tbool = (\n\t\t\tisUint32Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT32_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasUint32ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint32Array === 'function' ) ? Uint32Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Uint8Array` support.\n*\n* @module @stdlib/assert-has-uint8array-support\n*\n* @example\n* var hasUint8ArraySupport = require( '@stdlib/assert-has-uint8array-support' );\n*\n* var bool = hasUint8ArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint8ArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasUint8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isUint8Array = require( '@stdlib/assert-is-uint8array' );\nvar UINT8_MAX = require( '@stdlib/constants-uint8-max' );\nvar GlobalUint8Array = require( './uint8array.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8Array` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8Array` support\n*\n* @example\n* var bool = hasUint8ArraySupport();\n* // returns \n*/\nfunction hasUint8ArraySupport() {\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8Array !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = [ 1, 3.14, -3.14, UINT8_MAX+1, UINT8_MAX+2 ];\n\t\tarr = new GlobalUint8Array( arr );\n\t\tbool = (\n\t\t\tisUint8Array( arr ) &&\n\t\t\tarr[ 0 ] === 1 &&\n\t\t\tarr[ 1 ] === 3 && // truncation\n\t\t\tarr[ 2 ] === UINT8_MAX-2 && // truncation and wrap around\n\t\t\tarr[ 3 ] === 0 && // wrap around\n\t\t\tarr[ 4 ] === 1 // wrap around\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasUint8ArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8Array === 'function' ) ? Uint8Array : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test for native `Uint8ClampedArray` support.\n*\n* @module @stdlib/assert-has-uint8clampedarray-support\n*\n* @example\n* var hasUint8ClampedArraySupport = require( '@stdlib/assert-has-uint8clampedarray-support' );\n*\n* var bool = hasUint8ClampedArraySupport();\n* // returns \n*/\n\n// MODULES //\n\nvar hasUint8ClampedArraySupport = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isUint8ClampedArray = require( '@stdlib/assert-is-uint8clampedarray' );\nvar GlobalUint8ClampedArray = require( './uint8clampedarray.js' );\n\n\n// MAIN //\n\n/**\n* Tests for native `Uint8ClampedArray` support.\n*\n* @returns {boolean} boolean indicating if an environment has `Uint8ClampedArray` support\n*\n* @example\n* var bool = hasUint8ClampedArraySupport();\n* // returns \n*/\nfunction hasUint8ClampedArraySupport() { // eslint-disable-line id-length\n\tvar bool;\n\tvar arr;\n\n\tif ( typeof GlobalUint8ClampedArray !== 'function' ) {\n\t\treturn false;\n\t}\n\t// Test basic support...\n\ttry {\n\t\tarr = new GlobalUint8ClampedArray( [ -1, 0, 1, 3.14, 4.99, 255, 256 ] );\n\t\tbool = (\n\t\t\tisUint8ClampedArray( arr ) &&\n\t\t\tarr[ 0 ] === 0 && // clamped\n\t\t\tarr[ 1 ] === 0 &&\n\t\t\tarr[ 2 ] === 1 &&\n\t\t\tarr[ 3 ] === 3 && // round to nearest\n\t\t\tarr[ 4 ] === 5 && // round to nearest\n\t\t\tarr[ 5 ] === 255 &&\n\t\t\tarr[ 6 ] === 255 // clamped\n\t\t);\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\tbool = false;\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasUint8ClampedArraySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Uint8ClampedArray === 'function' ) ? Uint8ClampedArray : null; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether a value has in its prototype chain a specified constructor as a prototype property.\n*\n* @module @stdlib/assert-instance-of\n*\n* @example\n* var instanceOf = require( '@stdlib/assert-instance-of' );\n*\n* var bool = instanceOf( [], Array );\n* // returns true\n*\n* bool = instanceOf( {}, Object ); // exception\n* // returns true\n*\n* bool = instanceOf( 'beep', String );\n* // returns false\n*\n* bool = instanceOf( null, Object );\n* // returns false\n*\n* bool = instanceOf( 5, Object );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Tests whether a value has in its prototype chain a specified constructor as a prototype property.\n*\n* @param {*} value - value to test\n* @param {Function} constructor - constructor to test against\n* @throws {TypeError} constructor must be callable\n* @returns {boolean} boolean indicating whether a value is an instance of a provided constructor\n*\n* @example\n* var bool = instanceOf( [], Array );\n* // returns true\n*\n* @example\n* var bool = instanceOf( {}, Object ); // exception\n* // returns true\n*\n* @example\n* var bool = instanceOf( 'beep', String );\n* // returns false\n*\n* @example\n* var bool = instanceOf( null, Object );\n* // returns false\n*\n* @example\n* var bool = instanceOf( 5, Object );\n* // returns false\n*/\nfunction instanceOf( value, constructor ) {\n\t// TODO: replace with `isCallable` check\n\tif ( typeof constructor !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Second argument must be callable. Value: `%s`.', constructor ) );\n\t}\n\treturn ( value instanceof constructor );\n}\n\n\n// EXPORTS //\n\nmodule.exports = instanceOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArguments = require( './main.js' );\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment returns the expected internal class of the `arguments` object.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment behaves as expected\n*\n* @example\n* var bool = detect();\n* // returns \n*/\nfunction detect() {\n\treturn isArguments( arguments );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an `arguments` object.\n*\n* @module @stdlib/assert-is-arguments\n*\n* @example\n* var isArguments = require( '@stdlib/assert-is-arguments' );\n*\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* bool = isArguments( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar hasArgumentsClass = require( './detect.js' );\nvar main = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar isArguments;\nif ( hasArgumentsClass ) {\n\tisArguments = main;\n} else {\n\tisArguments = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn ( nativeClass( value ) === '[object Arguments]' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isEnumerableProperty = require( '@stdlib/assert-is-enumerable-property' );\nvar isArray = require( '@stdlib/assert-is-array' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar MAX_LENGTH = require( '@stdlib/constants-uint32-max' );\n\n\n// MAIN //\n\n/**\n* Tests whether a value is an `arguments` object.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is an `arguments` object\n*\n* @example\n* function foo() {\n* return arguments;\n* }\n*\n* var bool = isArguments( foo() );\n* // returns true\n*\n* @example\n* var bool = isArguments( [] );\n* // returns false\n*/\nfunction isArguments( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object' &&\n\t\t!isArray( value ) &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH &&\n\t\thasOwnProp( value, 'callee' ) &&\n\t\t!isEnumerableProperty( value, 'callee' )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isArguments;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array-like object.\n*\n* @module @stdlib/assert-is-array-like-object\n*\n* @example\n* var isArrayLikeObject = require( '@stdlib/assert-is-array-like-object' );\n*\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* bool = isArrayLikeObject( { 'length':10 } );\n* // returns true\n*\n* bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar MAX_LENGTH = require( '@stdlib/constants-array-max-array-length' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is an array-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is an array-like object\n*\n* @example\n* var bool = isArrayLikeObject( [] );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( { 'length':10 } );\n* // returns true\n*\n* @example\n* var bool = isArrayLikeObject( 'beep' );\n* // returns false\n*/\nfunction isArrayLikeObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isArrayLikeObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an array.\n*\n* @module @stdlib/assert-is-array\n*\n* @example\n* var isArray = require( '@stdlib/assert-is-array' );\n*\n* var bool = isArray( [] );\n* // returns true\n*\n* bool = isArray( {} );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar f;\n\n\n// FUNCTIONS //\n\n/**\n* Tests if a value is an array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an array\n*\n* @example\n* var bool = isArray( [] );\n* // returns true\n*\n* @example\n* var bool = isArray( {} );\n* // returns false\n*/\nfunction isArray( value ) {\n\treturn ( nativeClass( value ) === '[object Array]' );\n}\n\n\n// MAIN //\n\nif ( Array.isArray ) {\n\tf = Array.isArray;\n} else {\n\tf = isArray;\n}\n\n\n// EXPORTS //\n\nmodule.exports = f;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an ArrayBuffer.\n*\n* @module @stdlib/assert-is-arraybuffer\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n* var isArrayBuffer = require( '@stdlib/assert-is-arraybuffer' );\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* bool = isArrayBuffer( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasArrayBuffer = ( typeof ArrayBuffer === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an ArrayBuffer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an ArrayBuffer\n*\n* @example\n* var ArrayBuffer = require( '@stdlib/array-buffer' );\n*\n* var bool = isArrayBuffer( new ArrayBuffer( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isArrayBuffer( [] );\n* // returns false\n*/\nfunction isArrayBuffer( value ) {\n\treturn (\n\t\t( hasArrayBuffer && value instanceof ArrayBuffer ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object ArrayBuffer]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isArrayBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a boolean.\n*\n* @module @stdlib/assert-is-boolean\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n* var isBoolean = require( '@stdlib/assert-is-boolean' );\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n* var isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\n*\n* var bool = isBoolean( false );\n* // returns true\n*\n* bool = isBoolean( new Boolean( true ) );\n* // returns false\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n* var isBoolean = require( '@stdlib/assert-is-boolean' ).isObject;\n*\n* var bool = isBoolean( true );\n* // returns false\n*\n* bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a boolean\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasToStringTag = require( '@stdlib/assert-has-tostringtag-support' );\nvar nativeClass = require( '@stdlib/utils-native-class' );\nvar Boolean = require( '@stdlib/boolean-ctor' );\nvar test = require( './try2serialize.js' );\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a boolean object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean object\n*\n* @example\n* var bool = isBoolean( true );\n* // returns false\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var bool = isBoolean( new Boolean( false ) );\n* // returns true\n*/\nfunction isBoolean( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Boolean ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Boolean]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a boolean primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a boolean primitive\n*\n* @example\n* var bool = isBoolean( true );\n* // returns true\n*\n* @example\n* var bool = isBoolean( false );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var bool = isBoolean( new Boolean( true ) );\n* // returns false\n*/\nfunction isBoolean( value ) {\n\treturn ( typeof value === 'boolean' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isBoolean;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Boolean.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nmodule.exports = toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar toString = require( './tostring.js' ); // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Buffer instance.\n*\n* @module @stdlib/assert-is-buffer\n*\n* @example\n* var isBuffer = require( '@stdlib/assert-is-buffer' );\n*\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* v = isBuffer( {} );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isObjectLike = require( '@stdlib/assert-is-object-like' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Buffer instance.\n*\n* @param {*} value - value to validate\n* @returns {boolean} boolean indicating if a value is a Buffer instance\n*\n* @example\n* var v = isBuffer( new Buffer( 'beep' ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( new Buffer( [1,2,3,4] ) );\n* // returns true\n*\n* @example\n* var v = isBuffer( {} );\n* // returns false\n*\n* @example\n* var v = isBuffer( [] );\n* // returns false\n*/\nfunction isBuffer( value ) {\n\treturn (\n\t\tisObjectLike( value ) &&\n\t\t(\n\t\t\t// eslint-disable-next-line no-underscore-dangle\n\t\t\tvalue._isBuffer || // for envs missing Object.prototype.constructor (e.g., Safari 5-7)\n\t\t\t(\n\t\t\t\tvalue.constructor &&\n\n\t\t\t\t// WARNING: `typeof` is not a foolproof check, as certain envs consider RegExp and NodeList instances to be functions\n\t\t\t\ttypeof value.constructor.isBuffer === 'function' &&\n\t\t\t\tvalue.constructor.isBuffer( value )\n\t\t\t)\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isBuffer;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a collection.\n*\n* @module @stdlib/assert-is-collection\n*\n* @example\n* var isCollection = require( '@stdlib/assert-is-collection' );\n*\n* var bool = isCollection( [] );\n* // returns true\n*\n* bool = isCollection( {} );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar MAX_LENGTH = require( '@stdlib/constants-array-max-typed-array-length' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a collection.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is a collection\n*\n* @example\n* var bool = isCollection( [] );\n* // returns true\n*\n* @example\n* var bool = isCollection( {} );\n* // returns false\n*/\nfunction isCollection( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.length === 'number' &&\n\t\tisInteger( value.length ) &&\n\t\tvalue.length >= 0 &&\n\t\tvalue.length <= MAX_LENGTH\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isCollection;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a complex number-like object.\n*\n* @module @stdlib/assert-is-complex-like\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var isComplexLike = require( '@stdlib/assert-is-complex-like' );\n*\n* var x = new Complex128( 4.0, 2.0 );\n* var bool = isComplexLike( x );\n* // returns true\n*\n* x = new Complex64( 4.0, 2.0 );\n* bool = isComplexLike( x );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex128 = require( '@stdlib/complex-float64' );\nvar Complex64 = require( '@stdlib/complex-float32' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex number-like object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex number-like object.\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var x = new Complex128( 4.0, 2.0 );\n* var bool = isComplexLike( x );\n* // returns true\n*\n* x = new Complex64( 4.0, 2.0 );\n* bool = isComplexLike( x );\n* // returns true\n*/\nfunction isComplexLike( value ) {\n\tif ( value instanceof Complex128 || value instanceof Complex64 ) {\n\t\treturn true;\n\t}\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\ttypeof value.re === 'number' &&\n\t\ttypeof value.im === 'number'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplexLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Complex64Array = require( '@stdlib/array-complex64' );\nvar Complex128Array = require( '@stdlib/array-complex128' );\n\n\n// MAIN //\n\nvar CTORS = [\n\tComplex128Array,\n\tComplex64Array\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a complex typed array.\n*\n* @module @stdlib/assert-is-complex-typed-array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n* var isComplexTypedArray = require( '@stdlib/assert-is-complex-typed-array' );\n*\n* var bool = isComplexTypedArray( new Complex128Array( 10 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\nvar getPrototypeOf = require( '@stdlib/utils-get-prototype-of' );\nvar CTORS = require( './ctors.js' );\nvar NAMES = require( './names.json' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a complex typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a complex typed array\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var bool = isComplexTypedArray( new Complex128Array( 10 ) );\n* // returns true\n*/\nfunction isComplexTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for complex typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isComplexTypedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isEnum = require( './native.js' );\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Detects whether an environment has a bug where String indices are not detected as \"enumerable\" properties. Observed in Node v0.10.\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment has the bug\n*/\nfunction detect() {\n\treturn !isEnum.call( 'beep', '0' );\n}\n\n\n// MAIN //\n\nbool = detect();\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test whether an object's own property is enumerable.\n*\n* @module @stdlib/assert-is-enumerable-property\n*\n* @example\n* var isEnumerableProperty = require( '@stdlib/assert-is-enumerable-property' );\n*\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isString = require( '@stdlib/assert-is-string' );\nvar isnan = require( '@stdlib/assert-is-nan' ).isPrimitive;\nvar isInteger = require( '@stdlib/assert-is-integer' ).isPrimitive;\nvar isEnum = require( './native.js' );\nvar hasStringEnumBug = require( './has_string_enumerability_bug.js' );\n\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nfunction isEnumerableProperty( value, property ) {\n\tvar bool;\n\tif (\n\t\tvalue === void 0 ||\n\t\tvalue === null\n\t) {\n\t\treturn false;\n\t}\n\tbool = isEnum.call( value, property );\n\tif ( !bool && hasStringEnumBug && isString( value ) ) {\n\t\t// Note: we only check for indices, as properties attached to a `String` object are properly detected as enumerable above.\n\t\tproperty = +property;\n\t\treturn (\n\t\t\t!isnan( property ) &&\n\t\t\tisInteger( property ) &&\n\t\t\tproperty >= 0 &&\n\t\t\tproperty < value.length\n\t\t);\n\t}\n\treturn bool;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if an object's own property is enumerable.\n*\n* @private\n* @name isEnumerableProperty\n* @type {Function}\n* @param {*} value - value to test\n* @param {*} property - property to test\n* @returns {boolean} boolean indicating if an object property is enumerable\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'boop' );\n* // returns true\n*\n* @example\n* var beep = {\n* 'boop': true\n* };\n*\n* var bool = isEnumerableProperty( beep, 'hasOwnProperty' );\n* // returns false\n*/\nvar isEnumerableProperty = Object.prototype.propertyIsEnumerable;\n\n\n// EXPORTS //\n\nmodule.exports = isEnumerableProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Float32Array.\n*\n* @module @stdlib/assert-is-float32array\n*\n* @example\n* var isFloat32Array = require( '@stdlib/assert-is-float32array' );\n*\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* bool = isFloat32Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isFloat32Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasFloat32Array = ( typeof Float32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float32Array\n*\n* @example\n* var bool = isFloat32Array( new Float32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat32Array( [] );\n* // returns false\n*/\nfunction isFloat32Array( value ) {\n\treturn (\n\t\t( hasFloat32Array && value instanceof Float32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isFloat32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Float64Array.\n*\n* @module @stdlib/assert-is-float64array\n*\n* @example\n* var isFloat64Array = require( '@stdlib/assert-is-float64array' );\n*\n* var bool = isFloat64Array( new Float64Array( 10 ) );\n* // returns true\n*\n* bool = isFloat64Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isFloat64Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isFloat64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasFloat64Array = ( typeof Float64Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Float64Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Float64Array\n*\n* @example\n* var bool = isFloat64Array( new Float64Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isFloat64Array( [] );\n* // returns false\n*/\nfunction isFloat64Array( value ) {\n\treturn (\n\t\t( hasFloat64Array && value instanceof Float64Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Float64Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isFloat64Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a function.\n*\n* @module @stdlib/assert-is-function\n*\n* @example\n* var isFunction = require( '@stdlib/assert-is-function' );\n*\n* function beep() {\n* return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar typeOf = require( '@stdlib/utils-type-of' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a function.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a function\n*\n* @example\n* function beep() {\n* return 'beep';\n* }\n*\n* var bool = isFunction( beep );\n* // returns true\n*/\nfunction isFunction( value ) {\n\t// Note: cannot use `typeof` directly, as various browser engines incorrectly return `'function'` when operating on non-function objects, such as regular expressions and NodeLists.\n\treturn ( typeOf( value ) === 'function' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isFunction;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an Int16Array.\n*\n* @module @stdlib/assert-is-int16array\n*\n* @example\n* var isInt16Array = require( '@stdlib/assert-is-int16array' );\n*\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* bool = isInt16Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isInt16Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasInt16Array = ( typeof Int16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int16Array\n*\n* @example\n* var bool = isInt16Array( new Int16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt16Array( [] );\n* // returns false\n*/\nfunction isInt16Array( value ) {\n\treturn (\n\t\t( hasInt16Array && value instanceof Int16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInt16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an Int32Array.\n*\n* @module @stdlib/assert-is-int32array\n*\n* @example\n* var isInt32Array = require( '@stdlib/assert-is-int32array' );\n*\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* bool = isInt32Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isInt32Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasInt32Array = ( typeof Int32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int32Array\n*\n* @example\n* var bool = isInt32Array( new Int32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt32Array( [] );\n* // returns false\n*/\nfunction isInt32Array( value ) {\n\treturn (\n\t\t( hasInt32Array && value instanceof Int32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInt32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an Int8Array.\n*\n* @module @stdlib/assert-is-int8array\n*\n* @example\n* var isInt8Array = require( '@stdlib/assert-is-int8array' );\n*\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* bool = isInt8Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isInt8Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasInt8Array = ( typeof Int8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is an Int8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an Int8Array\n*\n* @example\n* var bool = isInt8Array( new Int8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isInt8Array( [] );\n* // returns false\n*/\nfunction isInt8Array( value ) {\n\treturn (\n\t\t( hasInt8Array && value instanceof Int8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Int8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInt8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an integer.\n*\n* @module @stdlib/assert-is-integer\n*\n* @example\n* var isInteger = require( '@stdlib/assert-is-integer' );\n*\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isInteger( -3.14 );\n* // returns false\n*\n* bool = isInteger( null );\n* // returns false\n*\n* @example\n* // Use interface to check for integer primitives...\n* var isInteger = require( '@stdlib/assert-is-integer' ).isPrimitive;\n*\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*\n* @example\n* // Use interface to check for integer objects...\n* var isInteger = require( '@stdlib/assert-is-integer' ).isObject;\n*\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar isInt = require( '@stdlib/math-base-assert-is-integer' );\n\n\n// MAIN //\n\n/**\n* Tests if a number primitive is an integer value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a number primitive is an integer value\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tvalue < PINF &&\n\t\tvalue > NINF &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is an integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an integer\n*\n* @example\n* var bool = isInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isInteger( -3.14 );\n* // returns false\n*\n* @example\n* var bool = isInteger( null );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isObject;\nvar isInt = require( './integer.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having an integer value\n*\n* @example\n* var bool = isInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar isInt = require( './integer.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having an integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having an integer value\n*\n* @example\n* var bool = isInteger( -3.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( new Number( -3.0 ) );\n* // returns false\n*/\nfunction isInteger( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisInt( value )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint8Array = require( '@stdlib/array-uint8' );\nvar Uint16Array = require( '@stdlib/array-uint16' );\n\n\n// MAIN //\n\nvar ctors = {\n\t'uint16': Uint16Array,\n\t'uint8': Uint8Array\n};\n\n\n// EXPORTS //\n\nmodule.exports = ctors;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a boolean indicating if an environment is little endian.\n*\n* @module @stdlib/assert-is-little-endian\n*\n* @example\n* var IS_LITTLE_ENDIAN = require( '@stdlib/assert-is-little-endian' );\n*\n* var bool = IS_LITTLE_ENDIAN;\n* // returns \n*/\n\n// MODULES //\n\nvar IS_LITTLE_ENDIAN = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = IS_LITTLE_ENDIAN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctors = require( './ctors.js' );\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Returns a boolean indicating if an environment is little endian.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment is little endian\n*\n* @example\n* var bool = isLittleEndian();\n* // returns \n*/\nfunction isLittleEndian() {\n\tvar uint16view;\n\tvar uint8view;\n\n\tuint16view = new ctors[ 'uint16' ]( 1 );\n\n\t/*\n\t* Set the uint16 view to a value having distinguishable lower and higher order words.\n\t*\n\t* 4660 => 0x1234 => 0x12 0x34 => '00010010 00110100' => (0x12,0x34) == (18,52)\n\t*/\n\tuint16view[ 0 ] = 0x1234;\n\n\t// Create a uint8 view on top of the uint16 buffer:\n\tuint8view = new ctors[ 'uint8' ]( uint16view.buffer );\n\n\t// If little endian, the least significant byte will be first...\n\treturn ( uint8view[ 0 ] === 0x34 );\n}\n\n\n// MAIN //\n\nbool = isLittleEndian();\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is `NaN`.\n*\n* @module @stdlib/assert-is-nan\n*\n* @example\n* var isnan = require( '@stdlib/assert-is-nan' );\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( null );\n* // returns false\n*\n* @example\n* var isnan = require( '@stdlib/assert-is-nan' ).isPrimitive;\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 3.14 );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns false\n*\n* @example\n* var isnan = require( '@stdlib/assert-is-nan' ).isObject;\n*\n* var bool = isnan( NaN );\n* // returns false\n*\n* bool = isnan( new Number( NaN ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( null );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isObject;\nvar isNan = require( '@stdlib/math-base-assert-is-nan' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a value of `NaN`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a value of `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns true\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value.valueOf() )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar isNan = require( '@stdlib/math-base-assert-is-nan' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a `NaN` number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a `NaN` number primitive\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isnan( new Number( NaN ) );\n* // returns false\n*/\nfunction isnan( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tisNan( value )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a nonnegative integer.\n*\n* @module @stdlib/assert-is-nonnegative-integer\n*\n* @example\n* var isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' );\n*\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* bool = isNonNegativeInteger( null );\n* // returns false\n*\n* @example\n* var isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isPrimitive;\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* var isNonNegativeInteger = require( '@stdlib/assert-is-nonnegative-integer' ).isObject;\n*\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a nonnegative integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a nonnegative integer\n*\n* @example\n* var bool = isNonNegativeInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( null );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/assert-is-integer' ).isObject;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/assert-is-integer' ).isPrimitive;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a nonnegative integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a nonnegative integer value\n*\n* @example\n* var bool = isNonNegativeInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isNonNegativeInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isNonNegativeInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue >= 0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNonNegativeInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a number.\n*\n* @module @stdlib/assert-is-number\n*\n* @example\n* var isNumber = require( '@stdlib/assert-is-number' );\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( null );\n* // returns false\n*\n* @example\n* var isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\n*\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* bool = isNumber( NaN );\n* // returns true\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*\n* @example\n* var isNumber = require( '@stdlib/assert-is-number' ).isObject;\n*\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a number\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( null );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasToStringTag = require( '@stdlib/assert-has-tostringtag-support' );\nvar nativeClass = require( '@stdlib/utils-native-class' );\nvar Number = require( '@stdlib/number-ctor' );\nvar test = require( './try2serialize.js' );\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns true\n*/\nfunction isNumber( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof Number ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object Number]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Number = require( '@stdlib/number-ctor' );\n\n\n// MAIN //\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar toString = Number.prototype.toString; // non-generic\n\n\n// EXPORTS //\n\nmodule.exports = toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar toString = require( './tostring.js' ); // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to serialize a value to a string.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value can be serialized\n*/\nfunction test( value ) {\n\ttry {\n\t\ttoString.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is object-like.\n*\n* @module @stdlib/assert-is-object-like\n*\n* @example\n* var isObjectLike = require( '@stdlib/assert-is-object-like' );\n*\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* bool = isObjectLike( [] );\n* // returns true\n*\n* bool = isObjectLike( null );\n* // returns false\n*\n* @example\n* var isObjectLike = require( '@stdlib/assert-is-object-like' ).isObjectLikeArray;\n*\n* var bool = isObjectLike( [ {}, [] ] );\n* // returns true\n*\n* bool = isObjectLike( [ {}, '3.0' ] );\n* // returns false\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar arrayfun = require( '@stdlib/assert-tools-array-function' );\nvar main = require( './main.js' );\n\n\n// VARIABLES //\n\nvar isObjectLikeArray = arrayfun( main );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isObjectLikeArray', isObjectLikeArray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is object-like.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value is object-like\n*\n* @example\n* var bool = isObjectLike( {} );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( [] );\n* // returns true\n*\n* @example\n* var bool = isObjectLike( null );\n* // returns false\n*/\nfunction isObjectLike( value ) {\n\treturn (\n\t\tvalue !== null &&\n\t\ttypeof value === 'object'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isObjectLike;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is an object.\n*\n* @module @stdlib/assert-is-object\n*\n* @example\n* var isObject = require( '@stdlib/assert-is-object' );\n*\n* var bool = isObject( {} );\n* // returns true\n*\n* bool = isObject( true );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert-is-array' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is an object; e.g., `{}`.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is an object\n*\n* @example\n* var bool = isObject( {} );\n* // returns true\n*\n* @example\n* var bool = isObject( null );\n* // returns false\n*/\nfunction isObject( value ) {\n\treturn (\n\t\ttypeof value === 'object' &&\n\t\tvalue !== null &&\n\t\t!isArray( value )\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a plain object.\n*\n* @module @stdlib/assert-is-plain-object\n*\n* @example\n* var isPlainObject = require( '@stdlib/assert-is-plain-object' );\n*\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* bool = isPlainObject( null );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isObject = require( '@stdlib/assert-is-object' );\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar getPrototypeOf = require( '@stdlib/utils-get-prototype-of' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar objectPrototype = Object.prototype;\n\n\n// FUNCTIONS //\n\n/**\n* Tests that an object only has own properties.\n*\n* @private\n* @param {Object} obj - value to test\n* @returns {boolean} boolean indicating if an object only has own properties\n*/\nfunction ownProps( obj ) {\n\tvar key;\n\n\t// NOTE: possibility of perf boost if key enumeration order is known (see http://stackoverflow.com/questions/18531624/isplainobject-thing).\n\tfor ( key in obj ) {\n\t\tif ( !hasOwnProp( obj, key ) ) {\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\n\n// MAIN //\n\n/**\n* Tests if a value is a plain object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a plain object\n*\n* @example\n* var bool = isPlainObject( {} );\n* // returns true\n*\n* @example\n* var bool = isPlainObject( null );\n* // returns false\n*/\nfunction isPlainObject( value ) {\n\tvar proto;\n\n\t// Screen for obvious non-objects...\n\tif ( !isObject( value ) ) {\n\t\treturn false;\n\t}\n\t// Objects with no prototype (e.g., `Object.create( null )`) are plain...\n\tproto = getPrototypeOf( value );\n\tif ( !proto ) {\n\t\treturn true;\n\t}\n\t// Objects having a prototype are plain if and only if they are constructed with a global `Object` function and the prototype points to the prototype of a plain object...\n\treturn (\n\t\t// Cannot have own `constructor` property:\n\t\t!hasOwnProp( value, 'constructor' ) &&\n\n\t\t// Prototype `constructor` property must be a function (see also https://bugs.jquery.com/ticket/9897 and http://stackoverflow.com/questions/18531624/isplainobject-thing):\n\t\thasOwnProp( proto, 'constructor' ) &&\n\t\tisFunction( proto.constructor ) &&\n\t\tnativeClass( proto.constructor ) === '[object Function]' &&\n\n\t\t// Test for object-specific method:\n\t\thasOwnProp( proto, 'isPrototypeOf' ) &&\n\t\tisFunction( proto.isPrototypeOf ) &&\n\n\t\t(\n\t\t\t// Test if the prototype matches the global `Object` prototype (same realm):\n\t\t\tproto === objectPrototype ||\n\n\t\t\t// Test that all properties are own properties (cross-realm; *most* likely a plain object):\n\t\t\townProps( value )\n\t\t)\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPlainObject;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a positive integer.\n*\n* @module @stdlib/assert-is-positive-integer\n*\n* @example\n* var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' );\n*\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* bool = isPositiveInteger( null );\n* // returns false\n*\n* @example\n* var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* var isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isObject;\n*\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a positive integer.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a positive integer\n*\n* @example\n* var bool = isPositiveInteger( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( 0.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( 3.14 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( null );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/assert-is-integer' ).isObject;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue.valueOf() > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/assert-is-integer' ).isPrimitive;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a positive integer value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a positive integer value\n*\n* @example\n* var bool = isPositiveInteger( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveInteger( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isPositiveInteger( value ) {\n\treturn (\n\t\tisInteger( value ) &&\n\t\tvalue > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a positive number.\n*\n* @module @stdlib/assert-is-positive-number\n*\n* @example\n* var isPositiveNumber = require( '@stdlib/assert-is-positive-number' );\n*\n* var bool = isPositiveNumber( 5.0 );\n* // returns true\n*\n* bool = isPositiveNumber( new Number( 5.0 ) );\n* // returns true\n*\n* bool = isPositiveNumber( 3.14 );\n* // returns true\n*\n* bool = isPositiveNumber( -5.0 );\n* // returns false\n*\n* bool = isPositiveNumber( null );\n* // returns false\n*\n* @example\n* var isPositiveNumber = require( '@stdlib/assert-is-positive-number' ).isPrimitive;\n*\n* var bool = isPositiveNumber( 3.0 );\n* // returns true\n*\n* bool = isPositiveNumber( new Number( 3.0 ) );\n* // returns false\n*\n* @example\n* var isPositiveNumber = require( '@stdlib/assert-is-positive-number' ).isObject;\n*\n* var bool = isPositiveNumber( 3.0 );\n* // returns false\n*\n* bool = isPositiveNumber( new Number( 3.0 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a positive number.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a positive number\n*\n* @example\n* var bool = isPositiveNumber( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveNumber( new Number( 5.0 ) );\n* // returns true\n*\n* @example\n* var bool = isPositiveNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isPositiveNumber( -5.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveNumber( null );\n* // returns false\n*/\nfunction isPositiveNumber( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isObject;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number object having a positive value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number object having a positive value\n*\n* @example\n* var bool = isPositiveNumber( 3.0 );\n* // returns false\n*\n* @example\n* var bool = isPositiveNumber( new Number( 3.0 ) );\n* // returns true\n*/\nfunction isPositiveNumber( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tvalue.valueOf() > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\n\n\n// MAIN //\n\n/**\n* Tests if a value is a number primitive having a positive value.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive having a positive value\n*\n* @example\n* var bool = isPositiveNumber( 3.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveNumber( new Number( 3.0 ) );\n* // returns false\n*/\nfunction isPositiveNumber( value ) {\n\treturn (\n\t\tisNumber( value ) &&\n\t\tvalue > 0.0\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a string.\n*\n* @module @stdlib/assert-is-string\n*\n* @example\n* var isString = require( '@stdlib/assert-is-string' );\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 5 );\n* // returns false\n*\n* @example\n* var isString = require( '@stdlib/assert-is-string' ).isObject;\n*\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* bool = isString( 'beep' );\n* // returns false\n*\n* @example\n* var isString = require( '@stdlib/assert-is-string' ).isPrimitive;\n*\n* var bool = isString( 'beep' );\n* // returns true\n*\n* bool = isString( new String( 'beep' ) );\n* // returns false\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'isPrimitive', isPrimitive );\nsetReadOnly( main, 'isObject', isObject );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPrimitive = require( './primitive.js' );\nvar isObject = require( './object.js' );\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a string\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*/\nfunction isString( value ) {\n\treturn ( isPrimitive( value ) || isObject( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasToStringTag = require( '@stdlib/assert-has-tostringtag-support' );\nvar nativeClass = require( '@stdlib/utils-native-class' );\nvar test = require( './try2valueof.js' );\n\n\n// VARIABLES //\n\nvar FLG = hasToStringTag();\n\n\n// MAIN //\n\n/**\n* Tests if a value is a string object.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string object\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns true\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns false\n*/\nfunction isString( value ) {\n\tif ( typeof value === 'object' ) {\n\t\tif ( value instanceof String ) {\n\t\t\treturn true;\n\t\t}\n\t\tif ( FLG ) {\n\t\t\treturn test( value );\n\t\t}\n\t\treturn ( nativeClass( value ) === '[object String]' );\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar valueOf = require( './valueof.js' ); // eslint-disable-line stdlib/no-redeclare\n\n\n// MAIN //\n\n/**\n* Attempts to extract a string value.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a string can be extracted\n*/\nfunction test( value ) {\n\ttry {\n\t\tvalueOf.call( value );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = test;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// eslint-disable-next-line stdlib/no-redeclare\nvar valueOf = String.prototype.valueOf; // non-generic\n\n\n// EXPORTS //\n\nmodule.exports = valueOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Int8Array = require( '@stdlib/array-int8' );\nvar Uint8Array = require( '@stdlib/array-uint8' );\nvar Uint8ClampedArray = require( '@stdlib/array-uint8c' );\nvar Int16Array = require( '@stdlib/array-int16' );\nvar Uint16Array = require( '@stdlib/array-uint16' );\nvar Int32Array = require( '@stdlib/array-int32' );\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float32Array = require( '@stdlib/array-float32' );\nvar Float64Array = require( '@stdlib/array-float64' );\n\n\n// MAIN //\n\nvar CTORS = [\n\tFloat64Array,\n\tFloat32Array,\n\tInt32Array,\n\tUint32Array,\n\tInt16Array,\n\tUint16Array,\n\tInt8Array,\n\tUint8Array,\n\tUint8ClampedArray\n];\n\n\n// EXPORTS //\n\nmodule.exports = CTORS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a typed array.\n*\n* @module @stdlib/assert-is-typed-array\n*\n* @example\n* var Int8Array = require( '@stdlib/array-int8' );\n* var isTypedArray = require( '@stdlib/assert-is-typed-array' );\n*\n* var bool = isTypedArray( new Int8Array( 10 ) );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\nvar fcnName = require( '@stdlib/utils-function-name' );\nvar getPrototypeOf = require( '@stdlib/utils-get-prototype-of' );\nvar hasFloat64ArraySupport = require( '@stdlib/assert-has-float64array-support' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar CTORS = require( './ctors.js' );\nvar NAMES = require( './names.json' );\n\n\n// VARIABLES //\n\n// Abstract `TypedArray` class:\nvar TypedArray = ( hasFloat64ArraySupport() ) ? getPrototypeOf( Float64Array ) : Dummy; // eslint-disable-line max-len\n\n// Ensure abstract typed array class has expected name:\nTypedArray = ( fcnName( TypedArray ) === 'TypedArray' ) ? TypedArray : Dummy;\n\n\n// FUNCTIONS //\n\n/**\n* Dummy constructor.\n*\n* @private\n*/\nfunction Dummy() {} // eslint-disable-line no-empty-function\n\n\n// MAIN //\n\n/**\n* Tests if a value is a typed array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a typed array\n*\n* @example\n* var Int8Array = require( '@stdlib/array-int8' );\n*\n* var bool = isTypedArray( new Int8Array( 10 ) );\n* // returns true\n*/\nfunction isTypedArray( value ) {\n\tvar v;\n\tvar i;\n\n\tif ( typeof value !== 'object' || value === null ) {\n\t\treturn false;\n\t}\n\t// Check for the abstract class...\n\tif ( value instanceof TypedArray ) {\n\t\treturn true;\n\t}\n\t// Check for typed array objects from the same realm (same Node.js `vm` or same `Window` object)...\n\tfor ( i = 0; i < CTORS.length; i++ ) {\n\t\tif ( value instanceof CTORS[ i ] ) {\n\t\t\treturn true;\n\t\t}\n\t}\n\t// Walk the prototype tree until we find an object having a desired class...\n\twhile ( value ) {\n\t\tv = ctorName( value );\n\t\tfor ( i = 0; i < NAMES.length; i++ ) {\n\t\t\tif ( NAMES[ i ] === v ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\tvalue = getPrototypeOf( value );\n\t}\n\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = isTypedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Uint16Array.\n*\n* @module @stdlib/assert-is-uint16array\n*\n* @example\n* var isUint16Array = require( '@stdlib/assert-is-uint16array' );\n*\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* bool = isUint16Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isUint16Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasUint16Array = ( typeof Uint16Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint16Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint16Array\n*\n* @example\n* var bool = isUint16Array( new Uint16Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint16Array( [] );\n* // returns false\n*/\nfunction isUint16Array( value ) {\n\treturn (\n\t\t( hasUint16Array && value instanceof Uint16Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint16Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isUint16Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Uint32Array.\n*\n* @module @stdlib/assert-is-uint32array\n*\n* @example\n* var isUint32Array = require( '@stdlib/assert-is-uint32array' );\n*\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* bool = isUint32Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isUint32Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasUint32Array = ( typeof Uint32Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint32Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint32Array\n*\n* @example\n* var bool = isUint32Array( new Uint32Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint32Array( [] );\n* // returns false\n*/\nfunction isUint32Array( value ) {\n\treturn (\n\t\t( hasUint32Array && value instanceof Uint32Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint32Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isUint32Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Uint8Array.\n*\n* @module @stdlib/assert-is-uint8array\n*\n* @example\n* var isUint8Array = require( '@stdlib/assert-is-uint8array' );\n*\n* var bool = isUint8Array( new Uint8Array( 10 ) );\n* // returns true\n*\n* bool = isUint8Array( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isUint8Array = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isUint8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasUint8Array = ( typeof Uint8Array === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8Array.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8Array\n*\n* @example\n* var bool = isUint8Array( new Uint8Array( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8Array( [] );\n* // returns false\n*/\nfunction isUint8Array( value ) {\n\treturn (\n\t\t( hasUint8Array && value instanceof Uint8Array ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8Array]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isUint8Array;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a value is a Uint8ClampedArray.\n*\n* @module @stdlib/assert-is-uint8clampedarray\n*\n* @example\n* var isUint8ClampedArray = require( '@stdlib/assert-is-uint8clampedarray' );\n*\n* var bool = isUint8ClampedArray( new Uint8ClampedArray( 10 ) );\n* // returns true\n*\n* bool = isUint8ClampedArray( [] );\n* // returns false\n*/\n\n// MODULES //\n\nvar isUint8ClampedArray = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = isUint8ClampedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\n\n\n// VARIABLES //\n\nvar hasUint8ClampedArray = ( typeof Uint8ClampedArray === 'function' ); // eslint-disable-line stdlib/require-globals\n\n\n// MAIN //\n\n/**\n* Tests if a value is a Uint8ClampedArray.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether value is a Uint8ClampedArray\n*\n* @example\n* var bool = isUint8ClampedArray( new Uint8ClampedArray( 10 ) );\n* // returns true\n*\n* @example\n* var bool = isUint8ClampedArray( [] );\n* // returns false\n*/\nfunction isUint8ClampedArray( value ) {\n\treturn (\n\t\t( hasUint8ClampedArray && value instanceof Uint8ClampedArray ) || // eslint-disable-line stdlib/require-globals\n\t\tnativeClass( value ) === '[object Uint8ClampedArray]'\n\t);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isUint8ClampedArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a function which tests if every element in an array passes a test condition.\n*\n* @module @stdlib/assert-tools-array-function\n*\n* @example\n* var isOdd = require( '@stdlib/assert-is-odd' );\n* var arrayfcn = require( '@stdlib/assert-tools-array-function' );\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArray = require( '@stdlib/assert-is-array' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns a function which tests if every element in an array passes a test condition.\n*\n* @param {Function} predicate - function to apply\n* @throws {TypeError} must provide a function\n* @returns {Function} an array function\n*\n* @example\n* var isOdd = require( '@stdlib/assert-is-odd' );\n*\n* var arr1 = [ 1, 3, 5, 7 ];\n* var arr2 = [ 3, 5, 8 ];\n*\n* var validate = arrayfcn( isOdd );\n*\n* var bool = validate( arr1 );\n* // returns true\n*\n* bool = validate( arr2 );\n* // returns false\n*/\nfunction arrayfcn( predicate ) {\n\tif ( typeof predicate !== 'function' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', predicate ) );\n\t}\n\treturn every;\n\n\t/**\n\t* Tests if every element in an array passes a test condition.\n\t*\n\t* @private\n\t* @param {*} value - value to test\n\t* @returns {boolean} boolean indicating whether a value is an array for which all elements pass a test condition\n\t*/\n\tfunction every( value ) {\n\t\tvar len;\n\t\tvar i;\n\t\tif ( !isArray( value ) ) {\n\t\t\treturn false;\n\t\t}\n\t\tlen = value.length;\n\t\tif ( len === 0 ) {\n\t\t\treturn false;\n\t\t}\n\t\tfor ( i = 0; i < len; i++ ) {\n\t\t\tif ( predicate( value[ i ] ) === false ) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = arrayfcn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @private\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Object} x - input array object\n* @param {Collection} x.data - input array data\n* @param {Array} x.accessors - array element accessors\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Object} y - output array object\n* @param {Collection} y.data - output array data\n* @param {Array} y.accessors - array element accessors\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Object} output array object\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var reinterpret64 = require( '@stdlib/strided-base-reinterpret-complex64' );\n*\n* function setter( data, idx, value ) {\n* data.set( value, idx );\n* }\n*\n* function getter( data, idx ) {\n* return data.get( idx );\n* }\n*\n* var x = {\n* 'data': new Complex64Array( [ 1.0, 2.0, 3.0, 4.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* var y = {\n* 'data': new Complex64Array( [ 5.0, 6.0, 7.0, 8.0 ] ),\n* 'accessors': [ getter, setter ]\n* };\n*\n* gcopy( x.data.length, x, 1, 0, y, 1, 0 );\n*\n* var view = reinterpret64( y.data, 0 );\n* // view => [ 1.0, 2.0, 3.0, 4.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar xbuf;\n\tvar ybuf;\n\tvar set;\n\tvar get;\n\tvar ix;\n\tvar iy;\n\tvar i;\n\n\t// Cache references to array data:\n\txbuf = x.data;\n\tybuf = y.data;\n\n\t// Cache a reference to the element accessors:\n\tget = x.accessors[ 0 ];\n\tset = y.accessors[ 1 ];\n\n\tix = offsetX;\n\tiy = offsetY;\n\tfor ( i = 0; i < N; i++ ) {\n\t\tset( ybuf, iy, get( xbuf, ix ) );\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* BLAS level 1 routine to copy values from `x` into `y`.\n*\n* @module @stdlib/blas-base-gcopy\n*\n* @example\n* var gcopy = require( '@stdlib/blas-base-gcopy' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*\n* @example\n* var gcopy = require( '@stdlib/blas-base-gcopy' );\n*\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy.ndarray( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar ndarray = require( './ndarray.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'ndarray', ndarray );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar accessors = require( './accessors.js' );\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, y, 1 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, y, strideY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\tif ( strideX < 0 ) {\n\t\t\tix = (1-N) * strideX;\n\t\t} else {\n\t\t\tix = 0;\n\t\t}\n\t\tif ( strideY < 0 ) {\n\t\t\tiy = (1-N) * strideY;\n\t\t} else {\n\t\t\tiy = 0;\n\t\t}\n\t\taccessors( N, ox, strideX, ix, oy, strideY, iy );\n\t\treturn oy.data;\n\t}\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ i ] = x[ i ];\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ i ] = x[ i ];\n\t\t\ty[ i+1 ] = x[ i+1 ];\n\t\t\ty[ i+2 ] = x[ i+2 ];\n\t\t\ty[ i+3 ] = x[ i+3 ];\n\t\t\ty[ i+4 ] = x[ i+4 ];\n\t\t\ty[ i+5 ] = x[ i+5 ];\n\t\t\ty[ i+6 ] = x[ i+6 ];\n\t\t\ty[ i+7 ] = x[ i+7 ];\n\t\t}\n\t\treturn y;\n\t}\n\tif ( strideX < 0 ) {\n\t\tix = (1-N) * strideX;\n\t} else {\n\t\tix = 0;\n\t}\n\tif ( strideY < 0 ) {\n\t\tiy = (1-N) * strideY;\n\t} else {\n\t\tiy = 0;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar arraylike2object = require( '@stdlib/array-base-arraylike2object' );\nvar accessors = require( './accessors.js' );\n\n\n// VARIABLES //\n\nvar M = 8;\n\n\n// MAIN //\n\n/**\n* Copies values from `x` into `y`.\n*\n* @param {PositiveInteger} N - number of indexed elements\n* @param {Collection} x - input array\n* @param {integer} strideX - `x` stride length\n* @param {NonNegativeInteger} offsetX - starting `x` index\n* @param {Collection} y - output array\n* @param {integer} strideY - `y` stride length\n* @param {NonNegativeInteger} offsetY - starting `y` index\n* @returns {Collection} output array\n*\n* @example\n* var x = [ 1.0, 2.0, 3.0, 4.0, 5.0 ];\n* var y = [ 6.0, 7.0, 8.0, 9.0, 10.0 ];\n*\n* gcopy( x.length, x, 1, 0, y, 1, 0 );\n* // y => [ 1.0, 2.0, 3.0, 4.0, 5.0 ]\n*/\nfunction gcopy( N, x, strideX, offsetX, y, strideY, offsetY ) {\n\tvar ix;\n\tvar iy;\n\tvar ox;\n\tvar oy;\n\tvar m;\n\tvar i;\n\n\tif ( N <= 0 ) {\n\t\treturn y;\n\t}\n\tox = arraylike2object( x );\n\toy = arraylike2object( y );\n\tif ( ox.accessorProtocol || oy.accessorProtocol ) {\n\t\taccessors( N, ox, strideX, offsetX, oy, strideY, offsetY );\n\t\treturn oy.data;\n\t}\n\tix = offsetX;\n\tiy = offsetY;\n\n\t// Use unrolled loops if both strides are equal to `1`...\n\tif ( strideX === 1 && strideY === 1 ) {\n\t\tm = N % M;\n\n\t\t// If we have a remainder, run a clean-up loop...\n\t\tif ( m > 0 ) {\n\t\t\tfor ( i = 0; i < m; i++ ) {\n\t\t\t\ty[ iy ] = x[ ix ];\n\t\t\t\tix += strideX;\n\t\t\t\tiy += strideY;\n\t\t\t}\n\t\t}\n\t\tif ( N < M ) {\n\t\t\treturn y;\n\t\t}\n\t\tfor ( i = m; i < N; i += M ) {\n\t\t\ty[ iy ] = x[ ix ];\n\t\t\ty[ iy+1 ] = x[ ix+1 ];\n\t\t\ty[ iy+2 ] = x[ ix+2 ];\n\t\t\ty[ iy+3 ] = x[ ix+3 ];\n\t\t\ty[ iy+4 ] = x[ ix+4 ];\n\t\t\ty[ iy+5 ] = x[ ix+5 ];\n\t\t\ty[ iy+6 ] = x[ ix+6 ];\n\t\t\ty[ iy+7 ] = x[ ix+7 ];\n\t\t\tix += M;\n\t\t\tiy += M;\n\t\t}\n\t\treturn y;\n\t}\n\tfor ( i = 0; i < N; i++ ) {\n\t\ty[ iy ] = x[ ix ];\n\t\tix += strideX;\n\t\tiy += strideY;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = gcopy;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Boolean constructor.\n*\n* @module @stdlib/boolean-ctor\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var Boolean = require( '@stdlib/boolean-ctor' );\n*\n* var b = new Boolean( false );\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a boolean.\n*\n* @name Boolean\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {(boolean|Boolean)} boolean\n*\n* @example\n* var b = Boolean( null );\n* // returns false\n*\n* b = Boolean( [] );\n* // returns true\n*\n* b = Boolean( {} );\n* // returns true\n*\n* @example\n* var b = new Boolean( false );\n* // returns \n*/\nvar Bool = Boolean; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = Bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 64-bit complex number constructor.\n*\n* @module @stdlib/complex-float32\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar defineProperty = require( '@stdlib/utils-define-property' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar float64ToFloat32 = require( '@stdlib/number-float64-base-to-float32' );\nvar format = require( '@stdlib/string-format' );\nvar toStr = require( './tostring.js' );\nvar toJSON = require( './tojson.js' );\n\n\n// MAIN //\n\n/**\n* 64-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex64} 64-bit complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex64( real, imag ) {\n\tif ( !( this instanceof Complex64 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tdefineProperty( this, 're', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': float64ToFloat32( real )\n\t});\n\tdefineProperty( this, 'im', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': float64ToFloat32( imag )\n\t});\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex64.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 4\n*/\nsetReadOnly( Complex64.prototype, 'BYTES_PER_ELEMENT', 4 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex64.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 8\n*/\nsetReadOnly( Complex64.prototype, 'byteLength', 8 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex64.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex64` instance.\n*\n* @name toJSON\n* @memberof Complex64.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex64', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex64.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nmodule.exports = Complex64;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex64';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* 128-bit complex number constructor.\n*\n* @module @stdlib/complex-float64\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var z = new Complex128( 5.0, 3.0 );\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( '@stdlib/assert-is-number' ).isPrimitive;\nvar defineProperty = require( '@stdlib/utils-define-property' );\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar format = require( '@stdlib/string-format' );\nvar toStr = require( './tostring.js' );\nvar toJSON = require( './tojson.js' );\n\n\n// MAIN //\n\n/**\n* 128-bit complex number constructor.\n*\n* @constructor\n* @param {number} real - real component\n* @param {number} imag - imaginary component\n* @throws {TypeError} must invoke using the `new` keyword\n* @throws {TypeError} real component must be a number\n* @throws {TypeError} imaginary component must be a number\n* @returns {Complex128} 128-bit complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n* // returns \n*/\nfunction Complex128( real, imag ) {\n\tif ( !( this instanceof Complex128 ) ) {\n\t\tthrow new TypeError( 'invalid invocation. Constructor must be called with the `new` keyword.' );\n\t}\n\tif ( !isNumber( real ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Real component must be a number. Value: `%s`.', real ) );\n\t}\n\tif ( !isNumber( imag ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. Imaginary component must be a number. Value: `%s`.', imag ) );\n\t}\n\tdefineProperty( this, 're', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': real\n\t});\n\tdefineProperty( this, 'im', {\n\t\t'configurable': false,\n\t\t'enumerable': true,\n\t\t'writable': false,\n\t\t'value': imag\n\t});\n\treturn this;\n}\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var nbytes = Complex128.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Size (in bytes) of each component.\n*\n* @name BYTES_PER_ELEMENT\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} size of each component\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.BYTES_PER_ELEMENT;\n* // returns 8\n*/\nsetReadOnly( Complex128.prototype, 'BYTES_PER_ELEMENT', 8 );\n\n/**\n* Length (in bytes) of a complex number.\n*\n* @name byteLength\n* @memberof Complex128.prototype\n* @type {integer}\n* @returns {integer} byte length\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var nbytes = z.byteLength;\n* // returns 16\n*/\nsetReadOnly( Complex128.prototype, 'byteLength', 16 );\n\n/**\n* Serializes a complex number as a string.\n*\n* @name toString\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {string} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var str = z.toString();\n* // returns '5 + 3i'\n*/\nsetReadOnly( Complex128.prototype, 'toString', toStr );\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* ## Notes\n*\n* - `JSON.stringify()` implicitly calls this method when stringifying a `Complex128` instance.\n*\n* @name toJSON\n* @memberof Complex128.prototype\n* @type {Function}\n* @returns {Object} serialized complex number\n*\n* @example\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var obj = z.toJSON();\n* // returns { 'type': 'Complex128', 're': 5.0, 'im': 3.0 }\n*/\nsetReadOnly( Complex128.prototype, 'toJSON', toJSON );\n\n\n// EXPORTS //\n\nmodule.exports = Complex128;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a JSON object.\n*\n* @private\n* @returns {Object} JSON representation\n*/\nfunction toJSON() {\n\t/* eslint-disable no-invalid-this */\n\tvar out = {};\n\tout.type = 'Complex128';\n\tout.re = this.re;\n\tout.im = this.im;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = toJSON;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Serializes a complex number as a string.\n*\n* @private\n* @returns {string} serialized complex number\n*/\nfunction toString() { // eslint-disable-line stdlib/no-redeclare\n\t/* eslint-disable no-invalid-this */\n\tvar str = '' + this.re;\n\tif ( this.im < 0 ) {\n\t\tstr += ' - ' + (-this.im);\n\t} else {\n\t\tstr += ' + ' + this.im;\n\t}\n\tstr += 'i';\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = toString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the imaginary component of a double-precision complex floating-point number.\n*\n* @module @stdlib/complex-imag\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var imag = require( '@stdlib/complex-imag' );\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var im = imag( z );\n* // returns 3.0\n*/\nfunction imag( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nmodule.exports = imag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the imaginary component of a single-precision complex floating-point number.\n*\n* @module @stdlib/complex-imagf\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var imagf = require( '@stdlib/complex-imagf' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the imaginary component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} imaginary component\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var im = imagf( z );\n* // returns 3.0\n*/\nfunction imagf( z ) {\n\treturn z.im;\n}\n\n\n// EXPORTS //\n\nmodule.exports = imagf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the real component of a double-precision complex floating-point number.\n*\n* @module @stdlib/complex-real\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n* var real = require( '@stdlib/complex-real' );\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a double-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* var Complex128 = require( '@stdlib/complex-float64' );\n*\n* var z = new Complex128( 5.0, 3.0 );\n*\n* var re = real( z );\n* // returns 5.0\n*/\nfunction real( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nmodule.exports = real;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the real component of a single-precision complex floating-point number.\n*\n* @module @stdlib/complex-realf\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n* var realf = require( '@stdlib/complex-realf' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = realf( z );\n* // returns 5.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the real component of a single-precision complex floating-point number.\n*\n* @param {Complex} z - complex number\n* @returns {number} real component\n*\n* @example\n* var Complex64 = require( '@stdlib/complex-float32' );\n*\n* var z = new Complex64( 5.0, 3.0 );\n*\n* var re = realf( z );\n* // returns 5.0\n*/\nfunction realf( z ) {\n\treturn z.re;\n}\n\n\n// EXPORTS //\n\nmodule.exports = realf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a generic array.\n*\n* @module @stdlib/constants-array-max-array-length\n*\n* @example\n* var MAX_ARRAY_LENGTH = require( '@stdlib/constants-array-max-array-length' );\n* // returns 4294967295\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a generic array.\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar MAX_ARRAY_LENGTH = 4294967295>>>0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = MAX_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum length of a typed array.\n*\n* @module @stdlib/constants-array-max-typed-array-length\n*\n* @example\n* var MAX_TYPED_ARRAY_LENGTH = require( '@stdlib/constants-array-max-typed-array-length' );\n* // returns 9007199254740991\n*/\n\n// MAIN //\n\n/**\n* Maximum length of a typed array.\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n*/\nvar MAX_TYPED_ARRAY_LENGTH = 9007199254740991;\n\n\n// EXPORTS //\n\nmodule.exports = MAX_TYPED_ARRAY_LENGTH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* The bias of a double-precision floating-point number's exponent.\n*\n* @module @stdlib/constants-float64-exponent-bias\n* @type {integer32}\n*\n* @example\n* var FLOAT64_EXPONENT_BIAS = require( '@stdlib/constants-float64-exponent-bias' );\n* // returns 1023\n*/\n\n\n// MAIN //\n\n/**\n* Bias of a double-precision floating-point number's exponent.\n*\n* ## Notes\n*\n* The bias can be computed via\n*\n* ```tex\n* \\mathrm{bias} = 2^{k-1} - 1\n* ```\n*\n* where \\\\(k\\\\) is the number of bits in the exponent; here, \\\\(k = 11\\\\).\n*\n* @constant\n* @type {integer32}\n* @default 1023\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_EXPONENT_BIAS = 1023|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_EXPONENT_BIAS;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* High word mask for excluding the sign bit of a double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-high-word-abs-mask\n* @type {uinteger32}\n*\n* @example\n* var FLOAT64_HIGH_WORD_ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\n* // returns 2147483647\n*/\n\n\n// MAIN //\n\n/**\n* High word mask for excluding the sign bit of a double-precision floating-point number.\n*\n* ## Notes\n*\n* The high word mask for excluding the sign bit of a double-precision floating-point number is an unsigned 32-bit integer with the value \\\\( 2147483647 \\\\), which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 11111111111 11111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 0x7fffffff\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_HIGH_WORD_ABS_MASK = 0x7fffffff>>>0; // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_HIGH_WORD_ABS_MASK;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* High word mask for the exponent of a double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-high-word-exponent-mask\n* @type {uinteger32}\n*\n* @example\n* var FLOAT64_HIGH_WORD_EXPONENT_MASK = require( '@stdlib/constants-float64-high-word-exponent-mask' );\n* // returns 2146435072\n*/\n\n\n// MAIN //\n\n/**\n* High word mask for the exponent of a double-precision floating-point number.\n*\n* ## Notes\n*\n* The high word mask for the exponent of a double-precision floating-point number is an unsigned 32-bit integer with the value \\\\( 2146435072 \\\\), which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 0x7ff00000\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_HIGH_WORD_EXPONENT_MASK = 0x7ff00000;\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_HIGH_WORD_EXPONENT_MASK;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* High word mask for the sign bit of a double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-high-word-sign-mask\n* @type {uinteger32}\n*\n* @example\n* var FLOAT64_HIGH_WORD_SIGN_MASK = require( '@stdlib/constants-float64-high-word-sign-mask' );\n* // returns 2147483648\n*/\n\n\n// MAIN //\n\n/**\n* High word mask for the sign bit of a double-precision floating-point number.\n*\n* ## Notes\n*\n* The high word mask for the sign bit of a double-precision floating-point number is an unsigned 32-bit integer with the value \\\\( 2147483648 \\\\), which corresponds to the bit sequence\n*\n* ```binarystring\n* 1 00000000000 00000000000000000000\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 0x80000000\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_HIGH_WORD_SIGN_MASK = 0x80000000>>>0; // eslint-disable-line id-length\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_HIGH_WORD_SIGN_MASK;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* High word mask for the significand of a double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-high-word-significand-mask\n* @type {uinteger32}\n*\n* @example\n* var FLOAT64_HIGH_WORD_SIGNIFICAND_MASK = require( '@stdlib/constants-float64-high-word-significand-mask' );\n* // returns 1048575\n*/\n\n\n// MAIN //\n\n/**\n* High word mask for the significand of a double-precision floating-point number.\n*\n* ## Notes\n*\n* The high word mask for the significand of a double-precision floating-point number is an unsigned 32-bit integer with the value \\\\( 1048575 \\\\), which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 00000000000 11111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 0x000fffff\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_HIGH_WORD_SIGNIFICAND_MASK = 0x000fffff;\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_HIGH_WORD_SIGNIFICAND_MASK;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Natural logarithm of `2`.\n*\n* @module @stdlib/constants-float64-ln-two\n* @type {number}\n*\n* @example\n* var LN2 = require( '@stdlib/constants-float64-ln-two' );\n* // returns 0.6931471805599453\n*/\n\n\n// MAIN //\n\n/**\n* Natural logarithm of `2`.\n*\n* ```tex\n* \\ln 2\n* ```\n*\n* @constant\n* @type {number}\n* @default 0.6931471805599453\n*/\nvar LN2 = 6.93147180559945309417232121458176568075500134360255254120680009493393621969694715605863326996418687542001481021e-01; // eslint-disable-line max-len\n\n\n// EXPORTS //\n\nmodule.exports = LN2;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* The maximum biased base 2 exponent for a subnormal double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-max-base2-exponent-subnormal\n* @type {integer32}\n*\n* @example\n* var FLOAT64_MAX_BASE2_EXPONENT_SUBNORMAL = require( '@stdlib/constants-float64-max-base2-exponent-subnormal' );\n* // returns -1023\n*/\n\n\n// MAIN //\n\n/**\n* The maximum biased base 2 exponent for a subnormal double-precision floating-point number.\n*\n* ```text\n* 00000000000 => 0 - BIAS = -1023\n* ```\n*\n* where `BIAS = 1023`.\n*\n* @constant\n* @type {integer32}\n* @default -1023\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_MAX_BASE2_EXPONENT_SUBNORMAL = -1023|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_MAX_BASE2_EXPONENT_SUBNORMAL;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* The maximum biased base 2 exponent for a double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-max-base2-exponent\n* @type {integer32}\n*\n* @example\n* var FLOAT64_MAX_BASE2_EXPONENT = require( '@stdlib/constants-float64-max-base2-exponent' );\n* // returns 1023\n*/\n\n\n// MAIN //\n\n/**\n* The maximum biased base 2 exponent for a double-precision floating-point number.\n*\n* ```text\n* 11111111110 => 2046 - BIAS = 1023\n* ```\n*\n* where `BIAS = 1023`.\n*\n* @constant\n* @type {integer32}\n* @default 1023\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_MAX_BASE2_EXPONENT = 1023|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_MAX_BASE2_EXPONENT;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum safe double-precision floating-point integer.\n*\n* @module @stdlib/constants-float64-max-safe-integer\n* @type {number}\n*\n* @example\n* var FLOAT64_MAX_SAFE_INTEGER = require( '@stdlib/constants-float64-max-safe-integer' );\n* // returns 9007199254740991\n*/\n\n\n// MAIN //\n\n/**\n* Maximum safe double-precision floating-point integer.\n*\n* ## Notes\n*\n* The integer has the value\n*\n* ```tex\n* 2^{53} - 1\n* ```\n*\n* @constant\n* @type {number}\n* @default 9007199254740991\n* @see [Safe Integers]{@link http://www.2ality.com/2013/10/safe-integers.html}\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_MAX_SAFE_INTEGER = 9007199254740991;\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_MAX_SAFE_INTEGER;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* The minimum biased base 2 exponent for a subnormal double-precision floating-point number.\n*\n* @module @stdlib/constants-float64-min-base2-exponent-subnormal\n* @type {integer32}\n*\n* @example\n* var FLOAT64_MIN_BASE2_EXPONENT_SUBNORMAL = require( '@stdlib/constants-float64-min-base2-exponent-subnormal' );\n* // returns -1074\n*/\n\n\n// MAIN //\n\n/**\n* The minimum biased base 2 exponent for a subnormal double-precision floating-point number.\n*\n* ```text\n* -(BIAS+(52-1)) = -(1023+51) = -1074\n* ```\n*\n* where `BIAS = 1023` and `52` is the number of digits in the significand.\n*\n* @constant\n* @type {integer32}\n* @default -1074\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_MIN_BASE2_EXPONENT_SUBNORMAL = -1074|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_MIN_BASE2_EXPONENT_SUBNORMAL;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* @module @stdlib/constants-float64-ninf\n* @type {number}\n*\n* @example\n* var FLOAT64_NINF = require( '@stdlib/constants-float64-ninf' );\n* // returns -Infinity\n*/\n\n// MODULES //\n\nvar Number = require( '@stdlib/number-ctor' );\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point negative infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point negative infinity has the bit sequence\n*\n* ```binarystring\n* 1 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.NEGATIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_NINF = Number.NEGATIVE_INFINITY;\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_NINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* @module @stdlib/constants-float64-pinf\n* @type {number}\n*\n* @example\n* var FLOAT64_PINF = require( '@stdlib/constants-float64-pinf' );\n* // returns Infinity\n*/\n\n\n// MAIN //\n\n/**\n* Double-precision floating-point positive infinity.\n*\n* ## Notes\n*\n* Double-precision floating-point positive infinity has the bit sequence\n*\n* ```binarystring\n* 0 11111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default Number.POSITIVE_INFINITY\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_PINF = Number.POSITIVE_INFINITY; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_PINF;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Smallest positive double-precision floating-point normal number.\n*\n* @module @stdlib/constants-float64-smallest-normal\n* @type {number}\n*\n* @example\n* var FLOAT64_SMALLEST_NORMAL = require( '@stdlib/constants-float64-smallest-normal' );\n* // returns 2.2250738585072014e-308\n*/\n\n\n// MAIN //\n\n/**\n* The smallest positive double-precision floating-point normal number.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* \\frac{1}{2^{1023-1}}\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0 00000000001 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {number}\n* @default 2.2250738585072014e-308\n* @see [IEEE 754]{@link https://en.wikipedia.org/wiki/IEEE_754-1985}\n*/\nvar FLOAT64_SMALLEST_NORMAL = 2.2250738585072014e-308;\n\n\n// EXPORTS //\n\nmodule.exports = FLOAT64_SMALLEST_NORMAL;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-max\n* @type {integer32}\n*\n* @example\n* var INT16_MAX = require( '@stdlib/constants-int16-max' );\n* // returns 32767\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{15} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 0111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 32767\n*/\nvar INT16_MAX = 32767|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 16-bit integer.\n*\n* @module @stdlib/constants-int16-min\n* @type {integer32}\n*\n* @example\n* var INT16_MIN = require( '@stdlib/constants-int16-min' );\n* // returns -32768\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{15})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 1000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -32768\n*/\nvar INT16_MIN = -32768|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT16_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-max\n* @type {integer32}\n*\n* @example\n* var INT32_MAX = require( '@stdlib/constants-int32-max' );\n* // returns 2147483647\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{31} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 2147483647\n*/\nvar INT32_MAX = 2147483647|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 32-bit integer.\n*\n* @module @stdlib/constants-int32-min\n* @type {integer32}\n*\n* @example\n* var INT32_MIN = require( '@stdlib/constants-int32-min' );\n* // returns -2147483648\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* -(2^{31})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000000000000000000000000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -2147483648\n*/\nvar INT32_MIN = -2147483648|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT32_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-max\n* @type {integer32}\n*\n* @example\n* var INT8_MAX = require( '@stdlib/constants-int8-max' );\n* // returns 127\n*/\n\n\n// MAIN //\n\n/**\n* Maximum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* 2^{7} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 01111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 127\n*/\nvar INT8_MAX = 127|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT8_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Minimum signed 8-bit integer.\n*\n* @module @stdlib/constants-int8-min\n* @type {integer32}\n*\n* @example\n* var INT8_MIN = require( '@stdlib/constants-int8-min' );\n* // returns -128\n*/\n\n\n// MAIN //\n\n/**\n* Minimum signed 8-bit integer.\n*\n* ## Notes\n*\n* The number is given by\n*\n* ```tex\n* -(2^{7})\n* ```\n*\n* which corresponds to the two's complement bit sequence\n*\n* ```binarystring\n* 10000000\n* ```\n*\n* @constant\n* @type {integer32}\n* @default -128\n*/\nvar INT8_MIN = -128|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = INT8_MIN;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* @module @stdlib/constants-uint16-max\n* @type {integer32}\n*\n* @example\n* var UINT16_MAX = require( '@stdlib/constants-uint16-max' );\n* // returns 65535\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 16-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{16} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 1111111111111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 65535\n*/\nvar UINT16_MAX = 65535|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = UINT16_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* @module @stdlib/constants-uint32-max\n* @type {uinteger32}\n*\n* @example\n* var UINT32_MAX = require( '@stdlib/constants-uint32-max' );\n* // returns 4294967295\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 32-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{32} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* @constant\n* @type {uinteger32}\n* @default 4294967295\n*/\nvar UINT32_MAX = 4294967295;\n\n\n// EXPORTS //\n\nmodule.exports = UINT32_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Maximum unsigned 8-bit integer.\n*\n* @module @stdlib/constants-uint8-max\n* @type {integer32}\n*\n* @example\n* var UINT8_MAX = require( '@stdlib/constants-uint8-max' );\n* // returns 255\n*/\n\n\n// MAIN //\n\n/**\n* Maximum unsigned 8-bit integer.\n*\n* ## Notes\n*\n* The number has the value\n*\n* ```tex\n* 2^{8} - 1\n* ```\n*\n* which corresponds to the bit sequence\n*\n* ```binarystring\n* 11111111\n* ```\n*\n* @constant\n* @type {integer32}\n* @default 255\n*/\nvar UINT8_MAX = 255|0; // asm type annotation\n\n\n// EXPORTS //\n\nmodule.exports = UINT8_MAX;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a finite numeric value is an even number.\n*\n* @module @stdlib/math-base-assert-is-even\n*\n* @example\n* var isEven = require( '@stdlib/math-base-assert-is-even' );\n*\n* var bool = isEven( 5.0 );\n* // returns false\n*\n* bool = isEven( -2.0 );\n* // returns true\n*\n* bool = isEven( 0.0 );\n* // returns true\n*\n* bool = isEven( NaN );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\n\n\n// MAIN //\n\n/**\n* Tests if a finite numeric value is an even number.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an even number\n*\n* @example\n* var bool = isEven( 5.0 );\n* // returns false\n*\n* @example\n* var bool = isEven( -2.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( 0.0 );\n* // returns true\n*\n* @example\n* var bool = isEven( NaN );\n* // returns false\n*/\nfunction isEven( x ) {\n\treturn isInteger( x/2.0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isEven;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a double-precision floating-point numeric value is infinite.\n*\n* @module @stdlib/math-base-assert-is-infinite\n*\n* @example\n* var isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\n*\n* var bool = isInfinite( Infinity );\n* // returns true\n*\n* bool = isInfinite( -Infinity );\n* // returns true\n*\n* bool = isInfinite( 5.0 );\n* // returns false\n*\n* bool = isInfinite( NaN );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\n\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is infinite.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is infinite\n*\n* @example\n* var bool = isInfinite( Infinity );\n* // returns true\n*\n* @example\n* var bool = isInfinite( -Infinity );\n* // returns true\n*\n* @example\n* var bool = isInfinite( 5.0 );\n* // returns false\n*\n* @example\n* var bool = isInfinite( NaN );\n* // returns false\n*/\nfunction isInfinite( x ) {\n\treturn (x === PINF || x === NINF);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInfinite;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a finite double-precision floating-point number is an integer.\n*\n* @module @stdlib/math-base-assert-is-integer\n*\n* @example\n* var isInteger = require( '@stdlib/math-base-assert-is-integer' );\n*\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* bool = isInteger( 3.14 );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar floor = require( '@stdlib/math-base-special-floor' );\n\n\n// MAIN //\n\n/**\n* Tests if a finite double-precision floating-point number is an integer.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an integer\n*\n* @example\n* var bool = isInteger( 1.0 );\n* // returns true\n*\n* @example\n* var bool = isInteger( 3.14 );\n* // returns false\n*/\nfunction isInteger( x ) {\n\treturn (floor(x) === x);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a double-precision floating-point numeric value is `NaN`.\n*\n* @module @stdlib/math-base-assert-is-nan\n*\n* @example\n* var isnan = require( '@stdlib/math-base-assert-is-nan' );\n*\n* var bool = isnan( NaN );\n* // returns true\n*\n* bool = isnan( 7.0 );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is `NaN`.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is `NaN`\n*\n* @example\n* var bool = isnan( NaN );\n* // returns true\n*\n* @example\n* var bool = isnan( 7.0 );\n* // returns false\n*/\nfunction isnan( x ) {\n\treturn ( x !== x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isnan;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a finite numeric value is an odd number.\n*\n* @module @stdlib/math-base-assert-is-odd\n*\n* @example\n* var isOdd = require( '@stdlib/math-base-assert-is-odd' );\n*\n* var bool = isOdd( 5.0 );\n* // returns true\n*\n* bool = isOdd( -2.0 );\n* // returns false\n*\n* bool = isOdd( 0.0 );\n* // returns false\n*\n* bool = isOdd( NaN );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isEven = require( '@stdlib/math-base-assert-is-even' );\n\n\n// MAIN //\n\n/**\n* Tests if a finite numeric value is an odd number.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is an odd number\n*\n* @example\n* var bool = isOdd( 5.0 );\n* // returns true\n*\n* @example\n* var bool = isOdd( -2.0 );\n* // returns false\n*\n* @example\n* var bool = isOdd( 0.0 );\n* // returns false\n*\n* @example\n* var bool = isOdd( NaN );\n* // returns false\n*/\nfunction isOdd( x ) {\n\t// Check sign to prevent overflow...\n\tif ( x > 0.0 ) {\n\t\treturn isEven( x-1.0 );\n\t}\n\treturn isEven( x+1.0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isOdd;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Test if a double-precision floating-point numeric value is positive zero.\n*\n* @module @stdlib/math-base-assert-is-positive-zero\n*\n* @example\n* var isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );\n*\n* var bool = isPositiveZero( 0.0 );\n* // returns true\n*\n* bool = isPositiveZero( -0.0 );\n* // returns false\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar PINF = require( '@stdlib/constants-float64-pinf' );\n\n\n// MAIN //\n\n/**\n* Tests if a double-precision floating-point numeric value is positive zero.\n*\n* @param {number} x - value to test\n* @returns {boolean} boolean indicating whether the value is positive zero\n*\n* @example\n* var bool = isPositiveZero( 0.0 );\n* // returns true\n*\n* @example\n* var bool = isPositiveZero( -0.0 );\n* // returns false\n*/\nfunction isPositiveZero( x ) {\n\treturn (x === 0.0 && 1.0/x === PINF);\n}\n\n\n// EXPORTS //\n\nmodule.exports = isPositiveZero;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Perform C-like multiplication of two unsigned 32-bit integers.\n*\n* @module @stdlib/math-base-ops-umul\n*\n* @example\n* var umul = require( '@stdlib/math-base-ops-umul' );\n*\n* var v = umul( 10>>>0, 4>>>0 );\n* // returns 40\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\n// Define a mask for the least significant 16 bits (low word): 65535 => 0x0000ffff => 00000000000000001111111111111111\nvar LOW_WORD_MASK = 0x0000ffff>>>0; // asm type annotation\n\n\n// MAIN //\n\n/**\n* Performs C-like multiplication of two unsigned 32-bit integers.\n*\n* ## Method\n*\n* - To emulate C-like multiplication without the aid of 64-bit integers, we recognize that a 32-bit integer can be split into two 16-bit words\n*\n* ```tex\n* a = w_h*2^{16} + w_l\n* ```\n*\n* where \\\\( w_h \\\\) is the most significant 16 bits and \\\\( w_l \\\\) is the least significant 16 bits. For example, consider the maximum unsigned 32-bit integer \\\\( 2^{32}-1 \\\\)\n*\n* ```binarystring\n* 11111111111111111111111111111111\n* ```\n*\n* The 16-bit high word is then\n*\n* ```binarystring\n* 1111111111111111\n* ```\n*\n* and the 16-bit low word\n*\n* ```binarystring\n* 1111111111111111\n* ```\n*\n* If we cast the high word to 32-bit precision and multiply by \\\\( 2^{16} \\\\) (equivalent to a 16-bit left shift), then the bit sequence is\n*\n* ```binarystring\n* 11111111111111110000000000000000\n* ```\n*\n* Similarly, upon casting the low word to 32-bit precision, the bit sequence is\n*\n* ```binarystring\n* 00000000000000001111111111111111\n* ```\n*\n* From the rules of binary addition, we recognize that adding the two 32-bit values for the high and low words will return our original value \\\\( 2^{32}-1 \\\\).\n*\n* - Accordingly, the multiplication of two 32-bit integers can be expressed\n*\n* ```tex\n* \\begin{align*}\n* a \\cdot b &= ( a_h \\cdot 2^{16} + a_l) \\cdot ( b_h \\cdot 2^{16} + b_l) \\\\\n* &= a_l \\cdot b_l + a_h \\cdot b_l \\cdot 2^{16} + a_l \\cdot b_h \\cdot 2^{16} + (a_h \\cdot b_h) \\cdot 2^{32} \\\\\n* &= a_l \\cdot b_l + (a_h \\cdot b_l + a_l \\cdot b_h) \\cdot 2^{16} + (a_h \\cdot b_h) \\cdot 2^{32}\n* \\end{align*}\n* ```\n*\n* - We note that multiplying (dividing) an integer by \\\\( 2^n \\\\) is equivalent to performing a left (right) shift of \\\\( n \\\\) bits.\n*\n* - Further, as we want to return an integer of the same precision, for a 32-bit integer, the return value will be modulo \\\\( 2^{32} \\\\). Stated another way, we only care about the low word of a 64-bit result.\n*\n* - Accordingly, the last term, being evenly divisible by \\\\( 2^{32} \\\\), drops from the equation leaving the remaining two terms as the remainder.\n*\n* ```tex\n* a \\cdot b = a_l \\cdot b_l + (a_h \\cdot b_l + a_l \\cdot b_h) << 16\n* ```\n*\n* - Lastly, the second term in the above equation contributes to the middle bits and may cause the product to \"overflow\". However, we can disregard (`>>>0`) overflow bits due to modulo arithmetic, as discussed earlier with regard to the term involving the partial product of high words.\n*\n* @param {uinteger32} a - integer\n* @param {uinteger32} b - integer\n* @returns {uinteger32} product\n*\n* @example\n* var v = umul( 10>>>0, 4>>>0 );\n* // returns 40\n*/\nfunction umul( a, b ) {\n\tvar lbits;\n\tvar mbits;\n\tvar ha;\n\tvar hb;\n\tvar la;\n\tvar lb;\n\n\ta >>>= 0; // asm type annotation\n\tb >>>= 0; // asm type annotation\n\n\t// Isolate the most significant 16-bits:\n\tha = ( a>>>16 )>>>0; // asm type annotation\n\thb = ( b>>>16 )>>>0; // asm type annotation\n\n\t// Isolate the least significant 16-bits:\n\tla = ( a&LOW_WORD_MASK )>>>0; // asm type annotation\n\tlb = ( b&LOW_WORD_MASK )>>>0; // asm type annotation\n\n\t// Compute partial sums:\n\tlbits = ( la*lb )>>>0; // asm type annotation; no integer overflow possible\n\tmbits = ( ((ha*lb) + (la*hb))<<16 )>>>0; // asm type annotation; possible integer overflow\n\n\t// The final `>>>0` converts the intermediate sum to an unsigned integer (possible integer overflow during sum):\n\treturn ( lbits + mbits )>>>0; // asm type annotation\n}\n\n\n// EXPORTS //\n\nmodule.exports = umul;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute an absolute value of a double-precision floating-point number.\n*\n* @module @stdlib/math-base-special-abs\n*\n* @example\n* var abs = require( '@stdlib/math-base-special-abs' );\n*\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* v = abs( 2.0 );\n* // returns 2.0\n*\n* v = abs( 0.0 );\n* // returns 0.0\n*\n* v = abs( -0.0 );\n* // returns 0.0\n*\n* v = abs( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Computes the absolute value of a double-precision floating-point number `x`.\n*\n* @param {number} x - input value\n* @returns {number} absolute value\n*\n* @example\n* var v = abs( -1.0 );\n* // returns 1.0\n*\n* @example\n* var v = abs( 2.0 );\n* // returns 2.0\n*\n* @example\n* var v = abs( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( -0.0 );\n* // returns 0.0\n*\n* @example\n* var v = abs( NaN );\n* // returns NaN\n*/\nfunction abs( x ) {\n\treturn Math.abs( x ); // eslint-disable-line stdlib/no-builtin-math\n}\n\n\n// EXPORTS //\n\nmodule.exports = abs;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Round a double-precision floating-point number toward positive infinity.\n*\n* @module @stdlib/math-base-special-ceil\n*\n* @example\n* var ceil = require( '@stdlib/math-base-special-ceil' );\n*\n* var v = ceil( -4.2 );\n* // returns -4.0\n*\n* v = ceil( 9.99999 );\n* // returns 10.0\n*\n* v = ceil( 0.0 );\n* // returns 0.0\n*\n* v = ceil( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward positive infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = ceil( -4.2 );\n* // returns -4.0\n*\n* @example\n* var v = ceil( 9.99999 );\n* // returns 10.0\n*\n* @example\n* var v = ceil( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = ceil( NaN );\n* // returns NaN\n*/\nvar ceil = Math.ceil; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = ceil;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a double-precision floating-point number with the magnitude of `x` and the sign of `y`.\n*\n* @module @stdlib/math-base-special-copysign\n*\n* @example\n* var copysign = require( '@stdlib/math-base-special-copysign' );\n*\n* var z = copysign( -3.14, 10.0 );\n* // returns 3.14\n*\n* z = copysign( 3.14, -1.0 );\n* // returns -3.14\n*\n* z = copysign( 1.0, -0.0 );\n* // returns -1.0\n*\n* z = copysign( -3.14, -0.0 );\n* // returns -3.14\n*\n* z = copysign( -0.0, 1.0 );\n* // returns 0.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar SIGN_MASK = require( '@stdlib/constants-float64-high-word-sign-mask' );\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar toWords = require( '@stdlib/number-float64-base-to-words' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar fromWords = require( '@stdlib/number-float64-base-from-words' );\n\n\n// VARIABLES //\n\n// High/low words workspace:\nvar WORDS = [ 0, 0 ];\n\n\n// MAIN //\n\n/**\n* Returns a double-precision floating-point number with the magnitude of `x` and the sign of `y`.\n*\n* @param {number} x - number from which to derive a magnitude\n* @param {number} y - number from which to derive a sign\n* @returns {number} a double-precision floating-point number\n*\n* @example\n* var z = copysign( -3.14, 10.0 );\n* // returns 3.14\n*\n* @example\n* var z = copysign( 3.14, -1.0 );\n* // returns -3.14\n*\n* @example\n* var z = copysign( 1.0, -0.0 );\n* // returns -1.0\n*\n* @example\n* var z = copysign( -3.14, -0.0 );\n* // returns -3.14\n*\n* @example\n* var z = copysign( -0.0, 1.0 );\n* // returns 0.0\n*/\nfunction copysign( x, y ) {\n\tvar hx;\n\tvar hy;\n\n\t// Split `x` into higher and lower order words:\n\ttoWords.assign( x, WORDS, 1, 0 );\n\thx = WORDS[ 0 ];\n\n\t// Turn off the sign bit of `x`:\n\thx &= ABS_MASK;\n\n\t// Extract the higher order word from `y`:\n\thy = getHighWord( y );\n\n\t// Leave only the sign bit of `y` turned on:\n\thy &= SIGN_MASK;\n\n\t// Copy the sign bit of `y` to `x`:\n\thx |= hy;\n\n\t// Return a new value having the same magnitude as `x`, but with the sign of `y`:\n\treturn fromWords( hx, WORDS[ 1 ] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = copysign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (c) 2009 The Go Authors. All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are\n* met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following disclaimer\n* in the documentation and/or other materials provided with the\n* distribution.\n* * Neither the name of Google Inc. nor the names of its\n* contributors may be used to endorse or promote products derived from\n* this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n* ```\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar polyvalP = require( './polyval_p.js' );\n\n\n// MAIN //\n\n/**\n* Computes \\\\(e^{r} 2^k\\\\) where \\\\(r = \\mathrm{hi} - \\mathrm{lo}\\\\) and \\\\(|r| \\leq \\ln(2)/2\\\\).\n*\n* @private\n* @param {number} hi - upper bound\n* @param {number} lo - lower bound\n* @param {integer} k - power of 2\n* @returns {number} function value\n*/\nfunction expmulti( hi, lo, k ) {\n\tvar r;\n\tvar t;\n\tvar c;\n\tvar y;\n\n\tr = hi - lo;\n\tt = r * r;\n\tc = r - ( t*polyvalP( t ) );\n\ty = 1.0 - ( lo - ( (r*c)/(2.0-c) ) - hi);\n\n\treturn ldexp( y, k );\n}\n\n\n// EXPORTS //\n\nmodule.exports = expmulti;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the natural exponential function.\n*\n* @module @stdlib/math-base-special-exp\n*\n* @example\n* var exp = require( '@stdlib/math-base-special-exp' );\n*\n* var v = exp( 4.0 );\n* // returns ~54.5982\n*\n* v = exp( -9.0 );\n* // returns ~1.234e-4\n*\n* v = exp( 0.0 );\n* // returns 1.0\n*\n* v = exp( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyrights, licenses, and long comment were part of the original implementation available as part of [Go]{@link https://github.com/golang/go/blob/cb07765045aed5104a3df31507564ac99e6ddce8/src/math/exp.go}, which in turn was based on an implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_exp.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (c) 2009 The Go Authors. All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions are\n* met:\n*\n* * Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n* * Redistributions in binary form must reproduce the above\n* copyright notice, this list of conditions and the following disclaimer\n* in the documentation and/or other materials provided with the\n* distribution.\n* * Neither the name of Google Inc. nor the names of its\n* contributors may be used to endorse or promote products derived from\n* this software without specific prior written permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT\n* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,\n* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT\n* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,\n* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY\n* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT\n* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n* ```\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar trunc = require( '@stdlib/math-base-special-trunc' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar expmulti = require( './expmulti.js' );\n\n\n// VARIABLES //\n\nvar LN2_HI = 6.93147180369123816490e-01;\nvar LN2_LO = 1.90821492927058770002e-10;\nvar LOG2_E = 1.44269504088896338700e+00;\nvar OVERFLOW = 7.09782712893383973096e+02;\nvar UNDERFLOW = -7.45133219101941108420e+02;\nvar NEARZERO = 1.0 / (1 << 28); // 2^-28\nvar NEG_NEARZERO = -NEARZERO;\n\n\n// MAIN //\n\n/**\n* Evaluates the natural exponential function.\n*\n* ## Method\n*\n* 1. We reduce \\\\( x \\\\) to an \\\\( r \\\\) so that \\\\( |r| \\leq 0.5 \\cdot \\ln(2) \\approx 0.34658 \\\\). Given \\\\( x \\\\), we find an \\\\( r \\\\) and integer \\\\( k \\\\) such that\n*\n* ```tex\n* \\begin{align*}\n* x &= k \\cdot \\ln(2) + r \\\\\n* |r| &\\leq 0.5 \\cdot \\ln(2)\n* \\end{align*}\n* ```\n*\n* \n*\n* \\\\( r \\\\) can be represented as \\\\( r = \\mathrm{hi} - \\mathrm{lo} \\\\) for better accuracy.\n*\n* \n*\n* 2. We approximate of \\\\( e^{r} \\\\) by a special rational function on the interval \\\\(\\[0,0.34658]\\\\):\n*\n* ```tex\n* \\begin{align*}\n* R\\left(r^2\\right) &= r \\cdot \\frac{ e^{r}+1 }{ e^{r}-1 } \\\\\n* &= 2 + \\frac{r^2}{6} - \\frac{r^4}{360} + \\ldots\n* \\end{align*}\n* ```\n*\n* We use a special Remes algorithm on \\\\(\\[0,0.34658]\\\\) to generate a polynomial of degree \\\\(5\\\\) to approximate \\\\(R\\\\). The maximum error of this polynomial approximation is bounded by \\\\(2^{-59}\\\\). In other words,\n*\n* ```tex\n* R(z) \\sim 2 + P_1 z + P_2 z^2 + P_3 z^3 + P_4 z^4 + P_5 z^5\n* ```\n*\n* where \\\\( z = r^2 \\\\) and\n*\n* ```tex\n* \\left| 2 + P_1 z + \\ldots + P_5 z^5 - R(z) \\right| \\leq 2^{-59}\n* ```\n*\n* \n*\n* The values of \\\\( P_1 \\\\) to \\\\( P_5 \\\\) are listed in the source code.\n*\n* \n*\n* The computation of \\\\( e^{r} \\\\) thus becomes\n*\n* ```tex\n* \\begin{align*}\n* e^{r} &= 1 + \\frac{2r}{R-r} \\\\\n* &= 1 + r + \\frac{r \\cdot R_1(r)}{2 - R_1(r)}\\ \\text{for better accuracy}\n* \\end{align*}\n* ```\n*\n* where\n*\n* ```tex\n* R_1(r) = r - P_1\\ r^2 + P_2\\ r^4 + \\ldots + P_5\\ r^{10}\n* ```\n*\n* 3. We scale back to obtain \\\\( e^{x} \\\\). From step 1, we have\n*\n* ```tex\n* e^{x} = 2^k e^{r}\n* ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* e^\\infty &= \\infty \\\\\n* e^{-\\infty} &= 0 \\\\\n* e^{\\mathrm{NaN}} &= \\mathrm{NaN} \\\\\n* e^0 &= 1\\ \\mathrm{is\\ exact\\ for\\ finite\\ argument\\ only}\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* - According to an error analysis, the error is always less than \\\\(1\\\\) ulp (unit in the last place).\n*\n* - For an IEEE double,\n*\n* - if \\\\(x > 7.09782712893383973096\\mbox{e+}02\\\\), then \\\\(e^{x}\\\\) overflows\n* - if \\\\(x < -7.45133219101941108420\\mbox{e+}02\\\\), then \\\\(e^{x}\\\\) underflows\n*\n* - The hexadecimal values included in the source code are the intended ones for the used constants. Decimal values may be used, provided that the compiler will convert from decimal to binary accurately enough to produce the intended hexadecimal values.\n*\n* @param {number} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = exp( 4.0 );\n* // returns ~54.5982\n*\n* @example\n* var v = exp( -9.0 );\n* // returns ~1.234e-4\n*\n* @example\n* var v = exp( 0.0 );\n* // returns 1.0\n*\n* @example\n* var v = exp( NaN );\n* // returns NaN\n*/\nfunction exp( x ) {\n\tvar hi;\n\tvar lo;\n\tvar k;\n\n\tif ( isnan( x ) || x === PINF ) {\n\t\treturn x;\n\t}\n\tif ( x === NINF ) {\n\t\treturn 0.0;\n\t}\n\tif ( x > OVERFLOW ) {\n\t\treturn PINF;\n\t}\n\tif ( x < UNDERFLOW ) {\n\t\treturn 0.0;\n\t}\n\tif (\n\t\tx > NEG_NEARZERO &&\n\t\tx < NEARZERO\n\t) {\n\t\treturn 1.0 + x;\n\t}\n\t// Reduce and compute `r = hi - lo` for extra precision...\n\tif ( x < 0.0 ) {\n\t\tk = trunc( (LOG2_E*x) - 0.5 );\n\t} else {\n\t\tk = trunc( (LOG2_E*x) + 0.5 );\n\t}\n\thi = x - (k*LN2_HI);\n\tlo = k * LN2_LO;\n\n\treturn expmulti( hi, lo, k );\n}\n\n\n// EXPORTS //\n\nmodule.exports = exp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.16666666666666602;\n\t}\n\treturn 0.16666666666666602 + (x * (-0.0027777777777015593 + (x * (0.00006613756321437934 + (x * (-0.0000016533902205465252 + (x * 4.1381367970572385e-8))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Round a double-precision floating-point number toward negative infinity.\n*\n* @module @stdlib/math-base-special-floor\n*\n* @example\n* var floor = require( '@stdlib/math-base-special-floor' );\n*\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* v = floor( 9.99999 );\n* // returns 9.0\n*\n* v = floor( 0.0 );\n* // returns 0.0\n*\n* v = floor( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// TODO: implementation (?)\n\n/**\n* Rounds a double-precision floating-point number toward negative infinity.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = floor( -4.2 );\n* // returns -5.0\n*\n* @example\n* var v = floor( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = floor( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = floor( NaN );\n* // returns NaN\n*/\nvar floor = Math.floor; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = floor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Multiply a double-precision floating-point number by an integer power of two.\n*\n* @module @stdlib/math-base-special-ldexp\n*\n* @example\n* var ldexp = require( '@stdlib/math-base-special-ldexp' );\n*\n* var x = ldexp( 0.5, 3 ); // => 0.5 * 2^3 = 0.5 * 8\n* // returns 4.0\n*\n* x = ldexp( 4.0, -2 ); // => 4 * 2^(-2) = 4 * (1/4)\n* // returns 1.0\n*\n* x = ldexp( 0.0, 20 );\n* // returns 0.0\n*\n* x = ldexp( -0.0, 39 );\n* // returns -0.0\n*\n* x = ldexp( NaN, -101 );\n* // returns NaN\n*\n* x = ldexp( Infinity, 11 );\n* // returns Infinity\n*\n* x = ldexp( -Infinity, -118 );\n* // returns -Infinity\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// NOTES //\n\n/*\n* => ldexp: load exponent (see [The Open Group]{@link http://pubs.opengroup.org/onlinepubs/9699919799/functions/ldexp.html} and [cppreference]{@link http://en.cppreference.com/w/c/numeric/math/ldexp}).\n*/\n\n\n// MODULES //\n\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar MAX_EXPONENT = require( '@stdlib/constants-float64-max-base2-exponent' );\nvar MAX_SUBNORMAL_EXPONENT = require( '@stdlib/constants-float64-max-base2-exponent-subnormal' );\nvar MIN_SUBNORMAL_EXPONENT = require( '@stdlib/constants-float64-min-base2-exponent-subnormal' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\nvar copysign = require( '@stdlib/math-base-special-copysign' );\nvar normalize = require( '@stdlib/number-float64-base-normalize' ).assign;\nvar floatExp = require( '@stdlib/number-float64-base-exponent' );\nvar toWords = require( '@stdlib/number-float64-base-to-words' );\nvar fromWords = require( '@stdlib/number-float64-base-from-words' );\n\n\n// VARIABLES //\n\n// 1/(1<<52) = 1/(2**52) = 1/4503599627370496\nvar TWO52_INV = 2.220446049250313e-16;\n\n// Exponent all 0s: 1 00000000000 11111111111111111111 => 2148532223\nvar CLEAR_EXP_MASK = 0x800fffff>>>0; // asm type annotation\n\n// Normalization workspace:\nvar FRAC = [ 0.0, 0.0 ];\n\n// High/low words workspace:\nvar WORDS = [ 0, 0 ];\n\n\n// MAIN //\n\n/**\n* Multiplies a double-precision floating-point number by an integer power of two.\n*\n* @param {number} frac - fraction\n* @param {integer} exp - exponent\n* @returns {number} double-precision floating-point number\n*\n* @example\n* var x = ldexp( 0.5, 3 ); // => 0.5 * 2^3 = 0.5 * 8\n* // returns 4.0\n*\n* @example\n* var x = ldexp( 4.0, -2 ); // => 4 * 2^(-2) = 4 * (1/4)\n* // returns 1.0\n*\n* @example\n* var x = ldexp( 0.0, 20 );\n* // returns 0.0\n*\n* @example\n* var x = ldexp( -0.0, 39 );\n* // returns -0.0\n*\n* @example\n* var x = ldexp( NaN, -101 );\n* // returns NaN\n*\n* @example\n* var x = ldexp( Infinity, 11 );\n* // returns Infinity\n*\n* @example\n* var x = ldexp( -Infinity, -118 );\n* // returns -Infinity\n*/\nfunction ldexp( frac, exp ) {\n\tvar high;\n\tvar m;\n\tif (\n\t\texp === 0 ||\n\t\tfrac === 0.0 || // handles +-0\n\t\tisnan( frac ) ||\n\t\tisInfinite( frac )\n\t) {\n\t\treturn frac;\n\t}\n\t// Normalize the input fraction:\n\tnormalize( frac, FRAC, 1, 0 );\n\tfrac = FRAC[ 0 ];\n\texp += FRAC[ 1 ];\n\n\t// Extract the exponent from `frac` and add it to `exp`:\n\texp += floatExp( frac );\n\n\t// Check for underflow/overflow...\n\tif ( exp < MIN_SUBNORMAL_EXPONENT ) {\n\t\treturn copysign( 0.0, frac );\n\t}\n\tif ( exp > MAX_EXPONENT ) {\n\t\tif ( frac < 0.0 ) {\n\t\t\treturn NINF;\n\t\t}\n\t\treturn PINF;\n\t}\n\t// Check for a subnormal and scale accordingly to retain precision...\n\tif ( exp <= MAX_SUBNORMAL_EXPONENT ) {\n\t\texp += 52;\n\t\tm = TWO52_INV;\n\t} else {\n\t\tm = 1.0;\n\t}\n\t// Split the fraction into higher and lower order words:\n\ttoWords.assign( frac, WORDS, 1, 0 );\n\thigh = WORDS[ 0 ];\n\n\t// Clear the exponent bits within the higher order word:\n\thigh &= CLEAR_EXP_MASK;\n\n\t// Set the exponent bits to the new exponent:\n\thigh |= ((exp+BIAS) << 20);\n\n\t// Create a new floating-point number:\n\treturn m * fromWords( high, WORDS[ 1 ] );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ldexp;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the natural logarithm of a double-precision floating-point number.\n*\n* @module @stdlib/math-base-special-ln\n*\n* @example\n* var ln = require( '@stdlib/math-base-special-ln' );\n*\n* var v = ln( 4.0 );\n* // returns ~1.386\n*\n* v = ln( 0.0 );\n* // returns -Infinity\n*\n* v = ln( Infinity );\n* // returns Infinity\n*\n* v = ln( NaN );\n* // returns NaN\n*\n* v = ln( -4.0 );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/e_log.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar polyvalP = require( './polyval_p.js' );\nvar polyvalQ = require( './polyval_q.js' );\n\n\n// VARIABLES //\n\nvar LN2_HI = 6.93147180369123816490e-01; // 3FE62E42 FEE00000\nvar LN2_LO = 1.90821492927058770002e-10; // 3DEA39EF 35793C76\nvar TWO54 = 1.80143985094819840000e+16; // 0x43500000, 0x00000000\nvar ONE_THIRD = 0.33333333333333333;\n\n// 0x000fffff = 1048575 => 0 00000000000 11111111111111111111\nvar HIGH_SIGNIFICAND_MASK = 0x000fffff|0; // asm type annotation\n\n// 0x7ff00000 = 2146435072 => 0 11111111111 00000000000000000000 => biased exponent: 2047 = 1023+1023 => 2^1023\nvar HIGH_MAX_NORMAL_EXP = 0x7ff00000|0; // asm type annotation\n\n// 0x00100000 = 1048576 => 0 00000000001 00000000000000000000 => biased exponent: 1 = -1022+1023 => 2^-1022\nvar HIGH_MIN_NORMAL_EXP = 0x00100000|0; // asm type annotation\n\n// 0x3ff00000 = 1072693248 => 0 01111111111 00000000000000000000 => biased exponent: 1023 = 0+1023 => 2^0 = 1\nvar HIGH_BIASED_EXP_0 = 0x3ff00000|0; // asm type annotation\n\n\n// MAIN //\n\n/**\n* Evaluates the natural logarithm of a double-precision floating-point number.\n*\n* @param {NonNegativeNumber} x - input value\n* @returns {number} function value\n*\n* @example\n* var v = ln( 4.0 );\n* // returns ~1.386\n*\n* @example\n* var v = ln( 0.0 );\n* // returns -Infinity\n*\n* @example\n* var v = ln( Infinity );\n* // returns Infinity\n*\n* @example\n* var v = ln( NaN );\n* // returns NaN\n*\n* @example\n* var v = ln( -4.0 );\n* // returns NaN\n*/\nfunction ln( x ) {\n\tvar hfsq;\n\tvar hx;\n\tvar t2;\n\tvar t1;\n\tvar k;\n\tvar R;\n\tvar f;\n\tvar i;\n\tvar j;\n\tvar s;\n\tvar w;\n\tvar z;\n\n\tif ( x === 0.0 ) {\n\t\treturn NINF;\n\t}\n\tif ( isnan( x ) || x < 0.0 ) {\n\t\treturn NaN;\n\t}\n\thx = getHighWord( x );\n\tk = 0|0; // asm type annotation\n\tif ( hx < HIGH_MIN_NORMAL_EXP ) {\n\t\t// Case: 0 < x < 2**-1022\n\t\tk -= 54|0; // asm type annotation\n\n\t\t// Subnormal number, scale up `x`:\n\t\tx *= TWO54;\n\t\thx = getHighWord( x );\n\t}\n\tif ( hx >= HIGH_MAX_NORMAL_EXP ) {\n\t\treturn x + x;\n\t}\n\tk += ( ( hx>>20 ) - BIAS )|0; // asm type annotation\n\thx &= HIGH_SIGNIFICAND_MASK;\n\ti = ( (hx+0x95f64) & 0x100000 )|0; // asm type annotation\n\n\t// Normalize `x` or `x/2`...\n\tx = setHighWord( x, hx|(i^HIGH_BIASED_EXP_0) );\n\tk += ( i>>20 )|0; // asm type annotation\n\tf = x - 1.0;\n\tif ( (HIGH_SIGNIFICAND_MASK&(2+hx)) < 3 ) {\n\t\t// Case: -2**-20 <= f < 2**-20\n\t\tif ( f === 0.0 ) {\n\t\t\tif ( k === 0 ) {\n\t\t\t\treturn 0.0;\n\t\t\t}\n\t\t\treturn (k * LN2_HI) + (k * LN2_LO);\n\t\t}\n\t\tR = f * f * ( 0.5 - (ONE_THIRD*f) );\n\t\tif ( k === 0 ) {\n\t\t\treturn f - R;\n\t\t}\n\t\treturn (k * LN2_HI) - ( (R-(k*LN2_LO)) - f );\n\t}\n\ts = f / (2.0 + f);\n\tz = s * s;\n\ti = ( hx - 0x6147a )|0; // asm type annotation\n\tw = z * z;\n\tj = ( 0x6b851 - hx )|0; // asm type annotation\n\tt1 = w * polyvalP( w );\n\tt2 = z * polyvalQ( w );\n\ti |= j;\n\tR = t2 + t1;\n\tif ( i > 0 ) {\n\t\thfsq = 0.5 * f * f;\n\t\tif ( k === 0 ) {\n\t\t\treturn f - ( hfsq - (s * (hfsq+R)) );\n\t\t}\n\t\treturn (k * LN2_HI) - ( hfsq - ((s*(hfsq+R))+(k*LN2_LO)) - f );\n\t}\n\tif ( k === 0 ) {\n\t\treturn f - (s*(f-R));\n\t}\n\treturn (k * LN2_HI) - ( ( (s*(f-R)) - (k*LN2_LO) ) - f );\n}\n\n\n// EXPORTS //\n\nmodule.exports = ln;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.3999999999940942;\n\t}\n\treturn 0.3999999999940942 + (x * (0.22222198432149784 + (x * 0.15313837699209373))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.6666666666666735;\n\t}\n\treturn 0.6666666666666735 + (x * (0.2857142874366239 + (x * (0.1818357216161805 + (x * 0.14798198605116586))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the maximum value.\n*\n* @module @stdlib/math-base-special-max\n*\n* @example\n* var max = require( '@stdlib/math-base-special-max' );\n*\n* var v = max( 3.14, 4.2 );\n* // returns 4.2\n*\n* v = max( 3.14, NaN );\n* // returns NaN\n*\n* v = max( +0.0, -0.0 );\n* // returns +0.0\n*/\n\n// MODULES //\n\nvar max = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = max;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPositiveZero = require( '@stdlib/math-base-assert-is-positive-zero' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\n\n\n// MAIN //\n\n/**\n* Returns the maximum value.\n*\n* @param {number} x - first number\n* @param {number} y - second number\n* @returns {number} maximum value\n*\n* @example\n* var v = max( 3.14, 4.2 );\n* // returns 4.2\n*\n* @example\n* var v = max( 3.14, NaN );\n* // returns NaN\n*\n* @example\n* var v = max( +0.0, -0.0 );\n* // returns +0.0\n*/\nfunction max( x, y ) {\n\tif ( isnan( x ) || isnan( y ) ) {\n\t\treturn NaN;\n\t}\n\tif ( x === PINF || y === PINF ) {\n\t\treturn PINF;\n\t}\n\tif ( x === y && x === 0.0 ) {\n\t\tif ( isPositiveZero( x ) ) {\n\t\t\treturn x;\n\t\t}\n\t\treturn y;\n\t}\n\tif ( x > y ) {\n\t\treturn x;\n\t}\n\treturn y;\n}\n\n\n// EXPORTS //\n\nmodule.exports = max;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Evaluate the exponential function.\n*\n* @module @stdlib/math-base-special-pow\n*\n* @example\n* var pow = require( '@stdlib/math-base-special-pow' );\n*\n* var v = pow( 2.0, 3.0 );\n* // returns 8.0\n*\n* v = pow( 4.0, 0.5 );\n* // returns 2.0\n*\n* v = pow( 100.0, 0.0 );\n* // returns 1.0\n*\n* v = pow( 3.141592653589793, 5.0 );\n* // returns ~306.0197\n*\n* v = pow( 3.141592653589793, -0.2 );\n* // returns ~0.7954\n*\n* v = pow( NaN, 3.0 );\n* // returns NaN\n*\n* v = pow( 5.0, NaN );\n* // returns NaN\n*\n* v = pow( NaN, NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar polyvalL = require( './polyval_l.js' );\n\n\n// VARIABLES //\n\n// 0x000fffff = 1048575 => 0 00000000000 11111111111111111111\nvar HIGH_SIGNIFICAND_MASK = 0x000fffff|0; // asm type annotation\n\n// 0x00100000 = 1048576 => 0 00000000001 00000000000000000000 => biased exponent: 1 = -1022+1023 => 2^-1022\nvar HIGH_MIN_NORMAL_EXP = 0x00100000|0; // asm type annotation\n\n// 0x3ff00000 = 1072693248 => 0 01111111111 00000000000000000000 => biased exponent: 1023 = 0+1023 => 2^0 = 1\nvar HIGH_BIASED_EXP_0 = 0x3ff00000|0; // asm type annotation\n\n// 0x20000000 = 536870912 => 0 01000000000 00000000000000000000 => biased exponent: 512 = -511+1023\nvar HIGH_BIASED_EXP_NEG_512 = 0x20000000|0; // asm type annotation\n\n// 0x00080000 = 524288 => 0 00000000000 10000000000000000000\nvar HIGH_SIGNIFICAND_HALF = 0x00080000|0; // asm type annotation\n\n// TODO: consider making an external constant\nvar HIGH_NUM_SIGNIFICAND_BITS = 20|0; // asm type annotation\n\nvar TWO53 = 9007199254740992.0;\t// 0x43400000, 0x00000000\n\n// 2/(3*LN2)\nvar CP = 9.61796693925975554329e-01; // 0x3FEEC709, 0xDC3A03FD\n\n// (float)CP\nvar CP_HI = 9.61796700954437255859e-01; // 0x3FEEC709, 0xE0000000\n\n// Low: CP_HI\nvar CP_LO = -7.02846165095275826516e-09; // 0xBE3E2FE0, 0x145B01F5\n\nvar BP = [\n\t1.0,\n\t1.5\n];\nvar DP_HI = [\n\t0.0,\n\t5.84962487220764160156e-01 // 0x3FE2B803, 0x40000000\n];\nvar DP_LO = [\n\t0.0,\n\t1.35003920212974897128e-08 // 0x3E4CFDEB, 0x43CFD006\n];\n\n\n// MAIN //\n\n/**\n* Computes \\\\(\\operatorname{log2}(ax)\\\\).\n*\n* @private\n* @param {Array} out - output array\n* @param {number} ax - absolute value of `x`\n* @param {number} ahx - high word of `ax`\n* @returns {Array} output array containing a tuple comprised of high and low parts\n*\n* @example\n* var t = log2ax( [ 0.0, 0.0 ], 9.0, 1075970048 ); // => [ t1, t2 ]\n* // returns [ 3.169923782348633, 0.0000012190936795504075 ]\n*/\nfunction log2ax( out, ax, ahx ) {\n\tvar tmp;\n\tvar ss; // `hs + ls`\n\tvar s2; // `ss` squared\n\tvar hs;\n\tvar ls;\n\tvar ht;\n\tvar lt;\n\tvar bp; // `BP` constant\n\tvar dp; // `DP` constant\n\tvar hp;\n\tvar lp;\n\tvar hz;\n\tvar lz;\n\tvar t1;\n\tvar t2;\n\tvar t;\n\tvar r;\n\tvar u;\n\tvar v;\n\tvar n;\n\tvar j;\n\tvar k;\n\n\tn = 0|0; // asm type annotation\n\n\t// Check if `x` is subnormal...\n\tif ( ahx < HIGH_MIN_NORMAL_EXP ) {\n\t\tax *= TWO53;\n\t\tn -= 53|0; // asm type annotation\n\t\tahx = getHighWord( ax );\n\t}\n\t// Extract the unbiased exponent of `x`:\n\tn += ((ahx >> HIGH_NUM_SIGNIFICAND_BITS) - BIAS)|0; // asm type annotation\n\n\t// Isolate the significand bits of `x`:\n\tj = (ahx & HIGH_SIGNIFICAND_MASK)|0; // asm type annotation\n\n\t// Normalize `ahx` by setting the (biased) exponent to `1023`:\n\tahx = (j | HIGH_BIASED_EXP_0)|0; // asm type annotation\n\n\t// Determine the interval of `|x|` by comparing significand bits...\n\n\t// |x| < sqrt(3/2)\n\tif ( j <= 0x3988E ) { // 0 00000000000 00111001100010001110\n\t\tk = 0;\n\t}\n\t// |x| < sqrt(3)\n\telse if ( j < 0xBB67A ) { // 0 00000000000 10111011011001111010\n\t\tk = 1;\n\t}\n\t// |x| >= sqrt(3)\n\telse {\n\t\tk = 0;\n\t\tn += 1|0; // asm type annotation\n\t\tahx -= HIGH_MIN_NORMAL_EXP;\n\t}\n\t// Load the normalized high word into `|x|`:\n\tax = setHighWord( ax, ahx );\n\n\t// Compute `ss = hs + ls = (x-1)/(x+1)` or `(x-1.5)/(x+1.5)`:\n\tbp = BP[ k ]; // BP[0] = 1.0, BP[1] = 1.5\n\tu = ax - bp; // (x-1) || (x-1.5)\n\tv = 1.0 / (ax + bp); // 1/(x+1) || 1/(x+1.5)\n\tss = u * v;\n\ths = setLowWord( ss, 0 ); // set all low word (less significant significand) bits to 0s\n\n\t// Compute `ht = ax + bp` (via manipulation, i.e., bit flipping, of the high word):\n\ttmp = ((ahx>>1) | HIGH_BIASED_EXP_NEG_512) + HIGH_SIGNIFICAND_HALF;\n\ttmp += (k << 18); // `(k<<18)` can be considered the word equivalent of `1.0` or `1.5`\n\tht = setHighWord( 0.0, tmp );\n\tlt = ax - (ht - bp);\n\tls = v * ( ( u - (hs*ht) ) - ( hs*lt ) );\n\n\t// Compute `log(ax)`...\n\n\ts2 = ss * ss;\n\tr = s2 * s2 * polyvalL( s2 );\n\tr += ls * (hs + ss);\n\ts2 = hs * hs;\n\tht = 3.0 + s2 + r;\n\tht = setLowWord( ht, 0 );\n\tlt = r - ((ht-3.0) - s2);\n\n\t// u+v = ss*(1+...):\n\tu = hs * ht;\n\tv = ( ls*ht ) + ( lt*ss );\n\n\t// 2/(3LN2) * (ss+...):\n\thp = u + v;\n\thp = setLowWord( hp, 0 );\n\tlp = v - (hp - u);\n\thz = CP_HI * hp; // CP_HI+CP_LO = 2/(3*LN2)\n\tlz = ( CP_LO*hp ) + ( lp*CP ) + DP_LO[ k ];\n\n\t// log2(ax) = (ss+...)*2/(3*LN2) = n + dp + hz + lz\n\tdp = DP_HI[ k ];\n\tt = n;\n\tt1 = ((hz+lz) + dp) + t; // log2(ax)\n\tt1 = setLowWord( t1, 0 );\n\tt2 = lz - (((t1-t) - dp) - hz);\n\n\tout[ 0 ] = t1;\n\tout[ 1 ] = t2;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = log2ax;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar polyvalW = require( './polyval_w.js' );\n\n\n// VARIABLES //\n\n// 1/LN2\nvar INV_LN2 = 1.44269504088896338700e+00; // 0x3FF71547, 0x652B82FE\n\n// High (24 bits): 1/LN2\nvar INV_LN2_HI = 1.44269502162933349609e+00; // 0x3FF71547, 0x60000000\n\n// Low: 1/LN2\nvar INV_LN2_LO = 1.92596299112661746887e-08; // 0x3E54AE0B, 0xF85DDF44\n\n\n// MAIN //\n\n/**\n* Computes \\\\(\\operatorname{log}(x)\\\\) assuming \\\\(|1-x|\\\\) is small and using the approximation \\\\(x - x^2/2 + x^3/3 - x^4/4\\\\).\n*\n* @private\n* @param {Array} out - output array\n* @param {number} ax - absolute value of `x`\n* @returns {Array} output array containing a tuple comprised of high and low parts\n*\n* @example\n* var t = logx( [ 0.0, 0.0 ], 9.0 ); // => [ t1, t2 ]\n* // returns [ -1265.7236328125, -0.0008163940840404393 ]\n*/\nfunction logx( out, ax ) {\n\tvar t2;\n\tvar t1;\n\tvar t;\n\tvar w;\n\tvar u;\n\tvar v;\n\n\tt = ax - 1.0; // `t` has `20` trailing zeros\n\tw = t * t * polyvalW( t );\n\tu = INV_LN2_HI * t; // `INV_LN2_HI` has `21` significant bits\n\tv = ( t*INV_LN2_LO ) - ( w*INV_LN2 );\n\tt1 = u + v;\n\tt1 = setLowWord( t1, 0 );\n\tt2 = v - (t1 - u);\n\n\tout[ 0 ] = t1;\n\tout[ 1 ] = t2;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = logx;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar isOdd = require( '@stdlib/math-base-assert-is-odd' );\nvar isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\nvar isInteger = require( '@stdlib/math-base-assert-is-integer' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar toWords = require( '@stdlib/number-float64-base-to-words' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar uint32ToInt32 = require( '@stdlib/number-uint32-base-to-int32' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar xIsZero = require( './x_is_zero.js' );\nvar yIsHuge = require( './y_is_huge.js' );\nvar yIsInfinite = require( './y_is_infinite.js' );\nvar log2ax = require( './log2ax.js' );\nvar logx = require( './logx.js' );\nvar pow2 = require( './pow2.js' );\n\n\n// VARIABLES //\n\n// 0x3fefffff = 1072693247 => 0 01111111110 11111111111111111111 => biased exponent: 1022 = -1+1023 => 2^-1\nvar HIGH_MAX_NEAR_UNITY = 0x3fefffff|0; // asm type annotation\n\n// 0x41e00000 = 1105199104 => 0 10000011110 00000000000000000000 => biased exponent: 1054 = 31+1023 => 2^31\nvar HIGH_BIASED_EXP_31 = 0x41e00000|0; // asm type annotation\n\n// 0x43f00000 = 1139802112 => 0 10000111111 00000000000000000000 => biased exponent: 1087 = 64+1023 => 2^64\nvar HIGH_BIASED_EXP_64 = 0x43f00000|0; // asm type annotation\n\n// 0x40900000 = 1083179008 => 0 10000001001 00000000000000000000 => biased exponent: 1033 = 10+1023 => 2^10 = 1024\nvar HIGH_BIASED_EXP_10 = 0x40900000|0; // asm type annotation\n\n// 0x3ff00000 = 1072693248 => 0 01111111111 00000000000000000000 => biased exponent: 1023 = 0+1023 => 2^0 = 1\nvar HIGH_BIASED_EXP_0 = 0x3ff00000|0; // asm type annotation\n\n// 0x4090cc00 = 1083231232 => 0 10000001001 00001100110000000000\nvar HIGH_1075 = 0x4090cc00|0; // asm type annotation\n\n// 0xc090cc00 = 3230714880 => 1 10000001001 00001100110000000000\nvar HIGH_NEG_1075 = 0xc090cc00>>>0; // asm type annotation\n\nvar HIGH_NUM_NONSIGN_BITS = 31|0; // asm type annotation\n\nvar HUGE = 1.0e300;\nvar TINY = 1.0e-300;\n\n// -(1024-log2(ovfl+.5ulp))\nvar OVT = 8.0085662595372944372e-17;\n\n// High/low words workspace:\nvar WORDS = [ 0|0, 0|0 ];\n\n// Log workspace:\nvar LOG_WORKSPACE = [ 0.0, 0.0 ];\n\n\n// MAIN //\n\n/**\n* Evaluates the exponential function.\n*\n* ## Method\n*\n* 1. Let \\\\(x = 2^n (1+f)\\\\).\n*\n* 2. Compute \\\\(\\operatorname{log2}(x)\\\\) as\n*\n* ```tex\n* \\operatorname{log2}(x) = w_1 + w_2\n* ```\n*\n* where \\\\(w_1\\\\) has \\\\(53 - 24 = 29\\\\) bit trailing zeros.\n*\n* 3. Compute\n*\n* ```tex\n* y \\cdot \\operatorname{log2}(x) = n + y^\\prime\n* ```\n*\n* by simulating multi-precision arithmetic, where \\\\(|y^\\prime| \\leq 0.5\\\\).\n*\n* 4. Return\n*\n* ```tex\n* x^y = 2^n e^{y^\\prime \\cdot \\mathrm{log2}}\n* ```\n*\n* ## Special Cases\n*\n* ```tex\n* \\begin{align*}\n* x^{\\mathrm{NaN}} &= \\mathrm{NaN} & \\\\\n* (\\mathrm{NaN})^y &= \\mathrm{NaN} & \\\\\n* 1^y &= 1 & \\\\\n* x^0 &= 1 & \\\\\n* x^1 &= x & \\\\\n* (\\pm 0)^\\infty &= +0 & \\\\\n* (\\pm 0)^{-\\infty} &= +\\infty & \\\\\n* (+0)^y &= +0 & \\mathrm{if}\\ y > 0 \\\\\n* (+0)^y &= +\\infty & \\mathrm{if}\\ y < 0 \\\\\n* (-0)^y &= -\\infty & \\mathrm{if}\\ y\\ \\mathrm{is\\ an\\ odd\\ integer\\ and}\\ y < 0 \\\\\n* (-0)^y &= +\\infty & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ an\\ odd\\ integer\\ and}\\ y < 0 \\\\\n* (-0)^y &= -0 & \\mathrm{if}\\ y\\ \\mathrm{is\\ an\\ odd\\ integer\\ and}\\ y > 0 \\\\\n* (-0)^y &= +0 & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ an\\ odd\\ integer\\ and}\\ y > 0 \\\\\n* (-1)^{\\pm\\infty} &= \\mathrm{NaN} & \\\\\n* x^{\\infty} &= +\\infty & |x| > 1 \\\\\n* x^{\\infty} &= +0 & |x| < 1 \\\\\n* x^{-\\infty} &= +0 & |x| > 1 \\\\\n* x^{-\\infty} &= +\\infty & |x| < 1 \\\\\n* (-\\infty)^y &= (-0)^y & \\\\\n* \\infty^y &= +0 & y < 0 \\\\\n* \\infty^y &= +\\infty & y > 0 \\\\\n* x^y &= \\mathrm{NaN} & \\mathrm{if}\\ y\\ \\mathrm{is\\ not\\ a\\ finite\\ integer\\ and}\\ x < 0\n* \\end{align*}\n* ```\n*\n* ## Notes\n*\n* - \\\\(\\operatorname{pow}(x,y)\\\\) returns \\\\(x^y\\\\) nearly rounded. In particular, \\\\(\\operatorname{pow}(<\\mathrm{integer}>,<\\mathrm{integer}>)\\\\) **always** returns the correct integer, provided the value is representable.\n* - The hexadecimal values shown in the source code are the intended values for used constants. Decimal values may be used, provided the compiler will accurately convert decimal to binary in order to produce the hexadecimal values.\n*\n* @param {number} x - base\n* @param {number} y - exponent\n* @returns {number} function value\n*\n* @example\n* var v = pow( 2.0, 3.0 );\n* // returns 8.0\n*\n* @example\n* var v = pow( 4.0, 0.5 );\n* // returns 2.0\n*\n* @example\n* var v = pow( 100.0, 0.0 );\n* // returns 1.0\n*\n* @example\n* var v = pow( 3.141592653589793, 5.0 );\n* // returns ~306.0197\n*\n* @example\n* var v = pow( 3.141592653589793, -0.2 );\n* // returns ~0.7954\n*\n* @example\n* var v = pow( NaN, 3.0 );\n* // returns NaN\n*\n* @example\n* var v = pow( 5.0, NaN );\n* // returns NaN\n*\n* @example\n* var v = pow( NaN, NaN );\n* // returns NaN\n*/\nfunction pow( x, y ) {\n\tvar ahx; // absolute value high word `x`\n\tvar ahy; // absolute value high word `y`\n\tvar ax; // absolute value `x`\n\tvar hx; // high word `x`\n\tvar lx; // low word `x`\n\tvar hy; // high word `y`\n\tvar ly; // low word `y`\n\tvar sx; // sign `x`\n\tvar sy; // sign `y`\n\tvar y1;\n\tvar hp;\n\tvar lp;\n\tvar t;\n\tvar z; // y prime\n\tvar j;\n\tvar i;\n\tif ( isnan( x ) || isnan( y ) ) {\n\t\treturn NaN;\n\t}\n\t// Split `y` into high and low words:\n\ttoWords.assign( y, WORDS, 1, 0 );\n\thy = WORDS[ 0 ];\n\tly = WORDS[ 1 ];\n\n\t// Special cases `y`...\n\tif ( ly === 0 ) {\n\t\tif ( y === 0.0 ) {\n\t\t\treturn 1.0;\n\t\t}\n\t\tif ( y === 1.0 ) {\n\t\t\treturn x;\n\t\t}\n\t\tif ( y === -1.0 ) {\n\t\t\treturn 1.0 / x;\n\t\t}\n\t\tif ( y === 0.5 ) {\n\t\t\treturn sqrt( x );\n\t\t}\n\t\tif ( y === -0.5 ) {\n\t\t\treturn 1.0 / sqrt( x );\n\t\t}\n\t\tif ( y === 2.0 ) {\n\t\t\treturn x * x;\n\t\t}\n\t\tif ( y === 3.0 ) {\n\t\t\treturn x * x * x;\n\t\t}\n\t\tif ( y === 4.0 ) {\n\t\t\tx *= x;\n\t\t\treturn x * x;\n\t\t}\n\t\tif ( isInfinite( y ) ) {\n\t\t\treturn yIsInfinite( x, y );\n\t\t}\n\t}\n\t// Split `x` into high and low words:\n\ttoWords.assign( x, WORDS, 1, 0 );\n\thx = WORDS[ 0 ];\n\tlx = WORDS[ 1 ];\n\n\t// Special cases `x`...\n\tif ( lx === 0 ) {\n\t\tif ( hx === 0 ) {\n\t\t\treturn xIsZero( x, y );\n\t\t}\n\t\tif ( x === 1.0 ) {\n\t\t\treturn 1.0;\n\t\t}\n\t\tif (\n\t\t\tx === -1.0 &&\n\t\t\tisOdd( y )\n\t\t) {\n\t\t\treturn -1.0;\n\t\t}\n\t\tif ( isInfinite( x ) ) {\n\t\t\tif ( x === NINF ) {\n\t\t\t\t// `pow( 1/x, -y )`\n\t\t\t\treturn pow( -0.0, -y );\n\t\t\t}\n\t\t\tif ( y < 0.0 ) {\n\t\t\t\treturn 0.0;\n\t\t\t}\n\t\t\treturn PINF;\n\t\t}\n\t}\n\tif (\n\t\tx < 0.0 &&\n\t\tisInteger( y ) === false\n\t) {\n\t\t// Signal NaN...\n\t\treturn (x-x)/(x-x);\n\t}\n\tax = abs( x );\n\n\t// Remove the sign bits (i.e., get absolute values):\n\tahx = (hx & ABS_MASK)|0; // asm type annotation\n\tahy = (hy & ABS_MASK)|0; // asm type annotation\n\n\t// Extract the sign bits:\n\tsx = (hx >>> HIGH_NUM_NONSIGN_BITS)|0; // asm type annotation\n\tsy = (hy >>> HIGH_NUM_NONSIGN_BITS)|0; // asm type annotation\n\n\t// Determine the sign of the result...\n\tif ( sx && isOdd( y ) ) {\n\t\tsx = -1.0;\n\t} else {\n\t\tsx = 1.0;\n\t}\n\t// Case 1: `|y|` is huge...\n\n\t// |y| > 2^31\n\tif ( ahy > HIGH_BIASED_EXP_31 ) {\n\t\t// `|y| > 2^64`, then must over- or underflow...\n\t\tif ( ahy > HIGH_BIASED_EXP_64 ) {\n\t\t\treturn yIsHuge( x, y );\n\t\t}\n\t\t// Over- or underflow if `x` is not close to unity...\n\n\t\tif ( ahx < HIGH_MAX_NEAR_UNITY ) {\n\t\t\t// y < 0\n\t\t\tif ( sy === 1 ) {\n\t\t\t\t// Signal overflow...\n\t\t\t\treturn sx * HUGE * HUGE;\n\t\t\t}\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\tif ( ahx > HIGH_BIASED_EXP_0 ) {\n\t\t\t// y > 0\n\t\t\tif ( sy === 0 ) {\n\t\t\t\t// Signal overflow...\n\t\t\t\treturn sx * HUGE * HUGE;\n\t\t\t}\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\t// At this point, `|1-x|` is tiny (`<= 2^-20`). Suffice to compute `log(x)` by `x - x^2/2 + x^3/3 - x^4/4`.\n\t\tt = logx( LOG_WORKSPACE, ax );\n\t}\n\t// Case 2: `|y|` is not huge...\n\telse {\n\t\tt = log2ax( LOG_WORKSPACE, ax, ahx );\n\t}\n\t// Split `y` into `y1 + y2` and compute `(y1+y2) * (t1+t2)`...\n\ty1 = setLowWord( y, 0 );\n\tlp = ( (y-y1)*t[0] ) + ( y*t[1] );\n\thp = y1 * t[0];\n\tz = lp + hp;\n\n\t// Note: *can* be more performant to use `getHighWord` and `getLowWord` directly, but using `toWords` looks cleaner.\n\ttoWords.assign( z, WORDS, 1, 0 );\n\tj = uint32ToInt32( WORDS[0] );\n\ti = uint32ToInt32( WORDS[1] );\n\n\t// z >= 1024\n\tif ( j >= HIGH_BIASED_EXP_10 ) {\n\t\t// z > 1024\n\t\tif ( ((j-HIGH_BIASED_EXP_10)|i) !== 0 ) {\n\t\t\t// Signal overflow...\n\t\t\treturn sx * HUGE * HUGE;\n\t\t}\n\t\tif ( (lp+OVT) > (z-hp) ) {\n\t\t\t// Signal overflow...\n\t\t\treturn sx * HUGE * HUGE;\n\t\t}\n\t}\n\t// z <= -1075\n\telse if ( (j&ABS_MASK) >= HIGH_1075 ) {\n\t\t// z < -1075\n\t\tif ( ((j-HIGH_NEG_1075)|i) !== 0 ) {\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t\tif ( lp <= (z-hp) ) {\n\t\t\t// Signal underflow...\n\t\t\treturn sx * TINY * TINY;\n\t\t}\n\t}\n\t// Compute `2^(hp+lp)`...\n\tz = pow2( j, hp, lp );\n\n\treturn sx * z;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.5999999999999946;\n\t}\n\treturn 0.5999999999999946 + (x * (0.4285714285785502 + (x * (0.33333332981837743 + (x * (0.272728123808534 + (x * (0.23066074577556175 + (x * 0.20697501780033842))))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.16666666666666602;\n\t}\n\treturn 0.16666666666666602 + (x * (-0.0027777777777015593 + (x * (0.00006613756321437934 + (x * (-0.0000016533902205465252 + (x * 4.1381367970572385e-8))))))); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* This is a generated file. Do not edit directly. */\n'use strict';\n\n// MAIN //\n\n/**\n* Evaluates a polynomial.\n*\n* ## Notes\n*\n* - The implementation uses [Horner's rule][horners-method] for efficient computation.\n*\n* [horners-method]: https://en.wikipedia.org/wiki/Horner%27s_method\n*\n* @private\n* @param {number} x - value at which to evaluate the polynomial\n* @returns {number} evaluated polynomial\n*/\nfunction evalpoly( x ) {\n\tif ( x === 0.0 ) {\n\t\treturn 0.5;\n\t}\n\treturn 0.5 + (x * (-0.3333333333333333 + (x * 0.25)));\n}\n\n\n// EXPORTS //\n\nmodule.exports = evalpoly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\nvar setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\nvar uint32ToInt32 = require( '@stdlib/number-uint32-base-to-int32' );\nvar ldexp = require( '@stdlib/math-base-special-ldexp' );\nvar LN2 = require( '@stdlib/constants-float64-ln-two' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar HIGH_SIGNIFICAND_MASK = require( '@stdlib/constants-float64-high-word-significand-mask' );\nvar polyvalP = require( './polyval_p.js' );\n\n\n// VARIABLES //\n\n// 0x00100000 = 1048576 => 0 00000000001 00000000000000000000 => biased exponent: 1 = -1022+1023 => 2^-1022\nvar HIGH_MIN_NORMAL_EXP = 0x00100000|0; // asm type annotation\n\n// 0x3fe00000 = 1071644672 => 0 01111111110 00000000000000000000 => biased exponent: 1022 = -1+1023 => 2^-1\nvar HIGH_BIASED_EXP_NEG_1 = 0x3fe00000|0; // asm type annotation\n\n// TODO: consider making into an external constant\nvar HIGH_NUM_SIGNIFICAND_BITS = 20|0; // asm type annotation\n\n// High: LN2\nvar LN2_HI = 6.93147182464599609375e-01; // 0x3FE62E43, 0x00000000\n\n// Low: LN2\nvar LN2_LO = -1.90465429995776804525e-09; // 0xBE205C61, 0x0CA86C39\n\n\n// MAIN //\n\n/**\n* Computes \\\\(2^{\\mathrm{hp} + \\mathrm{lp}\\\\).\n*\n* @private\n* @param {number} j - high word of `hp + lp`\n* @param {number} hp - first power summand\n* @param {number} lp - second power summand\n* @returns {number} function value\n*\n* @example\n* var z = pow2( 1065961648, -0.3398475646972656, -0.000002438187359100815 );\n* // returns ~0.79\n*/\nfunction pow2( j, hp, lp ) {\n\tvar tmp;\n\tvar t1;\n\tvar t;\n\tvar r;\n\tvar u;\n\tvar v;\n\tvar w;\n\tvar z;\n\tvar n;\n\tvar i;\n\tvar k;\n\n\ti = (j & ABS_MASK)|0; // asm type annotation\n\tk = ((i>>HIGH_NUM_SIGNIFICAND_BITS) - BIAS)|0; // asm type annotation\n\tn = 0;\n\n\t// `|z| > 0.5`, set `n = z+0.5`\n\tif ( i > HIGH_BIASED_EXP_NEG_1 ) {\n\t\tn = (j + (HIGH_MIN_NORMAL_EXP>>(k+1)))>>>0; // asm type annotation\n\t\tk = (((n & ABS_MASK)>>HIGH_NUM_SIGNIFICAND_BITS) - BIAS)|0; // new k for n\n\t\ttmp = ((n & ~(HIGH_SIGNIFICAND_MASK >> k)))>>>0; // asm type annotation\n\t\tt = setHighWord( 0.0, tmp );\n\t\tn = (((n & HIGH_SIGNIFICAND_MASK)|HIGH_MIN_NORMAL_EXP) >> (HIGH_NUM_SIGNIFICAND_BITS-k))>>>0; // eslint-disable-line max-len\n\t\tif ( j < 0 ) {\n\t\t\tn = -n;\n\t\t}\n\t\thp -= t;\n\t}\n\tt = lp + hp;\n\tt = setLowWord( t, 0 );\n\tu = t * LN2_HI;\n\tv = ( (lp - (t-hp))*LN2 ) + ( t*LN2_LO );\n\tz = u + v;\n\tw = v - (z - u);\n\tt = z * z;\n\tt1 = z - ( t*polyvalP( t ) );\n\tr = ( (z*t1) / (t1-2.0) ) - ( w + (z*w) );\n\tz = 1.0 - (r - z);\n\tj = getHighWord( z );\n\tj = uint32ToInt32( j );\n\tj += (n << HIGH_NUM_SIGNIFICAND_BITS)>>>0; // asm type annotation\n\n\t// Check for subnormal output...\n\tif ( (j>>HIGH_NUM_SIGNIFICAND_BITS) <= 0 ) {\n\t\tz = ldexp( z, n );\n\t} else {\n\t\tz = setHighWord( z, j );\n\t}\n\treturn z;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow2;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isOdd = require( '@stdlib/math-base-assert-is-odd' );\nvar copysign = require( '@stdlib/math-base-special-copysign' );\nvar NINF = require( '@stdlib/constants-float64-ninf' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\n\n\n// MAIN //\n\n/**\n* Evaluates the exponential function when \\\\(|x| = 0\\\\).\n*\n* @private\n* @param {number} x - base\n* @param {number} y - exponent\n* @returns {number} function value\n*\n* @example\n* var v = pow( 0.0, 2 );\n* // returns 0.0\n*\n* @example\n* var v = pow( -0.0, -9 );\n* // returns -Infinity\n*\n* @example\n* var v = pow( 0.0, -9 );\n* // returns Infinity\n*\n* @example\n* var v = pow( -0.0, 9 );\n* // returns 0.0\n*\n* @example\n* var v = pow( 0.0, -Infinity );\n* // returns Infinity\n*\n* @example\n* var v = pow( 0.0, Infinity );\n* // returns 0.0\n*/\nfunction pow( x, y ) {\n\tif ( y === NINF ) {\n\t\treturn PINF;\n\t}\n\tif ( y === PINF ) {\n\t\treturn 0.0;\n\t}\n\tif ( y > 0.0 ) {\n\t\tif ( isOdd( y ) ) {\n\t\t\treturn x; // handles +-0\n\t\t}\n\t\treturn 0.0;\n\t}\n\t// y < 0.0\n\tif ( isOdd( y ) ) {\n\t\treturn copysign( PINF, x ); // handles +-0\n\t}\n\treturn PINF;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The following copyright and license were part of the original implementation available as part of [FreeBSD]{@link https://svnweb.freebsd.org/base/release/9.3.0/lib/msun/src/s_pow.c}. The implementation follows the original, but has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 2004 by Sun Microsystems, Inc. All rights reserved.\n*\n* Developed at SunPro, a Sun Microsystems, Inc. business.\n* Permission to use, copy, modify, and distribute this\n* software is freely granted, provided that this notice\n* is preserved.\n* ```\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ABS_MASK = require( '@stdlib/constants-float64-high-word-abs-mask' );\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\n\n\n// VARIABLES //\n\n// 0x3fefffff = 1072693247 => 0 01111111110 11111111111111111111 => biased exponent: 1022 = -1+1023 => 2^-1\nvar HIGH_MAX_NEAR_UNITY = 0x3fefffff|0; // asm type annotation\n\nvar HUGE = 1.0e300;\nvar TINY = 1.0e-300;\n\n\n// MAIN //\n\n/**\n* Evaluates the exponential function when \\\\(|y| > 2^64\\\\).\n*\n* @private\n* @param {number} x - base\n* @param {number} y - exponent\n* @returns {number} overflow or underflow result\n*\n* @example\n* var v = pow( 9.0, 3.6893488147419103e19 );\n* // returns Infinity\n*\n* @example\n* var v = pow( -3.14, -3.6893488147419103e19 );\n* // returns 0.0\n*/\nfunction pow( x, y ) {\n\tvar ahx;\n\tvar hx;\n\n\thx = getHighWord( x );\n\tahx = (hx & ABS_MASK);\n\n\tif ( ahx <= HIGH_MAX_NEAR_UNITY ) {\n\t\tif ( y < 0 ) {\n\t\t\t// Signal overflow...\n\t\t\treturn HUGE * HUGE;\n\t\t}\n\t\t// Signal underflow...\n\t\treturn TINY * TINY;\n\t}\n\t// `x` has a biased exponent greater than or equal to `0`...\n\n\tif ( y > 0 ) {\n\t\t// Signal overflow...\n\t\treturn HUGE * HUGE;\n\t}\n\t// Signal underflow...\n\treturn TINY * TINY;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar PINF = require( '@stdlib/constants-float64-pinf' );\n\n\n// MAIN //\n\n/**\n* Evaluates the exponential function when \\\\( y = \\pm \\infty\\\\).\n*\n* @private\n* @param {number} x - base\n* @param {number} y - exponent\n* @returns {number} function value\n*\n* @example\n* var v = pow( -1.0, Infinity );\n* // returns NaN\n*\n* @example\n* var v = pow( -1.0, -Infinity );\n* // returns NaN\n*\n* @example\n* var v = pow( 1.0, Infinity );\n* // returns 1.0\n*\n* @example\n* var v = pow( 1.0, -Infinity );\n* // returns 1.0\n*\n* @example\n* var v = pow( 0.5, Infinity );\n* // returns 0.0\n*\n* @example\n* var v = pow( 0.5, -Infinity );\n* // returns Infinity\n*\n* @example\n* var v = pow( 1.5, -Infinity );\n* // returns 0.0\n*\n* @example\n* var v = pow( 1.5, Infinity );\n* // returns Infinity\n*/\nfunction pow( x, y ) {\n\tif ( x === -1.0 ) {\n\t\t// Julia (0.4.2) and Python (2.7.9) return `1.0` (WTF???). JavaScript (`Math.pow`), R, and libm return `NaN`. We choose `NaN`, as the value is indeterminate; i.e., we cannot determine whether `y` is odd, even, or somewhere in between.\n\t\treturn (x-x)/(x-x); // signal NaN\n\t}\n\tif ( x === 1.0 ) {\n\t\treturn 1.0;\n\t}\n\t// (|x| > 1 && y === NINF) || (|x| < 1 && y === PINF)\n\tif ( (abs(x) < 1.0) === (y === PINF) ) {\n\t\treturn 0.0;\n\t}\n\t// (|x| > 1 && y === PINF) || (|x| < 1 && y === NINF)\n\treturn PINF;\n}\n\n\n// EXPORTS //\n\nmodule.exports = pow;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Compute the principal square root of a double-precision floating-point number.\n*\n* @module @stdlib/math-base-special-sqrt\n*\n* @example\n* var sqrt = require( '@stdlib/math-base-special-sqrt' );\n*\n* var v = sqrt( 4.0 );\n* // returns 2.0\n*\n* v = sqrt( 9.0 );\n* // returns 3.0\n*\n* v = sqrt( 0.0 );\n* // returns 0.0\n*\n* v = sqrt( -4.0 );\n* // returns NaN\n*\n* v = sqrt( NaN );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Compute the principal square root of a double-precision floating-point number.\n*\n* @type {Function}\n* @param {number} x - input value\n* @returns {number} principal square root\n*\n* @example\n* var v = sqrt( 4.0 );\n* // returns 2.0\n*\n* v = sqrt( 9.0 );\n* // returns 3.0\n*\n* v = sqrt( 0.0 );\n* // returns 0.0\n*\n* v = sqrt( -4.0 );\n* // returns NaN\n*\n* v = sqrt( NaN );\n* // returns NaN\n*/\nvar sqrt = Math.sqrt; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = sqrt;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Round a double-precision floating-point number toward zero.\n*\n* @module @stdlib/math-base-special-trunc\n*\n* @example\n* var trunc = require( '@stdlib/math-base-special-trunc' );\n*\n* var v = trunc( -4.2 );\n* // returns -4.0\n*\n* v = trunc( 9.99999 );\n* // returns 9.0\n*\n* v = trunc( 0.0 );\n* // returns 0.0\n*\n* v = trunc( -0.0 );\n* // returns -0.0\n*\n* v = trunc( NaN );\n* // returns NaN\n*\n* v = trunc( Infinity );\n* // returns Infinity\n*\n* v = trunc( -Infinity );\n* // returns -Infinity\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar ceil = require( '@stdlib/math-base-special-ceil' );\n\n\n// MAIN //\n\n/**\n* Rounds a double-precision floating-point number toward zero.\n*\n* @param {number} x - input value\n* @returns {number} rounded value\n*\n* @example\n* var v = trunc( -4.2 );\n* // returns -4.0\n*\n* @example\n* var v = trunc( 9.99999 );\n* // returns 9.0\n*\n* @example\n* var v = trunc( 0.0 );\n* // returns 0.0\n*\n* @example\n* var v = trunc( -0.0 );\n* // returns -0.0\n*\n* @example\n* var v = trunc( NaN );\n* // returns NaN\n*\n* @example\n* var v = trunc( Infinity );\n* // returns Infinity\n*\n* @example\n* var v = trunc( -Infinity );\n* // returns -Infinity\n*/\nfunction trunc( x ) {\n\tif ( x < 0.0 ) {\n\t\treturn ceil( x );\n\t}\n\treturn floor( x );\n}\n\n\n// EXPORTS //\n\nmodule.exports = trunc;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Constructor which returns a `Number` object.\n*\n* @module @stdlib/number-ctor\n*\n* @example\n* var Number = require( '@stdlib/number-ctor' );\n*\n* var v = new Number( 10.0 );\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// EXPORTS //\n\nmodule.exports = Number; // eslint-disable-line stdlib/require-globals\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an integer corresponding to the unbiased exponent of a double-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-exponent\n*\n* @example\n* var exponent = require( '@stdlib/number-float64-base-exponent' );\n*\n* var exp = exponent( 3.14e-307 ); // => 2**-1019 ~ 1e-307\n* // returns -1019\n*\n* exp = exponent( -3.14 );\n* // returns 1\n*\n* exp = exponent( 0.0 );\n* // returns -1023\n*\n* exp = exponent( NaN );\n* // returns 1024\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\nvar EXP_MASK = require( '@stdlib/constants-float64-high-word-exponent-mask' );\nvar BIAS = require( '@stdlib/constants-float64-exponent-bias' );\n\n\n// MAIN //\n\n/**\n* Returns an integer corresponding to the unbiased exponent of a double-precision floating-point number.\n*\n* @param {number} x - input value\n* @returns {integer32} unbiased exponent\n*\n* @example\n* var exp = exponent( 3.14e-307 ); // => 2**-1019 ~ 1e-307\n* // returns -1019\n*\n* @example\n* var exp = exponent( -3.14 );\n* // returns 1\n*\n* @example\n* var exp = exponent( 0.0 );\n* // returns -1023\n*\n* @example\n* var exp = exponent( NaN );\n* // returns 1024\n*/\nfunction exponent( x ) {\n\t// Extract from the input value a higher order word (unsigned 32-bit integer) which contains the exponent:\n\tvar high = getHighWord( x );\n\n\t// Apply a mask to isolate only the exponent bits and then shift off all bits which are part of the fraction:\n\thigh = ( high & EXP_MASK ) >>> 20;\n\n\t// Remove the bias and return:\n\treturn (high - BIAS)|0; // asm type annotation\n}\n\n\n// EXPORTS //\n\nmodule.exports = exponent;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a double-precision floating-point number from a higher order word (unsigned 32-bit integer) and a lower order word (unsigned 32-bit integer).\n*\n* @module @stdlib/number-float64-base-from-words\n*\n* @example\n* var fromWords = require( '@stdlib/number-float64-base-from-words' );\n*\n* var v = fromWords( 1774486211, 2479577218 );\n* // returns 3.14e201\n*\n* v = fromWords( 3221823995, 1413754136 );\n* // returns -3.141592653589793\n*\n* v = fromWords( 0, 0 );\n* // returns 0.0\n*\n* v = fromWords( 2147483648, 0 );\n* // returns -0.0\n*\n* v = fromWords( 2146959360, 0 );\n* // returns NaN\n*\n* v = fromWords( 2146435072, 0 );\n* // returns Infinity\n*\n* v = fromWords( 4293918720, 0 );\n* // returns -Infinity\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isLittleEndian = require( '@stdlib/assert-is-little-endian' );\n\n\n// MAIN //\n\nvar indices;\nvar HIGH;\nvar LOW;\n\nif ( isLittleEndian === true ) {\n\tHIGH = 1; // second index\n\tLOW = 0; // first index\n} else {\n\tHIGH = 0; // first index\n\tLOW = 1; // second index\n}\nindices = {\n\t'HIGH': HIGH,\n\t'LOW': LOW\n};\n\n\n// EXPORTS //\n\nmodule.exports = indices;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar indices = require( './indices.js' );\n\n\n// VARIABLES //\n\nvar FLOAT64_VIEW = new Float64Array( 1 );\nvar UINT32_VIEW = new Uint32Array( FLOAT64_VIEW.buffer );\n\nvar HIGH = indices.HIGH;\nvar LOW = indices.LOW;\n\n\n// MAIN //\n\n/**\n* Creates a double-precision floating-point number from a higher order word (unsigned 32-bit integer) and a lower order word (unsigned 32-bit integer).\n*\n* ## Notes\n*\n* ```text\n* float64 (64 bits)\n* f := fraction (significand/mantissa) (52 bits)\n* e := exponent (11 bits)\n* s := sign bit (1 bit)\n*\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Float64 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Uint32 | Uint32 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* ```\n*\n* If little endian (more significant bits last):\n*\n* ```text\n* <-- lower higher -->\n* | f7 f6 f5 f4 f3 f2 e2 | f1 |s| e1 |\n* ```\n*\n* If big endian (more significant bits first):\n*\n* ```text\n* <-- higher lower -->\n* |s| e1 e2 | f1 f2 f3 f4 f5 f6 f7 |\n* ```\n*\n* In which Uint32 should we place the higher order bits? If little endian, the second; if big endian, the first.\n*\n* ## References\n*\n* - [Open Group][1]\n*\n* [1]: http://pubs.opengroup.org/onlinepubs/9629399/chap14.htm\n*\n* @param {uinteger32} high - higher order word (unsigned 32-bit integer)\n* @param {uinteger32} low - lower order word (unsigned 32-bit integer)\n* @returns {number} floating-point number\n*\n* @example\n* var v = fromWords( 1774486211, 2479577218 );\n* // returns 3.14e201\n*\n* @example\n* var v = fromWords( 3221823995, 1413754136 );\n* // returns -3.141592653589793\n*\n* @example\n* var v = fromWords( 0, 0 );\n* // returns 0.0\n*\n* @example\n* var v = fromWords( 2147483648, 0 );\n* // returns -0.0\n*\n* @example\n* var v = fromWords( 2146959360, 0 );\n* // returns NaN\n*\n* @example\n* var v = fromWords( 2146435072, 0 );\n* // returns Infinity\n*\n* @example\n* var v = fromWords( 4293918720, 0 );\n* // returns -Infinity\n*/\nfunction fromWords( high, low ) {\n\tUINT32_VIEW[ HIGH ] = high;\n\tUINT32_VIEW[ LOW ] = low;\n\treturn FLOAT64_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = fromWords;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isLittleEndian = require( '@stdlib/assert-is-little-endian' );\n\n\n// MAIN //\n\nvar HIGH;\nif ( isLittleEndian === true ) {\n\tHIGH = 1; // second index\n} else {\n\tHIGH = 0; // first index\n}\n\n\n// EXPORTS //\n\nmodule.exports = HIGH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an unsigned 32-bit integer corresponding to the more significant 32 bits of a double-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-get-high-word\n*\n* @example\n* var getHighWord = require( '@stdlib/number-float64-base-get-high-word' );\n*\n* var w = getHighWord( 3.14e201 ); // => 01101001110001001000001011000011\n* // returns 1774486211\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar HIGH = require( './high.js' );\n\n\n// VARIABLES //\n\nvar FLOAT64_VIEW = new Float64Array( 1 );\nvar UINT32_VIEW = new Uint32Array( FLOAT64_VIEW.buffer );\n\n\n// MAIN //\n\n/**\n* Returns an unsigned 32-bit integer corresponding to the more significant 32 bits of a double-precision floating-point number.\n*\n* ## Notes\n*\n* ```text\n* float64 (64 bits)\n* f := fraction (significand/mantissa) (52 bits)\n* e := exponent (11 bits)\n* s := sign bit (1 bit)\n*\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Float64 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Uint32 | Uint32 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* ```\n*\n* If little endian (more significant bits last):\n*\n* ```text\n* <-- lower higher -->\n* | f7 f6 f5 f4 f3 f2 e2 | f1 |s| e1 |\n* ```\n*\n* If big endian (more significant bits first):\n*\n* ```text\n* <-- higher lower -->\n* |s| e1 e2 | f1 f2 f3 f4 f5 f6 f7 |\n* ```\n*\n* In which Uint32 can we find the higher order bits? If little endian, the second; if big endian, the first.\n*\n* ## References\n*\n* - [Open Group][1]\n*\n* [1]: http://pubs.opengroup.org/onlinepubs/9629399/chap14.htm\n*\n* @param {number} x - input value\n* @returns {uinteger32} higher order word\n*\n* @example\n* var w = getHighWord( 3.14e201 ); // => 01101001110001001000001011000011\n* // returns 1774486211\n*/\nfunction getHighWord( x ) {\n\tFLOAT64_VIEW[ 0 ] = x;\n\treturn UINT32_VIEW[ HIGH ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = getHighWord;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar FLOAT64_SMALLEST_NORMAL = require( '@stdlib/constants-float64-smallest-normal' );\nvar isInfinite = require( '@stdlib/math-base-assert-is-infinite' );\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar abs = require( '@stdlib/math-base-special-abs' );\n\n\n// VARIABLES //\n\n// (1<<52)\nvar SCALAR = 4503599627370496;\n\n\n// MAIN //\n\n/**\n* Returns a normal number `y` and exponent `exp` satisfying \\\\(x = y \\cdot 2^\\mathrm{exp}\\\\) and assigns results to a provided output array.\n*\n* @param {number} x - input value\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var pow = require( '@stdlib/math-base-special-pow' );\n*\n* var out = normalize( 3.14e-319, [ 0.0, 0 ], 1, 0 );\n* // returns [ 1.4141234400356668e-303, -52 ]\n*\n* var y = out[ 0 ];\n* var exp = out[ 1 ];\n*\n* var bool = ( y*pow(2.0,exp) === 3.14e-319 );\n* // returns true\n*\n* @example\n* var out = normalize( 0.0, [ 0.0, 0 ], 1, 0 );\n* // returns [ 0.0, 0 ];\n*\n* @example\n* var PINF = require( '@stdlib/constants-float64-pinf' );\n*\n* var out = normalize( PINF, [ 0.0, 0 ], 1, 0 );\n* // returns [ Infinity, 0 ]\n*\n* @example\n* var NINF = require( '@stdlib/constants-float64-ninf' );\n*\n* var out = normalize( NINF, [ 0.0, 0 ], 1, 0 );\n* // returns [ -Infinity, 0 ]\n*\n* @example\n* var out = normalize( NaN, [ 0.0, 0 ], 1, 0 );\n* // returns [ NaN, 0 ]\n*/\nfunction normalize( x, out, stride, offset ) {\n\tif ( isnan( x ) || isInfinite( x ) ) {\n\t\tout[ offset ] = x;\n\t\tout[ offset + stride ] = 0;\n\t\treturn out;\n\t}\n\tif ( x !== 0.0 && abs( x ) < FLOAT64_SMALLEST_NORMAL ) {\n\t\tout[ offset ] = x * SCALAR;\n\t\tout[ offset + stride ] = -52;\n\t\treturn out;\n\t}\n\tout[ offset ] = x;\n\tout[ offset + stride ] = 0;\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = normalize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a normal number `y` and exponent `exp` satisfying \\\\(x = y \\cdot 2^\\mathrm{exp}\\\\).\n*\n* @module @stdlib/number-float64-base-normalize\n*\n* @example\n* var normalize = require( '@stdlib/number-float64-base-normalize' );\n* var pow = require( '@stdlib/math-base-special-pow' );\n*\n* var out = normalize( 3.14e-319 );\n* // returns [ 1.4141234400356668e-303, -52 ]\n*\n* var y = out[ 0 ];\n* var exp = out[ 1 ];\n*\n* var bool = ( y*pow(2.0, exp) === 3.14e-319 );\n* // returns true\n*\n* @example\n* var Float64Array = require( '@stdlib/array-float64' );\n* var normalize = require( '@stdlib/number-float64-base-normalize' );\n*\n* var out = new Float64Array( 2 );\n*\n* var v = normalize.assign( 3.14e-319, out, 1, 0 );\n* // returns [ 1.4141234400356668e-303, -52 ]\n*\n* var bool = ( v === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fcn = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Returns a normal number `y` and exponent `exp` satisfying \\\\(x = y \\cdot 2^\\mathrm{exp}\\\\).\n*\n* @param {number} x - input value\n* @returns {NumberArray} output array\n*\n* @example\n* var pow = require( '@stdlib/math-base-special-pow' );\n*\n* var out = normalize( 3.14e-319 );\n* // returns [ 1.4141234400356668e-303, -52 ]\n*\n* var y = out[ 0 ];\n* var exp = out[ 1 ];\n*\n* var bool = ( y*pow(2.0,exp) === 3.14e-319 );\n* // returns true\n*\n* @example\n* var out = normalize( 0.0 );\n* // returns [ 0.0, 0 ]\n*\n* @example\n* var PINF = require( '@stdlib/constants-float64-pinf' );\n*\n* var out = normalize( PINF );\n* // returns [ Infinity, 0 ]\n*\n* @example\n* var NINF = require( '@stdlib/constants-float64-ninf' );\n*\n* var out = normalize( NINF );\n* // returns [ -Infinity, 0 ]\n*\n* @example\n* var out = normalize( NaN );\n* // returns [ NaN, 0 ]\n*/\nfunction normalize( x ) {\n\treturn fcn( x, [ 0.0, 0 ], 1, 0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = normalize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isLittleEndian = require( '@stdlib/assert-is-little-endian' );\n\n\n// MAIN //\n\nvar HIGH;\nif ( isLittleEndian === true ) {\n\tHIGH = 1; // second index\n} else {\n\tHIGH = 0; // first index\n}\n\n\n// EXPORTS //\n\nmodule.exports = HIGH;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Set the more significant 32 bits of a double-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-set-high-word\n*\n* @example\n* var setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\n*\n* var high = 5 >>> 0; // => 0 00000000000 00000000000000000101\n*\n* var y = setHighWord( 3.14e201, high ); // => 0 00000000000 0000000000000000010110010011110010110101100010000010\n* // returns 1.18350528745e-313\n*\n* @example\n* var setHighWord = require( '@stdlib/number-float64-base-set-high-word' );\n* var PINF = require( '@stdlib/constants-float64-pinf' ); // => 0 11111111111 00000000000000000000 00000000000000000000000000000000\n*\n* var high = 1072693248 >>> 0; // => 0 01111111111 00000000000000000000\n*\n* // Set the higher order bits of `+infinity` to return `1`:\n* var y = setHighWord( PINF, high ); => 0 01111111111 0000000000000000000000000000000000000000000000000000\n* // returns 1.0\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar HIGH = require( './high.js' );\n\n\n// VARIABLES //\n\nvar FLOAT64_VIEW = new Float64Array( 1 );\nvar UINT32_VIEW = new Uint32Array( FLOAT64_VIEW.buffer );\n\n\n// MAIN //\n\n/**\n* Sets the more significant 32 bits of a double-precision floating-point number.\n*\n* ## Notes\n*\n* ```text\n* float64 (64 bits)\n* f := fraction (significand/mantissa) (52 bits)\n* e := exponent (11 bits)\n* s := sign bit (1 bit)\n*\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Float64 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Uint32 | Uint32 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* ```\n*\n* If little endian (more significant bits last):\n*\n* ```text\n* <-- lower higher -->\n* | f7 f6 f5 f4 f3 f2 e2 | f1 |s| e1 |\n* ```\n*\n* If big endian (more significant bits first):\n*\n* ```text\n* <-- higher lower -->\n* |s| e1 e2 | f1 f2 f3 f4 f5 f6 f7 |\n* ```\n*\n* In which Uint32 can we find the higher order bits? If little endian, the second; if big endian, the first.\n*\n* ## References\n*\n* - [Open Group][1]\n*\n* [1]: http://pubs.opengroup.org/onlinepubs/9629399/chap14.htm\n*\n* @param {number} x - double\n* @param {uinteger32} high - unsigned 32-bit integer to replace the higher order word of `x`\n* @returns {number} double having the same lower order word as `x`\n*\n* @example\n* var high = 5 >>> 0; // => 0 00000000000 00000000000000000101\n*\n* var y = setHighWord( 3.14e201, high ); // => 0 00000000000 0000000000000000010110010011110010110101100010000010\n* // returns 1.18350528745e-313\n*\n* @example\n* var PINF = require( '@stdlib/constants-float64-pinf' ); // => 0 11111111111 00000000000000000000 00000000000000000000000000000000\n*\n* var high = 1072693248 >>> 0; // => 0 01111111111 00000000000000000000\n*\n* // Set the higher order bits of `+infinity` to return `1`:\n* var y = setHighWord( PINF, high ); // => 0 01111111111 0000000000000000000000000000000000000000000000000000\n* // returns 1.0\n*/\nfunction setHighWord( x, high ) {\n\tFLOAT64_VIEW[ 0 ] = x;\n\tUINT32_VIEW[ HIGH ] = ( high >>> 0 ); // identity bit shift to ensure integer\n\treturn FLOAT64_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = setHighWord;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Set the less significant 32 bits of a double-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-set-low-word\n*\n* @example\n* var setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\n*\n* var low = 5 >>> 0; // => 00000000000000000000000000000101\n*\n* var x = 3.14e201; // => 0 11010011100 01001000001011000011 10010011110010110101100010000010\n*\n* var y = setLowWord( x, low ); // => 0 11010011100 01001000001011000011 00000000000000000000000000000101\n* // returns 3.139998651394392e+201\n*\n* @example\n* var setLowWord = require( '@stdlib/number-float64-base-set-low-word' );\n* var PINF = require( '@stdlib/constants-float64-pinf' );\n* var NINF = require( '@stdlib/constants-float64-ninf' );\n*\n* var low = 12345678;\n*\n* var y = setLowWord( PINF, low );\n* // returns NaN\n*\n* y = setLowWord( NINF, low );\n* // returns NaN\n*\n* y = setLowWord( NaN, low );\n* // returns NaN\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isLittleEndian = require( '@stdlib/assert-is-little-endian' );\n\n\n// MAIN //\n\nvar LOW;\nif ( isLittleEndian === true ) {\n\tLOW = 0; // first index\n} else {\n\tLOW = 1; // second index\n}\n\n\n// EXPORTS //\n\nmodule.exports = LOW;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar LOW = require( './low.js' );\n\n\n// VARIABLES //\n\nvar FLOAT64_VIEW = new Float64Array( 1 );\nvar UINT32_VIEW = new Uint32Array( FLOAT64_VIEW.buffer );\n\n\n// MAIN //\n\n/**\n* Sets the less significant 32 bits of a double-precision floating-point number.\n*\n* ## Notes\n*\n* ```text\n* float64 (64 bits)\n* f := fraction (significand/mantissa) (52 bits)\n* e := exponent (11 bits)\n* s := sign bit (1 bit)\n*\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Float64 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Uint32 | Uint32 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* ```\n*\n* If little endian (more significant bits last):\n*\n* ```text\n* <-- lower higher -->\n* | f7 f6 f5 f4 f3 f2 e2 | f1 |s| e1 |\n* ```\n*\n* If big endian (more significant bits first):\n*\n* ```text\n* <-- higher lower -->\n* |s| e1 e2 | f1 f2 f3 f4 f5 f6 f7 |\n* ```\n*\n* In which Uint32 can we find the lower order bits? If little endian, the first; if big endian, the second.\n*\n* ## References\n*\n* - [Open Group][1]\n*\n* [1]: http://pubs.opengroup.org/onlinepubs/9629399/chap14.htm\n*\n* @param {number} x - double\n* @param {uinteger32} low - unsigned 32-bit integer to replace the lower order word of `x`\n* @returns {number} double having the same higher order word as `x`\n*\n* @example\n* var low = 5 >>> 0; // => 00000000000000000000000000000101\n*\n* var x = 3.14e201; // => 0 11010011100 01001000001011000011 10010011110010110101100010000010\n*\n* var y = setLowWord( x, low ); // => 0 11010011100 01001000001011000011 00000000000000000000000000000101\n* // returns 3.139998651394392e+201\n*\n* @example\n* var PINF = require( '@stdlib/constants-float64-pinf' );\n* var NINF = require( '@stdlib/constants-float64-ninf' );\n*\n* var low = 12345678;\n*\n* var y = setLowWord( PINF, low );\n* // returns NaN\n*\n* y = setLowWord( NINF, low );\n* // returns NaN\n*\n* y = setLowWord( NaN, low );\n* // returns NaN\n*/\nfunction setLowWord( x, low ) {\n\tFLOAT64_VIEW[ 0 ] = x;\n\tUINT32_VIEW[ LOW ] = ( low >>> 0 ); // identity bit shift to ensure integer\n\treturn FLOAT64_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = setLowWord;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @module @stdlib/number-float64-base-to-float32\n*\n* @example\n* var float64ToFloat32 = require( '@stdlib/number-float64-base-to-float32' );\n*\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\n\n// MODULES //\n\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar float64ToFloat32;\nif ( typeof builtin === 'function' ) {\n\tfloat64ToFloat32 = builtin;\n} else {\n\tfloat64ToFloat32 = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar fround = ( typeof Math.fround === 'function' ) ? Math.fround : null; // eslint-disable-line stdlib/no-builtin-math\n\n\n// EXPORTS //\n\nmodule.exports = fround;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float32Array = require( '@stdlib/array-float32' );\n\n\n// VARIABLES //\n\nvar FLOAT32_VIEW = new Float32Array( 1 );\n\n\n// MAIN //\n\n/**\n* Converts a double-precision floating-point number to the nearest single-precision floating-point number.\n*\n* @param {number} x - double-precision floating-point number\n* @returns {number} nearest single-precision floating-point number\n*\n* @example\n* var y = float64ToFloat32( 1.337 );\n* // returns 1.3370000123977661\n*/\nfunction float64ToFloat32( x ) {\n\tFLOAT32_VIEW[ 0 ] = x;\n\treturn FLOAT32_VIEW[ 0 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = float64ToFloat32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar Float64Array = require( '@stdlib/array-float64' );\nvar indices = require( './indices.js' );\n\n\n// VARIABLES //\n\nvar FLOAT64_VIEW = new Float64Array( 1 );\nvar UINT32_VIEW = new Uint32Array( FLOAT64_VIEW.buffer );\n\nvar HIGH = indices.HIGH;\nvar LOW = indices.LOW;\n\n\n// MAIN //\n\n/**\n* Splits a double-precision floating-point number into a higher order word (unsigned 32-bit integer) and a lower order word (unsigned 32-bit integer).\n*\n* ## Notes\n*\n* ```text\n* float64 (64 bits)\n* f := fraction (significand/mantissa) (52 bits)\n* e := exponent (11 bits)\n* s := sign bit (1 bit)\n*\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Float64 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* | Uint32 | Uint32 |\n* |-------- -------- -------- -------- -------- -------- -------- --------|\n* ```\n*\n* If little endian (more significant bits last):\n*\n* ```text\n* <-- lower higher -->\n* | f7 f6 f5 f4 f3 f2 e2 | f1 |s| e1 |\n* ```\n*\n* If big endian (more significant bits first):\n*\n* ```text\n* <-- higher lower -->\n* |s| e1 e2 | f1 f2 f3 f4 f5 f6 f7 |\n* ```\n*\n* In which Uint32 can we find the higher order bits? If little endian, the second; if big endian, the first.\n*\n* ## References\n*\n* - [Open Group][1]\n*\n* [1]: http://pubs.opengroup.org/onlinepubs/9629399/chap14.htm\n*\n* @private\n* @param {number} x - input value\n* @param {Collection} out - output array\n* @param {integer} stride - output array stride\n* @param {NonNegativeInteger} offset - output array index offset\n* @returns {Collection} output array\n*\n* @example\n* var Uint32Array = require( '@stdlib/array-uint32' );\n*\n* var out = new Uint32Array( 2 );\n*\n* var w = toWords( 3.14e201, out, 1, 0 );\n* // returns [ 1774486211, 2479577218 ]\n*\n* var bool = ( w === out );\n* // returns true\n*/\nfunction toWords( x, out, stride, offset ) {\n\tFLOAT64_VIEW[ 0 ] = x;\n\tout[ offset ] = UINT32_VIEW[ HIGH ];\n\tout[ offset + stride ] = UINT32_VIEW[ LOW ];\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = toWords;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Split a double-precision floating-point number into a higher order word (unsigned 32-bit integer) and a lower order word (unsigned 32-bit integer).\n*\n* @module @stdlib/number-float64-base-to-words\n*\n* @example\n* var toWords = require( '@stdlib/number-float64-base-to-words' );\n*\n* var w = toWords( 3.14e201 );\n* // returns [ 1774486211, 2479577218 ]\n*\n* @example\n* var Uint32Array = require( '@stdlib/array-uint32' );\n* var toWords = require( '@stdlib/number-float64-base-to-words' );\n*\n* var out = new Uint32Array( 2 );\n*\n* var w = toWords.assign( 3.14e201, out, 1, 0 );\n* // returns [ 1774486211, 2479577218 ]\n*\n* var bool = ( w === out );\n* // returns true\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar assign = require( './assign.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'assign', assign );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isLittleEndian = require( '@stdlib/assert-is-little-endian' );\n\n\n// MAIN //\n\nvar indices;\nvar HIGH;\nvar LOW;\n\nif ( isLittleEndian === true ) {\n\tHIGH = 1; // second index\n\tLOW = 0; // first index\n} else {\n\tHIGH = 0; // first index\n\tLOW = 1; // second index\n}\nindices = {\n\t'HIGH': HIGH,\n\t'LOW': LOW\n};\n\n\n// EXPORTS //\n\nmodule.exports = indices;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar fcn = require( './assign.js' );\n\n\n// MAIN //\n\n/**\n* Splits a double-precision floating-point number into a higher order word (unsigned 32-bit integer) and a lower order word (unsigned 32-bit integer).\n*\n* @param {number} x - input value\n* @returns {Array} output array\n*\n* @example\n* var w = toWords( 3.14e201 );\n* // returns [ 1774486211, 2479577218 ]\n*/\nfunction toWords( x ) {\n\treturn fcn( x, [ 0>>>0, 0>>>0 ], 1, 0 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = toWords;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Convert an unsigned 32-bit integer to a signed 32-bit integer.\n*\n* @module @stdlib/number-uint32-base-to-int32\n*\n* @example\n* var float64ToUint32 = require( '@stdlib/number-float64-base-to-uint32' );\n* var uint32ToInt32 = require( '@stdlib/number-uint32-base-to-int32' );\n*\n* var y = uint32ToInt32( float64ToUint32( 4294967295 ) );\n* // returns -1\n*\n* y = uint32ToInt32( float64ToUint32( 3 ) );\n* // returns 3\n*/\n\n// MODULES //\n\nvar uint32ToInt32 = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = uint32ToInt32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Converts an unsigned 32-bit integer to a signed 32-bit integer.\n*\n* @param {uinteger32} x - unsigned 32-bit integer\n* @returns {integer32} signed 32-bit integer\n*\n* @example\n* var float64ToUint32 = require( '@stdlib/number-float64-base-to-uint32' );\n* var y = uint32ToInt32( float64ToUint32( 4294967295 ) );\n* // returns -1\n*\n* @example\n* var float64ToUint32 = require( '@stdlib/number-float64-base-to-uint32' );\n* var y = uint32ToInt32( float64ToUint32( 3 ) );\n* // returns 3\n*/\nfunction uint32ToInt32( x ) {\n\t// NOTE: we could also use typed-arrays to achieve the same end.\n\treturn x|0; // asm type annotation\n}\n\n\n// EXPORTS //\n\nmodule.exports = uint32ToInt32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n*\n* @name assign\n* @type {Function}\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nvar assign = Object.assign; // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFunction = require( '@stdlib/assert-is-function' );\n\n\n// MAIN //\n\nvar bool = isFunction( Object.assign ); // eslint-disable-line node/no-unsupported-features/es-builtins\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Copy enumerable own properties from one or more source objects to a target object.\n*\n* @module @stdlib/object-assign\n*\n* @example\n* var assign = require( '@stdlib/object-assign' );\n*\n* var out = assign( {}, { 'foo': 'bar' }, { 'baz': 'beep' } );\n* // returns { 'foo': 'bar', 'baz': 'beep' }\n*/\n\n// MODULES //\n\nvar hasObjectAssign = require( './has_object_assign.js' );\nvar main = require( './builtin.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar assign;\nif ( hasObjectAssign ) {\n\tassign = main;\n} else {\n\tassign = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2023 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar enumerableProperties = require( '@stdlib/utils-enumerable-properties' );\nvar Object = require( '@stdlib/object-ctor' );\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Copies own enumerable properties from source objects to a target object.\n*\n* ## Notes\n*\n* - If a property key is present in multiple sources, the property from the last source that defines the key prevails.\n* - The target object is mutated.\n*\n* @param {Object} target - target object\n* @param {...Object} source - source object(s)\n* @throws {TypeError} first argument must not be null or undefined\n* @returns {Object} target object\n*\n* @example\n* var obj1 = {\n* 'a': 'beep'\n* };\n* var obj2 = {\n* 'b': 'boop'\n* };\n*\n* var out = assign( obj1, obj2 );\n* // returns { 'a': 'beep', 'b': 'boop' }\n*/\nfunction assign( target ) {\n\tvar source;\n\tvar keys;\n\tvar key;\n\tvar len;\n\tvar to;\n\tvar i;\n\tvar j;\n\tif ( target === void 0 || target === null ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a non-null object. Value: `%s`.', target ) );\n\t}\n\tto = Object( target );\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\tsource = arguments[ i ];\n\t\tif ( source === void 0 || source === null ) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tkeys = enumerableProperties( Object( source ) );\n\t\tlen = keys.length;\n\t\tfor ( j = 0; j < len; j++ ) {\n\t\t\tkey = keys[ j ];\n\t\t\tto[ key ] = source[ key ];\n\t\t}\n\t}\n\treturn to;\n}\n\n\n// EXPORTS //\n\nmodule.exports = assign;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Object constructor.\n*\n* @module @stdlib/object-ctor\n*\n* @example\n* var Object = require( '@stdlib/object-ctor' );\n*\n* var o = new Object( null );\n* // returns {}\n*\n* o = new Object( 5.0 );\n* // returns \n*\n* o = new Object( 'beep' );\n* // returns \n*\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an object.\n*\n* @name Object\n* @constructor\n* @type {Function}\n* @param {*} value - input value\n* @returns {Object} object\n*\n* @example\n* var o = new Object( null );\n* // returns {}\n*\n* @example\n* var o = new Object( 5.0 );\n* // returns \n*\n* @example\n* var o = new Object( 'beep' );\n* // returns \n*\n* @example\n* var o1 = {};\n*\n* var o2 = new Object( o1 );\n* // returns {}\n*\n* var bool = ( o1 === o2 );\n* // returns true\n*/\nvar Obj = Object; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = Obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar standardGamma = require( './standard_gamma.js' );\nvar sample1 = require( './sample1.js' );\nvar sample2 = require( './sample2.js' );\nvar sample3 = require( './sample3.js' );\n\n\n// MAIN //\n\n/**\n* Returns a random number drawn from a beta distribution.\n*\n* @private\n* @param {PRNG} randu - pseudorandom number generator for uniformly distributed numbers\n* @param {PRNG} randn - pseudorandom number generator for normally distributed numbers\n* @param {PositiveNumber} alpha - first shape parameter\n* @param {PositiveNumber} beta - second shape parameter\n* @returns {Probability} pseudorandom number\n*/\nfunction sample( randu, randn, alpha, beta ) {\n\tvar ga;\n\tvar gb;\n\tif ( alpha === beta && alpha > 1.5 ) {\n\t\treturn sample1( randu, randn, alpha );\n\t}\n\tif ( alpha > 1.0 && beta > 1.0 ) {\n\t\treturn sample2( randu, randn, alpha, beta );\n\t}\n\tif ( alpha < 1.0 && beta < 1.0 ) {\n\t\treturn sample3( randu, alpha, beta );\n\t}\n\t// General case of using two gamma random variates:\n\tga = standardGamma( randu, randn, alpha );\n\tgb = standardGamma( randu, randn, beta );\n\treturn ga / ( ga + gb );\n}\n\n\n// EXPORTS //\n\nmodule.exports = sample;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar setReadWriteAccessor = require( '@stdlib/utils-define-nonenumerable-read-write-accessor' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar constantFunction = require( '@stdlib/utils-constant-function' );\nvar noop = require( '@stdlib/utils-noop' );\nvar randn = require( '@stdlib/random-base-improved-ziggurat' ).factory;\nvar randu = require( '@stdlib/random-base-mt19937' ).factory;\nvar isnan = require( '@stdlib/math-base-assert-is-nan' );\nvar gcopy = require( '@stdlib/blas-base-gcopy' );\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar isUint32Array = require( '@stdlib/assert-is-uint32array' );\nvar assign = require( '@stdlib/object-assign' );\nvar typedarray2json = require( '@stdlib/array-to-json' );\nvar format = require( '@stdlib/string-format' );\nvar validate = require( './validate.js' );\nvar beta0 = require( './beta.js' );\n\n\n// MAIN //\n\n/**\n* Returns a pseudorandom number generator for generating beta distributed random numbers.\n*\n* @param {PositiveNumber} [alpha] - first shape parameter\n* @param {PositiveNumber} [beta] - second shape parameter\n* @param {Options} [options] - function options\n* @param {PRNG} [options.prng] - pseudorandom number generator which generates uniformly distributed pseudorandom numbers\n* @param {PRNGSeedMT19937} [options.seed] - pseudorandom number generator seed\n* @param {PRNGStateMT19937} [options.state] - pseudorandom number generator state\n* @param {boolean} [options.copy=true] - boolean indicating whether to copy a provided pseudorandom number generator state\n* @throws {TypeError} `alpha` must be a positive number\n* @throws {TypeError} `beta` must be a positive number\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} must provide valid options\n* @throws {Error} must provide a valid state\n* @returns {PRNG} pseudorandom number generator\n*\n* @example\n* var beta = factory( 2.0, 1.0 );\n* var v = beta();\n* // returns \n*\n* @example\n* var beta = factory( 2.0, 2.0, {\n* 'seed': 297\n* });\n* var v = beta();\n* // returns \n*/\nfunction factory() {\n\tvar STATE;\n\tvar rnorm;\n\tvar alpha;\n\tvar beta;\n\tvar opts;\n\tvar rand;\n\tvar prng;\n\tvar FLG;\n\tvar err;\n\n\tFLG = true;\n\tif ( arguments.length === 0 ) {\n\t\topts = {\n\t\t\t'copy': false\n\t\t};\n\t\trand = randu( opts );\n\t} else if ( arguments.length === 1 ) {\n\t\topts = arguments[ 0 ];\n\t\tif ( !isObject( opts ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', opts ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'copy' ) && !isBoolean( opts.copy ) ) {\n\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'copy', opts.copy ) );\n\t\t}\n\t\tif ( hasOwnProp( opts, 'prng' ) ) {\n\t\t\tif ( !isFunction( opts.prng ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.', 'prng', opts.prng ) );\n\t\t\t}\n\t\t\trand = opts.prng;\n\t\t} else {\n\t\t\tif ( hasOwnProp( opts, 'state' ) && !isUint32Array( opts.state ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a Uint32Array. Option: `%s`.', 'state', opts.state ) );\n\t\t\t}\n\t\t\topts = assign( {}, opts );\n\t\t\tif ( opts.copy === false ) {\n\t\t\t\tFLG = false;\n\t\t\t} else if ( opts.state ) {\n\t\t\t\topts.state = gcopy( opts.state.length, opts.state, 1, new Uint32Array( opts.state.length ), 1 ); // eslint-disable-line max-len\n\t\t\t}\n\t\t\topts.copy = false;\n\t\t\trand = randu( opts );\n\t\t}\n\t} else {\n\t\talpha = arguments[ 0 ];\n\t\tbeta = arguments[ 1 ];\n\t\terr = validate( alpha, beta );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t\tif ( arguments.length > 2 ) {\n\t\t\topts = arguments[ 2 ];\n\t\t\tif ( !isObject( opts ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', opts ) );\n\t\t\t}\n\t\t\tif ( hasOwnProp( opts, 'copy' ) && !isBoolean( opts.copy ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'copy', opts.copy ) );\n\t\t\t}\n\t\t\tif ( hasOwnProp( opts, 'prng' ) ) {\n\t\t\t\tif ( !isFunction( opts.prng ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.', 'prng', opts.prng ) );\n\t\t\t\t}\n\t\t\t\trand = opts.prng;\n\t\t\t} else {\n\t\t\t\tif ( hasOwnProp( opts, 'state' ) && !isUint32Array( opts.state ) ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a Uint32Array. Option: `%s`.', 'state', opts.state ) );\n\t\t\t\t}\n\t\t\t\topts = assign( {}, opts );\n\t\t\t\tif ( opts.copy === false ) {\n\t\t\t\t\tFLG = false;\n\t\t\t\t} else if ( opts.state ) {\n\t\t\t\t\topts.state = gcopy( opts.state.length, opts.state, 1, new Uint32Array( opts.state.length ), 1 ); // eslint-disable-line max-len\n\t\t\t\t}\n\t\t\t\topts.copy = false;\n\t\t\t\trand = randu( opts );\n\t\t\t}\n\t\t} else {\n\t\t\topts = {\n\t\t\t\t'copy': false\n\t\t\t};\n\t\t\trand = randu( opts );\n\t\t}\n\t}\n\tif ( opts && opts.prng ) {\n\t\trnorm = randn({\n\t\t\t'prng': opts.prng\n\t\t});\n\t} else {\n\t\tif ( opts.state ) {\n\t\t\tSTATE = opts.state;\n\t\t} else {\n\t\t\tSTATE = rand.state;\n\t\t\trand.state = STATE; // updates the underlying PRNG to point to a shared state\n\t\t}\n\t\trnorm = randn({\n\t\t\t'state': STATE,\n\t\t\t'copy': false\n\t\t});\n\t}\n\tif ( alpha === void 0 ) {\n\t\tprng = beta2;\n\t} else {\n\t\tprng = beta1;\n\t}\n\tsetReadOnly( prng, 'NAME', 'beta' );\n\n\t// If we are provided an \"external\" PRNG, we don't support getting or setting PRNG state, as we'd need to check for compatible state value types, etc, entailing considerable complexity.\n\tif ( opts && opts.prng ) {\n\t\tsetReadOnly( prng, 'seed', null );\n\t\tsetReadOnly( prng, 'seedLength', null );\n\t\tsetReadWriteAccessor( prng, 'state', constantFunction( null ), noop );\n\t\tsetReadOnly( prng, 'stateLength', null );\n\t\tsetReadOnly( prng, 'byteLength', null );\n\t\tsetReadOnly( prng, 'toJSON', constantFunction( null ) );\n\t\tsetReadOnly( prng, 'PRNG', rand );\n\t} else {\n\t\tsetReadOnlyAccessor( prng, 'seed', getSeed );\n\t\tsetReadOnlyAccessor( prng, 'seedLength', getSeedLength );\n\t\tsetReadWriteAccessor( prng, 'state', getState, setState );\n\t\tsetReadOnlyAccessor( prng, 'stateLength', getStateLength );\n\t\tsetReadOnlyAccessor( prng, 'byteLength', getStateSize );\n\t\tsetReadOnly( prng, 'toJSON', toJSON );\n\t\tsetReadOnly( prng, 'PRNG', rand );\n\t\trand = rand.normalized;\n\t}\n\treturn prng;\n\n\t/**\n\t* Returns the PRNG seed.\n\t*\n\t* @private\n\t* @returns {PRNGSeedMT19937} seed\n\t*/\n\tfunction getSeed() {\n\t\treturn rand.seed;\n\t}\n\n\t/**\n\t* Returns the PRNG seed length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} seed length\n\t*/\n\tfunction getSeedLength() {\n\t\treturn rand.seedLength;\n\t}\n\n\t/**\n\t* Returns the PRNG state length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state length\n\t*/\n\tfunction getStateLength() {\n\t\treturn rand.stateLength;\n\t}\n\n\t/**\n\t* Returns the PRNG state size (in bytes).\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state size (in bytes)\n\t*/\n\tfunction getStateSize() {\n\t\treturn rand.byteLength;\n\t}\n\n\t/**\n\t* Returns the current pseudorandom number generator state.\n\t*\n\t* @private\n\t* @returns {PRNGStateMT19937} current state\n\t*/\n\tfunction getState() {\n\t\treturn rand.state;\n\t}\n\n\t/**\n\t* Sets the pseudorandom number generator state.\n\t*\n\t* @private\n\t* @param {PRNGStateMT19937} s - generator state\n\t* @throws {TypeError} must provide a `Uint32Array`\n\t* @throws {Error} must provide a valid state\n\t*/\n\tfunction setState( s ) {\n\t\tif ( !isUint32Array( s ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a Uint32Array. Value: `%s`.', s ) );\n\t\t}\n\t\tif ( FLG ) {\n\t\t\ts = gcopy( s.length, s, 1, new Uint32Array( s.length ), 1 );\n\t\t}\n\t\trand.state = s;\n\t}\n\n\t/**\n\t* Serializes the pseudorandom number generator as a JSON object.\n\t*\n\t* ## Notes\n\t*\n\t* - `JSON.stringify()` implicitly calls this method when stringifying a PRNG.\n\t*\n\t* @private\n\t* @returns {Object} JSON representation\n\t*/\n\tfunction toJSON() {\n\t\tvar out = {};\n\t\tout.type = 'PRNG';\n\t\tout.name = prng.NAME;\n\t\tout.state = typedarray2json( rand.state );\n\t\tif ( alpha === void 0 ) {\n\t\t\tout.params = [];\n\t\t} else {\n\t\t\tout.params = [ alpha, beta ];\n\t\t}\n\t\treturn out;\n\t}\n\n\t/**\n\t* Returns a random number drawn from a beta distribution with bound parameter values.\n\t*\n\t* @private\n\t* @returns {Probability} pseudorandom number\n\t*\n\t* @example\n\t* var v = beta1();\n\t* // returns \n\t*/\n\tfunction beta1() {\n\t\treturn beta0( rand, rnorm, alpha, beta );\n\t}\n\n\t/**\n\t* Returns a random number drawn from a beta distribution.\n\t*\n\t* @private\n\t* @param {PositiveNumber} alpha - first shape parameter\n\t* @param {PositiveNumber} beta - second shape parameter\n\t* @returns {Probability} pseudorandom number\n\t*\n\t* @example\n\t* var v = beta2( 2.0, 3.0 );\n\t* // returns \n\t*/\n\tfunction beta2( alpha, beta ) {\n\t\tif (\n\t\t\tisnan( alpha ) ||\n\t\t\tisnan( beta ) ||\n\t\t\talpha <= 0.0 ||\n\t\t\tbeta <= 0.0\n\t\t) {\n\t\t\treturn NaN;\n\t\t}\n\t\treturn beta0( rand, rnorm, alpha, beta );\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Beta distributed pseudorandom numbers.\n*\n* @module @stdlib/random-base-beta\n*\n* @example\n* var beta = require( '@stdlib/random-base-beta' );\n*\n* var v = beta( 2.0, 3.0 );\n* // returns \n*\n* @example\n* var factory = require( '@stdlib/random-base-beta' ).factory;\n*\n* var beta = factory( 3.0, 2.0, {\n* 'seed': 297\n* });\n*\n* var v = beta();\n* // returns \n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\n/**\n* Generates a beta distributed random number.\n*\n* ## References\n*\n* - Ahrens, J.H., and U. Dieter. 1974. \"Computer methods for sampling from gamma, beta, poisson and bionomial distributions.\" _Computing_ 12 (3): 223–46. doi:[10.1007/BF02293108](http://dx.doi.org/10.1007/BF02293108).\n* - Jöhnk, M.D. 1964. \"Erzeugung von Betaverteilten Und Gammaverteilten Zufallszahlen.\" _Metrika_ 8: 5–15. .\n*\n* @name beta\n* @type {PRNG}\n* @param {PositiveNumber} alpha - first shape parameter\n* @param {PositiveNumber} beta - second shape parameter\n* @returns {Probability} pseudorandom number\n*\n* @example\n* var r = beta( 2.0, 5.0 );\n* // returns \n*\n* @example\n* var r = beta( -2.0, 5.0 );\n* // returns NaN\n*/\nvar beta = factory();\n\n\n// EXPORTS //\n\nmodule.exports = beta;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar ln = require( '@stdlib/math-base-special-ln' );\n\n\n// MAIN //\n\n/**\n* Handles case where `alpha` and `beta` are equal and greater than `1.5`.\n*\n* @private\n* @param {PRNG} randu - PRNG for uniformly distributed numbers\n* @param {PRNG} randn - PRNG for normally distributed numbers\n* @param {PositiveNumber} alpha - first shape parameter\n* @returns {Probability} pseudorandom number\n*/\nfunction sample( randu, randn, alpha ) {\n\tvar flg;\n\tvar s4;\n\tvar A;\n\tvar s;\n\tvar t;\n\tvar u;\n\tvar x;\n\tvar y;\n\n\tA = alpha - 1.0;\n\tt = pow( A+A, 0.5 );\n\n\tflg = true;\n\twhile ( flg === true ) {\n\t\ts = randn();\n\t\tx = 0.5 * ( 1.0+(s/t) );\n\t\tif ( x >= 0.0 && x <= 1.0 ) {\n\t\t\tu = randu();\n\t\t\ts4 = pow( s, 4.0 );\n\t\t\ty = (8.0*alpha) - 12.0;\n\t\t\ty = 1.0 - (s4 / y);\n\t\t\tif ( u <= y ) {\n\t\t\t\tflg = false;\n\t\t\t} else {\n\t\t\t\ty += 0.5 * pow( s4/((8.0*alpha)-8.0), 2.0 );\n\t\t\t\tif ( u < y ) {\n\t\t\t\t\ty = A * ln( 4.0*x*(1.0-x) );\n\t\t\t\t\ty += s*s / 2.0;\n\t\t\t\t\tif ( y >= ln( u ) ) {\n\t\t\t\t\t\tflg = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = sample;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar ln = require( '@stdlib/math-base-special-ln' );\n\n\n// MAIN //\n\n/**\n* Handles case where both `alpha` and `beta` are greater than `1.0`.\n*\n* @private\n* @param {PRNG} randu - PRNG for uniformly distributed numbers\n* @param {PRNG} randn - PRNG for normally distributed numbers\n* @param {PositiveNumber} alpha - first shape parameter\n* @param {PositiveNumber} beta - second shape parameter\n* @returns {Probability} pseudorandom number\n*/\nfunction sample( randu, randn, alpha, beta ) {\n\tvar sigma;\n\tvar flg;\n\tvar mu;\n\tvar A;\n\tvar B;\n\tvar C;\n\tvar L;\n\tvar s;\n\tvar u;\n\tvar x;\n\tvar y;\n\n\tA = alpha - 1.0;\n\tB = beta - 1.0;\n\tC = A + B;\n\tL = C * ln( C );\n\tmu = A / C;\n\tsigma = 0.5 / pow( C, 0.5 );\n\n\tflg = true;\n\twhile ( flg === true ) {\n\t\ts = randn();\n\t\tx = mu + (s*sigma);\n\t\tif ( x >= 0.0 && x <= 1.0 ) {\n\t\t\tu = randu();\n\t\t\ty = A * ln( x/A );\n\t\t\ty += B * ln((1.0-x) / B);\n\t\t\ty += L + (0.5*s*s);\n\t\t\tif ( y >= ln( u ) ) {\n\t\t\t\tflg = false;\n\t\t\t}\n\t\t}\n\t}\n\treturn x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = sample;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar pow = require( '@stdlib/math-base-special-pow' );\nvar ln = require( '@stdlib/math-base-special-ln' );\n\n\n// MAIN //\n\n/**\n* Handles general case.\n*\n* @private\n* @param {PRNG} rand - PRNG for uniformly distributed numbers\n* @param {PositiveNumber} alpha - first shape parameter\n* @param {PositiveNumber} beta - second shape parameter\n* @returns {Probability} pseudorandom number\n*/\nfunction sample( rand, alpha, beta ) {\n\tvar lx;\n\tvar ly;\n\tvar xy;\n\tvar u;\n\tvar v;\n\tvar x;\n\tvar y;\n\twhile ( true ) {\n\t\tu = rand();\n\t\tv = rand();\n\t\tx = pow( u, 1.0/alpha );\n\t\ty = pow( v, 1.0/beta );\n\t\txy = x + y;\n\t\tif ( xy <= 1.0 ) {\n\t\t\tif ( xy > 0.0 ) {\n\t\t\t\treturn x / ( xy );\n\t\t\t}\n\t\t\tlx = ln( u ) / alpha;\n\t\t\tly = ln( v ) / beta;\n\t\t\tif ( lx > ly ) {\n\t\t\t\tly -= lx;\n\t\t\t\tlx = 0.0;\n\t\t\t} else {\n\t\t\t\tlx -= ly;\n\t\t\t\tly = 0.0;\n\t\t\t}\n\t\t\treturn exp( lx - ln( exp(lx) + exp(ly) ) );\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = sample;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ln = require( '@stdlib/math-base-special-ln' );\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar pow = require( '@stdlib/math-base-special-pow' );\n\n\n// VARIABLES //\n\nvar ONE_THIRD = 1.0 / 3.0;\n\n\n// MAIN //\n\n/**\n* Returns a pseudorandom number drawn from a gamma distribution with rate parameter equal to 1.0 and shape parameter equal to `alpha`.\n*\n* @private\n* @param {PRNG} randu - PRNG for uniformly distributed numbers\n* @param {PRNG} randn - PRNG for standard normally distributed numbers\n* @param {PositiveNumber} alpha - shape parameter\n* @returns {PositiveNumber} pseudorandom number\n*/\nfunction standardGamma( randu, randn, alpha ) {\n\tvar flg;\n\tvar x2;\n\tvar v0;\n\tvar v1;\n\tvar c;\n\tvar d;\n\tvar x;\n\tvar s;\n\tvar u;\n\tvar v;\n\n\tif ( alpha < 1.0 ) {\n\t\td = alpha + 1.0 - ONE_THIRD;\n\t\tc = 1.0 / sqrt( 9.0*d );\n\t\ts = pow( randu(), 1.0/alpha );\n\t} else {\n\t\td = alpha - ONE_THIRD;\n\t\tc = 1.0 / sqrt( 9.0*d );\n\t\ts = 1.0;\n\t}\n\tflg = true;\n\twhile ( flg ) {\n\t\tdo {\n\t\t\tx = randn();\n\t\t\tv = 1.0 + (c*x);\n\t\t} while ( v <= 0.0 );\n\t\tv *= v * v;\n\t\tx2 = x * x;\n\t\tv0 = 1.0 - (0.331*x2*x2);\n\t\tv1 = (0.5*x2) + (d*( 1.0-v+ln(v) ));\n\t\tu = randu();\n\t\tif ( u < v0 || ln( u ) < v1 ) {\n\t\t\tflg = false;\n\t\t}\n\t}\n\treturn d * v * s;\n}\n\n\n// EXPORTS //\n\nmodule.exports = standardGamma;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isPositive = require( '@stdlib/assert-is-positive-number' ).isPrimitive;\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Validates parameters.\n*\n* @private\n* @param {PositiveNumber} alpha - first shape parameter\n* @param {PositiveNumber} beta - second shape parameter\n* @returns {(Error|null)} error or null\n*\n* @example\n* var err = validate( 1.0, 2.0 );\n* if ( err ) {\n* throw err;\n* }\n*/\nfunction validate( alpha, beta ) {\n\tif ( !isPositive( alpha ) ) {\n\t\treturn new TypeError( format( 'invalid argument. First argument must be a positive number. Value: `%s`.', alpha ) );\n\t}\n\tif ( !isPositive( beta ) ) {\n\t\treturn new TypeError( format( 'invalid argument. Second argument must be a positive number. Value: `%s`.', beta ) );\n\t}\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = validate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar sqrt = require( '@stdlib/math-base-special-sqrt' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar ln = require( '@stdlib/math-base-special-ln' );\n\n\n// VARIABLES //\n\n// (R*phi(R) + Pr(X>=R))*sqrt(2\\pi)\nvar V = 9.91256303526217e-3;\n\n\n// MAIN //\n\n/**\n* Returns an array containing coordinates such that each rectangle has the same area.\n*\n* @private\n* @param {PositiveInteger} N - number of rectangles\n* @param {number} rTail - start of right tail\n* @returns {NumberArray} coordinate array\n*\n* @example\n* var X = coordsArray( 128, 3.44 );\n* // returns \n*/\nfunction coordsArray( N, rTail ) {\n\tvar X;\n\tvar f;\n\tvar i;\n\n\tf = exp( -0.5 * rTail * rTail );\n\n\tX = [];\n\tX.push( V/f ); // bottom block: V / f(R)\n\tX.push( rTail );\n\tfor ( i = 2; i < N; i++ ) {\n\t\tX[ i ] = sqrt( -2.0 * ln( ( V/X[i-1] ) + f ) );\n\t\tf = exp( -0.5 * X[ i ] * X[ i ] );\n\t}\n\tX.push( 0.0 );\n\treturn X;\n}\n\n\n// EXPORTS //\n\nmodule.exports = coordsArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar setReadWriteAccessor = require( '@stdlib/utils-define-nonenumerable-read-write-accessor' );\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isUint32Array = require( '@stdlib/assert-is-uint32array' );\nvar mt19937 = require( '@stdlib/random-base-mt19937' ).factory;\nvar constantFunction = require( '@stdlib/utils-constant-function' );\nvar noop = require( '@stdlib/utils-noop' );\nvar floor = require( '@stdlib/math-base-special-floor' );\nvar UINT32_MAX = require( '@stdlib/constants-uint32-max' );\nvar typedarray2json = require( '@stdlib/array-to-json' );\nvar format = require( '@stdlib/string-format' );\nvar improvedZiggurat = require( './improved_ziggurat.js' );\n\n\n// MAIN //\n\n/**\n* Returns a pseudorandom number generator which implements the improved Ziggurat method to generate normally distributed pseudorandom numbers.\n*\n* @param {Options} [options] - function options\n* @param {PRNG} [options.prng] - pseudorandom number generator which generates uniformly distributed pseudorandom numbers\n* @param {PRNGSeedMT19937} [options.seed] - pseudorandom number generator seed\n* @param {PRNGStateMT19937} [options.state] - pseudorandom number generator state\n* @param {boolean} [options.copy=true] - boolean indicating whether to copy a provided pseudorandom number generator state\n* @throws {TypeError} must provide an object\n* @throws {TypeError} must provide valid options\n* @throws {Error} must provide a valid state\n* @returns {PRNG} pseudorandom number generator\n*\n* @example\n* var randn = factory();\n*\n* var r = randn();\n* // returns \n*\n* @example\n* // Return a seeded PRNG:\n* var randn = factory({\n* 'seed': 12345\n* });\n*\n* var r = randn();\n* // returns \n*/\nfunction factory( options ) {\n\tvar randu;\n\tvar randi;\n\tvar randn;\n\tvar opts;\n\n\topts = {\n\t\t'copy': true\n\t};\n\tif ( arguments.length ) {\n\t\tif ( !isObject( options ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide an object. Value: `%s`.', options ) );\n\t\t}\n\t\tif ( hasOwnProp( options, 'copy' ) ) {\n\t\t\topts.copy = options.copy;\n\t\t\tif ( !isBoolean( options.copy ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'copy', options.copy ) );\n\t\t\t}\n\t\t}\n\t\tif ( hasOwnProp( options, 'prng' ) ) {\n\t\t\tif ( !isFunction( options.prng ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.', 'prng', options.prng ) );\n\t\t\t}\n\t\t\trandu = options.prng;\n\t\t}\n\t\t// If provided a PRNG, ignore the `state` option, as we don't support getting or setting PRNG state.\n\t\telse if ( hasOwnProp( options, 'state' ) ) {\n\t\t\topts.state = options.state;\n\t\t\tif ( !isUint32Array( options.state ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a Uint32Array. Option: `%s`.', 'state', options.state ) );\n\t\t\t}\n\t\t}\n\t\t// If provided a PRNG, ignore the `seed` option, as a `seed`, by itself, is insufficient to guarantee reproducibility. If provided a state, ignore the `seed` option, as a PRNG state should contain seed information.\n\t\telse if ( hasOwnProp( options, 'seed' ) ) {\n\t\t\topts.seed = options.seed;\n\t\t\tif ( options.seed === void 0 ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.', 'seed', options.seed ) );\n\t\t\t}\n\t\t}\n\t}\n\tif ( opts.state === void 0 ) {\n\t\tif ( randu === void 0 ) {\n\t\t\trandi = mt19937( opts );\n\t\t\trandu = randi.normalized;\n\t\t} else {\n\t\t\trandi = mt19937({\n\t\t\t\t'seed': floor( 1.0 + ( UINT32_MAX*randu() ) ), // allows seeding via an externally seeded PRNG\n\t\t\t\t'copy': opts.copy\n\t\t\t});\n\t\t\topts.seed = null;\n\t\t}\n\t} else {\n\t\trandi = mt19937( opts );\n\t\trandu = randi.normalized;\n\t}\n\trandn = improvedZiggurat( randu, randi );\n\n\tsetReadOnly( randn, 'NAME', 'improved-ziggurat' );\n\tif ( opts.seed === null ) {\n\t\tsetReadOnly( randn, 'seed', null );\n\t\tsetReadOnly( randn, 'seedLength', null );\n\t} else {\n\t\tsetReadOnlyAccessor( randn, 'seed', getSeed );\n\t\tsetReadOnlyAccessor( randn, 'seedLength', getSeedLength );\n\t}\n\t// If we are provided an \"external\" PRNG, we don't support getting or setting PRNG state, as we'd need to check for compatible state value types, etc, entailing considerable complexity.\n\tif ( options && options.prng ) {\n\t\tsetReadWriteAccessor( randn, 'state', constantFunction( null ), noop );\n\t\tsetReadOnly( randn, 'stateLength', null );\n\t\tsetReadOnly( randn, 'byteLength', null );\n\t\tsetReadOnly( randn, 'toJSON', constantFunction( null ) );\n\t} else {\n\t\tsetReadWriteAccessor( randn, 'state', getState, setState );\n\t\tsetReadOnlyAccessor( randn, 'stateLength', getStateLength );\n\t\tsetReadOnlyAccessor( randn, 'byteLength', getStateSize );\n\t\tsetReadOnly( randn, 'toJSON', toJSON );\n\t}\n\tsetReadOnly( randn, 'PRNG', randu );\n\n\treturn randn;\n\n\t/**\n\t* Returns the PRNG seed.\n\t*\n\t* @private\n\t* @returns {PRNGSeedMT19937} seed\n\t*/\n\tfunction getSeed() {\n\t\treturn randi.seed;\n\t}\n\n\t/**\n\t* Returns the PRNG seed length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} seed length\n\t*/\n\tfunction getSeedLength() {\n\t\treturn randi.seedLength;\n\t}\n\n\t/**\n\t* Returns the PRNG state length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state length\n\t*/\n\tfunction getStateLength() {\n\t\treturn randi.stateLength;\n\t}\n\n\t/**\n\t* Returns the PRNG state size (in bytes).\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state size (in bytes)\n\t*/\n\tfunction getStateSize() {\n\t\treturn randi.byteLength;\n\t}\n\n\t/**\n\t* Returns the current PRNG state.\n\t*\n\t* @private\n\t* @returns {PRNGStateMT19937} current state\n\t*/\n\tfunction getState() {\n\t\treturn randi.state;\n\t}\n\n\t/**\n\t* Sets the PRNG state.\n\t*\n\t* @private\n\t* @param {PRNGStateMT19937} s - generator state\n\t* @throws {Error} must provide a valid state\n\t*/\n\tfunction setState( s ) {\n\t\trandi.state = s;\n\t}\n\n\t/**\n\t* Serializes the pseudorandom number generator as a JSON object.\n\t*\n\t* ## Notes\n\t*\n\t* - `JSON.stringify()` implicitly calls this method when stringifying a PRNG.\n\t*\n\t* @private\n\t* @returns {Object} JSON representation\n\t*/\n\tfunction toJSON() {\n\t\tvar out = {};\n\t\tout.type = 'PRNG';\n\t\tout.name = randn.NAME;\n\t\tout.state = typedarray2json( randi.state );\n\t\tout.params = [];\n\t\treturn out;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar abs = require( '@stdlib/math-base-special-abs' );\nvar exp = require( '@stdlib/math-base-special-exp' );\nvar coordsArray = require( './coords_array.js' );\nvar ratioArray = require( './ratio_array.js' );\nvar sampleTail = require( './sample_tail.js' );\n\n\n// VARIABLES //\n\n// Number of blocks:\nvar NUM_BLOCKS = 128;\n\n// Start of right tail (R):\nvar START_RIGHT_TAIL = 3.442619855899;\n\n// `X` holds coordinates, such that each rectangle has same area:\nvar X = coordsArray( NUM_BLOCKS, START_RIGHT_TAIL );\n\n// `R` holds `X[ i+1 ] / X[ i ]`:\nvar R = ratioArray( X );\n\n// 127 => 0x7F => 00000000000000000000000001111111\nvar LAST_7_BITS_MASK = 127|0; // asm type annotation\n\n\n// MAIN //\n\n/**\n* Returns a pseudorandom number generator which implements the improved Ziggurat algorithm for generating normally distributed pseudorandom numbers.\n*\n* @private\n* @param {PRNG} randu - PRNG for generating uniformly distributed numbers\n* @param {PRNG} randi - PRNG for generating uniformly distributed integers\n* @returns {number} pseudorandom number\n*/\nfunction wrap( randu, randi ) {\n\treturn randn;\n\n\t/**\n\t* Generates a normally distributed pseudorandom number.\n\t*\n\t* @private\n\t* @returns {number} pseudorandom number\n\t*\n\t* @example\n\t* var r = randn();\n\t* // returns \n\t*/\n\tfunction randn() {\n\t\tvar f0;\n\t\tvar f1;\n\t\tvar x2;\n\t\tvar x;\n\t\tvar u;\n\t\tvar i;\n\t\tvar j;\n\t\twhile ( true ) {\n\t\t\tu = ( 2.0*randu() ) - 1.0;\n\t\t\ti = randi() & LAST_7_BITS_MASK;\n\n\t\t\t// First try the rectangular boxes...\n\t\t\tif ( abs( u ) < R[ i ] ) {\n\t\t\t\treturn u * X[ i ];\n\t\t\t}\n\t\t\t// If bottom box, sample from the tail...\n\t\t\tif ( i === 0 ) {\n\t\t\t\treturn sampleTail( randu, START_RIGHT_TAIL, u < 0.0 );\n\t\t\t}\n\t\t\t// Is this a sample from the wedges?\n\t\t\tx = u * X[ i ];\n\t\t\tx2 = x * x;\n\t\t\tj = i + 1;\n\t\t\tf0 = exp( -0.5 * ( (X[ i ]*X[ i ]) - x2 ) );\n\t\t\tf1 = exp( -0.5 * ( (X[ j ]*X[ j ]) - x2 ) );\n\t\t\tif ( f1 + (randu()*(f0-f1)) < 1.0 ) {\n\t\t\t\treturn x;\n\t\t\t}\n\t\t}\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = wrap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Normally distributed pseudorandom numbers using the improved Ziggurat method.\n*\n* @module @stdlib/random-base-improved-ziggurat\n*\n* @example\n* var randn = require( '@stdlib/random-base-improved-ziggurat' );\n*\n* var r = randn();\n* // returns \n*\n* @example\n* var factory = require( '@stdlib/random-base-improved-ziggurat' ).factory;\n*\n* var randn = factory({\n* 'seed': 12345\n* });\n*\n* var r = randn();\n* // returns \n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\n/**\n* Generates a standard normally distributed random number.\n*\n* ## Method\n*\n* The basic Ziggurat method works as follows:\n*\n* ```tex\n* x_{C-1}(r) \\left[ f(0) - f\\left( x_{C-1}(r) \\right) \\right] - V(r) = 0\n* ```\n*\n* where\n*\n* ```tex\n* V(r) = r \\; f(r) + \\int_r^\\infty \\; f(x) \\; dx\n* ```\n*\n* and \\\\( r \\\\) denotes the right-most \\\\( x_1 \\\\).\n*\n* - We then use the following rejection algorithm:\n*\n* - Draw a box \\\\( B_i \\\\) at random with probability \\\\( \\tfrac{1}{C} \\\\).\n* - Draw a random number from the box as \\\\( z = U_0 x_i \\\\) for \\\\( i > 0 \\\\) and \\\\( z = U_0 V / f(x_1) \\\\).\n* - If \\\\( z < x_{i+1} \\\\), accept \\\\( z \\\\).\n* - If \\\\( i = 0 \\\\), accept a \\\\( v \\\\) by transforming the tail of the normal distribution to the unit interval and then use rejection technique by Marsaglia, G. (1964) to generate a standard normal variable. Otherwise, if \\\\( i > 0 \\\\) and \\\\( U_1 \\left[ f(x_i) - f(x_{i+1})\\right] < f(z) - f(x_{i+1}) \\\\) accept \\\\( z \\\\).\n* - Go back to the first step.\n*\n* - The improved version by Doornik (2005) changes step four in order to correct a deficiency of the original Ziggurat algorithm. The updated version requires the generation of two random numbers, a uniform variable drawn from \\\\( U(-1,1) \\\\) and the last seven bits of a random integer.\n*\n* ## References\n*\n* - Doornik, Jurgen A. 2005. \"An Improved Ziggurat Method to Generate Normal Random Samples.\" .\n* - Marsaglia, George, and Wai Wan Tsang. 2000. \"The Ziggurat Method for Generating Random Variables.\" _Journal of Statistical Software_ 5 (1): 1–7. doi:[10.18637/jss.v005.i08](http://dx.doi.org/10.18637/jss.v005.i08).\n* - Marsaglia, George. 1964. \"Generating a Variable from the Tail of the Normal Distribution.\" _Technometrics_ 6 (1): 101–2. doi:[10.1080/00401706.1964.10490150](http://dx.doi.org/10.1080/00401706.1964.10490150).\n*\n* @name randn\n* @type {PRNG}\n* @returns {number} pseudorandom number\n*\n* @example\n* var r = randn();\n* // returns \n*/\nvar randn = factory();\n\n\n// EXPORTS //\n\nmodule.exports = randn;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array containing the ratio of each pair of consecutive elements in order: `X[ i+1 ] / X[ i ]`.\n*\n* @private\n* @param {NumberArray} X - input array\n* @returns {NumberArray} ratio array\n*\n* @example\n* var R = ratioArray( [ 1.0, 2.0, 5.0 ] );\n* // returns [ 2.0, 2.5 ]\n*/\nfunction ratioArray( X ) {\n\tvar R;\n\tvar i;\n\n\tR = [];\n\tfor ( i = 0; i < X.length-1; i++ ) {\n\t\tR.push( X[ i+1 ] / X[ i ] );\n\t}\n\treturn R;\n}\n\n\n// EXPORTS //\n\nmodule.exports = ratioArray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ln = require( '@stdlib/math-base-special-ln' );\n\n\n// MAIN //\n\n/**\n* Transforms the tail of the normal distribution to the unit interval and then uses rejection technique to generate standard normal variable.\n*\n* ## References\n*\n* - Marsaglia, George. 1964. \"Generating a Variable from the Tail of the Normal Distribution.\" _Technometrics_ 6 (1): 101–2. doi:[10.1080/00401706.1964.10490150](http://dx.doi.org/10.1080/00401706.1964.10490150).\n*\n* @private\n* @param {PRNG} rand - pseudorandom number generator\n* @param {number} rTail - start value of the right tail\n* @param {boolean} isNegative - boolean indicating which side to evaluate\n* @returns {number} standard normal variable\n*/\nfunction sampleTail( rand, rTail, isNegative ) {\n\tvar x;\n\tvar y;\n\tdo {\n\t\tx = ln( rand() ) / rTail;\n\t\ty = ln( rand() );\n\t} while ( -2.0*y < x*x );\n\treturn ( isNegative ) ? x-rTail : rTail-x;\n}\n\n\n// EXPORTS //\n\nmodule.exports = sampleTail;\n","/* eslint-disable max-lines, max-len */\n\n/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*\n*\n* ## Notice\n*\n* The original C code and copyright notice are from the [source implementation][mt19937]. The implementation has been modified for JavaScript.\n*\n* ```text\n* Copyright (C) 1997 - 2002, Makoto Matsumoto and Takuji Nishimura,\n* All rights reserved.\n*\n* Redistribution and use in source and binary forms, with or without\n* modification, are permitted provided that the following conditions\n* are met:\n*\n* 1. Redistributions of source code must retain the above copyright\n* notice, this list of conditions and the following disclaimer.\n*\n* 2. Redistributions in binary form must reproduce the above copyright\n* notice, this list of conditions and the following disclaimer in the\n* documentation and/or other materials provided with the distribution.\n*\n* 3. The names of its contributors may not be used to endorse or promote\n* products derived from this software without specific prior written\n* permission.\n*\n* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS\n* \"AS IS\" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT\n* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR\n* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR\n* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,\n* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,\n* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR\n* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF\n* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING\n* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS\n* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n* ```\n*\n* [mt19937]: http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/MT2002/CODES/mt19937ar.c\n*/\n\n'use strict';\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar setReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\nvar setReadWriteAccessor = require( '@stdlib/utils-define-nonenumerable-read-write-accessor' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isObject = require( '@stdlib/assert-is-plain-object' );\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isUint32Array = require( '@stdlib/assert-is-uint32array' );\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar isPositiveInteger = require( '@stdlib/assert-is-positive-integer' ).isPrimitive;\nvar FLOAT64_MAX_SAFE_INTEGER = require( '@stdlib/constants-float64-max-safe-integer' );\nvar UINT32_MAX = require( '@stdlib/constants-uint32-max' );\nvar Uint32Array = require( '@stdlib/array-uint32' );\nvar max = require( '@stdlib/math-base-special-max' );\nvar umul = require( '@stdlib/math-base-ops-umul' );\nvar gcopy = require( '@stdlib/blas-base-gcopy' );\nvar typedarray2json = require( '@stdlib/array-to-json' );\nvar format = require( '@stdlib/string-format' );\nvar randuint32 = require( './rand_uint32.js' );\n\n\n// VARIABLES //\n\n// Define the size of the state array (see refs):\nvar N = 624;\n\n// Define a (magic) constant used for indexing into the state array:\nvar M = 397;\n\n// Define the maximum seed: 11111111111111111111111111111111\nvar MAX_SEED = UINT32_MAX >>> 0; // asm type annotation\n\n// For seed arrays, define an initial state (magic) constant: 19650218 => 00000001001010111101011010101010\nvar SEED_ARRAY_INIT_STATE = 19650218 >>> 0; // asm type annotation\n\n// Define a mask for the most significant `w-r` bits, where `w` is the word size (32 bits) and `r` is the separation point of one word (see refs): 2147483648 => 0x80000000 => 10000000000000000000000000000000\nvar UPPER_MASK = 0x80000000 >>> 0; // asm type annotation\n\n// Define a mask for the least significant `r` bits (see refs): 2147483647 => 0x7fffffff => 01111111111111111111111111111111\nvar LOWER_MASK = 0x7fffffff >>> 0; // asm type annotation\n\n// Define a multiplier (see Knuth TAOCP Vol2. 3rd Ed. P.106): 1812433253 => 01101100000001111000100101100101\nvar KNUTH_MULTIPLIER = 1812433253 >>> 0; // asm type annotation\n\n// Define a (magic) multiplier: 1664525 => 00000000000110010110011000001101\nvar MAGIC_MULTIPLIER_1 = 1664525 >>> 0; // asm type annotation\n\n// Define a (magic) multiplier: 1566083941 => 01011101010110001000101101100101\nvar MAGIC_MULTIPLIER_2 = 1566083941 >>> 0; // asm type annotation\n\n// Define a tempering coefficient: 2636928640 => 0x9d2c5680 => 10011101001011000101011010000000\nvar TEMPERING_COEFFICIENT_1 = 0x9d2c5680 >>> 0; // asm type annotation\n\n// Define a tempering coefficient: 4022730752 => 0xefc60000 => 11101111110001100000000000000000\nvar TEMPERING_COEFFICIENT_2 = 0xefc60000 >>> 0; // asm type annotation\n\n// Define a constant vector `a` (see refs): 2567483615 => 0x9908b0df => 10011001000010001011000011011111\nvar MATRIX_A = 0x9908b0df >>> 0; // asm type annotation\n\n// MAG01[x] = x * MATRIX_A; for x = {0,1}\nvar MAG01 = [ 0x0 >>> 0, MATRIX_A >>> 0 ]; // asm type annotation\n\n// Define a normalization constant when generating double-precision floating-point numbers: 2^53 => 9007199254740992\nvar FLOAT64_NORMALIZATION_CONSTANT = 1.0 / ( FLOAT64_MAX_SAFE_INTEGER+1.0 ); // eslint-disable-line id-length\n\n// 2^26: 67108864\nvar TWO_26 = 67108864 >>> 0; // asm type annotation\n\n// 2^32: 2147483648 => 0x80000000 => 10000000000000000000000000000000\nvar TWO_32 = 0x80000000 >>> 0; // asm type annotation\n\n// 1 (as a 32-bit unsigned integer): 1 => 0x1 => 00000000000000000000000000000001\nvar ONE = 0x1 >>> 0; // asm type annotation\n\n// Define the maximum normalized pseudorandom double-precision floating-point number: ( (((2^32-1)>>>5)*2^26)+( (2^32-1)>>>6) ) / 2^53\nvar MAX_NORMALIZED = FLOAT64_MAX_SAFE_INTEGER * FLOAT64_NORMALIZATION_CONSTANT;\n\n// Define the state array schema version:\nvar STATE_ARRAY_VERSION = 1; // NOTE: anytime the state array schema changes, this value should be incremented!!!\n\n// Define the number of sections in the state array:\nvar NUM_STATE_SECTIONS = 3; // state, other, seed\n\n// Define the index offset of the \"state\" section in the state array:\nvar STATE_SECTION_OFFSET = 2; // | version | num_sections | state_length | ...state | other_length | state_index | seed_length | ...seed |\n\n// Define the index offset of the \"other\" section in the state array:\nvar OTHER_SECTION_OFFSET = N + 3; // | version | num_sections | state_length | ...state | other_length | state_index | seed_length | ...seed |\n\n// Define the index offset of the seed section in the state array:\nvar SEED_SECTION_OFFSET = N + 5; // | version | num_sections | state_length | ...state | other_length | state_index | seed_length | ...seed |\n\n// Define the length of the \"fixed\" length portion of the state array:\nvar STATE_FIXED_LENGTH = N + 6; // 1 (version) + 1 (num_sections) + 1 (state_length) + N (state) + 1 (other_length) + 1 (state_index) + 1 (seed_length)\n\n\n// FUNCTIONS //\n\n/**\n* Verifies state array integrity.\n*\n* @private\n* @param {Uint32Array} state - state array\n* @param {boolean} FLG - flag indicating whether the state array was provided as an option (true) or an argument (false)\n* @returns {(Error|null)} an error or `null`\n*/\nfunction verifyState( state, FLG ) {\n\tvar s1;\n\tif ( FLG ) {\n\t\ts1 = 'option';\n\t} else {\n\t\ts1 = 'argument';\n\t}\n\t// The state array must have a minimum length...\n\tif ( state.length < STATE_FIXED_LENGTH+1 ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array has insufficient length.', s1 ) );\n\t}\n\t// The first element of the state array must equal the supported state array schema version...\n\tif ( state[ 0 ] !== STATE_ARRAY_VERSION ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array has an incompatible schema version. Expected: `%s`. Actual: `%s.`', s1, STATE_ARRAY_VERSION, state[ 0 ] ) );\n\t}\n\t// The second element of the state array must contain the number of sections...\n\tif ( state[ 1 ] !== NUM_STATE_SECTIONS ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array has an incompatible number of sections. Expected: `%s`. Actual: `%s`.', s1, NUM_STATE_SECTIONS, state[ 1 ] ) );\n\t}\n\t// The length of the \"state\" section must equal `N`...\n\tif ( state[ STATE_SECTION_OFFSET ] !== N ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array has an incompatible state length. Expected: `%u`. Actual: `%u`.', s1, N, state[ STATE_SECTION_OFFSET ] ) );\n\t}\n\t// The length of the \"other\" section must equal `1`...\n\tif ( state[ OTHER_SECTION_OFFSET ] !== 1 ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array has an incompatible section length. Expected: `%u`. Actual: `%u`.', s1, 1, state[ OTHER_SECTION_OFFSET ] ) );\n\t}\n\t// The length of the \"seed\" section much match the empirical length...\n\tif ( state[ SEED_SECTION_OFFSET ] !== state.length-STATE_FIXED_LENGTH ) {\n\t\treturn new RangeError( format( 'invalid %s. `state` array length is incompatible with seed section length. Expected: `%u`. Actual: `%u`.', s1, state.length-STATE_FIXED_LENGTH, state[ SEED_SECTION_OFFSET ] ) );\n\t}\n\treturn null;\n}\n\n/**\n* Returns an initial PRNG state.\n*\n* @private\n* @param {Uint32Array} state - state array\n* @param {PositiveInteger} N - state size\n* @param {uinteger32} s - seed\n* @returns {Uint32Array} state array\n*/\nfunction createState( state, N, s ) {\n\tvar i;\n\n\t// Set the first element of the state array to the provided seed:\n\tstate[ 0 ] = s >>> 0; // equivalent to `s & 0xffffffffUL` in original C implementation\n\n\t// Initialize the remaining state array elements:\n\tfor ( i = 1; i < N; i++ ) {\n\t\t/*\n\t\t* In the original C implementation (see `init_genrand()`),\n\t\t*\n\t\t* ```c\n\t\t* mt[i] = (KNUTH_MULTIPLIER * (mt[i-1] ^ (mt[i-1] >> 30)) + i)\n\t\t* ```\n\t\t*\n\t\t* In order to replicate this in JavaScript, we must emulate C-like multiplication of unsigned 32-bit integers.\n\t\t*/\n\t\ts = state[ i-1 ]>>>0; // asm type annotation\n\t\ts = ( s^(s>>>30) )>>>0; // asm type annotation\n\t\tstate[ i ] = ( umul( s, KNUTH_MULTIPLIER ) + i )>>>0; // asm type annotation\n\t}\n\treturn state;\n}\n\n/**\n* Initializes a PRNG state array according to a seed array.\n*\n* @private\n* @param {Uint32Array} state - state array\n* @param {NonNegativeInteger} N - state array length\n* @param {Collection} seed - seed array\n* @param {NonNegativeInteger} M - seed array length\n* @returns {Uint32Array} state array\n*/\nfunction initState( state, N, seed, M ) {\n\tvar s;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\ti = 1;\n\tj = 0;\n\tfor ( k = max( N, M ); k > 0; k-- ) {\n\t\t/*\n\t\t* In the original C implementation (see `init_by_array()`),\n\t\t*\n\t\t* ```c\n\t\t* mt[i] = (mt[i]^((mt[i-1]^(mt[i-1]>>30))*1664525UL)) + seed[j] + j;\n\t\t* ```\n\t\t*\n\t\t* In order to replicate this in JavaScript, we must emulate C-like multiplication of unsigned 32-bit integers.\n\t\t*/\n\t\ts = state[ i-1 ]>>>0; // asm type annotation\n\t\ts = ( s^(s>>>30) )>>>0; // asm type annotation\n\t\ts = ( umul( s, MAGIC_MULTIPLIER_1 ) )>>>0; // asm type annotation\n\t\tstate[ i ] = ( ((state[i]>>>0)^s) + seed[j] + j )>>>0; /* non-linear */ // asm type annotation\n\n\t\ti += 1;\n\t\tj += 1;\n\t\tif ( i >= N ) {\n\t\t\tstate[ 0 ] = state[ N-1 ];\n\t\t\ti = 1;\n\t\t}\n\t\tif ( j >= M ) {\n\t\t\tj = 0;\n\t\t}\n\t}\n\tfor ( k = N-1; k > 0; k-- ) {\n\t\t/*\n\t\t* In the original C implementation (see `init_by_array()`),\n\t\t*\n\t\t* ```c\n\t\t* mt[i] = (mt[i]^((mt[i-1]^(mt[i-1]>>30))*1566083941UL)) - i;\n\t\t* ```\n\t\t*\n\t\t* In order to replicate this in JavaScript, we must emulate C-like multiplication of unsigned 32-bit integers.\n\t\t*/\n\t\ts = state[ i-1 ]>>>0; // asm type annotation\n\t\ts = ( s^(s>>>30) )>>>0; // asm type annotation\n\t\ts = ( umul( s, MAGIC_MULTIPLIER_2 ) )>>>0; // asm type annotation\n\t\tstate[ i ] = ( ((state[i]>>>0)^s) - i )>>>0; /* non-linear */ // asm type annotation\n\n\t\ti += 1;\n\t\tif ( i >= N ) {\n\t\t\tstate[ 0 ] = state[ N-1 ];\n\t\t\ti = 1;\n\t\t}\n\t}\n\t// Ensure a non-zero initial state array:\n\tstate[ 0 ] = TWO_32; // MSB (most significant bit) is 1\n\n\treturn state;\n}\n\n/**\n* Updates a PRNG's internal state by generating the next `N` words.\n*\n* @private\n* @param {Uint32Array} state - state array\n* @returns {Uint32Array} state array\n*/\nfunction twist( state ) {\n\tvar w;\n\tvar i;\n\tvar j;\n\tvar k;\n\n\tk = N - M;\n\tfor ( i = 0; i < k; i++ ) {\n\t\tw = ( state[i]&UPPER_MASK ) | ( state[i+1]&LOWER_MASK );\n\t\tstate[ i ] = state[ i+M ] ^ ( w>>>1 ) ^ MAG01[ w&ONE ];\n\t}\n\tj = N - 1;\n\tfor ( ; i < j; i++ ) {\n\t\tw = ( state[i]&UPPER_MASK ) | ( state[i+1]&LOWER_MASK );\n\t\tstate[ i ] = state[ i-k ] ^ ( w>>>1 ) ^ MAG01[ w&ONE ];\n\t}\n\tw = ( state[j]&UPPER_MASK ) | ( state[0]&LOWER_MASK );\n\tstate[ j ] = state[ M-1 ] ^ ( w>>>1 ) ^ MAG01[ w&ONE ];\n\treturn state;\n}\n\n\n// MAIN //\n\n/**\n* Returns a 32-bit Mersenne Twister pseudorandom number generator.\n*\n* ## Notes\n*\n* - In contrast to the original C implementation, array seeds of length `1` are considered integer seeds. This ensures that the seed `[ 1234 ]` generates the same output as the seed `1234`. In the original C implementation, the two seeds would yield different output, which is **not** obvious from a user perspective.\n*\n* @param {Options} [options] - options\n* @param {PRNGSeedMT19937} [options.seed] - pseudorandom number generator seed\n* @param {PRNGStateMT19937} [options.state] - pseudorandom number generator state\n* @param {boolean} [options.copy=true] - boolean indicating whether to copy a provided pseudorandom number generator state\n* @throws {TypeError} options argument must be an object\n* @throws {TypeError} a seed must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integers less than or equal to the maximum unsigned 32-bit integer\n* @throws {RangeError} a numeric seed must be a positive integer less than or equal to the maximum unsigned 32-bit integer\n* @throws {TypeError} state must be a `Uint32Array`\n* @throws {Error} must provide a valid state\n* @throws {TypeError} `copy` option must be a boolean\n* @returns {PRNG} Mersenne Twister PRNG\n*\n* @example\n* var mt19937 = factory();\n*\n* var v = mt19937();\n* // returns \n*\n* @example\n* // Return a seeded Mersenne Twister PRNG:\n* var mt19937 = factory({\n* 'seed': 1234\n* });\n*\n* var v = mt19937();\n* // returns 822569775\n*/\nfunction factory( options ) {\n\tvar STATE;\n\tvar state;\n\tvar opts;\n\tvar seed;\n\tvar slen;\n\tvar err;\n\n\topts = {};\n\tif ( arguments.length ) {\n\t\tif ( !isObject( options ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Options argument must be an object. Value: `%s`.', options ) );\n\t\t}\n\t\tif ( hasOwnProp( options, 'copy' ) ) {\n\t\t\topts.copy = options.copy;\n\t\t\tif ( !isBoolean( options.copy ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a boolean. Option: `%s`.', 'copy', options.copy ) );\n\t\t\t}\n\t\t}\n\t\tif ( hasOwnProp( options, 'state' ) ) {\n\t\t\tstate = options.state;\n\t\t\topts.state = true;\n\t\t\tif ( !isUint32Array( state ) ) {\n\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be a Uint32Array. Option: `%s`.', 'state', state ) );\n\t\t\t}\n\t\t\terr = verifyState( state, true );\n\t\t\tif ( err ) {\n\t\t\t\tthrow err;\n\t\t\t}\n\t\t\tif ( opts.copy === false ) {\n\t\t\t\tSTATE = state;\n\t\t\t} else {\n\t\t\t\tSTATE = new Uint32Array( state.length );\n\t\t\t\tgcopy( state.length, state, 1, STATE, 1 );\n\t\t\t}\n\t\t\t// Create a state \"view\":\n\t\t\tstate = new Uint32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), N );\n\n\t\t\t// Create a seed \"view\":\n\t\t\tseed = new Uint32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), state[ SEED_SECTION_OFFSET ] );\n\t\t}\n\t\t// If provided a PRNG state, we ignore the `seed` option...\n\t\tif ( seed === void 0 ) {\n\t\t\tif ( hasOwnProp( options, 'seed' ) ) {\n\t\t\t\tseed = options.seed;\n\t\t\t\topts.seed = true;\n\t\t\t\tif ( isPositiveInteger( seed ) ) {\n\t\t\t\t\tif ( seed > MAX_SEED ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid option. `%s` option must be a positive integer less than or equal to the maximum unsigned 32-bit integer. Option: `%u`.', 'seed', seed ) );\n\t\t\t\t\t}\n\t\t\t\t\tseed >>>= 0; // asm type annotation\n\t\t\t\t} else if ( isCollection( seed ) === false || seed.length < 1 ) {\n\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.', 'seed', seed ) );\n\t\t\t\t} else if ( seed.length === 1 ) {\n\t\t\t\t\tseed = seed[ 0 ];\n\t\t\t\t\tif ( !isPositiveInteger( seed ) ) {\n\t\t\t\t\t\tthrow new TypeError( format( 'invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.', 'seed', seed ) );\n\t\t\t\t\t}\n\t\t\t\t\tif ( seed > MAX_SEED ) {\n\t\t\t\t\t\tthrow new RangeError( format( 'invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%u`.', 'seed', seed ) );\n\t\t\t\t\t}\n\t\t\t\t\tseed >>>= 0; // asm type annotation\n\t\t\t\t} else {\n\t\t\t\t\tslen = seed.length;\n\t\t\t\t\tSTATE = new Uint32Array( STATE_FIXED_LENGTH+slen );\n\n\t\t\t\t\t// Initialize sections:\n\t\t\t\t\tSTATE[ 0 ] = STATE_ARRAY_VERSION;\n\t\t\t\t\tSTATE[ 1 ] = NUM_STATE_SECTIONS;\n\t\t\t\t\tSTATE[ STATE_SECTION_OFFSET ] = N;\n\t\t\t\t\tSTATE[ OTHER_SECTION_OFFSET ] = 1;\n\t\t\t\t\tSTATE[ OTHER_SECTION_OFFSET+1 ] = N; // state index\n\t\t\t\t\tSTATE[ SEED_SECTION_OFFSET ] = slen;\n\n\t\t\t\t\t// Copy the provided seed array to prevent external mutation, as mutation would lead to an inability to reproduce PRNG values according to the PRNG's stated seed:\n\t\t\t\t\tgcopy.ndarray( slen, seed, 1, 0, STATE, 1, SEED_SECTION_OFFSET+1 );\n\n\t\t\t\t\t// Create a state \"view\":\n\t\t\t\t\tstate = new Uint32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), N );\n\n\t\t\t\t\t// Create a seed \"view\":\n\t\t\t\t\tseed = new Uint32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), slen );\n\n\t\t\t\t\t// Initialize the internal PRNG state:\n\t\t\t\t\tstate = createState( state, N, SEED_ARRAY_INIT_STATE );\n\t\t\t\t\tstate = initState( state, N, seed, slen );\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tseed = randuint32() >>> 0; // asm type annotation\n\t\t\t}\n\t\t}\n\t} else {\n\t\tseed = randuint32() >>> 0; // asm type annotation\n\t}\n\tif ( state === void 0 ) {\n\t\tSTATE = new Uint32Array( STATE_FIXED_LENGTH+1 );\n\n\t\t// Initialize sections:\n\t\tSTATE[ 0 ] = STATE_ARRAY_VERSION;\n\t\tSTATE[ 1 ] = NUM_STATE_SECTIONS;\n\t\tSTATE[ STATE_SECTION_OFFSET ] = N;\n\t\tSTATE[ OTHER_SECTION_OFFSET ] = 1;\n\t\tSTATE[ OTHER_SECTION_OFFSET+1 ] = N; // state index\n\t\tSTATE[ SEED_SECTION_OFFSET ] = 1;\n\t\tSTATE[ SEED_SECTION_OFFSET+1 ] = seed;\n\n\t\t// Create a state \"view\":\n\t\tstate = new Uint32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), N );\n\n\t\t// Create a seed \"view\":\n\t\tseed = new Uint32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), 1 );\n\n\t\t// Initialize the internal PRNG state:\n\t\tstate = createState( state, N, seed );\n\t}\n\t// Note: property order matters in order to maintain consistency of PRNG \"shape\" (hidden classes).\n\tsetReadOnly( mt19937, 'NAME', 'mt19937' );\n\tsetReadOnlyAccessor( mt19937, 'seed', getSeed );\n\tsetReadOnlyAccessor( mt19937, 'seedLength', getSeedLength );\n\tsetReadWriteAccessor( mt19937, 'state', getState, setState );\n\tsetReadOnlyAccessor( mt19937, 'stateLength', getStateLength );\n\tsetReadOnlyAccessor( mt19937, 'byteLength', getStateSize );\n\tsetReadOnly( mt19937, 'toJSON', toJSON );\n\tsetReadOnly( mt19937, 'MIN', 0 );\n\tsetReadOnly( mt19937, 'MAX', UINT32_MAX );\n\tsetReadOnly( mt19937, 'normalized', normalized );\n\n\tsetReadOnly( normalized, 'NAME', mt19937.NAME );\n\tsetReadOnlyAccessor( normalized, 'seed', getSeed );\n\tsetReadOnlyAccessor( normalized, 'seedLength', getSeedLength );\n\tsetReadWriteAccessor( normalized, 'state', getState, setState );\n\tsetReadOnlyAccessor( normalized, 'stateLength', getStateLength );\n\tsetReadOnlyAccessor( normalized, 'byteLength', getStateSize );\n\tsetReadOnly( normalized, 'toJSON', toJSON );\n\tsetReadOnly( normalized, 'MIN', 0.0 );\n\tsetReadOnly( normalized, 'MAX', MAX_NORMALIZED );\n\n\treturn mt19937;\n\n\t/**\n\t* Returns the PRNG seed.\n\t*\n\t* @private\n\t* @returns {PRNGSeedMT19937} seed\n\t*/\n\tfunction getSeed() {\n\t\tvar len = STATE[ SEED_SECTION_OFFSET ];\n\t\treturn gcopy( len, seed, 1, new Uint32Array( len ), 1 );\n\t}\n\n\t/**\n\t* Returns the PRNG seed length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} seed length\n\t*/\n\tfunction getSeedLength() {\n\t\treturn STATE[ SEED_SECTION_OFFSET ];\n\t}\n\n\t/**\n\t* Returns the PRNG state length.\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state length\n\t*/\n\tfunction getStateLength() {\n\t\treturn STATE.length;\n\t}\n\n\t/**\n\t* Returns the PRNG state size (in bytes).\n\t*\n\t* @private\n\t* @returns {PositiveInteger} state size (in bytes)\n\t*/\n\tfunction getStateSize() {\n\t\treturn STATE.byteLength;\n\t}\n\n\t/**\n\t* Returns the current PRNG state.\n\t*\n\t* ## Notes\n\t*\n\t* - The PRNG state array is comprised of a preamble followed by `3` sections:\n\t*\n\t* 0. preamble (version + number of sections)\n\t* 1. internal PRNG state\n\t* 2. auxiliary state information\n\t* 3. PRNG seed\n\t*\n\t* - The first element of the PRNG state array preamble is the state array schema version.\n\t*\n\t* - The second element of the PRNG state array preamble is the number of state array sections (i.e., `3`).\n\t*\n\t* - The first element of each section following the preamble specifies the section length. The remaining section elements comprise the section contents.\n\t*\n\t* @private\n\t* @returns {PRNGStateMT19937} current state\n\t*/\n\tfunction getState() {\n\t\tvar len = STATE.length;\n\t\treturn gcopy( len, STATE, 1, new Uint32Array( len ), 1 );\n\t}\n\n\t/**\n\t* Sets the PRNG state.\n\t*\n\t* ## Notes\n\t*\n\t* - If PRNG state is \"shared\" (meaning a state array was provided during PRNG creation and **not** copied) and one sets the generator state to a state array having a different length, the PRNG does **not** update the existing shared state and, instead, points to the newly provided state array. In order to synchronize PRNG output according to the new shared state array, the state array for **each** relevant PRNG must be **explicitly** set.\n\t* - If PRNG state is \"shared\" and one sets the generator state to a state array of the same length, the PRNG state is updated (along with the state of all other PRNGs sharing the PRNG's state array).\n\t*\n\t* @private\n\t* @param {PRNGStateMT19937} s - generator state\n\t* @throws {TypeError} must provide a `Uint32Array`\n\t* @throws {Error} must provide a valid state\n\t*/\n\tfunction setState( s ) {\n\t\tvar err;\n\t\tif ( !isUint32Array( s ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a Uint32Array. Value: `%s`.', s ) );\n\t\t}\n\t\terr = verifyState( s, false );\n\t\tif ( err ) {\n\t\t\tthrow err;\n\t\t}\n\t\tif ( opts.copy === false ) {\n\t\t\tif ( opts.state && s.length === STATE.length ) {\n\t\t\t\tgcopy( s.length, s, 1, STATE, 1 ); // update current shared state\n\t\t\t} else {\n\t\t\t\tSTATE = s; // point to new shared state\n\t\t\t\topts.state = true; // setting this flag allows updating a shared state even if a state array was not provided at PRNG creation\n\t\t\t}\n\t\t} else {\n\t\t\t// Check if we can reuse allocated memory...\n\t\t\tif ( s.length !== STATE.length ) {\n\t\t\t\tSTATE = new Uint32Array( s.length ); // reallocate\n\t\t\t}\n\t\t\tgcopy( s.length, s, 1, STATE, 1 );\n\t\t}\n\t\t// Create a new state \"view\":\n\t\tstate = new Uint32Array( STATE.buffer, STATE.byteOffset+((STATE_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), N );\n\n\t\t// Create a new seed \"view\":\n\t\tseed = new Uint32Array( STATE.buffer, STATE.byteOffset+((SEED_SECTION_OFFSET+1)*STATE.BYTES_PER_ELEMENT), STATE[ SEED_SECTION_OFFSET ] );\n\t}\n\n\t/**\n\t* Serializes the pseudorandom number generator as a JSON object.\n\t*\n\t* ## Notes\n\t*\n\t* - `JSON.stringify()` implicitly calls this method when stringifying a PRNG.\n\t*\n\t* @private\n\t* @returns {Object} JSON representation\n\t*/\n\tfunction toJSON() {\n\t\tvar out = {};\n\t\tout.type = 'PRNG';\n\t\tout.name = mt19937.NAME;\n\t\tout.state = typedarray2json( STATE );\n\t\tout.params = [];\n\t\treturn out;\n\t}\n\n\t/**\n\t* Generates a pseudorandom integer on the interval \\\\( [0, 2^{32}) \\\\).\n\t*\n\t* @private\n\t* @returns {uinteger32} pseudorandom integer\n\t*\n\t* @example\n\t* var r = mt19937();\n\t* // returns \n\t*/\n\tfunction mt19937() {\n\t\tvar r;\n\t\tvar i;\n\n\t\t// Retrieve the current state index:\n\t\ti = STATE[ OTHER_SECTION_OFFSET+1 ];\n\n\t\t// Determine whether we need to update the PRNG state:\n\t\tif ( i >= N ) {\n\t\t\tstate = twist( state );\n\t\t\ti = 0;\n\t\t}\n\t\t// Get the next word of \"raw\"/untempered state:\n\t\tr = state[ i ];\n\n\t\t// Update the state index:\n\t\tSTATE[ OTHER_SECTION_OFFSET+1 ] = i + 1;\n\n\t\t// Tempering transform to compensate for the reduced dimensionality of equidistribution:\n\t\tr ^= r >>> 11;\n\t\tr ^= ( r << 7 ) & TEMPERING_COEFFICIENT_1;\n\t\tr ^= ( r << 15 ) & TEMPERING_COEFFICIENT_2;\n\t\tr ^= r >>> 18;\n\n\t\treturn r >>> 0;\n\t}\n\n\t/**\n\t* Generates a pseudorandom number on the interval \\\\( [0, 1) \\\\).\n\t*\n\t* ## Notes\n\t*\n\t* - The original C implementation credits Isaku Wada for this algorithm (2002/01/09).\n\t*\n\t* @private\n\t* @returns {number} pseudorandom number\n\t*\n\t* @example\n\t* var r = normalized();\n\t* // returns \n\t*/\n\tfunction normalized() {\n\t\tvar x = mt19937() >>> 5;\n\t\tvar y = mt19937() >>> 6;\n\t\treturn ( (x*TWO_26)+y ) * FLOAT64_NORMALIZATION_CONSTANT;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = factory;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* A 32-bit Mersenne Twister pseudorandom number generator.\n*\n* @module @stdlib/random-base-mt19937\n*\n* @example\n* var mt19937 = require( '@stdlib/random-base-mt19937' );\n*\n* var v = mt19937();\n* // returns \n*\n* @example\n* var factory = require( '@stdlib/random-base-mt19937' ).factory;\n*\n* var mt19937 = factory({\n* 'seed': 1234\n* });\n*\n* var v = mt19937();\n* // returns 822569775\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar factory = require( './factory.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'factory', factory );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar factory = require( './factory.js' );\nvar randuint32 = require( './rand_uint32.js' );\n\n\n// MAIN //\n\n/**\n* Generates a pseudorandom integer on the interval \\\\( [0, 2^{32}) \\\\).\n*\n* ## Method\n*\n* - When generating normalized double-precision floating-point numbers, we first generate two pseudorandom integers \\\\( x \\\\) and \\\\( y \\\\) on the interval \\\\( [0, 2^{32}) \\\\) for a combined \\\\( 64 \\\\) random bits.\n*\n* - We would like \\\\( 53 \\\\) random bits to generate a 53-bit precision integer and, thus, want to discard \\\\( 11 \\\\) of the generated bits.\n*\n* - We do so by discarding \\\\( 5 \\\\) bits from \\\\( x \\\\) and \\\\( 6 \\\\) bits from \\\\( y \\\\).\n*\n* - Accordingly, \\\\( x \\\\) contains \\\\( 27 \\\\) random bits, which are subsequently shifted left \\\\( 26 \\\\) bits (multiplied by \\\\( 2^{26} \\\\), and \\\\( y \\\\) contains \\\\( 26 \\\\) random bits to fill in the lower \\\\( 26 \\\\) bits. When summed, they combine to comprise \\\\( 53 \\\\) random bits of a double-precision floating-point integer.\n*\n* - As an example, suppose, for the sake of argument, the 32-bit PRNG generates the maximum unsigned 32-bit integer \\\\( 2^{32}-1 \\\\) twice in a row. Then,\n*\n* ```javascript\n* x = 4294967295 >>> 5; // 00000111111111111111111111111111\n* y = 4294967295 >>> 6; // 00000011111111111111111111111111\n* ```\n*\n* Multiplying \\\\( x \\\\) by \\\\( 2^{26} \\\\) returns \\\\( 9007199187632128 \\\\), which, in binary, is\n*\n* ```binarystring\n* 0 10000110011 11111111111111111111 11111100000000000000000000000000\n* ```\n*\n* Adding \\\\( y \\\\) yields \\\\( 9007199254740991 \\\\) (the maximum \"safe\" double-precision floating-point integer value), which, in binary, is\n*\n* ```binarystring\n* 0 10000110011 11111111111111111111 11111111111111111111111111111111\n* ```\n*\n* - Similarly, suppose the 32-bit PRNG generates the following values\n*\n* ```javascript\n* x = 1 >>> 5; // 0 => 00000000000000000000000000000000\n* y = 64 >>> 6; // 1 => 00000000000000000000000000000001\n* ```\n*\n* Multiplying \\\\( x \\\\) by \\\\( 2^{26} \\\\) returns \\\\( 0 \\\\), which, in binary, is\n*\n* ```binarystring\n* 0 00000000000 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* Adding \\\\( y \\\\) yields \\\\( 1 \\\\), which, in binary, is\n*\n* ```binarystring\n* 0 01111111111 00000000000000000000 00000000000000000000000000000000\n* ```\n*\n* - As different combinations of \\\\( x \\\\) and \\\\( y \\\\) are generated, different combinations of double-precision floating-point exponent and significand bits will be toggled, thus generating pseudorandom double-precision floating-point numbers.\n*\n* ## References\n*\n* - Matsumoto, Makoto, and Takuji Nishimura. 1998. \"Mersenne Twister: A 623-dimensionally Equidistributed Uniform Pseudo-random Number Generator.\" _ACM Transactions on Modeling and Computer Simulation_ 8 (1). New York, NY, USA: ACM: 3–30. doi:[10.1145/272991.272995][@matsumoto:1998a].\n* - Harase, Shin. 2017. \"Conversion of Mersenne Twister to double-precision floating-point numbers.\" _ArXiv_ abs/1708.06018 (September). .\n*\n* [@matsumoto:1998a]: https://doi.org/10.1145/272991.272995\n*\n* @function mt19937\n* @type {PRNG}\n* @returns {PositiveInteger} pseudorandom integer\n*\n* @example\n* var v = mt19937();\n* // returns \n*/\nvar mt19937 = factory({\n\t'seed': randuint32()\n});\n\n\n// EXPORTS //\n\nmodule.exports = mt19937;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar UINT32_MAX = require( '@stdlib/constants-uint32-max' );\nvar floor = require( '@stdlib/math-base-special-floor' );\n\n\n// VARIABLES //\n\nvar MAX = UINT32_MAX - 1;\n\n\n// MAIN //\n\n/**\n* Returns a pseudorandom integer on the interval \\\\( [1, 2^{32}-1) \\\\).\n*\n* @private\n* @returns {PositiveInteger} pseudorandom integer\n*\n* @example\n* var v = randuint32();\n* // returns \n*/\nfunction randuint32() {\n\tvar v = floor( 1.0 + (MAX*Math.random()) ); // eslint-disable-line stdlib/no-builtin-math\n\treturn v >>> 0; // asm type annotation\n}\n\n\n// EXPORTS //\n\nmodule.exports = randuint32;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @module @stdlib/regexp-function-name\n*\n* @example\n* var reFunctionName = require( '@stdlib/regexp-function-name' );\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\n\n// MODULES //\n\nvar setReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\nvar main = require( './main.js' );\nvar REGEXP = require( './regexp.js' );\n\n\n// MAIN //\n\nsetReadOnly( main, 'REGEXP', REGEXP );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns a regular expression to capture everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* @returns {RegExp} regular expression\n*\n* @example\n* var RE_FUNCTION_NAME = reFunctionName();\n*\n* function fname( fcn ) {\n* return RE_FUNCTION_NAME.exec( fcn.toString() )[ 1 ];\n* }\n*\n* var fn = fname( Math.sqrt );\n* // returns 'sqrt'\n*\n* fn = fname( Int8Array );\n* // returns 'Int8Array'\n*\n* fn = fname( Object.prototype.toString );\n* // returns 'toString'\n*\n* fn = fname( function(){} );\n* // returns ''\n*/\nfunction reFunctionName() {\n\treturn /^\\s*function\\s*([^(]*)/i;\n}\n\n\n// EXPORTS //\n\nmodule.exports = reFunctionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar reFunctionName = require( './main.js' );\n\n\n// MAIN //\n\n/**\n* Captures everything that is not a space immediately after the `function` keyword and before the first left parenthesis.\n*\n* Regular expression: `/^\\s*function\\s*([^(]*)/i`\n*\n* - `/^\\s*`\n* - Match zero or more spaces at beginning\n*\n* - `function`\n* - Match the word `function`\n*\n* - `\\s*`\n* - Match zero or more spaces after the word `function`\n*\n* - `()`\n* - Capture\n*\n* - `[^(]*`\n* - Match anything except a left parenthesis `(` zero or more times\n*\n* - `/i`\n* - ignore case\n*\n* @constant\n* @type {RegExp}\n* @default /^\\s*function\\s*([^(]*)/i\n*/\nvar RE_FUNCTION_NAME = reFunctionName();\n\n\n// EXPORTS //\n\nmodule.exports = RE_FUNCTION_NAME;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reinterpret a `Complex128Array` as a `Float64Array`.\n*\n* @module @stdlib/strided-base-reinterpret-complex128\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n* var reinterpret = require( '@stdlib/strided-base-reinterpret-complex128' );\n*\n* var x = new Complex128Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float64Array = require( '@stdlib/array-float64' );\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex128Array` as a `Float64Array`.\n*\n* @param {Complex128Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float64Array} `Float64Array` view\n*\n* @example\n* var Complex128Array = require( '@stdlib/array-complex128' );\n*\n* var x = new Complex128Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float64Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Reinterpret a `Complex64Array` as a `Float32Array`.\n*\n* @module @stdlib/strided-base-reinterpret-complex64\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n* var reinterpret = require( '@stdlib/strided-base-reinterpret-complex64' );\n*\n* var x = new Complex64Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Float32Array = require( '@stdlib/array-float32' );\n\n\n// MAIN //\n\n/**\n* Reinterprets a `Complex64Array` as a `Float32Array`.\n*\n* @param {Complex64Array} x - input array\n* @param {NonNegativeInteger} offset - starting index\n* @returns {Float32Array} `Float32Array` view\n*\n* @example\n* var Complex64Array = require( '@stdlib/array-complex64' );\n*\n* var x = new Complex64Array( 10 );\n*\n* var out = reinterpret( x, 0 );\n* // returns \n*\n* var bool = ( out.buffer === x.buffer );\n* // returns true\n*/\nfunction reinterpret( x, offset ) {\n\treturn new Float32Array( x.buffer, x.byteOffset+(x.BYTES_PER_ELEMENT*offset), 2*(x.length-offset) ); // eslint-disable-line max-len\n}\n\n\n// EXPORTS //\n\nmodule.exports = reinterpret;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( './is_number.js' );\n\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar abs = Math.abs; // eslint-disable-line stdlib/no-builtin-math\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\nvar replace = String.prototype.replace;\n\n\n// VARIABLES //\n\nvar RE_EXP_POS_DIGITS = /e\\+(\\d)$/;\nvar RE_EXP_NEG_DIGITS = /e-(\\d)$/;\nvar RE_ONLY_DIGITS = /^(\\d+)$/;\nvar RE_DIGITS_BEFORE_EXP = /^(\\d+)e/;\nvar RE_TRAILING_PERIOD_ZERO = /\\.0$/;\nvar RE_PERIOD_ZERO_EXP = /\\.0*e/;\nvar RE_ZERO_BEFORE_EXP = /(\\..*[^0])0*e/;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as a floating-point number.\n*\n* @private\n* @param {Object} token - token object\n* @throws {Error} must provide a valid floating-point number\n* @returns {string} formatted token argument\n*/\nfunction formatDouble( token ) {\n\tvar digits;\n\tvar out;\n\tvar f = parseFloat( token.arg );\n\tif ( !isFinite( f ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\tif ( !isNumber( token.arg ) ) {\n\t\t\tthrow new Error( 'invalid floating-point number. Value: ' + out );\n\t\t}\n\t\t// Case: NaN, Infinity, or -Infinity\n\t\tf = token.arg;\n\t}\n\tswitch ( token.specifier ) {\n\tcase 'e':\n\tcase 'E':\n\t\tout = f.toExponential( token.precision );\n\t\tbreak;\n\tcase 'f':\n\tcase 'F':\n\t\tout = f.toFixed( token.precision );\n\t\tbreak;\n\tcase 'g':\n\tcase 'G':\n\t\tif ( abs( f ) < 0.0001 ) {\n\t\t\tdigits = token.precision;\n\t\t\tif ( digits > 0 ) {\n\t\t\t\tdigits -= 1;\n\t\t\t}\n\t\t\tout = f.toExponential( digits );\n\t\t} else {\n\t\t\tout = f.toPrecision( token.precision );\n\t\t}\n\t\tif ( !token.alternate ) {\n\t\t\tout = replace.call( out, RE_ZERO_BEFORE_EXP, '$1e' );\n\t\t\tout = replace.call( out, RE_PERIOD_ZERO_EXP, 'e');\n\t\t\tout = replace.call( out, RE_TRAILING_PERIOD_ZERO, '' );\n\t\t}\n\t\tbreak;\n\tdefault:\n\t\tthrow new Error( 'invalid double notation. Value: ' + token.specifier );\n\t}\n\tout = replace.call( out, RE_EXP_POS_DIGITS, 'e+0$1' );\n\tout = replace.call( out, RE_EXP_NEG_DIGITS, 'e-0$1' );\n\tif ( token.alternate ) {\n\t\tout = replace.call( out, RE_ONLY_DIGITS, '$1.' );\n\t\tout = replace.call( out, RE_DIGITS_BEFORE_EXP, '$1.e' );\n\t}\n\tif ( f >= 0 && token.sign ) {\n\t\tout = token.sign + out;\n\t}\n\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\tuppercase.call( out ) :\n\t\tlowercase.call( out );\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = formatDouble;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isNumber = require( './is_number.js' );\nvar zeroPad = require( './zero_pad.js' );\n\n// NOTE: for the following, we explicitly avoid using stdlib packages in this particular package in order to avoid circular dependencies.\nvar lowercase = String.prototype.toLowerCase;\nvar uppercase = String.prototype.toUpperCase;\n\n\n// MAIN //\n\n/**\n* Formats a token object argument as an integer.\n*\n* @private\n* @param {Object} token - token object\n* @throws {Error} must provide a valid integer\n* @returns {string} formatted token argument\n*/\nfunction formatInteger( token ) {\n\tvar base;\n\tvar out;\n\tvar i;\n\n\tswitch ( token.specifier ) {\n\tcase 'b':\n\t\t// Case: %b (binary)\n\t\tbase = 2;\n\t\tbreak;\n\tcase 'o':\n\t\t// Case: %o (octal)\n\t\tbase = 8;\n\t\tbreak;\n\tcase 'x':\n\tcase 'X':\n\t\t// Case: %x, %X (hexadecimal)\n\t\tbase = 16;\n\t\tbreak;\n\tcase 'd':\n\tcase 'i':\n\tcase 'u':\n\tdefault:\n\t\t// Case: %d, %i, %u (decimal)\n\t\tbase = 10;\n\t\tbreak;\n\t}\n\tout = token.arg;\n\ti = parseInt( out, 10 );\n\tif ( !isFinite( i ) ) { // NOTE: We use the global `isFinite` function here instead of `@stdlib/math/base/assert/is-finite` in order to avoid circular dependencies.\n\t\tif ( !isNumber( out ) ) {\n\t\t\tthrow new Error( 'invalid integer. Value: ' + out );\n\t\t}\n\t\ti = 0;\n\t}\n\tif ( i < 0 && ( token.specifier === 'u' || base !== 10 ) ) {\n\t\ti = 0xffffffff + i + 1;\n\t}\n\tif ( i < 0 ) {\n\t\tout = ( -i ).toString( base );\n\t\tif ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tout = '-' + out;\n\t} else {\n\t\tout = i.toString( base );\n\t\tif ( !i && !token.precision ) {\n\t\t\tout = '';\n\t\t} else if ( token.precision ) {\n\t\t\tout = zeroPad( out, token.precision, token.padRight );\n\t\t}\n\t\tif ( token.sign ) {\n\t\t\tout = token.sign + out;\n\t\t}\n\t}\n\tif ( base === 16 ) {\n\t\tif ( token.alternate ) {\n\t\t\tout = '0x' + out;\n\t\t}\n\t\tout = ( token.specifier === uppercase.call( token.specifier ) ) ?\n\t\t\tuppercase.call( out ) :\n\t\t\tlowercase.call( out );\n\t}\n\tif ( base === 8 ) {\n\t\tif ( token.alternate && out.charAt( 0 ) !== '0' ) {\n\t\t\tout = '0' + out;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = formatInteger;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Generate string from a token array by interpolating values.\n*\n* @module @stdlib/string-base-format-interpolate\n*\n* @example\n* var formatInterpolate = require( '@stdlib/string-base-format-interpolate' );\n*\n* var tokens = ['Hello ', { 'specifier': 's' }, '!' ];\n* var out = formatInterpolate( tokens, 'World' );\n* // returns 'Hello World!'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a number primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a number primitive\n*\n* @example\n* var bool = isNumber( 3.14 );\n* // returns true\n*\n* @example\n* var bool = isNumber( NaN );\n* // returns true\n*\n* @example\n* var bool = isNumber( new Number( 3.14 ) );\n* // returns false\n*/\nfunction isNumber( value ) {\n\treturn ( typeof value === 'number' ); // NOTE: we inline the `isNumber.isPrimitive` function from `@stdlib/assert/is-number` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nmodule.exports = isNumber;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nmodule.exports = isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar formatInteger = require( './format_integer.js' );\nvar isString = require( './is_string.js' );\nvar formatDouble = require( './format_double.js' );\nvar spacePad = require( './space_pad.js' );\nvar zeroPad = require( './zero_pad.js' );\n\n\n// VARIABLES //\n\nvar fromCharCode = String.fromCharCode;\nvar isnan = isNaN; // NOTE: We use the global `isNaN` function here instead of `@stdlib/math/base/assert/is-nan` to avoid circular dependencies.\nvar isArray = Array.isArray; // NOTE: We use the global `Array.isArray` function here instead of `@stdlib/assert/is-array` to avoid circular dependencies.\n\n\n// FUNCTIONS //\n\n/**\n* Initializes token object with properties of supplied format identifier object or default values if not present.\n*\n* @private\n* @param {Object} token - format identifier object\n* @returns {Object} token object\n*/\nfunction initialize( token ) {\n\tvar out = {};\n\tout.specifier = token.specifier;\n\tout.precision = ( token.precision === void 0 ) ? 1 : token.precision;\n\tout.width = token.width;\n\tout.flags = token.flags || '';\n\tout.mapping = token.mapping;\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Generates string from a token array by interpolating values.\n*\n* @param {Array} tokens - string parts and format identifier objects\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be an array\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var tokens = [ 'beep ', { 'specifier': 's' } ];\n* var out = formatInterpolate( tokens, 'boop' );\n* // returns 'beep boop'\n*/\nfunction formatInterpolate( tokens ) {\n\tvar hasPeriod;\n\tvar flags;\n\tvar token;\n\tvar flag;\n\tvar num;\n\tvar out;\n\tvar pos;\n\tvar i;\n\tvar j;\n\n\tif ( !isArray( tokens ) ) {\n\t\tthrow new TypeError( 'invalid argument. First argument must be an array. Value: `' + tokens + '`.' );\n\t}\n\tout = '';\n\tpos = 1;\n\tfor ( i = 0; i < tokens.length; i++ ) {\n\t\ttoken = tokens[ i ];\n\t\tif ( isString( token ) ) {\n\t\t\tout += token;\n\t\t} else {\n\t\t\thasPeriod = token.precision !== void 0;\n\t\t\ttoken = initialize( token );\n\t\t\tif ( !token.specifier ) {\n\t\t\t\tthrow new TypeError( 'invalid argument. Token is missing `specifier` property. Index: `'+ i +'`. Value: `' + token + '`.' );\n\t\t\t}\n\t\t\tif ( token.mapping ) {\n\t\t\t\tpos = token.mapping;\n\t\t\t}\n\t\t\tflags = token.flags;\n\t\t\tfor ( j = 0; j < flags.length; j++ ) {\n\t\t\t\tflag = flags.charAt( j );\n\t\t\t\tswitch ( flag ) {\n\t\t\t\tcase ' ':\n\t\t\t\t\ttoken.sign = ' ';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '+':\n\t\t\t\t\ttoken.sign = '+';\n\t\t\t\t\tbreak;\n\t\t\t\tcase '-':\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t\tbreak;\n\t\t\t\tcase '0':\n\t\t\t\t\ttoken.padZeros = flags.indexOf( '-' ) < 0; // NOTE: We use built-in `Array.prototype.indexOf` here instead of `@stdlib/assert/contains` in order to avoid circular dependencies.\n\t\t\t\t\tbreak;\n\t\t\t\tcase '#':\n\t\t\t\t\ttoken.alternate = true;\n\t\t\t\t\tbreak;\n\t\t\t\tdefault:\n\t\t\t\t\tthrow new Error( 'invalid flag: ' + flag );\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( token.width === '*' ) {\n\t\t\t\ttoken.width = parseInt( arguments[ pos ], 10 );\n\t\t\t\tpos += 1;\n\t\t\t\tif ( isnan( token.width ) ) {\n\t\t\t\t\tthrow new TypeError( 'the argument for * width at position ' + pos + ' is not a number. Value: `' + token.width + '`.' );\n\t\t\t\t}\n\t\t\t\tif ( token.width < 0 ) {\n\t\t\t\t\ttoken.padRight = true;\n\t\t\t\t\ttoken.width = -token.width;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif ( hasPeriod ) {\n\t\t\t\tif ( token.precision === '*' ) {\n\t\t\t\t\ttoken.precision = parseInt( arguments[ pos ], 10 );\n\t\t\t\t\tpos += 1;\n\t\t\t\t\tif ( isnan( token.precision ) ) {\n\t\t\t\t\t\tthrow new TypeError( 'the argument for * precision at position ' + pos + ' is not a number. Value: `' + token.precision + '`.' );\n\t\t\t\t\t}\n\t\t\t\t\tif ( token.precision < 0 ) {\n\t\t\t\t\t\ttoken.precision = 1;\n\t\t\t\t\t\thasPeriod = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ttoken.arg = arguments[ pos ];\n\t\t\tswitch ( token.specifier ) {\n\t\t\tcase 'b':\n\t\t\tcase 'o':\n\t\t\tcase 'x':\n\t\t\tcase 'X':\n\t\t\tcase 'd':\n\t\t\tcase 'i':\n\t\t\tcase 'u':\n\t\t\t\t// Case: %b (binary), %o (octal), %x, %X (hexadecimal), %d, %i (decimal), %u (unsigned decimal)\n\t\t\t\tif ( hasPeriod ) {\n\t\t\t\t\ttoken.padZeros = false;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatInteger( token );\n\t\t\t\tbreak;\n\t\t\tcase 's':\n\t\t\t\t// Case: %s (string)\n\t\t\t\ttoken.maxWidth = ( hasPeriod ) ? token.precision : -1;\n\t\t\t\tbreak;\n\t\t\tcase 'c':\n\t\t\t\t// Case: %c (character)\n\t\t\t\tif ( !isnan( token.arg ) ) {\n\t\t\t\t\tnum = parseInt( token.arg, 10 );\n\t\t\t\t\tif ( num < 0 || num > 127 ) {\n\t\t\t\t\t\tthrow new Error( 'invalid character code. Value: ' + token.arg );\n\t\t\t\t\t}\n\t\t\t\t\ttoken.arg = ( isnan( num ) ) ?\n\t\t\t\t\t\tString( token.arg ) :\n\t\t\t\t\t\tfromCharCode( num );\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\tcase 'e':\n\t\t\tcase 'E':\n\t\t\tcase 'f':\n\t\t\tcase 'F':\n\t\t\tcase 'g':\n\t\t\tcase 'G':\n\t\t\t\t// Case: %e, %E (scientific notation), %f, %F (decimal floating point), %g, %G (uses the shorter of %e/E or %f/F)\n\t\t\t\tif ( !hasPeriod ) {\n\t\t\t\t\ttoken.precision = 6;\n\t\t\t\t}\n\t\t\t\ttoken.arg = formatDouble( token );\n\t\t\t\tbreak;\n\t\t\tdefault:\n\t\t\t\tthrow new Error( 'invalid specifier: ' + token.specifier );\n\t\t\t}\n\t\t\t// Fit argument into field width...\n\t\t\tif ( token.maxWidth >= 0 && token.arg.length > token.maxWidth ) {\n\t\t\t\ttoken.arg = token.arg.substring( 0, token.maxWidth );\n\t\t\t}\n\t\t\tif ( token.padZeros ) {\n\t\t\t\ttoken.arg = zeroPad( token.arg, token.width || token.precision, token.padRight ); // eslint-disable-line max-len\n\t\t\t} else if ( token.width ) {\n\t\t\t\ttoken.arg = spacePad( token.arg, token.width, token.padRight );\n\t\t\t}\n\t\t\tout += token.arg || '';\n\t\t\tpos += 1;\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = formatInterpolate;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Returns `n` spaces.\n*\n* @private\n* @param {number} n - number of spaces\n* @returns {string} string of spaces\n*/\nfunction spaces( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += ' ';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with spaces to the specified width.\n*\n* @private\n* @param {string} str - token argument\n* @param {number} width - token width\n* @param {boolean} [right=false] - boolean indicating whether to pad to the right\n* @returns {string} padded token argument\n*/\nfunction spacePad( str, width, right ) {\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tstr = ( right ) ?\n\t\tstr + spaces( pad ) :\n\t\tspaces( pad ) + str;\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = spacePad;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// FUNCTIONS //\n\n/**\n* Tests if a string starts with a minus sign (`-`).\n*\n* @private\n* @param {string} str - input string\n* @returns {boolean} boolean indicating if a string starts with a minus sign (`-`)\n*/\nfunction startsWithMinus( str ) {\n\treturn str[ 0 ] === '-';\n}\n\n/**\n* Returns a string of `n` zeros.\n*\n* @private\n* @param {number} n - number of zeros\n* @returns {string} string of zeros\n*/\nfunction zeros( n ) {\n\tvar out = '';\n\tvar i;\n\tfor ( i = 0; i < n; i++ ) {\n\t\tout += '0';\n\t}\n\treturn out;\n}\n\n\n// MAIN //\n\n/**\n* Pads a token with zeros to the specified width.\n*\n* @private\n* @param {string} str - token argument\n* @param {number} width - token width\n* @param {boolean} [right=false] - boolean indicating whether to pad to the right\n* @returns {string} padded token argument\n*/\nfunction zeroPad( str, width, right ) {\n\tvar negative = false;\n\tvar pad = width - str.length;\n\tif ( pad < 0 ) {\n\t\treturn str;\n\t}\n\tif ( startsWithMinus( str ) ) {\n\t\tnegative = true;\n\t\tstr = str.substr( 1 );\n\t}\n\tstr = ( right ) ?\n\t\tstr + zeros( pad ) :\n\t\tzeros( pad ) + str;\n\tif ( negative ) {\n\t\tstr = '-' + str;\n\t}\n\treturn str;\n}\n\n\n// EXPORTS //\n\nmodule.exports = zeroPad;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tokenize a string into an array of string parts and format identifier objects.\n*\n* @module @stdlib/string-base-format-tokenize\n*\n* @example\n* var formatTokenize = require( '@stdlib/string-base-format-tokenize' );\n*\n* var str = 'Hello %s!';\n* var tokens = formatTokenize( str );\n* // returns [ 'Hello ', {...}, '!' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// VARIABLES //\n\nvar RE = /%(?:([1-9]\\d*)\\$)?([0 +\\-#]*)(\\*|\\d+)?(?:(\\.)(\\*|\\d+)?)?[hlL]?([%A-Za-z])/g;\n\n\n// FUNCTIONS //\n\n/**\n* Parses a delimiter.\n*\n* @private\n* @param {Array} match - regular expression match\n* @returns {Object} delimiter token object\n*/\nfunction parse( match ) {\n\tvar token = {\n\t\t'mapping': ( match[ 1 ] ) ? parseInt( match[ 1 ], 10 ) : void 0,\n\t\t'flags': match[ 2 ],\n\t\t'width': match[ 3 ],\n\t\t'precision': match[ 5 ],\n\t\t'specifier': match[ 6 ]\n\t};\n\tif ( match[ 4 ] === '.' && match[ 5 ] === void 0 ) {\n\t\ttoken.precision = '1';\n\t}\n\treturn token;\n}\n\n\n// MAIN //\n\n/**\n* Tokenizes a string into an array of string parts and format identifier objects.\n*\n* @param {string} str - input string\n* @returns {Array} tokens\n*\n* @example\n* var tokens = formatTokenize( 'Hello %s!' );\n* // returns [ 'Hello ', {...}, '!' ]\n*/\nfunction formatTokenize( str ) {\n\tvar content;\n\tvar tokens;\n\tvar match;\n\tvar prev;\n\n\ttokens = [];\n\tprev = 0;\n\tmatch = RE.exec( str );\n\twhile ( match ) {\n\t\tcontent = str.slice( prev, RE.lastIndex - match[ 0 ].length );\n\t\tif ( content.length ) {\n\t\t\ttokens.push( content );\n\t\t}\n\t\ttokens.push( parse( match ) );\n\t\tprev = RE.lastIndex;\n\t\tmatch = RE.exec( str );\n\t}\n\tcontent = str.slice( prev );\n\tif ( content.length ) {\n\t\ttokens.push( content );\n\t}\n\treturn tokens;\n}\n\n\n// EXPORTS //\n\nmodule.exports = formatTokenize;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Insert supplied variable values into a format string.\n*\n* @module @stdlib/string-format\n*\n* @example\n* var format = require( '@stdlib/string-format' );\n*\n* var out = format( '%s %s!', 'Hello', 'World' );\n* // returns 'Hello World!'\n*\n* out = format( 'Pi: ~%.2f', 3.141592653589793 );\n* // returns 'Pi: ~3.14'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Tests if a value is a string primitive.\n*\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating if a value is a string primitive\n*\n* @example\n* var bool = isString( 'beep' );\n* // returns true\n*\n* @example\n* var bool = isString( new String( 'beep' ) );\n* // returns false\n*/\nfunction isString( value ) {\n\treturn ( typeof value === 'string' ); // NOTE: we inline the `isString.isPrimitive` function from `@stdlib/assert/is-string` in order to avoid circular dependencies.\n}\n\n\n// EXPORTS //\n\nmodule.exports = isString;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar interpolate = require( '@stdlib/string-base-format-interpolate' );\nvar tokenize = require( '@stdlib/string-base-format-tokenize' );\nvar isString = require( './is_string.js' );\n\n\n// MAIN //\n\n/**\n* Inserts supplied variable values into a format string.\n*\n* @param {string} str - input string\n* @param {Array} ...args - variable values\n* @throws {TypeError} first argument must be a string\n* @throws {Error} invalid flags\n* @returns {string} formatted string\n*\n* @example\n* var str = format( 'Hello %s!', 'world' );\n* // returns 'Hello world!'\n*\n* @example\n* var str = format( 'Pi: ~%.2f', 3.141592653589793 );\n* // returns 'Pi: ~3.14'\n*/\nfunction format( str ) {\n\tvar args;\n\tvar i;\n\n\tif ( !isString( str ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be a string. Value: `%s`.', str ) );\n\t}\n\targs = [ tokenize( str ) ];\n\tfor ( i = 1; i < arguments.length; i++ ) {\n\t\targs.push( arguments[ i ] );\n\t}\n\treturn interpolate.apply( null, args );\n}\n\n\n// EXPORTS //\n\nmodule.exports = format;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Symbol factory.\n*\n* @module @stdlib/symbol-ctor\n*\n* @example\n* var Symbol = require( '@stdlib/symbol-ctor' );\n*\n* var s = Symbol( 'beep' );\n* // returns \n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar Sym = ( typeof Symbol === 'function' ) ? Symbol : void 0; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = Sym;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Iterator symbol.\n*\n* @module @stdlib/symbol-iterator\n*\n* @example\n* var IteratorSymbol = require( '@stdlib/symbol-iterator' );\n*\n* function iterator() {\n* var it;\n* var i;\n*\n* i = -1;\n*\n* it = {};\n* it.next = next;\n* it.return = done;\n*\n* if ( IteratorSymbol ) {\n* it[ IteratorSymbol ] = iterator;\n* }\n* return it;\n*\n* function next() {\n* i += 1;\n* return {\n* 'value': i,\n* 'done': false\n* };\n* }\n*\n* function done( value ) {\n* if ( arguments.length === 0 ) {\n* return {\n* 'done': true\n* };\n* }\n* return {\n* 'value': value,\n* 'done': true\n* };\n* }\n* }\n*\n* var obj = iterator();\n*/\n\n// MAIN //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasIteratorSymbolSupport = require( '@stdlib/assert-has-iterator-symbol-support' );\n\n\n// MAIN //\n\n/**\n* Iterator symbol.\n*\n* @name IteratorSymbol\n* @constant\n* @type {(symbol|null)}\n*\n* @example\n* function iterator() {\n* var it;\n* var i;\n*\n* i = -1;\n*\n* it = {};\n* it.next = next;\n* it.return = done;\n*\n* if ( IteratorSymbol ) {\n* it[ IteratorSymbol ] = iterator;\n* }\n* return it;\n*\n* function next() {\n* i += 1;\n* return {\n* 'value': i,\n* 'done': false\n* };\n* }\n*\n* function done( value ) {\n* if ( arguments.length === 0 ) {\n* return {\n* 'done': true\n* };\n* }\n* return {\n* 'value': value,\n* 'done': true\n* };\n* }\n* }\n*\n* var obj = iterator();\n*/\nvar IteratorSymbol = ( hasIteratorSymbolSupport() ) ? Symbol.iterator : null;\n\n\n// EXPORTS //\n\nmodule.exports = IteratorSymbol;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Create a constant function.\n*\n* @module @stdlib/utils-constant-function\n*\n* @example\n* var constantFunction = require( '@stdlib/utils-constant-function' );\n*\n* var fcn = constantFunction( 3.14 );\n*\n* var v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Creates a function which always returns the same value.\n*\n* @param {*} [value] - value to always return\n* @returns {Function} constant function\n*\n* @example\n* var fcn = wrap( 3.14 );\n*\n* var v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*\n* v = fcn();\n* // returns 3.14\n*/\nfunction wrap( value ) {\n\treturn constantFunction;\n\n\t/**\n\t* Constant function.\n\t*\n\t* @private\n\t* @returns {*} constant value\n\t*/\n\tfunction constantFunction() {\n\t\treturn value;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = wrap;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine the name of a value's constructor.\n*\n* @module @stdlib/utils-constructor-name\n*\n* @example\n* var constructorName = require( '@stdlib/utils-constructor-name' );\n*\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* v = constructorName( {} );\n* // returns 'Object'\n*\n* v = constructorName( true );\n* // returns 'Boolean'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\nvar RE = require( '@stdlib/regexp-function-name' ).REGEXP;\nvar isBuffer = require( '@stdlib/assert-is-buffer' );\n\n\n// MAIN //\n\n/**\n* Determines the name of a value's constructor.\n*\n* @param {*} v - input value\n* @returns {string} name of a value's constructor\n*\n* @example\n* var v = constructorName( 'a' );\n* // returns 'String'\n*\n* @example\n* var v = constructorName( 5 );\n* // returns 'Number'\n*\n* @example\n* var v = constructorName( null );\n* // returns 'Null'\n*\n* @example\n* var v = constructorName( undefined );\n* // returns 'Undefined'\n*\n* @example\n* var v = constructorName( function noop() {} );\n* // returns 'Function'\n*/\nfunction constructorName( v ) {\n\tvar match;\n\tvar name;\n\tvar ctor;\n\tname = nativeClass( v ).slice( 8, -1 );\n\tif ( (name === 'Object' || name === 'Error') && v.constructor ) {\n\t\tctor = v.constructor;\n\t\tif ( typeof ctor.name === 'string' ) {\n\t\t\treturn ctor.name;\n\t\t}\n\t\tmatch = RE.exec( ctor.toString() );\n\t\tif ( match ) {\n\t\t\treturn match[ 1 ];\n\t\t}\n\t}\n\tif ( isBuffer( v ) ) {\n\t\treturn 'Buffer';\n\t}\n\treturn name;\n}\n\n\n// EXPORTS //\n\nmodule.exports = constructorName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define a non-enumerable read-only accessor.\n*\n* @module @stdlib/utils-define-nonenumerable-read-only-accessor\n*\n* @example\n* var setNonEnumerableReadOnlyAccessor = require( '@stdlib/utils-define-nonenumerable-read-only-accessor' );\n*\n* function getter() {\n* return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar defineProperty = require( '@stdlib/utils-define-property' );\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - accessor\n*\n* @example\n* function getter() {\n* return 'bar';\n* }\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnlyAccessor( obj, 'foo', getter );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnlyAccessor( obj, prop, getter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter\n\t});\n}\n\n\n// EXPORTS //\n\nmodule.exports = setNonEnumerableReadOnlyAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define a non-enumerable read-only property.\n*\n* @module @stdlib/utils-define-nonenumerable-read-only-property\n*\n* @example\n* var setNonEnumerableReadOnly = require( '@stdlib/utils-define-nonenumerable-read-only-property' );\n*\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar defineProperty = require( '@stdlib/utils-define-property' );\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-only property.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {*} value - value to set\n*\n* @example\n* var obj = {};\n*\n* setNonEnumerableReadOnly( obj, 'foo', 'bar' );\n*\n* try {\n* obj.foo = 'boop';\n* } catch ( err ) {\n* console.error( err.message );\n* }\n*/\nfunction setNonEnumerableReadOnly( obj, prop, value ) {\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'writable': false,\n\t\t'value': value\n\t});\n}\n\n\n// EXPORTS //\n\nmodule.exports = setNonEnumerableReadOnly;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define a non-enumerable read-write accessor.\n*\n* @module @stdlib/utils-define-nonenumerable-read-write-accessor\n*\n* @example\n* var setNonEnumerableReadWriteAccessor = require( '@stdlib/utils-define-nonenumerable-read-write-accessor' );\n*\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setNonEnumerableReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar defineProperty = require( '@stdlib/utils-define-property' );\n\n\n// MAIN //\n\n/**\n* Defines a non-enumerable read-write accessor.\n*\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Function} getter - get accessor\n* @param {Function} setter - set accessor\n*\n* @example\n* function getter() {\n* return name + ' foo';\n* }\n*\n* function setter( v ) {\n* name = v;\n* }\n*\n* var name = 'bar';\n* var obj = {};\n*\n* setNonEnumerableReadWriteAccessor( obj, 'foo', getter, setter );\n*\n* var v = obj.foo;\n* // returns 'bar foo'\n*\n* obj.foo = 'beep';\n*\n* v = obj.foo;\n* // returns 'beep foo'\n*/\nfunction setNonEnumerableReadWriteAccessor( obj, prop, getter, setter ) { // eslint-disable-line id-length\n\tdefineProperty( obj, prop, {\n\t\t'configurable': false,\n\t\t'enumerable': false,\n\t\t'get': getter,\n\t\t'set': setter\n\t});\n}\n\n\n// EXPORTS //\n\nmodule.exports = setNonEnumerableReadWriteAccessor;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Defines (or modifies) an object property.\n*\n* ## Notes\n*\n* - Property descriptors come in two flavors: **data descriptors** and **accessor descriptors**. A data descriptor is a property that has a value, which may or may not be writable. An accessor descriptor is a property described by a getter-setter function pair. A descriptor must be one of these two flavors and cannot be both.\n*\n* @name defineProperty\n* @type {Function}\n* @param {Object} obj - object on which to define the property\n* @param {(string|symbol)} prop - property name\n* @param {Object} descriptor - property descriptor\n* @param {boolean} [descriptor.configurable=false] - boolean indicating if property descriptor can be changed and if the property can be deleted from the provided object\n* @param {boolean} [descriptor.enumerable=false] - boolean indicating if the property shows up when enumerating object properties\n* @param {boolean} [descriptor.writable=false] - boolean indicating if the value associated with the property can be changed with an assignment operator\n* @param {*} [descriptor.value] - property value\n* @param {(Function|void)} [descriptor.get=undefined] - function which serves as a getter for the property, or, if no getter, undefined. When the property is accessed, a getter function is called without arguments and with the `this` context set to the object through which the property is accessed (which may not be the object on which the property is defined due to inheritance). The return value will be used as the property value.\n* @param {(Function|void)} [descriptor.set=undefined] - function which serves as a setter for the property, or, if no setter, undefined. When assigning a property value, a setter function is called with one argument (the value being assigned to the property) and with the `this` context set to the object through which the property is assigned.\n* @throws {TypeError} first argument must be an object\n* @throws {TypeError} third argument must be an object\n* @throws {Error} property descriptor cannot have both a value and a setter and/or getter\n* @returns {Object} object with added property\n*\n* @example\n* var obj = {};\n*\n* defineProperty( obj, 'foo', {\n* 'value': 'bar'\n* });\n*\n* var str = obj.foo;\n* // returns 'bar'\n*/\nvar defineProperty = Object.defineProperty;\n\n\n// EXPORTS //\n\nmodule.exports = defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar main = ( typeof Object.defineProperty === 'function' ) ? Object.defineProperty : null;\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2021 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar defineProperty = require( './define_property.js' );\n\n\n// MAIN //\n\n/**\n* Tests for `Object.defineProperty` support.\n*\n* @private\n* @returns {boolean} boolean indicating if an environment has `Object.defineProperty` support\n*\n* @example\n* var bool = hasDefinePropertySupport();\n* // returns \n*/\nfunction hasDefinePropertySupport() {\n\t// Test basic support...\n\ttry {\n\t\tdefineProperty( {}, 'x', {} );\n\t\treturn true;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = hasDefinePropertySupport;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Define (or modify) an object property.\n*\n* @module @stdlib/utils-define-property\n*\n* @example\n* var defineProperty = require( '@stdlib/utils-define-property' );\n*\n* var obj = {};\n* defineProperty( obj, 'foo', {\n* 'value': 'bar',\n* 'writable': false,\n* 'configurable': false,\n* 'enumerable': false\n* });\n* obj.foo = 'boop'; // => throws\n*/\n\n// MODULES //\n\nvar hasDefinePropertySupport = require( './has_define_property_support.js' );\nvar builtin = require( './builtin.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar defineProperty;\nif ( hasDefinePropertySupport() ) {\n\tdefineProperty = builtin;\n} else {\n\tdefineProperty = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n/* eslint-disable no-underscore-dangle, no-proto */\n\n'use strict';\n\n// MODULES //\n\nvar format = require( '@stdlib/string-format' );\n\n\n// VARIABLES //\n\nvar objectProtoype = Object.prototype;\nvar toStr = objectProtoype.toString;\nvar defineGetter = objectProtoype.__defineGetter__;\nvar defineSetter = objectProtoype.__defineSetter__;\nvar lookupGetter = objectProtoype.__lookupGetter__;\nvar lookupSetter = objectProtoype.__lookupSetter__;\n\n\n// MAIN //\n\n/**\n* Defines (or modifies) an object property.\n*\n* ## Notes\n*\n* - Property descriptors come in two flavors: **data descriptors** and **accessor descriptors**. A data descriptor is a property that has a value, which may or may not be writable. An accessor descriptor is a property described by a getter-setter function pair. A descriptor must be one of these two flavors and cannot be both.\n*\n* @param {Object} obj - object on which to define the property\n* @param {string} prop - property name\n* @param {Object} descriptor - property descriptor\n* @param {boolean} [descriptor.configurable=false] - boolean indicating if property descriptor can be changed and if the property can be deleted from the provided object\n* @param {boolean} [descriptor.enumerable=false] - boolean indicating if the property shows up when enumerating object properties\n* @param {boolean} [descriptor.writable=false] - boolean indicating if the value associated with the property can be changed with an assignment operator\n* @param {*} [descriptor.value] - property value\n* @param {(Function|void)} [descriptor.get=undefined] - function which serves as a getter for the property, or, if no getter, undefined. When the property is accessed, a getter function is called without arguments and with the `this` context set to the object through which the property is accessed (which may not be the object on which the property is defined due to inheritance). The return value will be used as the property value.\n* @param {(Function|void)} [descriptor.set=undefined] - function which serves as a setter for the property, or, if no setter, undefined. When assigning a property value, a setter function is called with one argument (the value being assigned to the property) and with the `this` context set to the object through which the property is assigned.\n* @throws {TypeError} first argument must be an object\n* @throws {TypeError} third argument must be an object\n* @throws {Error} property descriptor cannot have both a value and a setter and/or getter\n* @returns {Object} object with added property\n*\n* @example\n* var obj = {};\n*\n* defineProperty( obj, 'foo', {\n* 'value': 'bar'\n* });\n*\n* var str = obj.foo;\n* // returns 'bar'\n*/\nfunction defineProperty( obj, prop, descriptor ) {\n\tvar prototype;\n\tvar hasValue;\n\tvar hasGet;\n\tvar hasSet;\n\n\tif ( typeof obj !== 'object' || obj === null || toStr.call( obj ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an object. Value: `%s`.', obj ) );\n\t}\n\tif ( typeof descriptor !== 'object' || descriptor === null || toStr.call( descriptor ) === '[object Array]' ) {\n\t\tthrow new TypeError( format( 'invalid argument. Property descriptor must be an object. Value: `%s`.', descriptor ) );\n\t}\n\thasValue = ( 'value' in descriptor );\n\tif ( hasValue ) {\n\t\tif (\n\t\t\tlookupGetter.call( obj, prop ) ||\n\t\t\tlookupSetter.call( obj, prop )\n\t\t) {\n\t\t\t// Override `__proto__` to avoid touching inherited accessors:\n\t\t\tprototype = obj.__proto__;\n\t\t\tobj.__proto__ = objectProtoype;\n\n\t\t\t// Delete property as existing getters/setters prevent assigning value to specified property:\n\t\t\tdelete obj[ prop ];\n\t\t\tobj[ prop ] = descriptor.value;\n\n\t\t\t// Restore original prototype:\n\t\t\tobj.__proto__ = prototype;\n\t\t} else {\n\t\t\tobj[ prop ] = descriptor.value;\n\t\t}\n\t}\n\thasGet = ( 'get' in descriptor );\n\thasSet = ( 'set' in descriptor );\n\n\tif ( hasValue && ( hasGet || hasSet ) ) {\n\t\tthrow new Error( 'invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.' );\n\t}\n\n\tif ( hasGet && defineGetter ) {\n\t\tdefineGetter.call( obj, prop, descriptor.get );\n\t}\n\tif ( hasSet && defineSetter ) {\n\t\tdefineSetter.call( obj, prop, descriptor.set );\n\t}\n\treturn obj;\n}\n\n\n// EXPORTS //\n\nmodule.exports = defineProperty;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an array of an object's own enumerable property names and symbols.\n*\n* @module @stdlib/utils-enumerable-properties\n*\n* @example\n* var enumerableProperties = require( '@stdlib/utils-enumerable-properties' );\n*\n* var props = enumerableProperties({\n* 'foo': 'bar',\n* 'beep': 'boop'\n* });\n* // e.g., returns [ 'foo', 'beep' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar keys = require( '@stdlib/utils-keys' );\nvar propertySymbols = require( '@stdlib/utils-property-symbols' );\nvar isEnumerable = require( '@stdlib/assert-is-enumerable-property' );\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names and symbols.\n*\n* @param {*} value - input object\n* @returns {Array} a list of own property enumerable names and symbols\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var props = enumerableProperties( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction enumerableProperties( value ) {\n\tvar out;\n\tvar tmp;\n\tvar i;\n\n\tout = keys( value );\n\ttmp = propertySymbols( value );\n\tfor ( i = 0; i < tmp.length; i++ ) {\n\t\tif ( isEnumerable( value, tmp[ i ] ) ) {\n\t\t\tout.push( tmp[ i ] );\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = enumerableProperties;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the name of a function.\n*\n* @module @stdlib/utils-function-name\n*\n* @example\n* var functionName = require( '@stdlib/utils-function-name' );\n*\n* var v = functionName( String );\n* // returns 'String'\n*\n* v = functionName( function foo(){} );\n* // returns 'foo'\n*\n* v = functionName( function(){} );\n* // returns '' || 'anonymous'\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar hasFunctionNameSupport = require( '@stdlib/assert-has-function-name-support' );\nvar format = require( '@stdlib/string-format' );\nvar RE = require( '@stdlib/regexp-function-name' ).REGEXP;\n\n\n// VARIABLES //\n\nvar isFunctionNameSupported = hasFunctionNameSupport();\n\n\n// MAIN //\n\n/**\n* Returns the name of a function.\n*\n* @param {Function} fcn - input function\n* @throws {TypeError} must provide a function\n* @returns {string} function name\n*\n* @example\n* var v = functionName( Math.sqrt );\n* // returns 'sqrt'\n*\n* @example\n* var v = functionName( function foo(){} );\n* // returns 'foo'\n*\n* @example\n* var v = functionName( function(){} );\n* // returns '' || 'anonymous'\n*\n* @example\n* var v = functionName( String );\n* // returns 'String'\n*/\nfunction functionName( fcn ) {\n\t// TODO: add support for generator functions?\n\tif ( isFunction( fcn ) === false ) {\n\t\tthrow new TypeError( format( 'invalid argument. Must provide a function. Value: `%s`.', fcn ) );\n\t}\n\tif ( isFunctionNameSupported ) {\n\t\treturn fcn.name;\n\t}\n\treturn RE.exec( fcn.toString() )[ 1 ];\n}\n\n\n// EXPORTS //\n\nmodule.exports = functionName;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isFunction = require( '@stdlib/assert-is-function' );\nvar builtin = require( './native.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar getProto;\nif ( isFunction( Object.getPrototypeOf ) ) {\n\tgetProto = builtin;\n} else {\n\tgetProto = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the prototype of a provided object.\n*\n* @module @stdlib/utils-get-prototype-of\n*\n* @example\n* var getPrototype = require( '@stdlib/utils-get-prototype-of' );\n*\n* var proto = getPrototype( {} );\n* // returns {}\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Object = require( '@stdlib/object-ctor' );\nvar getProto = require( './detect.js' );\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @param {*} value - input value\n* @returns {(Object|null)} prototype\n*\n* @example\n* var proto = getPrototypeOf( {} );\n* // returns {}\n*/\nfunction getPrototypeOf( value ) {\n\tif (\n\t\tvalue === null ||\n\t\tvalue === void 0\n\t) {\n\t\treturn null;\n\t}\n\t// In order to ensure consistent ES5/ES6 behavior, cast input value to an object (strings, numbers, booleans); ES5 `Object.getPrototypeOf` throws when provided primitives and ES6 `Object.getPrototypeOf` casts:\n\tvalue = Object( value );\n\n\treturn getProto( value );\n}\n\n\n// EXPORTS //\n\nmodule.exports = getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar getProto = Object.getPrototypeOf;\n\n\n// EXPORTS //\n\nmodule.exports = getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar nativeClass = require( '@stdlib/utils-native-class' );\nvar getProto = require( './proto.js' );\n\n\n// MAIN //\n\n/**\n* Returns the prototype of a provided object.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {(Object|null)} prototype\n*/\nfunction getPrototypeOf( obj ) {\n\tvar proto = getProto( obj );\n\tif ( proto || proto === null ) {\n\t\treturn proto;\n\t}\n\tif ( nativeClass( obj.constructor ) === '[object Function]' ) {\n\t\t// May break if the constructor has been tampered with...\n\t\treturn obj.constructor.prototype;\n\t}\n\tif ( obj instanceof Object ) {\n\t\treturn Object.prototype;\n\t}\n\t// Return `null` for objects created via `Object.create( null )`. Also return `null` for cross-realm objects on browsers that lack `__proto__` support, such as IE < 11.\n\treturn null;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getPrototypeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Returns the value of the `__proto__` property.\n*\n* @private\n* @param {Object} obj - input object\n* @returns {*} value of `__proto__` property\n*/\nfunction getProto( obj ) {\n\t// eslint-disable-next-line no-proto\n\treturn obj.__proto__;\n}\n\n\n// EXPORTS //\n\nmodule.exports = getProto;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isBoolean = require( '@stdlib/assert-is-boolean' ).isPrimitive;\nvar format = require( '@stdlib/string-format' );\nvar getThis = require( './codegen.js' );\nvar Self = require( './self.js' );\nvar Win = require( './window.js' );\nvar GlobalThis = require( './global_this.js' );\n\n\n// MAIN //\n\n/**\n* Returns the global object.\n*\n* ## Notes\n*\n* - Using code generation is the **most** reliable way to resolve the global object; however, doing so is likely to violate content security policies (CSPs) in, e.g., Chrome Apps and elsewhere.\n*\n* @private\n* @param {boolean} [codegen=false] - boolean indicating whether to use code generation to resolve the global object\n* @throws {TypeError} must provide a boolean\n* @throws {Error} unable to resolve global object\n* @returns {Object} global object\n*\n* @example\n* var g = getGlobal();\n* // returns {...}\n*/\nfunction getGlobal( codegen ) {\n\tif ( arguments.length ) {\n\t\tif ( !isBoolean( codegen ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Must provide a boolean. Value: `%s`.', codegen ) );\n\t\t}\n\t\tif ( codegen ) {\n\t\t\treturn getThis();\n\t\t}\n\t\t// Fall through...\n\t}\n\t// Case: 2020 revision of ECMAScript standard\n\tif ( GlobalThis ) {\n\t\treturn GlobalThis;\n\t}\n\t// Case: browsers and web workers\n\tif ( Self ) {\n\t\treturn Self;\n\t}\n\t// Case: browsers\n\tif ( Win ) {\n\t\treturn Win;\n\t}\n\t// Case: unknown\n\tthrow new Error( 'unexpected error. Unable to resolve global object.' );\n}\n\n\n// EXPORTS //\n\nmodule.exports = getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns the global object using code generation.\n*\n* @private\n* @returns {Object} global object\n*/\nfunction getGlobal() {\n\treturn new Function( 'return this;' )(); // eslint-disable-line no-new-func, stdlib/require-globals\n}\n\n\n// EXPORTS //\n\nmodule.exports = getGlobal;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2022 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof globalThis === 'object' ) ? globalThis : null; // eslint-disable-line no-undef\n\n\n// EXPORTS //\n\nmodule.exports = obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof self === 'object' ) ? self : null;\n\n\n// EXPORTS //\n\nmodule.exports = obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar obj = ( typeof window === 'object' ) ? window : null;\n\n\n// EXPORTS //\n\nmodule.exports = obj;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return the first index at which a given element can be found.\n*\n* @module @stdlib/utils-index-of\n*\n* @example\n* var indexOf = require( '@stdlib/utils-index-of' );\n*\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* arr = [ 4, 3, 2, 1 ];\n* idx = indexOf( arr, 5 );\n* // returns -1\n*\n* // Using a `fromIndex`:\n* arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* // `fromIndex` which exceeds `array` length:\n* arr = [ 1, 2, 3, 4, 2, 5 ];\n* idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* // Negative `fromIndex`:\n* arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* // Negative `fromIndex` exceeding input `array` length:\n* arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* // Array-like objects:\n* var str = 'bebop';\n* idx = indexOf( str, 'o' );\n* // returns 3\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isnan = require( '@stdlib/assert-is-nan' );\nvar isCollection = require( '@stdlib/assert-is-collection' );\nvar isString = require( '@stdlib/assert-is-string' ).isPrimitive;\nvar isInteger = require( '@stdlib/assert-is-integer' ).isPrimitive;\nvar format = require( '@stdlib/string-format' );\n\n\n// MAIN //\n\n/**\n* Returns the first index at which a given element can be found.\n*\n* @param {ArrayLike} arr - array-like object\n* @param {*} searchElement - element to find\n* @param {integer} [fromIndex] - starting index (if negative, the start index is determined relative to last element)\n* @throws {TypeError} must provide an array-like object\n* @throws {TypeError} third argument must be an integer\n* @returns {integer} index or -1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 3 );\n* // returns 1\n*\n* @example\n* var arr = [ 4, 3, 2, 1 ];\n* var idx = indexOf( arr, 5 );\n* // returns -1\n*\n* @example\n* // Using a `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, 3 );\n* // returns 5\n*\n* @example\n* // `fromIndex` which exceeds `array` length:\n* var arr = [ 1, 2, 3, 4, 2, 5 ];\n* var idx = indexOf( arr, 2, 10 );\n* // returns -1\n*\n* @example\n* // Negative `fromIndex`:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6, 2 ];\n* var idx = indexOf( arr, 2, -4 );\n* // returns 5\n*\n* idx = indexOf( arr, 2, -1 );\n* // returns 7\n*\n* @example\n* // Negative `fromIndex` exceeding input `array` length:\n* var arr = [ 1, 2, 3, 4, 5, 2, 6 ];\n* var idx = indexOf( arr, 2, -10 );\n* // returns 1\n*\n* @example\n* // Array-like objects:\n* var str = 'bebop';\n* var idx = indexOf( str, 'o' );\n* // returns 3\n*/\nfunction indexOf( arr, searchElement, fromIndex ) {\n\tvar len;\n\tvar i;\n\tif ( !isCollection( arr ) && !isString( arr ) ) {\n\t\tthrow new TypeError( format( 'invalid argument. First argument must be an array-like object. Value: `%s`.', arr ) );\n\t}\n\tlen = arr.length;\n\tif ( len === 0 ) {\n\t\treturn -1;\n\t}\n\tif ( arguments.length === 3 ) {\n\t\tif ( !isInteger( fromIndex ) ) {\n\t\t\tthrow new TypeError( format( 'invalid argument. Third argument must be an integer. Value: `%s`.', fromIndex ) );\n\t\t}\n\t\tif ( fromIndex >= 0 ) {\n\t\t\tif ( fromIndex >= len ) {\n\t\t\t\treturn -1;\n\t\t\t}\n\t\t\ti = fromIndex;\n\t\t} else {\n\t\t\ti = len + fromIndex;\n\t\t\tif ( i < 0 ) {\n\t\t\t\ti = 0;\n\t\t\t}\n\t\t}\n\t} else {\n\t\ti = 0;\n\t}\n\t// Check for `NaN`...\n\tif ( isnan( searchElement ) ) {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( isnan( arr[i] ) ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t} else {\n\t\tfor ( ; i < len; i++ ) {\n\t\t\tif ( arr[ i ] === searchElement ) {\n\t\t\t\treturn i;\n\t\t\t}\n\t\t}\n\t}\n\treturn -1;\n}\n\n\n// EXPORTS //\n\nmodule.exports = indexOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.keys()`, this function returns an empty array if provided `undefined` or `null`, rather than throwing an error.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\treturn Object.keys( Object( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isArguments = require( '@stdlib/assert-is-arguments' );\nvar builtin = require( './builtin.js' );\n\n\n// VARIABLES //\n\nvar slice = Array.prototype.slice;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tif ( isArguments( value ) ) {\n\t\treturn builtin( slice.call( value ) );\n\t}\n\treturn builtin( value );\n}\n\n\n// EXPORTS //\n\nmodule.exports = keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar keys = require( './builtin.js' );\n\n\n// FUNCTIONS //\n\n/**\n* Tests the built-in `Object.keys()` implementation when provided `arguments`.\n*\n* @private\n* @returns {boolean} boolean indicating whether the built-in implementation returns the expected number of keys\n*/\nfunction test() {\n\treturn ( keys( arguments ) || '' ).length !== 2;\n}\n\n\n// MAIN //\n\n/**\n* Tests whether the built-in `Object.keys()` implementation supports providing `arguments` as an input value.\n*\n* ## Notes\n*\n* - Safari 5.0 does **not** support `arguments` as an input value.\n*\n* @private\n* @returns {boolean} boolean indicating whether a built-in implementation supports `arguments`\n*/\nfunction check() {\n\treturn test( 1, 2 );\n}\n\n\n// EXPORTS //\n\nmodule.exports = check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar indexOf = require( '@stdlib/utils-index-of' );\nvar typeOf = require( '@stdlib/utils-type-of' );\nvar isConstructorPrototype = require( './is_constructor_prototype.js' );\nvar EXCLUDED_KEYS = require( './excluded_keys.json' );\nvar win = require( './window.js' );\n\n\n// VARIABLES //\n\nvar bool;\n\n\n// FUNCTIONS //\n\n/**\n* Determines whether an environment throws when comparing to the prototype of a value's constructor (e.g., [IE9][1]).\n*\n* [1]: https://stackoverflow.com/questions/7688070/why-is-comparing-the-constructor-property-of-two-windows-unreliable\n*\n* @private\n* @returns {boolean} boolean indicating whether an environment is buggy\n*/\nfunction check() {\n\tvar k;\n\tif ( typeOf( win ) === 'undefined' ) {\n\t\treturn false;\n\t}\n\tfor ( k in win ) { // eslint-disable-line guard-for-in\n\t\ttry {\n\t\t\tif (\n\t\t\t\tindexOf( EXCLUDED_KEYS, k ) === -1 &&\n\t\t\t\thasOwnProp( win, k ) &&\n\t\t\t\twin[ k ] !== null &&\n\t\t\t\ttypeOf( win[ k ] ) === 'object'\n\t\t\t) {\n\t\t\t\tisConstructorPrototype( win[ k ] );\n\t\t\t}\n\t\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\n// MAIN //\n\nbool = check();\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof Object.keys !== 'undefined' );\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isEnumerableProperty = require( '@stdlib/assert-is-enumerable-property' );\nvar noop = require( '@stdlib/utils-noop' );\n\n\n// MAIN //\n\n// Note: certain environments treat an object's prototype as enumerable, which, as a matter of convention, it shouldn't be...\nvar bool = isEnumerableProperty( noop, 'prototype' );\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isEnumerableProperty = require( '@stdlib/assert-is-enumerable-property' );\n\n\n// VARIABLES //\n\nvar obj = {\n\t'toString': null\n};\n\n\n// MAIN //\n\n// Note: certain environments don't allow enumeration of overwritten properties which are considered non-enumerable...\nvar bool = !isEnumerableProperty( obj, 'toString' );\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof window !== 'undefined' );\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an array of an object's own enumerable property names.\n*\n* @module @stdlib/utils-keys\n*\n* @example\n* var keys = require( '@stdlib/utils-keys' );\n*\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Tests whether a value equals the prototype of its constructor.\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction isConstructorPrototype( value ) {\n\treturn ( value.constructor && value.constructor.prototype === value );\n}\n\n\n// EXPORTS //\n\nmodule.exports = isConstructorPrototype;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasAutomationEqualityBug = require( './has_automation_equality_bug.js' );\nvar isConstructorPrototype = require( './is_constructor_prototype.js' );\nvar HAS_WINDOW = require( './has_window.js' );\n\n\n// MAIN //\n\n/**\n* Wraps the test for constructor prototype equality to accommodate buggy environments (e.g., environments which throw when testing equality).\n*\n* @private\n* @param {*} value - value to test\n* @returns {boolean} boolean indicating whether a value equals the prototype of its constructor\n*/\nfunction wrapper( value ) {\n\tif ( HAS_WINDOW === false && !hasAutomationEqualityBug ) {\n\t\treturn isConstructorPrototype( value );\n\t}\n\ttry {\n\t\treturn isConstructorPrototype( value );\n\t} catch ( error ) { // eslint-disable-line no-unused-vars\n\t\treturn false;\n\t}\n}\n\n\n// EXPORTS //\n\nmodule.exports = wrapper;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasArgumentsBug = require( './has_arguments_bug.js' );\nvar HAS_BUILTIN = require( './has_builtin.js' );\nvar builtin = require( './builtin.js' );\nvar wrapper = require( './builtin_wrapper.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @name keys\n* @type {Function}\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nvar keys;\nif ( HAS_BUILTIN ) {\n\tif ( hasArgumentsBug() ) {\n\t\tkeys = wrapper;\n\t} else {\n\t\tkeys = builtin;\n\t}\n} else {\n\tkeys = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar isObjectLike = require( '@stdlib/assert-is-object-like' );\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar isArguments = require( '@stdlib/assert-is-arguments' );\nvar HAS_ENUM_PROTO_BUG = require( './has_enumerable_prototype_bug.js' );\nvar HAS_NON_ENUM_PROPS_BUG = require( './has_non_enumerable_properties_bug.js' );\nvar isConstructorPrototype = require( './is_constructor_prototype_wrapper.js' );\nvar NON_ENUMERABLE = require( './non_enumerable.json' );\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own enumerable property names.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own enumerable property names\n*\n* @example\n* var obj = {\n* 'beep': 'boop',\n* 'foo': 3.14\n* };\n*\n* var k = keys( obj );\n* // e.g., returns [ 'beep', 'foo' ]\n*/\nfunction keys( value ) {\n\tvar skipConstructor;\n\tvar skipPrototype;\n\tvar isFcn;\n\tvar out;\n\tvar k;\n\tvar p;\n\tvar i;\n\n\tout = [];\n\tif ( isArguments( value ) ) {\n\t\t// Account for environments which treat `arguments` differently...\n\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\tout.push( i.toString() );\n\t\t}\n\t\t// Note: yes, we are precluding the `arguments` array-like object from having other enumerable properties; however, this should (1) be very rare and (2) not be encouraged (e.g., doing something like `arguments.a = 'b'`; in certain engines directly manipulating the `arguments` value results in automatic de-optimization).\n\t\treturn out;\n\t}\n\tif ( typeof value === 'string' ) {\n\t\t// Account for environments which do not treat string character indices as \"own\" properties...\n\t\tif ( value.length > 0 && !hasOwnProp( value, '0' ) ) {\n\t\t\tfor ( i = 0; i < value.length; i++ ) {\n\t\t\t\tout.push( i.toString() );\n\t\t\t}\n\t\t}\n\t} else {\n\t\tisFcn = ( typeof value === 'function' );\n\t\tif ( isFcn === false && !isObjectLike( value ) ) {\n\t\t\treturn out;\n\t\t}\n\t\tskipPrototype = ( HAS_ENUM_PROTO_BUG && isFcn );\n\t}\n\tfor ( k in value ) {\n\t\tif ( !( skipPrototype && k === 'prototype' ) && hasOwnProp( value, k ) ) {\n\t\t\tout.push( String( k ) );\n\t\t}\n\t}\n\tif ( HAS_NON_ENUM_PROPS_BUG ) {\n\t\tskipConstructor = isConstructorPrototype( value );\n\t\tfor ( i = 0; i < NON_ENUMERABLE.length; i++ ) {\n\t\t\tp = NON_ENUMERABLE[ i ];\n\t\t\tif ( !( skipConstructor && p === 'constructor' ) && hasOwnProp( value, p ) ) {\n\t\t\t\tout.push( String( p ) );\n\t\t\t}\n\t\t}\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = keys;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar w = ( typeof window === 'undefined' ) ? void 0 : window;\n\n\n// EXPORTS //\n\nmodule.exports = w;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return a string value indicating a specification defined classification of an object.\n*\n* @module @stdlib/utils-native-class\n*\n* @example\n* var nativeClass = require( '@stdlib/utils-native-class' );\n*\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* function Beep() {\n* return this;\n* }\n* str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\n\n// MODULES //\n\nvar hasToStringTag = require( '@stdlib/assert-has-tostringtag-support' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar main;\nif ( hasToStringTag() ) {\n\tmain = polyfill;\n} else {\n\tmain = builtin;\n}\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar toStr = require( './tostring.js' );\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification (via the internal property `[[Class]]`) of an object.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\treturn toStr.call( v );\n}\n\n\n// EXPORTS //\n\nmodule.exports = nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar hasOwnProp = require( '@stdlib/assert-has-own-property' );\nvar toStringTag = require( './tostringtag.js' );\nvar toStr = require( './tostring.js' );\n\n\n// MAIN //\n\n/**\n* Returns a string value indicating a specification defined classification of an object in environments supporting `Symbol.toStringTag`.\n*\n* @param {*} v - input value\n* @returns {string} string value indicating a specification defined classification of the input value\n*\n* @example\n* var str = nativeClass( 'a' );\n* // returns '[object String]'\n*\n* @example\n* var str = nativeClass( 5 );\n* // returns '[object Number]'\n*\n* @example\n* function Beep() {\n* return this;\n* }\n* var str = nativeClass( new Beep() );\n* // returns '[object Object]'\n*/\nfunction nativeClass( v ) {\n\tvar isOwn;\n\tvar tag;\n\tvar out;\n\n\tif ( v === null || v === void 0 ) {\n\t\treturn toStr.call( v );\n\t}\n\ttag = v[ toStringTag ];\n\tisOwn = hasOwnProp( v, toStringTag );\n\n\t// Attempt to override the `toStringTag` property. For built-ins having a `Symbol.toStringTag` property (e.g., `JSON`, `Math`, etc), the `Symbol.toStringTag` property is read-only (e.g., , so we need to wrap in a `try/catch`.\n\ttry {\n\t\tv[ toStringTag ] = void 0;\n\t} catch ( err ) { // eslint-disable-line no-unused-vars\n\t\treturn toStr.call( v );\n\t}\n\tout = toStr.call( v );\n\n\tif ( isOwn ) {\n\t\tv[ toStringTag ] = tag;\n\t} else {\n\t\tdelete v[ toStringTag ];\n\t}\n\treturn out;\n}\n\n\n// EXPORTS //\n\nmodule.exports = nativeClass;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar toStr = Object.prototype.toString;\n\n\n// EXPORTS //\n\nmodule.exports = toStr;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Symbol = require( '@stdlib/symbol-ctor' );\n\n\n// MAIN //\n\nvar toStrTag = ( typeof Symbol === 'function' ) ? Symbol.toStringTag : '';\n\n\n// EXPORTS //\n\nmodule.exports = toStrTag;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @module @stdlib/utils-noop\n*\n* @example\n* var noop = require( '@stdlib/utils-noop' );\n*\n* noop();\n* // ...does nothing.\n*/\n\n// MODULES //\n\nvar main = require( './main.js' );\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* No operation.\n*\n* @example\n* noop();\n* // ...does nothing.\n*/\nfunction noop() {\n\t// Empty function...\n}\n\n\n// EXPORTS //\n\nmodule.exports = noop;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar Object = require( '@stdlib/object-ctor' );\n\n\n// VARIABLES //\n\nvar propertySymbols = Object.getOwnPropertySymbols;\n\n\n// MAIN //\n\n/**\n* Returns an array of an object's own symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, this function returns an empty array if provided `undefined` or `null`, rather than throwing an error.\n*\n* @private\n* @param {*} value - input object\n* @returns {Array} a list of own symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n*/\nfunction getOwnPropertySymbols( value ) {\n\treturn propertySymbols( Object( value ) );\n}\n\n\n// EXPORTS //\n\nmodule.exports = getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\nvar bool = ( typeof Object.getOwnPropertySymbols !== 'undefined' );\n\n\n// EXPORTS //\n\nmodule.exports = bool;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Return an array of an object's own symbol properties.\n*\n* @module @stdlib/utils-property-symbols\n*\n* @example\n* var getOwnPropertySymbols = require( '@stdlib/utils-property-symbols' );\n*\n* var symbols = getOwnPropertySymbols( {} );\n*/\n\n// MODULES //\n\nvar HAS_BUILTIN = require( './has_builtin.js' );\nvar builtin = require( './builtin.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar main;\nif ( HAS_BUILTIN ) {\n\tmain = builtin;\n} else {\n\tmain = polyfill;\n}\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MAIN //\n\n/**\n* Returns an array of an object's own symbol properties.\n*\n* ## Notes\n*\n* - In contrast to the built-in `Object.getOwnPropertySymbols()`, this function returns an empty array if provided `undefined` or `null`, rather than throwing an error.\n*\n* @private\n* @param {*} value - input object\n* @returns {EmptyArray} a list of own symbol properties\n*\n* @example\n* var symbols = getOwnPropertySymbols( {} );\n* // returns []\n*/\nfunction getOwnPropertySymbols() {\n\treturn [];\n}\n\n\n// EXPORTS //\n\nmodule.exports = getOwnPropertySymbols;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar RE = require( './fixtures/re.js' );\nvar nodeList = require( './fixtures/nodelist.js' );\nvar typedarray = require( './fixtures/typedarray.js' );\n\n\n// MAIN //\n\n/**\n* Checks whether a polyfill is needed when using the `typeof` operator.\n*\n* @private\n* @returns {boolean} boolean indicating whether a polyfill is needed\n*/\nfunction check() {\n\tif (\n\t\t// Chrome 1-12 returns 'function' for regular expression instances (see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/typeof):\n\t\ttypeof RE === 'function' ||\n\n\t\t// Safari 8 returns 'object' for typed array and weak map constructors (underscore #1929):\n\t\ttypeof typedarray === 'object' ||\n\n\t\t// PhantomJS 1.9 returns 'function' for `NodeList` instances (underscore #2236):\n\t\ttypeof nodeList === 'function'\n\t) {\n\t\treturn true;\n\t}\n\treturn false;\n}\n\n\n// EXPORTS //\n\nmodule.exports = check;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar getGlobal = require( '@stdlib/utils-global' );\n\n\n// MAIN //\n\nvar root = getGlobal();\nvar nodeList = root.document && root.document.childNodes;\n\n\n// EXPORTS //\n\nmodule.exports = nodeList;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar RE = /./;\n\n\n// EXPORTS //\n\nmodule.exports = RE;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\nvar typedarray = Int8Array; // eslint-disable-line stdlib/require-globals\n\n\n// EXPORTS //\n\nmodule.exports = typedarray;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n/**\n* Determine a value's type.\n*\n* @module @stdlib/utils-type-of\n*\n* @example\n* var typeOf = require( '@stdlib/utils-type-of' );\n*\n* var str = typeOf( 'a' );\n* // returns 'string'\n*\n* str = typeOf( 5 );\n* // returns 'number'\n*/\n\n// MODULES //\n\nvar usePolyfill = require( './check.js' );\nvar builtin = require( './main.js' );\nvar polyfill = require( './polyfill.js' );\n\n\n// MAIN //\n\nvar main = ( usePolyfill() ) ? polyfill : builtin;\n\n\n// EXPORTS //\n\nmodule.exports = main;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\n\n\n// NOTES //\n\n/*\n* Built-in `typeof` operator behavior:\n*\n* ```text\n* typeof null => 'object'\n* typeof undefined => 'undefined'\n* typeof 'a' => 'string'\n* typeof 5 => 'number'\n* typeof NaN => 'number'\n* typeof true => 'boolean'\n* typeof false => 'boolean'\n* typeof {} => 'object'\n* typeof [] => 'object'\n* typeof function foo(){} => 'function'\n* typeof function* foo(){} => 'object'\n* typeof Symbol() => 'symbol'\n* ```\n*\n*/\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\tvar type;\n\n\t// Address `typeof null` => `object` (see http://wiki.ecmascript.org/doku.php?id=harmony:typeof_null):\n\tif ( v === null ) {\n\t\treturn 'null';\n\t}\n\ttype = typeof v;\n\n\t// If the `typeof` operator returned something other than `object`, we are done. Otherwise, we need to check for an internal class name or search for a constructor.\n\tif ( type === 'object' ) {\n\t\treturn ctorName( v ).toLowerCase();\n\t}\n\treturn type;\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeOf;\n","/**\n* @license Apache-2.0\n*\n* Copyright (c) 2018 The Stdlib Authors.\n*\n* Licensed under the Apache License, Version 2.0 (the \"License\");\n* you may not use this file except in compliance with the License.\n* You may obtain a copy of the License at\n*\n* http://www.apache.org/licenses/LICENSE-2.0\n*\n* Unless required by applicable law or agreed to in writing, software\n* distributed under the License is distributed on an \"AS IS\" BASIS,\n* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n* See the License for the specific language governing permissions and\n* limitations under the License.\n*/\n\n'use strict';\n\n// MODULES //\n\nvar ctorName = require( '@stdlib/utils-constructor-name' );\n\n\n// MAIN //\n\n/**\n* Determines a value's type.\n*\n* @param {*} v - input value\n* @returns {string} string indicating the value's type\n*/\nfunction typeOf( v ) {\n\treturn ctorName( v ).toLowerCase();\n}\n\n\n// EXPORTS //\n\nmodule.exports = typeOf;\n","/**\n * @license React\n * react-dom.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n/*\n Modernizr 3.0.0pre (Custom Build) | MIT\n*/\n'use strict';var aa=require(\"react\"),ca=require(\"scheduler\");function p(a){for(var b=\"https://reactjs.org/docs/error-decoder.html?invariant=\"+a,c=1;cb}return!1}function v(a,b,c,d,e,f,g){this.acceptsBooleans=2===b||3===b||4===b;this.attributeName=d;this.attributeNamespace=e;this.mustUseProperty=c;this.propertyName=a;this.type=b;this.sanitizeURL=f;this.removeEmptyString=g}var z={};\n\"children dangerouslySetInnerHTML defaultValue defaultChecked innerHTML suppressContentEditableWarning suppressHydrationWarning style\".split(\" \").forEach(function(a){z[a]=new v(a,0,!1,a,null,!1,!1)});[[\"acceptCharset\",\"accept-charset\"],[\"className\",\"class\"],[\"htmlFor\",\"for\"],[\"httpEquiv\",\"http-equiv\"]].forEach(function(a){var b=a[0];z[b]=new v(b,1,!1,a[1],null,!1,!1)});[\"contentEditable\",\"draggable\",\"spellCheck\",\"value\"].forEach(function(a){z[a]=new v(a,2,!1,a.toLowerCase(),null,!1,!1)});\n[\"autoReverse\",\"externalResourcesRequired\",\"focusable\",\"preserveAlpha\"].forEach(function(a){z[a]=new v(a,2,!1,a,null,!1,!1)});\"allowFullScreen async autoFocus autoPlay controls default defer disabled disablePictureInPicture disableRemotePlayback formNoValidate hidden loop noModule noValidate open playsInline readOnly required reversed scoped seamless itemScope\".split(\" \").forEach(function(a){z[a]=new v(a,3,!1,a.toLowerCase(),null,!1,!1)});\n[\"checked\",\"multiple\",\"muted\",\"selected\"].forEach(function(a){z[a]=new v(a,3,!0,a,null,!1,!1)});[\"capture\",\"download\"].forEach(function(a){z[a]=new v(a,4,!1,a,null,!1,!1)});[\"cols\",\"rows\",\"size\",\"span\"].forEach(function(a){z[a]=new v(a,6,!1,a,null,!1,!1)});[\"rowSpan\",\"start\"].forEach(function(a){z[a]=new v(a,5,!1,a.toLowerCase(),null,!1,!1)});var ra=/[\\-:]([a-z])/g;function sa(a){return a[1].toUpperCase()}\n\"accent-height alignment-baseline arabic-form baseline-shift cap-height clip-path clip-rule color-interpolation color-interpolation-filters color-profile color-rendering dominant-baseline enable-background fill-opacity fill-rule flood-color flood-opacity font-family font-size font-size-adjust font-stretch font-style font-variant font-weight glyph-name glyph-orientation-horizontal glyph-orientation-vertical horiz-adv-x horiz-origin-x image-rendering letter-spacing lighting-color marker-end marker-mid marker-start overline-position overline-thickness paint-order panose-1 pointer-events rendering-intent shape-rendering stop-color stop-opacity strikethrough-position strikethrough-thickness stroke-dasharray stroke-dashoffset stroke-linecap stroke-linejoin stroke-miterlimit stroke-opacity stroke-width text-anchor text-decoration text-rendering underline-position underline-thickness unicode-bidi unicode-range units-per-em v-alphabetic v-hanging v-ideographic v-mathematical vector-effect vert-adv-y vert-origin-x vert-origin-y word-spacing writing-mode xmlns:xlink x-height\".split(\" \").forEach(function(a){var b=a.replace(ra,\nsa);z[b]=new v(b,1,!1,a,null,!1,!1)});\"xlink:actuate xlink:arcrole xlink:role xlink:show xlink:title xlink:type\".split(\" \").forEach(function(a){var b=a.replace(ra,sa);z[b]=new v(b,1,!1,a,\"http://www.w3.org/1999/xlink\",!1,!1)});[\"xml:base\",\"xml:lang\",\"xml:space\"].forEach(function(a){var b=a.replace(ra,sa);z[b]=new v(b,1,!1,a,\"http://www.w3.org/XML/1998/namespace\",!1,!1)});[\"tabIndex\",\"crossOrigin\"].forEach(function(a){z[a]=new v(a,1,!1,a.toLowerCase(),null,!1,!1)});\nz.xlinkHref=new v(\"xlinkHref\",1,!1,\"xlink:href\",\"http://www.w3.org/1999/xlink\",!0,!1);[\"src\",\"href\",\"action\",\"formAction\"].forEach(function(a){z[a]=new v(a,1,!1,a.toLowerCase(),null,!0,!0)});\nfunction ta(a,b,c,d){var e=z.hasOwnProperty(b)?z[b]:null;if(null!==e?0!==e.type:d||!(2h||e[g]!==f[h]){var k=\"\\n\"+e[g].replace(\" at new \",\" at \");a.displayName&&k.includes(\"\")&&(k=k.replace(\"\",a.displayName));return k}while(1<=g&&0<=h)}break}}}finally{Na=!1,Error.prepareStackTrace=c}return(a=a?a.displayName||a.name:\"\")?Ma(a):\"\"}\nfunction Pa(a){switch(a.tag){case 5:return Ma(a.type);case 16:return Ma(\"Lazy\");case 13:return Ma(\"Suspense\");case 19:return Ma(\"SuspenseList\");case 0:case 2:case 15:return a=Oa(a.type,!1),a;case 11:return a=Oa(a.type.render,!1),a;case 1:return a=Oa(a.type,!0),a;default:return\"\"}}\nfunction Qa(a){if(null==a)return null;if(\"function\"===typeof a)return a.displayName||a.name||null;if(\"string\"===typeof a)return a;switch(a){case ya:return\"Fragment\";case wa:return\"Portal\";case Aa:return\"Profiler\";case za:return\"StrictMode\";case Ea:return\"Suspense\";case Fa:return\"SuspenseList\"}if(\"object\"===typeof a)switch(a.$$typeof){case Ca:return(a.displayName||\"Context\")+\".Consumer\";case Ba:return(a._context.displayName||\"Context\")+\".Provider\";case Da:var b=a.render;a=a.displayName;a||(a=b.displayName||\nb.name||\"\",a=\"\"!==a?\"ForwardRef(\"+a+\")\":\"ForwardRef\");return a;case Ga:return b=a.displayName||null,null!==b?b:Qa(a.type)||\"Memo\";case Ha:b=a._payload;a=a._init;try{return Qa(a(b))}catch(c){}}return null}\nfunction Ra(a){var b=a.type;switch(a.tag){case 24:return\"Cache\";case 9:return(b.displayName||\"Context\")+\".Consumer\";case 10:return(b._context.displayName||\"Context\")+\".Provider\";case 18:return\"DehydratedFragment\";case 11:return a=b.render,a=a.displayName||a.name||\"\",b.displayName||(\"\"!==a?\"ForwardRef(\"+a+\")\":\"ForwardRef\");case 7:return\"Fragment\";case 5:return b;case 4:return\"Portal\";case 3:return\"Root\";case 6:return\"Text\";case 16:return Qa(b);case 8:return b===za?\"StrictMode\":\"Mode\";case 22:return\"Offscreen\";\ncase 12:return\"Profiler\";case 21:return\"Scope\";case 13:return\"Suspense\";case 19:return\"SuspenseList\";case 25:return\"TracingMarker\";case 1:case 0:case 17:case 2:case 14:case 15:if(\"function\"===typeof b)return b.displayName||b.name||null;if(\"string\"===typeof b)return b}return null}function Sa(a){switch(typeof a){case \"boolean\":case \"number\":case \"string\":case \"undefined\":return a;case \"object\":return a;default:return\"\"}}\nfunction Ta(a){var b=a.type;return(a=a.nodeName)&&\"input\"===a.toLowerCase()&&(\"checkbox\"===b||\"radio\"===b)}\nfunction Ua(a){var b=Ta(a)?\"checked\":\"value\",c=Object.getOwnPropertyDescriptor(a.constructor.prototype,b),d=\"\"+a[b];if(!a.hasOwnProperty(b)&&\"undefined\"!==typeof c&&\"function\"===typeof c.get&&\"function\"===typeof c.set){var e=c.get,f=c.set;Object.defineProperty(a,b,{configurable:!0,get:function(){return e.call(this)},set:function(a){d=\"\"+a;f.call(this,a)}});Object.defineProperty(a,b,{enumerable:c.enumerable});return{getValue:function(){return d},setValue:function(a){d=\"\"+a},stopTracking:function(){a._valueTracker=\nnull;delete a[b]}}}}function Va(a){a._valueTracker||(a._valueTracker=Ua(a))}function Wa(a){if(!a)return!1;var b=a._valueTracker;if(!b)return!0;var c=b.getValue();var d=\"\";a&&(d=Ta(a)?a.checked?\"true\":\"false\":a.value);a=d;return a!==c?(b.setValue(a),!0):!1}function Xa(a){a=a||(\"undefined\"!==typeof document?document:void 0);if(\"undefined\"===typeof a)return null;try{return a.activeElement||a.body}catch(b){return a.body}}\nfunction Ya(a,b){var c=b.checked;return A({},b,{defaultChecked:void 0,defaultValue:void 0,value:void 0,checked:null!=c?c:a._wrapperState.initialChecked})}function Za(a,b){var c=null==b.defaultValue?\"\":b.defaultValue,d=null!=b.checked?b.checked:b.defaultChecked;c=Sa(null!=b.value?b.value:c);a._wrapperState={initialChecked:d,initialValue:c,controlled:\"checkbox\"===b.type||\"radio\"===b.type?null!=b.checked:null!=b.value}}function ab(a,b){b=b.checked;null!=b&&ta(a,\"checked\",b,!1)}\nfunction bb(a,b){ab(a,b);var c=Sa(b.value),d=b.type;if(null!=c)if(\"number\"===d){if(0===c&&\"\"===a.value||a.value!=c)a.value=\"\"+c}else a.value!==\"\"+c&&(a.value=\"\"+c);else if(\"submit\"===d||\"reset\"===d){a.removeAttribute(\"value\");return}b.hasOwnProperty(\"value\")?cb(a,b.type,c):b.hasOwnProperty(\"defaultValue\")&&cb(a,b.type,Sa(b.defaultValue));null==b.checked&&null!=b.defaultChecked&&(a.defaultChecked=!!b.defaultChecked)}\nfunction db(a,b,c){if(b.hasOwnProperty(\"value\")||b.hasOwnProperty(\"defaultValue\")){var d=b.type;if(!(\"submit\"!==d&&\"reset\"!==d||void 0!==b.value&&null!==b.value))return;b=\"\"+a._wrapperState.initialValue;c||b===a.value||(a.value=b);a.defaultValue=b}c=a.name;\"\"!==c&&(a.name=\"\");a.defaultChecked=!!a._wrapperState.initialChecked;\"\"!==c&&(a.name=c)}\nfunction cb(a,b,c){if(\"number\"!==b||Xa(a.ownerDocument)!==a)null==c?a.defaultValue=\"\"+a._wrapperState.initialValue:a.defaultValue!==\"\"+c&&(a.defaultValue=\"\"+c)}var eb=Array.isArray;\nfunction fb(a,b,c,d){a=a.options;if(b){b={};for(var e=0;e\"+b.valueOf().toString()+\"\";for(b=mb.firstChild;a.firstChild;)a.removeChild(a.firstChild);for(;b.firstChild;)a.appendChild(b.firstChild)}});\nfunction ob(a,b){if(b){var c=a.firstChild;if(c&&c===a.lastChild&&3===c.nodeType){c.nodeValue=b;return}}a.textContent=b}\nvar pb={animationIterationCount:!0,aspectRatio:!0,borderImageOutset:!0,borderImageSlice:!0,borderImageWidth:!0,boxFlex:!0,boxFlexGroup:!0,boxOrdinalGroup:!0,columnCount:!0,columns:!0,flex:!0,flexGrow:!0,flexPositive:!0,flexShrink:!0,flexNegative:!0,flexOrder:!0,gridArea:!0,gridRow:!0,gridRowEnd:!0,gridRowSpan:!0,gridRowStart:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnSpan:!0,gridColumnStart:!0,fontWeight:!0,lineClamp:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,tabSize:!0,widows:!0,zIndex:!0,\nzoom:!0,fillOpacity:!0,floodOpacity:!0,stopOpacity:!0,strokeDasharray:!0,strokeDashoffset:!0,strokeMiterlimit:!0,strokeOpacity:!0,strokeWidth:!0},qb=[\"Webkit\",\"ms\",\"Moz\",\"O\"];Object.keys(pb).forEach(function(a){qb.forEach(function(b){b=b+a.charAt(0).toUpperCase()+a.substring(1);pb[b]=pb[a]})});function rb(a,b,c){return null==b||\"boolean\"===typeof b||\"\"===b?\"\":c||\"number\"!==typeof b||0===b||pb.hasOwnProperty(a)&&pb[a]?(\"\"+b).trim():b+\"px\"}\nfunction sb(a,b){a=a.style;for(var c in b)if(b.hasOwnProperty(c)){var d=0===c.indexOf(\"--\"),e=rb(c,b[c],d);\"float\"===c&&(c=\"cssFloat\");d?a.setProperty(c,e):a[c]=e}}var tb=A({menuitem:!0},{area:!0,base:!0,br:!0,col:!0,embed:!0,hr:!0,img:!0,input:!0,keygen:!0,link:!0,meta:!0,param:!0,source:!0,track:!0,wbr:!0});\nfunction ub(a,b){if(b){if(tb[a]&&(null!=b.children||null!=b.dangerouslySetInnerHTML))throw Error(p(137,a));if(null!=b.dangerouslySetInnerHTML){if(null!=b.children)throw Error(p(60));if(\"object\"!==typeof b.dangerouslySetInnerHTML||!(\"__html\"in b.dangerouslySetInnerHTML))throw Error(p(61));}if(null!=b.style&&\"object\"!==typeof b.style)throw Error(p(62));}}\nfunction vb(a,b){if(-1===a.indexOf(\"-\"))return\"string\"===typeof b.is;switch(a){case \"annotation-xml\":case \"color-profile\":case \"font-face\":case \"font-face-src\":case \"font-face-uri\":case \"font-face-format\":case \"font-face-name\":case \"missing-glyph\":return!1;default:return!0}}var wb=null;function xb(a){a=a.target||a.srcElement||window;a.correspondingUseElement&&(a=a.correspondingUseElement);return 3===a.nodeType?a.parentNode:a}var yb=null,zb=null,Ab=null;\nfunction Bb(a){if(a=Cb(a)){if(\"function\"!==typeof yb)throw Error(p(280));var b=a.stateNode;b&&(b=Db(b),yb(a.stateNode,a.type,b))}}function Eb(a){zb?Ab?Ab.push(a):Ab=[a]:zb=a}function Fb(){if(zb){var a=zb,b=Ab;Ab=zb=null;Bb(a);if(b)for(a=0;a>>=0;return 0===a?32:31-(pc(a)/qc|0)|0}var rc=64,sc=4194304;\nfunction tc(a){switch(a&-a){case 1:return 1;case 2:return 2;case 4:return 4;case 8:return 8;case 16:return 16;case 32:return 32;case 64:case 128:case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:return a&4194240;case 4194304:case 8388608:case 16777216:case 33554432:case 67108864:return a&130023424;case 134217728:return 134217728;case 268435456:return 268435456;case 536870912:return 536870912;case 1073741824:return 1073741824;\ndefault:return a}}function uc(a,b){var c=a.pendingLanes;if(0===c)return 0;var d=0,e=a.suspendedLanes,f=a.pingedLanes,g=c&268435455;if(0!==g){var h=g&~e;0!==h?d=tc(h):(f&=g,0!==f&&(d=tc(f)))}else g=c&~e,0!==g?d=tc(g):0!==f&&(d=tc(f));if(0===d)return 0;if(0!==b&&b!==d&&0===(b&e)&&(e=d&-d,f=b&-b,e>=f||16===e&&0!==(f&4194240)))return b;0!==(d&4)&&(d|=c&16);b=a.entangledLanes;if(0!==b)for(a=a.entanglements,b&=d;0c;c++)b.push(a);return b}\nfunction Ac(a,b,c){a.pendingLanes|=b;536870912!==b&&(a.suspendedLanes=0,a.pingedLanes=0);a=a.eventTimes;b=31-oc(b);a[b]=c}function Bc(a,b){var c=a.pendingLanes&~b;a.pendingLanes=b;a.suspendedLanes=0;a.pingedLanes=0;a.expiredLanes&=b;a.mutableReadLanes&=b;a.entangledLanes&=b;b=a.entanglements;var d=a.eventTimes;for(a=a.expirationTimes;0=be),ee=String.fromCharCode(32),fe=!1;\nfunction ge(a,b){switch(a){case \"keyup\":return-1!==$d.indexOf(b.keyCode);case \"keydown\":return 229!==b.keyCode;case \"keypress\":case \"mousedown\":case \"focusout\":return!0;default:return!1}}function he(a){a=a.detail;return\"object\"===typeof a&&\"data\"in a?a.data:null}var ie=!1;function je(a,b){switch(a){case \"compositionend\":return he(b);case \"keypress\":if(32!==b.which)return null;fe=!0;return ee;case \"textInput\":return a=b.data,a===ee&&fe?null:a;default:return null}}\nfunction ke(a,b){if(ie)return\"compositionend\"===a||!ae&&ge(a,b)?(a=nd(),md=ld=kd=null,ie=!1,a):null;switch(a){case \"paste\":return null;case \"keypress\":if(!(b.ctrlKey||b.altKey||b.metaKey)||b.ctrlKey&&b.altKey){if(b.char&&1=b)return{node:c,offset:b-a};a=d}a:{for(;c;){if(c.nextSibling){c=c.nextSibling;break a}c=c.parentNode}c=void 0}c=Je(c)}}function Le(a,b){return a&&b?a===b?!0:a&&3===a.nodeType?!1:b&&3===b.nodeType?Le(a,b.parentNode):\"contains\"in a?a.contains(b):a.compareDocumentPosition?!!(a.compareDocumentPosition(b)&16):!1:!1}\nfunction Me(){for(var a=window,b=Xa();b instanceof a.HTMLIFrameElement;){try{var c=\"string\"===typeof b.contentWindow.location.href}catch(d){c=!1}if(c)a=b.contentWindow;else break;b=Xa(a.document)}return b}function Ne(a){var b=a&&a.nodeName&&a.nodeName.toLowerCase();return b&&(\"input\"===b&&(\"text\"===a.type||\"search\"===a.type||\"tel\"===a.type||\"url\"===a.type||\"password\"===a.type)||\"textarea\"===b||\"true\"===a.contentEditable)}\nfunction Oe(a){var b=Me(),c=a.focusedElem,d=a.selectionRange;if(b!==c&&c&&c.ownerDocument&&Le(c.ownerDocument.documentElement,c)){if(null!==d&&Ne(c))if(b=d.start,a=d.end,void 0===a&&(a=b),\"selectionStart\"in c)c.selectionStart=b,c.selectionEnd=Math.min(a,c.value.length);else if(a=(b=c.ownerDocument||document)&&b.defaultView||window,a.getSelection){a=a.getSelection();var e=c.textContent.length,f=Math.min(d.start,e);d=void 0===d.end?f:Math.min(d.end,e);!a.extend&&f>d&&(e=d,d=f,f=e);e=Ke(c,f);var g=Ke(c,\nd);e&&g&&(1!==a.rangeCount||a.anchorNode!==e.node||a.anchorOffset!==e.offset||a.focusNode!==g.node||a.focusOffset!==g.offset)&&(b=b.createRange(),b.setStart(e.node,e.offset),a.removeAllRanges(),f>d?(a.addRange(b),a.extend(g.node,g.offset)):(b.setEnd(g.node,g.offset),a.addRange(b)))}b=[];for(a=c;a=a.parentNode;)1===a.nodeType&&b.push({element:a,left:a.scrollLeft,top:a.scrollTop});\"function\"===typeof c.focus&&c.focus();for(c=0;c=document.documentMode,Qe=null,Re=null,Se=null,Te=!1;\nfunction Ue(a,b,c){var d=c.window===c?c.document:9===c.nodeType?c:c.ownerDocument;Te||null==Qe||Qe!==Xa(d)||(d=Qe,\"selectionStart\"in d&&Ne(d)?d={start:d.selectionStart,end:d.selectionEnd}:(d=(d.ownerDocument&&d.ownerDocument.defaultView||window).getSelection(),d={anchorNode:d.anchorNode,anchorOffset:d.anchorOffset,focusNode:d.focusNode,focusOffset:d.focusOffset}),Se&&Ie(Se,d)||(Se=d,d=oe(Re,\"onSelect\"),0Tf||(a.current=Sf[Tf],Sf[Tf]=null,Tf--)}function G(a,b){Tf++;Sf[Tf]=a.current;a.current=b}var Vf={},H=Uf(Vf),Wf=Uf(!1),Xf=Vf;function Yf(a,b){var c=a.type.contextTypes;if(!c)return Vf;var d=a.stateNode;if(d&&d.__reactInternalMemoizedUnmaskedChildContext===b)return d.__reactInternalMemoizedMaskedChildContext;var e={},f;for(f in c)e[f]=b[f];d&&(a=a.stateNode,a.__reactInternalMemoizedUnmaskedChildContext=b,a.__reactInternalMemoizedMaskedChildContext=e);return e}\nfunction Zf(a){a=a.childContextTypes;return null!==a&&void 0!==a}function $f(){E(Wf);E(H)}function ag(a,b,c){if(H.current!==Vf)throw Error(p(168));G(H,b);G(Wf,c)}function bg(a,b,c){var d=a.stateNode;b=b.childContextTypes;if(\"function\"!==typeof d.getChildContext)return c;d=d.getChildContext();for(var e in d)if(!(e in b))throw Error(p(108,Ra(a)||\"Unknown\",e));return A({},c,d)}\nfunction cg(a){a=(a=a.stateNode)&&a.__reactInternalMemoizedMergedChildContext||Vf;Xf=H.current;G(H,a);G(Wf,Wf.current);return!0}function dg(a,b,c){var d=a.stateNode;if(!d)throw Error(p(169));c?(a=bg(a,b,Xf),d.__reactInternalMemoizedMergedChildContext=a,E(Wf),E(H),G(H,a)):E(Wf);G(Wf,c)}var eg=null,fg=!1,gg=!1;function hg(a){null===eg?eg=[a]:eg.push(a)}function ig(a){fg=!0;hg(a)}\nfunction jg(){if(!gg&&null!==eg){gg=!0;var a=0,b=C;try{var c=eg;for(C=1;a>=g;e-=g;rg=1<<32-oc(b)+e|c<w?(x=u,u=null):x=u.sibling;var n=r(e,u,h[w],k);if(null===n){null===u&&(u=x);break}a&&u&&null===n.alternate&&b(e,u);g=f(n,g,w);null===m?l=n:m.sibling=n;m=n;u=x}if(w===h.length)return c(e,u),I&&tg(e,w),l;if(null===u){for(;ww?(x=m,m=null):x=m.sibling;var t=r(e,m,n.value,k);if(null===t){null===m&&(m=x);break}a&&m&&null===t.alternate&&b(e,m);g=f(t,g,w);null===u?l=t:u.sibling=t;u=t;m=x}if(n.done)return c(e,\nm),I&&tg(e,w),l;if(null===m){for(;!n.done;w++,n=h.next())n=q(e,n.value,k),null!==n&&(g=f(n,g,w),null===u?l=n:u.sibling=n,u=n);I&&tg(e,w);return l}for(m=d(e,m);!n.done;w++,n=h.next())n=y(m,e,w,n.value,k),null!==n&&(a&&null!==n.alternate&&m.delete(null===n.key?w:n.key),g=f(n,g,w),null===u?l=n:u.sibling=n,u=n);a&&m.forEach(function(a){return b(e,a)});I&&tg(e,w);return l}function J(a,d,f,h){\"object\"===typeof f&&null!==f&&f.type===ya&&null===f.key&&(f=f.props.children);if(\"object\"===typeof f&&null!==f){switch(f.$$typeof){case va:a:{for(var k=\nf.key,l=d;null!==l;){if(l.key===k){k=f.type;if(k===ya){if(7===l.tag){c(a,l.sibling);d=e(l,f.props.children);d.return=a;a=d;break a}}else if(l.elementType===k||\"object\"===typeof k&&null!==k&&k.$$typeof===Ha&&uh(k)===l.type){c(a,l.sibling);d=e(l,f.props);d.ref=sh(a,l,f);d.return=a;a=d;break a}c(a,l);break}else b(a,l);l=l.sibling}f.type===ya?(d=Ah(f.props.children,a.mode,h,f.key),d.return=a,a=d):(h=yh(f.type,f.key,f.props,null,a.mode,h),h.ref=sh(a,d,f),h.return=a,a=h)}return g(a);case wa:a:{for(l=f.key;null!==\nd;){if(d.key===l)if(4===d.tag&&d.stateNode.containerInfo===f.containerInfo&&d.stateNode.implementation===f.implementation){c(a,d.sibling);d=e(d,f.children||[]);d.return=a;a=d;break a}else{c(a,d);break}else b(a,d);d=d.sibling}d=zh(f,a.mode,h);d.return=a;a=d}return g(a);case Ha:return l=f._init,J(a,d,l(f._payload),h)}if(eb(f))return n(a,d,f,h);if(Ka(f))return t(a,d,f,h);th(a,f)}return\"string\"===typeof f&&\"\"!==f||\"number\"===typeof f?(f=\"\"+f,null!==d&&6===d.tag?(c(a,d.sibling),d=e(d,f),d.return=a,a=d):\n(c(a,d),d=xh(f,a.mode,h),d.return=a,a=d),g(a)):c(a,d)}return J}var Bh=vh(!0),Ch=vh(!1),Dh={},Eh=Uf(Dh),Fh=Uf(Dh),Gh=Uf(Dh);function Hh(a){if(a===Dh)throw Error(p(174));return a}function Ih(a,b){G(Gh,b);G(Fh,a);G(Eh,Dh);a=b.nodeType;switch(a){case 9:case 11:b=(b=b.documentElement)?b.namespaceURI:lb(null,\"\");break;default:a=8===a?b.parentNode:b,b=a.namespaceURI||null,a=a.tagName,b=lb(b,a)}E(Eh);G(Eh,b)}function Jh(){E(Eh);E(Fh);E(Gh)}\nfunction Kh(a){Hh(Gh.current);var b=Hh(Eh.current);var c=lb(b,a.type);b!==c&&(G(Fh,a),G(Eh,c))}function Lh(a){Fh.current===a&&(E(Eh),E(Fh))}var M=Uf(0);\nfunction Mh(a){for(var b=a;null!==b;){if(13===b.tag){var c=b.memoizedState;if(null!==c&&(c=c.dehydrated,null===c||\"$?\"===c.data||\"$!\"===c.data))return b}else if(19===b.tag&&void 0!==b.memoizedProps.revealOrder){if(0!==(b.flags&128))return b}else if(null!==b.child){b.child.return=b;b=b.child;continue}if(b===a)break;for(;null===b.sibling;){if(null===b.return||b.return===a)return null;b=b.return}b.sibling.return=b.return;b=b.sibling}return null}var Nh=[];\nfunction Oh(){for(var a=0;ac?c:4;a(!0);var d=Qh.transition;Qh.transition={};try{a(!1),b()}finally{C=c,Qh.transition=d}}function Fi(){return di().memoizedState}\nfunction Gi(a,b,c){var d=lh(a);c={lane:d,action:c,hasEagerState:!1,eagerState:null,next:null};if(Hi(a))Ii(b,c);else if(c=Yg(a,b,c,d),null!==c){var e=L();mh(c,a,d,e);Ji(c,b,d)}}\nfunction ri(a,b,c){var d=lh(a),e={lane:d,action:c,hasEagerState:!1,eagerState:null,next:null};if(Hi(a))Ii(b,e);else{var f=a.alternate;if(0===a.lanes&&(null===f||0===f.lanes)&&(f=b.lastRenderedReducer,null!==f))try{var g=b.lastRenderedState,h=f(g,c);e.hasEagerState=!0;e.eagerState=h;if(He(h,g)){var k=b.interleaved;null===k?(e.next=e,Xg(b)):(e.next=k.next,k.next=e);b.interleaved=e;return}}catch(l){}finally{}c=Yg(a,b,e,d);null!==c&&(e=L(),mh(c,a,d,e),Ji(c,b,d))}}\nfunction Hi(a){var b=a.alternate;return a===N||null!==b&&b===N}function Ii(a,b){Th=Sh=!0;var c=a.pending;null===c?b.next=b:(b.next=c.next,c.next=b);a.pending=b}function Ji(a,b,c){if(0!==(c&4194240)){var d=b.lanes;d&=a.pendingLanes;c|=d;b.lanes=c;Cc(a,c)}}\nvar ai={readContext:Vg,useCallback:Q,useContext:Q,useEffect:Q,useImperativeHandle:Q,useInsertionEffect:Q,useLayoutEffect:Q,useMemo:Q,useReducer:Q,useRef:Q,useState:Q,useDebugValue:Q,useDeferredValue:Q,useTransition:Q,useMutableSource:Q,useSyncExternalStore:Q,useId:Q,unstable_isNewReconciler:!1},Yh={readContext:Vg,useCallback:function(a,b){ci().memoizedState=[a,void 0===b?null:b];return a},useContext:Vg,useEffect:vi,useImperativeHandle:function(a,b,c){c=null!==c&&void 0!==c?c.concat([a]):null;return ti(4194308,\n4,yi.bind(null,b,a),c)},useLayoutEffect:function(a,b){return ti(4194308,4,a,b)},useInsertionEffect:function(a,b){return ti(4,2,a,b)},useMemo:function(a,b){var c=ci();b=void 0===b?null:b;a=a();c.memoizedState=[a,b];return a},useReducer:function(a,b,c){var d=ci();b=void 0!==c?c(b):b;d.memoizedState=d.baseState=b;a={pending:null,interleaved:null,lanes:0,dispatch:null,lastRenderedReducer:a,lastRenderedState:b};d.queue=a;a=a.dispatch=Gi.bind(null,N,a);return[d.memoizedState,a]},useRef:function(a){var b=\nci();a={current:a};return b.memoizedState=a},useState:qi,useDebugValue:Ai,useDeferredValue:function(a){return ci().memoizedState=a},useTransition:function(){var a=qi(!1),b=a[0];a=Ei.bind(null,a[1]);ci().memoizedState=a;return[b,a]},useMutableSource:function(){},useSyncExternalStore:function(a,b,c){var d=N,e=ci();if(I){if(void 0===c)throw Error(p(407));c=c()}else{c=b();if(null===R)throw Error(p(349));0!==(Rh&30)||ni(d,b,c)}e.memoizedState=c;var f={value:c,getSnapshot:b};e.queue=f;vi(ki.bind(null,d,\nf,a),[a]);d.flags|=2048;li(9,mi.bind(null,d,f,c,b),void 0,null);return c},useId:function(){var a=ci(),b=R.identifierPrefix;if(I){var c=sg;var d=rg;c=(d&~(1<<32-oc(d)-1)).toString(32)+c;b=\":\"+b+\"R\"+c;c=Uh++;0\\x3c/script>\",a=a.removeChild(a.firstChild)):\n\"string\"===typeof d.is?a=g.createElement(c,{is:d.is}):(a=g.createElement(c),\"select\"===c&&(g=a,d.multiple?g.multiple=!0:d.size&&(g.size=d.size))):a=g.createElementNS(a,c);a[Of]=b;a[Pf]=d;Aj(a,b,!1,!1);b.stateNode=a;a:{g=vb(c,d);switch(c){case \"dialog\":D(\"cancel\",a);D(\"close\",a);e=d;break;case \"iframe\":case \"object\":case \"embed\":D(\"load\",a);e=d;break;case \"video\":case \"audio\":for(e=0;eHj&&(b.flags|=128,d=!0,Ej(f,!1),b.lanes=4194304)}else{if(!d)if(a=Mh(g),null!==a){if(b.flags|=128,d=!0,c=a.updateQueue,null!==c&&(b.updateQueue=c,b.flags|=4),Ej(f,!0),null===f.tail&&\"hidden\"===f.tailMode&&!g.alternate&&!I)return S(b),null}else 2*B()-f.renderingStartTime>Hj&&1073741824!==c&&(b.flags|=128,d=!0,Ej(f,!1),b.lanes=4194304);f.isBackwards?(g.sibling=b.child,b.child=g):(c=f.last,null!==c?c.sibling=g:b.child=g,f.last=g)}if(null!==f.tail)return b=f.tail,f.rendering=\nb,f.tail=b.sibling,f.renderingStartTime=B(),b.sibling=null,c=M.current,G(M,d?c&1|2:c&1),b;S(b);return null;case 22:case 23:return Ij(),d=null!==b.memoizedState,null!==a&&null!==a.memoizedState!==d&&(b.flags|=8192),d&&0!==(b.mode&1)?0!==(gj&1073741824)&&(S(b),b.subtreeFlags&6&&(b.flags|=8192)):S(b),null;case 24:return null;case 25:return null}throw Error(p(156,b.tag));}\nfunction Jj(a,b){wg(b);switch(b.tag){case 1:return Zf(b.type)&&$f(),a=b.flags,a&65536?(b.flags=a&-65537|128,b):null;case 3:return Jh(),E(Wf),E(H),Oh(),a=b.flags,0!==(a&65536)&&0===(a&128)?(b.flags=a&-65537|128,b):null;case 5:return Lh(b),null;case 13:E(M);a=b.memoizedState;if(null!==a&&null!==a.dehydrated){if(null===b.alternate)throw Error(p(340));Ig()}a=b.flags;return a&65536?(b.flags=a&-65537|128,b):null;case 19:return E(M),null;case 4:return Jh(),null;case 10:return Rg(b.type._context),null;case 22:case 23:return Ij(),\nnull;case 24:return null;default:return null}}var Kj=!1,U=!1,Lj=\"function\"===typeof WeakSet?WeakSet:Set,V=null;function Mj(a,b){var c=a.ref;if(null!==c)if(\"function\"===typeof c)try{c(null)}catch(d){W(a,b,d)}else c.current=null}function Nj(a,b,c){try{c()}catch(d){W(a,b,d)}}var Oj=!1;\nfunction Pj(a,b){Cf=dd;a=Me();if(Ne(a)){if(\"selectionStart\"in a)var c={start:a.selectionStart,end:a.selectionEnd};else a:{c=(c=a.ownerDocument)&&c.defaultView||window;var d=c.getSelection&&c.getSelection();if(d&&0!==d.rangeCount){c=d.anchorNode;var e=d.anchorOffset,f=d.focusNode;d=d.focusOffset;try{c.nodeType,f.nodeType}catch(F){c=null;break a}var g=0,h=-1,k=-1,l=0,m=0,q=a,r=null;b:for(;;){for(var y;;){q!==c||0!==e&&3!==q.nodeType||(h=g+e);q!==f||0!==d&&3!==q.nodeType||(k=g+d);3===q.nodeType&&(g+=\nq.nodeValue.length);if(null===(y=q.firstChild))break;r=q;q=y}for(;;){if(q===a)break b;r===c&&++l===e&&(h=g);r===f&&++m===d&&(k=g);if(null!==(y=q.nextSibling))break;q=r;r=q.parentNode}q=y}c=-1===h||-1===k?null:{start:h,end:k}}else c=null}c=c||{start:0,end:0}}else c=null;Df={focusedElem:a,selectionRange:c};dd=!1;for(V=b;null!==V;)if(b=V,a=b.child,0!==(b.subtreeFlags&1028)&&null!==a)a.return=b,V=a;else for(;null!==V;){b=V;try{var n=b.alternate;if(0!==(b.flags&1024))switch(b.tag){case 0:case 11:case 15:break;\ncase 1:if(null!==n){var t=n.memoizedProps,J=n.memoizedState,x=b.stateNode,w=x.getSnapshotBeforeUpdate(b.elementType===b.type?t:Lg(b.type,t),J);x.__reactInternalSnapshotBeforeUpdate=w}break;case 3:var u=b.stateNode.containerInfo;1===u.nodeType?u.textContent=\"\":9===u.nodeType&&u.documentElement&&u.removeChild(u.documentElement);break;case 5:case 6:case 4:case 17:break;default:throw Error(p(163));}}catch(F){W(b,b.return,F)}a=b.sibling;if(null!==a){a.return=b.return;V=a;break}V=b.return}n=Oj;Oj=!1;return n}\nfunction Qj(a,b,c){var d=b.updateQueue;d=null!==d?d.lastEffect:null;if(null!==d){var e=d=d.next;do{if((e.tag&a)===a){var f=e.destroy;e.destroy=void 0;void 0!==f&&Nj(b,c,f)}e=e.next}while(e!==d)}}function Rj(a,b){b=b.updateQueue;b=null!==b?b.lastEffect:null;if(null!==b){var c=b=b.next;do{if((c.tag&a)===a){var d=c.create;c.destroy=d()}c=c.next}while(c!==b)}}function Sj(a){var b=a.ref;if(null!==b){var c=a.stateNode;switch(a.tag){case 5:a=c;break;default:a=c}\"function\"===typeof b?b(a):b.current=a}}\nfunction Tj(a){var b=a.alternate;null!==b&&(a.alternate=null,Tj(b));a.child=null;a.deletions=null;a.sibling=null;5===a.tag&&(b=a.stateNode,null!==b&&(delete b[Of],delete b[Pf],delete b[of],delete b[Qf],delete b[Rf]));a.stateNode=null;a.return=null;a.dependencies=null;a.memoizedProps=null;a.memoizedState=null;a.pendingProps=null;a.stateNode=null;a.updateQueue=null}function Uj(a){return 5===a.tag||3===a.tag||4===a.tag}\nfunction Vj(a){a:for(;;){for(;null===a.sibling;){if(null===a.return||Uj(a.return))return null;a=a.return}a.sibling.return=a.return;for(a=a.sibling;5!==a.tag&&6!==a.tag&&18!==a.tag;){if(a.flags&2)continue a;if(null===a.child||4===a.tag)continue a;else a.child.return=a,a=a.child}if(!(a.flags&2))return a.stateNode}}\nfunction Wj(a,b,c){var d=a.tag;if(5===d||6===d)a=a.stateNode,b?8===c.nodeType?c.parentNode.insertBefore(a,b):c.insertBefore(a,b):(8===c.nodeType?(b=c.parentNode,b.insertBefore(a,c)):(b=c,b.appendChild(a)),c=c._reactRootContainer,null!==c&&void 0!==c||null!==b.onclick||(b.onclick=Bf));else if(4!==d&&(a=a.child,null!==a))for(Wj(a,b,c),a=a.sibling;null!==a;)Wj(a,b,c),a=a.sibling}\nfunction Xj(a,b,c){var d=a.tag;if(5===d||6===d)a=a.stateNode,b?c.insertBefore(a,b):c.appendChild(a);else if(4!==d&&(a=a.child,null!==a))for(Xj(a,b,c),a=a.sibling;null!==a;)Xj(a,b,c),a=a.sibling}var X=null,Yj=!1;function Zj(a,b,c){for(c=c.child;null!==c;)ak(a,b,c),c=c.sibling}\nfunction ak(a,b,c){if(lc&&\"function\"===typeof lc.onCommitFiberUnmount)try{lc.onCommitFiberUnmount(kc,c)}catch(h){}switch(c.tag){case 5:U||Mj(c,b);case 6:var d=X,e=Yj;X=null;Zj(a,b,c);X=d;Yj=e;null!==X&&(Yj?(a=X,c=c.stateNode,8===a.nodeType?a.parentNode.removeChild(c):a.removeChild(c)):X.removeChild(c.stateNode));break;case 18:null!==X&&(Yj?(a=X,c=c.stateNode,8===a.nodeType?Kf(a.parentNode,c):1===a.nodeType&&Kf(a,c),bd(a)):Kf(X,c.stateNode));break;case 4:d=X;e=Yj;X=c.stateNode.containerInfo;Yj=!0;\nZj(a,b,c);X=d;Yj=e;break;case 0:case 11:case 14:case 15:if(!U&&(d=c.updateQueue,null!==d&&(d=d.lastEffect,null!==d))){e=d=d.next;do{var f=e,g=f.destroy;f=f.tag;void 0!==g&&(0!==(f&2)?Nj(c,b,g):0!==(f&4)&&Nj(c,b,g));e=e.next}while(e!==d)}Zj(a,b,c);break;case 1:if(!U&&(Mj(c,b),d=c.stateNode,\"function\"===typeof d.componentWillUnmount))try{d.props=c.memoizedProps,d.state=c.memoizedState,d.componentWillUnmount()}catch(h){W(c,b,h)}Zj(a,b,c);break;case 21:Zj(a,b,c);break;case 22:c.mode&1?(U=(d=U)||null!==\nc.memoizedState,Zj(a,b,c),U=d):Zj(a,b,c);break;default:Zj(a,b,c)}}function bk(a){var b=a.updateQueue;if(null!==b){a.updateQueue=null;var c=a.stateNode;null===c&&(c=a.stateNode=new Lj);b.forEach(function(b){var d=ck.bind(null,a,b);c.has(b)||(c.add(b),b.then(d,d))})}}\nfunction dk(a,b){var c=b.deletions;if(null!==c)for(var d=0;de&&(e=g);d&=~f}d=e;d=B()-d;d=(120>d?120:480>d?480:1080>d?1080:1920>d?1920:3E3>d?3E3:4320>d?4320:1960*mk(d/1960))-d;if(10a?16:a;if(null===xk)var d=!1;else{a=xk;xk=null;yk=0;if(0!==(K&6))throw Error(p(331));var e=K;K|=4;for(V=a.current;null!==V;){var f=V,g=f.child;if(0!==(V.flags&16)){var h=f.deletions;if(null!==h){for(var k=0;kB()-gk?Lk(a,0):sk|=c);Ek(a,b)}function Zk(a,b){0===b&&(0===(a.mode&1)?b=1:(b=sc,sc<<=1,0===(sc&130023424)&&(sc=4194304)));var c=L();a=Zg(a,b);null!==a&&(Ac(a,b,c),Ek(a,c))}function vj(a){var b=a.memoizedState,c=0;null!==b&&(c=b.retryLane);Zk(a,c)}\nfunction ck(a,b){var c=0;switch(a.tag){case 13:var d=a.stateNode;var e=a.memoizedState;null!==e&&(c=e.retryLane);break;case 19:d=a.stateNode;break;default:throw Error(p(314));}null!==d&&d.delete(b);Zk(a,c)}var Wk;\nWk=function(a,b,c){if(null!==a)if(a.memoizedProps!==b.pendingProps||Wf.current)Ug=!0;else{if(0===(a.lanes&c)&&0===(b.flags&128))return Ug=!1,zj(a,b,c);Ug=0!==(a.flags&131072)?!0:!1}else Ug=!1,I&&0!==(b.flags&1048576)&&ug(b,ng,b.index);b.lanes=0;switch(b.tag){case 2:var d=b.type;jj(a,b);a=b.pendingProps;var e=Yf(b,H.current);Tg(b,c);e=Xh(null,b,d,a,e,c);var f=bi();b.flags|=1;\"object\"===typeof e&&null!==e&&\"function\"===typeof e.render&&void 0===e.$$typeof?(b.tag=1,b.memoizedState=null,b.updateQueue=\nnull,Zf(d)?(f=!0,cg(b)):f=!1,b.memoizedState=null!==e.state&&void 0!==e.state?e.state:null,ah(b),e.updater=nh,b.stateNode=e,e._reactInternals=b,rh(b,d,a,c),b=kj(null,b,d,!0,f,c)):(b.tag=0,I&&f&&vg(b),Yi(null,b,e,c),b=b.child);return b;case 16:d=b.elementType;a:{jj(a,b);a=b.pendingProps;e=d._init;d=e(d._payload);b.type=d;e=b.tag=$k(d);a=Lg(d,a);switch(e){case 0:b=dj(null,b,d,a,c);break a;case 1:b=ij(null,b,d,a,c);break a;case 11:b=Zi(null,b,d,a,c);break a;case 14:b=aj(null,b,d,Lg(d.type,a),c);break a}throw Error(p(306,\nd,\"\"));}return b;case 0:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),dj(a,b,d,e,c);case 1:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),ij(a,b,d,e,c);case 3:a:{lj(b);if(null===a)throw Error(p(387));d=b.pendingProps;f=b.memoizedState;e=f.element;bh(a,b);gh(b,d,null,c);var g=b.memoizedState;d=g.element;if(f.isDehydrated)if(f={element:d,isDehydrated:!1,cache:g.cache,pendingSuspenseBoundaries:g.pendingSuspenseBoundaries,transitions:g.transitions},b.updateQueue.baseState=\nf,b.memoizedState=f,b.flags&256){e=Ki(Error(p(423)),b);b=mj(a,b,d,c,e);break a}else if(d!==e){e=Ki(Error(p(424)),b);b=mj(a,b,d,c,e);break a}else for(yg=Lf(b.stateNode.containerInfo.firstChild),xg=b,I=!0,zg=null,c=Ch(b,null,d,c),b.child=c;c;)c.flags=c.flags&-3|4096,c=c.sibling;else{Ig();if(d===e){b=$i(a,b,c);break a}Yi(a,b,d,c)}b=b.child}return b;case 5:return Kh(b),null===a&&Eg(b),d=b.type,e=b.pendingProps,f=null!==a?a.memoizedProps:null,g=e.children,Ef(d,e)?g=null:null!==f&&Ef(d,f)&&(b.flags|=32),\nhj(a,b),Yi(a,b,g,c),b.child;case 6:return null===a&&Eg(b),null;case 13:return pj(a,b,c);case 4:return Ih(b,b.stateNode.containerInfo),d=b.pendingProps,null===a?b.child=Bh(b,null,d,c):Yi(a,b,d,c),b.child;case 11:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),Zi(a,b,d,e,c);case 7:return Yi(a,b,b.pendingProps,c),b.child;case 8:return Yi(a,b,b.pendingProps.children,c),b.child;case 12:return Yi(a,b,b.pendingProps.children,c),b.child;case 10:a:{d=b.type._context;e=b.pendingProps;f=b.memoizedProps;\ng=e.value;G(Mg,d._currentValue);d._currentValue=g;if(null!==f)if(He(f.value,g)){if(f.children===e.children&&!Wf.current){b=$i(a,b,c);break a}}else for(f=b.child,null!==f&&(f.return=b);null!==f;){var h=f.dependencies;if(null!==h){g=f.child;for(var k=h.firstContext;null!==k;){if(k.context===d){if(1===f.tag){k=ch(-1,c&-c);k.tag=2;var l=f.updateQueue;if(null!==l){l=l.shared;var m=l.pending;null===m?k.next=k:(k.next=m.next,m.next=k);l.pending=k}}f.lanes|=c;k=f.alternate;null!==k&&(k.lanes|=c);Sg(f.return,\nc,b);h.lanes|=c;break}k=k.next}}else if(10===f.tag)g=f.type===b.type?null:f.child;else if(18===f.tag){g=f.return;if(null===g)throw Error(p(341));g.lanes|=c;h=g.alternate;null!==h&&(h.lanes|=c);Sg(g,c,b);g=f.sibling}else g=f.child;if(null!==g)g.return=f;else for(g=f;null!==g;){if(g===b){g=null;break}f=g.sibling;if(null!==f){f.return=g.return;g=f;break}g=g.return}f=g}Yi(a,b,e.children,c);b=b.child}return b;case 9:return e=b.type,d=b.pendingProps.children,Tg(b,c),e=Vg(e),d=d(e),b.flags|=1,Yi(a,b,d,c),\nb.child;case 14:return d=b.type,e=Lg(d,b.pendingProps),e=Lg(d.type,e),aj(a,b,d,e,c);case 15:return cj(a,b,b.type,b.pendingProps,c);case 17:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),jj(a,b),b.tag=1,Zf(d)?(a=!0,cg(b)):a=!1,Tg(b,c),ph(b,d,e),rh(b,d,e,c),kj(null,b,d,!0,a,c);case 19:return yj(a,b,c);case 22:return ej(a,b,c)}throw Error(p(156,b.tag));};function Gk(a,b){return ac(a,b)}\nfunction al(a,b,c,d){this.tag=a;this.key=c;this.sibling=this.child=this.return=this.stateNode=this.type=this.elementType=null;this.index=0;this.ref=null;this.pendingProps=b;this.dependencies=this.memoizedState=this.updateQueue=this.memoizedProps=null;this.mode=d;this.subtreeFlags=this.flags=0;this.deletions=null;this.childLanes=this.lanes=0;this.alternate=null}function Bg(a,b,c,d){return new al(a,b,c,d)}function bj(a){a=a.prototype;return!(!a||!a.isReactComponent)}\nfunction $k(a){if(\"function\"===typeof a)return bj(a)?1:0;if(void 0!==a&&null!==a){a=a.$$typeof;if(a===Da)return 11;if(a===Ga)return 14}return 2}\nfunction wh(a,b){var c=a.alternate;null===c?(c=Bg(a.tag,b,a.key,a.mode),c.elementType=a.elementType,c.type=a.type,c.stateNode=a.stateNode,c.alternate=a,a.alternate=c):(c.pendingProps=b,c.type=a.type,c.flags=0,c.subtreeFlags=0,c.deletions=null);c.flags=a.flags&14680064;c.childLanes=a.childLanes;c.lanes=a.lanes;c.child=a.child;c.memoizedProps=a.memoizedProps;c.memoizedState=a.memoizedState;c.updateQueue=a.updateQueue;b=a.dependencies;c.dependencies=null===b?null:{lanes:b.lanes,firstContext:b.firstContext};\nc.sibling=a.sibling;c.index=a.index;c.ref=a.ref;return c}\nfunction yh(a,b,c,d,e,f){var g=2;d=a;if(\"function\"===typeof a)bj(a)&&(g=1);else if(\"string\"===typeof a)g=5;else a:switch(a){case ya:return Ah(c.children,e,f,b);case za:g=8;e|=8;break;case Aa:return a=Bg(12,c,b,e|2),a.elementType=Aa,a.lanes=f,a;case Ea:return a=Bg(13,c,b,e),a.elementType=Ea,a.lanes=f,a;case Fa:return a=Bg(19,c,b,e),a.elementType=Fa,a.lanes=f,a;case Ia:return qj(c,e,f,b);default:if(\"object\"===typeof a&&null!==a)switch(a.$$typeof){case Ba:g=10;break a;case Ca:g=9;break a;case Da:g=11;\nbreak a;case Ga:g=14;break a;case Ha:g=16;d=null;break a}throw Error(p(130,null==a?a:typeof a,\"\"));}b=Bg(g,c,b,e);b.elementType=a;b.type=d;b.lanes=f;return b}function Ah(a,b,c,d){a=Bg(7,a,d,b);a.lanes=c;return a}function qj(a,b,c,d){a=Bg(22,a,d,b);a.elementType=Ia;a.lanes=c;a.stateNode={isHidden:!1};return a}function xh(a,b,c){a=Bg(6,a,null,b);a.lanes=c;return a}\nfunction zh(a,b,c){b=Bg(4,null!==a.children?a.children:[],a.key,b);b.lanes=c;b.stateNode={containerInfo:a.containerInfo,pendingChildren:null,implementation:a.implementation};return b}\nfunction bl(a,b,c,d,e){this.tag=b;this.containerInfo=a;this.finishedWork=this.pingCache=this.current=this.pendingChildren=null;this.timeoutHandle=-1;this.callbackNode=this.pendingContext=this.context=null;this.callbackPriority=0;this.eventTimes=zc(0);this.expirationTimes=zc(-1);this.entangledLanes=this.finishedLanes=this.mutableReadLanes=this.expiredLanes=this.pingedLanes=this.suspendedLanes=this.pendingLanes=0;this.entanglements=zc(0);this.identifierPrefix=d;this.onRecoverableError=e;this.mutableSourceEagerHydrationData=\nnull}function cl(a,b,c,d,e,f,g,h,k){a=new bl(a,b,c,h,k);1===b?(b=1,!0===f&&(b|=8)):b=0;f=Bg(3,null,null,b);a.current=f;f.stateNode=a;f.memoizedState={element:d,isDehydrated:c,cache:null,transitions:null,pendingSuspenseBoundaries:null};ah(f);return a}function dl(a,b,c){var d=3>>1,e=a[d];if(0>>1;dg(C,c))ng(x,C)?(a[d]=x,a[n]=c,d=n):(a[d]=C,a[m]=c,d=m);else if(ng(x,c))a[d]=x,a[n]=c,d=n;else break a}}return b}\nfunction g(a,b){var c=a.sortIndex-b.sortIndex;return 0!==c?c:a.id-b.id}if(\"object\"===typeof performance&&\"function\"===typeof performance.now){var l=performance;exports.unstable_now=function(){return l.now()}}else{var p=Date,q=p.now();exports.unstable_now=function(){return p.now()-q}}var r=[],t=[],u=1,v=null,y=3,z=!1,A=!1,B=!1,D=\"function\"===typeof setTimeout?setTimeout:null,E=\"function\"===typeof clearTimeout?clearTimeout:null,F=\"undefined\"!==typeof setImmediate?setImmediate:null;\n\"undefined\"!==typeof navigator&&void 0!==navigator.scheduling&&void 0!==navigator.scheduling.isInputPending&&navigator.scheduling.isInputPending.bind(navigator.scheduling);function G(a){for(var b=h(t);null!==b;){if(null===b.callback)k(t);else if(b.startTime<=a)k(t),b.sortIndex=b.expirationTime,f(r,b);else break;b=h(t)}}function H(a){B=!1;G(a);if(!A)if(null!==h(r))A=!0,I(J);else{var b=h(t);null!==b&&K(H,b.startTime-a)}}\nfunction J(a,b){A=!1;B&&(B=!1,E(L),L=-1);z=!0;var c=y;try{G(b);for(v=h(r);null!==v&&(!(v.expirationTime>b)||a&&!M());){var d=v.callback;if(\"function\"===typeof d){v.callback=null;y=v.priorityLevel;var e=d(v.expirationTime<=b);b=exports.unstable_now();\"function\"===typeof e?v.callback=e:v===h(r)&&k(r);G(b)}else k(r);v=h(r)}if(null!==v)var w=!0;else{var m=h(t);null!==m&&K(H,m.startTime-b);w=!1}return w}finally{v=null,y=c,z=!1}}var N=!1,O=null,L=-1,P=5,Q=-1;\nfunction M(){return exports.unstable_now()-Qa||125d?(a.sortIndex=c,f(t,a),null===h(r)&&a===h(t)&&(B?(E(L),L=-1):B=!0,K(H,c-d))):(a.sortIndex=e,f(r,a),A||z||(A=!0,I(J)));return a};\nexports.unstable_shouldYield=M;exports.unstable_wrapCallback=function(a){var b=y;return function(){var c=y;y=b;try{return a.apply(this,arguments)}finally{y=c}}};\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n module.exports = require('./cjs/scheduler.production.min.js');\n} else {\n module.exports = require('./cjs/scheduler.development.js');\n}\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","import beta from \"@stdlib/random-base-beta\";\nimport mt19937 from \"@stdlib/random-base-mt19937\";\nimport { Mutable } from \"./utils\";\n\nexport type Seed = number;\n\nexport const MAX_PLUS_ONE = mt19937.MAX + 1;\n\nexport class PseudorandomStream {\n private mt;\n private bt;\n\n constructor(seed: Seed) {\n this.mt = mt19937.factory({ seed });\n this.bt = beta.factory({ state: this.mt.state, copy: false });\n }\n\n chance(chance: number): boolean {\n return this.mt() < chance * MAX_PLUS_ONE;\n }\n\n uniform({ min = 0, max = 1 }): number {\n return min + (this.mt() * (max - min)) / MAX_PLUS_ONE;\n }\n\n beta({\n a,\n b,\n min = 0,\n max = 1,\n }: {\n a: number;\n b: number;\n min?: number;\n max?: number;\n }): number {\n return min + this.bt(a, b) * (max - min);\n }\n\n uniformInt(args: { min?: number; max: number }) {\n return Math.floor(this.uniform(args));\n }\n\n betaInt(args: { a: number; b: number; min?: number; max?: number }): number {\n return Math.floor(this.beta(args));\n }\n\n uniformChoice(choices: readonly T[]): T {\n return choices[this.uniformInt({ max: choices.length })];\n }\n\n betaChoice(choices: readonly T[], { a, b }: { a: number; b: number }): T {\n return choices[this.betaInt({ a: a, b: b, max: choices.length })];\n }\n\n weightedChoice(bids: readonly { bid: number; item: T }[]): T {\n const b = bids.filter((bid) => bid.bid > 0);\n const totalWeight = b.reduce((acc, bid) => acc + bid.bid, 0);\n let randomValue = this.uniform({ max: totalWeight });\n\n for (const { bid, item } of b) {\n randomValue -= bid;\n if (randomValue <= 0) {\n return item;\n }\n }\n return b[b.length - 1].item;\n }\n\n shuffle(choices: readonly T[]): T[] {\n const r: T[] = [];\n for (let i = 0; i < choices.length; i++) {\n const j = Math.floor((this.mt() * i) / MAX_PLUS_ONE);\n if (i !== j) {\n r[i] = r[j];\n }\n r[j] = choices[i];\n }\n return r;\n }\n}\n\n/**\n * DO NOT RE-ORDER THIS ENUM!\n * ALWAYS APPEND NEW ENTRIES TO THE END!\n *\n * Otherwise, new versions of groundHog will generate wildly different caverns\n * from the same seeds in a previous version.\n */\nenum Die {\n init = 0,\n partition,\n weave,\n flood,\n pickSpawn,\n pickArchitect,\n pearl,\n prime,\n rough,\n placeRechargeSeam,\n placeBuildings,\n placeCrystals,\n placeOre,\n placeLandslides,\n placeErosion,\n placeEntities,\n lore,\n scriptGlobals,\n script,\n monsterSpawnScript,\n brace,\n height,\n placeSlugHoles,\n slugSpawnScript,\n}\n\n/**\n * A box of pseudo-random streams. Streams are separated into \"kinds\" - each one\n * having its own root seed. Some kinds are further separated by applying\n * a fixed numerical offset to these root seeds. The result is a pile of consistent\n * but mostly independent pseudo-random number generators that should prevent\n * independent changes in one area of cavern generation from affecting other areas.\n */\nexport class DiceBox {\n seed: number;\n private boxes: readonly {\n seed: Seed;\n rngs: Array;\n }[];\n\n constructor(seed: Seed) {\n this.seed = seed;\n // Patch for https://github.com/stdlib-js/stdlib/issues/1963\n if (seed === 0) {\n seed = 1999;\n }\n const mt = mt19937.factory({ seed });\n const boxesLength = Object.keys(Die).length;\n const boxes: Mutable = [];\n for (let i = 0; i < boxesLength; i++) {\n boxes[i] = { seed: mt(), rngs: [] };\n }\n this.boxes = boxes;\n }\n\n private prng(die: Die, offset: number): PseudorandomStream {\n const box = this.boxes[die];\n let r = box.rngs[offset];\n if (!r) {\n const seed = (box.seed + offset * 1999 + MAX_PLUS_ONE) % MAX_PLUS_ONE;\n r = new PseudorandomStream(seed);\n box.rngs[offset] = r;\n }\n return r;\n }\n\n init(id: number) {\n return this.prng(Die.init, id);\n }\n\n get partition() {\n return this.prng(Die.partition, 0);\n }\n\n get weave() {\n return this.prng(Die.weave, 0);\n }\n\n get flood() {\n return this.prng(Die.flood, 0);\n }\n\n get pickSpawn() {\n return this.prng(Die.pickSpawn, 0);\n }\n\n pickArchitect = (id: number) => this.prng(Die.pickArchitect, id);\n prime = (id: number) => this.prng(Die.prime, id);\n pearl = (id: number) => this.prng(Die.pearl, id);\n rough = (id: number) => this.prng(Die.rough, id);\n\n get brace() {\n return this.prng(Die.brace, 0);\n }\n\n placeRechargeSeam = (id: number) => this.prng(Die.placeRechargeSeam, id);\n placeBuildings = (id: number) => this.prng(Die.placeBuildings, id);\n placeCrystals = (id: number) => this.prng(Die.placeCrystals, id);\n placeOre = (id: number) => this.prng(Die.placeOre, id);\n placeSlugHoles = (id: number) => this.prng(Die.placeSlugHoles, id);\n\n placeLandslides = (id: number) => this.prng(Die.placeLandslides, id);\n placeErosion = (id: number) => this.prng(Die.placeErosion, id);\n placeEntities = (id: number) => this.prng(Die.placeEntities, id);\n\n lore = (id: number) => this.prng(Die.lore, id);\n\n get height() {\n return this.prng(Die.height, 0);\n }\n\n get scriptGlobals() {\n return this.prng(Die.scriptGlobals, 0);\n }\n\n script = (id: number) => this.prng(Die.script, id);\n monsterSpawnScript = (id: number) => this.prng(Die.monsterSpawnScript, id);\n slugSpawnScript = (id: number) => this.prng(Die.slugSpawnScript, id);\n}\n","import { DiceBox } from \"./prng\";\n\nexport type Biome = \"rock\" | \"ice\" | \"lava\";\n\n/**\n * Some values are \"curved\" so they change based on distance from spawn.\n * These values can be negative to decrease a value away from spawn.\n */\nexport type Curve = {\n /** The base value at spawn. */\n readonly base: number;\n /**\n * This value is multiplied by a number from 0 to 1 depending on the ratio\n * of the maximum possible distance away from spawn.\n */\n readonly hops: number;\n /**\n * This value is multiplied by a number from 0 to 1 depending on the order\n * the caves / halls are visited in.\n */\n readonly order: number;\n};\n\nexport type CavernContext = {\n /** The root seed for the dice box. */\n seed: number;\n\n /** Any values not infered directly from the seed. */\n overrides: readonly (keyof CavernContext)[];\n /**\n * Which biome this map is in. Biome affects the default setting for some\n * other context values, such as how much water or lava a map has.\n */\n biome: Biome;\n\n /**\n * The \"target\" final size for the cavern.\n * The final size may be larger or smaller due to random fluctuations -\n * larger caverns will not be explicitly cropped to fit this value.\n */\n targetSize: number;\n /**\n * The maximum aspect ratio baseplates can have.\n */\n baseplateMaxOblongness: number;\n /**\n * Baseplates may be at most this ratio of the target size.\n */\n baseplateMaxRatioOfSize: number;\n /**\n * Promote this many baseplates to become caves.\n * The higher this number is, the more \"busy\" the final map will be.\n */\n caveCount: number;\n /**\n * Add at most this many extra redundant paths.\n */\n optimalAuxiliaryPathCount: number;\n /**\n * Add at most this many extra redundant paths.\n */\n randomAuxiliaryPathCount: number;\n /**\n * Auxiliary paths will not be chosen if they make an angle less than this\n * against another path.\n */\n auxiliaryPathMinAngle: number;\n /**\n * How many plans to flood with water.\n */\n waterPlans: number;\n /**\n * How many plans to flood with lava.\n */\n lavaPlans: number;\n /**\n * How many contiguous water \"lakes\" to generate.\n */\n waterLakes: number;\n /**\n * How many contiguous lava \"lakes\" to generate.\n */\n lavaLakes: number;\n /**\n * How many plans will have erosion? Note that lava-flooded plans do not\n * necessarily have erosion, so this number has some overlap with that.\n */\n erosionPlans: number;\n /**\n * Does this cavern have monsters in it?\n */\n hasMonsters: boolean;\n /**\n * Does this cavern have slugs in it?\n */\n hasSlugs: boolean;\n /**\n * Does this cavern have limited air?\n */\n hasAirLimit: boolean;\n /**\n * How blobby and jagged caves should be.\n * 0 results in perfectly squashed octagons.\n * Larger values can result in oversized spaces or extremely jagged caves, up\n * to about 70% where caves start to get simpler and smaller.\n */\n caveBaroqueness: number;\n /**\n * How blobby and jagged halls should be.\n * 0 results in perfect squashed octagons.\n * Larger values can result in oversized spaces or extremely jagged halls, up\n * to about 70% where caves start to get simpler and smaller.\n */\n hallBaroqueness: number;\n\n /**\n * Curve for determining how many crystals each cave will have.\n * This is roughly measured by crystals per unit of perimeter of the cave.\n */\n caveCrystalRichness: Curve;\n /**\n * Curve for determining how many crystals each hall will have.\n * This is roughly measured by crystals per unit of perimeter of the hall.\n */\n hallCrystalRichness: Curve;\n /**\n * Curve for determining how much additional ore each cave will have.\n * This is roughly measured by ore per unit of perimeter of the cave, and\n * does not include the 4 ore yielded by clearing rubble.\n */\n caveOreRichness: Curve;\n /**\n * Curve for determining how much additional ore each hall will have.\n * This is roughly measured by ore per unit of perimeter of the hall, and\n * does not include the 4 ore yielded by clearing rubble.\n */\n hallOreRichness: Curve;\n\n /**\n * How many monsters to spawn per minute in a cave, if monsters are enabled.\n */\n monsterSpawnRate: Curve;\n /**\n * How many monsters to spawn at a time in a cave, if monsters are enabled.\n */\n monsterWaveSize: Curve;\n /**\n * Adjusts the likelihood of architects appearing.\n * Architects that are \"encouraged\" have their chance multiplied by a high\n * number to make them appear wherever they are applicable.\n * Architects that are \"discouraged\" have a 0 chance of appearing, which may\n * cause a crash if that was the only architect possible for a cave or hall.\n * Note that adjusting this may cause other seemingly unrelated caves to use\n * different architects as the probabilities shift.\n */\n architects: { [key: string]: \"encourage\" | \"disable\" };\n /**\n * The chance each cave will have a recharge seam. Some caves (such as spawn)\n * will always have a recharge seam.\n */\n caveHasRechargeSeamChance: number;\n /** The chance each hall will have a recharge seam. */\n hallHasRechargeSeamChance: number;\n /**\n * The chance each crystal placed will immediately place a seam instead,\n * assuming it is possible to do so. When this is set to 0, seams may still\n * appear since any wall with 4 or more crystals will be automatically\n * upgraded to a seam.\n */\n caveCrystalSeamBias: number;\n /**\n * The chance each crystal placed will immediately place a seam instead,\n * assuming it is possible to do so. When this is set to 0, seams may still\n * appear since any wall with 4 or more crystals will be automatically\n * upgraded to a seam.\n */\n hallCrystalSeamBias: number;\n /**\n * The chance each ore placed will immediately place a seam instead,\n * assuming it is possible to do so. When this is set to 0, seams may still\n * appear since any wall with 4 or more ore will be automatically\n * upgraded to a seam.\n */\n caveOreSeamBias: number;\n /**\n * The chance each ore placed will immediately place a seam instead,\n * assuming it is possible to do so. When this is set to 0, seams may still\n * appear since any wall with 4 or more ore will be automatically\n * upgraded to a seam.\n */\n hallOreSeamBias: number;\n /**\n * The chance each normal cave will have a slug hole, regardless of whether\n * Slimy Slugs are enabled in this level.\n */\n caveHasSlugHoleChance: number;\n /**\n * The chance each normal hall will have a slug hole, regardless of whether\n * Slimy Slugs are enabled in this level.\n */\n hallHasSlugHoleChance: number;\n /** The chance each cave will have landslides at all. */\n caveHasLandslidesChance: number;\n /** The chance each hall will have landslides at all. */\n hallHasLandslidesChance: number;\n /** The range of cooldowns to use in caves that have landslides. */\n caveLandslideCooldownRange: { min: number; max: number };\n /** The range of cooldowns to use in halls that have landslides. */\n hallLandslideCooldownRange: { min: number; max: number };\n /**\n * Approximately what portion of all the Energy Crystals available in the\n * level should be used as the goal, if there is a crystal goal.\n * For most Rock Raiders levels, this tends to be about 20%.\n */\n crystalGoalRatio: number;\n /**\n * The heightmap will try to generate caves at a height that is +/- this\n * number. If this is set to 0, height generation will be skipped and the\n * entire map will be flat.\n */\n heightTargetRange: number;\n /**\n * The number of passes to spread cave target heights into the void.\n */\n stratascosity: number;\n /**\n * How closely the strataflux step should adhere to target heights.\n */\n strataplanity: number;\n /**\n * The maximum height difference between two points on the side of any tile\n * that is part of an arbitrary cave. Some tiles (like water) and caves (like\n * those intended to be built in) will be further restricted.\n */\n caveMaxSlope: number;\n /**\n * The maximum height difference between two points on the side of any tile\n * that is part of an arbitrary hall. Some tiles (like water) will be further\n * restricted.\n */\n hallMaxSlope: number;\n /**\n * The maximum height difference between two points on the side of any tile\n * that is outside the playable area - that is, undrillable solid rock.\n */\n voidMaxSlope: number;\n /**\n * The maximum height difference between two points on the side of any tile\n * that is out of play on the border of the map.\n */\n borderMaxSlope: number;\n /**\n * GroundHog attempts to calculate how much air is needed to build a Support\n * Station by playing perfectly through a (rough) simulation of the level.\n * In theory, it should be possible for a very good player to match or beat\n * this simulation - but that's not going to be fun. Multiply the estimate by\n * the safety factor to get the final air number.\n */\n airSafetyFactor: number;\n};\n\nenum Die {\n biome = 0,\n targetSize,\n hasMonsters,\n flood,\n heightTargetRange,\n hasSlugs,\n hasAirLimit,\n}\n\nconst STANDARD_DEFAULTS = {\n baseplateMaxOblongness: 3,\n baseplateMaxRatioOfSize: 0.33,\n caveCount: 20,\n optimalAuxiliaryPathCount: 2,\n randomAuxiliaryPathCount: 3,\n auxiliaryPathMinAngle: Math.PI / 4,\n caveBaroqueness: 0.16,\n hallBaroqueness: 0.07,\n caveCrystalRichness: { base: 0.16, hops: 0.32, order: 0.32 },\n hallCrystalRichness: { base: 0.07, hops: 0, order: 0 },\n caveOreRichness: { base: 1.19, hops: -0.16, order: -0.08 },\n hallOreRichness: { base: 0.12, hops: 0, order: 0 },\n monsterSpawnRate: { base: 0.3, hops: 0.56, order: 0.6 },\n monsterWaveSize: { base: 1.75, hops: 2.0, order: 3.0 },\n architects: {},\n caveCrystalSeamBias: 0.05,\n hallCrystalSeamBias: 0.05,\n caveOreSeamBias: 0.05,\n hallOreSeamBias: 0.05,\n hallHasSlugHoleChance: 0,\n stratascosity: 0,\n strataplanity: 3,\n caveHasLandslidesChance: 0.4,\n hallHasLandslidesChance: 0.8,\n caveLandslideCooldownRange: { min: 15, max: 120 },\n hallLandslideCooldownRange: { min: 30, max: 150 },\n airSafetyFactor: 2,\n crystalGoalRatio: 0.2,\n} as const satisfies Partial;\n\nconst DEFAULTS_FOR_BIOME = {\n rock: {\n caveHasRechargeSeamChance: 0.07,\n hallHasRechargeSeamChance: 0.02,\n caveHasSlugHoleChance: 0.05,\n caveMaxSlope: 75,\n hallMaxSlope: 90,\n voidMaxSlope: 120,\n borderMaxSlope: 200,\n },\n ice: {\n caveHasRechargeSeamChance: 0.07,\n hallHasRechargeSeamChance: 0.07,\n caveHasSlugHoleChance: 0,\n caveMaxSlope: 30,\n hallMaxSlope: 30,\n voidMaxSlope: 40,\n borderMaxSlope: 100,\n },\n lava: {\n caveHasRechargeSeamChance: 0.1,\n hallHasRechargeSeamChance: 0.04,\n caveHasSlugHoleChance: 0.01,\n caveMaxSlope: 60,\n hallMaxSlope: 90,\n voidMaxSlope: 120,\n borderMaxSlope: 200,\n },\n} as const satisfies { [K in Biome]: Partial };\n\nfunction getDefaultFlooding(dice: DiceBox, biome: Biome) {\n const rng = dice.init(Die.flood);\n const waterPlans = rng.betaInt({\n a: 1.4,\n b: 1.4,\n ...{\n rock: { min: 0, max: 8 },\n ice: { min: 0, max: 20 },\n lava: { min: 0, max: 4 },\n }[biome],\n });\n const waterLakes =\n waterPlans > 3 ? rng.uniformInt({ min: 1, max: waterPlans / 2 }) : 1;\n const lavaPlans = rng.betaInt({\n a: 1.4,\n b: 1.4,\n ...{\n rock: { min: 0, max: 4 },\n ice: { min: 0, max: 2 },\n lava: { min: 4, max: 16 },\n }[biome],\n });\n const lavaLakes =\n lavaPlans > 3\n ? rng.uniformInt({ min: 1, max: Math.min(lavaPlans / 2, 3) })\n : 1;\n const erosionPlans =\n lavaPlans > 0\n ? rng.betaInt(\n {\n rock: { a: 0.8, b: 1.4, min: 0, max: 6 },\n ice: { a: 0.5, b: 1.8, min: 0, max: 4 },\n lava: { a: 1.4, b: 1.4, min: 0, max: 16 },\n }[biome],\n )\n : 0;\n return { waterPlans, waterLakes, lavaPlans, lavaLakes, erosionPlans };\n}\n\nexport function inferContextDefaults(\n args: Partial> & Pick,\n): CavernContext {\n const dice = new DiceBox(args.seed);\n const r = {\n biome: dice\n .init(Die.biome)\n .uniformChoice([\"rock\", \"ice\", \"lava\"] as Biome[]),\n hasMonsters: dice.init(Die.hasMonsters).chance(0.75),\n targetSize: dice.init(Die.targetSize).uniformInt({ min: 50, max: 78 }),\n ...args,\n };\n const hasAirLimit = dice.init(Die.hasAirLimit).chance(0.75);\n const hasSlugs = dice.init(Die.hasSlugs).chance(\n {\n rock: 0.25,\n ice: 0.01,\n lava: 0.05,\n }[r.biome],\n );\n const heightTargetRange = dice.init(Die.heightTargetRange).betaInt(\n {\n rock: { a: 3, b: 1, min: 100, max: 500 },\n ice: { a: 1, b: 3, min: 100, max: 500 },\n lava: { a: 2, b: 1.5, min: 100, max: 500 },\n }[r.biome],\n );\n return {\n ...STANDARD_DEFAULTS,\n ...DEFAULTS_FOR_BIOME[r.biome],\n ...getDefaultFlooding(dice, r.biome),\n hasAirLimit,\n hasSlugs,\n heightTargetRange,\n ...r,\n overrides: Object.keys(args)\n .filter((k) => k !== \"seed\")\n .sort() as (keyof CavernContext)[],\n };\n}\n","// extracted by mini-css-extract-plugin\nexport default {\"contextInput\":\"style_contextInput__1OoGc\",\"section\":\"style_section__UU5kL\",\"subsection\":\"style_subsection__V6nKB\",\"inputRow\":\"style_inputRow__e-kmi\",\"icon\":\"style_icon__w+PGc\",\"inactive\":\"style_inactive__-rc9v\",\"invisible\":\"style_invisible__I4pew\",\"override\":\"style_override__ZXWWz\",\"seed\":\"style_seed__gS1FQ\",\"showAdvanced\":\"style_showAdvanced__sTHS2\",\"curve\":\"style_curve__v3DHl\"};","export type Point = readonly [number, number];\nexport type Cardinal4 = typeof NORTH | typeof EAST | typeof SOUTH | typeof WEST;\nexport type Cardinal8 =\n | Cardinal4\n | typeof NORTH_EAST\n | typeof SOUTH_EAST\n | typeof SOUTH_WEST\n | typeof NORTH_WEST;\n\nexport const ORIGIN = [0, 0] as const;\nexport const NORTH = [0, -1] as const;\nexport const NORTH_EAST = [1, -1] as const;\nexport const EAST = [1, 0] as const;\nexport const SOUTH_EAST = [1, 1] as const;\nexport const SOUTH = [0, 1] as const;\nexport const SOUTH_WEST = [-1, 1] as const;\nexport const WEST = [-1, 0] as const;\nexport const NORTH_WEST = [-1, -1] as const;\n\nexport const NSEW = [NORTH, SOUTH, EAST, WEST] as const;\nexport const NEIGHBORS8 = [\n NORTH,\n NORTH_EAST,\n EAST,\n SOUTH_EAST,\n SOUTH,\n SOUTH_WEST,\n WEST,\n NORTH_WEST,\n] as const;\n\nexport function isAdjacent4(a: Point, b: Point) {\n return (\n (a[0] === b[0] && Math.abs(a[1] - b[1]) <= 1) ||\n (a[1] === b[1] && Math.abs(a[0] - b[0]) <= 1)\n );\n}\n\nexport function isAdjacent8(a: Point, b: Point) {\n return Math.abs(a[0] - b[0]) <= 1 && Math.abs(a[1] - b[1]) <= 1;\n}\n\nexport function offsetBy([x, y]: Point, [ox, oy]: Point): Point {\n return [x + ox, y + oy];\n}\n\nexport function* plotLine(a: Point, b: Point): IterableIterator {\n let x = Math.floor(a[0]);\n let y = Math.floor(a[1]);\n const destX = Math.floor(b[0]);\n const destY = Math.floor(b[1]);\n\n const dx = Math.abs(destX - x);\n const sx = destX > x ? 1 : -1;\n const dy = -Math.abs(destY - y);\n const sy = destY > y ? 1 : -1;\n\n let error = dx + dy;\n\n while (true) {\n yield [x, y];\n\n if (x === destX && y === destY) {\n break;\n }\n\n const e2 = 2 * error;\n const moveX = e2 >= dy;\n const moveY = e2 <= dx;\n\n if (moveX) {\n if (x === destX) {\n break;\n }\n error += dy;\n x += sx;\n }\n\n if (moveY) {\n if (moveX) {\n yield [x, y];\n }\n if (y === destY) {\n break;\n }\n error += dx;\n y += sy;\n }\n }\n}\n\nexport function radsToDegrees(rads: number) {\n return (((rads * 180) / Math.PI + 180) % 360) - 180;\n}\n\nexport function rotateAround([x, y]: Point): Point {\n return [-x, -y];\n}\n\nexport function rotateLeft([x, y]: Point): Point {\n return [y, -x];\n}\n\nexport function rotateRight([x, y]: Point): Point {\n return [-y, x];\n}\n","import React, { CSSProperties } from \"react\";\nimport styles from \"./style.module.scss\";\nimport { CavernContext, Curve } from \"../../../core/common\";\nimport { radsToDegrees } from \"../../../core/common/geometry\";\n\nexport type UpdateData = {\n update: React.Dispatch>;\n context: Partial;\n contextWithDefaults: CavernContext | undefined;\n};\ntype KeysMatching = {\n [K in keyof T]-?: T[K] extends V ? K : never;\n}[keyof T];\n\nexport const Choice = ({\n of,\n choices,\n update,\n context,\n contextWithDefaults,\n}: {\n of: K;\n choices: CavernContext[K][];\n} & UpdateData) => (\n <>\n

{of}

\n
\n {choices.map((choice) => {\n const classes = [styles.choice];\n const selected = context[of] === choice;\n if (selected) {\n classes.push(styles.override);\n }\n const active = contextWithDefaults?.[of] === choice;\n classes.push(active ? styles.active : styles.inactive);\n\n return (\n {\n update({ [of]: selected ? undefined : choice });\n }}\n >\n {`${choice}`}\n \n );\n })}\n
\n \n);\n\nexport const CurveSliders = ({\n of,\n min,\n max,\n step,\n update,\n context,\n contextWithDefaults,\n}: {\n of: KeysMatching;\n min: number;\n max: number;\n step: number;\n} & UpdateData) => {\n function updateCurve(key: \"base\" | \"hops\" | \"order\", value: number) {\n update({\n [of]: { ...contextWithDefaults?.[of], ...context?.[of], [key]: value },\n });\n }\n\n return (\n <>\n

{of}:

\n

\n {contextWithDefaults?.[of]?.base?.toFixed(2)},{\" \"}\n {contextWithDefaults?.[of]?.hops?.toFixed(2)},{\" \"}\n {contextWithDefaults?.[of]?.order?.toFixed(2)}\n

\n
\n
\n {([\"base\", \"hops\", \"order\"] as const).map((key) => {\n const value = contextWithDefaults?.[of]?.[key] ?? min;\n return (\n updateCurve(key, ev.target.valueAsNumber)}\n />\n );\n })}\n
\n {of in context ? (\n update({ [of]: undefined })}\n >\n undo\n \n ) : (\n
\n )}\n
\n \n );\n};\n\nexport const Slider = ({\n of,\n min,\n max,\n percent,\n angle,\n step,\n update,\n context,\n contextWithDefaults,\n}: {\n of: KeysMatching;\n min: number;\n max: number;\n percent?: boolean;\n angle?: boolean;\n step?: number;\n} & UpdateData) => {\n const value = context[of] ?? contextWithDefaults?.[of] ?? min;\n return (\n <>\n

\n {of}:{\" \"}\n {percent ? (\n <>{(value * 100).toFixed()}%\n ) : angle ? (\n <>{radsToDegrees(value).toFixed()}°\n ) : (\n value\n )}\n

\n
\n update({ [of]: ev.target.valueAsNumber })}\n />\n {context[of] === undefined ? (\n
\n ) : (\n update({ [of]: undefined })}\n >\n undo\n \n )}\n
\n \n );\n};\n","export const epsilon = 1.1102230246251565e-16;\nexport const splitter = 134217729;\nexport const resulterrbound = (3 + 8 * epsilon) * epsilon;\n\n// fast_expansion_sum_zeroelim routine from oritinal code\nexport function sum(elen, e, flen, f, h) {\n let Q, Qnew, hh, bvirt;\n let enow = e[0];\n let fnow = f[0];\n let eindex = 0;\n let findex = 0;\n if ((fnow > enow) === (fnow > -enow)) {\n Q = enow;\n enow = e[++eindex];\n } else {\n Q = fnow;\n fnow = f[++findex];\n }\n let hindex = 0;\n if (eindex < elen && findex < flen) {\n if ((fnow > enow) === (fnow > -enow)) {\n Qnew = enow + Q;\n hh = Q - (Qnew - enow);\n enow = e[++eindex];\n } else {\n Qnew = fnow + Q;\n hh = Q - (Qnew - fnow);\n fnow = f[++findex];\n }\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n while (eindex < elen && findex < flen) {\n if ((fnow > enow) === (fnow > -enow)) {\n Qnew = Q + enow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (enow - bvirt);\n enow = e[++eindex];\n } else {\n Qnew = Q + fnow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n fnow = f[++findex];\n }\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n }\n while (eindex < elen) {\n Qnew = Q + enow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (enow - bvirt);\n enow = e[++eindex];\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n while (findex < flen) {\n Qnew = Q + fnow;\n bvirt = Qnew - Q;\n hh = Q - (Qnew - bvirt) + (fnow - bvirt);\n fnow = f[++findex];\n Q = Qnew;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n if (Q !== 0 || hindex === 0) {\n h[hindex++] = Q;\n }\n return hindex;\n}\n\nexport function sum_three(alen, a, blen, b, clen, c, tmp, out) {\n return sum(sum(alen, a, blen, b, tmp), tmp, clen, c, out);\n}\n\n// scale_expansion_zeroelim routine from oritinal code\nexport function scale(elen, e, b, h) {\n let Q, sum, hh, product1, product0;\n let bvirt, c, ahi, alo, bhi, blo;\n\n c = splitter * b;\n bhi = c - (c - b);\n blo = b - bhi;\n let enow = e[0];\n Q = enow * b;\n c = splitter * enow;\n ahi = c - (c - enow);\n alo = enow - ahi;\n hh = alo * blo - (Q - ahi * bhi - alo * bhi - ahi * blo);\n let hindex = 0;\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n for (let i = 1; i < elen; i++) {\n enow = e[i];\n product1 = enow * b;\n c = splitter * enow;\n ahi = c - (c - enow);\n alo = enow - ahi;\n product0 = alo * blo - (product1 - ahi * bhi - alo * bhi - ahi * blo);\n sum = Q + product0;\n bvirt = sum - Q;\n hh = Q - (sum - bvirt) + (product0 - bvirt);\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n Q = product1 + sum;\n hh = sum - (Q - product1);\n if (hh !== 0) {\n h[hindex++] = hh;\n }\n }\n if (Q !== 0 || hindex === 0) {\n h[hindex++] = Q;\n }\n return hindex;\n}\n\nexport function negate(elen, e) {\n for (let i = 0; i < elen; i++) e[i] = -e[i];\n return elen;\n}\n\nexport function estimate(elen, e) {\n let Q = e[0];\n for (let i = 1; i < elen; i++) Q += e[i];\n return Q;\n}\n\nexport function vec(n) {\n return new Float64Array(n);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum} from './util.js';\n\nconst ccwerrboundA = (3 + 16 * epsilon) * epsilon;\nconst ccwerrboundB = (2 + 12 * epsilon) * epsilon;\nconst ccwerrboundC = (9 + 64 * epsilon) * epsilon * epsilon;\n\nconst B = vec(4);\nconst C1 = vec(8);\nconst C2 = vec(12);\nconst D = vec(16);\nconst u = vec(4);\n\nfunction orient2dadapt(ax, ay, bx, by, cx, cy, detsum) {\n let acxtail, acytail, bcxtail, bcytail;\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n const acx = ax - cx;\n const bcx = bx - cx;\n const acy = ay - cy;\n const bcy = by - cy;\n\n s1 = acx * bcy;\n c = splitter * acx;\n ahi = c - (c - acx);\n alo = acx - ahi;\n c = splitter * bcy;\n bhi = c - (c - bcy);\n blo = bcy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acy * bcx;\n c = splitter * acy;\n ahi = c - (c - acy);\n alo = acy - ahi;\n c = splitter * bcx;\n bhi = c - (c - bcx);\n blo = bcx - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n B[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n B[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n B[2] = _j - (u3 - bvirt) + (_i - bvirt);\n B[3] = u3;\n\n let det = estimate(4, B);\n let errbound = ccwerrboundB * detsum;\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n bvirt = ax - acx;\n acxtail = ax - (acx + bvirt) + (bvirt - cx);\n bvirt = bx - bcx;\n bcxtail = bx - (bcx + bvirt) + (bvirt - cx);\n bvirt = ay - acy;\n acytail = ay - (acy + bvirt) + (bvirt - cy);\n bvirt = by - bcy;\n bcytail = by - (bcy + bvirt) + (bvirt - cy);\n\n if (acxtail === 0 && acytail === 0 && bcxtail === 0 && bcytail === 0) {\n return det;\n }\n\n errbound = ccwerrboundC * detsum + resulterrbound * Math.abs(det);\n det += (acx * bcytail + bcy * acxtail) - (acy * bcxtail + bcx * acytail);\n if (det >= errbound || -det >= errbound) return det;\n\n s1 = acxtail * bcy;\n c = splitter * acxtail;\n ahi = c - (c - acxtail);\n alo = acxtail - ahi;\n c = splitter * bcy;\n bhi = c - (c - bcy);\n blo = bcy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acytail * bcx;\n c = splitter * acytail;\n ahi = c - (c - acytail);\n alo = acytail - ahi;\n c = splitter * bcx;\n bhi = c - (c - bcx);\n blo = bcx - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const C1len = sum(4, B, 4, u, C1);\n\n s1 = acx * bcytail;\n c = splitter * acx;\n ahi = c - (c - acx);\n alo = acx - ahi;\n c = splitter * bcytail;\n bhi = c - (c - bcytail);\n blo = bcytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acy * bcxtail;\n c = splitter * acy;\n ahi = c - (c - acy);\n alo = acy - ahi;\n c = splitter * bcxtail;\n bhi = c - (c - bcxtail);\n blo = bcxtail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const C2len = sum(C1len, C1, 4, u, C2);\n\n s1 = acxtail * bcytail;\n c = splitter * acxtail;\n ahi = c - (c - acxtail);\n alo = acxtail - ahi;\n c = splitter * bcytail;\n bhi = c - (c - bcytail);\n blo = bcytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = acytail * bcxtail;\n c = splitter * acytail;\n ahi = c - (c - acytail);\n alo = acytail - ahi;\n c = splitter * bcxtail;\n bhi = c - (c - bcxtail);\n blo = bcxtail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n u[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n u[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n const Dlen = sum(C2len, C2, 4, u, D);\n\n return D[Dlen - 1];\n}\n\nexport function orient2d(ax, ay, bx, by, cx, cy) {\n const detleft = (ay - cy) * (bx - cx);\n const detright = (ax - cx) * (by - cy);\n const det = detleft - detright;\n\n const detsum = Math.abs(detleft + detright);\n if (Math.abs(det) >= ccwerrboundA * detsum) return det;\n\n return -orient2dadapt(ax, ay, bx, by, cx, cy, detsum);\n}\n\nexport function orient2dfast(ax, ay, bx, by, cx, cy) {\n return (ay - cy) * (bx - cx) - (ax - cx) * (by - cy);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, scale} from './util.js';\n\nconst o3derrboundA = (7 + 56 * epsilon) * epsilon;\nconst o3derrboundB = (3 + 28 * epsilon) * epsilon;\nconst o3derrboundC = (26 + 288 * epsilon) * epsilon * epsilon;\n\nconst bc = vec(4);\nconst ca = vec(4);\nconst ab = vec(4);\nconst at_b = vec(4);\nconst at_c = vec(4);\nconst bt_c = vec(4);\nconst bt_a = vec(4);\nconst ct_a = vec(4);\nconst ct_b = vec(4);\nconst bct = vec(8);\nconst cat = vec(8);\nconst abt = vec(8);\nconst u = vec(4);\n\nconst _8 = vec(8);\nconst _8b = vec(8);\nconst _16 = vec(8);\nconst _12 = vec(12);\n\nlet fin = vec(192);\nlet fin2 = vec(192);\n\nfunction finadd(finlen, alen, a) {\n finlen = sum(finlen, fin, alen, a, fin2);\n const tmp = fin; fin = fin2; fin2 = tmp;\n return finlen;\n}\n\nfunction tailinit(xtail, ytail, ax, ay, bx, by, a, b) {\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, t1, t0, u3, negate;\n if (xtail === 0) {\n if (ytail === 0) {\n a[0] = 0;\n b[0] = 0;\n return 1;\n } else {\n negate = -ytail;\n s1 = negate * ax;\n c = splitter * negate;\n ahi = c - (c - negate);\n alo = negate - ahi;\n c = splitter * ax;\n bhi = c - (c - ax);\n blo = ax - bhi;\n a[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n a[1] = s1;\n s1 = ytail * bx;\n c = splitter * ytail;\n ahi = c - (c - ytail);\n alo = ytail - ahi;\n c = splitter * bx;\n bhi = c - (c - bx);\n blo = bx - bhi;\n b[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n b[1] = s1;\n return 2;\n }\n } else {\n if (ytail === 0) {\n s1 = xtail * ay;\n c = splitter * xtail;\n ahi = c - (c - xtail);\n alo = xtail - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n a[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n a[1] = s1;\n negate = -xtail;\n s1 = negate * by;\n c = splitter * negate;\n ahi = c - (c - negate);\n alo = negate - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n b[0] = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n b[1] = s1;\n return 2;\n } else {\n s1 = xtail * ay;\n c = splitter * xtail;\n ahi = c - (c - xtail);\n alo = xtail - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = ytail * ax;\n c = splitter * ytail;\n ahi = c - (c - ytail);\n alo = ytail - ahi;\n c = splitter * ax;\n bhi = c - (c - ax);\n blo = ax - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n a[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n a[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n a[2] = _j - (u3 - bvirt) + (_i - bvirt);\n a[3] = u3;\n s1 = ytail * bx;\n c = splitter * ytail;\n ahi = c - (c - ytail);\n alo = ytail - ahi;\n c = splitter * bx;\n bhi = c - (c - bx);\n blo = bx - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = xtail * by;\n c = splitter * xtail;\n ahi = c - (c - xtail);\n alo = xtail - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n b[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n b[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n b[2] = _j - (u3 - bvirt) + (_i - bvirt);\n b[3] = u3;\n return 4;\n }\n }\n}\n\nfunction tailadd(finlen, a, b, k, z) {\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, u3;\n s1 = a * b;\n c = splitter * a;\n ahi = c - (c - a);\n alo = a - ahi;\n c = splitter * b;\n bhi = c - (c - b);\n blo = b - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n c = splitter * k;\n bhi = c - (c - k);\n blo = k - bhi;\n _i = s0 * k;\n c = splitter * s0;\n ahi = c - (c - s0);\n alo = s0 - ahi;\n u[0] = alo * blo - (_i - ahi * bhi - alo * bhi - ahi * blo);\n _j = s1 * k;\n c = splitter * s1;\n ahi = c - (c - s1);\n alo = s1 - ahi;\n _0 = alo * blo - (_j - ahi * bhi - alo * bhi - ahi * blo);\n _k = _i + _0;\n bvirt = _k - _i;\n u[1] = _i - (_k - bvirt) + (_0 - bvirt);\n u3 = _j + _k;\n u[2] = _k - (u3 - _j);\n u[3] = u3;\n finlen = finadd(finlen, 4, u);\n if (z !== 0) {\n c = splitter * z;\n bhi = c - (c - z);\n blo = z - bhi;\n _i = s0 * z;\n c = splitter * s0;\n ahi = c - (c - s0);\n alo = s0 - ahi;\n u[0] = alo * blo - (_i - ahi * bhi - alo * bhi - ahi * blo);\n _j = s1 * z;\n c = splitter * s1;\n ahi = c - (c - s1);\n alo = s1 - ahi;\n _0 = alo * blo - (_j - ahi * bhi - alo * bhi - ahi * blo);\n _k = _i + _0;\n bvirt = _k - _i;\n u[1] = _i - (_k - bvirt) + (_0 - bvirt);\n u3 = _j + _k;\n u[2] = _k - (u3 - _j);\n u[3] = u3;\n finlen = finadd(finlen, 4, u);\n }\n return finlen;\n}\n\nfunction orient3dadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, permanent) {\n let finlen;\n let adxtail, bdxtail, cdxtail;\n let adytail, bdytail, cdytail;\n let adztail, bdztail, cdztail;\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _k, _0, s1, s0, t1, t0, u3;\n\n const adx = ax - dx;\n const bdx = bx - dx;\n const cdx = cx - dx;\n const ady = ay - dy;\n const bdy = by - dy;\n const cdy = cy - dy;\n const adz = az - dz;\n const bdz = bz - dz;\n const cdz = cz - dz;\n\n s1 = bdx * cdy;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * cdy;\n bhi = c - (c - cdy);\n blo = cdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cdx * bdy;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * bdy;\n bhi = c - (c - bdy);\n blo = bdy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bc[3] = u3;\n s1 = cdx * ady;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * ady;\n bhi = c - (c - ady);\n blo = ady - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = adx * cdy;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * cdy;\n bhi = c - (c - cdy);\n blo = cdy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ca[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ca[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ca[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ca[3] = u3;\n s1 = adx * bdy;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * bdy;\n bhi = c - (c - bdy);\n blo = bdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bdx * ady;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * ady;\n bhi = c - (c - ady);\n blo = ady - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ab[3] = u3;\n\n finlen = sum(\n sum(\n scale(4, bc, adz, _8), _8,\n scale(4, ca, bdz, _8b), _8b, _16), _16,\n scale(4, ab, cdz, _8), _8, fin);\n\n let det = estimate(finlen, fin);\n let errbound = o3derrboundB * permanent;\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n bvirt = ax - adx;\n adxtail = ax - (adx + bvirt) + (bvirt - dx);\n bvirt = bx - bdx;\n bdxtail = bx - (bdx + bvirt) + (bvirt - dx);\n bvirt = cx - cdx;\n cdxtail = cx - (cdx + bvirt) + (bvirt - dx);\n bvirt = ay - ady;\n adytail = ay - (ady + bvirt) + (bvirt - dy);\n bvirt = by - bdy;\n bdytail = by - (bdy + bvirt) + (bvirt - dy);\n bvirt = cy - cdy;\n cdytail = cy - (cdy + bvirt) + (bvirt - dy);\n bvirt = az - adz;\n adztail = az - (adz + bvirt) + (bvirt - dz);\n bvirt = bz - bdz;\n bdztail = bz - (bdz + bvirt) + (bvirt - dz);\n bvirt = cz - cdz;\n cdztail = cz - (cdz + bvirt) + (bvirt - dz);\n\n if (adxtail === 0 && bdxtail === 0 && cdxtail === 0 &&\n adytail === 0 && bdytail === 0 && cdytail === 0 &&\n adztail === 0 && bdztail === 0 && cdztail === 0) {\n return det;\n }\n\n errbound = o3derrboundC * permanent + resulterrbound * Math.abs(det);\n det +=\n adz * (bdx * cdytail + cdy * bdxtail - (bdy * cdxtail + cdx * bdytail)) + adztail * (bdx * cdy - bdy * cdx) +\n bdz * (cdx * adytail + ady * cdxtail - (cdy * adxtail + adx * cdytail)) + bdztail * (cdx * ady - cdy * adx) +\n cdz * (adx * bdytail + bdy * adxtail - (ady * bdxtail + bdx * adytail)) + cdztail * (adx * bdy - ady * bdx);\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n const at_len = tailinit(adxtail, adytail, bdx, bdy, cdx, cdy, at_b, at_c);\n const bt_len = tailinit(bdxtail, bdytail, cdx, cdy, adx, ady, bt_c, bt_a);\n const ct_len = tailinit(cdxtail, cdytail, adx, ady, bdx, bdy, ct_a, ct_b);\n\n const bctlen = sum(bt_len, bt_c, ct_len, ct_b, bct);\n finlen = finadd(finlen, scale(bctlen, bct, adz, _16), _16);\n\n const catlen = sum(ct_len, ct_a, at_len, at_c, cat);\n finlen = finadd(finlen, scale(catlen, cat, bdz, _16), _16);\n\n const abtlen = sum(at_len, at_b, bt_len, bt_a, abt);\n finlen = finadd(finlen, scale(abtlen, abt, cdz, _16), _16);\n\n if (adztail !== 0) {\n finlen = finadd(finlen, scale(4, bc, adztail, _12), _12);\n finlen = finadd(finlen, scale(bctlen, bct, adztail, _16), _16);\n }\n if (bdztail !== 0) {\n finlen = finadd(finlen, scale(4, ca, bdztail, _12), _12);\n finlen = finadd(finlen, scale(catlen, cat, bdztail, _16), _16);\n }\n if (cdztail !== 0) {\n finlen = finadd(finlen, scale(4, ab, cdztail, _12), _12);\n finlen = finadd(finlen, scale(abtlen, abt, cdztail, _16), _16);\n }\n\n if (adxtail !== 0) {\n if (bdytail !== 0) {\n finlen = tailadd(finlen, adxtail, bdytail, cdz, cdztail);\n }\n if (cdytail !== 0) {\n finlen = tailadd(finlen, -adxtail, cdytail, bdz, bdztail);\n }\n }\n if (bdxtail !== 0) {\n if (cdytail !== 0) {\n finlen = tailadd(finlen, bdxtail, cdytail, adz, adztail);\n }\n if (adytail !== 0) {\n finlen = tailadd(finlen, -bdxtail, adytail, cdz, cdztail);\n }\n }\n if (cdxtail !== 0) {\n if (adytail !== 0) {\n finlen = tailadd(finlen, cdxtail, adytail, bdz, bdztail);\n }\n if (bdytail !== 0) {\n finlen = tailadd(finlen, -cdxtail, bdytail, adz, adztail);\n }\n }\n\n return fin[finlen - 1];\n}\n\nexport function orient3d(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz) {\n const adx = ax - dx;\n const bdx = bx - dx;\n const cdx = cx - dx;\n const ady = ay - dy;\n const bdy = by - dy;\n const cdy = cy - dy;\n const adz = az - dz;\n const bdz = bz - dz;\n const cdz = cz - dz;\n\n const bdxcdy = bdx * cdy;\n const cdxbdy = cdx * bdy;\n\n const cdxady = cdx * ady;\n const adxcdy = adx * cdy;\n\n const adxbdy = adx * bdy;\n const bdxady = bdx * ady;\n\n const det =\n adz * (bdxcdy - cdxbdy) +\n bdz * (cdxady - adxcdy) +\n cdz * (adxbdy - bdxady);\n\n const permanent =\n (Math.abs(bdxcdy) + Math.abs(cdxbdy)) * Math.abs(adz) +\n (Math.abs(cdxady) + Math.abs(adxcdy)) * Math.abs(bdz) +\n (Math.abs(adxbdy) + Math.abs(bdxady)) * Math.abs(cdz);\n\n const errbound = o3derrboundA * permanent;\n if (det > errbound || -det > errbound) {\n return det;\n }\n\n return orient3dadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, permanent);\n}\n\nexport function orient3dfast(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz) {\n const adx = ax - dx;\n const bdx = bx - dx;\n const cdx = cx - dx;\n const ady = ay - dy;\n const bdy = by - dy;\n const cdy = cy - dy;\n const adz = az - dz;\n const bdz = bz - dz;\n const cdz = cz - dz;\n\n return adx * (bdy * cdz - bdz * cdy) +\n bdx * (cdy * adz - cdz * ady) +\n cdx * (ady * bdz - adz * bdy);\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, sum_three, scale} from './util.js';\n\nconst iccerrboundA = (10 + 96 * epsilon) * epsilon;\nconst iccerrboundB = (4 + 48 * epsilon) * epsilon;\nconst iccerrboundC = (44 + 576 * epsilon) * epsilon * epsilon;\n\nconst bc = vec(4);\nconst ca = vec(4);\nconst ab = vec(4);\nconst aa = vec(4);\nconst bb = vec(4);\nconst cc = vec(4);\nconst u = vec(4);\nconst v = vec(4);\nconst axtbc = vec(8);\nconst aytbc = vec(8);\nconst bxtca = vec(8);\nconst bytca = vec(8);\nconst cxtab = vec(8);\nconst cytab = vec(8);\nconst abt = vec(8);\nconst bct = vec(8);\nconst cat = vec(8);\nconst abtt = vec(4);\nconst bctt = vec(4);\nconst catt = vec(4);\n\nconst _8 = vec(8);\nconst _16 = vec(16);\nconst _16b = vec(16);\nconst _16c = vec(16);\nconst _32 = vec(32);\nconst _32b = vec(32);\nconst _48 = vec(48);\nconst _64 = vec(64);\n\nlet fin = vec(1152);\nlet fin2 = vec(1152);\n\nfunction finadd(finlen, a, alen) {\n finlen = sum(finlen, fin, a, alen, fin2);\n const tmp = fin; fin = fin2; fin2 = tmp;\n return finlen;\n}\n\nfunction incircleadapt(ax, ay, bx, by, cx, cy, dx, dy, permanent) {\n let finlen;\n let adxtail, bdxtail, cdxtail, adytail, bdytail, cdytail;\n let axtbclen, aytbclen, bxtcalen, bytcalen, cxtablen, cytablen;\n let abtlen, bctlen, catlen;\n let abttlen, bcttlen, cattlen;\n let n1, n0;\n\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n const adx = ax - dx;\n const bdx = bx - dx;\n const cdx = cx - dx;\n const ady = ay - dy;\n const bdy = by - dy;\n const cdy = cy - dy;\n\n s1 = bdx * cdy;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * cdy;\n bhi = c - (c - cdy);\n blo = cdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cdx * bdy;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * bdy;\n bhi = c - (c - bdy);\n blo = bdy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bc[3] = u3;\n s1 = cdx * ady;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * ady;\n bhi = c - (c - ady);\n blo = ady - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = adx * cdy;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * cdy;\n bhi = c - (c - cdy);\n blo = cdy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ca[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ca[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ca[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ca[3] = u3;\n s1 = adx * bdy;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * bdy;\n bhi = c - (c - bdy);\n blo = bdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bdx * ady;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * ady;\n bhi = c - (c - ady);\n blo = ady - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ab[3] = u3;\n\n finlen = sum(\n sum(\n sum(\n scale(scale(4, bc, adx, _8), _8, adx, _16), _16,\n scale(scale(4, bc, ady, _8), _8, ady, _16b), _16b, _32), _32,\n sum(\n scale(scale(4, ca, bdx, _8), _8, bdx, _16), _16,\n scale(scale(4, ca, bdy, _8), _8, bdy, _16b), _16b, _32b), _32b, _64), _64,\n sum(\n scale(scale(4, ab, cdx, _8), _8, cdx, _16), _16,\n scale(scale(4, ab, cdy, _8), _8, cdy, _16b), _16b, _32), _32, fin);\n\n let det = estimate(finlen, fin);\n let errbound = iccerrboundB * permanent;\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n bvirt = ax - adx;\n adxtail = ax - (adx + bvirt) + (bvirt - dx);\n bvirt = ay - ady;\n adytail = ay - (ady + bvirt) + (bvirt - dy);\n bvirt = bx - bdx;\n bdxtail = bx - (bdx + bvirt) + (bvirt - dx);\n bvirt = by - bdy;\n bdytail = by - (bdy + bvirt) + (bvirt - dy);\n bvirt = cx - cdx;\n cdxtail = cx - (cdx + bvirt) + (bvirt - dx);\n bvirt = cy - cdy;\n cdytail = cy - (cdy + bvirt) + (bvirt - dy);\n if (adxtail === 0 && bdxtail === 0 && cdxtail === 0 && adytail === 0 && bdytail === 0 && cdytail === 0) {\n return det;\n }\n\n errbound = iccerrboundC * permanent + resulterrbound * Math.abs(det);\n det += ((adx * adx + ady * ady) * ((bdx * cdytail + cdy * bdxtail) - (bdy * cdxtail + cdx * bdytail)) +\n 2 * (adx * adxtail + ady * adytail) * (bdx * cdy - bdy * cdx)) +\n ((bdx * bdx + bdy * bdy) * ((cdx * adytail + ady * cdxtail) - (cdy * adxtail + adx * cdytail)) +\n 2 * (bdx * bdxtail + bdy * bdytail) * (cdx * ady - cdy * adx)) +\n ((cdx * cdx + cdy * cdy) * ((adx * bdytail + bdy * adxtail) - (ady * bdxtail + bdx * adytail)) +\n 2 * (cdx * cdxtail + cdy * cdytail) * (adx * bdy - ady * bdx));\n\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n if (bdxtail !== 0 || bdytail !== 0 || cdxtail !== 0 || cdytail !== 0) {\n s1 = adx * adx;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n t1 = ady * ady;\n c = splitter * ady;\n ahi = c - (c - ady);\n alo = ady - ahi;\n t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n _i = s0 + t0;\n bvirt = _i - s0;\n aa[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n aa[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n aa[2] = _j - (u3 - bvirt) + (_i - bvirt);\n aa[3] = u3;\n }\n if (cdxtail !== 0 || cdytail !== 0 || adxtail !== 0 || adytail !== 0) {\n s1 = bdx * bdx;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n t1 = bdy * bdy;\n c = splitter * bdy;\n ahi = c - (c - bdy);\n alo = bdy - ahi;\n t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n _i = s0 + t0;\n bvirt = _i - s0;\n bb[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n bb[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bb[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bb[3] = u3;\n }\n if (adxtail !== 0 || adytail !== 0 || bdxtail !== 0 || bdytail !== 0) {\n s1 = cdx * cdx;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n s0 = alo * alo - (s1 - ahi * ahi - (ahi + ahi) * alo);\n t1 = cdy * cdy;\n c = splitter * cdy;\n ahi = c - (c - cdy);\n alo = cdy - ahi;\n t0 = alo * alo - (t1 - ahi * ahi - (ahi + ahi) * alo);\n _i = s0 + t0;\n bvirt = _i - s0;\n cc[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n cc[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n cc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n cc[3] = u3;\n }\n\n if (adxtail !== 0) {\n axtbclen = scale(4, bc, adxtail, axtbc);\n finlen = finadd(finlen, sum_three(\n scale(axtbclen, axtbc, 2 * adx, _16), _16,\n scale(scale(4, cc, adxtail, _8), _8, bdy, _16b), _16b,\n scale(scale(4, bb, adxtail, _8), _8, -cdy, _16c), _16c, _32, _48), _48);\n }\n if (adytail !== 0) {\n aytbclen = scale(4, bc, adytail, aytbc);\n finlen = finadd(finlen, sum_three(\n scale(aytbclen, aytbc, 2 * ady, _16), _16,\n scale(scale(4, bb, adytail, _8), _8, cdx, _16b), _16b,\n scale(scale(4, cc, adytail, _8), _8, -bdx, _16c), _16c, _32, _48), _48);\n }\n if (bdxtail !== 0) {\n bxtcalen = scale(4, ca, bdxtail, bxtca);\n finlen = finadd(finlen, sum_three(\n scale(bxtcalen, bxtca, 2 * bdx, _16), _16,\n scale(scale(4, aa, bdxtail, _8), _8, cdy, _16b), _16b,\n scale(scale(4, cc, bdxtail, _8), _8, -ady, _16c), _16c, _32, _48), _48);\n }\n if (bdytail !== 0) {\n bytcalen = scale(4, ca, bdytail, bytca);\n finlen = finadd(finlen, sum_three(\n scale(bytcalen, bytca, 2 * bdy, _16), _16,\n scale(scale(4, cc, bdytail, _8), _8, adx, _16b), _16b,\n scale(scale(4, aa, bdytail, _8), _8, -cdx, _16c), _16c, _32, _48), _48);\n }\n if (cdxtail !== 0) {\n cxtablen = scale(4, ab, cdxtail, cxtab);\n finlen = finadd(finlen, sum_three(\n scale(cxtablen, cxtab, 2 * cdx, _16), _16,\n scale(scale(4, bb, cdxtail, _8), _8, ady, _16b), _16b,\n scale(scale(4, aa, cdxtail, _8), _8, -bdy, _16c), _16c, _32, _48), _48);\n }\n if (cdytail !== 0) {\n cytablen = scale(4, ab, cdytail, cytab);\n finlen = finadd(finlen, sum_three(\n scale(cytablen, cytab, 2 * cdy, _16), _16,\n scale(scale(4, aa, cdytail, _8), _8, bdx, _16b), _16b,\n scale(scale(4, bb, cdytail, _8), _8, -adx, _16c), _16c, _32, _48), _48);\n }\n\n if (adxtail !== 0 || adytail !== 0) {\n if (bdxtail !== 0 || bdytail !== 0 || cdxtail !== 0 || cdytail !== 0) {\n s1 = bdxtail * cdy;\n c = splitter * bdxtail;\n ahi = c - (c - bdxtail);\n alo = bdxtail - ahi;\n c = splitter * cdy;\n bhi = c - (c - cdy);\n blo = cdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bdx * cdytail;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * cdytail;\n bhi = c - (c - cdytail);\n blo = cdytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n s1 = cdxtail * -bdy;\n c = splitter * cdxtail;\n ahi = c - (c - cdxtail);\n alo = cdxtail - ahi;\n c = splitter * -bdy;\n bhi = c - (c - -bdy);\n blo = -bdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cdx * -bdytail;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * -bdytail;\n bhi = c - (c - -bdytail);\n blo = -bdytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n v[3] = u3;\n bctlen = sum(4, u, 4, v, bct);\n s1 = bdxtail * cdytail;\n c = splitter * bdxtail;\n ahi = c - (c - bdxtail);\n alo = bdxtail - ahi;\n c = splitter * cdytail;\n bhi = c - (c - cdytail);\n blo = cdytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cdxtail * bdytail;\n c = splitter * cdxtail;\n ahi = c - (c - cdxtail);\n alo = cdxtail - ahi;\n c = splitter * bdytail;\n bhi = c - (c - bdytail);\n blo = bdytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bctt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bctt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bctt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bctt[3] = u3;\n bcttlen = 4;\n } else {\n bct[0] = 0;\n bctlen = 1;\n bctt[0] = 0;\n bcttlen = 1;\n }\n if (adxtail !== 0) {\n const len = scale(bctlen, bct, adxtail, _16c);\n finlen = finadd(finlen, sum(\n scale(axtbclen, axtbc, adxtail, _16), _16,\n scale(len, _16c, 2 * adx, _32), _32, _48), _48);\n\n const len2 = scale(bcttlen, bctt, adxtail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * adx, _16), _16,\n scale(len2, _8, adxtail, _16b), _16b,\n scale(len, _16c, adxtail, _32), _32, _32b, _64), _64);\n\n if (bdytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, cc, adxtail, _8), _8, bdytail, _16), _16);\n }\n if (cdytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, bb, -adxtail, _8), _8, cdytail, _16), _16);\n }\n }\n if (adytail !== 0) {\n const len = scale(bctlen, bct, adytail, _16c);\n finlen = finadd(finlen, sum(\n scale(aytbclen, aytbc, adytail, _16), _16,\n scale(len, _16c, 2 * ady, _32), _32, _48), _48);\n\n const len2 = scale(bcttlen, bctt, adytail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * ady, _16), _16,\n scale(len2, _8, adytail, _16b), _16b,\n scale(len, _16c, adytail, _32), _32, _32b, _64), _64);\n }\n }\n if (bdxtail !== 0 || bdytail !== 0) {\n if (cdxtail !== 0 || cdytail !== 0 || adxtail !== 0 || adytail !== 0) {\n s1 = cdxtail * ady;\n c = splitter * cdxtail;\n ahi = c - (c - cdxtail);\n alo = cdxtail - ahi;\n c = splitter * ady;\n bhi = c - (c - ady);\n blo = ady - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cdx * adytail;\n c = splitter * cdx;\n ahi = c - (c - cdx);\n alo = cdx - ahi;\n c = splitter * adytail;\n bhi = c - (c - adytail);\n blo = adytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n n1 = -cdy;\n n0 = -cdytail;\n s1 = adxtail * n1;\n c = splitter * adxtail;\n ahi = c - (c - adxtail);\n alo = adxtail - ahi;\n c = splitter * n1;\n bhi = c - (c - n1);\n blo = n1 - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = adx * n0;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * n0;\n bhi = c - (c - n0);\n blo = n0 - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n v[3] = u3;\n catlen = sum(4, u, 4, v, cat);\n s1 = cdxtail * adytail;\n c = splitter * cdxtail;\n ahi = c - (c - cdxtail);\n alo = cdxtail - ahi;\n c = splitter * adytail;\n bhi = c - (c - adytail);\n blo = adytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = adxtail * cdytail;\n c = splitter * adxtail;\n ahi = c - (c - adxtail);\n alo = adxtail - ahi;\n c = splitter * cdytail;\n bhi = c - (c - cdytail);\n blo = cdytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n catt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n catt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n catt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n catt[3] = u3;\n cattlen = 4;\n } else {\n cat[0] = 0;\n catlen = 1;\n catt[0] = 0;\n cattlen = 1;\n }\n if (bdxtail !== 0) {\n const len = scale(catlen, cat, bdxtail, _16c);\n finlen = finadd(finlen, sum(\n scale(bxtcalen, bxtca, bdxtail, _16), _16,\n scale(len, _16c, 2 * bdx, _32), _32, _48), _48);\n\n const len2 = scale(cattlen, catt, bdxtail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * bdx, _16), _16,\n scale(len2, _8, bdxtail, _16b), _16b,\n scale(len, _16c, bdxtail, _32), _32, _32b, _64), _64);\n\n if (cdytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, aa, bdxtail, _8), _8, cdytail, _16), _16);\n }\n if (adytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, cc, -bdxtail, _8), _8, adytail, _16), _16);\n }\n }\n if (bdytail !== 0) {\n const len = scale(catlen, cat, bdytail, _16c);\n finlen = finadd(finlen, sum(\n scale(bytcalen, bytca, bdytail, _16), _16,\n scale(len, _16c, 2 * bdy, _32), _32, _48), _48);\n\n const len2 = scale(cattlen, catt, bdytail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * bdy, _16), _16,\n scale(len2, _8, bdytail, _16b), _16b,\n scale(len, _16c, bdytail, _32), _32, _32b, _64), _64);\n }\n }\n if (cdxtail !== 0 || cdytail !== 0) {\n if (adxtail !== 0 || adytail !== 0 || bdxtail !== 0 || bdytail !== 0) {\n s1 = adxtail * bdy;\n c = splitter * adxtail;\n ahi = c - (c - adxtail);\n alo = adxtail - ahi;\n c = splitter * bdy;\n bhi = c - (c - bdy);\n blo = bdy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = adx * bdytail;\n c = splitter * adx;\n ahi = c - (c - adx);\n alo = adx - ahi;\n c = splitter * bdytail;\n bhi = c - (c - bdytail);\n blo = bdytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n u[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n u[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n u[2] = _j - (u3 - bvirt) + (_i - bvirt);\n u[3] = u3;\n n1 = -ady;\n n0 = -adytail;\n s1 = bdxtail * n1;\n c = splitter * bdxtail;\n ahi = c - (c - bdxtail);\n alo = bdxtail - ahi;\n c = splitter * n1;\n bhi = c - (c - n1);\n blo = n1 - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bdx * n0;\n c = splitter * bdx;\n ahi = c - (c - bdx);\n alo = bdx - ahi;\n c = splitter * n0;\n bhi = c - (c - n0);\n blo = n0 - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 + t0;\n bvirt = _i - s0;\n v[0] = s0 - (_i - bvirt) + (t0 - bvirt);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 + t1;\n bvirt = _i - _0;\n v[1] = _0 - (_i - bvirt) + (t1 - bvirt);\n u3 = _j + _i;\n bvirt = u3 - _j;\n v[2] = _j - (u3 - bvirt) + (_i - bvirt);\n v[3] = u3;\n abtlen = sum(4, u, 4, v, abt);\n s1 = adxtail * bdytail;\n c = splitter * adxtail;\n ahi = c - (c - adxtail);\n alo = adxtail - ahi;\n c = splitter * bdytail;\n bhi = c - (c - bdytail);\n blo = bdytail - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bdxtail * adytail;\n c = splitter * bdxtail;\n ahi = c - (c - bdxtail);\n alo = bdxtail - ahi;\n c = splitter * adytail;\n bhi = c - (c - adytail);\n blo = adytail - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n abtt[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n abtt[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n abtt[2] = _j - (u3 - bvirt) + (_i - bvirt);\n abtt[3] = u3;\n abttlen = 4;\n } else {\n abt[0] = 0;\n abtlen = 1;\n abtt[0] = 0;\n abttlen = 1;\n }\n if (cdxtail !== 0) {\n const len = scale(abtlen, abt, cdxtail, _16c);\n finlen = finadd(finlen, sum(\n scale(cxtablen, cxtab, cdxtail, _16), _16,\n scale(len, _16c, 2 * cdx, _32), _32, _48), _48);\n\n const len2 = scale(abttlen, abtt, cdxtail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * cdx, _16), _16,\n scale(len2, _8, cdxtail, _16b), _16b,\n scale(len, _16c, cdxtail, _32), _32, _32b, _64), _64);\n\n if (adytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, bb, cdxtail, _8), _8, adytail, _16), _16);\n }\n if (bdytail !== 0) {\n finlen = finadd(finlen, scale(scale(4, aa, -cdxtail, _8), _8, bdytail, _16), _16);\n }\n }\n if (cdytail !== 0) {\n const len = scale(abtlen, abt, cdytail, _16c);\n finlen = finadd(finlen, sum(\n scale(cytablen, cytab, cdytail, _16), _16,\n scale(len, _16c, 2 * cdy, _32), _32, _48), _48);\n\n const len2 = scale(abttlen, abtt, cdytail, _8);\n finlen = finadd(finlen, sum_three(\n scale(len2, _8, 2 * cdy, _16), _16,\n scale(len2, _8, cdytail, _16b), _16b,\n scale(len, _16c, cdytail, _32), _32, _32b, _64), _64);\n }\n }\n\n return fin[finlen - 1];\n}\n\nexport function incircle(ax, ay, bx, by, cx, cy, dx, dy) {\n const adx = ax - dx;\n const bdx = bx - dx;\n const cdx = cx - dx;\n const ady = ay - dy;\n const bdy = by - dy;\n const cdy = cy - dy;\n\n const bdxcdy = bdx * cdy;\n const cdxbdy = cdx * bdy;\n const alift = adx * adx + ady * ady;\n\n const cdxady = cdx * ady;\n const adxcdy = adx * cdy;\n const blift = bdx * bdx + bdy * bdy;\n\n const adxbdy = adx * bdy;\n const bdxady = bdx * ady;\n const clift = cdx * cdx + cdy * cdy;\n\n const det =\n alift * (bdxcdy - cdxbdy) +\n blift * (cdxady - adxcdy) +\n clift * (adxbdy - bdxady);\n\n const permanent =\n (Math.abs(bdxcdy) + Math.abs(cdxbdy)) * alift +\n (Math.abs(cdxady) + Math.abs(adxcdy)) * blift +\n (Math.abs(adxbdy) + Math.abs(bdxady)) * clift;\n\n const errbound = iccerrboundA * permanent;\n\n if (det > errbound || -det > errbound) {\n return det;\n }\n return incircleadapt(ax, ay, bx, by, cx, cy, dx, dy, permanent);\n}\n\nexport function incirclefast(ax, ay, bx, by, cx, cy, dx, dy) {\n const adx = ax - dx;\n const ady = ay - dy;\n const bdx = bx - dx;\n const bdy = by - dy;\n const cdx = cx - dx;\n const cdy = cy - dy;\n\n const abdet = adx * bdy - bdx * ady;\n const bcdet = bdx * cdy - cdx * bdy;\n const cadet = cdx * ady - adx * cdy;\n const alift = adx * adx + ady * ady;\n const blift = bdx * bdx + bdy * bdy;\n const clift = cdx * cdx + cdy * cdy;\n\n return alift * bcdet + blift * cadet + clift * abdet;\n}\n","import {epsilon, splitter, resulterrbound, estimate, vec, sum, sum_three, scale, negate} from './util.js';\n\nconst isperrboundA = (16 + 224 * epsilon) * epsilon;\nconst isperrboundB = (5 + 72 * epsilon) * epsilon;\nconst isperrboundC = (71 + 1408 * epsilon) * epsilon * epsilon;\n\nconst ab = vec(4);\nconst bc = vec(4);\nconst cd = vec(4);\nconst de = vec(4);\nconst ea = vec(4);\nconst ac = vec(4);\nconst bd = vec(4);\nconst ce = vec(4);\nconst da = vec(4);\nconst eb = vec(4);\n\nconst abc = vec(24);\nconst bcd = vec(24);\nconst cde = vec(24);\nconst dea = vec(24);\nconst eab = vec(24);\nconst abd = vec(24);\nconst bce = vec(24);\nconst cda = vec(24);\nconst deb = vec(24);\nconst eac = vec(24);\n\nconst adet = vec(1152);\nconst bdet = vec(1152);\nconst cdet = vec(1152);\nconst ddet = vec(1152);\nconst edet = vec(1152);\nconst abdet = vec(2304);\nconst cddet = vec(2304);\nconst cdedet = vec(3456);\nconst deter = vec(5760);\n\nconst _8 = vec(8);\nconst _8b = vec(8);\nconst _8c = vec(8);\nconst _16 = vec(16);\nconst _24 = vec(24);\nconst _48 = vec(48);\nconst _48b = vec(48);\nconst _96 = vec(96);\nconst _192 = vec(192);\nconst _384x = vec(384);\nconst _384y = vec(384);\nconst _384z = vec(384);\nconst _768 = vec(768);\n\nfunction sum_three_scale(a, b, c, az, bz, cz, out) {\n return sum_three(\n scale(4, a, az, _8), _8,\n scale(4, b, bz, _8b), _8b,\n scale(4, c, cz, _8c), _8c, _16, out);\n}\n\nfunction liftexact(alen, a, blen, b, clen, c, dlen, d, x, y, z, out) {\n const len = sum(\n sum(alen, a, blen, b, _48), _48,\n negate(sum(clen, c, dlen, d, _48b), _48b), _48b, _96);\n\n return sum_three(\n scale(scale(len, _96, x, _192), _192, x, _384x), _384x,\n scale(scale(len, _96, y, _192), _192, y, _384y), _384y,\n scale(scale(len, _96, z, _192), _192, z, _384z), _384z, _768, out);\n}\n\nfunction insphereexact(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez) {\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0, u3;\n\n s1 = ax * by;\n c = splitter * ax;\n ahi = c - (c - ax);\n alo = ax - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bx * ay;\n c = splitter * bx;\n ahi = c - (c - bx);\n alo = bx - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ab[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ab[3] = u3;\n s1 = bx * cy;\n c = splitter * bx;\n ahi = c - (c - bx);\n alo = bx - ahi;\n c = splitter * cy;\n bhi = c - (c - cy);\n blo = cy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cx * by;\n c = splitter * cx;\n ahi = c - (c - cx);\n alo = cx - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bc[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bc[3] = u3;\n s1 = cx * dy;\n c = splitter * cx;\n ahi = c - (c - cx);\n alo = cx - ahi;\n c = splitter * dy;\n bhi = c - (c - dy);\n blo = dy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = dx * cy;\n c = splitter * dx;\n ahi = c - (c - dx);\n alo = dx - ahi;\n c = splitter * cy;\n bhi = c - (c - cy);\n blo = cy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n cd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n cd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n cd[2] = _j - (u3 - bvirt) + (_i - bvirt);\n cd[3] = u3;\n s1 = dx * ey;\n c = splitter * dx;\n ahi = c - (c - dx);\n alo = dx - ahi;\n c = splitter * ey;\n bhi = c - (c - ey);\n blo = ey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = ex * dy;\n c = splitter * ex;\n ahi = c - (c - ex);\n alo = ex - ahi;\n c = splitter * dy;\n bhi = c - (c - dy);\n blo = dy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n de[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n de[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n de[2] = _j - (u3 - bvirt) + (_i - bvirt);\n de[3] = u3;\n s1 = ex * ay;\n c = splitter * ex;\n ahi = c - (c - ex);\n alo = ex - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = ax * ey;\n c = splitter * ax;\n ahi = c - (c - ax);\n alo = ax - ahi;\n c = splitter * ey;\n bhi = c - (c - ey);\n blo = ey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ea[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ea[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ea[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ea[3] = u3;\n s1 = ax * cy;\n c = splitter * ax;\n ahi = c - (c - ax);\n alo = ax - ahi;\n c = splitter * cy;\n bhi = c - (c - cy);\n blo = cy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cx * ay;\n c = splitter * cx;\n ahi = c - (c - cx);\n alo = cx - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ac[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ac[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ac[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ac[3] = u3;\n s1 = bx * dy;\n c = splitter * bx;\n ahi = c - (c - bx);\n alo = bx - ahi;\n c = splitter * dy;\n bhi = c - (c - dy);\n blo = dy - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = dx * by;\n c = splitter * dx;\n ahi = c - (c - dx);\n alo = dx - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n bd[2] = _j - (u3 - bvirt) + (_i - bvirt);\n bd[3] = u3;\n s1 = cx * ey;\n c = splitter * cx;\n ahi = c - (c - cx);\n alo = cx - ahi;\n c = splitter * ey;\n bhi = c - (c - ey);\n blo = ey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = ex * cy;\n c = splitter * ex;\n ahi = c - (c - ex);\n alo = ex - ahi;\n c = splitter * cy;\n bhi = c - (c - cy);\n blo = cy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ce[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ce[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n ce[2] = _j - (u3 - bvirt) + (_i - bvirt);\n ce[3] = u3;\n s1 = dx * ay;\n c = splitter * dx;\n ahi = c - (c - dx);\n alo = dx - ahi;\n c = splitter * ay;\n bhi = c - (c - ay);\n blo = ay - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = ax * dy;\n c = splitter * ax;\n ahi = c - (c - ax);\n alo = ax - ahi;\n c = splitter * dy;\n bhi = c - (c - dy);\n blo = dy - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n da[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n da[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n da[2] = _j - (u3 - bvirt) + (_i - bvirt);\n da[3] = u3;\n s1 = ex * by;\n c = splitter * ex;\n ahi = c - (c - ex);\n alo = ex - ahi;\n c = splitter * by;\n bhi = c - (c - by);\n blo = by - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bx * ey;\n c = splitter * bx;\n ahi = c - (c - bx);\n alo = bx - ahi;\n c = splitter * ey;\n bhi = c - (c - ey);\n blo = ey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n eb[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n eb[1] = _0 - (_i + bvirt) + (bvirt - t1);\n u3 = _j + _i;\n bvirt = u3 - _j;\n eb[2] = _j - (u3 - bvirt) + (_i - bvirt);\n eb[3] = u3;\n\n const abclen = sum_three_scale(ab, bc, ac, cz, az, -bz, abc);\n const bcdlen = sum_three_scale(bc, cd, bd, dz, bz, -cz, bcd);\n const cdelen = sum_three_scale(cd, de, ce, ez, cz, -dz, cde);\n const dealen = sum_three_scale(de, ea, da, az, dz, -ez, dea);\n const eablen = sum_three_scale(ea, ab, eb, bz, ez, -az, eab);\n const abdlen = sum_three_scale(ab, bd, da, dz, az, bz, abd);\n const bcelen = sum_three_scale(bc, ce, eb, ez, bz, cz, bce);\n const cdalen = sum_three_scale(cd, da, ac, az, cz, dz, cda);\n const deblen = sum_three_scale(de, eb, bd, bz, dz, ez, deb);\n const eaclen = sum_three_scale(ea, ac, ce, cz, ez, az, eac);\n\n const deterlen = sum_three(\n liftexact(cdelen, cde, bcelen, bce, deblen, deb, bcdlen, bcd, ax, ay, az, adet), adet,\n liftexact(dealen, dea, cdalen, cda, eaclen, eac, cdelen, cde, bx, by, bz, bdet), bdet,\n sum_three(\n liftexact(eablen, eab, deblen, deb, abdlen, abd, dealen, dea, cx, cy, cz, cdet), cdet,\n liftexact(abclen, abc, eaclen, eac, bcelen, bce, eablen, eab, dx, dy, dz, ddet), ddet,\n liftexact(bcdlen, bcd, abdlen, abd, cdalen, cda, abclen, abc, ex, ey, ez, edet), edet, cddet, cdedet), cdedet, abdet, deter);\n\n return deter[deterlen - 1];\n}\n\nconst xdet = vec(96);\nconst ydet = vec(96);\nconst zdet = vec(96);\nconst fin = vec(1152);\n\nfunction liftadapt(a, b, c, az, bz, cz, x, y, z, out) {\n const len = sum_three_scale(a, b, c, az, bz, cz, _24);\n return sum_three(\n scale(scale(len, _24, x, _48), _48, x, xdet), xdet,\n scale(scale(len, _24, y, _48), _48, y, ydet), ydet,\n scale(scale(len, _24, z, _48), _48, z, zdet), zdet, _192, out);\n}\n\nfunction insphereadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez, permanent) {\n let ab3, bc3, cd3, da3, ac3, bd3;\n\n let aextail, bextail, cextail, dextail;\n let aeytail, beytail, ceytail, deytail;\n let aeztail, beztail, ceztail, deztail;\n\n let bvirt, c, ahi, alo, bhi, blo, _i, _j, _0, s1, s0, t1, t0;\n\n const aex = ax - ex;\n const bex = bx - ex;\n const cex = cx - ex;\n const dex = dx - ex;\n const aey = ay - ey;\n const bey = by - ey;\n const cey = cy - ey;\n const dey = dy - ey;\n const aez = az - ez;\n const bez = bz - ez;\n const cez = cz - ez;\n const dez = dz - ez;\n\n s1 = aex * bey;\n c = splitter * aex;\n ahi = c - (c - aex);\n alo = aex - ahi;\n c = splitter * bey;\n bhi = c - (c - bey);\n blo = bey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = bex * aey;\n c = splitter * bex;\n ahi = c - (c - bex);\n alo = bex - ahi;\n c = splitter * aey;\n bhi = c - (c - aey);\n blo = aey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ab[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ab[1] = _0 - (_i + bvirt) + (bvirt - t1);\n ab3 = _j + _i;\n bvirt = ab3 - _j;\n ab[2] = _j - (ab3 - bvirt) + (_i - bvirt);\n ab[3] = ab3;\n s1 = bex * cey;\n c = splitter * bex;\n ahi = c - (c - bex);\n alo = bex - ahi;\n c = splitter * cey;\n bhi = c - (c - cey);\n blo = cey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cex * bey;\n c = splitter * cex;\n ahi = c - (c - cex);\n alo = cex - ahi;\n c = splitter * bey;\n bhi = c - (c - bey);\n blo = bey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bc[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bc[1] = _0 - (_i + bvirt) + (bvirt - t1);\n bc3 = _j + _i;\n bvirt = bc3 - _j;\n bc[2] = _j - (bc3 - bvirt) + (_i - bvirt);\n bc[3] = bc3;\n s1 = cex * dey;\n c = splitter * cex;\n ahi = c - (c - cex);\n alo = cex - ahi;\n c = splitter * dey;\n bhi = c - (c - dey);\n blo = dey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = dex * cey;\n c = splitter * dex;\n ahi = c - (c - dex);\n alo = dex - ahi;\n c = splitter * cey;\n bhi = c - (c - cey);\n blo = cey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n cd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n cd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n cd3 = _j + _i;\n bvirt = cd3 - _j;\n cd[2] = _j - (cd3 - bvirt) + (_i - bvirt);\n cd[3] = cd3;\n s1 = dex * aey;\n c = splitter * dex;\n ahi = c - (c - dex);\n alo = dex - ahi;\n c = splitter * aey;\n bhi = c - (c - aey);\n blo = aey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = aex * dey;\n c = splitter * aex;\n ahi = c - (c - aex);\n alo = aex - ahi;\n c = splitter * dey;\n bhi = c - (c - dey);\n blo = dey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n da[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n da[1] = _0 - (_i + bvirt) + (bvirt - t1);\n da3 = _j + _i;\n bvirt = da3 - _j;\n da[2] = _j - (da3 - bvirt) + (_i - bvirt);\n da[3] = da3;\n s1 = aex * cey;\n c = splitter * aex;\n ahi = c - (c - aex);\n alo = aex - ahi;\n c = splitter * cey;\n bhi = c - (c - cey);\n blo = cey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = cex * aey;\n c = splitter * cex;\n ahi = c - (c - cex);\n alo = cex - ahi;\n c = splitter * aey;\n bhi = c - (c - aey);\n blo = aey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n ac[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n ac[1] = _0 - (_i + bvirt) + (bvirt - t1);\n ac3 = _j + _i;\n bvirt = ac3 - _j;\n ac[2] = _j - (ac3 - bvirt) + (_i - bvirt);\n ac[3] = ac3;\n s1 = bex * dey;\n c = splitter * bex;\n ahi = c - (c - bex);\n alo = bex - ahi;\n c = splitter * dey;\n bhi = c - (c - dey);\n blo = dey - bhi;\n s0 = alo * blo - (s1 - ahi * bhi - alo * bhi - ahi * blo);\n t1 = dex * bey;\n c = splitter * dex;\n ahi = c - (c - dex);\n alo = dex - ahi;\n c = splitter * bey;\n bhi = c - (c - bey);\n blo = bey - bhi;\n t0 = alo * blo - (t1 - ahi * bhi - alo * bhi - ahi * blo);\n _i = s0 - t0;\n bvirt = s0 - _i;\n bd[0] = s0 - (_i + bvirt) + (bvirt - t0);\n _j = s1 + _i;\n bvirt = _j - s1;\n _0 = s1 - (_j - bvirt) + (_i - bvirt);\n _i = _0 - t1;\n bvirt = _0 - _i;\n bd[1] = _0 - (_i + bvirt) + (bvirt - t1);\n bd3 = _j + _i;\n bvirt = bd3 - _j;\n bd[2] = _j - (bd3 - bvirt) + (_i - bvirt);\n bd[3] = bd3;\n\n const finlen = sum(\n sum(\n negate(liftadapt(bc, cd, bd, dez, bez, -cez, aex, aey, aez, adet), adet), adet,\n liftadapt(cd, da, ac, aez, cez, dez, bex, bey, bez, bdet), bdet, abdet), abdet,\n sum(\n negate(liftadapt(da, ab, bd, bez, dez, aez, cex, cey, cez, cdet), cdet), cdet,\n liftadapt(ab, bc, ac, cez, aez, -bez, dex, dey, dez, ddet), ddet, cddet), cddet, fin);\n\n let det = estimate(finlen, fin);\n let errbound = isperrboundB * permanent;\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n bvirt = ax - aex;\n aextail = ax - (aex + bvirt) + (bvirt - ex);\n bvirt = ay - aey;\n aeytail = ay - (aey + bvirt) + (bvirt - ey);\n bvirt = az - aez;\n aeztail = az - (aez + bvirt) + (bvirt - ez);\n bvirt = bx - bex;\n bextail = bx - (bex + bvirt) + (bvirt - ex);\n bvirt = by - bey;\n beytail = by - (bey + bvirt) + (bvirt - ey);\n bvirt = bz - bez;\n beztail = bz - (bez + bvirt) + (bvirt - ez);\n bvirt = cx - cex;\n cextail = cx - (cex + bvirt) + (bvirt - ex);\n bvirt = cy - cey;\n ceytail = cy - (cey + bvirt) + (bvirt - ey);\n bvirt = cz - cez;\n ceztail = cz - (cez + bvirt) + (bvirt - ez);\n bvirt = dx - dex;\n dextail = dx - (dex + bvirt) + (bvirt - ex);\n bvirt = dy - dey;\n deytail = dy - (dey + bvirt) + (bvirt - ey);\n bvirt = dz - dez;\n deztail = dz - (dez + bvirt) + (bvirt - ez);\n if (aextail === 0 && aeytail === 0 && aeztail === 0 &&\n bextail === 0 && beytail === 0 && beztail === 0 &&\n cextail === 0 && ceytail === 0 && ceztail === 0 &&\n dextail === 0 && deytail === 0 && deztail === 0) {\n return det;\n }\n\n errbound = isperrboundC * permanent + resulterrbound * Math.abs(det);\n\n const abeps = (aex * beytail + bey * aextail) - (aey * bextail + bex * aeytail);\n const bceps = (bex * ceytail + cey * bextail) - (bey * cextail + cex * beytail);\n const cdeps = (cex * deytail + dey * cextail) - (cey * dextail + dex * ceytail);\n const daeps = (dex * aeytail + aey * dextail) - (dey * aextail + aex * deytail);\n const aceps = (aex * ceytail + cey * aextail) - (aey * cextail + cex * aeytail);\n const bdeps = (bex * deytail + dey * bextail) - (bey * dextail + dex * beytail);\n det +=\n (((bex * bex + bey * bey + bez * bez) * ((cez * daeps + dez * aceps + aez * cdeps) +\n (ceztail * da3 + deztail * ac3 + aeztail * cd3)) + (dex * dex + dey * dey + dez * dez) *\n ((aez * bceps - bez * aceps + cez * abeps) + (aeztail * bc3 - beztail * ac3 + ceztail * ab3))) -\n ((aex * aex + aey * aey + aez * aez) * ((bez * cdeps - cez * bdeps + dez * bceps) +\n (beztail * cd3 - ceztail * bd3 + deztail * bc3)) + (cex * cex + cey * cey + cez * cez) *\n ((dez * abeps + aez * bdeps + bez * daeps) + (deztail * ab3 + aeztail * bd3 + beztail * da3)))) +\n 2 * (((bex * bextail + bey * beytail + bez * beztail) * (cez * da3 + dez * ac3 + aez * cd3) +\n (dex * dextail + dey * deytail + dez * deztail) * (aez * bc3 - bez * ac3 + cez * ab3)) -\n ((aex * aextail + aey * aeytail + aez * aeztail) * (bez * cd3 - cez * bd3 + dez * bc3) +\n (cex * cextail + cey * ceytail + cez * ceztail) * (dez * ab3 + aez * bd3 + bez * da3)));\n\n if (det >= errbound || -det >= errbound) {\n return det;\n }\n\n return insphereexact(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez);\n}\n\nexport function insphere(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez) {\n const aex = ax - ex;\n const bex = bx - ex;\n const cex = cx - ex;\n const dex = dx - ex;\n const aey = ay - ey;\n const bey = by - ey;\n const cey = cy - ey;\n const dey = dy - ey;\n const aez = az - ez;\n const bez = bz - ez;\n const cez = cz - ez;\n const dez = dz - ez;\n\n const aexbey = aex * bey;\n const bexaey = bex * aey;\n const ab = aexbey - bexaey;\n const bexcey = bex * cey;\n const cexbey = cex * bey;\n const bc = bexcey - cexbey;\n const cexdey = cex * dey;\n const dexcey = dex * cey;\n const cd = cexdey - dexcey;\n const dexaey = dex * aey;\n const aexdey = aex * dey;\n const da = dexaey - aexdey;\n const aexcey = aex * cey;\n const cexaey = cex * aey;\n const ac = aexcey - cexaey;\n const bexdey = bex * dey;\n const dexbey = dex * bey;\n const bd = bexdey - dexbey;\n\n const alift = aex * aex + aey * aey + aez * aez;\n const blift = bex * bex + bey * bey + bez * bez;\n const clift = cex * cex + cey * cey + cez * cez;\n const dlift = dex * dex + dey * dey + dez * dez;\n\n const det =\n (clift * (dez * ab + aez * bd + bez * da) - dlift * (aez * bc - bez * ac + cez * ab)) +\n (alift * (bez * cd - cez * bd + dez * bc) - blift * (cez * da + dez * ac + aez * cd));\n\n const aezplus = Math.abs(aez);\n const bezplus = Math.abs(bez);\n const cezplus = Math.abs(cez);\n const dezplus = Math.abs(dez);\n const aexbeyplus = Math.abs(aexbey) + Math.abs(bexaey);\n const bexceyplus = Math.abs(bexcey) + Math.abs(cexbey);\n const cexdeyplus = Math.abs(cexdey) + Math.abs(dexcey);\n const dexaeyplus = Math.abs(dexaey) + Math.abs(aexdey);\n const aexceyplus = Math.abs(aexcey) + Math.abs(cexaey);\n const bexdeyplus = Math.abs(bexdey) + Math.abs(dexbey);\n const permanent =\n (cexdeyplus * bezplus + bexdeyplus * cezplus + bexceyplus * dezplus) * alift +\n (dexaeyplus * cezplus + aexceyplus * dezplus + cexdeyplus * aezplus) * blift +\n (aexbeyplus * dezplus + bexdeyplus * aezplus + dexaeyplus * bezplus) * clift +\n (bexceyplus * aezplus + aexceyplus * bezplus + aexbeyplus * cezplus) * dlift;\n\n const errbound = isperrboundA * permanent;\n if (det > errbound || -det > errbound) {\n return det;\n }\n return -insphereadapt(ax, ay, az, bx, by, bz, cx, cy, cz, dx, dy, dz, ex, ey, ez, permanent);\n}\n\nexport function inspherefast(pax, pay, paz, pbx, pby, pbz, pcx, pcy, pcz, pdx, pdy, pdz, pex, pey, pez) {\n const aex = pax - pex;\n const bex = pbx - pex;\n const cex = pcx - pex;\n const dex = pdx - pex;\n const aey = pay - pey;\n const bey = pby - pey;\n const cey = pcy - pey;\n const dey = pdy - pey;\n const aez = paz - pez;\n const bez = pbz - pez;\n const cez = pcz - pez;\n const dez = pdz - pez;\n\n const ab = aex * bey - bex * aey;\n const bc = bex * cey - cex * bey;\n const cd = cex * dey - dex * cey;\n const da = dex * aey - aex * dey;\n const ac = aex * cey - cex * aey;\n const bd = bex * dey - dex * bey;\n\n const abc = aez * bc - bez * ac + cez * ab;\n const bcd = bez * cd - cez * bd + dez * bc;\n const cda = cez * da + dez * ac + aez * cd;\n const dab = dez * ab + aez * bd + bez * da;\n\n const alift = aex * aex + aey * aey + aez * aez;\n const blift = bex * bex + bey * bey + bez * bez;\n const clift = cex * cex + cey * cey + cez * cez;\n const dlift = dex * dex + dey * dey + dez * dez;\n\n return (clift * dab - dlift * abc) + (alift * bcd - blift * cda);\n}\n","\nconst EPSILON = Math.pow(2, -52);\nconst EDGE_STACK = new Uint32Array(512);\n\nimport {orient2d} from 'robust-predicates';\n\nexport default class Delaunator {\n\n static from(points, getX = defaultGetX, getY = defaultGetY) {\n const n = points.length;\n const coords = new Float64Array(n * 2);\n\n for (let i = 0; i < n; i++) {\n const p = points[i];\n coords[2 * i] = getX(p);\n coords[2 * i + 1] = getY(p);\n }\n\n return new Delaunator(coords);\n }\n\n constructor(coords) {\n const n = coords.length >> 1;\n if (n > 0 && typeof coords[0] !== 'number') throw new Error('Expected coords to contain numbers.');\n\n this.coords = coords;\n\n // arrays that will store the triangulation graph\n const maxTriangles = Math.max(2 * n - 5, 0);\n this._triangles = new Uint32Array(maxTriangles * 3);\n this._halfedges = new Int32Array(maxTriangles * 3);\n\n // temporary arrays for tracking the edges of the advancing convex hull\n this._hashSize = Math.ceil(Math.sqrt(n));\n this._hullPrev = new Uint32Array(n); // edge to prev edge\n this._hullNext = new Uint32Array(n); // edge to next edge\n this._hullTri = new Uint32Array(n); // edge to adjacent triangle\n this._hullHash = new Int32Array(this._hashSize); // angular edge hash\n\n // temporary arrays for sorting points\n this._ids = new Uint32Array(n);\n this._dists = new Float64Array(n);\n\n this.update();\n }\n\n update() {\n const {coords, _hullPrev: hullPrev, _hullNext: hullNext, _hullTri: hullTri, _hullHash: hullHash} = this;\n const n = coords.length >> 1;\n\n // populate an array of point indices; calculate input data bbox\n let minX = Infinity;\n let minY = Infinity;\n let maxX = -Infinity;\n let maxY = -Infinity;\n\n for (let i = 0; i < n; i++) {\n const x = coords[2 * i];\n const y = coords[2 * i + 1];\n if (x < minX) minX = x;\n if (y < minY) minY = y;\n if (x > maxX) maxX = x;\n if (y > maxY) maxY = y;\n this._ids[i] = i;\n }\n const cx = (minX + maxX) / 2;\n const cy = (minY + maxY) / 2;\n\n let i0, i1, i2;\n\n // pick a seed point close to the center\n for (let i = 0, minDist = Infinity; i < n; i++) {\n const d = dist(cx, cy, coords[2 * i], coords[2 * i + 1]);\n if (d < minDist) {\n i0 = i;\n minDist = d;\n }\n }\n const i0x = coords[2 * i0];\n const i0y = coords[2 * i0 + 1];\n\n // find the point closest to the seed\n for (let i = 0, minDist = Infinity; i < n; i++) {\n if (i === i0) continue;\n const d = dist(i0x, i0y, coords[2 * i], coords[2 * i + 1]);\n if (d < minDist && d > 0) {\n i1 = i;\n minDist = d;\n }\n }\n let i1x = coords[2 * i1];\n let i1y = coords[2 * i1 + 1];\n\n let minRadius = Infinity;\n\n // find the third point which forms the smallest circumcircle with the first two\n for (let i = 0; i < n; i++) {\n if (i === i0 || i === i1) continue;\n const r = circumradius(i0x, i0y, i1x, i1y, coords[2 * i], coords[2 * i + 1]);\n if (r < minRadius) {\n i2 = i;\n minRadius = r;\n }\n }\n let i2x = coords[2 * i2];\n let i2y = coords[2 * i2 + 1];\n\n if (minRadius === Infinity) {\n // order collinear points by dx (or dy if all x are identical)\n // and return the list as a hull\n for (let i = 0; i < n; i++) {\n this._dists[i] = (coords[2 * i] - coords[0]) || (coords[2 * i + 1] - coords[1]);\n }\n quicksort(this._ids, this._dists, 0, n - 1);\n const hull = new Uint32Array(n);\n let j = 0;\n for (let i = 0, d0 = -Infinity; i < n; i++) {\n const id = this._ids[i];\n const d = this._dists[id];\n if (d > d0) {\n hull[j++] = id;\n d0 = d;\n }\n }\n this.hull = hull.subarray(0, j);\n this.triangles = new Uint32Array(0);\n this.halfedges = new Uint32Array(0);\n return;\n }\n\n // swap the order of the seed points for counter-clockwise orientation\n if (orient2d(i0x, i0y, i1x, i1y, i2x, i2y) < 0) {\n const i = i1;\n const x = i1x;\n const y = i1y;\n i1 = i2;\n i1x = i2x;\n i1y = i2y;\n i2 = i;\n i2x = x;\n i2y = y;\n }\n\n const center = circumcenter(i0x, i0y, i1x, i1y, i2x, i2y);\n this._cx = center.x;\n this._cy = center.y;\n\n for (let i = 0; i < n; i++) {\n this._dists[i] = dist(coords[2 * i], coords[2 * i + 1], center.x, center.y);\n }\n\n // sort the points by distance from the seed triangle circumcenter\n quicksort(this._ids, this._dists, 0, n - 1);\n\n // set up the seed triangle as the starting hull\n this._hullStart = i0;\n let hullSize = 3;\n\n hullNext[i0] = hullPrev[i2] = i1;\n hullNext[i1] = hullPrev[i0] = i2;\n hullNext[i2] = hullPrev[i1] = i0;\n\n hullTri[i0] = 0;\n hullTri[i1] = 1;\n hullTri[i2] = 2;\n\n hullHash.fill(-1);\n hullHash[this._hashKey(i0x, i0y)] = i0;\n hullHash[this._hashKey(i1x, i1y)] = i1;\n hullHash[this._hashKey(i2x, i2y)] = i2;\n\n this.trianglesLen = 0;\n this._addTriangle(i0, i1, i2, -1, -1, -1);\n\n for (let k = 0, xp, yp; k < this._ids.length; k++) {\n const i = this._ids[k];\n const x = coords[2 * i];\n const y = coords[2 * i + 1];\n\n // skip near-duplicate points\n if (k > 0 && Math.abs(x - xp) <= EPSILON && Math.abs(y - yp) <= EPSILON) continue;\n xp = x;\n yp = y;\n\n // skip seed triangle points\n if (i === i0 || i === i1 || i === i2) continue;\n\n // find a visible edge on the convex hull using edge hash\n let start = 0;\n for (let j = 0, key = this._hashKey(x, y); j < this._hashSize; j++) {\n start = hullHash[(key + j) % this._hashSize];\n if (start !== -1 && start !== hullNext[start]) break;\n }\n\n start = hullPrev[start];\n let e = start, q;\n while (q = hullNext[e], orient2d(x, y, coords[2 * e], coords[2 * e + 1], coords[2 * q], coords[2 * q + 1]) >= 0) {\n e = q;\n if (e === start) {\n e = -1;\n break;\n }\n }\n if (e === -1) continue; // likely a near-duplicate point; skip it\n\n // add the first triangle from the point\n let t = this._addTriangle(e, i, hullNext[e], -1, -1, hullTri[e]);\n\n // recursively flip triangles from the point until they satisfy the Delaunay condition\n hullTri[i] = this._legalize(t + 2);\n hullTri[e] = t; // keep track of boundary triangles on the hull\n hullSize++;\n\n // walk forward through the hull, adding more triangles and flipping recursively\n let n = hullNext[e];\n while (q = hullNext[n], orient2d(x, y, coords[2 * n], coords[2 * n + 1], coords[2 * q], coords[2 * q + 1]) < 0) {\n t = this._addTriangle(n, i, q, hullTri[i], -1, hullTri[n]);\n hullTri[i] = this._legalize(t + 2);\n hullNext[n] = n; // mark as removed\n hullSize--;\n n = q;\n }\n\n // walk backward from the other side, adding more triangles and flipping\n if (e === start) {\n while (q = hullPrev[e], orient2d(x, y, coords[2 * q], coords[2 * q + 1], coords[2 * e], coords[2 * e + 1]) < 0) {\n t = this._addTriangle(q, i, e, -1, hullTri[e], hullTri[q]);\n this._legalize(t + 2);\n hullTri[q] = t;\n hullNext[e] = e; // mark as removed\n hullSize--;\n e = q;\n }\n }\n\n // update the hull indices\n this._hullStart = hullPrev[i] = e;\n hullNext[e] = hullPrev[n] = i;\n hullNext[i] = n;\n\n // save the two new edges in the hash table\n hullHash[this._hashKey(x, y)] = i;\n hullHash[this._hashKey(coords[2 * e], coords[2 * e + 1])] = e;\n }\n\n this.hull = new Uint32Array(hullSize);\n for (let i = 0, e = this._hullStart; i < hullSize; i++) {\n this.hull[i] = e;\n e = hullNext[e];\n }\n\n // trim typed triangle mesh arrays\n this.triangles = this._triangles.subarray(0, this.trianglesLen);\n this.halfedges = this._halfedges.subarray(0, this.trianglesLen);\n }\n\n _hashKey(x, y) {\n return Math.floor(pseudoAngle(x - this._cx, y - this._cy) * this._hashSize) % this._hashSize;\n }\n\n _legalize(a) {\n const {_triangles: triangles, _halfedges: halfedges, coords} = this;\n\n let i = 0;\n let ar = 0;\n\n // recursion eliminated with a fixed-size stack\n while (true) {\n const b = halfedges[a];\n\n /* if the pair of triangles doesn't satisfy the Delaunay condition\n * (p1 is inside the circumcircle of [p0, pl, pr]), flip them,\n * then do the same check/flip recursively for the new pair of triangles\n *\n * pl pl\n * /||\\ / \\\n * al/ || \\bl al/ \\a\n * / || \\ / \\\n * / a||b \\ flip /___ar___\\\n * p0\\ || /p1 => p0\\---bl---/p1\n * \\ || / \\ /\n * ar\\ || /br b\\ /br\n * \\||/ \\ /\n * pr pr\n */\n const a0 = a - a % 3;\n ar = a0 + (a + 2) % 3;\n\n if (b === -1) { // convex hull edge\n if (i === 0) break;\n a = EDGE_STACK[--i];\n continue;\n }\n\n const b0 = b - b % 3;\n const al = a0 + (a + 1) % 3;\n const bl = b0 + (b + 2) % 3;\n\n const p0 = triangles[ar];\n const pr = triangles[a];\n const pl = triangles[al];\n const p1 = triangles[bl];\n\n const illegal = inCircle(\n coords[2 * p0], coords[2 * p0 + 1],\n coords[2 * pr], coords[2 * pr + 1],\n coords[2 * pl], coords[2 * pl + 1],\n coords[2 * p1], coords[2 * p1 + 1]);\n\n if (illegal) {\n triangles[a] = p1;\n triangles[b] = p0;\n\n const hbl = halfedges[bl];\n\n // edge swapped on the other side of the hull (rare); fix the halfedge reference\n if (hbl === -1) {\n let e = this._hullStart;\n do {\n if (this._hullTri[e] === bl) {\n this._hullTri[e] = a;\n break;\n }\n e = this._hullPrev[e];\n } while (e !== this._hullStart);\n }\n this._link(a, hbl);\n this._link(b, halfedges[ar]);\n this._link(ar, bl);\n\n const br = b0 + (b + 1) % 3;\n\n // don't worry about hitting the cap: it can only happen on extremely degenerate input\n if (i < EDGE_STACK.length) {\n EDGE_STACK[i++] = br;\n }\n } else {\n if (i === 0) break;\n a = EDGE_STACK[--i];\n }\n }\n\n return ar;\n }\n\n _link(a, b) {\n this._halfedges[a] = b;\n if (b !== -1) this._halfedges[b] = a;\n }\n\n // add a new triangle given vertex indices and adjacent half-edge ids\n _addTriangle(i0, i1, i2, a, b, c) {\n const t = this.trianglesLen;\n\n this._triangles[t] = i0;\n this._triangles[t + 1] = i1;\n this._triangles[t + 2] = i2;\n\n this._link(t, a);\n this._link(t + 1, b);\n this._link(t + 2, c);\n\n this.trianglesLen += 3;\n\n return t;\n }\n}\n\n// monotonically increases with real angle, but doesn't need expensive trigonometry\nfunction pseudoAngle(dx, dy) {\n const p = dx / (Math.abs(dx) + Math.abs(dy));\n return (dy > 0 ? 3 - p : 1 + p) / 4; // [0..1]\n}\n\nfunction dist(ax, ay, bx, by) {\n const dx = ax - bx;\n const dy = ay - by;\n return dx * dx + dy * dy;\n}\n\nfunction inCircle(ax, ay, bx, by, cx, cy, px, py) {\n const dx = ax - px;\n const dy = ay - py;\n const ex = bx - px;\n const ey = by - py;\n const fx = cx - px;\n const fy = cy - py;\n\n const ap = dx * dx + dy * dy;\n const bp = ex * ex + ey * ey;\n const cp = fx * fx + fy * fy;\n\n return dx * (ey * cp - bp * fy) -\n dy * (ex * cp - bp * fx) +\n ap * (ex * fy - ey * fx) < 0;\n}\n\nfunction circumradius(ax, ay, bx, by, cx, cy) {\n const dx = bx - ax;\n const dy = by - ay;\n const ex = cx - ax;\n const ey = cy - ay;\n\n const bl = dx * dx + dy * dy;\n const cl = ex * ex + ey * ey;\n const d = 0.5 / (dx * ey - dy * ex);\n\n const x = (ey * bl - dy * cl) * d;\n const y = (dx * cl - ex * bl) * d;\n\n return x * x + y * y;\n}\n\nfunction circumcenter(ax, ay, bx, by, cx, cy) {\n const dx = bx - ax;\n const dy = by - ay;\n const ex = cx - ax;\n const ey = cy - ay;\n\n const bl = dx * dx + dy * dy;\n const cl = ex * ex + ey * ey;\n const d = 0.5 / (dx * ey - dy * ex);\n\n const x = ax + (ey * bl - dy * cl) * d;\n const y = ay + (dx * cl - ex * bl) * d;\n\n return {x, y};\n}\n\nfunction quicksort(ids, dists, left, right) {\n if (right - left <= 20) {\n for (let i = left + 1; i <= right; i++) {\n const temp = ids[i];\n const tempDist = dists[temp];\n let j = i - 1;\n while (j >= left && dists[ids[j]] > tempDist) ids[j + 1] = ids[j--];\n ids[j + 1] = temp;\n }\n } else {\n const median = (left + right) >> 1;\n let i = left + 1;\n let j = right;\n swap(ids, median, i);\n if (dists[ids[left]] > dists[ids[right]]) swap(ids, left, right);\n if (dists[ids[i]] > dists[ids[right]]) swap(ids, i, right);\n if (dists[ids[left]] > dists[ids[i]]) swap(ids, left, i);\n\n const temp = ids[i];\n const tempDist = dists[temp];\n while (true) {\n do i++; while (dists[ids[i]] < tempDist);\n do j--; while (dists[ids[j]] > tempDist);\n if (j < i) break;\n swap(ids, i, j);\n }\n ids[left + 1] = ids[j];\n ids[j] = temp;\n\n if (right - i + 1 >= j - left) {\n quicksort(ids, dists, i, right);\n quicksort(ids, dists, left, j - 1);\n } else {\n quicksort(ids, dists, left, j - 1);\n quicksort(ids, dists, i, right);\n }\n }\n}\n\nfunction swap(arr, i, j) {\n const tmp = arr[i];\n arr[i] = arr[j];\n arr[j] = tmp;\n}\n\nfunction defaultGetX(p) {\n return p[0];\n}\nfunction defaultGetY(p) {\n return p[1];\n}\n","import { PseudorandomStream } from \"../common\";\nimport { Cardinal8, Point, radsToDegrees } from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\n\ntype EntityPositionArgs = {\n x: number;\n y: number;\n} & ({ aimedAt: Point } | { facing: Cardinal8 } | { yaw: number } | {});\n\nfunction getYaw(args: EntityPositionArgs): number | undefined {\n if (\"aimedAt\" in args) {\n return Math.atan2(args.aimedAt[1] - args.y, args.aimedAt[0] - args.x);\n }\n if (\"facing\" in args) {\n return Math.atan2(args.facing[1], args.facing[0]);\n }\n if (\"yaw\" in args) {\n return args.yaw;\n }\n return undefined;\n}\n\nconst ENTITY_SCALE = 300;\n\nexport type EntityPosition = {\n readonly x: number;\n readonly y: number;\n readonly z: number;\n readonly pitch: number;\n readonly yaw: number;\n readonly roll: number;\n readonly scaleX: number;\n readonly scaleY: number;\n readonly scaleZ: number;\n};\n\nconst POSITION_DEFAULTS = {\n z: 0,\n pitch: 0,\n yaw: 0,\n roll: 0,\n scaleX: 1,\n scaleY: 1,\n scaleZ: 1,\n} as const;\n\nexport function position(\n args: EntityPositionArgs & Partial,\n): EntityPosition {\n return {\n x: args.x,\n y: args.y,\n z: args.z ?? POSITION_DEFAULTS.z,\n pitch: args.pitch ?? POSITION_DEFAULTS.pitch,\n yaw: getYaw(args) ?? POSITION_DEFAULTS.yaw,\n roll: args.roll ?? POSITION_DEFAULTS.roll,\n scaleX: args.scaleX ?? POSITION_DEFAULTS.scaleX,\n scaleY: args.scaleY ?? POSITION_DEFAULTS.scaleY,\n scaleZ: args.scaleZ ?? POSITION_DEFAULTS.scaleZ,\n };\n}\n\nexport const atCenterOfTile: (args: EntityPositionArgs) => EntityPosition = (\n args,\n) => position({ ...args, x: args.x + 0.5, y: args.y + 0.5 });\n\nexport function randomlyInTile(\n args: EntityPositionArgs & { rng: PseudorandomStream },\n): EntityPosition {\n const x = args.rng.uniform({}) + args.x;\n const y = args.rng.uniform({}) + args.y;\n const yaw = getYaw(args) ?? args.rng.uniform({ min: -Math.PI, max: Math.PI });\n return { ...POSITION_DEFAULTS, x, y, yaw };\n}\n\nfunction zOffsetForBuilding(\n unused_x: number,\n unused_y: number,\n nw: number,\n ne: number,\n sw: number,\n se: number,\n): number {\n return (Math.max(nw, ne, sw, se) + Math.min(nw, ne, sw, se)) / 2;\n}\n\nfunction zOffsetForEntity(\n x: number,\n y: number,\n nw: number,\n ne: number,\n sw: number,\n se: number,\n): number {\n // Manic Miners reliably clips tiles into two triangles this way.\n if (y <= 1 - x) {\n // First triangle (nw, ne, sw)\n const wx = (ne - nw) * x;\n const wy = (sw - nw) * y;\n return nw + wx + wy;\n } else {\n // Second triangle (se, ne, sw)\n const wx = (sw - se) * (x - 1);\n const wy = (ne - se) * (y - 1);\n return se + wx + wy;\n }\n}\n\nfunction zOffset(\n x: number,\n y: number,\n heightMap: Grid,\n method: \"entity\" | \"building\",\n): number {\n const tileX = Math.floor(x);\n const tileY = Math.floor(y);\n const fn = { entity: zOffsetForEntity, building: zOffsetForBuilding }[method];\n return fn(\n x - tileX,\n y - tileY,\n heightMap.get(tileX, tileY)!,\n heightMap.get(tileX + 1, tileY)!,\n heightMap.get(tileX, tileY + 1)!,\n heightMap.get(tileX + 1, tileY + 1)!,\n );\n}\n\nexport function serializePosition(\n position: EntityPosition,\n [ox, oy]: Point,\n heightMap: Grid,\n yawOffset: number,\n zOffsetMethod: \"entity\" | \"building\",\n): string {\n const x = (position.x + ox) * ENTITY_SCALE;\n const y = (position.y + oy) * ENTITY_SCALE;\n const z =\n position.z + zOffset(position.x, position.y, heightMap, zOffsetMethod);\n const pitch = radsToDegrees(position.pitch);\n const yaw = radsToDegrees(position.yaw + yawOffset);\n const roll = radsToDegrees(position.roll);\n const { scaleX, scaleY, scaleZ } = position;\n return (\n `Translation: X=${x.toFixed(3)} Y=${y.toFixed(3)} Z=${z.toFixed(3)} ` +\n `Rotation: P=${pitch.toFixed(6)} Y=${yaw.toFixed(6)} R=${roll.toFixed(6)} ` +\n `Scale X=${scaleX.toFixed(3)} Y=${scaleY.toFixed(3)} Z=${scaleZ.toFixed(3)}`\n );\n}\n","import {\n Cardinal4,\n EAST,\n NORTH,\n NORTH_WEST,\n ORIGIN,\n Point,\n SOUTH,\n WEST,\n rotateAround,\n rotateLeft,\n rotateRight,\n} from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\nimport { EntityPosition, atCenterOfTile, serializePosition } from \"./position\";\n\ntype Footprint = readonly [readonly [0, 0], ...Point[]];\n\n// There are five unique footprints for buildings available.\n// Assuming the building itself has its entity origin at [0, 0], and is facing\n// NORTH, these tiles become the foundation tiles for buildings with that\n// footprint.\nconst F_MINING_LASER: Footprint = [ORIGIN];\nconst F_DEFAULT: Footprint = [ORIGIN, NORTH];\nconst F_CANTEEN_REFINERY: Footprint = [ORIGIN, SOUTH, NORTH];\nconst F_POWER_STATION: Footprint = [ORIGIN, EAST, NORTH];\nconst F_SUPER_TELEPORT: Footprint = [ORIGIN, NORTH_WEST, WEST, NORTH];\n\n/** Rotates the given footprint to match the given cardinal offset facing. */\nfunction rotateFootprint(footprint: Footprint, [ox, oy]: Cardinal4) {\n if (oy === -1) {\n return footprint;\n }\n if (ox === 1) {\n return footprint.map(rotateRight);\n }\n if (oy === 1) {\n return footprint.map(rotateAround);\n }\n // Assume ox === -1\n return footprint.map(rotateLeft);\n}\n\ntype Level = 0 | 1 | 2 | 3 | 4 | 5;\nexport type BuildingExtraArgs = {\n level?: Level;\n isEssential?: boolean;\n teleportAtStart?: boolean;\n};\n\nclass BuildingTemplate {\n readonly id: string;\n readonly name: string;\n readonly inspectAbbrev: string;\n readonly maxLevel: Level;\n readonly ore: number;\n readonly crystals: number;\n readonly footprint: Footprint;\n readonly dependencies: readonly BuildingTemplate[];\n constructor(\n id: string,\n name: string,\n inspectAbbrev: string,\n maxLevel: Level,\n ore: number,\n crystals: number,\n footprint: Footprint,\n dependencies: readonly BuildingTemplate[],\n ) {\n this.id = id;\n this.name = name;\n this.inspectAbbrev = inspectAbbrev;\n this.maxLevel = maxLevel;\n this.ore = ore;\n this.crystals = crystals;\n this.footprint = footprint;\n this.dependencies = dependencies;\n }\n atTile: (\n args: {\n x: number;\n y: number;\n facing: Cardinal4;\n } & BuildingExtraArgs,\n ) => Building = (args) => ({\n ...atCenterOfTile(args),\n template: this,\n foundation: rotateFootprint(this.footprint, args.facing).map(([x, y]) => [\n x + args.x,\n y + args.y,\n ]),\n level: args.level ?? 1,\n isEssential: args.isEssential ?? false,\n teleportAtStart: args.teleportAtStart ?? false,\n });\n}\n\nexport const TOOL_STORE = new BuildingTemplate(\n \"BuildingToolStore_C\",\n \"Tool Store\",\n \"Ts\",\n 3,\n 0,\n 0,\n F_DEFAULT,\n [],\n);\nexport const TELEPORT_PAD = new BuildingTemplate(\n \"BuildingTeleportPad_C\",\n \"Teleport Pad\",\n \"Tp\",\n 2,\n 8,\n 0,\n F_DEFAULT,\n [TOOL_STORE],\n);\n// The Docks faces the LAND tile with the water BEHIND it.\n// Note the water tile is not counted as part of the foundation\nexport const DOCKS = new BuildingTemplate(\n \"BuildingDocks_C\",\n \"Docks\",\n \"Dk\",\n 1,\n 8,\n 0,\n F_DEFAULT,\n [TOOL_STORE],\n);\n// The Canteen is functionally symmetrical, but if you care, the end with\n// the yellow/black chevron piece is the FRONT.\nexport const CANTEEN = new BuildingTemplate(\n \"BuildingCanteen_C\",\n \"Canteen\",\n \"Cn\",\n 1,\n 10,\n 1,\n F_CANTEEN_REFINERY,\n [TOOL_STORE],\n);\n// Power Station origin is the RIGHT side of the building where miners put\n// the crystals in.\nexport const POWER_STATION = new BuildingTemplate(\n \"BuildingPowerStation_C\",\n \"Power Station\",\n \"Ps\",\n 2,\n 12,\n 2,\n F_POWER_STATION,\n [TOOL_STORE, TELEPORT_PAD],\n);\nexport const SUPPORT_STATION = new BuildingTemplate(\n \"BuildingSupportStation_C\",\n \"Support Station\",\n \"Ss\",\n 2,\n 15,\n 3,\n F_DEFAULT,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION],\n);\nexport const UPGRADE_STATION = new BuildingTemplate(\n \"BuildingUpgradeStation_C\",\n \"Upgrade Station\",\n \"Us\",\n 3,\n 20,\n 3,\n F_DEFAULT,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION],\n);\n// Geological Center origin is the BACK of the building.\nexport const GEOLOGICAL_CENTER = new BuildingTemplate(\n \"BuildingGeologicalCenter_C\",\n \"Geological Center\",\n \"Gc\",\n 5,\n 20,\n 2,\n F_DEFAULT,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION],\n);\n// Ore Refinery origin is the FRONT of the building were miners put ore in.\nexport const ORE_REFINERY = new BuildingTemplate(\n \"BuildingOreRefinery_C\",\n \"Ore Refinery\",\n \"Or\",\n 4,\n 20,\n 3,\n F_CANTEEN_REFINERY,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION],\n);\nexport const MINING_LASER = new BuildingTemplate(\n \"BuildingMiningLaser_C\",\n \"Mining Laser\",\n \"Ml\",\n 1,\n 10,\n 1,\n F_MINING_LASER,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION, SUPPORT_STATION],\n);\n// Super teleport origin is the LEFT side of the building when facing it.\nexport const SUPER_TELEPORT = new BuildingTemplate(\n \"BuildingSuperTeleport_C\",\n \"Super Teleport\",\n \"St\",\n 2,\n 20,\n 4,\n F_SUPER_TELEPORT,\n [TOOL_STORE, TELEPORT_PAD, POWER_STATION, SUPPORT_STATION],\n);\n\nexport class BuildingDoesNotFitException extends Error {}\n\nexport type Building = EntityPosition & {\n readonly template: BuildingTemplate;\n readonly foundation: readonly Point[];\n readonly level: Level;\n readonly isEssential: boolean;\n readonly teleportAtStart: boolean;\n};\n\nexport function serializeBuilding(\n building: Building,\n offset: Point,\n heightMap: Grid,\n) {\n return [\n building.template.id,\n serializePosition(building, offset, heightMap, Math.PI / 2, \"building\"),\n building.level > 1 && `Level=${building.level.toFixed()}`,\n building.isEssential && \"Essential=True\",\n building.teleportAtStart && \"Teleport=True\",\n ]\n .filter((n) => n)\n .join(\",\");\n}\n","export enum Hardness {\n NONE = 0,\n RUBBLE,\n DIRT,\n LOOSE,\n SEAM,\n HARD,\n SOLID,\n}\n\ntype BaseTile = {\n id: number;\n name: string;\n hardness: Hardness;\n isWall: boolean;\n isFluid: boolean;\n maxSlope: number | undefined;\n crystalYield: number;\n oreYield: number;\n};\n\n// prettier-ignore\nconst TILES = {\n FLOOR: {id: 1, name: \"Cavern Floor\", crystalYield: 0, hardness: Hardness.NONE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n LAVA: {id: 6, name: \"Lava\", crystalYield: 0, hardness: Hardness.NONE, isFluid: true, isWall: false, maxSlope: 0, oreYield: 0},\n WATER: {id: 11, name: \"Water\", crystalYield: 0, hardness: Hardness.NONE, isFluid: true, isWall: false, maxSlope: 0, oreYield: 0},\n DIRT: {id: 26, name: \"Dirt\", crystalYield: 0, hardness: Hardness.DIRT, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 4},\n LOOSE_ROCK: {id: 30, name: \"Loose Rock\", crystalYield: 0, hardness: Hardness.LOOSE, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 4},\n HARD_ROCK: {id: 34, name: \"Hard Rock\", crystalYield: 0, hardness: Hardness.HARD, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 4},\n SOLID_ROCK: {id: 38, name: \"Solid Rock\", crystalYield: 0, hardness: Hardness.SOLID, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 4},\n RUBBLE_1: {id: 2, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 1},\n RUBBLE_2: {id: 3, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 2},\n RUBBLE_3: {id: 4, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 3},\n RUBBLE_4: {id: 5, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 4},\n SLUG_HOLE: {id: 12, name: \"Slimy Slug Hole\", crystalYield: 0, hardness: Hardness.NONE, isFluid: false, isWall: false, maxSlope: 15, oreYield: 0},\n FOUNDATION: {id: 14, name: \"Foundation\", crystalYield: 0, hardness: Hardness.NONE, isFluid: false, isWall: false, maxSlope: 15, oreYield: 0},\n POWER_PATH: {id: 24, name: \"Power Path\", crystalYield: 0, hardness: Hardness.NONE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n LANDSLIDE_RUBBLE_4: {id: 60, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n LANDSLIDE_RUBBLE_3: {id: 61, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n LANDSLIDE_RUBBLE_2: {id: 62, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n LANDSLIDE_RUBBLE_1: {id: 63, name: \"Rubble\", crystalYield: 0, hardness: Hardness.RUBBLE, isFluid: false, isWall: false, maxSlope: undefined, oreYield: 0},\n CRYSTAL_SEAM: {id: 42, name: \"Energy Crystal Seam\", crystalYield: 4, hardness: Hardness.SEAM, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 4},\n ORE_SEAM: {id: 46, name: \"Ore Seam\", crystalYield: 0, hardness: Hardness.SEAM, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 8},\n RECHARGE_SEAM: {id: 50, name: \"Recharge Seam\", crystalYield: 0, hardness: Hardness.SOLID, isFluid: false, isWall: true, maxSlope: undefined, oreYield: 0},\n} as const satisfies { [K in any]: BaseTile };\n\nexport const Tile = TILES;\nexport type Tile = (typeof TILES)[keyof typeof TILES]; // eslint-disable-line @typescript-eslint/no-redeclare\n\nexport type RoughTile =\n | typeof TILES.FLOOR\n | typeof TILES.LAVA\n | typeof TILES.WATER\n | typeof TILES.DIRT\n | typeof TILES.LOOSE_ROCK\n | typeof TILES.HARD_ROCK\n | typeof TILES.SOLID_ROCK;\nexport type FluidType = typeof TILES.LAVA | typeof TILES.WATER | null;\n","import { Biome } from \"../common\";\nimport { Point } from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\nimport { EntityPosition, serializePosition } from \"./position\";\n\nexport class CreatureTemplate {\n readonly id: string;\n readonly name: string;\n readonly inspectAbbrev: string;\n constructor(id: string, name: string, inspectAbbrev: string) {\n this.id = id;\n this.name = name;\n this.inspectAbbrev = inspectAbbrev;\n }\n}\n\nexport const ROCK_MONSTER = new CreatureTemplate(\n \"CreatureRockMonster_C\",\n \"Rock Monster\",\n \"Rm\",\n);\nexport const ICE_MONSTER = new CreatureTemplate(\n \"CreatureIceMonster_C\",\n \"Ice Monster\",\n \"Im\",\n);\nexport const LAVA_MONSTER = new CreatureTemplate(\n \"CreatureLavaMonster_C\",\n \"Lava Monster\",\n \"Lm\",\n);\nexport const SLIMY_SLUG = new CreatureTemplate(\n \"CreatureSlimySlug_C\",\n \"Slimy Slug\",\n \"Sg\",\n);\nexport const SMALL_SPIDER = new CreatureTemplate(\n \"CreatureSmallSpider_C\",\n \"Small Spider\",\n \"Sr\",\n);\nexport const BAT = new CreatureTemplate(\"CreatureBat_C\", \"Bat\", \"Bt\");\n\nexport function monsterForBiome(biome: Biome): CreatureTemplate {\n switch (biome) {\n case \"rock\":\n return ROCK_MONSTER;\n case \"ice\":\n return ICE_MONSTER;\n case \"lava\":\n return LAVA_MONSTER;\n }\n}\n\nexport type Creature = EntityPosition & {\n readonly id: number;\n readonly template: CreatureTemplate;\n readonly sleep: boolean;\n};\n\nexport class CreatureFactory {\n private id: number = 0;\n create(\n args: EntityPosition & { template: CreatureTemplate; sleep?: boolean },\n ): Creature {\n return { sleep: false, ...args, id: this.id++ };\n }\n}\n\nexport function serializeCreature(\n creature: Creature,\n offset: Point,\n heightMap: Grid,\n) {\n return `${creature.template.id}\n${serializePosition(creature, offset, heightMap, 0, \"entity\")}\nID=${creature.id.toFixed()}${creature.sleep ? \",Sleep=true\" : \"\"}`;\n}\n","export type Mutable = { -readonly [P in keyof T]: T[P] };\n\ntype GetOrUndefined<\n T extends object,\n K extends string | number | symbol,\n> = T extends T ? (K extends keyof T ? T[K] : undefined) : never;\ntype KeyOfUnion = T extends T ? keyof T : never;\ntype UndefinedToOptional = {\n [K in keyof T]-?: (\n x: undefined extends T[K] ? { [P in K]?: T[K] } : { [P in K]: T[K] },\n ) => void;\n}[keyof T] extends (x: infer I) => void\n ? I extends infer U\n ? { [K in keyof U]: U[K] }\n : never\n : never;\nexport type CollapseUnion = UndefinedToOptional<{\n [K in KeyOfUnion]: GetOrUndefined;\n}>;\n\nexport function pairEach(\n it: readonly T[],\n fn: (a: T, b: T, i: number) => void,\n) {\n for (let i = 0; i < it.length - 1; i++) {\n fn(it[i], it[i + 1], i);\n }\n}\nexport function pairMap(\n it: readonly U[],\n fn: (a: U, b: U, i: number) => V,\n): V[] {\n const result: V[] = [];\n pairEach(it, (a, b, i) => result.push(fn(a, b, i)));\n return result;\n}\n\nexport function filterTruthy(it: (T | null | false | undefined)[]): T[] {\n return it.filter((n) => n) as T[];\n}\n","import { PseudorandomStream } from \"../../common\";\nimport { NSEW } from \"../../common/geometry\";\nimport { filterTruthy } from \"../../common/utils\";\nimport { Plan } from \"../../models/plan\";\nimport { EntityPosition, position } from \"../../models/position\";\nimport { Tile } from \"../../models/tiles\";\nimport { StrataformedCavern } from \"../../transformers/03_plastic/02_strataform\";\n\nexport function pickPoint(\n plan: Plan,\n filter: (x: number, y: number) => boolean,\n) {\n for (let ly = 0; ly < plan.innerPearl.length; ly++) {\n const layer = plan.innerPearl[ly];\n const start = plan.id % (layer.length - 1);\n for (let i = start; i < layer.length; i++) {\n if (filter(...layer[i])) {\n return layer[i];\n }\n }\n for (let i = 0; i < start; i++) {\n if (filter(...layer[i])) {\n return layer[i];\n }\n }\n }\n return undefined;\n}\n\nexport function circumferencePositions(\n cavern: StrataformedCavern,\n plan: Plan,\n count: number,\n rng: PseudorandomStream,\n filterFn: (x: number, y: number, t: Tile) => boolean,\n): EntityPosition[] {\n for (let ly = plan.innerPearl.length - 2; ly >= 0; ly--) {\n const r = positionsHelper(cavern, plan, count, rng, filterFn, ly, ly + 1);\n if (r.length) {\n return r;\n }\n }\n return [];\n}\n\nexport function innerPositions(\n cavern: StrataformedCavern,\n plan: Plan,\n count: number,\n rng: PseudorandomStream,\n filterFn: (x: number, y: number, t: Tile) => boolean,\n): EntityPosition[] {\n for (let ly = 1; ly < plan.innerPearl.length; ly++) {\n const r = positionsHelper(cavern, plan, count, rng, filterFn, ly, ly - 1);\n if (r.length) {\n return r;\n }\n }\n return [];\n}\n\nfunction positionsHelper(\n cavern: StrataformedCavern,\n plan: Plan,\n count: number,\n rng: PseudorandomStream,\n filterFn: (x: number, y: number, t: Tile) => boolean,\n ly: number,\n aly: number,\n): EntityPosition[] {\n const placements = filterTruthy(\n plan.innerPearl[ly].map(([x, y]) => {\n const t = cavern.tiles.get(x, y);\n if (\n t?.isWall !== false ||\n !filterFn(x, y, t) ||\n cavern.pearlInnerDex\n .get(x, y)\n ?.some((_, i) => i !== plan.id && cavern.plans[i].kind !== \"hall\")\n ) {\n return null;\n }\n const anchor = NSEW.find(\n ([ox, oy]) =>\n cavern.tiles.get(x + ox, y + oy)?.isWall &&\n cavern.pearlInnerDex.get(x + ox, y + oy)?.[plan.id] === aly,\n );\n if (!anchor) {\n return null;\n }\n return [x, y, anchor] as const;\n }),\n );\n return rng\n .shuffle(placements)\n .filter((_, i) => i < count)\n .map(([tx, ty, [ax, ay]]) => {\n const x =\n tx + rng.uniform({ max: ax === 0 ? 1 : 0.25 }) + (ax > 0 ? 0.75 : 0);\n const y =\n ty + rng.uniform({ max: ay === 0 ? 1 : 0.25 }) + (ay > 0 ? 0.75 : 0);\n const fx = tx + (ax === 0 ? rng.uniform({ min: -2, max: 2 }) : ax * -5);\n const fy = ty + (ay === 0 ? rng.uniform({ min: -2, max: 2 }) : ay * -5);\n return position({ x, y, aimedAt: [fx, fy] });\n });\n}\n","import { Biome, PseudorandomStream } from \"../../common\";\nimport { Point } from \"../../common/geometry\";\nimport { Architect } from \"../../models/architect\";\nimport { monsterForBiome } from \"../../models/creature\";\nimport { Tile } from \"../../models/tiles\";\nimport { circumferencePositions, innerPositions } from \"./placement\";\n\nconst TILE_CAN_HAVE_MONSTER = {\n rock: (_, __, t) => !t.isFluid,\n ice: (_, __, t) => t !== Tile.LAVA,\n lava: (_, __, t) => t !== Tile.WATER,\n} as const satisfies {\n [K in Biome]: (x: number, y: number, t: Tile) => boolean;\n};\n\nconst PLACEMENT_FN = {\n inner: innerPositions,\n outer: circumferencePositions,\n} as const;\n\nexport function placeSleepingMonsters(\n args: Parameters[\"placeEntities\"]>[0],\n rng: PseudorandomStream,\n count: number,\n placement: \"outer\" | \"inner\" = \"outer\",\n) {\n if (!args.cavern.context.hasMonsters) {\n return;\n }\n const template = monsterForBiome(args.cavern.context.biome);\n const filterFn = TILE_CAN_HAVE_MONSTER[args.cavern.context.biome];\n const r = PLACEMENT_FN[placement](\n args.cavern,\n args.plan,\n count,\n rng,\n filterFn,\n ).map((pos) =>\n args.creatureFactory.create({ ...pos, template, sleep: true }),\n );\n args.creatures.push(...r);\n}\n\nexport function sprinkleSlugHoles(\n args: Parameters[\"placeSlugHoles\"]>[0],\n opts?: {\n count?: number;\n placements?: readonly Point[];\n },\n) {\n const rng = args.cavern.dice.placeSlugHoles(args.plan.id);\n const c =\n opts?.count ??\n (rng.chance(args.cavern.context[`${args.plan.kind}HasSlugHoleChance`])\n ? 1\n : 0);\n var placements =\n opts?.placements ??\n args.plan.innerPearl.flatMap((layer) =>\n layer.filter((pos) => args.tiles.get(...pos) === Tile.FLOOR),\n );\n for (var i = 1; i <= c && !!placements.length; i++) {\n const [x, y] = rng.uniformChoice(placements);\n args.tiles.set(x, y, Tile.SLUG_HOLE);\n if (i === c) {\n return;\n }\n // Don't place another slug hole on or adjacent to this one.\n placements = placements.filter(\n ([x1, y1]) => x1 < x - 1 || x1 > x + 1 || y1 < y - 1 || y1 > y + 1,\n );\n }\n}\n","export class Landslide {\n readonly cooldown: number;\n constructor(cooldown: number) {\n this.cooldown = cooldown;\n }\n\n get key() {\n return this.cooldown.toFixed(1);\n }\n}\n\nexport class Erosion {\n readonly cooldown: number;\n readonly initialDelay: number;\n constructor(cooldown: number, initialDelay: number) {\n this.cooldown = cooldown;\n this.initialDelay = initialDelay;\n }\n\n get key() {\n return `${this.cooldown.toFixed(1)}/${this.initialDelay.toFixed(1)}`;\n }\n}\n","import { MutableGrid } from \"../../common/grid\";\nimport { Erosion, Landslide } from \"../../models/hazards\";\nimport { Plan } from \"../../models/plan\";\nimport { Tile } from \"../../models/tiles\";\nimport { DiscoveredCavern } from \"../../transformers/03_plastic/01_discover\";\n\nconst LANDSLIDABLE_TILES: readonly true[] = (() => {\n const r: true[] = [];\n r[Tile.DIRT.id] = true;\n r[Tile.LOOSE_ROCK.id] = true;\n r[Tile.HARD_ROCK.id] = true;\n return r;\n})();\n\nconst BETA_SUM = 10;\n\nexport function placeLandslides(\n cooldownRange: { min: number; max: number },\n {\n cavern,\n plan,\n landslides,\n }: {\n cavern: DiscoveredCavern;\n plan: Plan;\n landslides: MutableGrid;\n },\n) {\n const rng = cavern.dice.placeLandslides(plan.id);\n\n // A spread closer to 1 means more landslide tiles, but they will tend to\n // trigger less frequently.\n const spread = rng.uniform({ min: 0.2, max: 0.8 });\n\n plan.innerPearl\n .flatMap((layer) => layer)\n .filter(\n (point) =>\n !landslides.get(...point) &&\n LANDSLIDABLE_TILES[cavern.tiles.get(...point)?.id ?? -1] &&\n rng.chance(spread),\n )\n .forEach((point) => {\n const cooldown = rng.betaInt({\n ...cooldownRange,\n a: BETA_SUM * spread,\n b: BETA_SUM * (1 - spread),\n });\n landslides.set(...point, new Landslide(cooldown));\n });\n}\n\nexport function placeErosion(\n cooldown: number,\n initialDelay: number,\n {\n cavern,\n plan,\n erosion,\n }: {\n cavern: DiscoveredCavern;\n plan: Plan;\n erosion: MutableGrid;\n },\n) {\n if (plan.hasErosion) {\n const event = new Erosion(cooldown, initialDelay);\n plan.innerPearl.forEach((layer) =>\n layer.forEach((point) => {\n if (cavern.tiles.get(...point)?.isFluid === false) {\n erosion.set(...point, event);\n }\n }),\n );\n }\n}\n","import { PseudorandomStream } from \"../../common\";\nimport { MutableGrid, Grid } from \"../../common/grid\";\nimport { Architect } from \"../../models/architect\";\nimport { Plan } from \"../../models/plan\";\nimport { Tile } from \"../../models/tiles\";\nimport { RoughPlasticCavern } from \"../../transformers/02_masonry/01_rough\";\nimport { NSEW, Point, offsetBy } from \"../../common/geometry\";\nimport { Vehicle } from \"../../models/vehicle\";\nimport { Building } from \"../../models/building\";\n\nconst SEAMABLE = {\n [Tile.SOLID_ROCK.id]: true,\n [Tile.HARD_ROCK.id]: true,\n [Tile.LOOSE_ROCK.id]: true,\n [Tile.DIRT.id]: true,\n} as const;\n\n/** Sprinkles resources throughout the tiles given by getRandomTile. */\nfunction sprinkle(\n getRandomTile: () => Point,\n seamBias: number,\n rng: PseudorandomStream,\n tiles: MutableGrid,\n resource: MutableGrid,\n seam: Tile,\n count: number,\n) {\n for (let remaining = count; remaining > 0; remaining--) {\n const [x, y] = getRandomTile();\n const t = tiles.get(x, y) ?? Tile.SOLID_ROCK;\n if (\n remaining >= 4 &&\n (t === Tile.SOLID_ROCK ||\n (t.id in SEAMABLE && seamBias > 0 && rng.chance(seamBias)))\n ) {\n tiles.set(x, y, seam);\n remaining -= 3;\n continue;\n }\n if (t === Tile.SOLID_ROCK) {\n tiles.set(x, y, Tile.LOOSE_ROCK);\n }\n const r = resource.get(x, y) ?? 0;\n if (r >= 3 && t.id in SEAMABLE) {\n tiles.set(x, y, seam);\n resource.set(x, y, r - 3);\n } else {\n resource.set(x, y, r + 1);\n }\n }\n}\n\nexport function sprinkleCrystals(\n args: Parameters[\"placeCrystals\"]>[0],\n opts?: {\n count?: number;\n getRandomTile?: () => Point;\n seamBias?: number;\n },\n) {\n const rng = args.cavern.dice.placeCrystals(args.plan.id);\n return sprinkle(\n opts?.getRandomTile ?? defaultGetRandomTile(rng, args),\n opts?.seamBias ?? args.cavern.context[`${args.plan.kind}CrystalSeamBias`],\n rng,\n args.tiles,\n args.crystals,\n Tile.CRYSTAL_SEAM,\n opts?.count ??\n args.plan.crystals -\n args.plan.architect.crystalsFromMetadata(args.plan.metadata),\n );\n}\n\nexport function sprinkleOre(\n args: Parameters[\"placeOre\"]>[0],\n opts?: {\n count?: number;\n getRandomTile?: () => Point;\n seamBias?: number;\n },\n) {\n const rng = args.cavern.dice.placeOre(args.plan.id);\n return sprinkle(\n opts?.getRandomTile ?? defaultGetRandomTile(rng, args),\n opts?.seamBias ?? args.cavern.context[`${args.plan.kind}OreSeamBias`],\n rng,\n args.tiles,\n args.ore,\n Tile.ORE_SEAM,\n opts?.count ?? args.plan.ore,\n );\n}\n\nexport function bidsForOuterPearl(args: {\n cavern: RoughPlasticCavern;\n plan: Plan;\n tiles: Grid;\n}): { item: Point; bid: number }[] {\n return args.plan.outerPearl.flatMap((layer) =>\n layer\n .map((item) => {\n const tile = args.tiles.get(...item) ?? Tile.SOLID_ROCK;\n if (tile === Tile.SOLID_ROCK) {\n let rechargeSeamCount = 0;\n let solidRockCount = 0;\n for (const offset of NSEW) {\n const neighbor =\n args.tiles.get(...offsetBy(item, offset)) ?? Tile.SOLID_ROCK;\n if (neighbor === Tile.RECHARGE_SEAM) {\n rechargeSeamCount++;\n } else if (neighbor === Tile.SOLID_ROCK) {\n solidRockCount++;\n }\n }\n const bid =\n rechargeSeamCount + solidRockCount >= 4 ? 0 : solidRockCount;\n return { item, bid };\n }\n if (\n tile === Tile.DIRT ||\n tile === Tile.LOOSE_ROCK ||\n tile === Tile.HARD_ROCK\n ) {\n return { item, bid: 1 };\n }\n return { item, bid: 0 };\n })\n .filter(({ bid }) => bid > 0)\n .map(({ item, bid }) => {\n const innerPlansAtTile =\n args.cavern.pearlInnerDex.get(...item)?.reduce((n) => n + 1, 0) ?? 0;\n const outerPlansAtTile =\n args.cavern.pearlOuterDex.get(...item)?.reduce((n) => n + 1, 0) ?? 0;\n return { item, bid: bid / (innerPlansAtTile + outerPlansAtTile) };\n }),\n );\n}\n\nexport function bidsForOrdinaryWalls(\n positions: readonly Point[],\n tiles: Grid,\n) {\n return positions.filter(([x, y]) => {\n const t = tiles.get(x, y);\n return t === Tile.DIRT || t === Tile.LOOSE_ROCK || t === Tile.HARD_ROCK;\n });\n}\n\nexport function defaultGetRandomTile(\n rng: PseudorandomStream,\n args: {\n cavern: RoughPlasticCavern;\n plan: Plan;\n tiles: MutableGrid;\n },\n) {\n const bids = bidsForOrdinaryWalls(\n args.plan.innerPearl.flatMap((layer) => layer),\n args.tiles,\n );\n if (bids.length > 0) {\n return () => rng.uniformChoice(bids);\n }\n const bids2 = bidsForOuterPearl(args);\n if (bids2) {\n return () => rng.weightedChoice(bids2);\n }\n throw new Error(\"No place to put resource!\");\n}\n\nexport function getPlaceRechargeSeams(\n count?: number,\n): Architect[\"placeRechargeSeam\"] {\n return (args) => {\n const rng = args.cavern.dice.placeRechargeSeam(args.plan.id);\n const c =\n count ??\n (rng.chance(\n args.plan.kind === \"cave\"\n ? args.cavern.context.caveHasRechargeSeamChance\n : args.cavern.context.hallHasRechargeSeamChance,\n )\n ? 1\n : 0);\n if (c > 0) {\n for (let i = 0; i < c; i++) {\n const bids = bidsForOuterPearl(args).filter(({ bid }) => bid >= 1);\n if (bids.length === 0) {\n console.log(\"FAILED to place recharge seam in plan: %o\", args.plan);\n } else {\n const [x, y] = rng.weightedChoice(bids);\n args.tiles.set(x, y, Tile.RECHARGE_SEAM);\n }\n }\n }\n };\n}\n\nexport function getTotalCrystals({\n tiles,\n crystals,\n buildings,\n vehicles,\n}: {\n tiles?: Grid;\n crystals?: Grid;\n buildings?: readonly Building[];\n vehicles?: readonly Vehicle[];\n}) {\n let r = 0;\n tiles?.forEach((t) => (r += t.crystalYield));\n crystals?.forEach((ct) => (r += ct));\n buildings?.forEach((b) => (r += b.template.crystals));\n vehicles?.forEach((v) => (r += v.template.crystals));\n return r;\n}\n\nexport function getTotalOre({\n tiles,\n ore,\n}: {\n tiles?: Grid | undefined;\n ore?: Grid | undefined;\n}) {\n let r = 0;\n tiles?.forEach((t) => (r += t.oreYield));\n ore?.forEach((ct) => (r += ct));\n return r;\n}\n","import { Architect, BaseMetadata } from \"../models/architect\";\nimport { sprinkleSlugHoles } from \"./utils/creatures\";\nimport { placeErosion, placeLandslides } from \"./utils/hazards\";\nimport {\n getPlaceRechargeSeams,\n sprinkleCrystals,\n sprinkleOre,\n} from \"./utils/resources\";\n\nexport type PartialArchitect = Omit<\n Architect,\n \"name\" | \"rough\" | \"roughExtent\"\n>;\n\nexport const [DefaultCaveArchitect, DefaultHallArchitect] = (\n [\n {\n hasLandslidesChance: \"caveHasLandslidesChance\",\n landslideCooldownRange: \"caveLandslideCooldownRange\",\n baroqueness: \"caveBaroqueness\",\n },\n {\n hasLandslidesChance: \"hallHasLandslidesChance\",\n landslideCooldownRange: \"hallLandslideCooldownRange\",\n baroqueness: \"hallBaroqueness\",\n },\n ] as const\n).map(\n ({ hasLandslidesChance, landslideCooldownRange, baroqueness }) =>\n ({\n baroqueness: ({ cavern }) => cavern.context[baroqueness],\n crystalsToPlace: ({ plan }) => plan.crystalRichness * plan.perimeter,\n crystalsFromMetadata: () => 0,\n ore: ({ plan }) => plan.oreRichness * plan.perimeter,\n prime: () => undefined,\n placeRechargeSeam: getPlaceRechargeSeams(),\n placeBuildings: () => {},\n placeCrystals: (args) => {\n return sprinkleCrystals(args);\n },\n placeOre: (args) => {\n return sprinkleOre(args);\n },\n placeSlugHoles(args) {\n return sprinkleSlugHoles(args);\n },\n placeLandslides: (args) => {\n if (\n args.cavern.dice\n .placeLandslides(args.plan.id)\n .chance(args.cavern.context[hasLandslidesChance])\n ) {\n placeLandslides(args.cavern.context[landslideCooldownRange], args);\n }\n },\n placeErosion: (args) => placeErosion(30, 10, args),\n placeEntities: () => {},\n objectives: () => undefined,\n maxSlope: undefined,\n scriptGlobals: () => undefined,\n script: () => undefined,\n monsterSpawnScript: () => undefined,\n slugSpawnScript: () => undefined,\n }) as PartialArchitect,\n);\n","type Bounds = {\n left: number;\n top: number;\n right: number;\n bottom: number;\n};\n\nexport class MutableGrid {\n private data: Map<`${number},${number}`, T>;\n\n constructor(data?: Map<`${number},${number}`, T>) {\n this.data = new Map(data);\n }\n\n copy(): MutableGrid {\n return new MutableGrid(this.data);\n }\n\n get(x: number, y: number): T | undefined {\n return this.data.get(`${x},${y}`);\n }\n\n set(x: number, y: number, value: T) {\n this.data.set(`${x},${y}`, value);\n }\n\n get size(): number {\n return this.data.size;\n }\n\n get bounds(): Bounds {\n const r: Partial = {};\n this.forEach((_, x, y) => {\n if (!(x >= r.left!)) {\n r.left = x;\n } else if (!(x + 1 <= r.right!)) {\n r.right = x + 1;\n }\n if (!(y >= r.top!)) {\n r.top = y;\n } else if (!(y + 1 <= r.bottom!)) {\n r.bottom = y + 1;\n }\n });\n return r as Bounds;\n }\n\n forEach(fn: (value: T, x: number, y: number) => void) {\n this.data.forEach((v, k) => {\n const [x, y] = k.split(\",\");\n fn(v, parseInt(x), parseInt(y));\n });\n }\n\n map(fn: (value: T, x: number, y: number) => V) {\n const result: V[] = [];\n this.forEach((...args) => result.push(fn(...args)));\n return result;\n }\n\n flatMap(fn: (value: T, x: number, y: number) => V[]) {\n const result: V[] = [];\n this.forEach((...args) => result.push(...fn(...args)));\n return result;\n }\n\n reduce(\n fn: (previousValue: V, currentValue: T, x: number, y: number) => V,\n initialValue: V,\n ) {\n let result: V = initialValue;\n this.forEach((...args) => (result = fn(result, ...args)));\n return result;\n }\n}\n\nexport type Grid = Omit, \"set\">;\n","import { Cardinal4, NSEW } from \"../../common/geometry\";\nimport { MutableGrid } from \"../../common/grid\";\nimport { Architect } from \"../../models/architect\";\nimport { Building, DOCKS } from \"../../models/building\";\nimport { Tile } from \"../../models/tiles\";\n\nexport type MakeBuildingFn = (a: {\n x: number;\n y: number;\n facing: Cardinal4;\n}) => Building;\n\n/**\n * Returns an array of Building objects positioned within the given Plan\n * according to the given rules.\n *\n * Buildings are placed between the given from and to layers of the Plan's\n * innerPearl. The queue is an array of functions that return a building at\n * that point and facing direction. This function will check whether that\n * building fits in that space and does not overlap any other buildings.\n * If it does, that building will be added to the return value.\n *\n * The given queue will be modified - so anything left in it on return\n * means those buildings could not be placed.\n *\n * This function will not add buildings to the cavern or place any foundation\n * tiles, so it is the caller's responsibility to do that.\n */\nexport function getBuildings(\n {\n from,\n to,\n queue,\n }: {\n from?: number;\n to?: number;\n queue: MakeBuildingFn[];\n },\n { cavern, plan, tiles }: Parameters[\"placeBuildings\"]>[0],\n) {\n const placed = new MutableGrid();\n const porches = new MutableGrid();\n const rng = cavern.dice.placeBuildings(plan.id);\n const result: Building[] = [];\n // For each layer of the pearl\n done: for (let ly = from ?? 1; ly < (to ?? plan.innerPearl.length); ly++) {\n plan.innerPearl[ly - 1].forEach(([x, y]) => porches.set(x, y, ly));\n // For each point in the layer\n for (const [x, y] of rng.shuffle(plan.innerPearl[ly].slice())) {\n // For each building that can be built\n point: for (let i = 0; i < queue.length; i++) {\n const fn = queue[i];\n // For each possible orientation\n for (const facing of NSEW) {\n const [ox, oy] = facing;\n // Continue if this is an unacceptable porch location\n if (porches.get(x + ox, y + oy) !== ly) {\n continue;\n }\n // Make the building\n const b = fn({ x, y, facing });\n // Continue if the foundation overlaps any used or non floor tile\n if (\n b.foundation.some(\n ([x, y]) => placed.get(x, y) || tiles.get(x, y) !== Tile.FLOOR,\n )\n ) {\n continue;\n }\n // Continue if this is a docks not on water\n if (\n b.template === DOCKS &&\n tiles.get(x - ox, y - oy) !== Tile.WATER\n ) {\n continue;\n }\n // Keep this building\n result.push(b);\n b.foundation.forEach(([x, y]) => placed.set(x, y, true));\n queue.splice(i, 1);\n if (queue.length === 0) {\n break done;\n }\n break point;\n }\n }\n }\n }\n return result;\n}\n","type _Layer = {\n of: T;\n width: number;\n shrink: number;\n grow: number;\n};\n\nexport type Layer = {\n of: T;\n width?: number;\n shrink?: number;\n grow?: number;\n};\n\nexport function fixLayers(layers: Layer[]): _Layer[] {\n return layers.map((ly) => ({ width: 1, shrink: 0, grow: 0, ...ly }));\n}\n\nexport function expand(layers: readonly _Layer[], radius: number): T[] {\n radius = radius + 1;\n const totalWidth = layers.reduce((t, { width }) => t + width, 0);\n const totalShrink = layers.reduce((t, { shrink }) => t + shrink, 0);\n const totalGrow = layers.reduce((t, { grow }) => t + grow, 0);\n let growFactor = 0;\n let shrinkFactor = 0;\n if (radius < totalWidth && totalShrink > 0) {\n // For the shrink case,\n // r = (w0 * (1 - s0 * sf)) + (w1 * (1 - s1 * sf)) + ...\n // + (wn * (1 - sn * sf))\n\n // Solve for sf\n // r = w0 - w0 * s0 * sf + w1 - w1 * s1 * sf + ... + wn - wn * sn * sf\n // r = (w0 + w1 + ... + wn) - (w0 * s0 + w1 * s1 + ... + wn * sn) * sf\n // (w0 * s0 + w1 * s1 + ... + wn * sn) * sf = (w0 + w1 + ... + wn) - r\n // sf = ((w0 + w1 + ... + wn) - r) / (w0 * s0 + w1 * s1 + ... + wn * sn)\n\n shrinkFactor =\n (totalWidth - radius) /\n layers.reduce((t, { width, shrink }) => t + width * shrink, 0);\n } else if (radius > totalWidth && totalGrow > 0) {\n // For the growth case,\n // r = (w0 + g0 * gf) + (w1 + g1 * gf) + ... + (wn + gn * gf)\n\n // Solve for gf\n // r = (w0 + w1 + ... + wn) + (g0 + g1 + ... + gn) * gf\n // (r - (w0 + w1 + ... + wn)) / (g0 + g1 + ... + gn) = gf\n growFactor = (radius - totalWidth) / totalGrow;\n }\n\n let result = [];\n let w = 0;\n for (const { of, width, shrink, grow } of layers) {\n w = w + width * Math.max(0, 1 - shrink * shrinkFactor) + grow * growFactor;\n while (Math.round(w) > 0) {\n result.push(of);\n w -= 1;\n }\n }\n\n return result;\n}\n","import { PseudorandomStream } from \"../../common\";\nimport { Architect } from \"../../models/architect\";\nimport { RoughTile, Tile } from \"../../models/tiles\";\nimport { Layer, expand, fixLayers } from \"./oyster\";\n\nfunction rr({\n floor,\n dirt,\n looseRock,\n hardRock,\n solidRock,\n water,\n lava,\n}: {\n floor?: RoughTile;\n dirt?: RoughTile;\n looseRock?: RoughTile;\n hardRock?: RoughTile;\n solidRock?: RoughTile;\n water?: RoughTile;\n lava?: RoughTile;\n}): ReplaceFn {\n const r: RoughTile[] = [];\n if (floor) {\n r[Tile.FLOOR.id] = floor;\n }\n if (dirt) {\n r[Tile.DIRT.id] = dirt;\n }\n if (looseRock) {\n r[Tile.LOOSE_ROCK.id] = looseRock;\n }\n if (hardRock) {\n r[Tile.HARD_ROCK.id] = hardRock;\n }\n if (solidRock) {\n r[Tile.SOLID_ROCK.id] = solidRock;\n }\n if (water) {\n r[Tile.WATER.id] = water;\n }\n if (lava) {\n r[Tile.LAVA.id] = lava;\n }\n return (has: Tile) => r[has.id] ?? null;\n}\n\nfunction roughNotFloodedTo(to: RoughTile) {\n return rr({\n floor: to,\n dirt: to,\n looseRock: to,\n hardRock: to,\n solidRock: to,\n });\n}\n\nexport const uniformSprinkle =\n (...args: ReplaceFn[]) =>\n (has: T, rng: PseudorandomStream) =>\n rng.uniformChoice(args)(has, rng);\n\nexport const weightedSprinkle =\n (...args: { bid: number; item: ReplaceFn }[]) =>\n (has: T, rng: PseudorandomStream) =>\n rng.weightedChoice(args)(has, rng);\n\nconst _Rough = {\n // VOID: No effect whatsoever\n VOID: () => null,\n // ALWAYS_*: Ignores existing tile\n ALWAYS_FLOOR: () => Tile.FLOOR,\n ALWAYS_DIRT: () => Tile.DIRT,\n ALWAYS_LOOSE_ROCK: () => Tile.LOOSE_ROCK,\n ALWAYS_HARD_ROCK: () => Tile.HARD_ROCK,\n ALWAYS_SOLID_ROCK: () => Tile.SOLID_ROCK,\n ALWAYS_WATER: () => Tile.WATER,\n ALWAYS_LAVA: () => Tile.LAVA,\n // AT_MOST_*: Replaces only if the existing tile is harder rock\n AT_MOST_DIRT: rr({\n looseRock: Tile.DIRT,\n hardRock: Tile.DIRT,\n solidRock: Tile.DIRT,\n }),\n AT_MOST_LOOSE_ROCK: rr({\n hardRock: Tile.LOOSE_ROCK,\n solidRock: Tile.LOOSE_ROCK,\n }),\n AT_MOST_HARD_ROCK: rr({ solidRock: Tile.HARD_ROCK }),\n // No prefix: Replaces any non-flooded tile with the given tile\n FLOOR: roughNotFloodedTo(Tile.FLOOR),\n DIRT: roughNotFloodedTo(Tile.DIRT),\n LOOSE_ROCK: roughNotFloodedTo(Tile.LOOSE_ROCK),\n HARD_ROCK: roughNotFloodedTo(Tile.HARD_ROCK),\n SOLID_ROCK: roughNotFloodedTo(Tile.SOLID_ROCK),\n WATER: roughNotFloodedTo(Tile.WATER),\n LAVA: roughNotFloodedTo(Tile.LAVA),\n // Replaces floor -> dirt / loose rock <- hard rock, solid rock\n DIRT_OR_LOOSE_ROCK: rr({\n floor: Tile.DIRT,\n hardRock: Tile.LOOSE_ROCK,\n solidRock: Tile.LOOSE_ROCK,\n }),\n // Replaces floor, dirt -> loose rock / hard rock <- solid rock\n LOOSE_OR_HARD_ROCK: rr({\n floor: Tile.LOOSE_ROCK,\n dirt: Tile.LOOSE_ROCK,\n solidRock: Tile.HARD_ROCK,\n }),\n // Bridges - Replaces placed rock with floor and floods solid rock\n // This can be used by caves to create a path to an island.\n // Avoid using these if the cave intersects halls with fluid as the results\n // will look extremely strange.\n BRIDGE_ON_WATER: rr({\n dirt: Tile.FLOOR,\n looseRock: Tile.FLOOR,\n hardRock: Tile.FLOOR,\n solidRock: Tile.WATER,\n }),\n BRIDGE_ON_LAVA: rr({\n dirt: Tile.FLOOR,\n looseRock: Tile.FLOOR,\n hardRock: Tile.FLOOR,\n solidRock: Tile.LAVA,\n }),\n // Solid becomes dirt, other rock becomes floor.\n INVERT_TO_DIRT: rr({\n dirt: Tile.FLOOR,\n looseRock: Tile.FLOOR,\n hardRock: Tile.FLOOR,\n solidRock: Tile.DIRT,\n }),\n // Solid becomes loose rock, other rock becomes floor.\n INVERT_TO_LOOSE_ROCK: rr({\n dirt: Tile.FLOOR,\n looseRock: Tile.FLOOR,\n hardRock: Tile.FLOOR,\n solidRock: Tile.LOOSE_ROCK,\n }),\n};\n\nexport const Rough = {\n ..._Rough,\n MIX_DIRT_LOOSE_ROCK: weightedSprinkle(\n { item: _Rough.DIRT, bid: 1 },\n { item: _Rough.LOOSE_ROCK, bid: 4 },\n ),\n MIX_LOOSE_HARD_ROCK: weightedSprinkle(\n { item: _Rough.LOOSE_ROCK, bid: 4 },\n { item: _Rough.LOOSE_OR_HARD_ROCK, bid: 1 },\n ),\n MIX_FRINGE: weightedSprinkle(\n { item: _Rough.AT_MOST_LOOSE_ROCK, bid: 10 },\n { item: _Rough.AT_MOST_HARD_ROCK, bid: 1 },\n { item: _Rough.VOID, bid: 4 },\n ),\n} as const;\n\nexport type ReplaceFn = (\n has: T,\n rng: PseudorandomStream,\n) => T | null;\n\nexport function mkRough(\n ...args: Layer>[]\n): Pick, \"roughExtent\" | \"rough\"> {\n const layers = fixLayers(args);\n\n const roughExtent: Architect[\"roughExtent\"] =\n layers[layers.length - 1].of === Rough.VOID\n ? (plan) => {\n const ly = expand(layers, plan.pearlRadius);\n for (let i = ly.length - 1; i > 0; i--) {\n if (ly[i] !== Rough.VOID) {\n return i;\n }\n }\n return 0;\n }\n : (plan) => plan.pearlRadius;\n\n const rough: Architect[\"rough\"] = ({ cavern, plan, tiles }) => {\n const rng = cavern.dice.rough(plan.id);\n const replacements = expand(layers, plan.pearlRadius);\n plan.innerPearl.forEach((layer, i) => {\n layer.forEach(([x, y]) => {\n const r = replacements[i](tiles.get(x, y) ?? Tile.SOLID_ROCK, rng);\n if (r) {\n tiles.set(x, y, r);\n }\n });\n });\n };\n\n return { roughExtent, rough };\n}\n","import { Point } from \"../../common/geometry\";\nimport { FencedCavern } from \"../../transformers/03_plastic/00_fence\";\n\ntype VarType = {\n [p in T]: string;\n};\n\nexport function mkVars(\n prefix: string,\n keys: readonly T[],\n): VarType {\n const r: Partial> = {};\n keys.forEach((k) => (r[k] = `${prefix}_${k}`));\n return r as VarType;\n}\n\nexport function transformPoint(\n cavern: FencedCavern,\n [x, y]: Point,\n): `${number},${number}` {\n return `${y - cavern.top},${x - cavern.left}`;\n}\n\ntype Falsy = false | null | undefined;\n\nexport function scriptFragment(...rest: (string | Falsy)[]) {\n return rest.filter((s) => s).join(\"\\n\");\n}\n\nexport function eventChain(name: string, ...rest: (`${string};` | Falsy)[]) {\n return `${name}::;\\n${scriptFragment(...rest)}\\n`;\n}\n\nexport function escapeString(s: string) {\n return s.replace(/\\\\/g, \"\").replace(/\"/g, '\\\\\"');\n}\n","import { Point } from \"../../common/geometry\";\nimport { Plan } from \"../../models/plan\";\nimport { DiscoveredCavern } from \"../../transformers/03_plastic/01_discover\";\n\nexport function getDiscoveryPoint(\n cavern: DiscoveredCavern,\n plan: Plan,\n): Point | undefined {\n for (let i = 0; i < plan.innerPearl.length; i++) {\n const layer = plan.innerPearl[i];\n for (let j = 0; j < layer.length; j++) {\n const point = layer[j];\n const dz = cavern.discoveryZones.get(...point);\n if (dz) {\n return dz.openOnSpawn ? undefined : point;\n }\n }\n }\n}\n","import Delaunator from \"delaunator\";\nimport { Point, plotLine } from \"../common/geometry\";\nimport { Architect } from \"../models/architect\";\nimport {\n Building,\n CANTEEN,\n DOCKS,\n GEOLOGICAL_CENTER,\n MINING_LASER,\n POWER_STATION,\n SUPPORT_STATION,\n TELEPORT_PAD,\n TOOL_STORE,\n UPGRADE_STATION,\n} from \"../models/building\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { MakeBuildingFn, getBuildings } from \"./utils/buildings\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { position } from \"../models/position\";\nimport { getPlaceRechargeSeams, sprinkleCrystals } from \"./utils/resources\";\nimport { placeLandslides } from \"./utils/hazards\";\nimport {\n escapeString,\n eventChain,\n mkVars,\n scriptFragment,\n transformPoint,\n} from \"./utils/script\";\nimport { getDiscoveryPoint } from \"./utils/discovery\";\n\nconst DESTROY_PATH_CHANCE = 0.62;\n\nconst T0_BUILDINGS = [TOOL_STORE] as const;\nconst T1_BUILDINGS = [TELEPORT_PAD, POWER_STATION, SUPPORT_STATION] as const;\nconst T2_BUILDINGS = [UPGRADE_STATION, GEOLOGICAL_CENTER, DOCKS] as const;\nconst T3_BUILDINGS = [\n CANTEEN,\n MINING_LASER,\n MINING_LASER,\n MINING_LASER,\n] as const;\n\nconst OMIT_T1 = T0_BUILDINGS.length;\nconst MAX_HOPS = 3;\n\nexport type HqMetadata = {\n readonly tag: \"hq\";\n readonly ruin: boolean;\n readonly crystalsInBuildings: number;\n};\n\nfunction getPrime(\n maxCrystals: number,\n ruin: boolean,\n): Architect[\"prime\"] {\n return ({ cavern, plan }) => {\n const rng = cavern.dice.prime(plan.id);\n const crystalsInBuildings = rng.betaInt({\n a: 1,\n b: 1.75,\n min: 3,\n max: maxCrystals,\n });\n return { crystalsInBuildings, ruin, tag: \"hq\" };\n };\n}\n\nfunction getPlaceBuildings({\n discovered = false,\n from = 2,\n}): Architect[\"placeBuildings\"] {\n return (args) => {\n const asRuin = args.plan.metadata.ruin;\n const asSpawn = !args.plan.hops.length;\n\n // Determine the order templates will be applied.\n const rng = args.cavern.dice.placeBuildings(args.plan.id);\n const tq = [\n ...T0_BUILDINGS,\n ...(asSpawn && !asRuin ? T1_BUILDINGS : rng.shuffle(T1_BUILDINGS)),\n ...rng.shuffle(T2_BUILDINGS),\n ...rng.shuffle(T3_BUILDINGS),\n ];\n\n // Choose which buildings will be created based on total crystal budget.\n let crystalBudget = args.plan.metadata.crystalsInBuildings;\n const bq: MakeBuildingFn[] = [];\n tq.some((bt, i) => {\n const include = (() => {\n if (bt === TOOL_STORE) {\n return true;\n }\n if (crystalBudget < bt.crystals) {\n return false;\n }\n if (\n bt === DOCKS &&\n !args.plan.intersects.some(\n (_, i) => args.cavern.plans[i].fluid === Tile.WATER,\n )\n ) {\n return false;\n }\n if (asRuin && i === OMIT_T1) {\n return false;\n }\n return true;\n })();\n if (include) {\n bq.push((pos) => bt.atTile(pos));\n crystalBudget -= bt.crystals;\n if (crystalBudget <= 0) {\n return true;\n }\n } else if (asRuin) {\n bq.push((pos) => ({ ...bt.atTile(pos), isRuinAtSpawn: true }));\n }\n return false;\n });\n\n // Fit the buildings.\n const buildings = getBuildings({ from, queue: bq }, args);\n\n const dependencies = new Set(\n buildings.flatMap((b) => b.template.dependencies),\n );\n\n // Place the buildings.\n for (let i = 0; i < buildings.length; i++) {\n const building = buildings[i];\n let fTile: Tile;\n if (\"isRuinAtSpawn\" in building) {\n fTile = Tile.RUBBLE_4;\n } else {\n fTile = Tile.FOUNDATION;\n if (dependencies.has(building.template)) {\n args.buildings.push({ ...building, level: 2 });\n } else {\n args.buildings.push(building);\n }\n }\n building.foundation.forEach(([x, y]) => args.tiles.set(x, y, fTile));\n }\n\n // Place power path trails between the buildings.\n const getPorch: (b: Building) => Point = (b) =>\n b.foundation[b.foundation.length - 1];\n const addPath = (source: Building, dest: Building) => {\n for (const point of plotLine(getPorch(source), getPorch(dest))) {\n if (args.tiles.get(...point) === Tile.FLOOR) {\n args.tiles.set(\n ...point,\n asRuin && rng.chance(DESTROY_PATH_CHANCE)\n ? Tile.LANDSLIDE_RUBBLE_4\n : Tile.POWER_PATH,\n );\n }\n }\n };\n if (buildings.length > 2) {\n const points = buildings.flatMap(getPorch);\n const delaunay = new Delaunator(points);\n for (let i = 0; i < delaunay.triangles.length; i++) {\n if (i > delaunay.halfedges[i]) {\n const source = buildings[delaunay.triangles[i]];\n const dest =\n buildings[delaunay.triangles[i + (i % 3 === 2 ? -2 : 1)]];\n addPath(source, dest);\n }\n }\n } else if (buildings.length > 1) {\n addPath(buildings[0], buildings[1]);\n }\n\n // Place more rubble if this is ruin.\n if (asRuin) {\n args.plan.innerPearl.forEach((layer) =>\n layer.forEach((point) => {\n if (args.tiles.get(...point) === Tile.FLOOR) {\n args.tiles.set(\n ...point,\n rng.betaChoice(\n [\n Tile.FLOOR,\n Tile.LANDSLIDE_RUBBLE_1,\n Tile.LANDSLIDE_RUBBLE_2,\n Tile.LANDSLIDE_RUBBLE_3,\n Tile.LANDSLIDE_RUBBLE_4,\n ],\n { a: 1, b: 4 },\n ),\n );\n }\n }),\n );\n }\n\n // Place open cave flag if this is discovered.\n if (discovered) {\n args.openCaveFlags.set(...buildings[0].foundation[0], true);\n }\n\n // Set initial camera if this is spawn.\n if (asSpawn) {\n const [xt, yt] = buildings.reduce(\n ([x, y], b) => [x + b.x, y + b.y],\n [0, 0],\n );\n args.setCameraPosition(\n position({\n x: buildings[0].x,\n y: buildings[0].y,\n aimedAt: [xt / buildings.length, yt / buildings.length],\n pitch: Math.PI / 4,\n }),\n );\n }\n\n // Some crystals remain that were not used.\n if (crystalBudget > 0) {\n sprinkleCrystals(args, { count: crystalBudget, seamBias: 0 });\n }\n };\n}\n\nexport const gLostHq = mkVars(\"gLostHq\", [\"foundHq\"]);\n\nconst WITH_FIND_OBJECTIVE: Pick<\n Architect,\n \"objectives\" | \"scriptGlobals\" | \"script\"\n> = {\n objectives: () => ({\n variables: [\n {\n condition: `${gLostHq.foundHq}>0`,\n description: \"Find the lost Rock Raider HQ\",\n },\n ],\n sufficient: false,\n }),\n scriptGlobals: () =>\n scriptFragment(\"# Globals: Lost HQ\", `int ${gLostHq.foundHq}=0`),\n script({ cavern, plan }) {\n const discoPoint = getDiscoveryPoint(cavern, plan);\n if (!discoPoint) {\n throw new Error(\"Cave has Find HQ objective but no undiscovered points.\");\n }\n\n const camPoint = plan.path.baseplates.reduce((r, p) => {\n return r.pearlRadius > p.pearlRadius ? r : p;\n }).center;\n\n const v = mkVars(`p${plan.id}LostHq`, [\"messageDiscover\", \"onDiscover\"]);\n const message = cavern.lore.foundHq(cavern.dice).text;\n\n return scriptFragment(\n `# P${plan.id}: Lost HQ`,\n `string ${v.messageDiscover}=\"${escapeString(message)}\"`,\n `if(change:${transformPoint(cavern, discoPoint)})[${v.onDiscover}]`,\n eventChain(\n v.onDiscover,\n `msg:${v.messageDiscover};`,\n `pan:${transformPoint(cavern, camPoint)};`,\n `wait:1;`,\n `${gLostHq.foundHq}=1;`,\n ),\n );\n },\n};\n\nconst BASE: Omit, \"prime\"> &\n Pick, \"rough\" | \"roughExtent\"> = {\n ...DefaultCaveArchitect,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 2 },\n { of: Rough.FLOOR, width: 0, grow: 2 },\n { of: Rough.DIRT, width: 0, grow: 0.5 },\n { of: Rough.DIRT_OR_LOOSE_ROCK, grow: 0.25 },\n { of: Rough.MIX_LOOSE_HARD_ROCK, grow: 0.25 },\n ),\n crystalsFromMetadata: (metadata) => metadata.crystalsInBuildings,\n placeRechargeSeam: getPlaceRechargeSeams(1),\n maxSlope: 15,\n};\n\nexport const ESTABLISHED_HQ = [\n {\n name: \"Established HQ Spawn\",\n ...BASE,\n prime: getPrime(10, false),\n placeBuildings: getPlaceBuildings({ discovered: true }),\n spawnBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 5 && 0.5,\n },\n {\n name: \"Ruined HQ Spawn\",\n ...BASE,\n prime: getPrime(12, true),\n placeBuildings: getPlaceBuildings({\n discovered: true,\n from: 3,\n }),\n placeLandslides: (args) => placeLandslides({ min: 15, max: 60 }, args),\n spawnBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 6 && 0.5,\n },\n {\n name: \"Find Established HQ\",\n ...BASE,\n prime: getPrime(15, false),\n placeBuildings: getPlaceBuildings({}),\n caveBid: ({ plan, hops, plans }) =>\n !plan.fluid &&\n plan.pearlRadius > 5 &&\n hops.length <= MAX_HOPS &&\n !hops.some((id) => plans[id].fluid) &&\n !plans.some((p) => p.metadata?.tag === \"hq\") &&\n 0.5,\n ...WITH_FIND_OBJECTIVE,\n },\n {\n name: \"Find Ruined HQ\",\n ...BASE,\n prime: getPrime(15, true),\n placeBuildings: getPlaceBuildings({ from: 3 }),\n placeLandslides: (args) => placeLandslides({ min: 15, max: 100 }, args),\n caveBid: ({ plan, hops, plans }) =>\n !plan.fluid &&\n plan.pearlRadius > 6 &&\n hops.length <= MAX_HOPS &&\n !plans.some((p) => p.metadata?.tag === \"hq\") &&\n (plans[hops[0]].metadata?.tag === \"nomads\" ? 5 : 0.5),\n ...WITH_FIND_OBJECTIVE,\n },\n] as const satisfies readonly Architect[];\n\nexport default ESTABLISHED_HQ;\n","import { PseudorandomStream } from \"../../common\";\nimport { Point } from \"../../common/geometry\";\nimport {\n CreatureTemplate,\n SLIMY_SLUG,\n monsterForBiome,\n} from \"../../models/creature\";\nimport { Plan } from \"../../models/plan\";\nimport { EnscribedCavern } from \"../../transformers/04_ephemera/02_enscribe\";\nimport { getDiscoveryPoint } from \"./discovery\";\nimport { eventChain, mkVars, scriptFragment, transformPoint } from \"./script\";\n\ntype CreatureSpawnerArgs = {\n readonly armEvent?: string;\n readonly creature: CreatureTemplate;\n readonly emerges?: readonly Emerge[];\n readonly initialCooldown?: { min: number; max: number };\n readonly maxTriggerCount?: number;\n readonly meanWaveSize?: number;\n readonly needCrystals?: { base: number; increment?: number };\n readonly retriggerMode: RetriggerMode;\n readonly rng: PseudorandomStream;\n readonly spawnRate?: number;\n readonly triggerOnFirstArmed: boolean;\n readonly triggerPoints?: readonly Point[];\n readonly waveSize?: number;\n};\n\nconst STATE = {\n /** This spawner is deactivated and can't be reactivated. */\n EXHAUSTED: 0,\n /** This spawner has not been activated yet. */\n INITIAL: 1,\n /** This spawner is waiting to be reactivated by some trigger. */\n AWAITING_REARM: 2,\n /** This spawner just activated and is waiting for time to pass. */\n COOLDOWN: 3,\n /** This spawner is ready to activate. */\n ARMED: 4,\n} as const;\n\nconst RETRIGGER_MODES = {\n automatic: { afterTriggerState: STATE.COOLDOWN },\n hoard: { afterTriggerState: STATE.AWAITING_REARM },\n} as const;\n\nexport type RetriggerMode = keyof typeof RETRIGGER_MODES;\n\ntype Emerge = {\n readonly x: number;\n readonly y: number;\n readonly radius: number;\n};\n\nfunction getEmerges(plan: Plan): Emerge[] {\n return plan.path.baseplates.map((bp) => {\n const [x, y] = bp.center;\n return { x: Math.floor(x), y: Math.floor(y), radius: bp.pearlRadius };\n });\n}\n\nfunction cycleEmerges(\n emerges: readonly Emerge[],\n rng: PseudorandomStream,\n waveSize: number,\n) {\n const result: Emerge[] = [];\n while (result.length < waveSize) {\n result.push(...rng.shuffle(emerges));\n }\n result.length = waveSize;\n return result;\n}\n\nfunction getArmTriggers(\n cavern: EnscribedCavern,\n plan: Plan,\n armFn: string,\n) {\n const discoveryPoint = getDiscoveryPoint(cavern, plan);\n if (discoveryPoint) {\n // There is a non-wall tile that starts undiscovered.\n // Enable when it is discovered.\n return [`if(change:${transformPoint(cavern, discoveryPoint)})[${armFn}]`];\n }\n // Just enable on init.\n return [`if(time:0)[${armFn}]`];\n}\n\nfunction getTriggerPoints(cavern: EnscribedCavern, plan: Plan): Point[] {\n // Pick any tile that was set with a value, even if it is solid rock.\n return plan.outerPearl[0].filter((point) => cavern.tiles.get(...point));\n}\n\nexport function monsterSpawnScript(\n args: { cavern: EnscribedCavern; plan: Plan },\n opts?: Partial,\n) {\n return creatureSpawnScript(args, {\n creature: monsterForBiome(args.cavern.context.biome),\n retriggerMode: \"automatic\",\n rng: args.cavern.dice.monsterSpawnScript(args.plan.id),\n triggerOnFirstArmed: false,\n ...opts,\n });\n}\n\nexport function slugSpawnScript(\n args: { cavern: EnscribedCavern; plan: Plan },\n opts?: Partial,\n) {\n return creatureSpawnScript(args, {\n creature: SLIMY_SLUG,\n needCrystals: { base: 1 },\n retriggerMode: \"automatic\",\n rng: args.cavern.dice.slugSpawnScript(args.plan.id),\n triggerOnFirstArmed: false,\n ...opts,\n });\n}\n\nfunction creatureSpawnScript(\n { cavern, plan }: { cavern: EnscribedCavern; plan: Plan },\n opts: CreatureSpawnerArgs,\n) {\n const v = mkVars(`p${plan.id}${opts.creature.inspectAbbrev}Sp`, [\n \"doArm\",\n \"doRetrigger\",\n \"doSpawn\",\n \"needCrystals\",\n \"state\",\n \"triggerCount\",\n ]);\n\n const waveSize =\n opts.waveSize ??\n opts.rng.betaInt({\n a: 5,\n b: 2,\n min: 1,\n max: (opts.meanWaveSize ?? plan.monsterWaveSize) * 1.25,\n });\n const delay = { min: 2 / waveSize, max: 15 / waveSize };\n const spawnRate = opts.spawnRate ?? plan.monsterSpawnRate;\n const meanCooldown = (60 * waveSize) / spawnRate;\n\n const armEvent = opts.armEvent ?? v.doArm;\n const armTriggers = opts.armEvent\n ? []\n : getArmTriggers(cavern, plan, armEvent);\n const cooldownOffset = meanCooldown / 4;\n const cooldown = {\n min: meanCooldown - cooldownOffset,\n max: meanCooldown + cooldownOffset,\n };\n const emerges = cycleEmerges(\n opts.emerges ?? getEmerges(plan),\n opts.rng,\n waveSize,\n );\n const once = opts.maxTriggerCount === 1;\n const triggerPoints = opts.triggerPoints ?? getTriggerPoints(cavern, plan);\n\n const needCountTriggerEvents = !once && opts.maxTriggerCount !== undefined;\n const needTriggerPoints = !(once && opts.triggerOnFirstArmed);\n\n return scriptFragment(\n `# P${plan.id}: Spawn ${opts.creature.name} x${waveSize}`,\n\n // Declare variables\n `int ${v.state}=${STATE.INITIAL}`,\n needCountTriggerEvents && `int ${v.triggerCount}=0`,\n opts.needCrystals?.increment !== undefined &&\n `int ${v.needCrystals}=${opts.needCrystals.base}`,\n\n // Enable\n ...armTriggers,\n eventChain(\n armEvent,\n opts.initialCooldown &&\n `wait:random(${opts.initialCooldown.min.toFixed(2)})(${opts.initialCooldown.max.toFixed(2)});`,\n armTriggers.length !== 1 && `((${v.state}>${STATE.INITIAL}))return;`,\n `${v.state}=${STATE.ARMED};`,\n opts.triggerOnFirstArmed && `${v.doSpawn};`,\n ),\n\n // Do the actual spawning.\n ...(needTriggerPoints\n ? triggerPoints.map(\n (point) =>\n `when(enter:${transformPoint(cavern, point)})[${v.doSpawn}]`,\n )\n : []),\n eventChain(\n v.doSpawn,\n\n // Check conditions to reject.\n `((${v.state}<${STATE.ARMED}))return;`,\n opts.needCrystals &&\n `((crystals<${opts.needCrystals.increment ? v.needCrystals : opts.needCrystals.base}))return;`,\n\n // Update variables before triggering.\n `${v.state}=${RETRIGGER_MODES[opts.retriggerMode].afterTriggerState};`,\n needCountTriggerEvents && `${v.triggerCount}+=1;`,\n opts.needCrystals?.increment !== undefined &&\n `${v.needCrystals}=crystals+${opts.needCrystals.increment};`,\n\n // Trigger all the spawns.\n ...(emerges.flatMap((emerge) => [\n `wait:random(${delay.min.toFixed(2)})(${delay.max.toFixed(2)});`,\n `emerge:${transformPoint(cavern, [emerge.x, emerge.y])},A,${opts.creature.id},${emerge.radius};`,\n ]) as `${string};`[]),\n\n // Update the counter.\n once\n ? `${v.state}=${STATE.EXHAUSTED};`\n : opts.maxTriggerCount !== undefined &&\n `((${v.triggerCount}>=${opts.maxTriggerCount}))${v.state}=${STATE.EXHAUSTED};`,\n // Wait for the cooldown period.\n !once &&\n `wait:random(${cooldown.min.toFixed(2)})(${cooldown.max.toFixed(2)});`,\n // Re-arm if in cooldown.\n !once &&\n `((${v.state}>=${STATE.COOLDOWN}))[${v.state}=${STATE.ARMED}][${v.state}=${STATE.EXHAUSTED}];`,\n ),\n\n // Hoard mode must be \"manually\" re-armed by a monster visiting the hoard\n // within cooldown.\n ...(!once && opts.retriggerMode === \"hoard\"\n ? [\n ...plan.innerPearl[0].map(\n (point) =>\n `when(enter:${transformPoint(cavern, point)},${opts.creature.id})[${v.doRetrigger}]`,\n ),\n eventChain(\n v.doRetrigger,\n `((${v.state}==${STATE.AWAITING_REARM}))${v.state}=${STATE.COOLDOWN};`,\n ),\n ]\n : []),\n );\n}\n","import { Architect, BaseMetadata } from \"../models/architect\";\nimport { DefaultHallArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport {\n escapeString,\n eventChain,\n mkVars,\n scriptFragment,\n transformPoint,\n} from \"./utils/script\";\nimport { DiscoveredCavern } from \"../transformers/03_plastic/01_discover\";\nimport { Plan } from \"../models/plan\";\nimport { monsterSpawnScript } from \"./utils/creature_spawners\";\nimport { Hardness, Tile } from \"../models/tiles\";\n\n// Fissure halls are not drillable, but suddenly crack open without any player\n// involvement after being discovered.\n\nconst METADATA = { tag: \"fissure\" } as const satisfies BaseMetadata;\n\nfunction getDiscoveryPoints(cavern: DiscoveredCavern, plan: Plan) {\n const used: true[] = [];\n return plan.innerPearl[0].filter((pos) => {\n const dz = cavern.discoveryZones.get(...pos);\n if (!dz || dz.openOnSpawn || used[dz.id]) {\n return false;\n }\n used[dz.id] = true;\n return true;\n });\n}\n\nconst sVars = (plan: Plan) =>\n mkVars(`p${plan.id}Fissure`, [\n \"onDiscover\",\n `onTrip`,\n `msgForeshadow`,\n `spawn`,\n \"tripCount\",\n ]);\n\nconst BASE: PartialArchitect = {\n ...DefaultHallArchitect,\n prime: () => METADATA,\n script: ({ cavern, plan }) => {\n const v = sVars(plan);\n const discoveryPoints = getDiscoveryPoints(cavern, plan);\n const panTo = plan.innerPearl[0][Math.floor(plan.innerPearl[0].length / 2)];\n const rng = cavern.dice.script(plan.id);\n\n const drillPoints = plan.innerPearl[0].filter((pos) => {\n const t = cavern.tiles.get(...pos) ?? Tile.SOLID_ROCK;\n return t.isWall && t.hardness < Hardness.SOLID;\n });\n const trips = Math.ceil((discoveryPoints.length + drillPoints.length) / 4);\n\n return scriptFragment(\n `# P${plan.id}: Fissure`,\n `int ${v.tripCount}=0`,\n `string ${v.msgForeshadow}=\"${escapeString(cavern.lore.generateSeismicForeshadow(rng).text)}\"`,\n ...discoveryPoints.map(\n (pos) => `if(change:${transformPoint(cavern, pos)})[${v.onTrip}]`,\n ),\n ...drillPoints.map(\n (pos) => `if(drill:${transformPoint(cavern, pos)})[${v.onTrip}]`,\n ),\n eventChain(\n v.onTrip,\n `${v.tripCount}+=1;`,\n `((${v.tripCount}!=${trips}))return;`,\n `wait:random(5)(30);`,\n `shake:1;`,\n `msg:${v.msgForeshadow};`,\n `wait:random(30)(150);`,\n `shake:2;`,\n `pan:${transformPoint(cavern, panTo)};`,\n `wait:1;`,\n `shake:4;`,\n ...plan.innerPearl[0]\n .filter((pos) => cavern.tiles.get(...pos)?.isWall)\n .map(\n (pos) => `drill:${transformPoint(cavern, pos)};` as `${string};`,\n ),\n cavern.context.hasMonsters && `${v.spawn};`,\n ),\n );\n },\n monsterSpawnScript: (args) => {\n const bps = args.plan.path.baseplates;\n const ebps = [bps[0], bps[bps.length - 1]];\n return monsterSpawnScript(args, {\n armEvent: sVars(args.plan).spawn,\n emerges: ebps.map((bp) => {\n const [x, y] = bp.center;\n return { x: Math.floor(x), y: Math.floor(y), radius: bp.pearlRadius };\n }),\n maxTriggerCount: 1,\n triggerOnFirstArmed: true,\n });\n },\n};\n\nconst FISSURE = [\n {\n name: \"Fissure Hall\",\n ...BASE,\n ...mkRough({ of: Rough.SOLID_ROCK }, { of: Rough.VOID, grow: 1 }),\n hallBid: ({ plan, plans }) =>\n !plan.fluid &&\n plan.path.kind === \"auxiliary\" &&\n plan.path.exclusiveSnakeDistance > 1 &&\n !plan.intersects.some((_, i) => plans[i].metadata?.tag === \"fissure\") &&\n 1,\n },\n] as const satisfies readonly Architect[];\n\nexport default FISSURE;\n","import { FluidType } from \"../../models/tiles\";\nimport { FloodedPlan } from \"../../transformers/01_planning/02_flood\";\n\nexport function intersectsAny(\n plans: readonly FloodedPlan[],\n plan: FloodedPlan,\n fluid: FluidType,\n) {\n return plans.some((p) => plan.intersects[p.id] && p.fluid === fluid);\n}\n\nexport function intersectsOnly(\n plans: readonly FloodedPlan[],\n plan: FloodedPlan,\n fluid: FluidType,\n) {\n return !plans.some((p) => plan.intersects[p.id] && p.fluid !== fluid);\n}\n\nexport function isDeadEnd(plan: FloodedPlan) {\n return plan.intersects.reduce((r, n) => r + (n ? 1 : 0), 0) <= 1;\n}\n","import { Architect } from \"../models/architect\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough, weightedSprinkle } from \"./utils/rough\";\nimport { intersectsOnly, isDeadEnd } from \"./utils/intersects\";\nimport { monsterSpawnScript } from \"./utils/creature_spawners\";\nimport { sprinkleCrystals } from \"./utils/resources\";\nimport { placeSleepingMonsters } from \"./utils/creatures\";\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n placeSlugHoles() {},\n monsterSpawnScript(args) {\n if (args.cavern.context.biome === \"ice\" && args.plan.fluid === Tile.LAVA) {\n return undefined;\n }\n if (args.cavern.context.biome === \"lava\" && args.plan.fluid !== Tile.LAVA) {\n return undefined;\n }\n return monsterSpawnScript(args);\n },\n};\n\nconst FLOODED = [\n {\n name: \"Lake\",\n ...BASE,\n ...mkRough(\n { of: Rough.WATER, grow: 2 },\n { of: Rough.FLOOR, shrink: 1, grow: 1 },\n { of: Rough.LOOSE_ROCK },\n {\n of: weightedSprinkle(\n { item: Rough.LOOSE_ROCK, bid: 10 },\n { item: Rough.LOOSE_OR_HARD_ROCK, bid: 1 },\n ),\n },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.WATER && plan.pearlRadius < 10 && 1,\n },\n {\n name: \"Lake With Sleeping Monsters\",\n ...BASE,\n ...mkRough(\n { of: Rough.WATER, grow: 2 },\n { of: Rough.FLOOR, grow: 1 },\n { of: Rough.LOOSE_ROCK },\n { of: Rough.LOOSE_OR_HARD_ROCK },\n ),\n caveBid: ({ cavern, plan }) =>\n cavern.context.hasMonsters &&\n cavern.context.biome === \"ice\" &&\n plan.fluid === Tile.WATER &&\n plan.path.baseplates.length > 1 &&\n plan.pearlRadius > 3 &&\n plan.pearlRadius < 10 &&\n 1,\n placeEntities(args) {\n const rng = args.cavern.dice.placeEntities(args.plan.id);\n const count = Math.ceil(args.plan.monsterWaveSize * 1.2);\n placeSleepingMonsters(args, rng, count);\n },\n },\n {\n name: \"Island\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 0.7 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_LOOSE_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_DIRT, grow: 0.5 },\n { of: Rough.ALWAYS_FLOOR, grow: 0.1 },\n { of: Rough.WATER, grow: 2 },\n { of: Rough.FLOOR, grow: 1 },\n { of: Rough.LOOSE_ROCK },\n { of: Rough.MIX_FRINGE },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.WATER && plan.pearlRadius > 5 && 2,\n },\n {\n name: \"Lava Lake\",\n ...BASE,\n ...mkRough(\n { of: Rough.LAVA, grow: 2 },\n { of: Rough.FLOOR, grow: 1 },\n { of: Rough.LOOSE_ROCK, shrink: 1 },\n { of: Rough.LOOSE_OR_HARD_ROCK },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.LAVA && plan.pearlRadius < 10 && 1,\n },\n {\n name: \"Lava Island\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 0.7 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_LOOSE_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 0.1 },\n { of: Rough.LAVA, grow: 2 },\n { of: Rough.FLOOR, grow: 0.5 },\n { of: Rough.LOOSE_ROCK },\n { of: Rough.LOOSE_OR_HARD_ROCK },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.LAVA && plan.pearlRadius > 5 && 1,\n },\n {\n name: \"Peninsula\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 0.7 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_LOOSE_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_DIRT, width: 0, grow: 0.5 },\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 0.1 },\n { of: Rough.BRIDGE_ON_WATER, grow: 2 },\n { of: Rough.LOOSE_ROCK },\n { of: Rough.MIX_FRINGE },\n ),\n caveBid: ({ plans, plan }) =>\n plan.fluid === Tile.WATER &&\n plan.pearlRadius > 5 &&\n isDeadEnd(plan) &&\n intersectsOnly(plans, plan, null) &&\n 1,\n },\n {\n name: \"Lava Peninsula\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 0.7 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.2 },\n { of: Rough.ALWAYS_LOOSE_ROCK, grow: 0.2 },\n { of: Rough.ALWAYS_FLOOR, grow: 0.1 },\n { of: Rough.BRIDGE_ON_LAVA, grow: 2 },\n { of: Rough.AT_MOST_HARD_ROCK },\n ),\n caveBid: ({ plans, plan }) =>\n plan.fluid === Tile.LAVA &&\n plan.pearlRadius > 5 &&\n isDeadEnd(plan) &&\n intersectsOnly(plans, plan, null) &&\n 1,\n },\n {\n name: \"Lava Stalagmite Cave\",\n ...BASE,\n crystalsToPlace: ({ plan }) => plan.crystalRichness * plan.perimeter * 2,\n ...mkRough(\n {\n of: weightedSprinkle(\n { item: Rough.ALWAYS_DIRT, bid: 0.01 },\n { item: Rough.ALWAYS_LOOSE_ROCK, bid: 0.1 },\n { item: Rough.LAVA, bid: 1 },\n ),\n width: 4,\n grow: 1,\n },\n {\n of: weightedSprinkle(\n { item: Rough.AT_MOST_DIRT, bid: 0.25 },\n { item: Rough.AT_MOST_LOOSE_ROCK, bid: 1 },\n ),\n },\n { of: Rough.AT_MOST_HARD_ROCK },\n ),\n placeCrystals(args) {\n sprinkleCrystals(args, {\n seamBias: Math.max(args.cavern.context.caveCrystalSeamBias, 0.6),\n });\n },\n caveBid: ({ plan }) =>\n plan.fluid === Tile.LAVA &&\n plan.hasErosion &&\n plan.pearlRadius > 5 &&\n 0.4,\n },\n] as const satisfies readonly Architect[];\nexport default FLOODED;\n","import { Architect } from \"../models/architect\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultHallArchitect } from \"./default\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { NSEW, Point } from \"../common/geometry\";\n\n// Loopback halls use solid rock to ensure they can only be accessed after\n// excavating both ends. Note: This algorithm is a bit weak in that it can err\n// in both directions - Sometimes, it generates a hall that isn't completely\n// sealed off (particularly where multiple halls intersect one of the ends)\n// and, while this hasn't come up in testing yet, it's possible for this to\n// generate a pair of dead ends that don't open properly.\n\nconst BASE: typeof DefaultHallArchitect = {\n ...DefaultHallArchitect,\n};\n\nfunction withBarrier({\n roughExtent,\n rough,\n}: Pick, \"roughExtent\" | \"rough\">): Pick<\n Architect,\n \"roughExtent\" | \"rough\"\n> {\n const roughWithBarrier: Architect[\"rough\"] = (args) => {\n rough(args);\n\n // Is this hall allowed to place solid rock here?\n function overlaps(pos: Point) {\n const idx = args.cavern.pearlInnerDex.get(...pos);\n // The position must ONLY overlap this hall. Otherwise, this might block\n // another hall, which could make the level unplayable.\n return idx && !idx.some((_, i) => i !== args.plan.id);\n }\n\n const tipPlans = args.plan.intersects\n .map((_, id) => args.cavern.plans[id])\n .filter((p) => p.kind === \"cave\")\n .sort((a, b) => a.hops.length - b.hops.length);\n\n const op = Math.min(...tipPlans.map((tp) => tp.outerPearl.length)) - 1;\n for (let i = 0; i < op; i++) {\n for (const tipPlan of tipPlans) {\n // Add a \"crust\" of solid rock on the first layer of the outer pearl.\n const crust = tipPlan.outerPearl[i].filter(overlaps);\n if (crust.length < args.plan.pearlRadius) {\n continue;\n }\n crust.forEach((pos) => args.tiles.set(...pos, Tile.SOLID_ROCK));\n // For the second layer, add solid rock wherever it borders at least two\n // solid rock.\n tipPlan.outerPearl[i + 1]\n .filter(overlaps)\n .filter(\n ([x, y]) =>\n NSEW.reduce(\n (r, [ox, oy]) =>\n (args.tiles.get(x + ox, y + oy) ?? Tile.SOLID_ROCK) ===\n Tile.SOLID_ROCK\n ? r + 1\n : r,\n 0,\n ) > 1,\n )\n .forEach((pos) => args.tiles.set(...pos, Tile.SOLID_ROCK));\n return;\n }\n }\n };\n return { roughExtent, rough: roughWithBarrier };\n}\n\nconst LOOPBACK = [\n {\n name: \"Loopback Hall\",\n ...BASE,\n ...withBarrier(\n mkRough(\n { of: Rough.FLOOR, grow: 2 },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK },\n { of: Rough.VOID, grow: 1 },\n ),\n ),\n hallBid: ({ plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 1 &&\n plan.path.kind === \"auxiliary\" &&\n plan.path.exclusiveSnakeDistance > 5 &&\n 2,\n },\n] as const satisfies readonly Architect[];\n\nexport default LOOPBACK;\n","import { Point } from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\nimport { EntityPosition, serializePosition } from \"./position\";\n\ntype Upgrade =\n | \"UpEngine\"\n | \"UpDrill\"\n | \"UpAddDrill\"\n | \"UpCargoHold\"\n | \"UpScanner\"\n | \"UpLaser\"\n | \"UpAddNav\";\n\nconst JOBS = {\n land: \"JobDriver\",\n air: \"JobPilot\",\n sea: \"JobSailor\",\n} as const;\n\nexport class VehicleTemplate {\n readonly id: string;\n readonly name: string;\n readonly inspectAbbrev: string;\n readonly frame: \"small\" | \"large\";\n readonly kind: \"land\" | \"sea\" | \"air\";\n readonly crystals: number;\n readonly upgrades: readonly Upgrade[];\n constructor(\n id: string,\n name: string,\n inspectAbbrev: string,\n frame: \"small\" | \"large\",\n kind: \"land\" | \"sea\" | \"air\",\n crystals: number,\n upgrades: readonly Upgrade[],\n ) {\n this.id = id;\n this.name = name;\n this.inspectAbbrev = inspectAbbrev;\n this.frame = frame;\n this.kind = kind;\n this.crystals = crystals;\n this.upgrades = upgrades;\n }\n\n get job() {\n return JOBS[this.kind];\n }\n}\n\nexport const HOVER_SCOUT = new VehicleTemplate(\n \"VehicleHoverScout_C\",\n \"Hover Scout\",\n \"HoSc\",\n \"small\",\n \"land\",\n 1,\n [\"UpEngine\"],\n);\nexport const SMALL_DIGGER = new VehicleTemplate(\n \"VehicleSmallDigger_C\",\n \"Small Digger\",\n \"SmDi\",\n \"small\",\n \"land\",\n 1,\n [\"UpEngine\", \"UpDrill\"],\n);\nexport const SMALL_TRANSPORT_TRUCK = new VehicleTemplate(\n \"VehicleSmallTransportTruck_C\",\n \"Small Transport Truck\",\n \"SmTT\",\n \"small\",\n \"land\",\n 2,\n [\"UpEngine\", \"UpCargoHold\"],\n);\nexport const RAPID_RIDER = new VehicleTemplate(\n \"VehicleRapidRider_C\",\n \"Rapid Rider\",\n \"RaRr\",\n \"small\",\n \"sea\",\n 2,\n [\"UpAddDrill\", \"UpCargoHold\"],\n);\nexport const SMLC = new VehicleTemplate(\n \"VehicleSMLC_C\",\n \"Small Mobile Laser Cutter\",\n \"SMLC\",\n \"small\",\n \"land\",\n 3,\n [\"UpEngine\", \"UpLaser\"],\n);\nexport const TUNNEL_SCOUT = new VehicleTemplate(\n \"VehicleTunnelScout_C\",\n \"Tunnel Scout\",\n \"TuSc\",\n \"small\",\n \"air\",\n 3,\n [\"UpAddDrill\"],\n);\nexport const LOADER_DOZER = new VehicleTemplate(\n \"VehicleLoaderDozer_C\",\n \"Loader Dozer\",\n \"LoDz\",\n \"large\",\n \"land\",\n 5,\n [\"UpEngine\"],\n);\nexport const GRANITE_GRINDER = new VehicleTemplate(\n \"VehicleGraniteGrinder_C\",\n \"Granite Grinder\",\n \"GrGr\",\n \"large\",\n \"land\",\n 5,\n [\"UpEngine\", \"UpDrill\"],\n);\nexport const CARGO_CARRIER = new VehicleTemplate(\n \"VehicleCargoCarrier_C\",\n \"Cargo Carrier\",\n \"CaCa\",\n \"large\",\n \"sea\",\n 5,\n [\"UpAddNav\"],\n);\nexport const LMLC = new VehicleTemplate(\n \"VehicleLMLC_C\",\n \"Large Mobile Laser Cutter\",\n \"LMLC\",\n \"large\",\n \"land\",\n 8,\n [\"UpEngine\", \"UpLaser\", \"UpAddNav\"],\n);\nexport const CHROME_CRUSHER = new VehicleTemplate(\n \"VehicleChromeCrusher_C\",\n \"Chrome Crusher\",\n \"CrCr\",\n \"large\",\n \"land\",\n 8,\n [\"UpEngine\", \"UpDrill\", \"UpLaser\", \"UpScanner\"],\n);\nexport const TUNNEL_TRANSPORT = new VehicleTemplate(\n \"VehicleTunnelTransport_C\",\n \"Tunnel Transport\",\n \"TuTr\",\n \"large\",\n \"air\",\n 10,\n [],\n);\n\nexport type Vehicle = EntityPosition & {\n readonly id: number;\n readonly template: VehicleTemplate;\n readonly essential: boolean;\n readonly driverId: number | null;\n readonly upgrades: Upgrade[];\n};\n\nexport class VehicleFactory {\n private id: number = 0;\n create(\n args: EntityPosition & {\n template: T;\n upgrades?: T[\"upgrades\"][number][];\n } & Partial>,\n ): Vehicle {\n return {\n essential: false,\n driverId: null,\n upgrades: [],\n ...args,\n id: this.id++,\n };\n }\n}\n\nexport function serializeVehicle(\n vehicle: Vehicle,\n offset: Point,\n heightMap: Grid,\n) {\n return [\n vehicle.template.id,\n serializePosition(vehicle, offset, heightMap, 0, \"entity\"),\n vehicle.upgrades.map((u) => `${u}/`).join(\"\"),\n vehicle.driverId !== null && `driver=${vehicle.driverId.toFixed()}`,\n vehicle.essential && \"Essential=true\",\n `ID=${vehicle.id.toFixed()}`,\n ]\n .filter((n) => n)\n .join(\",\");\n}\n","import { PseudorandomStream } from \"../common\";\nimport { Point } from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\nimport { Architect } from \"../models/architect\";\nimport { PlannedCavern } from \"../models/cavern\";\nimport { DiscoveryZone } from \"../models/discovery_zone\";\nimport { Plan } from \"../models/plan\";\nimport { randomlyInTile } from \"../models/position\";\nimport { Tile } from \"../models/tiles\";\nimport {\n Vehicle,\n VehicleFactory,\n VehicleTemplate,\n HOVER_SCOUT,\n RAPID_RIDER,\n SMALL_DIGGER,\n SMALL_TRANSPORT_TRUCK,\n TUNNEL_SCOUT,\n} from \"../models/vehicle\";\nimport { DiscoveredCavern } from \"../transformers/03_plastic/01_discover\";\nimport { StrataformedCavern } from \"../transformers/03_plastic/02_strataform\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { isDeadEnd } from \"./utils/intersects\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { pickPoint } from \"./utils/placement\";\nimport {\n escapeString,\n eventChain,\n mkVars,\n scriptFragment,\n transformPoint,\n} from \"./utils/script\";\n\nexport type LostMinersMetadata = {\n readonly tag: \"lostMiners\";\n readonly minersCount: number;\n};\n\nexport const gLostMiners = mkVars(\"gLostMiners\", [\n \"remainingCaves\",\n \"onFoundAll\",\n \"messageFoundAll\",\n \"done\",\n]);\n\nexport function countLostMiners(cavern: PlannedCavern) {\n let lostMiners: number = 0;\n let lostMinerCaves: number = 0;\n cavern.plans.forEach((plan) => {\n if (plan.metadata?.tag === \"lostMiners\") {\n lostMinerCaves++;\n lostMiners += plan.metadata.minersCount;\n }\n });\n return { lostMiners, lostMinerCaves };\n}\n\nfunction getBreadcrumbPoint(\n cavern: DiscoveredCavern,\n [minersX, minersY]: Point,\n minersDz: DiscoveryZone,\n plan: Plan,\n): Point {\n if (!plan.hops.length) {\n throw new Error(\"Reached spawn without a breadcrumb\");\n }\n\n // Choose the neighboring plan which is closest to spawn (fewest hops).\n const neighborPlan = cavern.plans[plan.hops[plan.hops.length - 1]];\n\n const result = neighborPlan.innerPearl\n .flatMap((layer) => layer)\n // Find all the points in the inner pearl that are not walls and are in a\n // different discovery zone from the miners.\n .filter(([x, y]) => {\n const dz = cavern.discoveryZones.get(x, y);\n return dz && dz !== minersDz;\n })\n // Compute a^2 + b^2 for these points to get their relative distance and\n // choose the closest point to the miners.\n .map(\n ([x, y]) =>\n [x, y, (x - minersX) ** 2 + (y - minersY) ** 2] as [\n number,\n number,\n number,\n ],\n )\n .reduce(\n (r: [number, number, number] | null, p) => (r && r[2] < p[2] ? r : p),\n null,\n );\n\n // If such a point exists, return it.\n if (result) {\n return [result[0], result[1]];\n }\n\n // If no points exist, recurse.\n return getBreadcrumbPoint(cavern, [minersX, minersY], minersDz, neighborPlan);\n}\n\nfunction placeBreadcrumbVehicle(\n cavern: StrataformedCavern,\n plan: Plan,\n [x, y]: Point,\n vehicles: Vehicle[],\n vehicleFactory: VehicleFactory,\n rng: PseudorandomStream,\n) {\n const tile = cavern.tiles.get(x, y);\n const fluid = tile === Tile.LAVA || tile === Tile.WATER ? tile : null;\n const template = rng.weightedChoice([\n { item: HOVER_SCOUT, bid: fluid ? 0 : 2 },\n { item: SMALL_DIGGER, bid: fluid ? 0 : 0.5 },\n { item: SMALL_TRANSPORT_TRUCK, bid: fluid ? 0 : 0.75 },\n { item: RAPID_RIDER, bid: fluid === Tile.WATER ? 1 : 0 },\n { item: TUNNEL_SCOUT, bid: 0.25 },\n { item: null, bid: 0.0025 },\n ]);\n if (template) {\n vehicles.push(\n vehicleFactory.create({\n ...randomlyInTile({\n x,\n y,\n aimedAt: plan.path.baseplates[0].center,\n rng,\n }),\n template,\n }),\n );\n }\n}\n\nconst pickMinerPoint = (\n plan: Plan,\n {\n tiles,\n discoveryZones,\n }: {\n tiles: Grid;\n discoveryZones: Grid;\n },\n) =>\n pickPoint(plan, (x, y) => {\n const t = tiles.get(x, y);\n return !t?.isWall && !t?.isFluid && !discoveryZones.get(x, y)?.openOnSpawn;\n });\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n prime: ({ cavern, plan }) => {\n const rng = cavern.dice.prime(plan.id);\n const minersCount = rng.betaInt({ a: 1, b: 2, min: 1, max: 5 });\n return { tag: \"lostMiners\", minersCount };\n },\n placeEntities: ({\n cavern,\n plan,\n miners,\n minerFactory,\n vehicles,\n vehicleFactory,\n }) => {\n const rng = cavern.dice.placeEntities(plan.id);\n // Place the lost miners\n const [x, y] =\n pickMinerPoint(plan, cavern) ??\n (() => {\n throw new Error(\"Nowhere to place lost miners\");\n })();\n const dz = cavern.discoveryZones.get(x, y);\n if (!dz) {\n throw new Error(\"Lost Miners point is not discoverable\");\n }\n if (dz.openOnSpawn) {\n throw new Error(\"Lost Miners point is discovered on spawn\");\n }\n for (let i = 0; i < plan.metadata.minersCount; i++) {\n miners.push(minerFactory.create({ ...randomlyInTile({ x, y, rng }) }));\n }\n // Place a breadcrumb vehicle\n const breadcrumbPoint = getBreadcrumbPoint(cavern, [x, y], dz, plan);\n placeBreadcrumbVehicle(\n cavern,\n plan,\n breadcrumbPoint,\n vehicles,\n vehicleFactory,\n rng,\n );\n },\n objectives: ({ cavern }) => {\n const { lostMiners, lostMinerCaves } = countLostMiners(cavern);\n const description =\n lostMiners === 1\n ? \"Find the lost Rock Raider\"\n : lostMinerCaves === 1\n ? \"Find the cave with the lost Rock Radiers\"\n : `Find ${lostMiners} lost Rock Raiders`;\n return {\n variables: [{ condition: `${gLostMiners.done}>0`, description }],\n sufficient: true,\n };\n },\n scriptGlobals({ cavern }) {\n const { lostMinerCaves } = countLostMiners(cavern);\n const message = cavern.lore.foundAllLostMiners(cavern.dice).text;\n return scriptFragment(\n `# Globals: Lost Miners`,\n lostMinerCaves > 1 &&\n `int ${gLostMiners.remainingCaves}=${lostMinerCaves}`,\n `int ${gLostMiners.done}=0`,\n `string ${gLostMiners.messageFoundAll}=\"${escapeString(message)}\"`,\n eventChain(\n gLostMiners.onFoundAll,\n `msg:${gLostMiners.messageFoundAll};`,\n `wait:3;`,\n `${gLostMiners.done}=1;`,\n ),\n );\n },\n script({ cavern, plan }) {\n const lostMinersPoint = transformPoint(\n cavern,\n pickMinerPoint(plan, cavern)!,\n );\n const { lostMinerCaves } = countLostMiners(cavern);\n const v = mkVars(`p${plan.id}LostMiners`, [\n \"messageDiscover\",\n \"onDiscover\",\n \"onIncomplete\",\n ]);\n if (lostMinerCaves === 1) {\n return scriptFragment(\n `# P${plan.id}: Lost Miners in One Cave`,\n `if(change:${lostMinersPoint})[${v.onDiscover}]`,\n eventChain(\n v.onDiscover,\n `pan:${lostMinersPoint};`,\n `${gLostMiners.onFoundAll};`,\n ),\n );\n }\n const rng = cavern.dice.script(plan.id);\n const message = cavern.lore.foundLostMiners(\n rng,\n plan.metadata.minersCount,\n ).text;\n return scriptFragment(\n `# P${plan.id}: Lost Miners in Multiple Caves`,\n `string ${v.messageDiscover}=\"${escapeString(message)}\"`,\n `if(change:${lostMinersPoint})[${v.onDiscover}]`,\n eventChain(\n v.onDiscover,\n `pan:${lostMinersPoint};`,\n `${gLostMiners.remainingCaves}-=1;`,\n `((${gLostMiners.remainingCaves}>0))[${v.onIncomplete}][${gLostMiners.onFoundAll}];`,\n ),\n eventChain(v.onIncomplete, `msg:${v.messageDiscover};`),\n );\n },\n};\n\n// The L.M.S. Explorer's teleporters just seem to be real lousy in ice\n// caverns for some reason.\nconst MULTIPLIERS = { rock: 1.0, ice: 1.4, lava: 0.7 } as const;\n\nconst LOST_MINERS = [\n {\n name: \"Lost Miners\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 2 },\n { of: Rough.ALWAYS_LOOSE_ROCK, grow: 1 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ cavern, hops, plans, plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 2 &&\n plan.pearlRadius < 10 &&\n hops.length > 3 &&\n hops.length <= 8 &&\n isDeadEnd(plan) &&\n plans.reduce(\n (r, p) => (p.metadata?.tag === \"lostMiners\" ? r + 1 : r),\n 0,\n ) < 4 &&\n MULTIPLIERS[cavern.context.biome],\n },\n] as const satisfies readonly Architect[];\nexport default LOST_MINERS;\n","import { Architect } from \"../models/architect\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { intersectsAny, intersectsOnly, isDeadEnd } from \"./utils/intersects\";\nimport { getPlaceRechargeSeams, sprinkleOre } from \"./utils/resources\";\nimport { position, randomlyInTile } from \"../models/position\";\nimport { pickPoint } from \"./utils/placement\";\nimport {\n escapeString,\n eventChain,\n mkVars,\n scriptFragment,\n} from \"./utils/script\";\nimport { SUPPORT_STATION } from \"../models/building\";\nimport { Tile } from \"../models/tiles\";\nimport {\n VehicleTemplate,\n HOVER_SCOUT,\n RAPID_RIDER,\n SMALL_DIGGER,\n SMALL_TRANSPORT_TRUCK,\n SMLC,\n TUNNEL_SCOUT,\n Vehicle,\n} from \"../models/vehicle\";\nimport { Loadout, Miner } from \"../models/miner\";\nimport { filterTruthy, pairEach } from \"../common/utils\";\nimport { plotLine } from \"../common/geometry\";\nimport { gLostHq } from \"./established_hq\";\n\nexport type NomadsMetadata = {\n readonly tag: \"nomads\";\n readonly minersCount: number;\n readonly vehicles: readonly VehicleTemplate[];\n};\n\nconst VEHICLE_BIDS = [\n { item: HOVER_SCOUT, bid: 1 },\n { item: SMALL_DIGGER, bid: 4 },\n { item: SMALL_TRANSPORT_TRUCK, bid: 1 },\n { item: SMLC, bid: 2 },\n { item: TUNNEL_SCOUT, bid: 1 },\n { item: null, bid: 1 },\n] as const;\n\nexport const gNomads = mkVars(\"gNomads\", [\n \"messageBuiltBase\",\n \"onBuiltBase\",\n \"onInit\",\n \"onFoundHq\",\n]);\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n crystalsToPlace: () => 5,\n crystalsFromMetadata: (metadata) =>\n metadata.vehicles.reduce((r, v) => r + v.crystals, 0),\n prime: ({ cavern, plan }) => {\n const rng = cavern.dice.prime(plan.id);\n const minersCount = rng.betaInt({ a: 1, b: 3, min: 1, max: 4 });\n const vehicles = filterTruthy([rng.weightedChoice(VEHICLE_BIDS)]);\n return { tag: \"nomads\", minersCount, vehicles };\n },\n placeRechargeSeam: getPlaceRechargeSeams(1),\n placeBuildings: ({ cavern, plan, tiles, openCaveFlags }) => {\n openCaveFlags.set(\n ...pickPoint(plan, (x, y) => {\n const t = tiles.get(x, y);\n return !!t && !t.isWall;\n })!,\n true,\n );\n // If there is an HQ, ensure it is accessible to the nomads.\n cavern.plans\n .find((p) => p.metadata?.tag === \"hq\")\n ?.hops.forEach((hopId) => {\n pairEach(cavern.plans[hopId].path.baseplates, (a, b) => {\n for (const pos of plotLine(a.center, b.center)) {\n if (tiles.get(...pos) === Tile.HARD_ROCK) {\n tiles.set(...pos, Tile.LOOSE_ROCK);\n }\n }\n });\n });\n },\n placeEntities: ({\n cavern,\n plan,\n miners,\n minerFactory,\n vehicles,\n vehicleFactory,\n setCameraPosition,\n }) => {\n const rng = cavern.dice.placeEntities(plan.id);\n const [x, y] = pickPoint(\n plan,\n (x, y) =>\n !!(\n cavern.discoveryZones.get(x, y)?.openOnSpawn &&\n !cavern.tiles.get(x, y)!.isFluid\n ),\n )!;\n const placedVehicles = plan.metadata.vehicles.map((template) => {\n if (template.kind === \"sea\") {\n const p = pickPoint(\n plan,\n (x, y) =>\n !!(\n cavern.discoveryZones.get(x, y)?.openOnSpawn &&\n cavern.tiles.get(x, y) === Tile.WATER\n ),\n );\n if (!p) {\n throw new Error(`Failed to place sea vehicle in plan ${plan.id}`);\n }\n return vehicleFactory.create({\n ...randomlyInTile({ x: p[0], y: p[1], rng }),\n template,\n });\n }\n return vehicleFactory.create({\n ...randomlyInTile({ x, y, rng }),\n template,\n });\n });\n const placedMiners: Miner[] = [];\n for (let i = 0; i < plan.metadata.minersCount; i++) {\n const driving = placedVehicles[i] as Vehicle | undefined;\n const pos = driving ? position(driving) : randomlyInTile({ x, y, rng });\n const loadout: Loadout[] = filterTruthy([\n \"Drill\",\n (i === 0 || rng.chance(0.25)) && \"JobGeologist\",\n driving?.template.job,\n ]);\n const miner = minerFactory.create({\n ...pos,\n loadout,\n });\n if (placedVehicles[i]) {\n placedVehicles[i] = { ...placedVehicles[i], driverId: miner.id };\n }\n placedMiners.push(miner);\n }\n vehicles.push(...placedVehicles);\n miners.push(...placedMiners);\n setCameraPosition(\n position({\n x: placedMiners[0].x,\n y: placedMiners[0].y,\n aimedAt: plan.path.baseplates[0].center,\n pitch: Math.PI / 4,\n }),\n );\n },\n scriptGlobals({ cavern }) {\n if (cavern.plans.some((plan) => plan.metadata?.tag === \"hq\")) {\n // Has HQ: Disable everything until it's found.\n return scriptFragment(\n \"# Globals: Nomads with Lost HQ\",\n `if(time:0)[${gNomads.onInit}]`,\n eventChain(\n gNomads.onInit,\n \"disable:miners;\",\n \"disable:buildings;\",\n \"disable:vehicles;\",\n ),\n `if(${gLostHq.foundHq}>0)[${gNomads.onFoundHq}]`,\n eventChain(\n gNomads.onFoundHq,\n \"enable:miners;\",\n \"enable:buildings;\",\n \"enable:vehicles;\",\n ),\n );\n }\n\n // Acknowledge the construction of a Support Station.\n const msg = escapeString(cavern.lore.nomadsSettled(cavern.dice).text);\n\n return scriptFragment(\n \"# Globals: Nomads, no HQ\",\n `string ${gNomads.messageBuiltBase}=\"${msg}\"`,\n `if(${SUPPORT_STATION.id}.new)[${gNomads.onBuiltBase}]`,\n eventChain(gNomads.onBuiltBase, `msg:${gNomads.messageBuiltBase};`),\n );\n },\n};\n\nconst NOMAD_SPAWN = [\n {\n name: \"Nomad Spawn\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 2 },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.MIX_FRINGE },\n ),\n crystalsToPlace: ({ plan }) =>\n Math.max(plan.crystalRichness * plan.perimeter, 5),\n ore: ({ plan }) => Math.max(plan.oreRichness * plan.perimeter, 10),\n placeOre: (args) => {\n return sprinkleOre(args, { seamBias: 1 });\n },\n spawnBid: ({ cavern, plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 0 &&\n intersectsOnly(cavern.plans, plan, null) &&\n (isDeadEnd(plan) ? 1 : 0.1),\n },\n {\n name: \"Nomad Spawn Peninsula\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, grow: 2 },\n { of: Rough.BRIDGE_ON_WATER, width: 2, grow: 0.5 },\n { of: Rough.FLOOR },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.MIX_FRINGE },\n ),\n prime: () => ({ tag: \"nomads\", minersCount: 1, vehicles: [RAPID_RIDER] }),\n spawnBid: ({ cavern, plan }) =>\n plan.fluid === Tile.WATER &&\n plan.pearlRadius > 4 &&\n intersectsAny(cavern.plans, plan, null) &&\n 0.5,\n },\n {\n name: \"Nomad Spawn Lava Peninsula\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, grow: 2 },\n { of: Rough.BRIDGE_ON_LAVA, width: 2, grow: 0.5 },\n { of: Rough.FLOOR },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK },\n ),\n prime: () => ({ tag: \"nomads\", minersCount: 1, vehicles: [TUNNEL_SCOUT] }),\n spawnBid: ({ cavern, plan }) =>\n plan.fluid === Tile.LAVA &&\n plan.pearlRadius > 4 &&\n intersectsAny(cavern.plans, plan, null) &&\n 0.5,\n },\n] as const satisfies readonly Architect[];\nexport default NOMAD_SPAWN;\n","import { Architect } from \"../models/architect\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough, weightedSprinkle } from \"./utils/rough\";\nimport { intersectsOnly } from \"./utils/intersects\";\nimport { monsterSpawnScript } from \"./utils/creature_spawners\";\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n monsterSpawnScript: (args) => monsterSpawnScript(args),\n};\n\nconst SIMPLE_CAVE = [\n {\n name: \"Filled Cave\",\n ...BASE,\n ...mkRough(\n { of: Rough.DIRT, width: 0, grow: 0.25 },\n {\n of: weightedSprinkle(\n { item: Rough.DIRT, bid: 0.25 },\n { item: Rough.LOOSE_ROCK, bid: 0.25 },\n { item: Rough.DIRT_OR_LOOSE_ROCK, bid: 0.5 },\n ),\n grow: 1,\n },\n { of: Rough.LOOSE_OR_HARD_ROCK },\n ),\n caveBid: ({ plan }) => !plan.fluid && plan.pearlRadius < 4 && 0.04,\n },\n {\n name: \"Open Cave\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR, grow: 2 },\n { of: Rough.AT_MOST_DIRT, width: 0, grow: 0.5 },\n {\n of: weightedSprinkle(\n { item: Rough.AT_MOST_DIRT, bid: 0.25 },\n { item: Rough.AT_MOST_LOOSE_ROCK, bid: 1 },\n ),\n grow: 1,\n },\n { of: Rough.MIX_FRINGE },\n { of: Rough.VOID, width: 0, grow: 0.5 },\n ),\n caveBid: ({ plans, plan }) =>\n !plan.fluid &&\n plan.pearlRadius < 10 &&\n intersectsOnly(plans, plan, null) &&\n 2,\n },\n {\n name: \"Empty Cave\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR, grow: 2 },\n { of: Rough.DIRT, width: 0, grow: 0.1 },\n {\n of: weightedSprinkle(\n { item: Rough.DIRT, bid: 0.25 },\n { item: Rough.LOOSE_ROCK, bid: 1 },\n ),\n grow: 1,\n },\n { of: Rough.MIX_LOOSE_HARD_ROCK, grow: 0.5 },\n { of: Rough.VOID, width: 0, grow: 0.5 },\n ),\n caveBid: ({ plan }) => !plan.fluid && plan.pearlRadius < 10 && 1,\n },\n {\n name: \"Filled Cave with Paths\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR, width: 0, grow: 0.5 },\n { of: Rough.INVERT_TO_LOOSE_ROCK, grow: 0.5 },\n { of: Rough.INVERT_TO_DIRT, grow: 1 },\n { of: Rough.AT_MOST_LOOSE_ROCK },\n { of: Rough.AT_MOST_HARD_ROCK },\n { of: Rough.VOID, width: 0, grow: 0.5 },\n ),\n caveBid: ({ plans, plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 4 &&\n plan.path.baseplates.length === 1 &&\n plans.some((p) => plan.intersects[p.id] && p.fluid) &&\n 1,\n },\n {\n name: \"Doughnut Cave\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, grow: 0.2 },\n { of: Rough.ALWAYS_HARD_ROCK, grow: 0.3 },\n { of: Rough.LOOSE_ROCK, width: 0, grow: 0.5 },\n { of: Rough.FLOOR, width: 2, grow: 1 },\n { of: Rough.DIRT, width: 0, grow: 0.5 },\n { of: Rough.LOOSE_ROCK },\n { of: Rough.AT_MOST_HARD_ROCK },\n ),\n caveBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 5 && 0.5,\n },\n {\n name: \"Stalagmite Cave\",\n ...BASE,\n ...mkRough(\n {\n of: weightedSprinkle(\n { item: Rough.ALWAYS_DIRT, bid: 0.01 },\n { item: Rough.ALWAYS_LOOSE_ROCK, bid: 0.04 },\n { item: Rough.FLOOR, bid: 1 },\n ),\n width: 4,\n grow: 3,\n },\n { of: Rough.MIX_DIRT_LOOSE_ROCK, grow: 1 },\n { of: Rough.MIX_LOOSE_HARD_ROCK, grow: 0.25 },\n ),\n caveBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 5 && 0.2,\n },\n] as const satisfies readonly Architect[];\nexport default SIMPLE_CAVE;\n","import { Architect } from \"../models/architect\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultHallArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough, weightedSprinkle } from \"./utils/rough\";\nimport { intersectsOnly } from \"./utils/intersects\";\nimport { sprinkleCrystals } from \"./utils/resources\";\nimport { placeSleepingMonsters } from \"./utils/creatures\";\n\nconst BASE: PartialArchitect = {\n ...DefaultHallArchitect,\n};\n\nconst SIMPLE_HALL = [\n {\n name: \"Open Hall\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR, grow: 2 },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 0 && 1,\n },\n {\n name: \"Wide Hall With Monsters\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK },\n { of: Rough.VOID },\n ),\n hallBid: ({ cavern, plan }) =>\n cavern.context.hasMonsters &&\n !plan.fluid &&\n plan.pearlRadius > 3 &&\n plan.path.exclusiveSnakeDistance > 0 &&\n 0.5,\n placeEntities(args) {\n const rng = args.cavern.dice.placeEntities(args.plan.id);\n const count = Math.ceil(args.plan.monsterWaveSize / 2);\n placeSleepingMonsters(args, rng, count);\n },\n },\n {\n name: \"Filled Hall\",\n ...BASE,\n ...mkRough(\n {\n of: weightedSprinkle(\n { item: Rough.FLOOR, bid: 1 },\n { item: Rough.DIRT, bid: 0.4 },\n { item: Rough.LOOSE_ROCK, bid: 0.1 },\n ),\n },\n { of: Rough.MIX_FRINGE },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ plan }) => !plan.fluid && plan.pearlRadius > 0 && 1,\n },\n {\n name: \"River\",\n ...BASE,\n crystalsToPlace: ({ plan }) => 3 * plan.crystalRichness * plan.perimeter,\n ...mkRough(\n { of: Rough.WATER, width: 2, grow: 1 },\n {\n of: weightedSprinkle(\n { item: Rough.AT_MOST_HARD_ROCK, bid: 1 },\n { item: Rough.VOID, bid: 0.5 },\n ),\n },\n { of: Rough.VOID, grow: 1 },\n ),\n placeCrystals(args) {\n sprinkleCrystals(args, {\n seamBias: Math.max(args.cavern.context.hallCrystalSeamBias, 0.75),\n });\n },\n hallBid: ({ plan }) => plan.fluid === Tile.WATER && 1,\n },\n {\n name: \"Stream\",\n ...BASE,\n ...mkRough(\n { of: Rough.WATER, grow: 0.5 },\n { of: Rough.FLOOR, grow: 0.25, shrink: 1 },\n { of: Rough.DIRT_OR_LOOSE_ROCK, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK, shrink: 1 },\n ),\n hallBid: ({ plans, plan }) =>\n plan.fluid === Tile.WATER && intersectsOnly(plans, plan, Tile.WATER) && 1,\n },\n {\n name: \"Lava River\",\n ...BASE,\n ...mkRough(\n { of: Rough.LAVA, width: 2, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK, width: 0, grow: 1 },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ plan }) => plan.fluid === Tile.LAVA && 1,\n },\n {\n name: \"Wide Lava River with Monsters\",\n ...BASE,\n ...mkRough(\n { of: Rough.LAVA, width: 2, grow: 1 },\n { of: Rough.AT_MOST_HARD_ROCK },\n { of: Rough.VOID },\n ),\n hallBid: ({ cavern, plan }) =>\n cavern.context.hasMonsters &&\n cavern.context.biome === \"lava\" &&\n plan.fluid === Tile.LAVA &&\n plan.pearlRadius > 3 &&\n plan.path.exclusiveSnakeDistance > 0 &&\n 1,\n placeEntities(args) {\n const rng = args.cavern.dice.placeEntities(args.plan.id);\n const count = Math.ceil(args.plan.monsterWaveSize / 2);\n placeSleepingMonsters(args, rng, count);\n },\n },\n] as const satisfies readonly Architect[];\nexport default SIMPLE_HALL;\n","import { Architect } from \"../models/architect\";\nimport { TOOL_STORE } from \"../models/building\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { getBuildings } from \"./utils/buildings\";\nimport { intersectsOnly } from \"./utils/intersects\";\nimport { getPlaceRechargeSeams } from \"./utils/resources\";\nimport { position } from \"../models/position\";\nimport { sprinkleSlugHoles } from \"./utils/creatures\";\nimport { slugSpawnScript } from \"./utils/creature_spawners\";\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n crystalsToPlace: () => 5,\n placeRechargeSeam: getPlaceRechargeSeams(1),\n placeBuildings: (args) => {\n const [toolStore] = getBuildings(\n {\n queue: [(pos) => TOOL_STORE.atTile({ ...pos, teleportAtStart: true })],\n },\n args,\n );\n toolStore.foundation.forEach(([x, y]) =>\n args.tiles.set(x, y, Tile.FOUNDATION),\n );\n args.buildings.push(toolStore);\n args.openCaveFlags.set(...toolStore.foundation[0], true);\n args.setCameraPosition(\n position({\n x: toolStore.x,\n y: toolStore.y,\n yaw: toolStore.yaw + Math.PI * 0.75,\n pitch: Math.PI / 4,\n }),\n );\n },\n placeSlugHoles: (args) => {\n const count = args.cavern.context.hasSlugs\n ? args.cavern.dice\n .placeSlugHoles(args.plan.id)\n .betaInt({ a: 1.5, b: 2, min: 1, max: 4 })\n : undefined;\n sprinkleSlugHoles(args, { count });\n },\n slugSpawnScript: (args) =>\n slugSpawnScript(args, {\n initialCooldown: { min: 120, max: 240 },\n needCrystals: { base: 5, increment: 4 },\n spawnRate: 0.2,\n waveSize: 1,\n }),\n maxSlope: 15,\n};\n\nconst OPEN = mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 2 },\n { of: Rough.AT_MOST_LOOSE_ROCK, grow: 1 },\n { of: Rough.MIX_FRINGE },\n);\n\nconst SIMPLE_SPAWN = [\n {\n name: \"Open Spawn\",\n ...BASE,\n ...OPEN,\n spawnBid: ({ cavern, plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 0 &&\n intersectsOnly(cavern.plans, plan, null) &&\n 1,\n },\n {\n name: \"Spawn\",\n ...BASE,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 2 },\n { of: Rough.LOOSE_ROCK, grow: 1 },\n { of: Rough.MIX_FRINGE },\n ),\n spawnBid: ({ cavern, plan }) =>\n !plan.fluid &&\n plan.pearlRadius > 0 &&\n intersectsOnly(cavern.plans, plan, null) &&\n 1,\n },\n {\n // This is mostly a fallback in case there's no other viable spawn cave\n // that isn't entirely surrounded by fluid. 9 crystals should be enough to\n // ensure an escape route.\n name: \"Open Spawn with Bonus Crystals\",\n ...BASE,\n ...OPEN,\n crystalsToPlace: () => 9,\n spawnBid: ({ plan }) => !plan.fluid && plan.pearlRadius >= 2 && 0.01,\n },\n] as const satisfies readonly Architect[];\nexport default SIMPLE_SPAWN;\n","import { Architect, BaseMetadata } from \"../models/architect\";\nimport { Tile } from \"../models/tiles\";\nimport {\n PartialArchitect,\n DefaultCaveArchitect,\n DefaultHallArchitect,\n} from \"./default\";\nimport { slugSpawnScript } from \"./utils/creature_spawners\";\nimport { sprinkleSlugHoles } from \"./utils/creatures\";\nimport { intersectsOnly } from \"./utils/intersects\";\nimport { mkRough, Rough, weightedSprinkle } from \"./utils/rough\";\nimport { getTotalCrystals, sprinkleCrystals } from \"./utils/resources\";\nimport { getDiscoveryPoint } from \"./utils/discovery\";\nimport {\n escapeString,\n eventChain,\n mkVars,\n scriptFragment,\n transformPoint,\n} from \"./utils/script\";\n\nconst getSlugHoles = (args: Parameters[\"slugSpawnScript\"]>[0]) =>\n args.plan.innerPearl.flatMap((layer) =>\n layer.filter((pos) => args.cavern.tiles.get(...pos) === Tile.SLUG_HOLE),\n );\n\nconst SLUG_NEST_METADATA = {\n tag: \"slugNest\",\n} as const satisfies BaseMetadata;\n\nconst SLUG_NEST: PartialArchitect = {\n ...DefaultCaveArchitect,\n prime: () => SLUG_NEST_METADATA,\n placeCrystals(args) {\n sprinkleCrystals(args, {\n seamBias: Math.max(args.cavern.context.caveCrystalSeamBias, 0.5),\n });\n },\n placeSlugHoles(args) {\n const count = args.cavern.dice\n .placeSlugHoles(args.plan.id)\n .betaInt({ a: 2, b: 2, min: 4, max: 8 });\n sprinkleSlugHoles(args, { count });\n },\n slugSpawnScript: (args) => {\n const holeCount = getSlugHoles(args).length;\n return slugSpawnScript(args, {\n initialCooldown: { min: 20, max: 60 },\n maxTriggerCount: 1,\n needCrystals: { base: Math.floor(getTotalCrystals(args.cavern) / 10) },\n triggerOnFirstArmed: true,\n waveSize: holeCount,\n });\n },\n script: ({ cavern, plan }) => {\n const discoPoint = getDiscoveryPoint(cavern, plan);\n if (!discoPoint) {\n return undefined;\n }\n\n const v = mkVars(`p${plan.id}SgNest`, [\"messageDiscover\", \"onDiscover\"]);\n const message = cavern.lore.generateFoundSlugNest(cavern.dice).text;\n\n return scriptFragment(\n `# P${plan.id}: Slug Nest`,\n `string ${v.messageDiscover}=\"${escapeString(message)}\"`,\n `if(change:${transformPoint(cavern, discoPoint)})[${v.onDiscover}]`,\n eventChain(\n v.onDiscover,\n `msg:${v.messageDiscover};`,\n `pan:${transformPoint(cavern, discoPoint)};`,\n ),\n );\n },\n};\n\nconst SLUG_HALL: PartialArchitect = {\n ...DefaultHallArchitect,\n crystalsToPlace: ({ plan }) =>\n Math.max(plan.crystalRichness * plan.perimeter, 5),\n placeCrystals(args) {\n sprinkleCrystals(args, {\n seamBias: Math.max(args.cavern.context.hallCrystalSeamBias, 0.75),\n });\n },\n placeSlugHoles(args) {\n const count = args.cavern.dice\n .placeSlugHoles(args.plan.id)\n .betaInt({ a: 2, b: 2, min: 1, max: 3 });\n const placements = args.plan.innerPearl.flatMap((layer) =>\n layer.filter(\n (pos) =>\n args.tiles.get(...pos) === Tile.FLOOR &&\n !args.cavern.pearlInnerDex\n .get(...pos)\n ?.some((_, i) => i !== args.plan.id),\n ),\n );\n sprinkleSlugHoles(args, { count, placements });\n },\n slugSpawnScript: (args) => {\n const holes = getSlugHoles(args);\n return slugSpawnScript(args, {\n emerges: holes.map(([x, y]) => ({ x, y, radius: 1 })),\n initialCooldown: { min: 60, max: 120 },\n needCrystals: {\n base: args.plan.crystals * 2,\n increment: args.plan.crystals,\n },\n triggerPoints: holes,\n waveSize: holes.length,\n });\n },\n};\n\nconst SLUGS = [\n {\n name: \"Slug Nest\",\n ...SLUG_NEST,\n ...mkRough(\n { of: Rough.FLOOR, width: 3, grow: 1 },\n { of: Rough.AT_MOST_DIRT, width: 0, grow: 0.5 },\n {\n of: weightedSprinkle(\n { item: Rough.DIRT, bid: 0.25 },\n { item: Rough.LOOSE_ROCK, bid: 1 },\n ),\n grow: 1,\n },\n { of: Rough.MIX_LOOSE_HARD_ROCK, grow: 0.25 },\n ),\n caveBid: ({ cavern, plans, plan }) =>\n cavern.context.hasSlugs &&\n plan.pearlRadius >= 5 &&\n plan.path.baseplates.length === 1 &&\n !plan.fluid &&\n !plan.hasErosion &&\n intersectsOnly(plans, plan, null) &&\n !plans.some((p) => p.metadata?.tag === \"slugNest\") &&\n 0.25,\n },\n {\n name: \"Slug Hall\",\n ...SLUG_HALL,\n ...mkRough(\n { of: Rough.FLOOR },\n {\n of: weightedSprinkle(\n { item: Rough.LOOSE_OR_HARD_ROCK, bid: 1 },\n { item: Rough.HARD_ROCK, bid: 2 },\n ),\n },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ cavern, plan }) =>\n cavern.context.hasSlugs &&\n plan.path.exclusiveSnakeDistance > 5 &&\n !plan.fluid &&\n !plan.hasErosion &&\n 1,\n },\n] as const satisfies readonly Architect[];\nexport default SLUGS;\n","import { Architect } from \"../models/architect\";\nimport {\n POWER_STATION,\n SUPER_TELEPORT,\n SUPPORT_STATION,\n} from \"../models/building\";\nimport { DefaultHallArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough, weightedSprinkle } from \"./utils/rough\";\n\nconst BASE: PartialArchitect = {\n ...DefaultHallArchitect,\n};\n\nconst HARD_ROCK_MIN_CRYSTALS =\n POWER_STATION.crystals +\n SUPPORT_STATION.crystals +\n 1 +\n SUPER_TELEPORT.crystals +\n 1 +\n 5;\n\nconst THIN_HALL = [\n {\n name: \"Thin Open Hall\",\n ...BASE,\n ...mkRough(\n { of: Rough.FLOOR },\n {\n of: weightedSprinkle(\n { item: Rough.AT_MOST_HARD_ROCK, bid: 1 },\n { item: Rough.VOID, bid: 10 },\n ),\n },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ plan }) => !plan.fluid && 0.2,\n },\n {\n name: \"Thin Filled Hall\",\n ...BASE,\n ...mkRough(\n {\n of: weightedSprinkle(\n { item: Rough.FLOOR, bid: 1 },\n { item: Rough.LOOSE_ROCK, bid: 0.5 },\n ),\n },\n { of: Rough.VOID, grow: 1 },\n ),\n hallBid: ({ plan }) => !plan.fluid && 0.1,\n },\n {\n name: \"Thin Hard Rock Hall\",\n ...BASE,\n ...mkRough({ of: Rough.HARD_ROCK }, { of: Rough.VOID, grow: 1 }),\n hallBid: ({ plan, totalCrystals }) =>\n !plan.fluid &&\n totalCrystals >= HARD_ROCK_MIN_CRYSTALS &&\n plan.path.exclusiveSnakeDistance < 10 &&\n 0.7,\n },\n] as const satisfies readonly Architect[];\nexport default THIN_HALL;\n","import { Architect, BaseMetadata } from \"../models/architect\";\nimport { Tile } from \"../models/tiles\";\nimport { DefaultCaveArchitect, PartialArchitect } from \"./default\";\nimport { mkRough, Rough } from \"./utils/rough\";\nimport { intersectsOnly, isDeadEnd } from \"./utils/intersects\";\nimport {\n eventChain,\n mkVars,\n scriptFragment,\n transformPoint,\n} from \"./utils/script\";\nimport { monsterSpawnScript } from \"./utils/creature_spawners\";\nimport { bidsForOrdinaryWalls, sprinkleCrystals } from \"./utils/resources\";\nimport { placeSleepingMonsters } from \"./utils/creatures\";\nimport { gLostMiners } from \"./lost_miners\";\n\nconst METADATA = {\n tag: \"treasure\",\n} as const satisfies BaseMetadata;\n\nconst BASE: PartialArchitect = {\n ...DefaultCaveArchitect,\n prime: () => METADATA,\n objectives: ({ cavern }) => {\n const crystals = cavern.plans\n .filter((plan) => plan.metadata?.tag === \"treasure\")\n .reduce((r, plan) => Math.max(r, plan.crystals), 0);\n if (crystals < 15) {\n return undefined;\n }\n return { crystals: Math.floor(crystals / 5) * 5, sufficient: false };\n },\n};\n\nconst g = mkVars(\"gHoard\", [\"wasTriggered\", \"message\", \"crystalsAvailable\"]);\n\nconst HOARD: typeof BASE = {\n ...BASE,\n crystalsToPlace: ({ plan }) => plan.crystalRichness * plan.perimeter * 3,\n placeCrystals(args) {\n const wallBids = bidsForOrdinaryWalls(\n args.plan.innerPearl.flatMap((layer) => layer),\n args.tiles,\n );\n const centerPoints =\n args.plan.innerPearl[0].length > 1\n ? args.plan.innerPearl[0]\n : [...args.plan.innerPearl[0], ...args.plan.innerPearl[1]];\n const bids = [\n ...wallBids.map((item) => ({ bid: 1 / wallBids.length, item })),\n ...centerPoints.map((item) => ({ bid: 3 / centerPoints.length, item })),\n ];\n const rng = args.cavern.dice.placeCrystals(args.plan.id);\n sprinkleCrystals(args, {\n getRandomTile: () => rng.weightedChoice(bids),\n seamBias: 0,\n });\n },\n placeSlugHoles() {},\n placeEntities(args) {\n if (args.plan.pearlRadius > 3) {\n const rng = args.cavern.dice.placeEntities(args.plan.id);\n const count = Math.ceil(args.plan.monsterWaveSize / 2);\n placeSleepingMonsters(args, rng, count);\n }\n },\n monsterSpawnScript: (args) =>\n monsterSpawnScript(args, {\n meanWaveSize: args.plan.monsterWaveSize * 1.5,\n retriggerMode: \"hoard\",\n rng: args.cavern.dice.monsterSpawnScript(args.plan.id),\n spawnRate: args.plan.monsterSpawnRate * 3.5,\n }),\n scriptGlobals({ cavern }) {\n if (!cavern.objectives.crystals) {\n return undefined;\n }\n return scriptFragment(\n \"# Globals: Hoard\",\n `bool ${g.wasTriggered}=false`,\n `string ${g.message}=\"${cavern.lore.foundHoard(cavern.dice).text}\"`,\n `int ${g.crystalsAvailable}=0`,\n );\n },\n script({ cavern, plan }) {\n if (!cavern.objectives.crystals) {\n return undefined;\n }\n const hasLostMiners = cavern.plans.some(\n (p) => p.metadata?.tag === \"lostMiners\",\n );\n\n // Generate a script that pans to this cave on discovery if collecting all\n // of the crystals would win the level.\n const centerPoint = transformPoint(cavern, plan.innerPearl[0][0]);\n const v = mkVars(`p${plan.id}Hoard`, [\"onDiscovered\", \"go\"]);\n\n return scriptFragment(\n `# P${plan.id}: Hoard`,\n `if(change:${centerPoint})[${v.onDiscovered}]`,\n eventChain(\n v.onDiscovered,\n `((${g.wasTriggered}))return;`,\n `${g.wasTriggered}=true;`,\n `wait:1;`,\n `${g.wasTriggered}=false;`,\n // If there's a lost miners objective that isn't fulfilled, don't\n // act like the level is done.\n hasLostMiners && `((${gLostMiners.done}<1))return;`,\n // Count all the crystals in storage and on the floor.\n `${g.crystalsAvailable}=crystals+Crystal_C;`,\n // If this is enough to win the level, alert the player.\n `((${g.crystalsAvailable}>=${cavern.objectives.crystals}))${v.go};`,\n ),\n eventChain(v.go, `msg:${g.message};`, `pan:${centerPoint};`),\n );\n },\n};\n\nconst RICH: typeof BASE = {\n ...BASE,\n monsterSpawnScript: (args) =>\n monsterSpawnScript(args, {\n meanWaveSize: args.plan.monsterWaveSize * 1.5,\n spawnRate: args.plan.monsterSpawnRate * 2,\n }),\n};\n\nconst TREASURE = [\n {\n name: \"Open Hoard\",\n ...HOARD,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 3 },\n { of: Rough.LOOSE_ROCK, shrink: 1 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plans, plan }) =>\n !plan.fluid &&\n plan.path.baseplates.length === 1 &&\n isDeadEnd(plan) &&\n intersectsOnly(plans, plan, null) &&\n 0.5,\n },\n {\n name: \"Sealed Hoard\",\n ...HOARD,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 1, grow: 3 },\n { of: Rough.ALWAYS_LOOSE_ROCK },\n { of: Rough.ALWAYS_HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plan }) =>\n !plan.fluid &&\n plan.path.baseplates.length === 1 &&\n isDeadEnd(plan) &&\n 0.5,\n },\n {\n name: \"Open Rich Cave\",\n ...RICH,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 1 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.5 },\n { of: Rough.LOOSE_ROCK, grow: 2 },\n { of: Rough.FLOOR, width: 2, shrink: 1, grow: 3 },\n { of: Rough.LOOSE_ROCK, shrink: 1 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plan }) =>\n !plan.fluid && plan.path.baseplates.length >= 1 && isDeadEnd(plan) && 1,\n },\n {\n name: \"Rich Island\",\n ...RICH,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 1 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.5 },\n { of: Rough.ALWAYS_LOOSE_ROCK, grow: 2 },\n { of: Rough.WATER, width: 2, grow: 3 },\n { of: Rough.LOOSE_ROCK, shrink: 1 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.WATER &&\n plan.pearlRadius > 3 &&\n plan.path.baseplates.length >= 1 &&\n isDeadEnd(plan) &&\n 0.5,\n placeEntities(args) {\n const rng = args.cavern.dice.placeEntities(args.plan.id);\n if (args.cavern.context.biome === \"ice\" && rng.chance(0.5)) {\n const count = Math.ceil(args.plan.monsterWaveSize / 2);\n placeSleepingMonsters(args, rng, count, \"inner\");\n }\n },\n },\n {\n name: \"Peninsula Hoard\",\n ...HOARD,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 1 },\n { of: Rough.BRIDGE_ON_WATER, width: 2, grow: 3 },\n { of: Rough.LOOSE_ROCK, shrink: 1 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plans, plan }) =>\n plan.fluid === Tile.WATER &&\n plan.pearlRadius > 3 &&\n plan.path.baseplates.length >= 1 &&\n isDeadEnd(plan) &&\n intersectsOnly(plans, plan, null) &&\n 0.5,\n },\n {\n name: \"Rich Lava Island\",\n ...RICH,\n ...mkRough(\n { of: Rough.ALWAYS_SOLID_ROCK, width: 0, grow: 1 },\n { of: Rough.ALWAYS_HARD_ROCK, width: 0, grow: 0.5 },\n { of: Rough.ALWAYS_LOOSE_ROCK, grow: 2 },\n { of: Rough.LAVA, width: 2, grow: 3 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plan }) =>\n plan.fluid === Tile.LAVA &&\n plan.pearlRadius > 3 &&\n plan.path.baseplates.length >= 1 &&\n isDeadEnd(plan) &&\n 0.5,\n },\n {\n name: \"Lava Peninsula Hoard\",\n ...HOARD,\n ...mkRough(\n { of: Rough.ALWAYS_FLOOR, width: 2, grow: 1 },\n { of: Rough.BRIDGE_ON_LAVA, width: 2, grow: 3 },\n { of: Rough.HARD_ROCK, grow: 0.5 },\n ),\n caveBid: ({ plans, plan }) =>\n plan.fluid === Tile.LAVA &&\n plan.pearlRadius > 3 &&\n plan.path.baseplates.length >= 1 &&\n isDeadEnd(plan) &&\n intersectsOnly(plans, plan, null) &&\n 0.5,\n },\n] as const satisfies readonly Architect[];\nexport default TREASURE;\n","import { Architect } from \"../models/architect\";\nimport ESTABLISHED_HQ, { HqMetadata } from \"./established_hq\";\nimport FISSURE from \"./fissure\";\nimport FLOODED from \"./flooded\";\nimport LOOPBACK from \"./loopback\";\nimport LOST_MINERS, { LostMinersMetadata } from \"./lost_miners\";\nimport NOMAD_SPAWN, { NomadsMetadata } from \"./nomads\";\nimport SIMPLE_CAVE from \"./simple_cave\";\nimport SIMPLE_HALL from \"./simple_hall\";\nimport SIMPLE_SPAWN from \"./simple_spawn\";\nimport SLUGS from \"./slugs\";\nimport THIN_HALL from \"./thin_hall\";\nimport TREASURE from \"./treasure\";\n\nexport type AnyMetadata =\n | undefined\n | HqMetadata\n | LostMinersMetadata\n | NomadsMetadata\n | { tag: \"fissure\" | \"slugNest\" | \"treasure\" };\n\nexport const ARCHITECTS = [\n ...ESTABLISHED_HQ,\n ...FISSURE,\n ...FLOODED,\n ...LOOPBACK,\n ...LOST_MINERS,\n ...NOMAD_SPAWN,\n ...SIMPLE_CAVE,\n ...SIMPLE_HALL,\n ...SIMPLE_SPAWN,\n ...SLUGS,\n ...THIN_HALL,\n ...TREASURE,\n] as const satisfies readonly Architect[];\n","import { UpdateData } from \"./controls\";\nimport { ARCHITECTS } from \"../../../core/architects\";\nimport styles from \"./style.module.scss\";\nimport React from \"react\";\n\nexport const ArchitectsInput = ({ update, context }: UpdateData) => {\n function updateArchitects(\n key: string,\n value: \"encourage\" | \"disable\" | undefined,\n ) {\n const r = { ...context.architects };\n if (value === undefined) {\n if (key in r) {\n delete r[key];\n }\n if (Object.keys(r).length === 0) {\n update({ architects: undefined });\n return;\n }\n } else {\n if (r[key] !== value) {\n r[key] = value;\n }\n }\n update({ architects: r });\n }\n\n return [...ARCHITECTS]\n .sort((a, b) => a.name.localeCompare(b.name))\n .map((a) => {\n const state = context.architects?.[a.name];\n return (\n \n

{a.name}

\n
\n \n updateArchitects(\n a.name,\n state === \"encourage\" ? undefined : \"encourage\",\n )\n }\n >\n Encourage\n \n \n updateArchitects(\n a.name,\n state === \"disable\" ? undefined : \"disable\",\n )\n }\n >\n Disable\n \n
\n \n );\n });\n};\n","import React, { useEffect, useReducer, useState } from \"react\";\nimport { CavernContext, inferContextDefaults } from \"../../../core/common\";\nimport { MAX_PLUS_ONE } from \"../../../core/common/prng\";\nimport styles from \"./style.module.scss\";\nimport { Choice, CurveSliders, Slider } from \"./controls\";\nimport { ArchitectsInput } from \"./architects\";\n\nconst INITIAL_SEED = Date.now() % MAX_PLUS_ONE;\n\nfunction parseSeed(v: string) {\n const s = v.replace(/[^0-9a-fA-F]+/g, \"\");\n const seed = s === \"\" ? -1 : parseInt(s, 16);\n return seed >= 0 && seed < MAX_PLUS_ONE ? seed : undefined;\n}\n\nfunction unparseSeed(v: number, split: boolean) {\n const s = v.toString(16).padStart(8, \"0\").toUpperCase();\n return split\n ? `${s.substring(0, 3)} ${s.substring(3, 6)} ${s.substring(6)}`\n : s;\n}\n\nconst expectedTotalPlans = (contextWithDefaults: CavernContext) => {\n const caves = contextWithDefaults.caveCount;\n const spanHalls = contextWithDefaults.caveCount - 1;\n const auxHalls =\n contextWithDefaults.optimalAuxiliaryPathCount +\n contextWithDefaults.randomAuxiliaryPathCount;\n return caves + spanHalls + auxHalls;\n};\n\ntype PartialContext = Partial & Pick;\n\nexport function CavernContextInput({\n dispatchState,\n}: {\n dispatchState: (args: { context: CavernContext }) => void;\n}) {\n const [showAdvanced, setShowAdvanced] = useState(false);\n const [context, update] = useReducer(\n (\n was: PartialContext,\n args:\n | { [K in keyof CavernContext]?: CavernContext[K] | undefined }\n | \"reset\",\n ): PartialContext => {\n if (args === \"reset\") {\n return { seed: was.seed };\n }\n const r = { ...was, ...args };\n for (const key of Object.keys(r) as (keyof typeof r)[]) {\n if (r[key] === undefined) {\n if (key in r) {\n delete r[key];\n }\n }\n }\n return r;\n },\n { seed: parseSeed(window.location.hash) ?? INITIAL_SEED },\n );\n\n useEffect(() => {\n const fn = () => {\n const seed = parseSeed(window.location.hash);\n if (seed !== undefined) {\n update({ seed: seed });\n }\n };\n window.addEventListener(\"hashchange\", fn);\n return () => {\n window.removeEventListener(\"hashchange\", fn);\n };\n }, []);\n\n useEffect(() => {\n window.location.hash = unparseSeed(context.seed, false);\n }, [context.seed]);\n\n useEffect(\n () => dispatchState({ context: inferContextDefaults(context) }),\n [context, dispatchState],\n );\n const contextWithDefaults = inferContextDefaults(context);\n const rest = { update, context, contextWithDefaults };\n\n return (\n
\n
\n {\n const seed = parseSeed(ev.target.value);\n if (seed !== undefined) {\n update({ seed: seed });\n }\n }}\n spellCheck={false}\n />\n \n update({ seed: Math.floor(Math.random() * MAX_PLUS_ONE) })\n }\n >\n ifl\n \n
\n
\n 1 && !showAdvanced ? styles.override : \"\"}`}\n onClick={() => setShowAdvanced((v) => !v)}\n >\n Advanced\n \n {showAdvanced ? \"expand_less\" : \"expand_more\"}\n \n \n
\n {showAdvanced && (\n <>\n
\n
\n
\n {contextWithDefaults.overrides.length ? (\n update(\"reset\")}\n >\n Clear All Overrides\n \n ) : (\n
\n )}\n
\n \n \n \n \n
\n
\n
\n

Outlines

\n
\n

Partition

\n \n \n \n
\n
\n

Discriminate

\n \n
\n
\n

Weave

\n \n \n \n
\n
\n
\n

Planning

\n
\n

Flood

\n \n \n \n \n \n
\n
\n

Establish

\n {(\n [\n \"caveCrystalRichness\",\n \"hallCrystalRichness\",\n \"caveOreRichness\",\n \"hallOreRichness\",\n \"monsterSpawnRate\",\n ] as const\n ).map((of) => (\n \n ))}\n \n \n
\n
\n

Pearl

\n \n \n
\n
\n
\n

Masonry

\n
\n

Fine

\n {(\n [\n \"caveHasRechargeSeamChance\",\n \"hallHasRechargeSeamChance\",\n \"caveCrystalSeamBias\",\n \"hallCrystalSeamBias\",\n \"caveOreSeamBias\",\n \"hallOreSeamBias\",\n \"caveHasSlugHoleChance\",\n \"hallHasSlugHoleChance\",\n ] as const\n ).map((of) => (\n \n ))}\n
\n
\n
\n

Plastic

\n
\n

Strataform

\n \n \n
\n
\n

Strataflux

\n \n {(\n [\n \"caveMaxSlope\",\n \"hallMaxSlope\",\n \"voidMaxSlope\",\n \"borderMaxSlope\",\n ] as const\n ).map((of) => (\n \n ))}\n
\n
\n

Populate

\n {(\n [\"caveHasLandslidesChance\", \"hallHasLandslidesChance\"] as const\n ).map((of) => (\n \n ))}\n
\n
\n
\n

Ephemera

\n
\n

Aerate

\n \n
\n
\n

Adjure

\n \n
\n
\n \n )}\n
\n );\n}\n","// extracted by mini-css-extract-plugin\nexport default {\"cavernPreview\":\"style_cavernPreview__xf6rH\",\"mapWrapper\":\"style_mapWrapper__l0TEe\",\"map\":\"style_map__o4nZU\",\"void\":\"style_void__RvJKA\",\"baseplate\":\"style_baseplate__p03X2\",\"fg\":\"style_fg__nlyiJ\",\"ambiguousKind\":\"style_ambiguousKind__Pm08h\",\"bg\":\"style_bg__N5lpK\",\"caveKind\":\"style_caveKind__x9Yy5\",\"hallKind\":\"style_hallKind__H+yre\",\"path\":\"style_path__HXk6H\",\"spanningKind\":\"style_spanningKind__cv5st\",\"auxiliaryKind\":\"style_auxiliaryKind__FSAib\",\"plan\":\"style_plan__QISwv\",\"spanningPathKind\":\"style_spanningPathKind__dvMVJ\",\"auxiliaryPathKind\":\"style_auxiliaryPathKind__rGxFg\",\"fluid6\":\"style_fluid6__Oqtv2\",\"fluid11\":\"style_fluid11__7ylOY\",\"left\":\"style_left__Yyqc4\",\"label\":\"style_label__vGz9Y\",\"inline\":\"style_inline__9fTzz\",\"pointer\":\"style_pointer__-G8l+\",\"pearl\":\"style_pearl__std+C\",\"innerPearl\":\"style_innerPearl__APwPv\",\"outerPearl\":\"style_outerPearl__MxT-o\",\"layer\":\"style_layer__Gfelc\",\"layer0\":\"style_layer0__tooG-\",\"layer1\":\"style_layer1__XpKZy\",\"layer2\":\"style_layer2__2BD4B\",\"layer3\":\"style_layer3__3Kn4w\",\"tiles\":\"style_tiles__iaD7a\",\"tile\":\"style_tile__mcUC8\",\"height\":\"style_height__e764C\",\"entity\":\"style_entity__p+Wtq\",\"enemy\":\"style_enemy__z8gSd\",\"marker\":\"style_marker__n7Zau\",\"openCaveFlag\":\"style_openCaveFlag__kH4fE\",\"stats\":\"style_stats__bR5t1\",\"error\":\"style_error__Oe9Pd\"};","import React from \"react\";\nimport { Baseplate } from \"../../../core/models/baseplate\";\nimport styles from \"./style.module.scss\";\n\nconst SCALE = 6;\n\nexport default function BaseplatePreview({\n baseplate,\n}: {\n baseplate: Baseplate;\n}) {\n return (\n \n \n \n {baseplate.id}\n \n \n );\n}\n","import React from \"react\";\nimport { Path } from \"../../../core/models/path\";\nimport styles from \"./style.module.scss\";\n\nconst SCALE = 6;\n\nexport default function PathPreview({ path }: { path: Path }) {\n const d = path.baseplates\n .map((bp, i) => {\n const [x, y] = bp.center;\n return `${i === 0 ? \"M\" : \"L\"}${x * SCALE} ${y * SCALE}`;\n })\n .join(\" \");\n return (\n \n \n \n \n {path.id}\n \n \n \n );\n}\n","import React from \"react\";\nimport { Point, isAdjacent8 } from \"../../../core/common/geometry\";\nimport { pairMap } from \"../../../core/common/utils\";\nimport { PearledPlan } from \"../../../core/transformers/01_planning/04_pearl\";\nimport styles from \"./style.module.scss\";\n\nconst SCALE = 6;\n\nfunction dPearl(layer: readonly Point[]) {\n if (layer.length === 0) {\n return \"\";\n }\n const result = pairMap(layer, ([x1, y1], [x2, y2]) => {\n const cmd = isAdjacent8([x1, y1], [x2, y2]) ? \"L\" : \"M\";\n return `${cmd}${(x2 + 0.5) * SCALE} ${(y2 + 0.5) * SCALE}`;\n });\n const [x0, y0] = layer[0];\n return `M${(x0 + 0.5) * SCALE} ${(y0 + 0.5) * SCALE} ${result.join(\" \")}`;\n}\n\nexport default function PearlPreview({\n plan,\n pearl,\n}: {\n plan: PearledPlan;\n pearl: \"innerPearl\" | \"outerPearl\";\n}) {\n const io = pearl === \"outerPearl\" ? plan.innerPearl.length : 0;\n return (\n \n {plan[pearl].map((layer, i) => (\n \n ))}\n \n );\n}\n","import React, { ReactNode } from \"react\";\nimport { Tile } from \"../../../core/models/tiles\";\nimport { Cavern } from \"../../../core/models/cavern\";\nimport { MapOverlay } from \".\";\nimport styles from \"./style.module.scss\";\n\nconst SCALE = 6;\n\nconst SCALE_COLORS = 8;\n\nconst MAX_COOLDOWN = {\n landslides: 300,\n erosion: 100,\n} as const;\n\nfunction tk(t: Tile) {\n return `tile${t.id}`;\n}\n\nfunction dk(t: Tile) {\n if (t === Tile.WATER || t === Tile.LAVA) {\n return \"dfluid\";\n }\n return t.isWall ? \"dwall\" : \"dfloor\";\n}\n\nfunction sk(s: number) {\n return `scale${Math.min(Math.floor(s), SCALE_COLORS - 1)}`;\n}\n\nfunction getFill(\n cavern: Cavern,\n mapOverlay: MapOverlay,\n t: Tile,\n x: number,\n y: number,\n): string | null {\n switch (mapOverlay) {\n case \"overview\": {\n for (let ox = -1; ox <= 1; ox++) {\n for (let oy = -1; oy <= 1; oy++) {\n if (cavern.discoveryZones?.get(x + ox, y + oy)?.openOnSpawn) {\n return tk(t);\n }\n }\n }\n return null;\n }\n case \"entities\":\n if (t === Tile.FOUNDATION || t === Tile.POWER_PATH) {\n return tk(t);\n }\n return dk(t);\n case \"tiles\":\n return tk(t);\n case \"crystals\": {\n if (t.crystalYield > 0) {\n return tk(t);\n }\n const c = cavern.crystals?.get(x, y) ?? 0;\n if (c > 0) {\n return sk(c - 1);\n }\n return dk(t);\n }\n case \"ore\": {\n if (t.oreYield > 4) {\n return tk(t);\n }\n const o = (cavern.ore?.get(x, y) ?? 0) + t.oreYield;\n if (o > 0) {\n return sk(o - 1);\n }\n return dk(t);\n }\n case \"discovery\": {\n const dz = cavern.discoveryZones?.get(x, y);\n if (dz) {\n return dz.openOnSpawn ? \"disco0\" : \"disco1\";\n }\n return dk(t);\n }\n case \"erosion\":\n if (t === Tile.WATER || t === Tile.LAVA) {\n return tk(t);\n }\n // Fall through\n case \"landslides\":\n const cooldown = cavern[mapOverlay]?.get(x, y)?.cooldown;\n if (cooldown) {\n return sk(\n (SCALE_COLORS - 1) *\n Math.max(0, 1 - cooldown / MAX_COOLDOWN[mapOverlay]),\n );\n }\n return dk(t);\n case \"oxygen\": {\n const aeration = cavern.aerationLog?.get(x, y);\n if (!aeration) {\n return dk(t);\n }\n if (cavern.crystals?.get(x, y)) {\n return \"oxhc\";\n }\n return t.isWall ? tk(t) : \"oxex\";\n }\n case \"script\":\n return dk(t);\n }\n return null;\n}\n\nfunction getTitle(\n cavern: Cavern,\n mapOverlay: MapOverlay,\n t: Tile,\n x: number,\n y: number,\n): ReactNode {\n switch (mapOverlay) {\n case \"crystals\": {\n const c = cavern.crystals?.get(x, y) ?? 0;\n const d = t.crystalYield;\n return (\n c + d > 0 &&\n `${t.isWall ? \"Yields \" : \"\"}${c}${d > 0 ? ` + ${d} from ${t.name}` : \"\"}`\n );\n }\n case \"ore\": {\n const o = cavern.ore?.get(x, y) ?? 0;\n const d = t.oreYield;\n return (\n o + d > 0 &&\n `${t.isWall ? \"Yields \" : \"\"}${o}${d > 0 ? ` + ${d} from ${t.name}` : \"\"}`\n );\n }\n case \"landslides\": {\n const ls = cavern.landslides?.get(x, y);\n return ls && `${ls.cooldown} sec cooldown`;\n }\n case \"erosion\": {\n const er = cavern.erosion?.get(x, y);\n return (\n er &&\n `${er.cooldown} sec cooldown + ${er.initialDelay} sec initial delay`\n );\n }\n case \"discovery\":\n const dz = cavern.discoveryZones?.get(x, y);\n return (\n dz && `${dz.openOnSpawn ? \"Cavern\" : \"Undiscovered cavern\"} ${dz.id}`\n );\n case \"overview\":\n case \"tiles\":\n return t.name;\n default:\n return null;\n }\n}\n\nexport default function TilesPreview({\n cavern,\n mapOverlay,\n}: {\n cavern: Cavern;\n mapOverlay: MapOverlay;\n}) {\n if (!cavern.tiles || !mapOverlay) {\n return null;\n }\n return (\n \n {cavern.tiles.map((t, x, y) => {\n const fill = getFill(cavern, mapOverlay, t, x, y);\n if (!fill) {\n return null;\n }\n const title = getTitle(cavern, mapOverlay, t, x, y);\n return (\n \n {title && {title}}\n \n );\n })}\n \n );\n}\n","import React, { useMemo } from \"react\";\nimport {\n Building,\n CANTEEN,\n DOCKS,\n GEOLOGICAL_CENTER,\n MINING_LASER,\n ORE_REFINERY,\n POWER_STATION,\n SUPER_TELEPORT,\n} from \"../../../core/models/building\";\nimport { Creature } from \"../../../core/models/creature\";\nimport { Miner } from \"../../../core/models/miner\";\nimport { radsToDegrees } from \"../../../core/common/geometry\";\nimport styles from \"./style.module.scss\";\nimport { Vehicle } from \"../../../core/models/vehicle\";\nimport { MapOverlay } from \".\";\nimport { Cavern } from \"../../../core/models/cavern\";\nimport { CollapseUnion, filterTruthy } from \"../../../core/common/utils\";\n\nconst SCALE = 6;\n\ntype Params = {\n entity: CollapseUnion;\n mapOverlay: MapOverlay;\n cavern: Cavern;\n};\n\nfunction getMarkerD(\n template:\n | CollapseUnion<\n Building[\"template\"] | Creature[\"template\"] | Vehicle[\"template\"]\n >\n | undefined,\n) {\n const building = !!template?.footprint;\n const vehicle = !!template?.frame;\n const hasText = building || vehicle;\n\n const oy = building ? SCALE / 3 : SCALE / 4;\n const top = template === SUPER_TELEPORT ? -oy - SCALE : -oy;\n const bottom = template === POWER_STATION ? oy + SCALE : oy;\n\n const ox = vehicle ? SCALE / 2 : oy;\n const left = template === ORE_REFINERY ? -ox - SCALE : -ox;\n const right = template === GEOLOGICAL_CENTER ? ox + SCALE : ox;\n\n return filterTruthy([\n `M${left} ${top}`,\n hasText && `L${right} ${top}`,\n top !== -oy && `L${right + SCALE / 4}, ${-SCALE}`,\n template !== MINING_LASER && `L${right + SCALE / 4} 0`,\n hasText && `L${right} ${oy}`,\n bottom !== oy && `L${right} ${bottom}`,\n `L${left} ${bottom}`,\n !hasText && `L${-SCALE / 4} 0`,\n (template === DOCKS || template === CANTEEN) && `L${left - SCALE / 4} 0`,\n `Z`,\n ]).join(\"\");\n}\n\nfunction getTitle(entity: Params[\"entity\"]) {\n return filterTruthy([\n entity.template?.name,\n entity.unique || (entity.loadout && \"Rock Raider\"),\n entity.level && `Lv${entity.level}`,\n ((s) => s && `(${s})`)(\n filterTruthy([\n entity.sleep && \"Sleeping\",\n entity.essential && \"VIP\",\n ...(entity.loadout ?? []),\n ...(entity.upgrades ?? []),\n ]).join(\", \"),\n ),\n ]).join(\" \");\n}\n\nexport default function EntityPreview({ entity, cavern, mapOverlay }: Params) {\n const d = useMemo(() => getMarkerD(entity.template), [entity.template]);\n if (mapOverlay === \"overview\") {\n if (\n !cavern.discoveryZones?.get(Math.floor(entity.x), Math.floor(entity.y))\n ?.openOnSpawn\n ) {\n return null;\n }\n } else if (mapOverlay !== \"entities\") {\n return null;\n }\n return (\n \n \n {getTitle(entity)}\n \n {entity.template?.inspectAbbrev && (\n \n {entity.template?.inspectAbbrev}\n \n )}\n \n );\n}\n","import React from \"react\";\nimport styles from \"./style.module.scss\";\n\nconst SCALE = 6;\n\nexport default function OpenCaveFlagPreview({\n x,\n y,\n}: {\n x: number;\n y: number;\n}) {\n return (\n \n );\n}\n","export const CORNER_OFFSETS = [\n [-1, -1],\n [0, -1],\n [-1, 0],\n [0, 0],\n] as const;\n\nexport const HEIGHT_MIN = -600;\nexport const HEIGHT_MAX = 600;\n","import React from \"react\";\nimport { Grid } from \"../../../core/common/grid\";\nimport styles from \"./style.module.scss\";\nimport {\n HEIGHT_MAX,\n HEIGHT_MIN,\n} from \"../../../core/transformers/03_plastic/03_strataflux/base\";\n\nconst SCALE = 6;\n\nfunction toColor(h: number) {\n const v = (h - HEIGHT_MIN) / (HEIGHT_MAX - HEIGHT_MIN);\n const lum = v * 100;\n const hue = 50 + 200 * (1 - v);\n return `hsl(${hue.toFixed()} 50% ${lum.toFixed()}%)`;\n}\n\nexport default function HeightPreview({ height }: { height: Grid }) {\n return (\n \n {height.map((h, x, y) => {\n return (\n \n {h}\n \n );\n })}\n \n );\n}\n","import { MapOverlay } from \".\";\nimport {\n getTotalCrystals,\n getTotalOre,\n} from \"../../../core/architects/utils/resources\";\nimport { Cavern } from \"../../../core/models/cavern\";\nimport React from \"react\";\nimport styles from \"./style.module.scss\";\nimport { Tile } from \"../../../core/models/tiles\";\nimport { Building } from \"../../../core/models/building\";\nimport { Vehicle } from \"../../../core/models/vehicle\";\nimport { Creature } from \"../../../core/models/creature\";\n\nfunction EntitySummary({\n entities,\n}: {\n entities: readonly (Building | Vehicle | Creature)[] | undefined;\n}) {\n const counts: { [K: string]: number } = {};\n entities?.forEach((e) => {\n const s = e.template.inspectAbbrev;\n counts[s] = (counts[s] ?? 0) + 1;\n });\n\n return (\n <>\n {!Object.entries(counts).length && \"n/a\"}\n {Object.entries(counts)\n .map(([k, v]) => `${k}${v > 1 ? `x${v}` : \"\"}`)\n .join(\" \")}\n \n );\n}\n\nexport default function Stats({\n cavern,\n mapOverlay,\n}: {\n cavern: Cavern;\n mapOverlay: MapOverlay;\n}) {\n const content = (() => {\n switch (mapOverlay) {\n case \"overview\":\n return (\n <>\n {cavern.levelName && (\n

\n {cavern.fileName} {cavern.levelName}\n

\n )}\n {cavern.briefing?.intro && (\n

{cavern.briefing.intro.replace(/\\n/g, \"\\u00B6\")}

\n )}\n \n );\n case \"tiles\":\n return (\n
    \n
  • Playable area: {cavern.tiles?.size ?? 0}
    • \n
  • \n Walls: {cavern.tiles?.reduce((r, t) => (t.isWall ? r + 1 : r), 0)}\n
    • \n
\n );\n case \"entities\": {\n return (\n
    \n
  • Miners: {cavern.miners?.length ?? 0}
    • \n
  • \n Buildings: \n
    • \n
  • \n Vehicles: \n
    • \n
  • \n Creatures: \n
    • \n
\n );\n }\n case \"crystals\":\n return (\n
    \n
  • Total EC: {getTotalCrystals(cavern)}
    • \n {cavern.objectives?.crystals ? (\n
  • Goal: {cavern.objectives?.crystals}
    • \n ) : null}\n
\n );\n case \"ore\":\n return (\n
    \n
  • Total Ore: {getTotalOre(cavern)}
    • \n {cavern.objectives?.ore ? (\n
  • Goal: {cavern.objectives?.ore}
    • \n ) : null}\n
\n );\n case \"landslides\": {\n if (!cavern.landslides?.size) {\n return null;\n }\n const count = cavern.landslides.size;\n const avgCooldown =\n cavern.landslides.reduce((r, ls) => r + ls.cooldown, 0) / count;\n return (\n
    \n
  • Landslides: {count}
    • \n {avgCooldown && (\n
  • Avg Cooldown: {avgCooldown.toFixed(2)} seconds
    • \n )}\n
\n );\n }\n case \"erosion\": {\n const count = cavern.erosion?.size ?? 0;\n const avgCooldown = cavern.erosion\n ? cavern.erosion.reduce((r, ls) => r + ls.cooldown, 0) / count\n : null;\n return (\n
    \n
  • \n Water:{\" \"}\n {cavern.tiles?.reduce(\n (r, t) => (t === Tile.WATER ? r + 1 : r),\n 0,\n )}\n
    • \n
  • \n Lava:{\" \"}\n {cavern.tiles?.reduce((r, t) => (t === Tile.LAVA ? r + 1 : r), 0)}\n
    • \n
  • Erosion: {count}
    • \n {avgCooldown && (\n
  • Avg Cooldown: {avgCooldown.toFixed(2)} seconds
    • \n )}\n
\n );\n }\n case \"height\": {\n if (!cavern.height) {\n return null;\n }\n return (\n
    \n
  • \n min:{\" \"}\n {cavern.height.reduce((r, h) => (h < r ? h : r), 0).toFixed()}\n
    • \n
  • \n mean:{\" \"}\n {(() => {\n let sum = 0;\n let count = 0;\n cavern.height.forEach((h) => {\n sum += h;\n count += 1;\n });\n return (sum / count).toFixed(1);\n })()}\n
    • \n
  • \n max:{\" \"}\n {cavern.height.reduce((r, h) => (h > r ? h : r), 0).toFixed()}\n
    • \n
\n );\n }\n case \"oxygen\": {\n return

Oxygen: {cavern.oxygen?.join(\"/\") ?? \"Infinity\"}

;\n }\n default:\n return null;\n }\n })();\n return content &&
{content}
;\n}\n","import React, { ReactNode } from \"react\";\nimport { Plan } from \"../../../core/models/plan\";\nimport PathPreview from \"./path\";\nimport styles from \"./style.module.scss\";\nimport { Cavern } from \"../../../core/models/cavern\";\nimport { Point } from \"../../../core/common/geometry\";\nimport { filterTruthy } from \"../../../core/common/utils\";\nimport { MapOverlay } from \".\";\n\nconst SCALE = 6;\n\nfunction getGClassName(plan: Partial>) {\n const r = [styles.plan];\n plan.kind && r.push(styles[`${plan.kind}Kind`]);\n plan.path?.kind && r.push(styles[`${plan.path.kind}PathKind`]);\n plan.fluid && r.push(styles[`fluid${plan.fluid.id}`]);\n plan.hasErosion && r.push(\"hasErosion\");\n return r.join(\" \");\n}\n\nfunction drawRadius(pearlRadius: number) {\n return pearlRadius + 1;\n}\n\nfunction caveWithOneBaseplate(plan: Partial>) {\n const [x, y] = plan.path!.baseplates[0].center;\n return (\n \n );\n}\n\nfunction dWrapping(\n a: { x: number; y: number; radius: number },\n b: { x: number; y: number; radius: number },\n): string {\n // There's no \"picture\" comments here, so accept this explanation that\n // vaguely resembles the geometry proofs I literally haven't had to deal\n // with in like 20 years.\n\n // Given: Two circles with centers A and B.\n // Given: Point A' which is on the circumference of A\n // Given: Point A'' which is the reflection of A' over line AB\n // Given: Point B' which is on the circumference of B\n // Given: Point B'' which is the reflection of B' over line AB\n // Given: The radius of A is greater than B\n if (a.radius < b.radius) {\n [a, b] = [b, a];\n }\n // First, get the polar coordinates of B relative to A.\n const [dx, dy] = [b.x - a.x, b.y - a.y];\n const lengthAB = Math.hypot(dx, dy);\n const angleAB = Math.atan2(dy, dx);\n\n // Create point C on AA'\n // Create a line BC which is perpendicular to AA'\n // ABC is a right triangle with hypotenuse AB\n // We know the length of AB and AC. Find angle BAC\n const lengthAC = a.radius - b.radius;\n const angleBAC = Math.acos(lengthAC / lengthAB);\n\n // This is enough to determine the locations of all the points.\n const prime1 = {\n x: Math.cos(angleAB - angleBAC),\n y: Math.sin(angleAB - angleBAC),\n };\n const prime2 = {\n x: Math.cos(angleAB + angleBAC),\n y: Math.sin(angleAB + angleBAC),\n };\n const aPrime1 = [a.x + a.radius * prime1.x, a.y + a.radius * prime1.y];\n const aPrime2 = [a.x + a.radius * prime2.x, a.y + a.radius * prime2.y];\n const bPrime1 = [b.x + b.radius * prime1.x, b.y + b.radius * prime1.y];\n const bPrime2 = [b.x + b.radius * prime2.x, b.y + b.radius * prime2.y];\n\n // Create SVG path segments\n return [\n `M ${aPrime2.join(\",\")}`,\n `A ${a.radius},${a.radius} 0 1 1 ${aPrime1.join(\",\")}`,\n `L ${bPrime1.join(\",\")}`,\n `A ${b.radius},${b.radius} 0 0 1 ${bPrime2.join(\",\")} Z`,\n ].join(\"\");\n}\n\nfunction caveWithTwoBaseplates(plan: Partial>) {\n const [a, b] = plan.path!.baseplates.map((bp) => {\n const [x, y] = bp.center;\n return {\n x: x * SCALE,\n y: y * SCALE,\n radius: drawRadius(bp.pearlRadius) * SCALE,\n };\n });\n\n return ;\n}\n\nfunction hall(plan: Partial>) {\n const bps = plan.path!.baseplates;\n const d = bps\n .map((bp, i) => {\n const [x, y] = bp.center;\n return `${i === 0 ? \"M\" : \"L\"}${x * SCALE} ${y * SCALE}`;\n })\n .join(\" \");\n return (\n \n );\n}\n\nexport default function PlansPreview({\n cavern,\n mapOverlay,\n}: {\n cavern: Cavern;\n mapOverlay: MapOverlay;\n}) {\n if (!cavern.plans) {\n return null;\n }\n\n const planCoords: Point[] = [];\n cavern.plans.forEach((plan) => {\n const bp = plan.path.baseplates;\n\n const i = Math.floor((bp.length - 1) / 2);\n const j = Math.floor(bp.length / 2);\n if (i === j) {\n planCoords[plan.id] = bp[i].center;\n } else {\n const [ix, iy] = bp[i].center;\n const [jx, jy] = bp[j].center;\n planCoords[plan.id] = [(ix + jx) / 2, (iy + jy) / 2];\n }\n });\n\n const right = [...cavern.plans];\n right.sort((a, b) => planCoords[b.id][0] - planCoords[a.id][0]);\n const left = right.splice(Math.floor(right.length / 2));\n right.sort((a, b) => planCoords[a.id][1] - planCoords[b.id][1]);\n left.sort(\n (a, b) =>\n planCoords[a.id][1] - planCoords[b.id][1] ||\n planCoords[a.id][0] - planCoords[b.id][0],\n );\n\n function drawLabels(\n plans: NonNullable,\n sign: -1 | 1,\n className: string,\n ): ReactNode {\n if (mapOverlay === \"script\") {\n return null;\n }\n if (mapOverlay === \"overview\") {\n return plans.map((plan) => {\n const bps = plan.path.baseplates;\n if (bps.length <= 1) {\n const [x, y] = bps[0].center;\n return (\n \n \n {\"architect\" in plan && plan.architect.name} {plan.id}\n \n \n );\n }\n const d = bps\n .map((bp, i) => {\n const [x, y] = bp.center;\n return `${i === 0 ? \"M\" : \"L\"}${x * SCALE} ${y * SCALE}`;\n })\n .join(\" \");\n return (\n \n \n \n \n {\"architect\" in plan && plan.architect.name} {plan.id}\n \n \n \n );\n });\n }\n let py = -Infinity;\n return plans.map((plan, i) => {\n const px = SCALE * planCoords[plan.id][0];\n py = Math.max(SCALE * planCoords[plan.id][1], py + 4);\n const lx = ((SCALE * cavern.context.targetSize) / 2 + 50) * sign;\n const ly =\n SCALE * cavern.context.targetSize * ((i + 1) / plans.length - 0.5);\n const bx = lx - Math.abs(py - ly) * 0.56 * sign;\n const d = filterTruthy([\n `M ${lx + 25 * sign} ${ly}`,\n `L ${lx} ${ly}`,\n bx * sign > px * sign && `L ${bx} ${py}`,\n `L ${px} ${py}`,\n ]).join(\"\");\n return (\n \n \n \n {\"architect\" in plan ? (\n <>\n {plan.architect.name}\n {!plan.hops.length && \"*\"} {plan.id}\n \n ) : (\n <>{plan.id}\n )}\n \n \n );\n });\n }\n\n return (\n <>\n {cavern.plans.map((plan) => {\n if (\"pearlRadius\" in plan) {\n return (\n \n {plan.kind === \"cave\"\n ? plan.path.baseplates.length === 2\n ? caveWithTwoBaseplates(plan)\n : caveWithOneBaseplate(plan)\n : hall(plan)}\n \n );\n }\n if (plan.path.baseplates.length ?? 0 > 1) {\n return ;\n }\n return null;\n })}\n {drawLabels(left, -1, styles.left)}\n {drawLabels(right, 1, styles.right)}\n \n );\n}\n","// extracted by mini-css-extract-plugin\nexport default {\"script\":\"styles_script__wlFev\",\"src\":\"styles_src__D5r4o\",\"line\":\"styles_line__DUONY\",\"hovered\":\"styles_hovered__IuDHx\",\"scriptOverlay\":\"styles_scriptOverlay__itjxQ\",\"tile\":\"styles_tile__+On+N\",\"arrow\":\"styles_arrow__BwPCK\",\"arrowhead\":\"styles_arrowhead__VEozU\",\"misc\":\"styles_misc__Oi8T3\",\"condition\":\"styles_condition__-r6Ai\",\"event\":\"styles_event__jROkn\"};","import React, { Fragment, createRef, useLayoutEffect, useMemo } from \"react\";\nimport { Cavern } from \"../../../../core/models/cavern\";\nimport styles from \"./styles.module.scss\";\nimport { Point } from \"../../../../core/common/geometry\";\nimport { filterTruthy } from \"../../../../core/common/utils\";\n\ntype Statement = {\n kind: string;\n code: string;\n pos?: Point;\n};\n\nconst SCALE = 6;\n\nfunction parse(script: string): Statement[] {\n return script.split(\"\\n\").map((line) => {\n if (line.startsWith(\"#\")) {\n return { kind: \"misc\", code: line };\n }\n if (!line) {\n return { kind: \"misc\", code: \"\\u00A0\" };\n }\n const m = line.match(/(?(^|\\())[a-z]+:(?\\d+),(?\\d+)/);\n if (m) {\n const kind = m.groups!.prefix === \"(\" ? \"condition\" : \"event\";\n return {\n kind: kind,\n code: line,\n pos: [parseInt(m.groups!.x, 10), parseInt(m.groups!.y)],\n };\n }\n return { kind: \"misc\", code: line };\n });\n}\n\nfunction getLineOffsets(container: HTMLDivElement) {\n const result = [];\n const lines = Array.from(\n container.getElementsByClassName(styles.line),\n ) as HTMLElement[];\n let i = 0;\n for (; i < lines.length; i++) {\n if (lines[i].offsetTop + lines[i].clientHeight >= container.scrollTop) {\n break;\n }\n }\n for (; i < lines.length; i++) {\n if (lines[i].offsetTop >= container.scrollTop + container.clientHeight) {\n break;\n }\n result[i] =\n lines[i].offsetTop +\n lines[i].clientHeight / 2 -\n container.clientHeight / 2 -\n container.scrollTop;\n }\n return result;\n}\n\nexport default function ScriptPreview({\n cavern,\n setScriptLineOffsets,\n scriptLineHovered,\n setScriptLineHovered,\n}: {\n cavern: Cavern | undefined;\n setScriptLineOffsets: (v: number[]) => void;\n scriptLineHovered: number;\n setScriptLineHovered: (v: number) => void;\n}) {\n const ref = createRef();\n useLayoutEffect(() => {\n const container = ref.current;\n if (!container) {\n return;\n }\n setScriptLineOffsets(getLineOffsets(container));\n }, [ref, setScriptLineOffsets]);\n const statements = useMemo(\n () => (cavern?.script ? parse(cavern.script) : undefined),\n [cavern],\n );\n return (\n setScriptLineOffsets(getLineOffsets(ref.current!))}\n >\n

Script

\n
\n {statements?.map(({ code, pos, kind }, i) => {\n const className = filterTruthy([\n styles.line,\n scriptLineHovered === i && styles.hovered,\n styles[kind],\n ]).join(\" \");\n return (\n setScriptLineHovered(i) : undefined}\n >\n {code}\n
\n );\n })}\n
\n
\n );\n}\n\nexport function ScriptOverlay({\n cavern,\n scriptLineOffsets,\n scriptLineHovered,\n scale,\n}: {\n cavern: Cavern | undefined;\n scriptLineOffsets: number[];\n scriptLineHovered: number;\n scale: number;\n}) {\n const statements = useMemo(\n () => (cavern?.script ? parse(cavern.script) : undefined),\n [cavern],\n );\n if (!cavern?.script) {\n return null;\n }\n const ox = cavern.left!;\n const oy = cavern.top!;\n return (\n \n {statements!.map(({ kind, pos }, i) => {\n if (!pos || scriptLineOffsets[i] === undefined) {\n return null;\n }\n const className = filterTruthy([\n styles.tile,\n scriptLineHovered === i && styles.hovered,\n styles[kind],\n ]).join(\" \");\n return (\n \n );\n })}\n {parse(cavern.script).map(({ kind, pos }, i) => {\n if (\n !pos ||\n scriptLineHovered !== i ||\n scriptLineOffsets[i] === undefined\n ) {\n return null;\n }\n const lx = -9999;\n const ly = scriptLineOffsets[i] / scale;\n const px = (pos[0] + ox + 0.5) * SCALE;\n const py = (pos[1] + oy + 0.5) * SCALE;\n const bx = px - Math.abs(py - ly) * 0.3;\n const d = filterTruthy([\n `M ${px} ${py}`,\n `L ${bx} ${ly}`,\n `L ${lx} ${ly}`,\n ]).join(\"\");\n const cr = 10;\n const tr = 4;\n return (\n \n \n \n \n \n );\n })}\n \n );\n}\n","import React, {\n CSSProperties,\n createRef,\n useLayoutEffect,\n useReducer,\n useState,\n} from \"react\";\nimport { Cavern } from \"../../../core/models/cavern\";\nimport BaseplatePreview from \"./baseplate\";\nimport PathPreview from \"./path\";\nimport PearlPreview from \"./pearl\";\nimport { PearledPlan } from \"../../../core/transformers/01_planning/04_pearl\";\nimport TilesPreview from \"./tiles\";\nimport EntityPreview from \"./entity\";\nimport OpenCaveFlagPreview from \"./open_cave_flag\";\nimport styles from \"./style.module.scss\";\nimport HeightPreview from \"./height\";\nimport Stats from \"./stats\";\nimport PlansPreview from \"./plan\";\nimport ScriptPreview, { ScriptOverlay } from \"./script_preview\";\n\nexport type MapOverlay =\n | \"about\"\n | \"crystals\"\n | \"discovery\"\n | \"entities\"\n | \"erosion\"\n | \"height\"\n | \"landslides\"\n | \"lore\"\n | \"ore\"\n | \"overview\"\n | \"oxygen\"\n | \"script\"\n | \"tiles\"\n | null;\n\nfunction getScale(\n cavern: Cavern,\n mapOverlay: MapOverlay,\n showOutlines: boolean,\n mapWrapper: HTMLDivElement | null,\n) {\n if (!mapWrapper || cavern.left === undefined) {\n return 1;\n }\n const tw = Math.max(-1 * (cavern.left ?? 0), 1 + (cavern.right ?? 0)) + 1;\n const th = Math.max(-1 * (cavern.top ?? 0), 1 + (cavern.bottom ?? 0)) + 1;\n const overlayMargin =\n cavern.plans && showOutlines && mapOverlay !== \"script\" ? 400 : 0;\n const mw = 6 * 2 * tw + overlayMargin;\n const mh = 6 * 2 * th;\n return Math.max(\n Math.floor(\n Math.min(mapWrapper.clientWidth / mw, mapWrapper.clientHeight / mh) * 2,\n ) / 2,\n 0.5,\n );\n}\n\nfunction getTransform(cavern: Cavern, mapOverlay: MapOverlay, scale: number) {\n if (mapOverlay !== \"overview\" || !cavern.cameraPosition) {\n return {\n \"--pvw-scale\": scale,\n } as CSSProperties;\n }\n const { x, y, yaw, pitch } = cavern.cameraPosition;\n return {\n \"--pvw-scale\": 6,\n \"--pvw-pitch\": `${pitch}rad`,\n \"--pvw-yaw\": `${Math.PI - ((yaw + Math.PI * 1.5) % (Math.PI * 2))}rad`,\n \"--pvw-tr-x\": -x * 6,\n \"--pvw-tr-y\": -y * 6,\n } as CSSProperties;\n}\n\nexport default function CavernPreview({\n cavern,\n mapOverlay,\n showOutlines,\n showPearls,\n}: {\n cavern: Cavern;\n mapOverlay: MapOverlay;\n showOutlines: boolean;\n showPearls: boolean;\n}) {\n const [scriptLineHovered, setScriptLineHovered] = useState(-1);\n const [scriptLineOffsets, setScriptLineOffsets] = useReducer(\n (was: number[], now: number[]) => {\n if (was.length !== now.length) {\n return now;\n }\n for (let i = 0; i < was.length; i++) {\n if (was[i] !== now[i]) {\n return now;\n }\n }\n return was;\n },\n [],\n );\n\n const mapWrapperRef = createRef();\n const [scale, setScale] = useState(1);\n\n useLayoutEffect(() => {\n const fn = () =>\n setScale(\n getScale(cavern, mapOverlay, showOutlines, mapWrapperRef.current),\n );\n window.addEventListener(\"resize\", fn);\n fn();\n return () => window.removeEventListener(\"resize\", fn);\n }, [cavern, mapOverlay, showOutlines, mapWrapperRef]);\n\n switch (mapOverlay) {\n case \"about\":\n case \"lore\":\n return null;\n default:\n }\n\n const height = cavern.context.targetSize * 2 * 6;\n const width = Math.max(height, cavern.context.targetSize * 6 + 600);\n\n return (\n \n {mapOverlay === \"script\" && (\n \n )}\n
\n \n {}\n {mapOverlay === \"height\" && cavern.height && (\n \n )}\n {showOutlines &&\n cavern.baseplates?.map((bp) => (\n \n ))}\n {showOutlines &&\n cavern.paths?.map((pa) => )}\n {cavern.buildings?.map((b, i) => (\n \n ))}\n {cavern.creatures?.map((c) => (\n \n ))}\n {cavern.miners?.map((m) => (\n \n ))}\n {cavern.vehicles?.map((v) => (\n \n ))}\n {mapOverlay === \"discovery\" &&\n cavern.openCaveFlags?.map((_, x, y) => (\n \n ))}\n {mapOverlay === \"script\" && (\n \n )}\n {showOutlines && cavern.plans && (\n \n )}\n {showPearls &&\n cavern.plans\n ?.filter((pl) => \"outerPearl\" in pl)\n .map((pl) => (\n }\n pearl={\"outerPearl\"}\n />\n ))}\n {showPearls &&\n cavern.plans\n ?.filter((pl) => \"innerPearl\" in pl)\n .map((pl) => (\n }\n pearl={\"innerPearl\"}\n />\n ))}\n \n
\n \n
\n );\n}\n","type TfResult = {\n result: Current;\n name: string;\n progress: number;\n next: (() => TfResult) | null;\n};\n\nexport type TransformResult = TfResult;\n\nexport type AnyTfResultOf> =\n BT extends TfBuilder ? T : unknown;\n\nclass TfBuilder {\n private fns: ((it: T) => T)[];\n constructor(fns: ((it: T) => T)[]) {\n this.fns = fns;\n }\n private mkResult(\n result: Current,\n i: number,\n ): TfResult {\n const name = [\n `${i}/${this.fns.length}`,\n this.fns[i - 1]?.name ?? \"init\",\n i < this.fns.length ? `(next: ${this.fns[i].name})` : undefined,\n ].join(\" \");\n const progress = i / this.fns.length;\n const next =\n i < this.fns.length\n ? () => this.mkResult(this.fns[i](result), i + 1)\n : null;\n return { result, name, progress, next };\n }\n first(result: In): TfResult {\n return this.mkResult(result, 0);\n }\n chain(\n that: TfBuilder,\n ): TfBuilder {\n return new TfBuilder([\n ...(this.fns as ((it: T | ThatT) => T | ThatT)[]),\n ...(that.fns as ((it: T | ThatT) => T | ThatT)[]),\n ]);\n }\n then(fn: (it: Out) => ThatOut): TfBuilder {\n return new TfBuilder([\n ...(this.fns as ((it: T | ThatOut) => T | ThatOut)[]),\n fn as (it: T | ThatOut) => T | ThatOut,\n ]);\n }\n}\n\nexport function tf(fn: (it: TIn) => TOut) {\n const fns = [fn as (it: TIn | TOut) => TIn | TOut];\n return new TfBuilder(fns);\n}\n","import { Point } from \"../common/geometry\";\n\nexport type BaseplateKind = \"stock\" | \"ambiguous\" | \"cave\" | \"hall\";\n\n/* A rectangular space that we can build on. */\nexport class Baseplate {\n readonly id: number;\n readonly left: number;\n readonly top: number;\n readonly right: number;\n readonly bottom: number;\n readonly kind: BaseplateKind;\n\n constructor(\n id: number,\n left: number,\n top: number,\n right: number,\n bottom: number,\n kind: BaseplateKind,\n ) {\n this.id = id;\n this.left = left;\n this.top = top;\n this.right = right;\n this.bottom = bottom;\n this.kind = kind;\n }\n\n get width(): number {\n return this.right - this.left;\n }\n\n get height(): number {\n return this.bottom - this.top;\n }\n\n get area(): number {\n return this.width * this.height;\n }\n\n get center(): Point {\n return [this.left + this.width / 2, this.top + this.height / 2];\n }\n\n withKind(kind: BaseplateKind): Baseplate {\n return new Baseplate(\n this.id,\n this.left,\n this.top,\n this.right,\n this.bottom,\n kind,\n );\n }\n\n get pearlRadius(): number {\n return Math.min(this.width, this.height) >> 1;\n }\n}\n","import { CavernContext, DiceBox, PseudorandomStream } from \"../../common\";\nimport { Baseplate } from \"../../models/baseplate\";\nimport { BaseCavern } from \"../../models/cavern\";\n\nexport type PartitionedCavern = BaseCavern & {\n baseplates: readonly Baseplate[];\n};\n\nconst BASEPLATE_MIN_SIZE = 3;\n\n// Cuts the space into Baseplates.\nclass Partitioner {\n private readonly context: CavernContext;\n private readonly baseplateMaxSize: number;\n private readonly rng: PseudorandomStream;\n private readonly queue: Baseplate[];\n private readonly outbox: Baseplate[];\n private nextId: number = 0;\n\n constructor({ context, dice }: { context: CavernContext; dice: DiceBox }) {\n this.context = context;\n this.rng = dice.partition;\n this.baseplateMaxSize = Math.max(\n Math.round(context.targetSize * context.baseplateMaxRatioOfSize),\n 3,\n );\n\n const bound = context.targetSize >> 1;\n this.queue = [\n new Baseplate(this.id(), -bound, -bound, bound, bound, \"stock\"),\n ];\n this.outbox = [];\n }\n\n private id(): number {\n return this.nextId++;\n }\n\n private clone(\n bp: Baseplate,\n id: number,\n args: {\n left?: number;\n top?: number;\n right?: number;\n bottom?: number;\n },\n ) {\n const r = new Baseplate(\n id,\n args.left ?? bp.left,\n args.top ?? bp.top,\n args.right ?? bp.right,\n args.bottom ?? bp.bottom,\n \"stock\",\n );\n if (Math.min(r.width, r.height) >= BASEPLATE_MIN_SIZE) {\n this.queue.push(r);\n }\n }\n\n public get baseplates(): readonly Baseplate[] {\n return [...this.queue, ...this.outbox];\n }\n\n public get done(): boolean {\n return this.queue.length === 0;\n }\n\n // Perform one step of partitioning.\n public step(): void {\n const queue = [...this.queue];\n this.queue.length = 0;\n for (const bp of queue) {\n this.split(bp);\n }\n }\n\n private split(bp: Baseplate) {\n if (bp.width > bp.height * 2) {\n // Cut vertically\n const x = this.rng.betaInt({\n a: 5,\n b: 5,\n min: bp.left + 1,\n max: bp.right,\n });\n this.clone(bp, bp.id, { right: x });\n this.clone(bp, this.id(), { left: x });\n } else if (bp.height > bp.width * 2) {\n // Cut horizontally\n const y = this.rng.betaInt({\n a: 5,\n b: 5,\n min: bp.top + 1,\n max: bp.bottom,\n });\n this.clone(bp, bp.id, { bottom: y });\n this.clone(bp, this.id(), { top: y });\n } else {\n // Determine size to clip from center\n let w = this.rng.betaInt({\n a: 5,\n b: 2.5,\n min: 3,\n max: Math.min(this.baseplateMaxSize, bp.width),\n });\n let h = this.rng.betaInt({\n a: 5,\n b: 2.5,\n min: 3,\n max: Math.min(this.baseplateMaxSize, bp.height),\n });\n // Limit to max oblongness\n w = Math.min(w, h + this.context.baseplateMaxOblongness);\n h = Math.min(h, w + this.context.baseplateMaxOblongness);\n // Determine where to place this baseplate in the open space\n const x1 = this.rng.uniformInt({ min: bp.left, max: bp.right - w });\n const y1 = this.rng.uniformInt({ min: bp.top, max: bp.bottom - h });\n const x2 = x1 + w;\n const y2 = y1 + h;\n // Clip the baseplate itself from the center\n if (Math.min(w, h) >= BASEPLATE_MIN_SIZE) {\n if (Math.max(w, h) <= this.baseplateMaxSize) {\n this.outbox.push(new Baseplate(bp.id, x1, y1, x2, y2, \"ambiguous\"));\n } else {\n this.queue.push(new Baseplate(bp.id, x1, y1, x2, y2, \"stock\"));\n }\n }\n // Randomly clip the four pieces around clockwise or counterclockwise\n if (this.rng.chance(0.5)) {\n this.clone(bp, this.id(), { right: x1, bottom: y2 });\n this.clone(bp, this.id(), { left: x1, bottom: y1 });\n this.clone(bp, this.id(), { left: x2, top: y1 });\n this.clone(bp, this.id(), { right: x2, top: y2 });\n } else {\n this.clone(bp, this.id(), { right: x2, bottom: y1 });\n this.clone(bp, this.id(), { left: x2, bottom: y2 });\n this.clone(bp, this.id(), { left: x1, top: y2 });\n this.clone(bp, this.id(), { right: x1, top: y1 });\n }\n }\n }\n}\n\nexport default function partition(cavern: BaseCavern): PartitionedCavern {\n const partitioner = new Partitioner(cavern);\n while (!partitioner.done) {\n partitioner.step();\n }\n return { ...cavern, baseplates: partitioner.baseplates };\n}\n","import { pairMap } from \"../common/utils\";\nimport { Baseplate } from \"./baseplate\";\n\nexport type PathKind = \"ambiguous\" | \"spanning\" | \"auxiliary\" | \"single\";\n\nfunction distance(a: Baseplate, b: Baseplate): number {\n const [x1, y1] = a.center;\n const [x2, y2] = b.center;\n const dx = x1 - x2;\n const dy = y1 - y2;\n return Math.hypot(dx, dy);\n}\n\n/* A path through a series of Baseplates. */\nexport class Path {\n readonly id: number;\n readonly kind: PathKind;\n readonly baseplates: readonly Baseplate[];\n\n constructor(id: number, kind: PathKind, baseplates: readonly Baseplate[]) {\n this.id = id;\n this.kind = kind;\n this.baseplates = baseplates;\n }\n\n public get origin(): Baseplate {\n return this.baseplates[0];\n }\n\n public get destination(): Baseplate {\n return this.baseplates[this.baseplates.length - 1];\n }\n\n /** The distance directly from the origin to destination. */\n public get batDistance(): number {\n return distance(this.origin, this.destination);\n }\n\n /** The distance along the path from the origin to the destination. */\n public get snakeDistance(): number {\n return pairMap(this.baseplates, distance).reduce((a, b) => a + b, 0);\n }\n\n public get exclusiveSnakeDistance(): number {\n return Math.max(\n this.snakeDistance -\n this.origin.pearlRadius -\n this.destination.pearlRadius,\n 0,\n );\n }\n}\n","import { tf } from \"../../common/transform\";\nimport partition from \"./00_partition\";\nimport discriminate from \"./01_discriminate\";\nimport triangulate from \"./02_triangulate\";\nimport span from \"./03_span\";\nimport clip from \"./04_clip\";\nimport bore from \"./05_bore\";\nimport weave from \"./06_weave\";\n\nexport const OUTLINE_TF = tf(partition)\n .then(discriminate)\n .then(triangulate)\n .then(span)\n .then(clip)\n .then(bore)\n .then(weave);\n","import { PartitionedCavern } from \"./00_partition\";\n\nexport default function discriminate(\n cavern: PartitionedCavern,\n): PartitionedCavern {\n const baseplates = [...cavern.baseplates];\n const dexes = cavern.baseplates\n .map((bp, i) => [bp.area, i])\n .sort(([a], [b]) => b - a);\n const count = Math.min(cavern.context.caveCount, baseplates.length - 1);\n for (let i = 0; i < count; i++) {\n const j = dexes[i][1];\n baseplates[j] = baseplates[j].withKind(\"cave\");\n }\n return { ...cavern, baseplates };\n}\n","import Delaunator from \"delaunator\";\nimport { Path } from \"../../models/path\";\nimport { PartitionedCavern } from \"./00_partition\";\n\nexport type TriangulatedCavern = PartitionedCavern & {\n paths: readonly Path[];\n};\n\n/**\n * Performs Delaunay triangulation over all the baseplates with the 'cave' kind to generate\n * ambiguous paths.\n */\nexport default function triangulate(\n cavern: PartitionedCavern,\n): TriangulatedCavern {\n const caveBaseplates = cavern.baseplates.filter((bp) => bp.kind === \"cave\");\n const points = caveBaseplates.flatMap((bp) => bp.center);\n const delaunay = new Delaunator(points);\n const paths: Path[] = [];\n for (let i = 0; i < delaunay.triangles.length; i++) {\n if (i > delaunay.halfedges[i]) {\n const id = paths.length;\n const source = caveBaseplates[delaunay.triangles[i]];\n const dest =\n caveBaseplates[delaunay.triangles[i + (i % 3 === 2 ? -2 : 1)]];\n paths[id] = new Path(id, \"ambiguous\", [source, dest]);\n }\n }\n return { ...cavern, paths };\n}\n","import { TriangulatedCavern } from \"./02_triangulate\";\nimport { Path } from \"../../models/path\";\n\n/*\n * Returns an array of paths filtered from the input.\n * Some paths returned will have the kind 'spanning' - this set of paths comprises the\n * minimum spanning tree of the graph.\n *\n * It is assumed the ids of the paths are sequential, starting from 0.\n */\nexport default function span(cavern: TriangulatedCavern): TriangulatedCavern {\n const clusters: number[] = [];\n let nextCluster = 1;\n\n const paths = [];\n\n for (const path of [...cavern.paths].sort(\n (a, b) => a.batDistance - b.batDistance,\n )) {\n const oi = path.origin.id;\n const di = path.destination.id;\n const oc = clusters[oi];\n const dc = clusters[di];\n if (oc && dc) {\n if (oc === dc) {\n // Cycle detected (This path is not spanning)\n paths[path.id] = path;\n continue;\n }\n // Merge clusters\n clusters.forEach((c, i) => {\n if (c === dc) {\n clusters[i] = oc;\n }\n });\n } else if (oc) {\n // Add destination to existing cluster\n clusters[di] = oc;\n } else if (dc) {\n // Add origin to existing cluster\n clusters[oi] = dc;\n } else {\n // Create a new cluster for both\n clusters[oi] = nextCluster;\n clusters[di] = nextCluster;\n nextCluster++;\n }\n paths[path.id] = new Path(path.id, \"spanning\", path.baseplates);\n }\n return { ...cavern, paths: paths.filter((p) => p) };\n}\n","import { TriangulatedCavern } from \"./02_triangulate\";\nimport { Path } from \"../../models/path\";\n\n/**\n * Remove any ambiguous paths on baseplates that exist outside the clip radius.\n * The halls on the outside edges tend to be long, thin, straight, cardinal,\n * and boring.\n */\nexport default function clip(cavern: TriangulatedCavern): TriangulatedCavern {\n const radius = cavern.context.targetSize / 2;\n const rSquared = radius * radius;\n const paths: Path[] = cavern.paths.filter(\n (path) =>\n path.kind === \"spanning\" ||\n !path.baseplates.some((bp) => {\n const [x, y] = bp.center;\n return x * x + y * y > rSquared;\n }),\n );\n return { ...cavern, paths };\n}\n","import { plotLine } from \"../../common/geometry\";\nimport { Baseplate } from \"../../models/baseplate\";\nimport { TriangulatedCavern } from \"./02_triangulate\";\nimport { Path } from \"../../models/path\";\n\n/**\n * Add ambiguous baseplates to paths that intersect them.\n */\nexport default function bore(cavern: TriangulatedCavern): TriangulatedCavern {\n const bpAtTile: { [tile: string]: Baseplate } = {};\n\n for (const bp of cavern.baseplates) {\n for (let x = bp.left; x < bp.right; x++) {\n for (let y = bp.top; y < bp.bottom; y++) {\n bpAtTile[`${x},${y}`] = bp;\n }\n }\n }\n\n function* genPathPlates(path: Path): IterableIterator {\n let last = path.origin;\n const seen = new Set([last]);\n\n yield last;\n\n while (true) {\n for (const [x, y] of plotLine(last.center, path.destination.center)) {\n const bp = bpAtTile[`${x},${y}`];\n if (bp === path.destination) {\n yield bp;\n return;\n }\n if (bp && !seen.has(bp)) {\n seen.add(bp);\n if (bp.kind !== \"cave\") {\n last = bp;\n yield last;\n break;\n }\n }\n }\n }\n }\n\n const paths = cavern.paths.map((path) => {\n return new Path(path.id, path.kind, Array.from(genPathPlates(path)));\n });\n return { ...cavern, paths };\n}\n","import { Baseplate } from \"../../models/baseplate\";\nimport { TriangulatedCavern } from \"./02_triangulate\";\nimport { Path } from \"../../models/path\";\n\ntype GraphNode = {\n src: Baseplate;\n edges: { theta: number; distance: number; dest: Baseplate }[];\n};\n\nfunction getGraph(paths: readonly Path[]): GraphNode[] {\n const result: GraphNode[] = [];\n const push = (\n path: Path,\n src: Baseplate,\n next: Baseplate,\n dest: Baseplate,\n ) => {\n const [ax, ay] = src.center;\n const [bx, by] = next.center;\n const theta = Math.atan2(by - ay, bx - ax);\n const distance = path.snakeDistance;\n (result[src.id] ||= { src, edges: [] }).edges[path.id] = {\n theta,\n distance,\n dest,\n };\n };\n paths.forEach((path) => {\n const bps = path.baseplates;\n push(path, bps[0], bps[1], bps[bps.length - 1]);\n push(path, bps[bps.length - 1], bps[bps.length - 2], bps[0]);\n });\n return result;\n}\n\nfunction getAllDistances(graph: GraphNode[], paths: Path[], src: Baseplate) {\n const distances: number[] = [];\n const queue: Baseplate[] = [];\n const result: { src: Baseplate; dest: Baseplate; distance: number }[] = [];\n\n distances[src.id] = 0;\n queue.push(src);\n\n // Dijkstra's algorithm\n while (queue.length) {\n const node = queue.shift()!;\n result.unshift({ src, dest: node, distance: distances[node.id] });\n graph[node.id].edges.forEach(({ distance, dest }, pathId) => {\n const pathKind = paths[pathId]?.kind;\n if (pathKind === \"spanning\" || pathKind === \"auxiliary\") {\n const d = distances[node.id] + distance;\n if (distances[dest.id] === undefined) {\n queue.push(dest);\n distances[dest.id] = d;\n } else if (d < distances[dest.id]) {\n distances[dest.id] = d;\n }\n }\n });\n queue.sort((a, b) => distances[a.id] - distances[b.id]);\n }\n\n return result;\n}\n\n/** Returns the angle between two absolute angles. */\nfunction getOffset(t1: number, t2: number): number {\n const r = Math.abs(t1 - t2);\n // Invert reflex angles\n return r > Math.PI ? 2 * Math.PI - r : r;\n}\n\nexport default function weave(cavern: TriangulatedCavern): TriangulatedCavern {\n const rng = cavern.dice.weave;\n const graph = getGraph(cavern.paths);\n const paths: Path[] = [];\n const pathIdsByEnds: number[][] = [];\n cavern.paths.forEach((path) => {\n paths[path.id] = path;\n (pathIdsByEnds[path.origin.id] ||= [])[path.destination.id] = path.id;\n (pathIdsByEnds[path.destination.id] ||= [])[path.origin.id] = path.id;\n });\n\n function minAngle(path: Path, node: GraphNode) {\n const theta = node.edges[path.id].theta;\n return node.edges.reduce((r, { theta: t }, pathId) => {\n const pathKind = paths[pathId]?.kind;\n if (pathKind === \"spanning\" || pathKind === \"auxiliary\") {\n return Math.min(getOffset(theta, t), r);\n }\n return r;\n }, Infinity);\n }\n\n // Delete any paths that don't form a minimum angle\n function pruneByAngle() {\n let ok = false;\n paths\n .filter((path) => path.kind === \"ambiguous\")\n .forEach((path) => {\n if (\n Math.min(\n minAngle(path, graph[path.origin.id]),\n minAngle(path, graph[path.destination.id]),\n ) < cavern.context.auxiliaryPathMinAngle\n ) {\n delete paths[path.id];\n } else {\n ok = true;\n }\n });\n return ok;\n }\n\n // Find the largest distance shortcut\n function addBestShortcut() {\n const distances = graph.map(({ src }) =>\n getAllDistances(graph, paths, src),\n );\n while (true) {\n const { src, dest } = distances\n .reduce((p, c) => (p[0].distance > c[0].distance ? p : c))\n .shift()!;\n const path = paths[pathIdsByEnds[src.id][dest.id]];\n if (path?.kind === \"ambiguous\") {\n paths[path.id] = new Path(path.id, \"auxiliary\", path.baseplates);\n break;\n }\n }\n }\n\n function addRandomShortcut() {\n const path = rng.betaChoice(\n paths\n .filter((path) => path.kind === \"ambiguous\")\n .map((path) => ({\n path,\n oa: minAngle(path, graph[path.origin.id]),\n da: minAngle(path, graph[path.destination.id]),\n }))\n .sort((a, b) => a.oa + a.da - b.oa - b.da),\n { a: 1, b: 5 },\n ).path;\n paths[path.id] = new Path(path.id, \"auxiliary\", path.baseplates);\n }\n\n for (let i = 0; i < cavern.context.optimalAuxiliaryPathCount; i++) {\n pruneByAngle() && addBestShortcut();\n }\n for (let i = 0; i < cavern.context.randomAuxiliaryPathCount; i++) {\n pruneByAngle() && addRandomShortcut();\n }\n\n return { ...cavern, paths: paths.filter((path) => path) };\n}\n","import { Baseplate } from \"../../models/baseplate\";\nimport { BaseCavern } from \"../../models/cavern\";\nimport { TriangulatedCavern } from \"../00_outlines/02_triangulate\";\nimport { Path } from \"../../models/path\";\nimport { Plan } from \"../../models/plan\";\nimport { AnyMetadata } from \"../../architects\";\n\nexport type PartialPlannedCavern>> =\n BaseCavern & {\n readonly plans: readonly T[];\n };\n\nexport type NegotiatedPlan = {\n /** Unique ID of the Plan, used for RNG and indexing. */\n readonly id: number;\n /** Is this a cave or a hall? */\n readonly kind: \"cave\" | \"hall\";\n /** The Path this Plan is built on. */\n readonly path: Path;\n};\n\n/*\n * Returns whether these Baseplates can be combined into one big Cave.\n * Must call this both ways.\n */\nfunction isMergeable(a: Baseplate, b: Baseplate): boolean {\n for (const [ua, ub, va1, va2, vb1, vb2] of [\n [a.right, b.left, a.top, a.bottom, b.top, b.bottom],\n [a.bottom, b.top, a.left, a.right, b.left, b.right],\n ]) {\n if (\n ua === ub &&\n Math.min(va2, vb2) - Math.max(va1, vb1) >\n Math.max(va2 - va1, vb2 - vb1) / 2\n ) {\n return true;\n }\n }\n return false;\n}\n\n/**\n * Assign Baseplates and Paths to Plans.\n */\nexport default function negotiate(\n cavern: TriangulatedCavern,\n): PartialPlannedCavern {\n const bpIsInBigCave: true[] = [];\n const queue: Pick, \"kind\" | \"path\">[][] = [[], [], []];\n\n const paths: Path[] = [\n ...cavern.paths.filter((path) => path.kind === \"spanning\"),\n ...cavern.paths.filter((path) => path.kind === \"auxiliary\"),\n ];\n\n paths.forEach((path) => {\n if (path.baseplates.length === 2) {\n const [a, b] = path.baseplates;\n if (\n !bpIsInBigCave[a.id] &&\n !bpIsInBigCave[b.id] &&\n (isMergeable(a, b) || isMergeable(b, a))\n ) {\n bpIsInBigCave[a.id] = true;\n bpIsInBigCave[b.id] = true;\n queue[2].push({ path, kind: \"cave\" });\n return;\n }\n }\n queue[0].push({ path, kind: \"hall\" });\n });\n\n queue[1] = cavern.baseplates\n .filter((bp) => bp.kind === \"cave\" && !bpIsInBigCave[bp.id])\n .map((bp) => ({ path: new Path(-1, \"single\", [bp]), kind: \"cave\" }));\n\n const plans: NegotiatedPlan[] = queue\n .flatMap((a) => a)\n .map((plan, id) => ({ ...plan, id }));\n\n return { context: cavern.context, dice: cavern.dice, plans };\n}\n","import { ARCHITECTS, AnyMetadata } from \"../../architects\";\nimport { Curve } from \"../../common\";\nimport { CollapseUnion } from \"../../common/utils\";\nimport { Architect, BaseMetadata } from \"../../models/architect\";\nimport { PartialPlannedCavern } from \"./00_negotiate\";\nimport { FloodedPlan } from \"./02_flood\";\n\ntype SortedPlan = {\n plan: FloodedPlan & { architect?: Architect };\n hops: readonly number[];\n index: number;\n};\nexport type ArchitectedPlan = FloodedPlan & {\n readonly hops: readonly number[];\n /** The architect to use to build out the plan. */\n readonly architect: Architect;\n readonly metadata: T;\n readonly crystalRichness: number;\n readonly oreRichness: number;\n readonly monsterSpawnRate: number;\n readonly monsterWaveSize: number;\n};\nexport type EstablishedPlan = ArchitectedPlan & {\n /** How blobby the pearl should be. */\n readonly baroqueness: number;\n /** How many crystals the Plan will add. */\n readonly crystals: number;\n /** How many ore the Plan will add. */\n readonly ore: number;\n};\n\ntype CurveProps = { hops: number; order: number };\n\nfunction curved(curve: Curve, props: CurveProps): number {\n return curve.base + curve.hops * props.hops + curve.order * props.order;\n}\n\nfunction encourageDisable>(\n architects: readonly T[],\n cavern: PartialPlannedCavern,\n): T[] {\n return architects\n .filter((a) => cavern.context.architects?.[a.name] !== \"disable\")\n .map((a) => {\n if (cavern.context.architects?.[a.name] === \"encourage\") {\n const r = { ...a };\n r.caveBid = (args) => !!a.caveBid?.(args) && 999999;\n r.hallBid = (args) => !!a.hallBid?.(args) && 999999;\n r.spawnBid = (args) => !!a.spawnBid?.(args) && 999999;\n return r;\n }\n return a;\n });\n}\n\nexport default function establish(\n cavern: PartialPlannedCavern,\n): PartialPlannedCavern> {\n const architects = encourageDisable(ARCHITECTS, cavern);\n\n // Choose a spawn and an architect for that spawn.\n const spawn = cavern.dice.pickSpawn.weightedChoice(\n architects\n .filter((architect) => architect.spawnBid)\n .flatMap((architect) =>\n cavern.plans\n .filter((p) => p.kind === \"cave\")\n .map((plan) => ({\n item: { ...plan, architect },\n bid: architect.spawnBid!({ cavern, plan }) || 0,\n })),\n ),\n );\n\n // Sort the plans in a breadth-first search order, starting from spawn and\n // annotating each with the index and the hops it takes to get here from spawn.\n function sortPlans(): SortedPlan[] {\n const isQueued: true[] = [];\n isQueued[spawn.id] = true;\n const queue: { plan: FloodedPlan; hops: readonly number[] }[] = [\n { plan: spawn, hops: [] },\n ];\n const result: SortedPlan[] = [];\n\n for (let index = 0; queue.length > 0; index++) {\n const { plan, hops } = queue.shift()!;\n\n const neighbors = plan.intersects\n .map((b, id) => (b ? id : -1))\n .filter(\n (id) =>\n id >= 0 && !isQueued[id] && cavern.plans[id].kind !== plan.kind,\n );\n neighbors.forEach((id) => (isQueued[id] = true));\n queue.push(\n ...neighbors.map((id) => ({\n plan: cavern.plans[id],\n hops: [...hops, plan.id],\n })),\n );\n result.push({ plan, hops, index });\n }\n return result;\n }\n const inOrder = sortPlans();\n\n const plans: CollapseUnion>[] =\n cavern.plans.slice();\n let totalCrystals = 0;\n\n const maxIndex = inOrder.length - 1;\n const maxHops = inOrder[inOrder.length - 1].hops.length;\n function doArchitect({\n plan,\n hops,\n index,\n }: SortedPlan): ArchitectedPlan {\n const props = { hops: hops.length / maxHops, order: index / maxIndex };\n const architect =\n plan.architect ||\n cavern.dice.pickArchitect(plan.id).weightedChoice(\n architects.map((architect) => {\n const bid =\n plan.kind === \"cave\" ? architect.caveBid : architect.hallBid;\n return {\n item: architect,\n bid: bid?.({ cavern, plan, plans, hops, totalCrystals }) || 0,\n };\n }),\n );\n const metadata = architect.prime({ cavern, plan });\n const crystalRichness = curved(\n plan.kind === \"cave\"\n ? cavern.context.caveCrystalRichness\n : cavern.context.hallCrystalRichness,\n props,\n );\n const oreRichness = curved(\n plan.kind === \"cave\"\n ? cavern.context.caveOreRichness\n : cavern.context.hallOreRichness,\n props,\n );\n const monsterSpawnRate = curved(cavern.context.monsterSpawnRate, props);\n const monsterWaveSize = curved(cavern.context.monsterWaveSize, props);\n return {\n ...plan,\n hops,\n architect,\n metadata,\n crystalRichness,\n oreRichness,\n monsterSpawnRate,\n monsterWaveSize,\n };\n }\n function doEstablish(plan: ArchitectedPlan) {\n const args = { cavern, plan, totalCrystals };\n const baroqueness = plan.architect.baroqueness(args);\n const crystals = Math.round(\n plan.architect.crystalsToPlace(args) +\n plan.architect.crystalsFromMetadata(plan.metadata),\n );\n totalCrystals += crystals;\n const ore = Math.round(plan.architect.ore(args));\n const established: EstablishedPlan = {\n ...plan,\n baroqueness,\n crystals,\n ore,\n };\n plans[plan.id] = established;\n }\n inOrder.forEach((plan) => doEstablish(doArchitect(plan)));\n\n return { ...cavern, plans: plans as EstablishedPlan[] };\n}\n","import { AnyMetadata } from \"../../architects\";\nimport { PseudorandomStream } from \"../../common\";\nimport { NSEW, Point, plotLine } from \"../../common/geometry\";\nimport { MutableGrid } from \"../../common/grid\";\nimport { pairEach } from \"../../common/utils\";\nimport { BaseMetadata } from \"../../models/architect\";\nimport { PartialPlannedCavern } from \"./00_negotiate\";\nimport { EstablishedPlan } from \"./03_establish\";\n\ntype Layer = readonly Point[];\nexport type Pearl = readonly Layer[];\n\nexport type PearledPlan = EstablishedPlan & {\n /**\n * A pearl is an array of layers (from innermost to out).\n * Each layer contains an array of [x, y] coordinates in that layer.\n * innerPearl[layer][sequence] = [x, y]\n */\n readonly innerPearl: Pearl;\n readonly outerPearl: Pearl;\n};\n\nexport class LayerGrid extends MutableGrid {\n atLayer(layer: number): Point[] {\n const result: Point[] = [];\n this.forEach((ly, x, y) => {\n if (ly === layer) {\n result.push([x, y]);\n }\n });\n return result;\n }\n\n set(x: number, y: number, layer: number) {\n const has = this.get(x, y);\n if (has === undefined || layer < has) {\n super.set(x, y, layer);\n }\n }\n}\n\nexport function hallNucleus(grid: LayerGrid, plan: EstablishedPlan) {\n pairEach(plan.path.baseplates, (a, b) => {\n for (const [x, y] of plotLine(a.center, b.center)) {\n grid.set(x, y, 0);\n }\n });\n}\n\nexport function caveNucleus(grid: LayerGrid, plan: EstablishedPlan) {\n // The cave nucleus is less straightforward.\n\n plan.path.baseplates.forEach((bp) => {\n const layer = plan.pearlRadius - bp.pearlRadius;\n // The offset is half the size of the pearl in that direction.\n // This creates a dot or rectangle depending on how oblong the baseplate is.\n const ox = Math.min(bp.pearlRadius, (bp.width - 1) >> 1);\n const oy = Math.min(bp.pearlRadius, (bp.height - 1) >> 1);\n for (let x = bp.left + ox; x < bp.right - ox; x++) {\n for (let y = bp.top + oy; y < bp.bottom - oy; y++) {\n grid.set(x, y, layer);\n }\n }\n });\n\n pairEach(plan.path.baseplates, (a, b) => {\n const layer = plan.pearlRadius - Math.min(a.pearlRadius, b.pearlRadius);\n for (const [x, y] of plotLine(a.center, b.center)) {\n grid.set(x, y, layer);\n }\n });\n}\n\nexport function trail(\n grid: LayerGrid,\n rng: PseudorandomStream,\n baroqueness: number,\n layer: number,\n cp: { x: number; y: number; vx: number; vy: number } | undefined,\n): Point[] {\n const result: Point[] = [];\n while (cp) {\n const { x, y, vx, vy } = cp;\n\n // Push the point to both the grid and result\n grid.set(x, y, layer);\n result.push([x, y]);\n\n // As it turns right, (vx, vy) cycles between:\n // (1, 0) -> (0, 1) -> (-1, 0) -> (0, -1) -> ...\n // Try each of these possible movements\n // prettier-ignore\n const nextPoints = [\n {ox: 0, oy: 0, vx: -vy, vy: vx}, // Right turn\n {ox: -vy, oy: vx, vx: vx, vy: vy}, // Straight, but drift right\n {ox: 0, oy: 0, vx: vx, vy: vy}, // Straight\n {ox: vy, oy: -vx, vx: vx, vy: vy}, // Straight, but drift left\n {ox: 0, oy: 0, vx: vy, vy: -vx}, // Left turn\n ].map((np) => ({...np, x: x + np.ox + np.vx, y: y + np.oy + np.vy}))\n\n const halt = nextPoints.some(({ x, y }) => {\n // First, determine if the trail has looped back around on itself.\n // This can mean that it either went all the way around to its start\n // or that it has escaped and is forming a loop on this loose tendril.\n if ((grid.get(x, y) ?? -1) < layer) {\n // This point is unoccupied or on an earlier layer. Ignore it.\n return false;\n }\n for (let i = result.length - 2; i > Math.max(result.length - 4, 0); i--) {\n const [rx, ry] = result[i];\n if (rx === x && ry === y) {\n // This point was visited recently. Ignore it.\n return false;\n }\n }\n // This point was on this layer but not visited recently. Halt.\n return true;\n });\n if (halt) {\n break;\n }\n\n cp = nextPoints.find(({ x, y }) => {\n // Next, try to find an acceptable next point to visit.\n // The point must not be already visited.\n if ((grid.get(x, y) ?? -1) >= 0) {\n return false;\n }\n // The RNG may veto.\n if (baroqueness > 0 && rng.chance(baroqueness)) {\n return false;\n }\n // Otherwise, This is the next point to visit.\n return true;\n });\n }\n return result;\n}\n\nfunction addLayer(\n grid: LayerGrid,\n rng: PseudorandomStream,\n baroqueness: number,\n layer: number,\n): Point[] {\n return grid.atLayer(layer - 1).flatMap(([x, y]) =>\n NSEW.flatMap(([ox, oy]) => {\n if ((grid.get(x + ox, y + oy) ?? -1) >= 0) {\n return [];\n } else {\n return trail(grid, rng, baroqueness, layer, {\n x: x + ox,\n y: y + oy,\n vx: -oy,\n vy: ox,\n });\n }\n }),\n );\n}\n\nexport default function pearl(\n cavern: PartialPlannedCavern>,\n): PartialPlannedCavern> {\n const plans = cavern.plans.map((plan) => {\n const rng = cavern.dice.pearl(plan.id);\n const grid: LayerGrid = new LayerGrid();\n (plan.kind === \"cave\" ? caveNucleus : hallNucleus)(grid, plan);\n const innerPearl: Point[][] = [grid.map((_, x, y) => [x, y])];\n const outerPearl: Point[][] = [];\n const pearlRadius = plan.architect.roughExtent(plan);\n for (let i = 1; i < pearlRadius; i++) {\n innerPearl.push(addLayer(grid, rng, plan.baroqueness, i));\n }\n if (pearlRadius > 0) {\n innerPearl.push(addLayer(grid, rng, 0, pearlRadius));\n }\n for (let i = 1; i < 4; i++) {\n outerPearl.push(addLayer(grid, rng, 0, i + pearlRadius));\n }\n return { ...plan, innerPearl, outerPearl };\n });\n return { ...cavern, plans };\n}\n","import { tf } from \"../../common/transform\";\nimport negotiate from \"./00_negotiate\";\nimport measure from \"./01_measure\";\nimport flood from \"./02_flood\";\nimport establish from \"./03_establish\";\nimport pearl from \"./04_pearl\";\n\nexport const PLANNING_TF = tf(negotiate)\n .then(measure)\n .then(flood)\n .then(establish)\n .then(pearl);\n","import { PartialPlannedCavern } from \"./00_negotiate\";\nimport { NegotiatedPlan } from \"./00_negotiate\";\n\nexport type MeasuredPlan = NegotiatedPlan & {\n /**\n * If intersects[id] is true, this plan intersects the plan with the given id.\n * Plans do not intersect themselves.\n */\n readonly intersects: readonly true[];\n /** How many layers of different tiles can be added to this Plan? */\n readonly pearlRadius: number;\n readonly perimeter: number;\n};\n\nexport default function measure(\n cavern: PartialPlannedCavern,\n): PartialPlannedCavern {\n const planIdsByBp: number[][] = [];\n cavern.plans.forEach((plan) => {\n plan.path.baseplates.forEach((bp) =>\n (planIdsByBp[bp.id] ||= []).push(plan.id),\n );\n });\n const plans = cavern.plans.map((plan) => {\n const intersects: true[] = [];\n plan.path.baseplates\n .flatMap((bp) => planIdsByBp[bp.id])\n .filter((plid) => plid !== plan.id)\n .forEach((plid) => (intersects[plid] = true));\n\n const pearlRadius = (plan.kind === \"cave\" ? Math.max : Math.min)(\n ...plan.path.baseplates.map((bp) => bp.pearlRadius),\n );\n\n /*\n * For caves, estimate the perimeter to be half the circumference of each\n * end plus twice the length of the path:\n * (2*pi*a.pr) / 2 + (2*pi*b.pr) / 2 + pd * 2\n * pi * (a.pr + b.pr) + 2 * pd\n *\n * For halls, it's just double the length of the hall that isn't part of\n * some cave.\n *\n * This doesn't need to be super accurate because:\n * 1. It's only used as a multiplier for values from context, not any\n * actually important geometry.\n * 2. Later steps are going to make blobby shapes anyway.\n */\n const perimeter = Math.round(\n plan.kind === \"cave\"\n ? Math.PI *\n (Math.min(pearlRadius, plan.path.origin.pearlRadius) +\n Math.min(pearlRadius, plan.path.destination.pearlRadius)) +\n plan.path.snakeDistance * 2\n : 2 * plan.path.exclusiveSnakeDistance,\n );\n return { ...plan, intersects, pearlRadius, perimeter };\n });\n return { ...cavern, plans };\n}\n","import { PartialPlannedCavern } from \"./00_negotiate\";\nimport { FluidType, Tile } from \"../../models/tiles\";\nimport { MeasuredPlan } from \"./01_measure\";\nimport { PseudorandomStream } from \"../../common\";\nimport { pairMap } from \"../../common/utils\";\n\nexport type FloodedPlan = MeasuredPlan & {\n /** What kind of fluid is present in this plan. */\n readonly fluid: FluidType;\n /** Should this plan contain erosion? */\n readonly hasErosion: boolean;\n};\n\ntype Lake = {\n readonly fluid: FluidType;\n readonly skipChance: number;\n remaining: number;\n stack: MeasuredPlan[];\n};\n\nfunction getLakes(\n cavern: PartialPlannedCavern,\n rng: PseudorandomStream,\n): readonly Lake[] {\n const plans = rng.shuffle(\n cavern.plans.filter((plan) => plan.kind === \"cave\"),\n );\n\n const h = (\n fluid: FluidType,\n planCount: number,\n lakeCount: number,\n skipChance: number,\n ) => {\n if (planCount < 1) {\n return [];\n }\n const stops = rng\n .shuffle(new Array(planCount - 1).fill(0).map((_, i) => i + 1))\n .filter((_, i) => i < lakeCount - 1)\n .sort();\n return pairMap([0, ...stops, planCount], (a, b) => ({\n fluid,\n remaining: b - a,\n skipChance,\n stack: [plans.pop()!],\n }));\n };\n\n return [\n ...h(Tile.WATER, cavern.context.waterPlans, cavern.context.waterLakes, 0.2),\n ...h(Tile.LAVA, cavern.context.lavaPlans, cavern.context.lavaLakes, 0.2),\n ];\n}\n\nexport default function flood(\n cavern: PartialPlannedCavern,\n): PartialPlannedCavern {\n const rng = cavern.dice.flood;\n const lakes = getLakes(cavern, rng);\n const fluids: (FluidType | undefined)[] = [];\n const claims: (Lake | \"none\" | \"erosion\" | undefined)[] = [];\n for (const lake of lakes) {\n claims[lake.stack[0].id] = lake;\n }\n let working = true;\n while (working) {\n working = false;\n for (const lake of lakes) {\n if (lake.remaining <= 0 || lake.stack.length === 0) {\n continue;\n }\n const plan = lake.stack.pop()!;\n if (claims[plan.id] !== lake) {\n continue;\n }\n working = true;\n if (lake.stack.length > 0 && rng.chance(lake.skipChance)) {\n lake.stack.unshift(plan);\n continue;\n }\n lake.remaining--;\n fluids[plan.id] = lake.fluid;\n plan.intersects\n .map((_, i) => cavern.plans[i])\n .filter((p) => p.kind !== plan.kind)\n .forEach((p) => {\n if (claims[p.id]) {\n if (claims[p.id] !== lake) {\n claims[p.id] = \"none\";\n }\n } else {\n claims[p.id] = lake;\n lake.stack.push(p);\n }\n });\n }\n }\n const erosion: true[] = [];\n const erodeQueue: MeasuredPlan[] = [\n ...lakes.flatMap((lake) => (lake.fluid === Tile.LAVA ? lake.stack : [])),\n ...fluids.flatMap((f, i) => (f === Tile.LAVA ? [cavern.plans[i]] : [])),\n ];\n for (\n let remaining = cavern.context.erosionPlans;\n remaining >= 0 && erodeQueue.length > 0;\n remaining--\n ) {\n const [plan] = erodeQueue.splice(\n rng.uniformInt({ min: 0, max: erodeQueue.length }),\n 1,\n );\n erosion[plan.id] = true;\n plan.intersects\n .map((_, i) => cavern.plans[i])\n .filter((p) => p.kind !== plan.kind)\n .forEach((p) => {\n if (!claims[p.id]) {\n claims[p.id] = \"erosion\";\n erodeQueue.push(p);\n }\n });\n }\n\n const plans = cavern.plans.map((plan) => ({\n ...plan,\n fluid: fluids[plan.id] ?? null,\n hasErosion: !!erosion[plan.id],\n }));\n return { ...cavern, plans };\n}\n","import { Mutable } from \"../common\";\nimport { NEIGHBORS8 } from \"../common/geometry\";\nimport { Grid, MutableGrid } from \"../common/grid\";\nimport { Tile } from \"./tiles\";\n\nexport type DiscoveryZone = {\n readonly id: number;\n readonly openOnSpawn: boolean;\n};\n\nexport function getDiscoveryZones(tiles: Grid) {\n const result = new MutableGrid>();\n const queue: { x: number; y: number; zone: Mutable | null }[] =\n tiles.map((_, x, y) => ({ x, y, zone: null }));\n let nextZone = 0;\n while (queue.length > 0) {\n let { x, y, zone } = queue.shift()!;\n if (result.get(x, y) === undefined && tiles.get(x, y)?.isWall === false) {\n if (!zone) {\n zone = { id: nextZone++, openOnSpawn: false };\n }\n result.set(x, y, zone);\n const neighbors = NEIGHBORS8.map(([ox, oy]) => ({\n x: x + ox,\n y: y + oy,\n zone,\n }));\n queue.unshift(...neighbors);\n }\n }\n return result;\n}\n","import {\n EAST,\n NORTH,\n NORTH_EAST,\n NORTH_WEST,\n NSEW,\n SOUTH,\n SOUTH_EAST,\n SOUTH_WEST,\n WEST,\n} from \"../../common/geometry\";\nimport { Grid } from \"../../common/grid\";\nimport { Tile } from \"../../models/tiles\";\nimport { RoughPlasticCavern } from \"./01_rough\";\n\nconst HOLE_MAP = [\n [...NORTH, 2],\n [...NORTH_EAST, 1],\n [...EAST, 2],\n [...SOUTH_EAST, 1],\n [...SOUTH, 2],\n [...SOUTH_WEST, 1],\n [...WEST, 2],\n [...NORTH_WEST, 1],\n] as const;\n\nfunction isHole(tiles: Grid, x: number, y: number) {\n let r = 0;\n for (let i = 0; i < HOLE_MAP.length; i++) {\n const [ox, oy, v] = HOLE_MAP[i];\n if (tiles.get(x + ox, y + oy)?.isWall === false) {\n r += v;\n }\n if (r >= 2) {\n return false;\n }\n }\n return true;\n}\n\nexport default function grout(cavern: RoughPlasticCavern): RoughPlasticCavern {\n const tiles = cavern.tiles.copy();\n cavern.tiles.forEach((t, x, y) => {\n if (\n // If the point is surrounded by hard or solid rock, make it hard rock\n t !== Tile.SOLID_ROCK &&\n !NSEW.some(([ox, oy]) => {\n const ot = tiles.get(x + ox, y + oy);\n return ot && ot !== Tile.HARD_ROCK && ot !== Tile.SOLID_ROCK;\n })\n ) {\n tiles.set(x, y, Tile.HARD_ROCK);\n } else if (\n // If the point is not wall and should be, make it dirt\n !t.isWall &&\n isHole(tiles, x, y)\n ) {\n tiles.set(x, y, Tile.DIRT);\n } else if (\n // If the point is fluid and not connected to other fluid, make it floor\n t.isFluid &&\n !NSEW.some(([ox, oy]) => tiles.get(x + ox, y + oy)?.isFluid)\n ) {\n tiles.set(x, y, Tile.FLOOR);\n }\n });\n return { ...cavern, tiles };\n}\n","import { NSEW, Point } from \"../../common/geometry\";\nimport { Tile } from \"../../models/tiles\";\nimport { FinePlasticCavern } from \"./05_fine\";\n\nfunction isInPlay(voidNeighbors: Point[]) {\n if (voidNeighbors.length === 2) {\n const [a, b] = voidNeighbors;\n return a[0] === b[0] || a[1] === b[1];\n }\n return voidNeighbors.length < 2;\n}\n\nexport default function annex(cavern: FinePlasticCavern): FinePlasticCavern {\n const tiles = cavern.tiles.copy();\n const queue = cavern.tiles.flatMap((_, x, y) =>\n NSEW.map(([ox, oy]) => [x + ox, y + oy] as Point),\n );\n while (queue.length) {\n const [x, y] = queue.shift()!;\n if (tiles.get(x, y)) {\n continue;\n }\n const voidNeighbors = NSEW.map(\n ([ox, oy]) => [x + ox, y + oy] as Point,\n ).filter((pos) => !tiles.get(...pos));\n if (isInPlay(voidNeighbors)) {\n // This tile is potentially destroyable.\n tiles.set(x, y, Tile.SOLID_ROCK);\n queue.push(...voidNeighbors);\n }\n }\n return { ...cavern, tiles };\n}\n","import { tf } from \"../../common/transform\";\nimport foundation from \"./00_foundation\";\nimport rough from \"./01_rough\";\nimport brace from \"./02_brace\";\nimport grout from \"./03_grout\";\nimport sand from \"./04_sand\";\nimport fine from \"./05_fine\";\nimport annex from \"./06_annex\";\n\nexport const MASONRY_TF = tf(foundation)\n .then(rough)\n .then(brace)\n .then(grout)\n .then(sand)\n .then(fine)\n .then(annex);\n","import { MutableGrid, Grid } from \"../../common/grid\";\nimport { PlannedCavern } from \"../../models/cavern\";\n\nexport type FoundationPlasticCavern = PlannedCavern & {\n readonly pearlInnerDex: Grid;\n readonly pearlOuterDex: Grid;\n};\n\nexport default function foundation(\n cavern: PlannedCavern,\n): FoundationPlasticCavern {\n const pearlInnerDex = new MutableGrid();\n const pearlOuterDex = new MutableGrid();\n cavern.plans.forEach((plan) => {\n plan.innerPearl.forEach((layer, i) =>\n layer.forEach(([x, y]) => {\n const v = pearlInnerDex.get(x, y) || [];\n v[plan.id] = i;\n pearlInnerDex.set(x, y, v);\n }),\n );\n plan.outerPearl.forEach((layer, i) =>\n layer.forEach(([x, y]) => {\n const v = pearlOuterDex.get(x, y) || [];\n v[plan.id] = i;\n pearlOuterDex.set(x, y, v);\n }),\n );\n });\n return { ...cavern, pearlInnerDex, pearlOuterDex };\n}\n","import { FoundationPlasticCavern } from \"./00_foundation\";\nimport { MutableGrid, Grid } from \"../../common/grid\";\nimport { RoughTile } from \"../../models/tiles\";\n\nexport type RoughPlasticCavern = FoundationPlasticCavern & {\n readonly tiles: Grid;\n};\n\nexport default function rough(\n cavern: FoundationPlasticCavern,\n): RoughPlasticCavern {\n const tiles = new MutableGrid();\n cavern.plans.forEach((plan) => {\n plan.architect.rough({ cavern, plan, tiles });\n });\n return { ...cavern, tiles };\n}\n","import { MutableGrid } from \"../../common/grid\";\nimport { RoughPlasticCavern } from \"./01_rough\";\nimport { Tile } from \"../../models/tiles\";\nimport { Cardinal4, NSEW } from \"../../common/geometry\";\nimport { getDiscoveryZones } from \"../../models/discovery_zone\";\n\nexport default function brace(cavern: RoughPlasticCavern): RoughPlasticCavern {\n const rng = cavern.dice.brace;\n const tiles = cavern.tiles.copy();\n const discoveryZones = getDiscoveryZones(tiles);\n const visited: MutableGrid = new MutableGrid();\n const queue: { x: number; y: number; facing: Cardinal4 | null }[] =\n tiles.flatMap((_, x, y) => [\n { x, y, facing: null },\n ...NSEW.map((f) => ({ x: x + f[0], y: y + f[1], facing: null })),\n ]);\n while (queue.length) {\n const { x, y, facing } = queue.pop()!;\n if (!visited.get(x, y) && (tiles.get(x, y)?.isWall ?? true)) {\n const neighbors = NSEW.map((f) => ({\n x: x + f[0],\n y: y + f[1],\n facing: f,\n }));\n const wallNeighbors = neighbors.filter(\n ({ x, y }) => tiles.get(x, y)?.isWall ?? true,\n );\n\n if (!wallNeighbors.length) {\n const n = rng.uniformChoice(neighbors);\n tiles.set(n.x, n.y, Tile.DIRT);\n wallNeighbors.push(n);\n }\n\n const needsBrace = () => {\n if (wallNeighbors.length === 2) {\n const [a, b] = wallNeighbors;\n return (\n (a.x === b.x || a.y === b.y) &&\n discoveryZones.get(a.x, a.y) === discoveryZones.get(b.x, b.y)\n );\n }\n return wallNeighbors.length < 2;\n };\n\n if (needsBrace()) {\n const [ox, oy] = facing || wallNeighbors[0].facing.map((v) => -v);\n const n = { x: x - oy, y: y + ox, facing: [-oy, ox] as Cardinal4 };\n tiles.set(n.x, n.y, Tile.DIRT);\n wallNeighbors.push(n);\n }\n\n visited.set(x, y, true);\n queue.push(...wallNeighbors.filter(({ x, y }) => tiles.get(x, y)));\n }\n }\n return { ...cavern, tiles };\n}\n","import { NSEW } from \"../../common/geometry\";\nimport { Tile } from \"../../models/tiles\";\nimport { RoughPlasticCavern } from \"./01_rough\";\n\nexport default function sand(cavern: RoughPlasticCavern): RoughPlasticCavern {\n const tiles = cavern.tiles.copy();\n cavern.tiles.forEach((t, x, y) => {\n if (\n // Shave down any hard rock that doesn't border other hard rock\n t === Tile.HARD_ROCK &&\n !NSEW.some(([ox, oy]) => {\n const ot = tiles.get(x + ox, y + oy);\n return !ot || ot === Tile.HARD_ROCK || ot === Tile.SOLID_ROCK;\n })\n ) {\n tiles.set(x, y, Tile.LOOSE_ROCK);\n }\n });\n return { ...cavern, tiles };\n}\n","import { RoughPlasticCavern } from \"./01_rough\";\nimport { MutableGrid, Grid } from \"../../common/grid\";\nimport { Tile } from \"../../models/tiles\";\nimport { Building } from \"../../models/building\";\nimport { Plan } from \"../../models/plan\";\nimport { EntityPosition } from \"../../models/position\";\nimport { AnyMetadata } from \"../../architects\";\n\nexport type FinePlasticCavern = Omit & {\n readonly tiles: Grid;\n readonly crystals: Grid;\n readonly ore: Grid;\n readonly buildings: readonly Building[];\n readonly openCaveFlags: Grid;\n readonly cameraPosition: EntityPosition | undefined;\n};\n\nexport default function fine(cavern: RoughPlasticCavern): FinePlasticCavern {\n let cameraPosition: EntityPosition | undefined = undefined;\n const setCameraPosition = (pos: EntityPosition) => (cameraPosition = pos);\n const diorama = {\n cavern,\n tiles: cavern.tiles.copy(),\n crystals: new MutableGrid(),\n ore: new MutableGrid(),\n buildings: [] as Building[],\n openCaveFlags: new MutableGrid(),\n };\n cavern.plans.forEach((plan: Plan) => {\n const args = { ...diorama, setCameraPosition, plan };\n plan.architect.placeRechargeSeam(args);\n plan.architect.placeBuildings(args);\n plan.architect.placeCrystals(args);\n plan.architect.placeOre(args);\n plan.architect.placeSlugHoles(args);\n });\n return { ...cavern, ...diorama, cameraPosition };\n}\n","import { Point } from \"../common/geometry\";\nimport { Grid } from \"../common/grid\";\nimport { EntityPosition, serializePosition } from \"./position\";\n\nexport type Unique =\n | \"OFFICER\"\n | \"Axle\"\n | \"Bandit\"\n | \"Chief\"\n | \"Docs\"\n | \"Jet\"\n | \"Sparks\";\n\nexport type Loadout =\n | \"Drill\"\n | \"JobExplosivesExpert\"\n | \"JobDriver\"\n | \"JobPilot\"\n | \"JobEngineer\"\n | \"JobGeologist\"\n | \"JobSailor\";\n\nexport type Miner = EntityPosition & {\n readonly id: number;\n readonly essential: boolean;\n readonly level: 1 | 2 | 3 | 4 | 5;\n readonly loadout: readonly Loadout[];\n readonly unique: Unique | null;\n};\n\nexport class MinerFactory {\n private id: number = 0;\n create(\n args: EntityPosition &\n Partial>,\n ): Miner {\n return {\n essential: false,\n level: 1,\n loadout: [\"Drill\"],\n unique: null,\n ...args,\n id: this.id++,\n };\n }\n}\n\nexport function serializeMiner(\n miner: Miner,\n offset: Point,\n heightMap: Grid,\n) {\n return [\n `ID=${miner.id.toFixed()}${miner.unique ? `/${miner.unique}` : \"\"}`,\n serializePosition(miner, offset, heightMap, 0, \"entity\"),\n [...miner.loadout, ...new Array(miner.level - 1).fill(\"Level\")]\n .map((l) => `${l}/`)\n .join(\"\"),\n miner.essential && \"Essential=true\",\n ]\n .filter((n) => n)\n .join(\",\");\n}\n","import { NSEW } from \"../../common/geometry\";\nimport { Grid, MutableGrid } from \"../../common/grid\";\nimport { DiscoveredCavern } from \"./01_discover\";\n\nconst FENCES = [\n [-1, -1],\n [-1, 0],\n [0, -1],\n [0, 0],\n] as const;\n\nexport type StrataformedCavern = DiscoveredCavern & {\n readonly height: Grid;\n};\n\n/**\n * Choose a random target height for each plan.\n */\nfunction getPlanHeight(cavern: DiscoveredCavern): readonly (number | null)[] {\n const heightTargetRange = {\n min: -cavern.context.heightTargetRange,\n max: cavern.context.heightTargetRange,\n };\n\n const queued: true[] = [];\n const result: number[] = [];\n const rng = cavern.dice.height;\n\n const queue = cavern.plans.filter((plan) => !plan.hops.length);\n queue.forEach((plan) => (queued[plan.id] = true));\n while (queue.length) {\n const plan = queue.shift()!;\n const h =\n result[plan.id] ??\n (plan.kind === \"cave\" ? rng.uniformInt(heightTargetRange) : null);\n result[plan.id] = h;\n plan.intersects.forEach((v, i) => {\n const p = cavern.plans[i];\n if (queued[i] || p.kind === plan.kind) {\n return;\n }\n if (plan.fluid || p.fluid) {\n result[i] = h;\n }\n queued[i] = true;\n queue.push(p);\n });\n }\n return result;\n}\n\nfunction getTileHeight(cavern: DiscoveredCavern): Grid {\n const planHeight = getPlanHeight(cavern);\n const fluidOffset = cavern.context.heightTargetRange / -5;\n const result = new MutableGrid();\n for (let x = cavern.left; x < cavern.right; x++) {\n for (let y = cavern.top; y < cavern.bottom; y++) {\n let sum = 0;\n let count = 0;\n let isFluid = !!cavern.tiles.get(x, y)?.isFluid;\n cavern.pearlInnerDex.get(x, y)?.forEach((_, i) => {\n const h = planHeight[i];\n if (h != null) {\n sum += h;\n count++;\n }\n isFluid ||= cavern.plans[i].hasErosion;\n });\n if (count) {\n result.set(x, y, Math.round(sum / count) + (isFluid ? fluidOffset : 0));\n }\n }\n }\n return result;\n}\n\nfunction getCornerHeight(cavern: DiscoveredCavern, tileHeight: Grid) {\n const result = new MutableGrid();\n for (let x = cavern.left; x <= cavern.right; x++) {\n for (let y = cavern.top; y <= cavern.bottom; y++) {\n let sum = 0;\n let count = 0;\n FENCES.forEach(([ox, oy]) => {\n const h = tileHeight.get(x + ox, y + oy);\n if (h !== undefined) {\n sum += h;\n count++;\n }\n });\n if (count) {\n result.set(x, y, sum / count);\n }\n }\n }\n return result;\n}\n\nfunction spread(cavern: DiscoveredCavern, height: Grid) {\n const result = new MutableGrid();\n for (let x = cavern.left + 1; x < cavern.right; x++) {\n for (let y = cavern.top + 1; y < cavern.bottom; y++) {\n const ht = height.get(x, y);\n if (ht) {\n result.set(x, y, ht);\n } else {\n let sum = 0;\n let count = 0;\n NSEW.forEach(([ox, oy]) => {\n const h = height.get(x + ox, y + oy);\n if (h !== undefined) {\n sum += h;\n count++;\n }\n });\n if (count) {\n result.set(x, y, sum / count);\n }\n }\n }\n }\n return result;\n}\n\nexport default function strataform(\n cavern: DiscoveredCavern,\n): StrataformedCavern {\n if (cavern.context.heightTargetRange <= 0) {\n return { ...cavern, height: new MutableGrid() };\n }\n let height = getTileHeight(cavern);\n height = getCornerHeight(cavern, height);\n for (let i = 0; i < cavern.context.stratascosity; i++) {\n height = spread(cavern, height);\n }\n\n return { ...cavern, height };\n}\n","import { Grid, MutableGrid } from \"../../../common/grid\";\nimport { StrataformedCavern } from \"../02_strataform\";\n\ntype Edge = {\n readonly to: readonly [number, number];\n readonly ascent: number;\n readonly descent: number;\n};\n\ntype EdgeData = {\n readonly x1: number;\n readonly y1: number;\n readonly x2: number;\n readonly y2: number;\n forward: number;\n backward: number;\n};\n\nclass EdgeMap {\n private readonly data = new Map<\n `${number},${number},${number},${number}`,\n EdgeData\n >();\n\n get(\n x1: number,\n y1: number,\n x2: number,\n y2: number,\n ): { ascent: number; descent: number } | undefined {\n if (x1 < x2 || (x1 === x2 && y1 <= y2)) {\n const r = this.data.get(`${x1},${y1},${x2},${y2}`);\n return r && { ascent: r.forward, descent: r.backward };\n }\n const r = this.data.get(`${x2},${y2},${x1},${y1}`);\n return r && { ascent: r.backward, descent: r.forward };\n }\n set(\n x1: number,\n y1: number,\n x2: number,\n y2: number,\n ascent: number,\n descent: number,\n ) {\n if (x1 === x2 && y1 === y2) {\n return;\n }\n if (x1 < x2 || (x1 === x2 && y1 < y2)) {\n const r = this.data.get(`${x1},${y1},${x2},${y2}`);\n if (r) {\n r.forward = Math.min(r.forward, ascent);\n r.backward = Math.min(r.backward, descent);\n } else {\n this.data.set(`${x1},${y1},${x2},${y2}`, {\n x1,\n y1,\n x2,\n y2,\n forward: ascent,\n backward: descent,\n });\n }\n } else {\n const r = this.data.get(`${x2},${y2},${x1},${y1}`);\n if (r) {\n r.forward = Math.min(r.forward, descent);\n r.backward = Math.min(r.backward, ascent);\n } else {\n this.data.set(`${x2},${y2},${x1},${y1}`, {\n x1: x2,\n y1: y2,\n x2: x1,\n y2: y1,\n forward: descent,\n backward: ascent,\n });\n }\n }\n }\n edges(): Grid {\n const result = new MutableGrid();\n function get(x: number, y: number) {\n let r = result.get(x, y);\n if (!r) {\n r = [];\n result.set(x, y, r);\n }\n return r;\n }\n this.data.forEach(({ x1, y1, x2, y2, forward, backward }) => {\n get(x1, y1).push({ to: [x2, y2], ascent: forward, descent: backward });\n get(x2, y2).push({ to: [x1, y1], ascent: backward, descent: forward });\n });\n return result;\n }\n}\n\n// Each tile has a maximum slope its edges are allowed to have.\n// A variety of attributes are allowed to influence this slope, so combine them\n// here into a single grid of max slopes.\nfunction getTileSlopes(cavern: StrataformedCavern): Grid {\n const result = new MutableGrid();\n // The max slope allowed for tile types that are within the play area but\n // don't define a specific slope.\n const planlessSlope = Math.max(\n cavern.context.caveMaxSlope,\n cavern.context.hallMaxSlope,\n );\n const maxSlopeForPlan = cavern.plans.map((plan) =>\n Math.min(\n plan.hasErosion ? 0 : Infinity,\n plan.architect.maxSlope ?? Infinity,\n plan.kind === \"cave\"\n ? cavern.context.caveMaxSlope\n : cavern.context.hallMaxSlope,\n ),\n );\n for (let x = cavern.left; x < cavern.right; x++) {\n for (let y = cavern.top; y < cavern.bottom; y++) {\n let slope = Infinity;\n const tile = cavern.tiles.get(x, y);\n if (tile) {\n // Determine the max slope for the specific tile placed here.\n slope = Math.min(slope, tile.maxSlope ?? Infinity);\n } else {\n // Determine the max slope for this tile in the void.\n if (\n x < cavern.left ||\n x >= cavern.right ||\n y < cavern.top ||\n y >= cavern.bottom\n ) {\n slope = Math.min(slope, cavern.context.borderMaxSlope);\n } else {\n slope = Math.min(slope, cavern.context.voidMaxSlope);\n }\n }\n // Determine the max slope for the plans at this tile.\n slope = Math.min(\n slope,\n cavern.pearlInnerDex\n .get(x, y)\n ?.reduce(\n (r: number | undefined, _, i) =>\n Math.min(r ?? Infinity, maxSlopeForPlan[i]),\n undefined,\n ) ?? planlessSlope,\n );\n result.set(x, y, slope);\n }\n }\n return result;\n}\n\nexport default function getEdgeMap(cavern: StrataformedCavern): EdgeMap {\n const edges = new EdgeMap();\n\n getTileSlopes(cavern).forEach((slope, x1, y1) => {\n const x2 = x1 + 1;\n const y2 = y1 + 1;\n edges.set(x1, y1, x2, y1, slope, slope);\n edges.set(x1, y1, x1, y2, slope, slope);\n edges.set(x2, y1, x2, y2, slope, slope);\n edges.set(x1, y2, x2, y2, slope, slope);\n });\n\n return edges;\n}\n","import { Mutable } from \"../../../common\";\nimport { NSEW, Point } from \"../../../common/geometry\";\nimport { Grid, MutableGrid } from \"../../../common/grid\";\nimport { Tile } from \"../../../models/tiles\";\nimport { StrataformedCavern } from \"../02_strataform\";\nimport { CORNER_OFFSETS, HEIGHT_MAX, HEIGHT_MIN } from \"./base\";\nimport getEdgeMap from \"./edges\";\n\nexport type HeightNode = {\n readonly target: number | undefined;\n readonly neighbors: readonly {\n readonly node: HeightNode;\n // The maximum upward slope moving from here to the neighbor.\n readonly ascent: number;\n // The maximum downward slope moving from here to the neighbor.\n readonly descent: number;\n }[];\n readonly corners: Point[];\n collapseQueued: boolean;\n min: number;\n max: number;\n range: number;\n};\n\nfunction getBowls(cavern: StrataformedCavern) {\n const result = new MutableGrid();\n cavern.tiles.forEach((tile, x, y) => {\n let size;\n if (tile === Tile.WATER) {\n size = 2;\n } else if (tile === Tile.LAVA) {\n size = 2;\n } else if (\n cavern.pearlInnerDex.get(x, y)?.some((_, i) => cavern.plans[i].hasErosion)\n ) {\n size = 0;\n } else {\n return;\n }\n CORNER_OFFSETS.forEach(([ox, oy]) => {\n result.set(\n x + ox,\n y + oy,\n Math.max(size, result.get(x + ox, y + oy) ?? 0),\n );\n });\n });\n return result;\n}\n\nfunction mkNode(cavern: StrataformedCavern, x: number, y: number): HeightNode {\n const target = cavern.height.get(x, y);\n // Corners on the border are adjusted to a height of 0 when loaded in Manic\n // Miners. This means they should be compressed here, but this also gives\n // strataflux a starting point for which corners have known heights.\n const isBorder =\n x === cavern.left ||\n x === cavern.right ||\n y === cavern.top ||\n y === cavern.bottom;\n return {\n target,\n neighbors: [],\n corners: [[x, y]],\n collapseQueued: isBorder,\n min: isBorder ? 0 : HEIGHT_MIN,\n max: isBorder ? 0 : HEIGHT_MAX,\n range: isBorder ? 0 : HEIGHT_MAX - HEIGHT_MIN,\n };\n}\n\nfunction getNodesForBowls(cavern: StrataformedCavern, bowls: Grid) {\n const result = new MutableGrid();\n // oh hey look it's the same algorithm from discovery zones\n const queue: { x: number; y: number; node: HeightNode | null }[] = bowls.map(\n (_, x, y) => ({ x, y, node: null }),\n );\n while (queue.length > 0) {\n let { x, y, node } = queue.shift()!;\n if (!result.get(x, y)) {\n if (!node) {\n node = mkNode(cavern, x, y);\n }\n result.set(x, y, node);\n const neighbors = NSEW.map(([ox, oy]) => ({\n x: x + ox,\n y: y + oy,\n node,\n })).filter(({ x: x2, y: y2 }) => bowls.get(x2, y2));\n queue.unshift(...neighbors);\n }\n }\n return result;\n}\n\nexport default function getNodes(cavern: StrataformedCavern): Grid {\n // First handle \"bowls\" - these are the places that need to be at a lower\n // elevation than their surroundings. Adjacent bowls must be at the same\n // height, so just use the same node for the whole contiguous bowl.\n const bowls = getBowls(cavern);\n const nodes = getNodesForBowls(cavern, bowls);\n\n // Now create the rest of the node objects.\n for (let x = cavern.left; x <= cavern.right; x++) {\n for (let y = cavern.top; y <= cavern.bottom; y++) {\n const node = nodes.get(x, y);\n if (node) {\n node.corners.push([x, y]);\n } else {\n nodes.set(x, y, mkNode(cavern, x, y));\n }\n }\n }\n\n // Get the edge map with tile slopes precomputed.\n const edges = getEdgeMap(cavern);\n\n // Add edges for bowls.\n bowls.forEach((size, x, y) => {\n const s = size + 1;\n for (let ox = -s; ox <= s; ox++) {\n for (let oy = -s; oy <= s; oy++) {\n edges.set(x, y, x + ox, y + oy, Infinity, 0);\n }\n }\n });\n\n // Convert edges to neighbors, linking them together.\n edges.edges().forEach((e, x1, y1) => {\n const node = nodes.get(x1, y1);\n if (node) {\n const neighbors = e\n .map(({ to, ascent, descent }) => ({\n node: nodes.get(...to),\n ascent,\n descent,\n }))\n .filter(({ node: n }) => n && n !== node) as HeightNode[\"neighbors\"];\n (node.neighbors as Mutable).push(...neighbors);\n }\n });\n\n return nodes;\n}\n","import { PseudorandomStream } from \"../../../common\";\nimport { Grid, MutableGrid } from \"../../../common/grid\";\nimport { StrataformedCavern } from \"../02_strataform\";\nimport getNodes, { HeightNode } from \"./nodes\";\n\n// The \"strataflux\" algorithm is particularly complex mostly because it\n// involves many data structures and concepts that are not really used\n// elsewhere. The bulk of the code is simply generating the data structures\n// needed to perform the algorithm, which work as follows:\n//\n// This algorithm deals with Tiles, Corners, and Edges - Tiles meaning the same\n// thing as in the rest of this project and the others defined thusly:\n//\n// EdgeH [x, y] =====v\n// Corner [x, y] => +--------+ <= Corner [x + 1, y]\n// | |\n// EdgeV [x, y] => | Tile | <= EdgeV [x + 1, y]\n// | [x, y] |\n// | |\n// Corner [x, y + 1] => +--------+ <= Corner [x + 1, y + 1]\n// ^===== EdgeH [x, y + 1]\n\n// Superflat: Just return a cavern where all the heights are 0\nfunction superflat(cavern: StrataformedCavern): Grid {\n const result = new MutableGrid();\n for (let x = cavern.left; x <= cavern.right; x++) {\n for (let y = cavern.top; y <= cavern.bottom; y++) {\n result.set(x, y, 0);\n }\n }\n return result;\n}\n\nfunction getRandomHeight(\n node: HeightNode,\n rng: PseudorandomStream,\n strataplanity: number,\n): number {\n if (node.min === node.max) {\n return node.min;\n }\n const targetInRange = (() => {\n if (node.target === undefined) {\n return 0.5;\n }\n if (node.target <= node.min) {\n return 0;\n }\n if (node.target >= node.max) {\n return 1;\n }\n return (node.target - node.min) / (node.max - node.min);\n })();\n return rng.betaInt({\n a: 1 + strataplanity * targetInRange,\n b: 1 + strataplanity * (1 - targetInRange),\n min: node.min,\n max: node.max + 1,\n });\n}\n\nexport default function strataflux(\n cavern: StrataformedCavern,\n): StrataformedCavern {\n // If height is disabled, just return a superflat map.\n if (cavern.context.heightTargetRange <= 0) {\n return { ...cavern, height: superflat(cavern) };\n }\n\n const nodes = getNodes(cavern);\n const height = new MutableGrid();\n const rng = cavern.dice.height;\n\n // The collapse queue is a priority queue. The algorithm will always take the\n // node with the smallest possible range of values.\n const collapseQueue: HeightNode[] = nodes\n .map((c) => c)\n .filter((c) => c.collapseQueued);\n\n const strataplanity = cavern.context.strataplanity;\n\n const pop = () => {\n let r = 0;\n for (let i = 1; i < collapseQueue.length; i++) {\n if (collapseQueue[i].range <= collapseQueue[r].range) {\n r = i;\n }\n }\n return collapseQueue.splice(r, 1)[0];\n };\n\n // Collapsing a node means picking a specific height in range for that node.\n const collapse = () => {\n const node = pop();\n const h = getRandomHeight(node, rng, strataplanity);\n for (let i = 0; i < node.corners.length; i++) {\n height.set(...node.corners[i], h);\n }\n node.min = h;\n node.max = h;\n node.range = 0;\n return node;\n };\n\n // I think this algorithm is like O(n^4) where N is the size of the cavern,\n // so try to save some performance where possible.\n\n while (collapseQueue.length) {\n // Take a node off the collapse queue and collapse it.\n // Then, put it on the spread queue.\n const spreadQueue = [collapse()];\n while (spreadQueue.length) {\n // Take a node off the spread queue.\n const node = spreadQueue.shift()!;\n // Spread to each of this node's neighbors.\n for (let i = 0; i < node.neighbors.length; i++) {\n const neighbor = node.neighbors[i];\n // If the neighbor is already collapsed, nothing to do.\n if (!neighbor.node.range) {\n continue;\n }\n // Pull the neighbor's minimum up and maximum down to fit within the\n // allowed ascent/descent slope for this edge.\n neighbor.node.min = Math.max(\n neighbor.node.min,\n node.min - neighbor.descent,\n );\n neighbor.node.max = Math.min(\n neighbor.node.max,\n node.max + neighbor.ascent,\n );\n const range = neighbor.node.max - neighbor.node.min;\n // If the neighbor's range has shrunk,\n if (range < neighbor.node.range) {\n neighbor.node.range = range;\n // put it on the spread queue\n spreadQueue.push(neighbor.node);\n // and put it on the collapse queue if it wasn't already.\n if (!neighbor.node.collapseQueued) {\n neighbor.node.collapseQueued = true;\n collapseQueue.push(neighbor.node);\n }\n }\n }\n }\n }\n\n return { ...cavern, height };\n}\n","import { tf } from \"../../common/transform\";\nimport discover from \"./01_discover\";\nimport populate from \"./04_populate\";\nimport fence from \"./00_fence\";\nimport strataform from \"./02_strataform\";\nimport strataflux from \"./03_strataflux\";\n\nexport const PLASTIC_TF = tf(fence)\n .then(discover)\n .then(strataform)\n .then(strataflux)\n .then(populate);\n","import { FinePlasticCavern } from \"../02_masonry/05_fine\";\n\nexport type FencedCavern = FinePlasticCavern & {\n left: number;\n top: number;\n right: number;\n bottom: number;\n};\n\nexport default function fence(cavern: FinePlasticCavern): FencedCavern {\n let { left, top, right, bottom } = cavern.tiles.bounds;\n const width = right - left;\n const height = bottom - top;\n const size = Math.max(width, height);\n\n left = left - Math.floor((size - width) / 2) - 1;\n top = top - Math.floor((size - height) / 2) - 1;\n right = left + size + 2;\n bottom = top + size + 2;\n\n return { ...cavern, left, top, right, bottom };\n}\n","import { Grid } from \"../../common/grid\";\nimport { DiscoveryZone, getDiscoveryZones } from \"../../models/discovery_zone\";\nimport { FencedCavern } from \"./00_fence\";\n\nexport type DiscoveredCavern = FencedCavern & {\n readonly discoveryZones: Grid;\n};\n\nexport default function discover(cavern: FencedCavern): DiscoveredCavern {\n const discoveryZones = getDiscoveryZones(cavern.tiles);\n cavern.openCaveFlags.forEach(\n (_, x, y) => (discoveryZones.get(x, y)!.openOnSpawn = true),\n );\n return { ...cavern, discoveryZones };\n}\n","import { MutableGrid, Grid } from \"../../common/grid\";\nimport { Erosion, Landslide } from \"../../models/hazards\";\nimport { Creature, CreatureFactory } from \"../../models/creature\";\nimport { Miner, MinerFactory } from \"../../models/miner\";\nimport { Plan } from \"../../models/plan\";\nimport { Vehicle, VehicleFactory } from \"../../models/vehicle\";\nimport { StrataformedCavern } from \"./02_strataform\";\nimport { EntityPosition } from \"../../models/position\";\nimport { AnyMetadata } from \"../../architects\";\n\nexport type PopulatedCavern = StrataformedCavern & {\n readonly landslides: Grid;\n readonly erosion: Grid;\n readonly creatures: readonly Creature[];\n readonly miners: readonly Miner[];\n readonly vehicles: readonly Vehicle[];\n readonly cameraPosition: EntityPosition;\n};\n\nexport default function populate(cavern: StrataformedCavern): PopulatedCavern {\n let cameraPosition: EntityPosition | undefined = cavern.cameraPosition;\n const setCameraPosition = (pos: EntityPosition) => (cameraPosition = pos);\n const diorama = {\n cavern,\n landslides: new MutableGrid(),\n erosion: new MutableGrid(),\n creatureFactory: new CreatureFactory(),\n creatures: [] as Creature[],\n minerFactory: new MinerFactory(),\n miners: [] as Miner[],\n vehicleFactory: new VehicleFactory(),\n vehicles: [] as Vehicle[],\n };\n cavern.plans.forEach((plan: Plan) => {\n const args = { ...diorama, setCameraPosition, plan };\n plan.architect.placeLandslides(args);\n plan.architect.placeErosion(args);\n plan.architect.placeEntities(args);\n });\n if (!cameraPosition) {\n throw new Error(\n \"No architect set a camera position! The spawn cave was expected to \" +\n \"do this during either the populate or fine step.\",\n );\n }\n return { ...cavern, ...diorama, cameraPosition };\n}\n","import { NSEW, Point } from \"../../common/geometry\";\nimport { Grid, MutableGrid } from \"../../common/grid\";\nimport {\n POWER_STATION,\n SUPPORT_STATION,\n TELEPORT_PAD,\n TOOL_STORE,\n} from \"../../models/building\";\nimport { EntityPosition } from \"../../models/position\";\nimport { Tile } from \"../../models/tiles\";\nimport { PopulatedCavern } from \"../03_plastic/04_populate\";\n\nexport type AeratedCavern = PopulatedCavern & {\n readonly oxygen: null | readonly [number, number];\n readonly aerationLog: null | Grid;\n};\n\nconst MIN_STARTING_AIR = 1000;\nconst MIN_AIR_CAP = 3000;\nconst FALLBACK_AIR = 8000;\nconst AIR_STEP = 250;\n\n// Some timing stats\nconst TIMING = {\n // Time required to walk across 1 tile.\n WALK: 1,\n WALK_ENCUMBERED: 1.6,\n // WALK_RUBBLE: 2.6,\n // WALK_RUBBLE_ENCUMBERED: 3.8,\n DRILL_DIRT: 4,\n DRILL_LOOSE_ROCK: 8,\n DRILL_SEAM: 25,\n CLEAR_RUBBLE: 10,\n // Dynamite is fast but requires an encumbered journey.\n DYNAMITE: 6,\n // Time to kill monsters\n KILL_MONSTER: 20,\n // Time to build each of these assuming resources were already collected.\n BUILD_POWER_PATH: 15,\n BUILD_TELEPORT_PAD: 125,\n BUILD_POWER_STATION: 210,\n BUILD_SUPPORT_STATION: 215,\n} as const satisfies { [key: string]: number };\n\nfunction getOrigin(cavern: PopulatedCavern): Point {\n const entities = [\n ...cavern.buildings.filter((b) => b.template === TOOL_STORE),\n ...cavern.buildings,\n ...cavern.miners,\n ...cavern.vehicles,\n ];\n for (const e of entities) {\n const pos = [Math.floor(e.x), Math.floor(e.y)] as Point;\n if (cavern.discoveryZones.get(...pos)?.openOnSpawn) {\n return pos;\n }\n }\n throw new Error(\"No discovered entities. Is this level even playable?\");\n}\n\nexport default function aerate(cavern: PopulatedCavern): AeratedCavern {\n if (!cavern.context.hasAirLimit) {\n return { ...cavern, oxygen: null, aerationLog: null };\n }\n\n const presentAtSpawn = (e: EntityPosition) =>\n cavern.discoveryZones.get(Math.floor(e.x), Math.floor(e.y))?.openOnSpawn;\n\n const buildings = cavern.buildings.filter(presentAtSpawn);\n const vehicles = cavern.vehicles.filter(presentAtSpawn);\n\n let hasTeleportPad = false;\n let hasPowerStation = false;\n let hasSupportStation = false;\n\n let air = 0;\n let ore = 0;\n let crystals = 0;\n\n const aerationLog = new MutableGrid();\n\n buildings.forEach((b) => {\n hasTeleportPad ||= b.template === TELEPORT_PAD;\n hasPowerStation ||= b.template === POWER_STATION;\n hasSupportStation ||= b.template === SUPPORT_STATION;\n // Any building can be scrapped for crystals.\n crystals += b.template.crystals;\n });\n vehicles.forEach((v) => {\n // Any vehicle can be scrapped for crystals.\n crystals += v.template.crystals;\n });\n\n // Assume the player has to build 2 power paths.\n air += 2 * TIMING.BUILD_POWER_PATH;\n ore -= 4;\n\n // The player needs crystals to build the power and support stations plus\n // one extra for power.\n crystals -= POWER_STATION.crystals + SUPPORT_STATION.crystals + 1;\n\n // The player must build these buildings if not built, and needs ore for them.\n if (!hasTeleportPad) {\n air += TIMING.BUILD_TELEPORT_PAD;\n ore -= 5 + TELEPORT_PAD.ore;\n }\n if (!hasPowerStation) {\n air += TIMING.BUILD_POWER_STATION;\n ore -= 5 + POWER_STATION.ore;\n }\n if (!hasSupportStation) {\n air += TIMING.BUILD_SUPPORT_STATION;\n ore -= 5 + SUPPORT_STATION.ore;\n }\n\n crystals = Math.min(crystals, -1);\n\n const origin = getOrigin(cavern);\n\n function drillTiming(t: Tile) {\n if (t === Tile.DIRT) {\n return TIMING.DRILL_DIRT;\n }\n if (t === Tile.LOOSE_ROCK) {\n return TIMING.DRILL_LOOSE_ROCK;\n }\n if (t === Tile.CRYSTAL_SEAM || t === Tile.ORE_SEAM) {\n return TIMING.DRILL_SEAM;\n }\n return undefined;\n }\n\n {\n const distance = new MutableGrid();\n distance.set(...origin, 0);\n\n const walkQueue: Point[] = [origin];\n const drillQueue: Point[] = [];\n const dynamiteQueue: Point[] = [];\n\n function enqueue(x: number, y: number, d: number) {\n if (distance.get(x, y) === undefined) {\n distance.set(x, y, d);\n const t = cavern.tiles.get(x, y);\n if (t && !t.isFluid) {\n if (!t.isWall) {\n walkQueue.push([x, y]);\n } else if (drillTiming(t)) {\n drillQueue.push([x, y]);\n } else if (t === Tile.HARD_ROCK) {\n dynamiteQueue.push([x, y]);\n }\n }\n }\n }\n\n while (ore < 0 || crystals < 0) {\n if (walkQueue.length) {\n const [x, y] = walkQueue.shift()!;\n aerationLog.set(x, y, true);\n const d = distance.get(x, y)!;\n\n NSEW.forEach(([ox, oy]) => enqueue(x + ox, y + oy, d + 1));\n } else if (drillQueue.length || dynamiteQueue.length) {\n const useDynamite = !drillQueue.length;\n const [x, y] = (useDynamite ? dynamiteQueue : drillQueue).shift()!;\n aerationLog.set(x, y, true);\n const d = distance.get(x, y)!;\n const t = cavern.tiles.get(x, y)!;\n if (useDynamite) {\n // Add the time to walk back and carry dynamite there, and run away\n // while the wall explodes.\n air += d * (TIMING.WALK + TIMING.WALK_ENCUMBERED) + TIMING.DYNAMITE;\n } else {\n // Add the time to drill the wall.\n air += drillTiming(t)!;\n }\n if (ore < 0) {\n const oreYield = t.oreYield + (cavern.ore.get(x, y) ?? 0);\n ore += oreYield;\n air +=\n oreYield * d * (TIMING.WALK + TIMING.WALK_ENCUMBERED) +\n TIMING.CLEAR_RUBBLE;\n }\n if (crystals < 0) {\n const crystalYield =\n t.crystalYield + (cavern.crystals.get(x, y) ?? 0);\n crystals += crystalYield;\n air += crystalYield * d * (TIMING.WALK + TIMING.WALK_ENCUMBERED);\n }\n // If the wall doesn't have any useful resources, don't count the time to walk\n // to it. That will be counted when walls behind it get drilled.\n\n // The wall is now floor, so make it floor.\n walkQueue.push([x, y]);\n } else {\n // Failure mode: This simulation can't figure out how to build a\n // Support Station. Use an arbitrary high air quantity.\n console.log(\"Unable to playtest this level for air consumption.\");\n return { ...cavern, oxygen: [FALLBACK_AIR, FALLBACK_AIR], aerationLog };\n }\n }\n }\n\n const spawn = cavern.plans.find((plan) => !plan.hops.length)!;\n\n if (cavern.context.hasMonsters) {\n air += ((TIMING.KILL_MONSTER * spawn.monsterSpawnRate) / 60) * (air / 5);\n }\n\n // Multiply by safety factor and round up to the nearest 250.\n air *= cavern.context.airSafetyFactor;\n air = Math.max(MIN_STARTING_AIR, Math.ceil(air / AIR_STEP) * AIR_STEP);\n\n // Larger caverns should have more max air, even if the starting air is low.\n const maxAir = Math.max(\n air,\n MIN_AIR_CAP,\n Math.ceil((cavern.context.targetSize * 80) / AIR_STEP) * AIR_STEP,\n );\n\n return { ...cavern, oxygen: [air, maxAir], aerationLog };\n}\n","import { Mutable, PseudorandomStream } from \"../common\";\n\ntype State = { [key: string]: boolean };\ntype FormatVars = { [key: string]: string };\n\nexport type Phrase = {\n readonly id: number;\n readonly text: readonly string[];\n readonly after: Phrase[];\n readonly before: Phrase[];\n readonly requires: (string & keyof T) | \"start\" | \"end\" | null;\n readonly reachableStates: { [key: string]: boolean };\n readonly lane: number;\n};\n\ntype PgNodeArgs = (PgNode | string)[];\n\nclass PgBuilder {\n readonly phrases: Phrase[] = [];\n readonly states = new Set();\n\n phrase(\n text: readonly string[],\n requires?: (string & keyof T) | \"start\" | \"end\",\n ): Phrase {\n const phrase = {\n id: this.phrases.length,\n text: text,\n requires: requires ?? null,\n after: [],\n before: [],\n reachableStates: {},\n lane: -1,\n };\n this.phrases.push(phrase);\n if (requires && requires !== \"start\" && requires !== \"end\") {\n this.states.add(requires);\n }\n return phrase;\n }\n}\n\nfunction join(a: Phrase, b: Phrase) {\n a.after.push(b);\n b.before.push(a);\n}\n\nfunction merge(\n a: readonly Phrase[],\n b: readonly Phrase[],\n): Phrase[] {\n let i = 0;\n let j = 0;\n let r = [];\n while (true) {\n if (i >= a.length) {\n if (j >= b.length) {\n return r;\n }\n r.push(b[j++]);\n } else if (j >= b.length || a[i].id < b[j].id) {\n r.push(a[i++]);\n } else if (a[i].id > b[j].id) {\n r.push(b[j++]);\n } else {\n r.push(a[i++]);\n j++;\n }\n }\n}\n\nclass PgNode {\n private readonly v: PgBuilder;\n private readonly heads: readonly Phrase[];\n private readonly tails: readonly Phrase[];\n private readonly skip: boolean;\n\n constructor(\n v: PgBuilder,\n heads: readonly Phrase[],\n tails: readonly Phrase[],\n skip: boolean,\n ) {\n this.v = v;\n this.heads = heads;\n this.tails = tails;\n this.skip = skip;\n }\n\n static coerce(\n pgBuilder: PgBuilder,\n args: PgNodeArgs,\n ): PgNode {\n const text: string[] = [];\n const nodes: PgNode[] = [];\n for (const arg of args) {\n (arg instanceof PgNode ? nodes : text).push(arg as any);\n }\n if (nodes.length === 0) {\n const p = [pgBuilder.phrase(text)];\n return new PgNode(pgBuilder, p, p, false);\n }\n const heads = nodes.flatMap((n) => n.heads).sort((a, b) => a.id - b.id);\n const tails = nodes.flatMap((n) => n.tails).sort((a, b) => a.id - b.id);\n const skip = nodes.some((n) => n.skip);\n if (text.length > 0) {\n const phrase = pgBuilder.phrase(text);\n heads.push(phrase);\n tails.push(phrase);\n }\n return new PgNode(pgBuilder, heads, tails, skip);\n }\n\n then(...args: PgNodeArgs): PgNode {\n const that = PgNode.coerce(this.v, args);\n for (const t of this.tails) {\n for (const h of that.heads) {\n join(t, h);\n }\n }\n return new PgNode(\n this.v,\n this.skip ? merge(this.heads, that.heads) : this.heads,\n that.skip ? merge(this.tails, that.tails) : that.tails,\n this.skip && that.skip,\n );\n }\n}\n\n/** Assuming the input is a DAG, returns new phrases in a topological order. */\nfunction sort(\n phrases: readonly Phrase[],\n): readonly Phrase[] {\n const newIndex: (number | undefined)[] = [];\n const stack = phrases.filter((phrase) => phrase.before.length === 0);\n const inOrder: Mutable>[] = [];\n\n while (stack.length > 0) {\n const phrase = stack.shift()!;\n if (newIndex[phrase.id] !== undefined) {\n continue;\n }\n const before = phrase.before.filter((b) => !(newIndex[b.id] !== undefined));\n if (before.length > 0) {\n stack.unshift(...before, phrase);\n } else {\n newIndex[phrase.id] = inOrder.length;\n inOrder.push({ ...phrase, id: inOrder.length });\n stack.unshift(...phrase.after);\n }\n }\n\n // inOrder now contains new Phrases with new ids that are copies of the existing\n // phrases, but their after and before values are still pointing to the old ones.\n\n inOrder.forEach((phrase) => {\n phrase.after = phrase.after\n .map((a) => inOrder[newIndex[a.id]!])\n .sort((a, b) => a.id - b.id);\n phrase.before = phrase.before\n .map((b) => inOrder[newIndex[b.id]!])\n .sort((a, b) => a.id - b.id);\n });\n\n return inOrder;\n}\n\n/** Assign phrases to lanes. This serves no purpose other than display. */\nfunction align(phrases: readonly Phrase[]) {\n const stack: Mutable>[] = phrases.filter(\n (node) => node.before.length === 0,\n );\n const occupiedLanes: true[][] = [];\n for (let i = 0; i < phrases.length; i++) {\n occupiedLanes[i] = [];\n }\n\n function findLane(phrase: Phrase): number {\n lane: for (let lane = 0; ; lane++) {\n if (phrase.before.length > 0) {\n for (let i = phrase.before[0].id + 1; i <= phrase.id; i++) {\n if (occupiedLanes[i][lane]) {\n continue lane;\n }\n }\n }\n return lane;\n }\n }\n\n while (stack.length > 0) {\n const phrase = stack.shift()!;\n if (phrase.lane >= 0) {\n continue;\n }\n const lane = findLane(phrase);\n if (phrase.before.length > 0) {\n for (let i = phrase.before[0].id + 1; i < phrase.id; i++) {\n occupiedLanes[i][lane] = true;\n }\n stack.unshift(...phrase.before);\n }\n occupiedLanes[phrase.id][lane] = true;\n phrase.lane = lane;\n stack.unshift(...phrase.after);\n }\n}\n\nfunction getReachableStates(phrase: Phrase) {\n const reachableAfter: { [key: string]: true } = {};\n for (const a of phrase.after) {\n Object.assign(reachableAfter, a.reachableStates);\n }\n\n if (Object.keys(reachableAfter).length === 0) {\n return phrase.requires ? { [phrase.requires]: true } : {};\n }\n\n if (!phrase.requires) {\n return reachableAfter;\n }\n\n const reachable: { [key: string]: true } = {};\n for (const ra in reachableAfter) {\n const states = ra.split(\",\");\n if (!states.some((s) => s === phrase.requires)) {\n states.push(phrase.requires);\n states.sort();\n reachable[states.join(\",\")] = true;\n }\n }\n return reachable;\n}\n\nfunction traverse(phrases: readonly Phrase[]) {\n for (let i = phrases.length - 1; i >= 0; i--) {\n const phrase = phrases[i] as Mutable>;\n phrase.reachableStates = getReachableStates(phrase);\n }\n}\n\nexport type GenerateResult = {\n readonly chosen: readonly {\n readonly phrase: Phrase;\n readonly textIndex: number;\n }[];\n readonly text: string;\n};\n\nconst CAPITALIZE_AFTER = {\n \".\": true,\n \"!\": true,\n \"?\": true,\n \"\\n\": true,\n} as const;\n\nconst NO_SPACE_AFTER = {\n \"\\n\": true,\n} as const;\n\nconst NO_SPACE_BEFORE = {\n \",\": true,\n \".\": true,\n \"!\": true,\n \"?\": true,\n \"\\n\": true,\n} as const;\n\nfunction joinTexts(\n chosen: readonly { readonly phrase: Phrase; readonly textIndex: number }[],\n): string {\n const r: string[] = [];\n let capitalizeNext = true;\n let spaceBeforeNext = false;\n for (const { phrase, textIndex } of chosen) {\n const text = phrase.text[textIndex];\n if (!text) {\n continue;\n }\n if (spaceBeforeNext && !(text.charAt(0) in NO_SPACE_BEFORE)) {\n r.push(\" \");\n }\n if (capitalizeNext) {\n r.push(text[0].toUpperCase());\n r.push(text.slice(1));\n } else {\n r.push(text);\n }\n const endsWith = text.charAt(text.length - 1);\n capitalizeNext = endsWith in CAPITALIZE_AFTER;\n spaceBeforeNext = !(endsWith in NO_SPACE_AFTER);\n }\n return r.join(\"\");\n}\n\nconst format = (text: string, formatVars: FormatVars) =>\n text.replace(/\\$\\{([a-zA-Z0-9_]+)\\}/g, (_, key) => formatVars[key]);\n\nexport class PhraseGraph {\n private start: Phrase;\n readonly phrases: readonly Phrase[];\n readonly states: readonly (string & keyof T)[];\n\n constructor(\n start: Phrase,\n phrases: readonly Phrase[],\n states: readonly (string & keyof T)[],\n ) {\n this.start = start;\n this.phrases = phrases;\n this.states = states;\n }\n\n generate(\n rng: PseudorandomStream,\n requireState: T,\n formatVars: FormatVars,\n ): GenerateResult {\n const states = [...this.states, \"start\", \"end\"];\n const stateRemaining: { [key: string]: boolean } = {\n start: true,\n end: true,\n };\n for (const s of this.states) {\n if (requireState[s]) {\n stateRemaining[s] = true;\n }\n }\n const chosenPhrases: Phrase[] = [this.start];\n while (true) {\n const phrase = chosenPhrases[chosenPhrases.length - 1];\n if (phrase.requires === \"end\") {\n break;\n } else if (phrase.requires) {\n stateRemaining[phrase.requires] = false;\n }\n const reachedState = states\n .filter((s) => stateRemaining[s])\n .sort()\n .join(\",\");\n const continuations = phrase.after.filter(\n (a) => reachedState in a.reachableStates,\n );\n if (continuations.length === 0) {\n console.log(\n \"No continutation has %s at phrase %o\",\n reachedState,\n phrase,\n );\n throw new Error(\n `No continuation has ${reachedState} at phrase ${phrase.id}`,\n );\n }\n chosenPhrases.push(rng.uniformChoice(continuations));\n }\n const chosen = chosenPhrases.map((phrase) => ({\n phrase,\n textIndex:\n phrase.text.length > 0\n ? rng.uniformInt({ max: phrase.text.length })\n : -1,\n }));\n const text = format(joinTexts(chosen), formatVars);\n return { chosen, text };\n }\n}\n\nexport type PgArgs = {\n pg: (...args: PgNodeArgs) => PgNode;\n state: (...args: (string & keyof T)[]) => PgNode;\n start: PgNode;\n end: PgNode;\n cut: PgNode;\n skip: PgNode;\n};\n\nexport default function phraseGraph(\n fn: (args: PgArgs) => void,\n): PhraseGraph {\n const pgBuilder = new PgBuilder();\n\n const pg = (...args: PgNodeArgs): PgNode =>\n PgNode.coerce(pgBuilder, args);\n const state = (...args: (string & keyof T)[]): PgNode => {\n const phrases = args.map((arg) => pgBuilder.phrase([], arg));\n return new PgNode(pgBuilder, phrases, phrases, false);\n };\n const start = new PgNode(\n pgBuilder,\n [],\n [pgBuilder.phrase([], \"start\")],\n false,\n );\n const end = new PgNode(pgBuilder, [pgBuilder.phrase([], \"end\")], [], false);\n const cut = new PgNode(pgBuilder, [], [], false);\n const skip = new PgNode(pgBuilder, [], [], true);\n\n fn({ pg, state, start, end, cut, skip });\n\n const phrases = sort(pgBuilder.phrases);\n align(phrases);\n traverse(phrases);\n const newStart = phrases.find((phrase) => phrase.requires === \"start\")!;\n const states = Array.from(pgBuilder.states.values()).sort();\n\n return new PhraseGraph(newStart, phrases, states);\n}\n\nexport const _forTests = { merge };\n","/* eslint-disable no-template-curly-in-string */\n\nimport phraseGraph, { PgArgs } from \"../builder\";\nimport { State } from \"../lore\";\n\nfunction objectives({\n pg,\n state,\n}: Pick, \"pg\" | \"state\">) {\n const find_lost_miners = pg(\n state(\"lostMinersOne\").then(\"find the lost Rock Raider\"),\n state(\"lostMinersTogether\", \"lostMinersApart\").then(\n \"find the lost Rock Raiders\",\n ),\n );\n\n const get_resources = state(\"resourceObjective\").then(\n \"collect all ${resourceGoal}\",\n \"get the ${resourceGoal} we needed\",\n );\n\n find_lost_miners.then(\"and\").then(get_resources);\n\n return pg(find_lost_miners, get_resources).then();\n}\n\nconst COMMENDATIONS = [\n \"Well done!\",\n \"Good work!\",\n \"Outstanding!\",\n \"I knew you could do it, Cadet!\",\n \"You're very good at this, Cadet!\",\n \"Your efforts have been outstanding!\",\n \"We were right to count on you, Cadet!\",\n] as const;\n\nexport const SUCCESS = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n (() => {\n const commend = state(\"commend\").then(\"Wow!\", ...COMMENDATIONS);\n const hasMonsters = state(\"hasMonsters\").then(\n \"Those ${enemies} were no match for you!\",\n \"You had nothing to fear from those ${enemies}!\",\n );\n const despiteTheOdds = pg(\n \"Despite the odds,\",\n \"In the face of danger,\",\n \"Even with the odds against you,\",\n );\n hasMonsters.then(despiteTheOdds);\n return start\n .then(skip, commend, hasMonsters)\n .then(\n skip,\n state(\"hasMonsters\", \"spawnHasErosion\").then(despiteTheOdds),\n );\n })()\n .then(\"you\")\n .then(\n pg(\"managed to\", \"were able to\")\n .then(objectives({ pg, state }))\n .then(\n \".\",\n state(\"hasMonsters\").then(\"despite that horde of ${enemies}!\"),\n ),\n (() => {\n const foundTheBase = state(\"findHq\").then(\"found the base\");\n const hqIsRuin = state(\"hqIsRuin\").then(\n \"repaired the Rock Raider HQ\",\n \"restored our mining operations\",\n );\n foundTheBase.then(hqIsRuin);\n return pg()\n .then(foundTheBase, hqIsRuin)\n .then(\"and\")\n .then(\n pg(\n state(\"lostMinersOne\").then(\n \"found the lost Rock Raider\",\n \"located the lost Rock Raider\",\n ),\n state(\"lostMinersTogether\", \"lostMinersApart\").then(\n \"found the lost Rock Raiders\",\n \"located the lost Rock Raiders\",\n ),\n ).then(\n \", safe and sound.\",\n \"before anything could happen to them.\",\n state(\"resourceObjective\").then(\n \". You even collected ${resourceGoal}!\",\n \"- and salvaged the operation with those ${resourceGoal}.\",\n \". Collecting ${resourceGoal} was no small feat either!\",\n ),\n ),\n state(\"resourceObjective\").then(\n \"collected ${resourceGoal}.\",\n \"collected all ${resourceGoal}.\",\n \"got all ${resourceGoal}.\",\n ),\n );\n })(),\n )\n .then(\"\\n\\n\")\n .then(\n skip,\n state(\"commend\").then(\n \"Keep up the good work, Cadet!\",\n \"You make this look rather easy, Cadet!\",\n ...COMMENDATIONS,\n ),\n )\n .then(\"Mission Complete!\")\n .then(skip, state(\"hasMonsters\"))\n .then(skip, state(\"spawnHasErosion\"))\n .then(end);\n },\n);\n\nexport const FAILURE = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(skip, \"Oh, dear.\", \"Bad luck!\")\n .then(\n \"You didn't\",\n \"You couldn't\",\n \"You were unable to\",\n \"We were counting on you to\",\n )\n .then(objectives({ pg, state }))\n .then(\".\")\n .then(\n skip,\n \"You must succeed, Cadet!\",\n pg(skip, \"Chin up, Cadet!\").then(\"You'll do better next time.\"),\n )\n .then(\"\\n\\nMission Failed!\")\n .then(end);\n },\n);\n","/* eslint-disable no-template-curly-in-string */\n\nimport { FoundLostMinersState, State } from \"../lore\";\nimport phraseGraph from \"../builder\";\n\nexport const FOUND_HOARD = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n // Assume there is a collect_resources goal, and assume that goal requires\n // collecting crystals. This event will only be triggered if there are enough\n // crystals on the floor to complete the level.\n\n start\n .then(\n \"Wow! This ought to do it!\",\n \"You've found quite the haul here.\",\n \"Our intel was accurate. Look at all those Energy Crystals!\",\n )\n .then(\n pg(\n \"Now, transport these Energy Crystals back to your base.\",\n \"Bring this to your base to complete our mission!\",\n \"Get this back to your base.\",\n ),\n state(\"treasureCaveMany\").then(\n \"With this, we have enough to complete our mission!\",\n \"Collect all the Energy Crystals you've found and complete our mission!\",\n ),\n state(\"hasMonsters\").then(\n \"I hope we can collect these without attracting too much attention.\",\n \"Be careful, Cadet! This is surely enough to attract those ${enemies}.\",\n ),\n )\n .then(state(\"treasureCaveOne\", \"treasureCaveMany\"), skip)\n .then(state(\"hasMonsters\"), skip)\n .then(end);\n },\n);\n\nexport const FOUND_HQ = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n const positive_greeting = start.then(\n \"Our Rock Raider HQ is safe and sound!\",\n \"Way to go, Cadet!\",\n );\n\n const neutral_greeting = start.then(\n \"You found the Rock Raider HQ.\",\n \"There it is!\",\n );\n\n const tail = pg(skip, state(\"resourceObjective\")).then(end);\n\n pg(\n pg(positive_greeting, neutral_greeting).then(\n \"Now, \",\n \"Now you should be able to\",\n ),\n neutral_greeting\n .then(\n state(\"hasMonsters\").then(\n \"Shore up the base defenses\",\n \"Now, get some Electric Fences up\",\n ),\n )\n .then(\n \". We need this base secure if we're going to\",\n \". Once the base is safe,\",\n pg(\n \"before the monsters find it too!\",\n \"and keep it safe from those ${enemies}!\",\n \"and hope those monsters don't cause any more damage!\",\n )\n .then(\n skip,\n state(\"lostMinersOne\", \"lostMinersTogether\", \"lostMinersApart\"),\n )\n .then(tail),\n ),\n ).then(\n pg(\n state(\"lostMinersOne\").then(\"find the lost Rock Raider!\"),\n state(\"lostMinersTogether\", \"lostMinersApart\").then(\n \"find those lost Rock Raiders!\",\n ),\n ).then(tail),\n state(\"resourceObjective\")\n .then(\"collect ${resourceGoal}.\", \"get those ${resourceGoalNamesOnly}.\")\n .then(end),\n );\n },\n);\n\nexport const FOUND_LOST_MINERS = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(\n state(\"foundMinersOne\").then(\n \"Look! It's one of the lost Rock Radiers!\",\n \"You found a lost Rock Raider!\",\n \"You found one of the lost Rock Raiders!\",\n ),\n state(\"foundMinersTogether\").then(\n \"Look at that! ${foundMinersCount} of the lost Rock Raiders are here, safely together.\",\n \"That's ${foundMinersCount} Rock Raiders found!\",\n \"You found ${foundMinersCount} of them here!\",\n ),\n )\n .then(skip, \"Keep going!\", \"Keep searching, Cadet.\")\n .then(\"We need to find all ${lostMinersCount} before we can leave.\")\n .then(end);\n },\n);\n\nexport const FOUND_ALL_LOST_MINERS = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(\n \"And that makes ${lostMinersCount} Rock Raiders found!\",\n \"You found all ${lostMinersCount} Rock Raiders!\",\n \"That's all ${lostMinersCount} Rock Raiders found!\",\n state(\"lostMinersOne\").then(\n \"Look! It's the lost Rock Raider!\",\n \"You found the missing Rock Raider!\",\n ),\n state(\"lostMinersTogether\").then(\n \"The ${lostMinersCount} Rock Raiders are right here, safe and sound!\",\n \"You found all ${lostMinersCount} Rock Raiders!\",\n \"That's all of the missing Rock Raiders found!\",\n ),\n )\n .then(\n skip,\n state(\"resourceObjective\").then(\"Now, collect ${resourceGoal}.\"),\n )\n .then(end);\n },\n);\n\nexport const NOMADS_SETTLED = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(\"This seems like as good a place as any.\", \"Well done, Cadet.\")\n .then(\n state(\"lostMinersOne\")\n .then(skip, state(\"resourceObjective\"))\n .then(\"Now, go find that lost Rock Raider!\"),\n state(\"lostMinersTogether\", \"lostMinersApart\")\n .then(skip, state(\"resourceObjective\"))\n .then(\"Now, go find those lost Rock Raiders!\"),\n state(\"resourceObjective\").then(\n \"Now, collect ${resourceGoal}.\",\n \"Those ${resourceGoalNamesOnly} are as good as ours!\",\n ),\n )\n .then(skip, state(\"hasMonsters\"))\n .then(end);\n\n start\n .then(\"With your base constructed, you should now have no problem\")\n .then(\n state(\"lostMinersOne\")\n .then(skip, state(\"resourceObjective\"))\n .then(\"finding that lost Rock Raider!\"),\n state(\"lostMinersTogether\", \"lostMinersApart\")\n .then(skip, state(\"resourceObjective\"))\n .then(\"finding those lost Rock Raiders!\"),\n state(\"resourceObjective\").then(\"collecting ${resourceGoal}!\"),\n )\n .then(\n skip,\n state(\"hasMonsters\").then(\n skip,\n \"Don't forget to build plenty of Electric Fences in case those \" +\n \"${enemies} come.\",\n \"Just keep an eye out for those ${enemies}.\",\n ),\n )\n .then(end);\n },\n);\n\nexport const FOUND_SLUG_NEST = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(\n \"I don't like the look of this.\",\n \"Look at that!\",\n \"Oh, dear.\",\n \"This could be a problem!\",\n )\n .then(\n \"It must be a nest of Slimy Slugs!\",\n \"We need to keep these Slimy Slugs at bay.\",\n )\n .then(end);\n },\n);\n","import phraseGraph from \"../builder\";\nimport { State } from \"../lore\";\n\nexport const NAME = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n function f({\n rock,\n ice,\n lava,\n mid,\n last,\n }: {\n rock: string[];\n ice?: string[];\n lava?: string[];\n mid?: string[];\n last: string[];\n }) {\n start\n .then(\n state(\"rockBiome\").then(...rock),\n ice ? state(\"iceBiome\").then(...ice) : cut,\n lava ? state(\"lavaBiome\").then(...lava) : cut,\n )\n .then(skip, ...(mid || []))\n .then(...last)\n .then(end);\n }\n\n f({\n rock: [\"Andesite\", \"Anthracite\", \"Argillite\"],\n ice: [\"Arctic\", \"Avalanche\"],\n lava: [\"Asbestos\", \"Ashen\"],\n last: [\"Abyss\", \"Action\", \"Alley\", \"Attack\"],\n });\n\n f({\n rock: [\"Basalt\", \"Basanite\", \"Bauxite\", \"Boulder\", \"Breccia\", \"Bullion\"],\n ice: [\"Blizzard\"],\n last: [\"Balance\", \"Blitz\", \"Breach\", \"Break\", \"Bonanza\", \"Burrow\"],\n });\n\n f({\n rock: [\"Chalk\", \"Claystone\", \"Core\", \"Crystal\"],\n lava: [\"Caldera\", \"Cinder\"],\n last: [\n \"Calamity\",\n \"Caper\",\n \"Cavern\",\n \"Chaos\",\n \"Conflict\",\n \"Conundrum\",\n \"Cruise\",\n ],\n });\n\n f({\n rock: [\"Diamond\", \"Diorite\", \"Dolomite\", \"Dunite\"],\n ice: [\"Drift\"],\n last: [\"Depths\", \"Dash\", \"Descent\", \"Despair\", \"Drive\"],\n });\n\n f({\n rock: [\"Emerald\", \"Evaporite\"],\n lava: [\"Ember\"],\n last: [\"Enigma\", \"Eruption\", \"Excavation\", \"Express\"],\n });\n\n f({\n rock: [\"Fault Line\", \"Fissure\", \"Flint\"],\n ice: [\"Frostbite\", \"Frosty\"],\n last: [\"Folly\", \"Frenzy\", \"Fury\"],\n });\n\n f({\n rock: [\"Gneiss\", \"Granite\", \"Gritstone\", \"Gypsum\"],\n ice: [\"Glacier\"],\n last: [\"Gauntlet\", \"Getaway\"],\n });\n\n f({\n rock: [\"Lapis Lazuli\", \"Laterite\", \"Lignite\", \"Limestone\"],\n lava: [\"Lava\", \"Lava Lake\"],\n last: [\"Labyrinth\", \"Lair\", \"Lure\"],\n });\n\n f({\n rock: [\"Marble\", \"Metamorphic\", \"Mineral\", \"Mudstone\"],\n ice: [\"Mammoth\"],\n lava: [\"Magma\", \"Mantle\", \"Molten\"],\n mid: [\"Mine\", \"Moon\"],\n last: [\"Mayhem\", \"Maze\", \"Meltdown\", \"Menace\", \"Mishap\"],\n });\n\n f({\n rock: [\"Phosphorite\", \"Pumice\"],\n ice: [\"Permafrost\", \"Polar\"],\n lava: [\"Pyroclastic\", \"Pyrolite\"],\n last: [\"Passage\", \"Peril\", \"Pit\", \"Plunge\", \"Puzzle\"],\n });\n\n f({\n rock: [\n \"Sandstone\",\n \"Schist\",\n \"Sedimentary\",\n \"Shale\",\n \"Silica\",\n \"Silt\",\n \"Slate\",\n \"Stalactite\",\n ],\n ice: [\"Snowdrift\", \"Subzero\"],\n mid: [\"Shaft\"],\n last: [\"Scramble\", \"Shock\", \"Showdown\", \"Slide\"],\n });\n\n f({\n rock: [\"Tuff\", \"Turbidite\", \"Twilight\"],\n ice: [\"Taiga\", \"Titanic\", \"Tundra\"],\n mid: [\"Tunnel\"],\n last: [\"Tempest\", \"Terror\", \"Trouble\"],\n });\n },\n);\n","/* eslint-disable no-template-curly-in-string */\n\nimport { State } from \"../lore\";\nimport phraseGraph from \"../builder\";\n\nconst ORDERS = phraseGraph(({ pg, state, start, end, cut, skip }) => {\n const collect_resources = pg(\n \"collect ${resourceGoal}.\",\n \"continue our mining operation by collecting ${resourceGoal}.\",\n );\n\n const we_need = pg(\n \"we need ${resourceGoal}.\",\n \"you need to collect ${resourceGoal}.\",\n );\n\n const tail = pg(\n skip,\n \"Best of luck!\",\n \"Good luck out there!\",\n \"We're counting on you!\",\n ).then(end);\n\n start\n .then(\n state(\"hasMonsters\")\n .then(skip, state(\"hasSlugs\"))\n .then(\n \"defend the Rock Radier HQ\",\n \"build up your defenses\",\n \"arm your Rock Raiders\",\n )\n .then(\"and\"),\n state(\"hasSlugs\")\n .then(\"defend the Rock Radier HQ\", \"arm your Rock Raiders\")\n .then(\"and\"),\n pg(\n skip,\n state(\"spawnHasErosion\").then(\n \"get your Rock Raiders to safety,\",\n \"make sure your Rock Raiders are safe,\",\n ),\n state(\"spawnIsHq\")\n .then(state(\"hqIsRuin\", \"spawnHasErosion\"))\n .then(\"move to a safer cavern,\", \"find a more suitable location,\"),\n )\n .then(\n \"build the Rock Raider HQ\",\n \"build up your base\",\n state(\"spawnIsHq\").then(\n \"send some Rock Raiders down to this base\",\n pg(\"resume mining operations and\")\n .then(collect_resources)\n .then(cut),\n state(\"hqIsRuin\").then(\n \"clean up this mess\",\n \"get the Rock Raider HQ back in operation\",\n ),\n ),\n state(\"findHq\")\n .then(\"reach the Rock Raider HQ\", \"locate the base\")\n .then(\n skip,\n state(\"hqIsRuin\").then(\n \", salvage what's left\",\n \", repair it\",\n \", get it back in working order\",\n ),\n ),\n )\n .then(\n \"and\",\n \"and use it to\",\n \", and when you are ready,\",\n pg(\n state(\"hasMonsters\").then(state(\"hasSlugs\"), skip),\n state(\"hasSlugs\"),\n )\n .then(\"and keep it safe.\", \"and make sure it is heavily defended.\")\n .then(\"Then,\", we_need.then(cut)),\n ),\n )\n .then(\n collect_resources,\n pg(\n \"continue mining operations.\",\n \"explore the cavern.\",\n \"resume our mining operation.\",\n \"search the cavern.\",\n )\n .then(we_need)\n .then(cut),\n pg(\"find\", \"locate\", \"search the cavern for\")\n .then(\n state(\"lostMinersOne\")\n .then(\"the\", \"that\")\n .then(\"lost Rock Raider\", \"missing Rock Raider\"),\n state(\"lostMinersTogether\")\n .then(\"the\", \"that\")\n .then(\n \"cavern with the lost Rock Raiders\",\n \"missing group of Rock Raiders\",\n ),\n state(\"lostMinersApart\")\n .then(\"the\", \"those\")\n .then(\"lost Rock Raiders\", \"missing Rock Raiders\"),\n )\n .then(\".\", state(\"hasMonsters\").then(\"before the ${enemies} do!\"))\n .then(\n tail,\n pg(\n \"Once you've found them,\",\n \"With them safe,\",\n \"When they are safe,\",\n ).then(we_need, collect_resources),\n ),\n );\n\n pg(we_need, collect_resources).then(state(\"resourceObjective\")).then(tail);\n});\n\nexport default ORDERS;\n","/* eslint-disable no-template-curly-in-string */\n\nimport { State } from \"../lore\";\nimport phraseGraph from \"../builder\";\n\nconst PREMISE = phraseGraph(({ pg, state, start, end, cut, skip }) => {\n // Complete, fully-constructed premises in one line.\n start\n .then(\n \"Our mining operations have been going smoothly, and we are ready to \" +\n \"move on to the next cavern.\",\n \"There is nothing out of the ordinary to report today.\",\n \"Things have been quiet and I hope they should remain that way, Cadet!\",\n )\n .then(end);\n\n const greeting = start.then(\n pg(\n \"Are you ready for the next mission?\",\n \"Welcome back, Cadet.\",\n \"I hope you're prepared for this one, Cadet.\",\n \"Up and at 'em, Cadet!\",\n \"Cadet, are you up for some more action?\",\n state(\"floodedWithWater\").then(\n \"Are you ready to set sail?\",\n \"I hope you packed your lifejacket, Cadet.\",\n ),\n state(\"floodedWithLava\").then(\n \"I hope you're not afraid of a little heat!\",\n \"You'd better keep your cool with this one!\",\n ),\n ).then(\"\\n\\n\"),\n skip,\n );\n\n const additionalHardship = (() => {\n const spawnHasErosion = state(\"spawnHasErosion\").then(\n \"we are dangerously close to a cavern full of lava\",\n \"we are concerned about nearby lava flows that could engulf this cavern\",\n \"you will need to keep an eye on the volcanic activity in this cavern to avoid being buried in lava\",\n );\n\n const hasMonstersTexts = pg(\n state(\"hasMonsters\").then(skip, state(\"hasSlugs\")),\n state(\"hasSlugs\"),\n ).then(\n \"the tunnels here are full of large creatures that threaten our operations\",\n \"we are picking up signs of large creatures in the area\",\n \"this cavern is inhabited by nests of ${enemies}\",\n \"we have reason to believe there are dozens of ${enemies} just out of sight\",\n );\n\n spawnHasErosion.then(\", and\").then(hasMonstersTexts);\n return pg(spawnHasErosion, hasMonstersTexts).then(\".\").then(end);\n })();\n\n // Weird case to explain: Find HQ, but the HQ is intact and there are no lost miners.\n // Blame Canada... or bureaucracy.\n greeting\n .then(state(\"findHq\"))\n .then(skip, state(\"spawnHasErosion\"))\n .then(skip, state(\"treasureCaveOne\", \"treasureCaveMany\"))\n .then(skip, state(\"spawnIsNomadOne\", \"spawnIsNomadsTogether\"))\n .then(\n \"A forward team has established Rock Raider HQ in the viscinity, but \" +\n \"we haven't had the means to use it yet.\",\n \"There should be a base near here primed and ready for our mining \" +\n \"operations, but our teleporters are unable to get a lock on it for \" +\n \"some reason.\",\n \"We've had our eyes on this region and were all set to mine here. \" +\n \"Unfortunately, the signed copy of Form 27b-6 went missing below a \" +\n \"desk, we forgot about it, and now we aren't exactly sure where that \" +\n \"base is.\",\n state(\"hasMonsters\")\n .then(skip, state(\"hasSlugs\"))\n .then(\n \"We were all set to mine this cavern, but the team was scared off \" +\n \"by readings of ${enemies} in the area. They left in such a hurry \" +\n \"that they forgot to record where exactly the Rock Raider HQ is.\",\n \"There should be a base near here, but it's not showing up on our \" +\n \"scanners. We hope it hasn't been destroyed by ${enemies}, but to \" +\n \"be safe, we're sending you to a nearby cavern instead.\",\n ),\n state(\"hasSlugs\").then(\n \"We were all set to mine this cavern, but the team was scared off \" +\n \"by a Slimy Slug that suddenly appeared in the middle of our HQ. \" +\n \"They even left without recording their location properly.\",\n \"There should be a base near here, but it's not showing up on our \" +\n \"scanners. Some interference from ${enemies} must have shut off \" +\n \"its location beacon! To be safe, we're sending you to a nearby \" +\n \"cavern instead.\",\n ),\n )\n .then(end);\n\n // Maybe treasure, maybe spawn is HQ.\n greeting\n .then(\n pg(\"A recent scan\", \"Our most recent geological survey\").then(\n \"found\",\n \"has discovered\",\n \"has indicated\",\n ),\n pg(\"We\", \"The scanners\", \"The scanners aboard the L.M.S. Explorer\").then(\n \"have found\",\n \"have located\",\n \"have discovered\",\n ),\n )\n .then(\n state(\"treasureCaveOne\").then(\n \"a large Energy Crystal signature near here\",\n \"a nearby cave with an abundance of Energy Crystals\",\n ),\n state(\"treasureCaveMany\").then(\n \"large deposits of Energy Crystals in this cavern\",\n \"a cave system with an abundance of Energy Crystals\",\n ),\n \"another cavern where we can continue our mining operations\",\n )\n .then(\n pg(\".\").then(end),\n pg(\n \". \\n\\nHowever,\",\n \". \\n\\nUnfortunately,\",\n \". \\n\\nUnfortunately for us,\",\n \". \\n\\nThe bad news?\",\n \". Use caution!\",\n \", but proceed with caution!\\n\\n\",\n \", but this is no walk in the park.\",\n ).then(additionalHardship),\n state(\"spawnIsHq\")\n .then(\n \", and we have established our Rock Raider HQ.\",\n \", and our HQ is ready to go!\",\n )\n .then(\n pg(\n \"\\n\\nHowever,\",\n \"\\n\\nUnfortunately,\",\n \"\\n\\nUnfortunately for us,\",\n \"\\n\\nThe bad news?\",\n \"Don't be fooled, though.\",\n \"I do ask that you be careful down there!\",\n ).then(additionalHardship),\n end,\n ),\n pg(\n state(\"spawnIsNomadOne\").then(\n \". Your mission is to find a suitable location for our Rock Raider \" +\n \"HQ.\",\n ),\n state(\"spawnIsNomadsTogether\").then(\n \". We haven't yet chosen where to establish our base, so I'm \" +\n \"leaving that decision to you.\",\n \", and I've picked this team to decide where to build our HQ.\",\n ),\n )\n .then(\n skip,\n pg(\n state(\"hasMonsters\").then(skip, state(\"hasSlugs\")),\n state(\"hasSlugs\"),\n ).then(\n \"\\n\\nBe on the lookout for ${enemies}, especially once you start \" +\n \"construction.\",\n \"Use caution! There may be ${enemies} afoot and I don't want you \" +\n \"taking any unnecessary risk.\",\n ),\n )\n .then(skip, state(\"spawnHasErosion\"))\n .then(end),\n );\n\n const negativeGreeting = pg(\n greeting,\n start\n .then(\n \"Things have been going smoothly... until now!\",\n \"Bad news, Cadet!\",\n \"We need your help, Cadet.\",\n \"Oh, dear.\",\n )\n .then(\"\\n\\n\"),\n );\n\n const alsoAdditionalHardship = pg(\n \"Also,\",\n \"If that wasn't hard enough,\",\n \"It gets worse:\",\n ).then(additionalHardship);\n\n const findThem = pg(\n \"we're counting on you to find them!\",\n \"we don't know how long they'll last out there.\",\n state(\"hasMonsters\").then(\n \"we need to find them before the ${enemies} do.\",\n \"I hope they don't meet any of the ${enemies} roaming this cavern.\",\n ),\n )\n .then(state(\"spawnHasErosion\"), skip)\n .then(end);\n\n const findTheOthers = pg(\n \"we're counting on you to find the others!\",\n state(\"hasMonsters\").then(\n \"you need to find the others before the ${enemies} do.\",\n ),\n )\n .then(state(\"spawnHasErosion\"), skip)\n .then(end);\n\n // A teleporter accident caused lost miners or nomad spawn.\n // Maybe treasure, maybe find spawn or spawn is HQ.\n negativeGreeting\n .then(state(\"treasureCaveOne\", \"treasureCaveMany\"), skip)\n .then(\n skip,\n state(\"spawnIsHq\", \"findHq\").then(\n \"We established our Rock Raider HQ, but\",\n \"We constructed our base and were ready to begin mining. \" +\n \"Unfortunately,\",\n ),\n )\n .then(\n state(\"spawnIsNomadOne\").then(\n \"a teleporter malfunction sent this Rock Raider to an uncharted cavern.\",\n \"the teleporter on the L.M.S. Explorer has been acting up again and \" +\n \"one of our Rock Raiders is trapped in an uncharted cavern.\",\n \"one of our Rock Raiders was accidentally sent to the wrong cavern!\",\n ),\n state(\"spawnIsNomadsTogether\").then(\n \"a teleporter malfunction sent a group of our Rock Raiders to an \" +\n \"uncharted cavern.\",\n \"the teleporter on the L.M.S. Explorer has been acting up again and \" +\n \"a group of our Rock Raiders ended up in an uncharted cavern.\",\n ),\n pg(\n state(\"lostMinersOne\").then(\n \"a teleporter malfunction sent one of our Rock Raiders to a cavern \" +\n \"near here.\",\n \"the teleporter on the L.M.S. Explorer has been acting up again and \" +\n \"one of our Rock Raiders is trapped in an uncharted cavern.\",\n \"one of our Rock Raiders was accidentally sent to the wrong cavern!\",\n ),\n state(\"lostMinersTogether\").then(\n \"a teleporter malfunction sent a group of our Rock Raiders to a \" +\n \"cavern near here.\",\n \"the teleporter on the L.M.S. Explorer has been acting up again and \" +\n \"a group of our Rock Raiders ended up in an uncharted cavern.\",\n ),\n state(\"lostMinersApart\").then(\n \"a teleporter malfunction scattered ${lostMinersCount} of our Rock \" +\n \"Raiders throughout this cavern.\",\n \"the teleporters have failed again and ${lostMinerCavesCount} \" +\n \"groups of Rock Raiders are lost somewhere in this cavern.\",\n ),\n ).then(skip, findThem.then(cut)),\n state(\"spawnIsNomadOne\", \"spawnIsNomadsTogether\")\n .then(state(\"lostMinersOne\", \"lostMinersTogether\", \"lostMinersApart\"))\n .then(\n \"a teleporter malfunction left our Rock Raiders scattered throughout \" +\n \"this cavern.\",\n )\n .then(skip, findTheOthers.then(cut)),\n )\n .then(\n pg(\n \"Our engineers have assured us the teleporters have been repaired, \" +\n \"but\",\n \"While the teleporters are back in working order,\",\n ).then(additionalHardship),\n alsoAdditionalHardship,\n );\n\n // Earthquakes or raids destroyed HQ.\n // HQ is ruin, maybe treasure, spawn is HQ or find HQ, maybe lost miners.\n negativeGreeting\n .then(state(\"hqIsRuin\"))\n .then(state(\"treasureCaveOne\", \"treasureCaveMany\"), skip)\n .then(state(\"hasSlugs\"), skip)\n .then(\n \"Recent seismic activity has damaged our Rock Raider HQ\",\n \"An earthquake in this area has caused several cave-ins and destroyed \" +\n \"part of our Rock Raider HQ\",\n state(\"hasMonsters\").then(\n \"A horde of ${enemies} attacked our Rock Raider HQ\",\n ),\n )\n .then(\n pg(\", and\")\n .then(skip, state(\"spawnIsHq\", \"findHq\"))\n .then(\n pg(\n state(\"lostMinersOne\").then(\"one of our Rock Raiders is missing.\"),\n state(\"lostMinersTogether\").then(\n \"a group of Rock Raidiers are missing.\",\n \"a group of Rock Raidiers are trapped somewhere in the cavern.\",\n ),\n state(\"lostMinersApart\").then(\n \"some of our Rock Raidiers are missing.\",\n \"our Rock Raiders are trapped throughout the cavern.\",\n ),\n ).then(skip, findThem.then(cut)),\n state(\"spawnIsNomadOne\", \"spawnIsNomadsTogether\")\n .then(\n state(\"lostMinersOne\", \"lostMinersTogether\", \"lostMinersApart\"),\n )\n .then(\n \"our Rock Raiders have been scattered throughout this cavern.\",\n )\n .then(skip, findTheOthers.then(cut)),\n )\n .then(alsoAdditionalHardship, additionalHardship),\n pg(\n \". We were able to evacuate in time\",\n \". All of our Rock Raiders made it out\",\n \". We evacuated the cavern\",\n \". Everyone evacuated safely\",\n )\n .then(\n state(\"findHq\").then(\n \", but this is as close as we can get for now.\",\n \", but without the homing beacon we don't want to risk \" +\n \"teleporting anyone directly inside.\",\n state(\"spawnIsNomadOne\").then(\n \", but we can't get you any closer than this.\",\n \", but we cannot risk teleporting you in any closer than this.\",\n \", and we want you to return to the base and salvage what's \" +\n \"left of it.\",\n ),\n state(\"spawnIsNomadsTogether\").then(\n \", and you'll be leading the salvage team.\",\n \", and this is the team that will restore our operations.\",\n ),\n ),\n state(\"spawnIsHq\").then(\n \", but this is all that's left.\",\n \"and now we need to pick up the pieces and try again.\",\n ),\n )\n .then(additionalHardship, end),\n );\n});\nexport default PREMISE;\n","import phraseGraph from \"../builder\";\nimport { State } from \"../lore\";\n\nexport const SEISMIC_FORESHADOW = phraseGraph(\n ({ pg, state, start, end, cut, skip }) => {\n start\n .then(\"I don't like the look of this.\", \"This could be a problem.\", skip)\n .then(\n \"Our scanners are picking up seismic activity in the area.\",\n \"We're detecting an increase in geological activity nearby.\",\n )\n .then(\n \"Be careful down there!\",\n \"Keep an eye out for anything unusual.\",\n \"Stay sharp and keep your Rock Raiders safe.\",\n )\n .then(end);\n },\n);\n","import { HqMetadata } from \"../architects/established_hq\";\nimport { countLostMiners } from \"../architects/lost_miners\";\nimport { DiceBox, PseudorandomStream } from \"../common\";\nimport { filterTruthy } from \"../common/utils\";\nimport { Plan } from \"../models/plan\";\nimport { FluidType, Tile } from \"../models/tiles\";\nimport { AdjuredCavern } from \"../transformers/04_ephemera/01_adjure\";\nimport { FAILURE, SUCCESS } from \"./graphs/conclusions\";\nimport {\n FOUND_ALL_LOST_MINERS,\n FOUND_HOARD,\n FOUND_HQ,\n FOUND_LOST_MINERS,\n FOUND_SLUG_NEST,\n NOMADS_SETTLED,\n} from \"./graphs/events\";\nimport { NAME } from \"./graphs/names\";\nimport ORDERS from \"./graphs/orders\";\nimport PREMISE from \"./graphs/premise\";\nimport { SEISMIC_FORESHADOW } from \"./graphs/seismic\";\n\nexport type State = {\n readonly floodedWithWater: boolean;\n readonly floodedWithLava: boolean;\n readonly lostMinersOne: boolean;\n readonly lostMinersTogether: boolean;\n readonly lostMinersApart: boolean;\n readonly resourceObjective: boolean;\n readonly hasMonsters: boolean;\n readonly hasSlugs: boolean;\n readonly spawnHasErosion: boolean;\n readonly spawnIsHq: boolean;\n readonly spawnIsNomadOne: boolean;\n readonly spawnIsNomadsTogether: boolean;\n readonly findHq: boolean;\n readonly hqIsRuin: boolean;\n readonly treasureCaveOne: boolean;\n readonly treasureCaveMany: boolean;\n readonly rockBiome: boolean;\n readonly iceBiome: boolean;\n readonly lavaBiome: boolean;\n};\n\nexport type FoundLostMinersState = State & {\n readonly foundMinersOne: boolean;\n readonly foundMinersTogether: boolean;\n};\n\ntype ReplaceStrings = {\n readonly lostMinersCount: string;\n readonly lostMinerCavesCount: string;\n readonly enemies: string;\n readonly resourceGoal: string;\n readonly resourceGoalNamesOnly: string;\n};\n\nenum Die {\n premise = 0,\n orders,\n success,\n failure,\n foundHoard,\n foundHq,\n foundAllLostMiners,\n nomadsSettled,\n foundSlugNest,\n name,\n}\n\nfunction floodedWith(cavern: AdjuredCavern): FluidType {\n let lava = 0;\n let water = 0;\n for (const plan of cavern.plans) {\n if (plan.fluid === Tile.LAVA) {\n lava++;\n } else if (plan.fluid === Tile.WATER) {\n water++;\n }\n }\n if (lava / cavern.plans.length > 0.4) {\n return Tile.LAVA;\n }\n if (water / cavern.plans.length > 0.4) {\n return Tile.WATER;\n }\n return null;\n}\n\nfunction joinHuman(things: string[], conjunction: string = \"and\"): string {\n if (things.length === 0) {\n return \"\";\n }\n if (things.length === 1) {\n return things[0];\n }\n return `${things.slice(0, -1).join(\", \")} ${conjunction} ${things[things.length - 1]}`;\n}\n\nconst ONES = [\n \"one\",\n \"two\",\n \"three\",\n \"four\",\n \"five\",\n \"six\",\n \"seven\",\n \"eight\",\n \"nine\",\n \"ten\",\n \"eleven\",\n \"twelve\",\n \"thirteen\",\n \"fourteen\",\n \"fifteen\",\n \"sixteen\",\n \"seventeen\",\n \"eighteen\",\n \"nineteen\",\n];\nconst TENS = [\n \"twenty\",\n \"thirty\",\n \"forty\",\n \"fifty\",\n \"sixty\",\n \"seventy\",\n \"eighty\",\n \"ninety\",\n];\n\nfunction spellNumber(n: number): string {\n if (n > 999 || n < 0) {\n return n.toString();\n }\n if (n === 0) {\n return \"zero\";\n }\n const result: string[] = [];\n if (n >= 100) {\n result.push(`${spellNumber(Math.floor(n / 100))} hundred`);\n n %= 100;\n }\n if (n >= 20) {\n result.push(TENS[Math.floor(n / 10) - 2]);\n n %= 10;\n }\n if (n > 0) {\n result.push(ONES[n - 1]);\n n = 0;\n }\n return result.join(\" \");\n}\n\nfunction spellResourceGoal(cavern: AdjuredCavern) {\n const a = [\n { count: cavern.objectives.crystals, name: \"Energy Crystals\" },\n { count: cavern.objectives.ore, name: \"Ore\" },\n { count: cavern.objectives.studs, name: \"Building Studs\" },\n ].filter(({ count }) => count > 0);\n return {\n resourceGoal: joinHuman(\n a.map(({ count, name }) => `${spellNumber(count)} ${name}`),\n ),\n resourceGoalNamesOnly: joinHuman(a.map(({ name }) => name)),\n };\n}\n\nexport class Lore {\n readonly state: State;\n readonly vars: ReplaceStrings;\n constructor(cavern: AdjuredCavern) {\n const fluidType = floodedWith(cavern);\n\n const { lostMiners, lostMinerCaves } = countLostMiners(cavern);\n\n const spawn = cavern.plans.find((p) => !p.hops.length)!;\n\n const hq = cavern.plans.find(\n (p) => p.metadata?.tag === \"hq\",\n ) as Plan;\n const spawnIsHq = spawn === hq;\n const findHq = !!hq && !spawnIsHq;\n const hqIsRuin = !!hq?.metadata.ruin;\n\n const nomads =\n spawn.metadata?.tag === \"nomads\"\n ? (spawn.metadata.minersCount as number)\n : 0;\n\n const treasures = cavern.plans.reduce(\n (r, plan) => (plan.metadata?.tag === \"treasure\" ? r + 1 : r),\n 0,\n );\n\n this.state = {\n floodedWithWater: fluidType === Tile.WATER,\n floodedWithLava: fluidType === Tile.LAVA,\n lostMinersOne: lostMiners === 1,\n lostMinersTogether: lostMiners > 1 && lostMinerCaves === 1,\n lostMinersApart: lostMinerCaves > 1,\n resourceObjective:\n cavern.objectives.crystals > 0 ||\n cavern.objectives.ore > 0 ||\n cavern.objectives.studs > 0,\n hasMonsters: cavern.context.hasMonsters,\n hasSlugs: cavern.context.hasSlugs,\n spawnHasErosion: spawn.hasErosion,\n spawnIsHq,\n findHq,\n hqIsRuin,\n spawnIsNomadOne: nomads === 1,\n spawnIsNomadsTogether: nomads > 1,\n treasureCaveOne: treasures === 1,\n treasureCaveMany: treasures > 1,\n rockBiome: cavern.context.biome === \"rock\",\n iceBiome: cavern.context.biome === \"ice\",\n lavaBiome: cavern.context.biome === \"lava\",\n };\n\n const enemies = filterTruthy([\n cavern.context.hasMonsters &&\n {\n rock: \"Rock Monsters\",\n ice: \"Ice Monsters\",\n lava: \"Lava Monsters\",\n }[cavern.context.biome],\n cavern.context.hasSlugs && \"Slimy Slugs\",\n ]).join(\" and \");\n\n this.vars = {\n enemies,\n lostMinersCount: spellNumber(lostMiners),\n lostMinerCavesCount: spellNumber(lostMinerCaves),\n ...spellResourceGoal(cavern),\n };\n }\n\n briefings(dice: DiceBox) {\n return {\n name: NAME.generate(dice.lore(Die.name), this.state, this.vars),\n premise: PREMISE.generate(dice.lore(Die.premise), this.state, this.vars),\n orders: ORDERS.generate(dice.lore(Die.orders), this.state, this.vars),\n success: SUCCESS.generate(\n dice.lore(Die.success),\n { ...this.state, commend: true },\n this.vars,\n ),\n failure: FAILURE.generate(dice.lore(Die.failure), this.state, this.vars),\n };\n }\n\n foundHoard(dice: DiceBox) {\n return FOUND_HOARD.generate(\n dice.lore(Die.foundHoard),\n this.state,\n this.vars,\n );\n }\n\n foundHq(dice: DiceBox) {\n return FOUND_HQ.generate(dice.lore(Die.foundHq), this.state, this.vars);\n }\n\n foundLostMiners(rng: PseudorandomStream, foundMinersCount: number) {\n return FOUND_LOST_MINERS.generate(\n rng,\n {\n ...this.state,\n foundMinersOne: foundMinersCount <= 1,\n foundMinersTogether: foundMinersCount > 1,\n },\n {\n ...this.vars,\n foundMinersCount: foundMinersCount.toFixed(),\n },\n );\n }\n\n foundAllLostMiners(dice: DiceBox) {\n return FOUND_ALL_LOST_MINERS.generate(\n dice.lore(Die.foundAllLostMiners),\n this.state,\n this.vars,\n );\n }\n\n nomadsSettled(dice: DiceBox) {\n return NOMADS_SETTLED.generate(\n dice.lore(Die.nomadsSettled),\n this.state,\n this.vars,\n );\n }\n\n generateFoundSlugNest(dice: DiceBox) {\n return FOUND_SLUG_NEST.generate(\n dice.lore(Die.foundSlugNest),\n this.state,\n this.vars,\n );\n }\n\n generateSeismicForeshadow(rng: PseudorandomStream) {\n return SEISMIC_FORESHADOW.generate(rng, this.state, this.vars);\n }\n}\n","import { CavernContext } from \"../../common\";\nimport { Lore } from \"../../lore/lore\";\nimport { AdjuredCavern } from \"./01_adjure\";\n\nexport type EnscribedCavern = AdjuredCavern & {\n fileName: string;\n lore: Lore;\n levelName: string;\n briefing: {\n intro: string;\n success: string;\n failure: string;\n };\n};\n\nconst OVERRIDE_SUFFIXES = [\n \"Ablated\",\n \"Boosted\",\n \"Chief's Version\",\n \"Chrome Edition\",\n \"Diamond Edition\",\n \"Director's Cut\",\n \"Emerald Edition\",\n \"Enhanced\",\n \"Extended\",\n \"Gold Edition\",\n \"HD\",\n \"HD 1.5 Remix\",\n \"Millenium Edition\",\n \"Planet U Remix\",\n \"Platinum Edition\",\n \"Rebirthed\",\n \"Reborn\",\n \"Recoded\",\n \"Rectified\",\n \"Recycled\",\n \"Redux\",\n \"Reimagined\",\n \"Reloaded\",\n \"Remixed\",\n \"Ressurection\",\n \"Retooled\",\n \"Revenant\",\n \"Revolutions\",\n \"Ruby Edition\",\n \"Sapphire Edition\",\n \"Silver Edition\",\n \"Special Edition\",\n \"Ungrounded\",\n \"Unleashed\",\n \"Unlocked\",\n \"Unplugged\",\n \"Uranium Edition\",\n];\n\nfunction overrideSuffix(context: CavernContext) {\n const s = [...context.overrides]\n .sort()\n .map((k) => `${k}:${JSON.stringify(context[k])}`)\n .join(\",\");\n // https://stackoverflow.com/questions/7616461/generate-a-hash-from-string-in-javascript\n let v = 0;\n for (let i = 0; i < s.length; i++) {\n v = (v << 5) - v + s.charCodeAt(i);\n v |= 0;\n }\n v = Math.abs(v) % OVERRIDE_SUFFIXES.length;\n return OVERRIDE_SUFFIXES[v];\n}\n\nexport default function enscribe(cavern: AdjuredCavern): EnscribedCavern {\n const hasOverrides = cavern.context.overrides.length;\n\n const fileName = (() => {\n const seed = cavern.context.seed.toString(16).padStart(8, \"0\");\n return [\n \"gh\",\n seed.substring(0, 3),\n seed.substring(3, 6),\n [\n seed.substring(6),\n { rock: \"k\", ice: \"e\", lava: \"a\" }[cavern.context.biome],\n hasOverrides ? \"x\" : \"\",\n ].join(\"\"),\n ].join(\"-\");\n })();\n\n const lore = new Lore(cavern);\n const { name, premise, orders, success, failure } = lore.briefings(\n cavern.dice,\n );\n const levelName = hasOverrides\n ? `${name.text} (${overrideSuffix(cavern.context)})`\n : name.text;\n const briefing = {\n intro: `${premise.text}\\n\\n${orders.text}`,\n success: success.text,\n failure: failure.text,\n };\n return { ...cavern, fileName, lore, levelName, briefing };\n}\n","import { Point } from \"../../common/geometry\";\nimport { Grid } from \"../../common/grid\";\nimport { serializeBuilding } from \"../../models/building\";\nimport { serializeCreature } from \"../../models/creature\";\nimport { Erosion, Landslide } from \"../../models/hazards\";\nimport { serializeMiner } from \"../../models/miner\";\nimport { serializeObjectives } from \"../../models/objectives\";\nimport { serializePosition } from \"../../models/position\";\nimport { Tile } from \"../../models/tiles\";\nimport { serializeVehicle } from \"../../models/vehicle\";\nimport { ProgrammedCavern } from \"./03_program\";\n\nexport type SerializedCavern = ProgrammedCavern & {\n serialized: string;\n};\n\n// If any of these are found in the level output, assume JavaScript did\n// something stupid and throw an error.\nconst RESTRICTED_STRINGS = [\"[object Object]\", \"undefined\", \"NaN\"] as const;\n\nfunction indent(it: string, prefix: string) {\n return it\n .split(/\\r?\\n/)\n .map((line) => `${prefix}${line}`)\n .join(\"\\n\");\n}\n\nfunction comments(cavern: ProgrammedCavern) {\n return `Cavern generated by groundHog v${process.env.REACT_APP_VERSION}\nhttps://github.com/charredUtensil/groundhog\ncontext = ${JSON.stringify(cavern.context, null, 2)}`;\n}\n\n/**\n * Coordinate data for anything that uses 'x,y/' or 'y,x/' format.\n * Unfortunately, MM is inconsistent and uses both.\n */\nfunction pointSet(points: Point[], [ox, oy]: Point, mode: \"xy\" | \"yx\"): string {\n return points\n .map(([x, y]) => {\n const xs = (x + ox).toFixed();\n const ys = (y + oy).toFixed();\n return mode === \"xy\" ? `${xs},${ys}/` : `${ys},${xs}/`;\n })\n .join();\n}\n\nfunction grid(\n cavern: ProgrammedCavern,\n fencepost: 0 | 1,\n fn: (x: number, y: number) => string,\n): string {\n const result: string[] = [];\n for (let y = cavern.top; y < cavern.bottom + fencepost; y++) {\n const row: string[] = [];\n for (let x = cavern.left; x < cavern.right + fencepost; x++) {\n row.push(`${fn(x, y)},`);\n }\n result.push(row.join(\"\"));\n }\n return result.join(\"\\n\");\n}\n\nexport function serializeHazards(\n hazards: Grid,\n offset: Point,\n): string {\n const out = new Map();\n hazards.forEach((h, x, y) => {\n const key = h.key;\n if (out.has(key)) {\n out.get(key)!.push([x, y]);\n } else {\n out.set(key, [[x, y]]);\n }\n });\n return Array.from(out.entries())\n .sort(([a], [b]) => parseInt(b) - parseInt(a))\n .map(([key, points]) => `${key}:${pointSet(points, offset, \"xy\")}`)\n .join(\"\\n\");\n}\n\nfunction performErrorChecking(serialized: string) {\n serialized.split(\"\\n\").forEach((line, i) => {\n RESTRICTED_STRINGS.forEach((restricted) => {\n if (line.includes(restricted)) {\n throw new Error(\n `Found restricted string ${JSON.stringify(restricted)} on line ${i}:\\n${line}`,\n );\n }\n });\n });\n}\n\nexport default function serialize(cavern: ProgrammedCavern): SerializedCavern {\n const offset: Point = [-cavern.left, -cavern.top];\n\n const serialized = `comments{\n${indent(comments(cavern), \" \")}\n}\ninfo{\nrowcount:${(cavern.right - cavern.left).toFixed()}\ncolcount:${(cavern.bottom - cavern.top).toFixed()}\ncamerapos:${serializePosition(cavern.cameraPosition, offset, cavern.height, 0, \"entity\")}\nbiome:${cavern.context.biome}\ncreator:groundHog\nlevelname:${cavern.levelName}\nopencaves:${pointSet(\n cavern.openCaveFlags.map((_, x, y) => [x, y]),\n offset,\n \"yx\",\n )}\n${cavern.oxygen ? `oxygen:${cavern.oxygen.join(\"/\")}` : \"\"}\nspiderrate:10\nspidermin:2\nspidermax:4\n${\n // Version is the version of MM the level was \"made by\".\n (() => \"version:2023-08-14-1\")()\n}\n}\ntiles{\n${grid(cavern, 0, (x, y) => {\n const tile = cavern.tiles.get(x, y) ?? Tile.SOLID_ROCK;\n const offset =\n !tile.isWall && !cavern.discoveryZones.get(x, y)?.openOnSpawn ? 100 : 0;\n return (tile.id + offset).toFixed();\n})}\n}\nheight{\n${grid(cavern, 1, (x, y) => cavern.height.get(x, y)!.toFixed())}\n}\nresources{\ncrystals:\n${grid(cavern, 0, (x, y) => (cavern.crystals.get(x, y) ?? 0).toFixed())}\nore:\n${grid(cavern, 0, (x, y) => (cavern.ore.get(x, y) ?? 0).toFixed())}\n}\nobjectives{\n${serializeObjectives(cavern.objectives)}\n}\nbuildings{\n${cavern.buildings.map((b) => serializeBuilding(b, offset, cavern.height)).join(\"\\n\")}\n}\nlandslidefrequency{\n${serializeHazards(cavern.landslides, offset)}\n}\nlavaspread{\n${serializeHazards(cavern.erosion, offset)}\n}\ncreatures{\n${cavern.creatures.map((c) => serializeCreature(c, offset, cavern.height)).join(\"\\n\")}\n}\nminers{\n${cavern.miners.map((m) => serializeMiner(m, offset, cavern.height)).join(\"\\n\")}\n}\nvehicles{\n${cavern.vehicles.map((v) => serializeVehicle(v, offset, cavern.height)).join(\"\\n\")}\n}\nbriefing{\n${cavern.briefing.intro}\n}\nbriefingsuccess{\n${cavern.briefing.success}\n}\nbriefingfailure{\n${cavern.briefing.failure}\n}\nblocks{\n}\nscript{\n${\n // Script is done after fence, so it doesn't need any offsetting.\n cavern.script\n}\n\n}`;\n\n performErrorChecking(serialized);\n return { ...cavern, serialized };\n}\n","import { tf } from \"../../common/transform\";\nimport adjure from \"./01_adjure\";\nimport aerate from \"./00_aerate\";\nimport enscribe from \"./02_enscribe\";\nimport program from \"./03_program\";\nimport serialize from \"./04_serialize\";\n\nexport const EPHEMERA_TF = tf(aerate)\n .then(adjure)\n .then(enscribe)\n .then(program)\n .then(serialize);\n","import { getTotalCrystals } from \"../../architects/utils/resources\";\nimport { Architect } from \"../../models/architect\";\nimport { Objectives } from \"../../models/objectives\";\nimport { AeratedCavern } from \"./00_aerate\";\n\nexport type AdjuredCavern = AeratedCavern & {\n objectives: Objectives;\n};\n\nexport default function adjure(cavern: AeratedCavern): AdjuredCavern {\n const objectives = cavern.plans\n .reduce((r: Architect[\"objectives\"][], plan) => {\n const fn = plan.architect.objectives;\n if (!r.some((f) => Object.is(fn, f))) {\n r.push(fn);\n }\n return r;\n }, [])\n .map((fn) => fn({ cavern }))\n .reduce(\n (r: Objectives & { sufficient: boolean }, obj) => ({\n crystals: Math.max(r.crystals ?? 0, obj?.crystals ?? 0),\n ore: Math.max(r.ore ?? 0, obj?.ore ?? 0),\n studs: Math.max(r.studs ?? 0, obj?.studs ?? 0),\n variables: [...r.variables, ...(obj?.variables ?? [])],\n sufficient: !!(r.sufficient || obj?.sufficient),\n }),\n {\n crystals: 0,\n ore: 0,\n studs: 0,\n variables: [],\n sufficient: false,\n },\n );\n // If no architects produced sufficient objectives, use crystal goal ratio.\n if (!objectives.sufficient) {\n objectives.crystals = Math.max(\n objectives.crystals,\n Math.floor(\n (getTotalCrystals(cavern) * cavern.context.crystalGoalRatio) / 5,\n ) * 5,\n );\n }\n return { ...cavern, objectives };\n}\n","import { filterTruthy } from \"../../common/utils\";\nimport { Architect } from \"../../models/architect\";\nimport { EnscribedCavern } from \"./02_enscribe\";\n\nexport type ProgrammedCavern = EnscribedCavern & {\n readonly script: string;\n};\n\nexport default function program(cavern: EnscribedCavern): ProgrammedCavern {\n // All unique globals function objects\n const globalsFns = Array.from(\n cavern.plans.reduce((r: Architect[\"scriptGlobals\"][], plan) => {\n const fn = plan.architect.scriptGlobals;\n if (!r.some((f) => Object.is(fn, f))) {\n r.push(fn);\n }\n return r;\n }, []),\n );\n const archGlobals = filterTruthy(globalsFns.map((fn) => fn({ cavern })));\n const archScripts = filterTruthy(\n cavern.plans.map((plan) => plan.architect.script({ cavern, plan })),\n );\n const monsters = cavern.context.hasMonsters\n ? filterTruthy(\n cavern.plans.map((plan) =>\n plan.architect.monsterSpawnScript({ cavern, plan }),\n ),\n )\n : [];\n const slugs = cavern.context.hasSlugs\n ? filterTruthy(\n cavern.plans.map((plan) =>\n plan.architect.slugSpawnScript({ cavern, plan }),\n ),\n )\n : [];\n const na = [\"# n/a\", \"\"];\n const script = [\n \"# I. Architect Globals\",\n ...(archGlobals.length ? archGlobals : na),\n \"# II. Architect Scripts\",\n ...(archScripts.length ? archScripts : na),\n \"# III. Spawn Monsters\",\n ...(monsters.length ? monsters : na),\n \"# IV. Spawn Slugs\",\n ...(slugs.length ? slugs : na),\n ].join(\"\\n\");\n\n return { ...cavern, script };\n}\n","export type Objectives = {\n readonly crystals: number;\n readonly ore: number;\n readonly studs: number;\n readonly variables: readonly {\n readonly condition: string;\n readonly description: string;\n }[];\n};\n\nexport function serializeObjectives({\n crystals,\n ore,\n studs,\n variables,\n}: Objectives): string {\n const result = variables.map(\n ({ condition, description }) => `variable:${condition}/${description}`,\n );\n if (crystals || ore || studs) {\n result.push(\n `resources: ${crystals.toFixed()},${ore.toFixed()},${studs.toFixed()}`,\n );\n }\n return result.join(\"\\n\");\n}\n","import { OUTLINE_TF } from \"./00_outlines\";\nimport { PLANNING_TF } from \"./01_planning\";\nimport { MASONRY_TF } from \"./02_masonry\";\nimport { PLASTIC_TF } from \"./03_plastic\";\nimport { EPHEMERA_TF } from \"./04_ephemera\";\n\nexport const CAVERN_TF = OUTLINE_TF.chain(PLANNING_TF)\n .chain(MASONRY_TF)\n .chain(PLASTIC_TF)\n .chain(EPHEMERA_TF);\n","// extracted by mini-css-extract-plugin\nexport default {\"popoverWrapper\":\"styles_popoverWrapper__re-vG\",\"subhead\":\"styles_subhead__tl6JE\",\"lore\":\"styles_lore__aBk0G\",\"error\":\"styles_error__o6NAs\",\"message\":\"styles_message__dHlbe\",\"stack\":\"styles_stack__6jNum\",\"context\":\"styles_context__tmsQi\"};","import React, { Fragment } from \"react\";\nimport styles from \"./styles.module.scss\";\nimport { Cavern } from \"../../../core/models/cavern\";\n\nexport default function LorePreview({\n fileName,\n levelName,\n briefing,\n script,\n}: Pick) {\n const scriptStrings = script\n ?.split(\"\\n\")\n .map((s) =>\n s.match(\n /^string\\s+(?[a-zA-Z_][a-zA-Z0-9_]*)\\s*=\\s*\"(?.*)\"$/,\n ),\n );\n if (!(briefing || script)) {\n return null;\n }\n return (\n
\n
\n

{levelName}

\n

Briefing

\n

Introduction

\n

{briefing?.intro}

\n

Success

\n

{briefing?.success}

\n

Failure

\n

{briefing?.failure}

\n {scriptStrings &&

Scripted Events

}\n {scriptStrings?.map((m) => {\n if (!m) {\n return null;\n }\n const { name, value } = m.groups!;\n return (\n \n

{name}

\n

{value}

\n \n );\n })}\n
\n
\n );\n}\n","import React from \"react\";\nimport styles from \"./styles.module.scss\";\n\nconst About = () => (\n
\n
\n

groundHog v{process.env.REACT_APP_VERSION}

\n

By Christopher Dollard (aka charredUtensil)

\n

\n See{\" \"}\n \n documentation\n {\" \"}\n and{\" \"}\n \n report issues\n {\" \"}\n on GitHub.\n

\n

\n LEGO® is a trademark of the LEGO Group of companies which does not\n sponsor, authorize or endorse this site.\n

\n
\n
\n);\nexport default About;\n","// extracted by mini-css-extract-plugin\nexport default {\"App\":\"App_App__HX9JK\",\"iceBiome\":\"App_iceBiome__TxzIK\",\"lavaBiome\":\"App_lavaBiome__Je2vq\",\"settingsPanel\":\"App_settingsPanel__5OsgF\",\"mainPanel\":\"App_mainPanel__vxyPC\",\"grid\":\"App_grid__p-lsE\",\"scan-scrim\":\"App_scan-scrim__73gMX\",\"loading\":\"App_loading__XtoTg\",\"hasError\":\"App_hasError__ajbuN\",\"stepName\":\"App_stepName__nVlPC\",\"progressBar\":\"App_progressBar__ABZI2\",\"complete\":\"App_complete__bL2eM\",\"controls\":\"App_controls__arkPS\",\"button\":\"App_button__nYXNW\",\"disabled\":\"App_disabled__fR4wn\",\"vizOptsPanel\":\"App_vizOptsPanel__EvGsa\",\"active\":\"App_active__57U0p\"};","import React, { useState } from \"react\";\nimport styles from \"./styles.module.scss\";\nimport { CavernContext } from \"../../../core/common\";\n\nconst GITHUB_ISSUE = \"https://github.com/charredUtensil/groundhog/issues/new\";\n\nexport default function ErrorPreview({\n error,\n context,\n}: {\n error: Error;\n context: CavernContext | undefined;\n}) {\n const [show, setShow] = useState(true);\n const [wasCopied, setWasCopied] = useState(false);\n if (!show) {\n return null;\n }\n const debugInfo = [\n `error: ${error.message}`,\n `groundHog version: ${process.env.REACT_APP_VERSION}`,\n `seed: ${context?.seed.toString(16).padStart(8, \"0\").toUpperCase()}`,\n `overrides: ${context?.overrides.join(\", \") || \"[none]\"}`,\n `stack: ${error.stack}`,\n `context: ${JSON.stringify(context)}`,\n ].join(\"\\n\");\n const bugLink = `${GITHUB_ISSUE}?body=${encodeURIComponent(`Add any relevant info here:\\n\\n\\n${debugInfo}`)}`;\n return (\n
\n
\n

Cavern generation failed

\n

{error.message}

\n

\n This isn't supposed to happen. Please consider{\" \"}\n \n filing a bug\n \n .\n

\n
    \n
  • groundHog version: {process.env.REACT_APP_VERSION}
    • \n
  • \n seed: {context?.seed.toString(16).padStart(8, \"0\").toUpperCase()}\n
    • \n
  • overrides: {context?.overrides.join(\", \") || \"[none]\"}
    • \n
  • \n \n Report issue on GitHub (Requires GitHub account)\n \n
    • \n
  • \n \n navigator.clipboard\n .writeText(debugInfo)\n .then(() => setWasCopied(true))\n }\n >\n Copy Bug Report\n {wasCopied && \" [ Copied! ]\"}\n \n
    • \n
  • \n \n
    • \n
\n {error.stack && (\n <>\n

Stack

\n

{error.stack}

\n \n )}\n {context && (\n <>\n

Context

\n

{JSON.stringify(context)}

\n \n )}\n
\n
\n );\n}\n","import React, {\n CSSProperties,\n useCallback,\n useEffect,\n useReducer,\n useState,\n} from \"react\";\n\nimport { CavernContext, DiceBox } from \"../core/common\";\nimport { CavernContextInput } from \"./components/context_editor\";\nimport { Cavern } from \"../core/models/cavern\";\nimport CavernPreview, { MapOverlay } from \"./components/map_preview\";\nimport { CAVERN_TF } from \"../core/transformers\";\nimport { TransformResult } from \"../core/common/transform\";\nimport LorePreview from \"./components/popovers/lore\";\nimport About from \"./components/popovers/about\";\nimport styles from \"./App.module.scss\";\nimport ErrorPreview from \"./components/popovers/error\";\nimport { filterTruthy } from \"../core/common/utils\";\n\nconst MAP_OVERLAY_BUTTONS: readonly {\n of: MapOverlay;\n label: String;\n enabled: (cavern: Cavern | undefined) => boolean;\n}[] = [\n { of: \"overview\", label: \"Overview\", enabled: (c) => true },\n { of: \"tiles\", label: \"Tiles\", enabled: (c) => !!c?.tiles },\n { of: \"crystals\", label: \"Crystals\", enabled: (c) => !!c?.crystals },\n { of: \"ore\", label: \"Ore\", enabled: (c) => !!c?.ore },\n { of: \"entities\", label: \"Entities\", enabled: (c) => !!c?.buildings },\n { of: \"discovery\", label: \"Discovery\", enabled: (c) => !!c?.discoveryZones },\n { of: \"height\", label: \"Height\", enabled: (c) => !!c?.height },\n { of: \"landslides\", label: \"Landslides\", enabled: (c) => !!c?.landslides },\n { of: \"erosion\", label: \"Erosion\", enabled: (c) => !!c?.erosion },\n { of: \"oxygen\", label: \"Oxygen\", enabled: (c) => c?.oxygen !== undefined },\n { of: \"lore\", label: \"Lore\", enabled: (c) => !!c?.lore },\n { of: \"script\", label: \"Script\", enabled: (c) => !!c?.script },\n { of: \"about\", label: \"About\", enabled: (c) => true },\n];\n\nfunction getDownloadLink(serializedData: string) {\n return `data:text/plain;charset=utf-8,${encodeURIComponent(serializedData)}`;\n}\n\ntype State = {\n cavern?: Cavern;\n name?: string;\n progress?: number;\n next?: () => TransformResult;\n error?: Error;\n};\n\nfunction App() {\n const [state, dispatchState] = useReducer(\n (was: State, action: State | { context: CavernContext }) => {\n if (\"context\" in action) {\n const cavern = {\n context: action.context,\n dice: new DiceBox(action.context.seed),\n };\n const r = CAVERN_TF.first(cavern);\n return {\n cavern: r.result,\n name: r.name,\n next: r.next || undefined,\n } as State;\n } else if (\"error\" in action) {\n return { cavern: was.cavern, ...action };\n }\n return action;\n },\n {},\n );\n\n const [autoGenerate, setAutoGenerate] = useState(true);\n const [mapOverlay, setMapOverlay] = useState(\"overview\");\n const [showOutlines, setShowOutlines] = useState(false);\n const [showPearls, setShowPearls] = useState(false);\n\n const biome = state?.cavern?.context.biome;\n\n function playPause() {\n if (autoGenerate) {\n setAutoGenerate(false);\n } else {\n setAutoGenerate(true);\n }\n }\n\n const step = useCallback(() => {\n try {\n const r = state.next!();\n dispatchState({\n cavern: r.result,\n name: r.name,\n progress: r.progress,\n next: r.next || undefined,\n });\n } catch (error: unknown) {\n console.error(error);\n if (error instanceof Error) {\n dispatchState({ error });\n }\n }\n }, [state]);\n\n const reset = useCallback(() => {\n setAutoGenerate(false);\n if (state.cavern) {\n dispatchState({ context: state.cavern.context });\n }\n }, [state]);\n\n useEffect(() => {\n if (state.next && autoGenerate) {\n step();\n }\n }, [autoGenerate, state, step]);\n\n useEffect(() => {\n (window as any).cavern = state.cavern;\n }, [state]);\n\n const isLoading =\n (autoGenerate && !state.cavern?.serialized) || mapOverlay === \"about\";\n\n return (\n
\n
\n \n
\n
\n \n {state.cavern && (\n \n )}\n {autoGenerate && state.progress !== undefined && (\n \n )}\n {mapOverlay === \"about\" && }\n {mapOverlay === \"lore\" && }\n {state.error && (\n \n )}\n {!autoGenerate && state.name && (\n
{state.name}
\n )}\n
\n {state.next ? (\n <>\n {!autoGenerate && }\n \n \n ) : (\n \n )}\n {state.cavern?.serialized ? (\n \n download\n \n ) : (\n
\n download\n
\n )}\n
\n
\n
\n

Show

\n setShowOutlines((v) => !v)}\n >\n Outlines\n \n setShowPearls((v) => !v)}\n >\n Pearls\n \n {MAP_OVERLAY_BUTTONS.map(({ of, label, enabled }) => (\n setMapOverlay((v) => (v === of ? \"overview\" : of))}\n >\n {label}\n \n ))}\n
\n
\n );\n}\n\nexport default App;\n","import React from \"react\";\nimport ReactDOM from \"react-dom/client\";\nimport \"./index.css\";\nimport App from \"./webui/App\";\n\nconst root = ReactDOM.createRoot(document.getElementById(\"root\")!);\nroot.render(\n \n \n ,\n);\n"],"names":["main","require","module","exports","GETTERS","arr","idx","get","dtype","f","default","SETTERS","value","set","isAccessorArray","getter","setter","accessorGetter","accessorSetter","x","dt","TYPE","constructor","name","BYTES_PER_ELEMENT","isComplexLike","real","imag","buf","len","v","i","j","length","isArrayLikeObject","format","it","out","z","next","done","push","TypeError","clbk","thisArg","call","isNonNegativeInteger","isCollection","isArrayBuffer","isObject","isArray","isString","isFunction","isEven","isInteger","isComplex64Array","isComplex128Array","hasIteratorSymbolSupport","ITERATOR_SYMBOL","setReadOnly","setReadOnlyAccessor","Float64Array","Complex128","floor","reinterpret64","reinterpret128","fromIterator","fromIteratorMap","fromArray","HAS_ITERATOR_SYMBOL","isComplexArray","Complex128Array","_length","_buffer","isComplexArrayConstructor","getComplex128","byteOffset","nargs","arguments","this","RangeError","byteLength","Error","src","tmp","flg","args","prototype","buffer","target","start","copyWithin","self","iter","FLG","entries","predicate","end","re","im","fcn","searchElement","fromIndex","separator","sep","toString","join","outbuf","reducer","initialValue","acc","N","sbuf","outlen","begin","offset","index","realf","imagf","Float32Array","Complex64","Complex64Array","getComplex64","Uint32Array","Int32Array","Uint16Array","Int16Array","Uint8Array","Uint8ClampedArray","CTORS","isBuffer","constructorName","ctor2dtype","DTYPES","NTYPES","ctor","hasFloat32ArraySupport","builtin","polyfill","hasFloat64ArraySupport","hasInt16ArraySupport","hasInt32ArraySupport","hasInt8ArraySupport","Int8Array","isTypedArray","isComplexTypedArray","typeName","data","instanceOf","ctorName","getPrototypeOf","hasUint16ArraySupport","hasUint32ArraySupport","hasUint8ArraySupport","hasUint8ClampedArraySupport","isFloat32Array","PINF","GlobalFloat32Array","bool","err","isFloat64Array","GlobalFloat64Array","NaN","foo","isInt16Array","INT16_MAX","INT16_MIN","GlobalInt16Array","isInt32Array","INT32_MAX","INT32_MIN","GlobalInt32Array","isInt8Array","INT8_MAX","INT8_MIN","GlobalInt8Array","hasOwnProp","Symbol","iterator","has","Object","hasOwnProperty","property","hasSymbols","toStringTag","isUint16Array","UINT16_MAX","GlobalUint16Array","isUint32Array","UINT32_MAX","GlobalUint32Array","isUint8Array","UINT8_MAX","GlobalUint8Array","isUint8ClampedArray","GlobalUint8ClampedArray","isArguments","detect","hasArgumentsClass","nativeClass","isEnumerableProperty","MAX_LENGTH","Array","hasArrayBuffer","ArrayBuffer","isPrimitive","hasToStringTag","Boolean","test","isObjectLike","_isBuffer","NAMES","isnan","isEnum","hasStringEnumBug","propertyIsEnumerable","hasFloat32Array","hasFloat64Array","typeOf","hasInt16Array","hasInt32Array","hasInt8Array","NINF","isInt","isNumber","valueOf","ctors","IS_LITTLE_ENDIAN","uint16view","isLittleEndian","isNan","Number","arrayfun","objectPrototype","proto","isPrototypeOf","obj","key","ownProps","String","fcnName","TypedArray","Dummy","hasUint16Array","hasUint32Array","hasUint8Array","hasUint8ClampedArray","strideX","offsetX","y","strideY","offsetY","xbuf","ybuf","ix","iy","accessors","arraylike2object","ox","oy","m","accessorProtocol","Bool","defineProperty","float64ToFloat32","toStr","toJSON","str","FLOAT64_NINF","NEGATIVE_INFINITY","FLOAT64_PINF","POSITIVE_INFINITY","a","b","la","lb","Math","abs","ceil","SIGN_MASK","ABS_MASK","toWords","getHighWord","fromWords","WORDS","hx","hy","assign","ldexp","polyvalP","hi","lo","k","r","t","c","trunc","expmulti","LOG2_E","NEARZERO","NEG_NEARZERO","BIAS","MAX_EXPONENT","MAX_SUBNORMAL_EXPONENT","MIN_SUBNORMAL_EXPONENT","isInfinite","copysign","normalize","floatExp","FRAC","frac","exp","high","setHighWord","polyvalQ","LN2_HI","LN2_LO","HIGH_SIGNIFICAND_MASK","hfsq","t1","R","s","w","max","isPositiveZero","setLowWord","polyvalL","HIGH_MIN_NORMAL_EXP","BP","DP_HI","DP_LO","ax","ahx","ss","s2","hs","ls","ht","bp","dp","hp","hz","lz","t2","u","n","polyvalW","isOdd","sqrt","uint32ToInt32","xIsZero","yIsHuge","yIsInfinite","log2ax","logx","pow2","HIGH_BIASED_EXP_10","HUGE","TINY","LOG_WORKSPACE","pow","ahy","sx","sy","y1","lp","LN2","EXP_MASK","indices","HIGH","LOW","FLOAT64_VIEW","UINT32_VIEW","low","FLOAT64_SMALLEST_NORMAL","stride","fround","FLOAT32_VIEW","hasObjectAssign","enumerableProperties","source","keys","to","Obj","standardGamma","sample1","sample2","sample3","randu","randn","alpha","beta","ga","setReadWriteAccessor","isBoolean","constantFunction","noop","gcopy","typedarray2json","validate","beta0","STATE","rnorm","opts","rand","prng","copy","state","seed","seedLength","stateLength","NAME","params","normalized","factory","ln","s4","A","sigma","mu","B","C","L","lx","ly","xy","ONE_THIRD","x2","v0","v1","d","isPositive","V","rTail","X","mt19937","improvedZiggurat","options","randi","coordsArray","ratioArray","sampleTail","START_RIGHT_TAIL","f0","f1","isNegative","isPositiveInteger","FLOAT64_MAX_SAFE_INTEGER","umul","randuint32","M","MAX_SEED","UPPER_MASK","LOWER_MASK","KNUTH_MULTIPLIER","MAGIC_MULTIPLIER_1","MAGIC_MULTIPLIER_2","MAG01","MATRIX_A","FLOAT64_NORMALIZATION_CONSTANT","TWO_32","ONE","MAX_NORMALIZED","STATE_ARRAY_VERSION","NUM_STATE_SECTIONS","STATE_SECTION_OFFSET","OTHER_SECTION_OFFSET","SEED_SECTION_OFFSET","STATE_FIXED_LENGTH","verifyState","s1","createState","slen","ndarray","initState","getSeed","getSeedLength","getState","setState","getStateLength","getStateSize","twist","MAX","random","RE_FUNCTION_NAME","reFunctionName","lowercase","toLowerCase","uppercase","toUpperCase","replace","RE_EXP_POS_DIGITS","RE_EXP_NEG_DIGITS","RE_ONLY_DIGITS","RE_DIGITS_BEFORE_EXP","RE_TRAILING_PERIOD_ZERO","RE_PERIOD_ZERO_EXP","RE_ZERO_BEFORE_EXP","token","digits","parseFloat","arg","isFinite","specifier","toExponential","precision","toFixed","toPrecision","alternate","sign","zeroPad","base","parseInt","padRight","charAt","formatInteger","formatDouble","spacePad","fromCharCode","isNaN","initialize","width","flags","mapping","tokens","hasPeriod","flag","num","pos","padZeros","indexOf","maxWidth","substring","spaces","right","pad","zeros","negative","startsWithMinus","substr","RE","parse","match","content","prev","exec","slice","lastIndex","interpolate","tokenize","apply","Sym","IteratorSymbol","prop","hasDefinePropertySupport","objectProtoype","defineGetter","__defineGetter__","defineSetter","__defineSetter__","lookupGetter","__lookupGetter__","lookupSetter","__lookupSetter__","descriptor","hasValue","hasGet","hasSet","__proto__","propertySymbols","isEnumerable","hasFunctionNameSupport","isFunctionNameSupported","getProto","getThis","Self","Win","GlobalThis","codegen","Function","globalThis","window","isConstructorPrototype","EXCLUDED_KEYS","win","check","hasAutomationEqualityBug","HAS_WINDOW","error","hasArgumentsBug","HAS_BUILTIN","wrapper","HAS_ENUM_PROTO_BUG","HAS_NON_ENUM_PROPS_BUG","NON_ENUMERABLE","skipConstructor","skipPrototype","isFcn","p","isOwn","tag","toStrTag","getOwnPropertySymbols","nodeList","typedarray","root","getGlobal","document","childNodes","usePolyfill","type","aa","ca","encodeURIComponent","da","Set","ea","fa","ha","add","ia","createElement","ja","ka","ma","e","g","acceptsBooleans","attributeName","attributeNamespace","mustUseProperty","propertyName","sanitizeURL","removeEmptyString","split","forEach","ra","sa","ta","pa","qa","oa","removeAttribute","setAttribute","setAttributeNS","xlinkHref","ua","__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED","va","for","wa","ya","za","Aa","Ba","Ca","Da","Ea","Fa","Ga","Ha","Ia","Ja","Ka","La","Ma","stack","trim","Na","Oa","prepareStackTrace","Reflect","construct","l","h","displayName","includes","Pa","render","Qa","$$typeof","_context","_payload","_init","Ra","Sa","Ta","nodeName","Va","_valueTracker","getOwnPropertyDescriptor","configurable","enumerable","getValue","setValue","stopTracking","Ua","Wa","checked","Xa","activeElement","body","Ya","defaultChecked","defaultValue","_wrapperState","initialChecked","Za","controlled","ab","bb","cb","db","ownerDocument","eb","fb","selected","defaultSelected","disabled","gb","dangerouslySetInnerHTML","children","hb","ib","jb","textContent","kb","mb","nb","namespaceURI","innerHTML","firstChild","removeChild","appendChild","MSApp","execUnsafeLocalFunction","ob","lastChild","nodeType","nodeValue","pb","animationIterationCount","aspectRatio","borderImageOutset","borderImageSlice","borderImageWidth","boxFlex","boxFlexGroup","boxOrdinalGroup","columnCount","columns","flex","flexGrow","flexPositive","flexShrink","flexNegative","flexOrder","gridArea","gridRow","gridRowEnd","gridRowSpan","gridRowStart","gridColumn","gridColumnEnd","gridColumnSpan","gridColumnStart","fontWeight","lineClamp","lineHeight","opacity","order","orphans","tabSize","widows","zIndex","zoom","fillOpacity","floodOpacity","stopOpacity","strokeDasharray","strokeDashoffset","strokeMiterlimit","strokeOpacity","strokeWidth","qb","rb","sb","style","setProperty","tb","menuitem","area","br","col","embed","hr","img","input","keygen","link","meta","param","track","wbr","ub","vb","is","wb","xb","srcElement","correspondingUseElement","parentNode","yb","zb","Ab","Bb","Cb","stateNode","Db","Eb","Fb","Gb","Hb","Ib","Jb","Kb","Lb","Mb","addEventListener","removeEventListener","Nb","onError","Ob","Pb","Qb","Rb","Sb","Tb","Vb","return","Wb","memoizedState","dehydrated","Xb","Zb","child","sibling","current","Yb","$b","ac","unstable_scheduleCallback","bc","unstable_cancelCallback","cc","unstable_shouldYield","dc","unstable_requestPaint","unstable_now","ec","unstable_getCurrentPriorityLevel","fc","unstable_ImmediatePriority","gc","unstable_UserBlockingPriority","hc","unstable_NormalPriority","ic","unstable_LowPriority","jc","unstable_IdlePriority","kc","lc","oc","clz32","pc","qc","log","rc","sc","tc","uc","pendingLanes","suspendedLanes","pingedLanes","entangledLanes","entanglements","vc","xc","yc","zc","Ac","eventTimes","Cc","Dc","Ec","Fc","Gc","Hc","Ic","Jc","Kc","Lc","Mc","Nc","Oc","Map","Pc","Qc","Rc","Sc","delete","pointerId","Tc","nativeEvent","blockedOn","domEventName","eventSystemFlags","targetContainers","Vc","Wc","priority","isDehydrated","containerInfo","Xc","Yc","dispatchEvent","shift","Zc","$c","ad","bd","cd","ReactCurrentBatchConfig","dd","ed","transition","fd","gd","hd","id","Uc","stopPropagation","jd","kd","ld","md","nd","od","keyCode","charCode","pd","qd","rd","_reactName","_targetInst","currentTarget","isDefaultPrevented","defaultPrevented","returnValue","isPropagationStopped","preventDefault","cancelBubble","persist","isPersistent","wd","xd","yd","sd","eventPhase","bubbles","cancelable","timeStamp","Date","now","isTrusted","td","ud","view","detail","vd","Ad","screenX","screenY","clientX","clientY","pageX","pageY","ctrlKey","shiftKey","altKey","metaKey","getModifierState","zd","button","buttons","relatedTarget","fromElement","toElement","movementX","movementY","Bd","Dd","dataTransfer","Fd","Hd","animationName","elapsedTime","pseudoElement","Id","clipboardData","Jd","Ld","Md","Esc","Spacebar","Left","Up","Right","Down","Del","Menu","Apps","Scroll","MozPrintableKey","Nd","Od","Alt","Control","Meta","Shift","Pd","Qd","code","location","repeat","locale","which","Rd","Td","height","pressure","tangentialPressure","tiltX","tiltY","pointerType","isPrimary","Vd","touches","targetTouches","changedTouches","Xd","Yd","deltaX","wheelDeltaX","deltaY","wheelDeltaY","wheelDelta","deltaZ","deltaMode","Zd","$d","ae","be","documentMode","ce","de","ee","fe","ge","he","ie","le","color","date","datetime","email","month","number","password","range","search","tel","text","time","url","week","me","ne","oe","event","listeners","pe","qe","se","te","ue","ve","we","xe","ye","ze","oninput","Ae","detachEvent","Be","Ce","attachEvent","De","Ee","Fe","He","Ie","Je","Ke","node","nextSibling","Le","contains","compareDocumentPosition","Me","HTMLIFrameElement","contentWindow","href","Ne","contentEditable","Oe","focusedElem","selectionRange","documentElement","selectionStart","selectionEnd","min","defaultView","getSelection","extend","rangeCount","anchorNode","anchorOffset","focusNode","focusOffset","createRange","setStart","removeAllRanges","addRange","setEnd","element","left","scrollLeft","top","scrollTop","focus","Pe","Qe","Re","Se","Te","Ue","Ve","We","animationend","animationiteration","animationstart","transitionend","Xe","Ye","Ze","animation","$e","af","bf","cf","df","ef","ff","gf","hf","lf","mf","concat","nf","Ub","instance","listener","D","of","pf","qf","rf","sf","bind","capture","passive","J","F","tf","uf","parentWindow","vf","wf","na","xa","$a","ba","je","char","ke","unshift","xf","yf","zf","Af","Bf","Cf","Df","Ef","__html","Ff","setTimeout","Gf","clearTimeout","Hf","Promise","Jf","queueMicrotask","resolve","then","catch","If","Kf","Lf","Mf","previousSibling","Nf","Of","Pf","Qf","Rf","Sf","Tf","Uf","E","G","Vf","H","Wf","Xf","Yf","contextTypes","__reactInternalMemoizedUnmaskedChildContext","__reactInternalMemoizedMaskedChildContext","Zf","childContextTypes","$f","ag","bg","getChildContext","cg","__reactInternalMemoizedMergedChildContext","dg","eg","fg","gg","hg","jg","kg","lg","mg","ng","og","pg","qg","rg","sg","tg","ug","vg","wg","xg","yg","I","zg","Ag","Bg","elementType","deletions","Cg","pendingProps","overflow","treeContext","retryLane","Dg","mode","Eg","Fg","Gg","memoizedProps","Hg","Ig","Jg","Kg","Lg","defaultProps","Mg","Ng","Og","Pg","Qg","Rg","_currentValue","Sg","childLanes","Tg","dependencies","firstContext","lanes","Ug","Vg","context","memoizedValue","Wg","Xg","Yg","interleaved","Zg","$g","ah","updateQueue","baseState","firstBaseUpdate","lastBaseUpdate","shared","pending","effects","bh","ch","eventTime","lane","payload","callback","dh","K","eh","fh","gh","q","hh","ih","jh","Component","refs","kh","nh","isMounted","_reactInternals","enqueueSetState","lh","mh","enqueueReplaceState","enqueueForceUpdate","oh","shouldComponentUpdate","isPureReactComponent","ph","contextType","updater","qh","componentWillReceiveProps","UNSAFE_componentWillReceiveProps","rh","props","getDerivedStateFromProps","getSnapshotBeforeUpdate","UNSAFE_componentWillMount","componentWillMount","componentDidMount","sh","ref","_owner","_stringRef","th","uh","vh","wh","xh","yh","implementation","zh","Ah","Bh","Ch","Dh","Eh","Fh","Gh","Hh","Ih","tagName","Jh","Kh","Lh","Mh","revealOrder","Nh","Oh","_workInProgressVersionPrimary","Ph","ReactCurrentDispatcher","Qh","Rh","O","P","Sh","Th","Uh","Vh","Q","Wh","Xh","Yh","Zh","$h","ai","bi","ci","baseQueue","queue","di","ei","fi","lastRenderedReducer","action","hasEagerState","eagerState","lastRenderedState","dispatch","gi","ii","ji","ki","getSnapshot","li","mi","ni","lastEffect","stores","oi","pi","qi","ri","create","destroy","deps","si","ti","ui","vi","wi","xi","yi","zi","Ai","Bi","Ci","Di","Ei","Fi","Gi","Hi","Ii","Ji","readContext","useCallback","useContext","useEffect","useImperativeHandle","useInsertionEffect","useLayoutEffect","useMemo","useReducer","useRef","useState","useDebugValue","useDeferredValue","useTransition","useMutableSource","useSyncExternalStore","useId","unstable_isNewReconciler","identifierPrefix","Ki","message","digest","Li","Mi","console","Ni","WeakMap","Oi","Pi","Qi","Ri","getDerivedStateFromError","componentDidCatch","Si","componentStack","Ti","pingCache","Ui","Vi","Wi","Xi","ReactCurrentOwner","Yi","Zi","$i","aj","bj","compare","cj","dj","ej","baseLanes","cachePool","transitions","fj","gj","hj","ij","jj","UNSAFE_componentWillUpdate","componentWillUpdate","componentDidUpdate","kj","lj","pendingContext","mj","Aj","Bj","Cj","Dj","nj","oj","pj","fallback","qj","rj","tj","dataset","dgst","uj","vj","_reactRetry","sj","subtreeFlags","wj","xj","isBackwards","rendering","renderingStartTime","last","tail","tailMode","yj","Ej","S","Fj","Gj","wasMultiple","multiple","suppressHydrationWarning","onClick","onclick","size","createElementNS","autoFocus","createTextNode","T","Hj","Ij","Jj","Kj","U","Lj","WeakSet","Mj","W","Nj","Oj","Qj","Rj","Sj","Tj","Uj","Vj","Wj","insertBefore","_reactRootContainer","Xj","Yj","Zj","ak","onCommitFiberUnmount","componentWillUnmount","bk","ck","dk","ek","fk","isHidden","gk","hk","display","ik","jk","kk","lk","__reactInternalSnapshotBeforeUpdate","Wk","mk","nk","ok","pk","Y","Z","qk","rk","sk","tk","uk","Infinity","vk","wk","xk","yk","zk","Ak","Bk","Ck","Dk","Ek","callbackNode","expirationTimes","expiredLanes","wc","callbackPriority","ig","Fk","Gk","Hk","Ik","Jk","Kk","Lk","Mk","Nk","Ok","Pk","finishedWork","finishedLanes","Qk","timeoutHandle","Rk","Sk","Tk","Uk","Vk","mutableReadLanes","Bc","Pj","onCommitFiberRoot","mc","onRecoverableError","Xk","onPostCommitFiberRoot","Yk","Zk","al","isReactComponent","pendingChildren","bl","mutableSourceEagerHydrationData","cl","cache","pendingSuspenseBoundaries","el","fl","gl","hl","il","jl","zj","$k","ll","reportError","ml","_internalRoot","nl","ol","pl","ql","sl","rl","unmount","unstable_scheduleHydration","splice","querySelectorAll","JSON","stringify","form","tl","usingClientEntryPoint","Events","ul","findFiberByHostInstance","bundleType","version","rendererPackageName","vl","rendererConfig","overrideHookState","overrideHookStateDeletePath","overrideHookStateRenamePath","overrideProps","overridePropsDeletePath","overridePropsRenamePath","setErrorHandler","setSuspenseHandler","scheduleUpdate","currentDispatcherRef","findHostInstanceByFiber","findHostInstancesForRefresh","scheduleRefresh","scheduleRoot","setRefreshHandler","getCurrentFiber","reconcilerVersion","__REACT_DEVTOOLS_GLOBAL_HOOK__","wl","isDisabled","supportsFiber","inject","createPortal","dl","createRoot","unstable_strictMode","findDOMNode","flushSync","hydrate","hydrateRoot","hydratedSources","_getVersion","_source","unmountComponentAtNode","unstable_batchedUpdates","unstable_renderSubtreeIntoContainer","checkDCE","__self","__source","Fragment","jsx","jsxs","forceUpdate","escape","_status","_result","Children","map","count","toArray","only","Profiler","PureComponent","StrictMode","Suspense","cloneElement","createContext","_currentValue2","_threadCount","Provider","Consumer","_defaultValue","_globalName","createFactory","createRef","forwardRef","isValidElement","lazy","memo","startTransition","unstable_act","pop","sortIndex","performance","setImmediate","startTime","expirationTime","priorityLevel","navigator","scheduling","isInputPending","MessageChannel","port2","port1","onmessage","postMessage","unstable_Profiling","unstable_continueExecution","unstable_forceFrameRate","unstable_getFirstCallbackNode","unstable_next","unstable_pauseExecution","unstable_runWithPriority","delay","unstable_wrapCallback","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","undefined","__webpack_modules__","__esModule","definition","o","MAX_PLUS_ONE","PseudorandomStream","mt","bt","chance","uniform","_ref","_ref2","uniformInt","betaInt","uniformChoice","choices","betaChoice","_ref3","weightedChoice","bids","filter","bid","totalWeight","reduce","randomValue","item","shuffle","Die","DiceBox","boxes","pickArchitect","prime","pearl","rough","placeRechargeSeam","placeBuildings","placeCrystals","placeOre","placeSlugHoles","placeLandslides","placeErosion","placeEntities","lore","script","monsterSpawnScript","slugSpawnScript","boxesLength","rngs","die","box","init","partition","weave","flood","pickSpawn","brace","scriptGlobals","STANDARD_DEFAULTS","baseplateMaxOblongness","baseplateMaxRatioOfSize","caveCount","optimalAuxiliaryPathCount","randomAuxiliaryPathCount","auxiliaryPathMinAngle","PI","caveBaroqueness","hallBaroqueness","caveCrystalRichness","hops","hallCrystalRichness","caveOreRichness","hallOreRichness","monsterSpawnRate","monsterWaveSize","architects","caveCrystalSeamBias","hallCrystalSeamBias","caveOreSeamBias","hallOreSeamBias","hallHasSlugHoleChance","stratascosity","strataplanity","caveHasLandslidesChance","hallHasLandslidesChance","caveLandslideCooldownRange","hallLandslideCooldownRange","airSafetyFactor","crystalGoalRatio","DEFAULTS_FOR_BIOME","rock","caveHasRechargeSeamChance","hallHasRechargeSeamChance","caveHasSlugHoleChance","caveMaxSlope","hallMaxSlope","voidMaxSlope","borderMaxSlope","ice","lava","getDefaultFlooding","dice","biome","rng","waterPlans","waterLakes","lavaPlans","lavaLakes","erosionPlans","inferContextDefaults","hasMonsters","targetSize","hasAirLimit","hasSlugs","heightTargetRange","overrides","sort","ORIGIN","NORTH","NORTH_EAST","EAST","SOUTH_EAST","SOUTH","SOUTH_WEST","WEST","NORTH_WEST","NSEW","NEIGHBORS8","offsetBy","plotLine","destX","destY","dx","dy","e2","moveX","moveY","radsToDegrees","rads","rotateAround","rotateLeft","_ref4","rotateRight","_ref5","Choice","update","contextWithDefaults","_jsxs","_Fragment","_jsx","className","styles","inputRow","choice","classes","override","active","inactive","CurveSliders","_contextWithDefaults$","_contextWithDefaults$2","_contextWithDefaults$3","_contextWithDefaults$4","_contextWithDefaults$5","_contextWithDefaults$6","step","curve","_contextWithDefaults$7","_contextWithDefaults$8","slider","onChange","ev","updateCurve","valueAsNumber","icon","invisible","Slider","_context$of","percent","angle","epsilon","splitter","resulterrbound","sum","elen","flen","Qnew","bvirt","enow","fnow","eindex","findex","hindex","vec","ccwerrboundB","ccwerrboundC","C1","C2","orient2d","ay","bx","by","cx","cy","detleft","detright","det","detsum","acxtail","acytail","bcxtail","bcytail","ahi","alo","bhi","blo","_i","_j","_0","s0","t0","u3","acx","bcx","acy","bcy","estimate","errbound","C1len","C2len","Dlen","orient2dadapt","EPSILON","EDGE_STACK","Delaunator","from","points","getX","defaultGetX","getY","defaultGetY","coords","maxTriangles","_triangles","_halfedges","_hashSize","_hullPrev","_hullNext","_hullTri","_hullHash","_ids","_dists","hullPrev","hullNext","hullTri","hullHash","minX","minY","maxX","maxY","i0","i1","i2","minDist","dist","i0x","i0y","i1x","i1y","minRadius","circumradius","i2x","i2y","quicksort","hull","d0","subarray","triangles","halfedges","center","ex","ey","circumcenter","_cx","_cy","_hullStart","hullSize","fill","_hashKey","trianglesLen","_addTriangle","xp","yp","_legalize","pseudoAngle","ar","a0","b0","p0","pr","p1","inCircle","hbl","_link","px","py","fx","fy","cp","ids","dists","temp","tempDist","swap","getYaw","atan2","aimedAt","facing","yaw","ENTITY_SCALE","POSITION_DEFAULTS","pitch","roll","scaleX","scaleY","scaleZ","position","_args$z","_args$pitch","_getYaw","_args$roll","_args$scaleX","_args$scaleY","_args$scaleZ","atCenterOfTile","randomlyInTile","_getYaw2","zOffsetForBuilding","unused_x","unused_y","nw","sw","zOffsetForEntity","serializePosition","heightMap","yawOffset","zOffsetMethod","method","tileX","tileY","fn","entity","building","zOffset","F_MINING_LASER","F_DEFAULT","F_CANTEEN_REFINERY","F_POWER_STATION","F_SUPER_TELEPORT","rotateFootprint","footprint","BuildingTemplate","inspectAbbrev","maxLevel","ore","crystals","atTile","_args$level","_args$isEssential","_args$teleportAtStart","template","foundation","level","isEssential","teleportAtStart","TOOL_STORE","TELEPORT_PAD","DOCKS","CANTEEN","POWER_STATION","SUPPORT_STATION","UPGRADE_STATION","GEOLOGICAL_CENTER","ORE_REFINERY","MINING_LASER","SUPER_TELEPORT","Hardness","Tile","FLOOR","crystalYield","hardness","NONE","isFluid","isWall","maxSlope","oreYield","LAVA","WATER","DIRT","LOOSE_ROCK","LOOSE","HARD_ROCK","HARD","SOLID_ROCK","SOLID","RUBBLE_1","RUBBLE","RUBBLE_2","RUBBLE_3","RUBBLE_4","SLUG_HOLE","FOUNDATION","POWER_PATH","LANDSLIDE_RUBBLE_4","LANDSLIDE_RUBBLE_3","LANDSLIDE_RUBBLE_2","LANDSLIDE_RUBBLE_1","CRYSTAL_SEAM","SEAM","ORE_SEAM","RECHARGE_SEAM","CreatureTemplate","ROCK_MONSTER","ICE_MONSTER","LAVA_MONSTER","SLIMY_SLUG","monsterForBiome","CreatureFactory","sleep","pairEach","pairMap","result","filterTruthy","pickPoint","plan","innerPearl","layer","positionsHelper","cavern","filterFn","aly","placements","_cavern$pearlInnerDex","tiles","pearlInnerDex","some","_","plans","kind","anchor","find","_cavern$tiles$get","_cavern$pearlInnerDex2","tx","ty","TILE_CAN_HAVE_MONSTER","__","PLACEMENT_FN","inner","outer","placeSleepingMonsters","placement","creatureFactory","creatures","sprinkleSlugHoles","_opts$count","_opts$placements","flatMap","x1","Landslide","cooldown","Erosion","initialDelay","LANDSLIDABLE_TILES","cooldownRange","landslides","spread","point","_cavern$tiles$get$id","SEAMABLE","sprinkle","getRandomTile","seamBias","resource","seam","remaining","_tiles$get","_resource$get","sprinkleCrystals","_opts$getRandomTile","_opts$seamBias","defaultGetRandomTile","architect","crystalsFromMetadata","metadata","sprinkleOre","_opts$getRandomTile2","_opts$seamBias2","_opts$count2","bidsForOuterPearl","outerPearl","_args$tiles$get","tile","rechargeSeamCount","solidRockCount","_args$tiles$get2","neighbor","_args$cavern$pearlInn","_args$cavern$pearlInn2","_args$cavern$pearlOut","_args$cavern$pearlOut2","pearlOuterDex","bidsForOrdinaryWalls","positions","bids2","getPlaceRechargeSeams","getTotalCrystals","buildings","vehicles","ct","getTotalOre","_ref6","DefaultCaveArchitect","DefaultHallArchitect","hasLandslidesChance","landslideCooldownRange","baroqueness","crystalsToPlace","crystalRichness","perimeter","oreRichness","erosion","hasErosion","_cavern$tiles$get2","objectives","MutableGrid","bounds","bottom","_len","_key","getBuildings","placed","porches","expand","layers","radius","totalWidth","totalShrink","shrink","totalGrow","grow","growFactor","shrinkFactor","round","rr","dirt","looseRock","hardRock","solidRock","water","_r$has$id","roughNotFloodedTo","weightedSprinkle","_len2","_key2","_Rough","VOID","ALWAYS_FLOOR","ALWAYS_DIRT","ALWAYS_LOOSE_ROCK","ALWAYS_HARD_ROCK","ALWAYS_SOLID_ROCK","ALWAYS_WATER","ALWAYS_LAVA","AT_MOST_DIRT","AT_MOST_LOOSE_ROCK","AT_MOST_HARD_ROCK","DIRT_OR_LOOSE_ROCK","LOOSE_OR_HARD_ROCK","BRIDGE_ON_WATER","BRIDGE_ON_LAVA","INVERT_TO_DIRT","INVERT_TO_LOOSE_ROCK","Rough","MIX_DIRT_LOOSE_ROCK","MIX_LOOSE_HARD_ROCK","MIX_FRINGE","mkRough","_len3","_key3","fixLayers","roughExtent","pearlRadius","replacements","mkVars","prefix","transformPoint","scriptFragment","rest","eventChain","escapeString","getDiscoveryPoint","dz","discoveryZones","openOnSpawn","T0_BUILDINGS","T1_BUILDINGS","T2_BUILDINGS","T3_BUILDINGS","OMIT_T1","getPrime","maxCrystals","ruin","crystalsInBuildings","getPlaceBuildings","discovered","asRuin","asSpawn","tq","crystalBudget","bq","intersects","fluid","isRuinAtSpawn","fTile","getPorch","addPath","dest","delaunay","openCaveFlags","xt","yt","setCameraPosition","gLostHq","WITH_FIND_OBJECTIVE","variables","condition","foundHq","description","sufficient","discoPoint","camPoint","path","baseplates","messageDiscover","onDiscover","BASE","spawnBid","_ref7","caveBid","_ref8","_p$metadata","_ref9","_plans$hops$0$metadat","_p$metadata2","EXHAUSTED","INITIAL","AWAITING_REARM","COOLDOWN","ARMED","RETRIGGER_MODES","automatic","afterTriggerState","hoard","creatureSpawnScript","creature","retriggerMode","triggerOnFirstArmed","needCrystals","_opts$waveSize","_opts$meanWaveSize","_opts$spawnRate","_opts$armEvent","_opts$emerges","_opts$triggerPoints","_opts$needCrystals","_opts$needCrystals2","waveSize","meanWaveSize","meanCooldown","spawnRate","armEvent","doArm","armTriggers","armFn","discoveryPoint","getArmTriggers","cooldownOffset","emerges","cycleEmerges","getEmerges","once","maxTriggerCount","triggerPoints","getTriggerPoints","needCountTriggerEvents","needTriggerPoints","triggerCount","increment","initialCooldown","doSpawn","emerge","doRetrigger","METADATA","sVars","discoveryPoints","used","getDiscoveryPoints","panTo","drillPoints","trips","tripCount","msgForeshadow","generateSeismicForeshadow","onTrip","spawn","bps","ebps","hallBid","exclusiveSnakeDistance","_plans$i$metadata","intersectsAny","intersectsOnly","isDeadEnd","LOOPBACK","overlaps","tipPlans","op","tp","tipPlan","crust","withBarrier","JOBS","land","air","sea","VehicleTemplate","frame","upgrades","job","HOVER_SCOUT","SMALL_DIGGER","SMALL_TRANSPORT_TRUCK","RAPID_RIDER","SMLC","TUNNEL_SCOUT","VehicleFactory","essential","driverId","gLostMiners","countLostMiners","lostMiners","lostMinerCaves","_plan$metadata","minersCount","getBreadcrumbPoint","minersDz","minersX","minersY","neighborPlan","pickMinerPoint","_discoveryZones$get","_pickMinerPoint","miners","minerFactory","vehicleFactory","placeBreadcrumbVehicle","foundAllLostMiners","remainingCaves","messageFoundAll","onFoundAll","_ref10","lostMinersPoint","foundLostMiners","onIncomplete","MULTIPLIERS","_ref11","VEHICLE_BIDS","gNomads","_cavern$plans$find","hopId","_cavern$discoveryZone","placedVehicles","_cavern$discoveryZone2","placedMiners","driving","loadout","miner","onInit","onFoundHq","msg","nomadsSettled","messageBuiltBase","onBuiltBase","toolStore","OPEN","getSlugHoles","SLUG_NEST_METADATA","SLUG_NEST","holeCount","generateFoundSlugNest","SLUG_HALL","holes","HARD_ROCK_MIN_CRYSTALS","totalCrystals","HOARD","wallBids","centerPoints","wasTriggered","foundHoard","crystalsAvailable","hasLostMiners","centerPoint","onDiscovered","go","RICH","ARCHITECTS","ESTABLISHED_HQ","FISSURE","FLOODED","LOST_MINERS","NOMAD_SPAWN","SIMPLE_CAVE","SIMPLE_HALL","SIMPLE_SPAWN","SLUGS","THIN_HALL","ArchitectsInput","updateArchitects","localeCompare","_context$architects","React","INITIAL_SEED","parseSeed","unparseSeed","padStart","expectedTotalPlans","CavernContextInput","_parseSeed","dispatchState","showAdvanced","setShowAdvanced","was","hash","contextInput","spellCheck","section","subsection","SCALE","BaseplatePreview","baseplate","PathPreview","startOffset","dPearl","y2","cmd","x0","y0","PearlPreview","io","SCALE_COLORS","MAX_COOLDOWN","TilesPreview","mapOverlay","scale","_cavern$mapOverlay","_cavern$mapOverlay$ge","_cavern$crystals$get","_cavern$crystals","_cavern$ore$get","_cavern$ore","_cavern$discoveryZone3","_cavern$aerationLog","_cavern$crystals2","aerationLog","getFill","title","_cavern$discoveryZone4","_cavern$crystals$get2","_cavern$crystals3","_cavern$ore$get2","_cavern$ore2","_cavern$landslides","_cavern$erosion","er","getTitle","_entity$template","_entity$loadout","_entity$upgrades","unique","EntityPreview","_entity$template2","_entity$template3","vehicle","hasText","getMarkerD","enemy","transform","marker","label","OpenCaveFlagPreview","openCaveFlag","CORNER_OFFSETS","HEIGHT_MIN","HEIGHT_MAX","toColor","lum","HeightPreview","EntitySummary","entities","counts","_counts$s","Stats","_cavern$briefing","_cavern$tiles$size","_cavern$tiles","_cavern$tiles2","_cavern$objectives","_cavern$objectives2","_cavern$objectives3","_cavern$objectives4","levelName","fileName","briefing","intro","_cavern$miners$length","_cavern$miners","avgCooldown","_cavern$erosion$size","_cavern$tiles3","_cavern$tiles4","_cavern$oxygen$join","_cavern$oxygen","oxygen","stats","getGClassName","_plan$path","drawRadius","caveWithOneBaseplate","dWrapping","lengthAB","hypot","angleAB","lengthAC","angleBAC","acos","prime1","cos","sin","prime2","aPrime1","aPrime2","bPrime1","bPrime2","caveWithTwoBaseplates","hall","PlansPreview","planCoords","jx","jy","drawLabels","inline","pointer","_plan$path$baseplates","line","startsWith","groups","getLineOffsets","container","lines","getElementsByClassName","offsetTop","clientHeight","ScriptPreview","setScriptLineOffsets","scriptLineHovered","setScriptLineHovered","statements","onScroll","hovered","onMouseOver","ScriptOverlay","scriptLineOffsets","scriptOverlay","arrow","arrowhead","getTransform","cameraPosition","CavernPreview","_cavern$baseplates","_cavern$paths","_cavern$buildings","_cavern$creatures","_cavern$vehicles","_cavern$openCaveFlags","_cavern$plans","_cavern$plans2","showOutlines","showPearls","mapWrapperRef","setScale","mapWrapper","_cavern$left","_cavern$right","_cavern$top","_cavern$bottom","tw","mw","clientWidth","getScale","cavernPreview","void","viewBox","xmlns","paths","TfBuilder","fns","mkResult","_this$fns$name","_this$fns","progress","first","chain","that","Baseplate","withKind","Partitioner","baseplateMaxSize","outbox","nextId","bound","clone","_args$left","_args$top","_args$right","_args$bottom","distance","Path","origin","destination","batDistance","snakeDistance","OUTLINE_TF","partitioner","dexes","caveBaseplates","clusters","nextCluster","rSquared","bpAtTile","seen","genPathPlates","graph","_src$id","theta","edges","getGraph","pathIdsByEnds","minAngle","pathId","_paths$pathId2","pathKind","getOffset","pruneByAngle","addBestShortcut","distances","_paths$pathId","getAllDistances","addRandomShortcut","_path$origin$id","_path$destination$id","isMergeable","va1","va2","vb1","vb2","curved","LayerGrid","atLayer","super","hallNucleus","grid","caveNucleus","addLayer","_grid$get3","vx","vy","nextPoints","np","halt","_grid$get","rx","ry","_grid$get2","trail","PLANNING_TF","bpIsInBigCave","planIdsByBp","_bp$id","plid","lakes","planCount","lakeCount","skipChance","getLakes","fluids","claims","lake","working","erodeQueue","_fluids$plan$id","_cavern$context$archi","_cavern$context$archi2","_a$caveBid","_a$hallBid","_a$spawnBid","encourageDisable","inOrder","isQueued","neighbors","sortPlans","maxIndex","maxHops","established","doEstablish","doArchitect","getDiscoveryZones","zone","nextZone","HOLE_MAP","isInPlay","voidNeighbors","MASONRY_TF","visited","_tiles$get$isWall","wallNeighbors","_tiles$get$isWall2","_tiles$get2","needsBrace","ot","isHole","diorama","MinerFactory","FENCES","EdgeMap","ascent","forward","descent","backward","getEdgeMap","planlessSlope","maxSlopeForPlan","_plan$architect$maxSl","slope","_tile$maxSlope","getTileSlopes","mkNode","isBorder","corners","collapseQueued","getNodes","bowls","_result$get","getBowls","nodes","getNodesForBowls","superflat","PLASTIC_TF","planHeight","queued","_result$plan$id","getPlanHeight","fluidOffset","getTileHeight","tileHeight","getCornerHeight","collapseQueue","collapse","targetInRange","getRandomHeight","spreadQueue","AIR_STEP","TIMING","PgBuilder","phrases","states","phrase","requires","after","before","reachableStates","merge","PgNode","heads","tails","skip","coerce","pgBuilder","getReachableStates","reachableAfter","reachable","CAPITALIZE_AFTER","NO_SPACE_AFTER","NO_SPACE_BEFORE","PhraseGraph","generate","requireState","formatVars","stateRemaining","chosenPhrases","reachedState","continuations","chosen","textIndex","capitalizeNext","spaceBeforeNext","endsWith","joinTexts","phraseGraph","cut","newIndex","occupiedLanes","findLane","align","traverse","newStart","values","find_lost_miners","get_resources","COMMENDATIONS","SUCCESS","commend","despiteTheOdds","foundTheBase","hqIsRuin","FAILURE","FOUND_HOARD","FOUND_HQ","positive_greeting","neutral_greeting","FOUND_LOST_MINERS","FOUND_ALL_LOST_MINERS","NOMADS_SETTLED","FOUND_SLUG_NEST","mid","collect_resources","we_need","greeting","additionalHardship","spawnHasErosion","hasMonstersTexts","negativeGreeting","alsoAdditionalHardship","findThem","findTheOthers","SEISMIC_FORESHADOW","joinHuman","things","conjunction","ONES","TENS","spellNumber","spellResourceGoal","studs","resourceGoal","resourceGoalNamesOnly","Lore","_spawn$metadata","vars","fluidType","floodedWith","hq","spawnIsHq","findHq","nomads","treasures","floodedWithWater","floodedWithLava","lostMinersOne","lostMinersTogether","lostMinersApart","resourceObjective","spawnIsNomadOne","spawnIsNomadsTogether","treasureCaveOne","treasureCaveMany","rockBiome","iceBiome","lavaBiome","enemies","lostMinersCount","lostMinerCavesCount","briefings","premise","PREMISE","orders","ORDERS","success","failure","foundMinersCount","foundMinersOne","foundMinersTogether","foundSlugNest","OVERRIDE_SUFFIXES","RESTRICTED_STRINGS","pointSet","xs","ys","fencepost","row","serializeHazards","hazards","EPHEMERA_TF","presentAtSpawn","hasTeleportPad","hasPowerStation","hasSupportStation","getOrigin","drillTiming","walkQueue","drillQueue","dynamiteQueue","enqueue","useDynamite","maxAir","_r$crystals","_obj$crystals","_r$ore","_obj$ore","_r$studs","_obj$studs","_obj$variables","hasOverrides","charCodeAt","overrideSuffix","archGlobals","archScripts","monsters","slugs","serialized","process","comments","serializeObjectives","serializeBuilding","serializeCreature","serializeMiner","serializeVehicle","restricted","performErrorChecking","CAVERN_TF","LorePreview","scriptStrings","popoverWrapper","About","about","rel","GITHUB_ISSUE","ErrorPreview","show","setShow","wasCopied","setWasCopied","debugInfo","bugLink","clipboard","writeText","MAP_OVERLAY_BUTTONS","enabled","_state$cavern","_state$cavern2","_state$cavern3","_state$cavern4","_state$cavern$fileNam","autoGenerate","setAutoGenerate","setMapOverlay","setShowOutlines","setShowPearls","reset","isLoading","App","settingsPanel","mainPanel","loading","hasError","progressBar","complete","stepName","controls","serializedData","download","vizOptsPanel","ReactDOM","getElementById"],"sourceRoot":""} \ No newline at end of file diff --git a/static/js/main.b497b6ff.js b/static/js/main.d4e37d27.js similarity index 57% rename from static/js/main.b497b6ff.js rename to static/js/main.d4e37d27.js index 300c90a..c7bfe16 100644 --- a/static/js/main.b497b6ff.js +++ b/static/js/main.d4e37d27.js @@ -1,3 +1,3 @@ -/*! For license information please see main.b497b6ff.js.LICENSE.txt */ -(()=>{"use strict";var e={6264:(e,t,n)=>{var r=n(2604);e.exports=r},2604:e=>{var t={complex128:function(e,t){return e.get(t)},complex64:function(e,t){return e.get(t)},default:function(e,t){return e.get(t)}};e.exports=function(e){var n=t[e];return"function"===typeof n?n:t.default}},6572:(e,t,n)=>{var r=n(1923);e.exports=r},1923:e=>{var t={complex128:function(e,t,n){e.set(n,t)},complex64:function(e,t,n){e.set(n,t)},default:function(e,t,n){e.set(n,t)}};e.exports=function(e){var n=t[e];return"function"===typeof n?n:t.default}},2508:(e,t,n)=>{var r=n(5603);e.exports=r},5603:(e,t,n)=>{var r=n(6908),a=n(6148),o=n(1056),i=n(6264),l=n(6572),s=n(435);e.exports=function(e){var t=s(e);return r(e)?{data:e,dtype:t,accessorProtocol:!0,accessors:[i(t),l(t)]}:{data:e,dtype:t,accessorProtocol:!1,accessors:[a(t),o(t)]}}},6908:(e,t,n)=>{var r=n(9459);e.exports=r},9459:e=>{var t="function";e.exports=function(e){return typeof e.get===t&&typeof e.set===t}},2771:(e,t,n)=>{var r=n(9582);e.exports=r},9582:e=>{e.exports=function(e){return"object"===typeof e&&null!==e&&"Complex128Array"===e.constructor.name&&16===e.BYTES_PER_ELEMENT}},4792:(e,t,n)=>{var r=n(4479);e.exports=r},4479:e=>{e.exports=function(e){return"object"===typeof e&&null!==e&&"Complex64Array"===e.constructor.name&&8===e.BYTES_PER_ELEMENT}},6148:(e,t,n)=>{var r=n(3147);e.exports=r},3147:e=>{var t={float64:function(e,t){return e[t]},float32:function(e,t){return e[t]},int32:function(e,t){return e[t]},int16:function(e,t){return e[t]},int8:function(e,t){return e[t]},uint32:function(e,t){return e[t]},uint16:function(e,t){return e[t]},uint8:function(e,t){return e[t]},uint8c:function(e,t){return e[t]},generic:function(e,t){return e[t]},default:function(e,t){return e[t]}};e.exports=function(e){var n=t[e];return"function"===typeof n?n:t.default}},1056:(e,t,n)=>{var r=n(9527);e.exports=r},9527:e=>{var t={float64:function(e,t,n){e[t]=n},float32:function(e,t,n){e[t]=n},int32:function(e,t,n){e[t]=n},int16:function(e,t,n){e[t]=n},int8:function(e,t,n){e[t]=n},uint32:function(e,t,n){e[t]=n},uint16:function(e,t,n){e[t]=n},uint8:function(e,t,n){e[t]=n},uint8c:function(e,t,n){e[t]=n},generic:function(e,t,n){e[t]=n},default:function(e,t,n){e[t]=n}};e.exports=function(e){var n=t[e];return"function"===typeof n?n:t.default}},3500:(e,t,n)=>{var r=n(1697),a=n(1886),o=n(7400);e.exports=function(e,t){var n,i,l,s;for(n=t.length,s=0,l=0;l{var r=n(9014),a=n(1697),o=n(6132),i=n(1886),l=n(7400);e.exports=function(e){var t,n,s;for(t=[];!(n=e.next()).done;)if(s=n.value,r(s)&&s.length>=2)t.push(s[0],s[1]);else{if(!a(s))return new TypeError(o("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",s));t.push(i(s),l(s))}return t}},8846:(e,t,n)=>{var r=n(9014),a=n(1697),o=n(6132),i=n(1886),l=n(7400);e.exports=function(e,t,n){var s,u,c,d;for(s=[],d=-1;!(u=e.next()).done;)if(d+=1,c=t.call(n,u.value,d),r(c)&&c.length>=2)s.push(c[0],c[1]);else{if(!a(c))return new TypeError(o("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));s.push(i(c),l(c))}return s}},200:(e,t,n)=>{var r=n(5071);e.exports=r},5071:(e,t,n)=>{var r=n(5180).isPrimitive,a=n(9014),o=n(1317),i=n(6312),l=n(4750),s=n(258),u=n(3408),c=n(3629),d=n(1697),f=n(6246),h=n(872),p=n(4792),v=n(2771),m=n(7128),g=n(2510),y=n(404),b=n(9274),w=n(4023),x=n(2254),_=n(1886),S=n(7400),E=n(7730),R=n(5506),k=n(3193),O=n(6148),C=n(6264),A=n(6132),L=n(4936),T=n(8846),M=n(3500),j=2*w.BYTES_PER_ELEMENT,N=m();function I(e){return e instanceof D||"object"===typeof e&&null!==e&&("Complex64Array"===e.constructor.name||"Complex128Array"===e.constructor.name)&&"number"===typeof e._length&&"object"===typeof e._buffer}function P(e){return e===D||"Complex64Array"===e.name}function F(e,t){return new x(e[t*=2],e[t+1])}function D(){var e,t,n,a;if(t=arguments.length,!(this instanceof D))return 0===t?new D:1===t?new D(arguments[0]):2===t?new D(arguments[0],arguments[1]):new D(arguments[0],arguments[1],arguments[2]);if(0===t)n=new w(0);else if(1===t)if(r(arguments[0]))n=new w(2*arguments[0]);else if(o(arguments[0]))if((a=(n=arguments[0]).length)&&s(n)&&d(n[0])){if(null===(n=M(new w(2*a),n))){if(!f(a))throw new RangeError(A("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));n=new w(arguments[0])}}else{if(p(n))n=R(n,0);else if(v(n))n=k(n,0);else if(!f(a))throw new RangeError(A("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",a));n=new w(n)}else if(i(arguments[0])){if(!h((n=arguments[0]).byteLength/j))throw new RangeError(A("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",j,n.byteLength));n=new w(n)}else{if(!l(arguments[0]))throw new TypeError(A("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(n=arguments[0],!1===N)throw new TypeError(A("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",n));if(!c(n[g]))throw new TypeError(A("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",n));if(n=n[g](),!c(n.next))throw new TypeError(A("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",n));if((n=L(n))instanceof Error)throw n;n=new w(n)}else{if(!i(n=arguments[0]))throw new TypeError(A("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",n));if(!r(e=arguments[1]))throw new TypeError(A("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",e));if(!h(e/j))throw new RangeError(A("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",j,e));if(2===t){if(a=n.byteLength-e,!h(a/j))throw new RangeError(A("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",j,a));n=new w(n,e)}else{if(!r(a=arguments[2]))throw new TypeError(A("invalid argument. Length must be a nonnegative integer. Value: `%s`.",a));if(a*j>n.byteLength-e)throw new RangeError(A("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",a*j));n=new w(n,e,2*a)}}return y(this,"_buffer",n),y(this,"_length",n.length/2),this}y(D,"BYTES_PER_ELEMENT",j),y(D,"name","Complex128Array"),y(D,"from",(function(e){var t,n,r,i,s,u,h,p,v,m,y,b;if(!c(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!P(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!c(r=arguments[1]))throw new TypeError(A("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(t=arguments[2])}if(I(e)){if(p=e.length,r){for(s=(i=new this(p))._buffer,b=0,y=0;y=2))throw new TypeError(A("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",m));s[b]=m[0],s[b+1]=m[1]}b+=2}return i}return new this(e)}if(o(e)){if(r){for(p=e.length,h=e.get&&e.set?C("default"):O("default"),y=0;y=2))throw new TypeError(A("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",m));s[b]=m[0],s[b+1]=m[1]}b+=2}return i}return new this(e)}if(l(e)&&N&&c(e[g])){if(s=e[g](),!c(s.next))throw new TypeError(A("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e));if((u=r?T(s,r,t):L(s))instanceof Error)throw u;for(s=(i=new this(p=u.length/2))._buffer,y=0;y=this._length))return F(this._buffer,e)})),b(D.prototype,"buffer",(function(){return this._buffer.buffer})),b(D.prototype,"byteLength",(function(){return this._buffer.byteLength})),b(D.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),y(D.prototype,"BYTES_PER_ELEMENT",D.BYTES_PER_ELEMENT),y(D.prototype,"copyWithin",(function(e,t){if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*e,2*t):this._buffer.copyWithin(2*e,2*t,2*arguments[2]),this})),y(D.prototype,"entries",(function(){var e,t,n,r,a,o,i;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,e=this._buffer,r=this._length,o=-1,i=-2,y(n={},"next",(function(){var t;if(o+=1,a||o>=r)return{done:!0};return t=new x(e[i+=2],e[i+1]),{value:[o,t],done:!1}})),y(n,"return",(function(e){if(a=!0,arguments.length)return{value:e,done:!0};return{done:!0}})),g&&y(n,g,(function(){return t.entries()})),n})),y(D.prototype,"every",(function(e,t){var n,r;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(A("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=0;r1){if(!h(t))throw new TypeError(A("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=a)<0&&(t=0),arguments.length>2){if(!h(n))throw new TypeError(A("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=a)<0&&(n=0),n>a&&(n=a)}else n=a}else t=0,n=a;for(i=_(e),l=S(e),s=t;s=0;r--)if(a=F(n,r),e.call(t,a,r,this))return a})),y(D.prototype,"findLastIndex",(function(e,t){var n,r,a;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(A("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=this._length-1;r>=0;r--)if(a=F(n,r),e.call(t,a,r,this))return r;return-1})),y(D.prototype,"forEach",(function(e,t){var n,r,a;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(A("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=0;r=this._length))return F(this._buffer,e)})),b(D.prototype,"length",(function(){return this._length})),y(D.prototype,"includes",(function(e,t){var n,r,a,o,i;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!d(e))throw new TypeError(A("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!h(t))throw new TypeError(A("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(a=_(e),o=S(e),n=this._buffer,i=t;i1){if(!h(t))throw new TypeError(A("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(a=_(e),o=S(e),n=this._buffer,i=t;i1){if(!h(t))throw new TypeError(A("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(a=_(e),o=S(e),n=this._buffer,i=t;i>=0;i--)if(a===n[r=2*i]&&o===n[r+1])return i;return-1})),y(D.prototype,"map",(function(e,t){var n,r,o,i,l;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(A("invalid argument. First argument must be a function. Value: `%s`.",e));for(r=this._buffer,n=(o=new this.constructor(this._length))._buffer,i=0;i1)r=t,o=0;else{if(0===a)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=F(n,0),o=1}for(;o1){if(!r(n=arguments[1]))throw new TypeError(A("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(d(e)){if(n>=this._length)throw new RangeError(A("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return a[n*=2]=_(e),void(a[n+1]=S(e))}if(I(e)){if(n+(s=e._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e._buffer,h=a.byteOffset+n*j,t.buffer===a.buffer&&t.byteOffseth){for(i=new w(t.length),c=0;cthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e,h=a.byteOffset+n*j,t.buffer===a.buffer&&t.byteOffseth){for(i=new w(s),c=0;cthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,c=0;cl&&(t=l)}}for(n=ea&&(t=a)}}return e>=a?(a=0,n=r.byteLength):e>=t?(a=0,n=r.byteOffset+e*j):(a=t-e,n=r.byteOffset+e*j),new this.constructor(r.buffer,n,a<0?0:a)})),y(D.prototype,"toReversed",(function(){var e,t,n,r,a,o;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=new this.constructor(n),r=this._buffer,e=t._buffer,a=0;a=a)throw new RangeError(A("invalid argument. Index argument is out-of-bounds. Value: `%s`.",e));if(!d(t))throw new TypeError(A("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(n=(r=new this.constructor(this._buffer))._buffer)[2*e]=_(t),n[2*e+1]=S(t),r})),e.exports=D},4647:(e,t,n)=>{var r=n(1697),a=n(8212),o=n(3494);e.exports=function(e,t){var n,i,l,s;for(n=t.length,s=0,l=0;l{var r=n(9014),a=n(1697),o=n(8212),i=n(3494),l=n(6132);e.exports=function(e){var t,n,s;for(t=[];!(n=e.next()).done;)if(s=n.value,r(s)&&s.length>=2)t.push(s[0],s[1]);else{if(!a(s))return new TypeError(l("invalid argument. An iterator must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",s));t.push(o(s),i(s))}return t}},2555:(e,t,n)=>{var r=n(9014),a=n(1697),o=n(8212),i=n(3494),l=n(6132);e.exports=function(e,t,n){var s,u,c,d;for(s=[],d=-1;!(u=e.next()).done;)if(d+=1,c=t.call(n,u.value,d),r(c)&&c.length>=2)s.push(c[0],c[1]);else{if(!a(c))return new TypeError(l("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",c));s.push(o(c),i(c))}return s}},9705:(e,t,n)=>{var r=n(3800);e.exports=r},3800:(e,t,n)=>{var r=n(5180).isPrimitive,a=n(9014),o=n(1317),i=n(6312),l=n(4750),s=n(258),u=n(3408).isPrimitive,c=n(3629),d=n(1697),f=n(6246),h=n(872),p=n(4792),v=n(2771),m=n(7128),g=n(2510),y=n(404),b=n(9274),w=n(3872),x=n(9341),_=n(6132),S=n(8212),E=n(3494),R=n(7730),k=n(5506),O=n(3193),C=n(6148),A=n(6264),L=n(522),T=n(2555),M=n(4647),j=2*w.BYTES_PER_ELEMENT,N=m();function I(e){return e instanceof D||"object"===typeof e&&null!==e&&("Complex64Array"===e.constructor.name||"Complex128Array"===e.constructor.name)&&"number"===typeof e._length&&"object"===typeof e._buffer}function P(e){return e===D||"Complex128Array"===e.name}function F(e,t){return new x(e[t*=2],e[t+1])}function D(){var e,t,n,a;if(t=arguments.length,!(this instanceof D))return 0===t?new D:1===t?new D(arguments[0]):2===t?new D(arguments[0],arguments[1]):new D(arguments[0],arguments[1],arguments[2]);if(0===t)n=new w(0);else if(1===t)if(r(arguments[0]))n=new w(2*arguments[0]);else if(o(arguments[0]))if((a=(n=arguments[0]).length)&&s(n)&&d(n[0])){if(null===(n=M(new w(2*a),n))){if(!f(a))throw new RangeError(_("invalid argument. Array-like object arguments must have a length which is a multiple of two. Length: `%u`.",a));n=new w(arguments[0])}}else{if(p(n))n=k(n,0);else if(v(n))n=O(n,0);else if(!f(a))throw new RangeError(_("invalid argument. Array-like object and typed array arguments must have a length which is a multiple of two. Length: `%u`.",a));n=new w(n)}else if(i(arguments[0])){if(!h((n=arguments[0]).byteLength/j))throw new RangeError(_("invalid argument. ArrayBuffer byte length must be a multiple of %u. Byte length: `%u`.",j,n.byteLength));n=new w(n)}else{if(!l(arguments[0]))throw new TypeError(_("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",arguments[0]));if(n=arguments[0],!1===N)throw new TypeError(_("invalid argument. Environment lacks Symbol.iterator support. Must provide a length, ArrayBuffer, typed array, or array-like object. Value: `%s`.",n));if(!c(n[g]))throw new TypeError(_("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",n));if(n=n[g](),!c(n.next))throw new TypeError(_("invalid argument. Must provide a length, ArrayBuffer, typed array, array-like object, or an iterable. Value: `%s`.",n));if((n=L(n))instanceof Error)throw n;n=new w(n)}else{if(!i(n=arguments[0]))throw new TypeError(_("invalid argument. First argument must be an ArrayBuffer. Value: `%s`.",n));if(!r(e=arguments[1]))throw new TypeError(_("invalid argument. Byte offset must be a nonnegative integer. Value: `%s`.",e));if(!h(e/j))throw new RangeError(_("invalid argument. Byte offset must be a multiple of %u. Value: `%u`.",j,e));if(2===t){if(a=n.byteLength-e,!h(a/j))throw new RangeError(_("invalid arguments. ArrayBuffer view byte length must be a multiple of %u. View byte length: `%u`.",j,a));n=new w(n,e)}else{if(!r(a=arguments[2]))throw new TypeError(_("invalid argument. Length must be a nonnegative integer. Value: `%s`.",a));if(a*j>n.byteLength-e)throw new RangeError(_("invalid arguments. ArrayBuffer has insufficient capacity. Either decrease the array length or provide a bigger buffer. Minimum capacity: `%u`.",a*j));n=new w(n,e,2*a)}}return y(this,"_buffer",n),y(this,"_length",n.length/2),this}y(D,"BYTES_PER_ELEMENT",j),y(D,"name","Complex64Array"),y(D,"from",(function(e){var t,n,r,i,s,u,h,p,v,m,y,b;if(!c(this))throw new TypeError("invalid invocation. `this` context must be a constructor.");if(!P(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if((n=arguments.length)>1){if(!c(r=arguments[1]))throw new TypeError(_("invalid argument. Second argument must be a function. Value: `%s`.",r));n>2&&(t=arguments[2])}if(I(e)){if(p=e.length,r){for(s=(i=new this(p))._buffer,b=0,y=0;y=2))throw new TypeError(_("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",m));s[b]=m[0],s[b+1]=m[1]}b+=2}return i}return new this(e)}if(o(e)){if(r){for(p=e.length,h=e.get&&e.set?A("default"):C("default"),y=0;y=2))throw new TypeError(_("invalid argument. Callback must return either a two-element array containing real and imaginary components or a complex number. Value: `%s`.",m));s[b]=m[0],s[b+1]=m[1]}b+=2}return i}return new this(e)}if(l(e)&&N&&c(e[g])){if(s=e[g](),!c(s.next))throw new TypeError(_("invalid argument. First argument must be an array-like object or an iterable. Value: `%s`.",e));if((u=r?T(s,r,t):L(s))instanceof Error)throw u;for(s=(i=new this(p=u.length/2))._buffer,y=0;y=this._length))return F(this._buffer,e)})),b(D.prototype,"buffer",(function(){return this._buffer.buffer})),b(D.prototype,"byteLength",(function(){return this._buffer.byteLength})),b(D.prototype,"byteOffset",(function(){return this._buffer.byteOffset})),y(D.prototype,"BYTES_PER_ELEMENT",D.BYTES_PER_ELEMENT),y(D.prototype,"copyWithin",(function(e,t){if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return 2===arguments.length?this._buffer.copyWithin(2*e,2*t):this._buffer.copyWithin(2*e,2*t,2*arguments[2]),this})),y(D.prototype,"entries",(function(){var e,t,n,r,a,o,i;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");return t=this,e=this._buffer,r=this._length,o=-1,i=-2,y(n={},"next",(function(){var t;if(o+=1,a||o>=r)return{done:!0};return t=new x(e[i+=2],e[i+1]),{value:[o,t],done:!1}})),y(n,"return",(function(e){if(a=!0,arguments.length)return{value:e,done:!0};return{done:!0}})),g&&y(n,g,(function(){return t.entries()})),n})),y(D.prototype,"every",(function(e,t){var n,r;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(_("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=0;r1){if(!h(t))throw new TypeError(_("invalid argument. Second argument must be an integer. Value: `%s`.",t));if(t<0&&(t+=a)<0&&(t=0),arguments.length>2){if(!h(n))throw new TypeError(_("invalid argument. Third argument must be an integer. Value: `%s`.",n));n<0&&(n+=a)<0&&(n=0),n>a&&(n=a)}else n=a}else t=0,n=a;for(i=S(e),l=E(e),s=t;s=0;r--)if(a=F(n,r),e.call(t,a,r,this))return a})),y(D.prototype,"findLastIndex",(function(e,t){var n,r,a;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(_("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=this._length-1;r>=0;r--)if(a=F(n,r),e.call(t,a,r,this))return r;return-1})),y(D.prototype,"forEach",(function(e,t){var n,r,a;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(_("invalid argument. First argument must be a function. Value: `%s`.",e));for(n=this._buffer,r=0;r=this._length))return F(this._buffer,e)})),y(D.prototype,"includes",(function(e,t){var n,r,a,o,i;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!d(e))throw new TypeError(_("invalid argument. First argument must be a complex number. Value: `%s`.",e));if(arguments.length>1){if(!h(t))throw new TypeError(_("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(a=S(e),o=E(e),n=this._buffer,i=t;i1){if(!h(t))throw new TypeError(_("invalid argument. Second argument must be an integer. Value: `%s`.",t));t<0&&(t+=this._length)<0&&(t=0)}else t=0;for(a=S(e),o=E(e),n=this._buffer,i=t;i1){if(!h(t))throw new TypeError(_("invalid argument. Second argument must be an integer. Value: `%s`.",t));t>=this._length?t=this._length-1:t<0&&(t+=this._length)}else t=this._length-1;for(a=S(e),o=E(e),n=this._buffer,i=t;i>=0;i--)if(a===n[r=2*i]&&o===n[r+1])return i;return-1})),b(D.prototype,"length",(function(){return this._length})),y(D.prototype,"map",(function(e,t){var n,r,o,i,l;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");if(!c(e))throw new TypeError(_("invalid argument. First argument must be a function. Value: `%s`.",e));for(r=this._buffer,n=(o=new this.constructor(this._length))._buffer,i=0;i1)r=t,o=0;else{if(0===a)throw new Error("invalid operation. If not provided an initial value, an array must contain at least one element.");r=F(n,0),o=1}for(;o1){if(!r(n=arguments[1]))throw new TypeError(_("invalid argument. Index argument must be a nonnegative integer. Value: `%s`.",n))}else n=0;if(d(e)){if(n>=this._length)throw new RangeError(_("invalid argument. Index argument is out-of-bounds. Value: `%u`.",n));return a[n*=2]=S(e),void(a[n+1]=E(e))}if(I(e)){if(n+(s=e._length)>this._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e._buffer,h=a.byteOffset+n*j,t.buffer===a.buffer&&t.byteOffseth){for(i=new w(t.length),c=0;cthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");if(t=e,h=a.byteOffset+n*j,t.buffer===a.buffer&&t.byteOffseth){for(i=new w(s),c=0;cthis._length)throw new RangeError("invalid arguments. Target array lacks sufficient storage to accommodate source values.");for(n*=2,c=0;cl&&(t=l)}}for(n=ea&&(t=a)}}return e>=a?(a=0,n=r.byteLength):e>=t?(a=0,n=r.byteOffset+e*j):(a=t-e,n=r.byteOffset+e*j),new this.constructor(r.buffer,n,a<0?0:a)})),y(D.prototype,"toReversed",(function(){var e,t,n,r,a,o;if(!I(this))throw new TypeError("invalid invocation. `this` is not a complex number array.");for(n=this._length,t=new this.constructor(n),r=this._buffer,e=t._buffer,a=0;a=a)throw new RangeError(_("invalid argument. Index argument is out-of-bounds. Value: `%s`.",e));if(!d(t))throw new TypeError(_("invalid argument. Second argument must be a complex number. Value: `%s`.",t));return(n=(r=new this.constructor(this._buffer))._buffer)[2*e]=S(t),n[2*e+1]=E(t),r})),e.exports=D},8639:e=>{e.exports={Float32Array:"float32",Float64Array:"float64",Array:"generic",Int16Array:"int16",Int32Array:"int32",Int8Array:"int8",Uint16Array:"uint16",Uint32Array:"uint32",Uint8Array:"uint8",Uint8ClampedArray:"uint8c",Complex64Array:"complex64",Complex128Array:"complex128"}},6556:(e,t,n)=>{var r=n(4023),a=n(3872),o=n(6532),i=n(8271),l=n(6990),s=n(6461),u=n(9475),c=n(7720),d=[r,a,i,o,s,l,n(9518),u,c,n(9705),n(200)];e.exports=d},4046:e=>{e.exports=["float64","float32","int32","uint32","int16","uint16","int8","uint8","uint8c","complex64","complex128"]},435:(e,t,n)=>{var r=n(3822);e.exports=r},3822:(e,t,n)=>{var r=n(971),a=n(258),o=n(2793),i=n(8639),l=n(6556),s=n(4046),u=s.length;e.exports=function(e){var t;if(a(e))return"generic";if(r(e))return null;for(t=0;t{var r,a=n(3539),o=n(9959),i=n(6321);r=a()?o:i,e.exports=r},9959:e=>{var t="function"===typeof Float32Array?Float32Array:void 0;e.exports=t},6321:e=>{e.exports=function(){throw new Error("not implemented")}},4023:(e,t,n)=>{var r,a=n(7750),o=n(1170),i=n(4892);r=a()?o:i,e.exports=r},1170:e=>{var t="function"===typeof Float64Array?Float64Array:void 0;e.exports=t},4892:e=>{e.exports=function(){throw new Error("not implemented")}},6461:(e,t,n)=>{var r,a=n(9612),o=n(7842),i=n(6714);r=a()?o:i,e.exports=r},7842:e=>{var t="function"===typeof Int16Array?Int16Array:void 0;e.exports=t},6714:e=>{e.exports=function(){throw new Error("not implemented")}},8271:(e,t,n)=>{var r,a=n(1758),o=n(4330),i=n(6020);r=a()?o:i,e.exports=r},4330:e=>{var t="function"===typeof Int32Array?Int32Array:void 0;e.exports=t},6020:e=>{e.exports=function(){throw new Error("not implemented")}},9518:(e,t,n)=>{var r,a=n(3689),o=n(2049),i=n(3447);r=a()?o:i,e.exports=r},2049:e=>{var t="function"===typeof Int8Array?Int8Array:void 0;e.exports=t},3447:e=>{e.exports=function(){throw new Error("not implemented")}},1338:(e,t,n)=>{var r=n(9518),a=n(9475),o=n(7720),i=n(6461),l=n(6990),s=n(8271),u=n(6532),c=n(3872),d=[[n(4023),"Float64Array"],[c,"Float32Array"],[s,"Int32Array"],[u,"Uint32Array"],[i,"Int16Array"],[l,"Uint16Array"],[r,"Int8Array"],[a,"Uint8Array"],[o,"Uint8ClampedArray"],[n(9705),"Complex64Array"],[n(200),"Complex128Array"]];e.exports=d},9573:(e,t,n)=>{var r=n(6388);e.exports=r},6388:(e,t,n)=>{var r=n(3107),a=n(8374),o=n(5506),i=n(3193),l=n(6132),s=n(4537);e.exports=function(e){var t,n,u;if(r(e))t=e;else{if(!a(e))throw new TypeError(l("invalid argument. Must provide a typed array. Value: `%s`.",e));t=8===e.BYTES_PER_ELEMENT?o(e,0):i(e,0)}for(n={type:s(e),data:[]},u=0;u{var r=n(6993),a=n(2793),o=n(9578),i=n(1338);e.exports=function(e){var t,n;for(n=0;n{var r,a=n(7945),o=n(1489),i=n(3719);r=a()?o:i,e.exports=r},1489:e=>{var t="function"===typeof Uint16Array?Uint16Array:void 0;e.exports=t},3719:e=>{e.exports=function(){throw new Error("not implemented")}},6532:(e,t,n)=>{var r,a=n(6863),o=n(7019),i=n(9437);r=a()?o:i,e.exports=r},7019:e=>{var t="function"===typeof Uint32Array?Uint32Array:void 0;e.exports=t},9437:e=>{e.exports=function(){throw new Error("not implemented")}},9475:(e,t,n)=>{var r,a=n(5954),o=n(7086),i=n(4336);r=a()?o:i,e.exports=r},7086:e=>{var t="function"===typeof Uint8Array?Uint8Array:void 0;e.exports=t},4336:e=>{e.exports=function(){throw new Error("not implemented")}},7720:(e,t,n)=>{var r,a=n(3978),o=n(3391),i=n(1241);r=a()?o:i,e.exports=r},3391:e=>{var t="function"===typeof Uint8ClampedArray?Uint8ClampedArray:void 0;e.exports=t},1241:e=>{e.exports=function(){throw new Error("not implemented")}},9567:e=>{var t="function"===typeof Float32Array?Float32Array:null;e.exports=t},3539:(e,t,n)=>{var r=n(1534);e.exports=r},1534:(e,t,n)=>{var r=n(2825),a=n(2857),o=n(9567);e.exports=function(){var e,t;if("function"!==typeof o)return!1;try{t=new o([1,3.14,-3.14,5e40]),e=r(t)&&1===t[0]&&3.140000104904175===t[1]&&-3.140000104904175===t[2]&&t[3]===a}catch(n){e=!1}return e}},5829:e=>{var t="function"===typeof Float64Array?Float64Array:null;e.exports=t},7750:(e,t,n)=>{var r=n(8265);e.exports=r},8265:(e,t,n)=>{var r=n(9220),a=n(5829);e.exports=function(){var e,t;if("function"!==typeof a)return!1;try{t=new a([1,3.14,-3.14,NaN]),e=r(t)&&1===t[0]&&3.14===t[1]&&-3.14===t[2]&&t[3]!==t[3]}catch(n){e=!1}return e}},6745:e=>{e.exports=function(){}},2357:(e,t,n)=>{var r=n(9076);e.exports=r},9076:(e,t,n)=>{var r=n(6745);e.exports=function(){return"foo"===r.name}},9612:(e,t,n)=>{var r=n(1011);e.exports=r},953:e=>{var t="function"===typeof Int16Array?Int16Array:null;e.exports=t},1011:(e,t,n)=>{var r=n(7646),a=n(9530),o=n(380),i=n(953);e.exports=function(){var e,t;if("function"!==typeof i)return!1;try{t=new i([1,3.14,-3.14,a+1]),e=r(t)&&1===t[0]&&3===t[1]&&-3===t[2]&&t[3]===o}catch(n){e=!1}return e}},1758:(e,t,n)=>{var r=n(5409);e.exports=r},6901:e=>{var t="function"===typeof Int32Array?Int32Array:null;e.exports=t},5409:(e,t,n)=>{var r=n(6668),a=n(780),o=n(2042),i=n(6901);e.exports=function(){var e,t;if("function"!==typeof i)return!1;try{t=new i([1,3.14,-3.14,a+1]),e=r(t)&&1===t[0]&&3===t[1]&&-3===t[2]&&t[3]===o}catch(n){e=!1}return e}},3689:(e,t,n)=>{var r=n(1048);e.exports=r},8533:e=>{var t="function"===typeof Int8Array?Int8Array:null;e.exports=t},1048:(e,t,n)=>{var r=n(6195),a=n(3033),o=n(2403),i=n(8533);e.exports=function(){var e,t;if("function"!==typeof i)return!1;try{t=new i([1,3.14,-3.14,a+1]),e=r(t)&&1===t[0]&&3===t[1]&&-3===t[2]&&t[3]===o}catch(n){e=!1}return e}},7128:(e,t,n)=>{var r=n(2703);e.exports=r},2703:(e,t,n)=>{var r=n(7615),a=n(2490);e.exports=function(){return"function"===typeof a&&"symbol"===typeof a("foo")&&r(a,"iterator")&&"symbol"===typeof a.iterator}},7615:(e,t,n)=>{var r=n(2010);e.exports=r},2010:e=>{var t=Object.prototype.hasOwnProperty;e.exports=function(e,n){return void 0!==e&&null!==e&&t.call(e,n)}},1767:(e,t,n)=>{var r=n(2322);e.exports=r},2322:e=>{e.exports=function(){return"function"===typeof Symbol&&"symbol"===typeof Symbol("foo")}},9681:(e,t,n)=>{var r=n(5376);e.exports=r},5376:(e,t,n)=>{var r=n(1767)();e.exports=function(){return r&&"symbol"===typeof Symbol.toStringTag}},7945:(e,t,n)=>{var r=n(7336);e.exports=r},7336:(e,t,n)=>{var r=n(8563),a=n(2761),o=n(4845);e.exports=function(){var e,t;if("function"!==typeof o)return!1;try{t=new o(t=[1,3.14,-3.14,a+1,a+2]),e=r(t)&&1===t[0]&&3===t[1]&&t[2]===a-2&&0===t[3]&&1===t[4]}catch(n){e=!1}return e}},4845:e=>{var t="function"===typeof Uint16Array?Uint16Array:null;e.exports=t},6863:(e,t,n)=>{var r=n(6890);e.exports=r},6890:(e,t,n)=>{var r=n(3973),a=n(3335),o=n(633);e.exports=function(){var e,t;if("function"!==typeof o)return!1;try{t=new o(t=[1,3.14,-3.14,a+1,a+2]),e=r(t)&&1===t[0]&&3===t[1]&&t[2]===a-2&&0===t[3]&&1===t[4]}catch(n){e=!1}return e}},633:e=>{var t="function"===typeof Uint32Array?Uint32Array:null;e.exports=t},5954:(e,t,n)=>{var r=n(5349);e.exports=r},5349:(e,t,n)=>{var r=n(6424),a=n(4264),o=n(7869);e.exports=function(){var e,t;if("function"!==typeof o)return!1;try{t=new o(t=[1,3.14,-3.14,a+1,a+2]),e=r(t)&&1===t[0]&&3===t[1]&&t[2]===a-2&&0===t[3]&&1===t[4]}catch(n){e=!1}return e}},7869:e=>{var t="function"===typeof Uint8Array?Uint8Array:null;e.exports=t},3978:(e,t,n)=>{var r=n(3517);e.exports=r},3517:(e,t,n)=>{var r=n(5336),a=n(541);e.exports=function(){var e,t;if("function"!==typeof a)return!1;try{t=new a([-1,0,1,3.14,4.99,255,256]),e=r(t)&&0===t[0]&&0===t[1]&&1===t[2]&&3===t[3]&&5===t[4]&&255===t[5]&&255===t[6]}catch(n){e=!1}return e}},541:e=>{var t="function"===typeof Uint8ClampedArray?Uint8ClampedArray:null;e.exports=t},6993:(e,t,n)=>{var r=n(2512);e.exports=r},2512:(e,t,n)=>{var r=n(6132);e.exports=function(e,t){if("function"!==typeof t)throw new TypeError(r("invalid argument. Second argument must be callable. Value: `%s`.",t));return e instanceof t}},9568:(e,t,n)=>{var r,a=n(994);r=function(){return a(arguments)}(),e.exports=r},6631:(e,t,n)=>{var r,a=n(9568),o=n(994),i=n(2524);r=a?o:i,e.exports=r},994:(e,t,n)=>{var r=n(9359);e.exports=function(e){return"[object Arguments]"===r(e)}},2524:(e,t,n)=>{var r=n(7615),a=n(9767),o=n(258),i=n(872),l=n(3335);e.exports=function(e){return null!==e&&"object"===typeof e&&!o(e)&&"number"===typeof e.length&&i(e.length)&&e.length>=0&&e.length<=l&&r(e,"callee")&&!a(e,"callee")}},9014:(e,t,n)=>{var r=n(4313);e.exports=r},4313:(e,t,n)=>{var r=n(872),a=n(5680);e.exports=function(e){return"object"===typeof e&&null!==e&&"number"===typeof e.length&&r(e.length)&&e.length>=0&&e.length<=a}},258:(e,t,n)=>{var r=n(8517);e.exports=r},8517:(e,t,n)=>{var r,a=n(9359);r=Array.isArray?Array.isArray:function(e){return"[object Array]"===a(e)},e.exports=r},6312:(e,t,n)=>{var r=n(3983);e.exports=r},3983:(e,t,n)=>{var r=n(9359),a="function"===typeof ArrayBuffer;e.exports=function(e){return a&&e instanceof ArrayBuffer||"[object ArrayBuffer]"===r(e)}},5111:(e,t,n)=>{var r=n(404),a=n(2194),o=n(2542),i=n(6488);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},2194:(e,t,n)=>{var r=n(2542),a=n(6488);e.exports=function(e){return r(e)||a(e)}},6488:(e,t,n)=>{var r=n(9681),a=n(9359),o=n(844),i=n(7810),l=r();e.exports=function(e){return"object"===typeof e&&(e instanceof o||(l?i(e):"[object Boolean]"===a(e)))}},2542:e=>{e.exports=function(e){return"boolean"===typeof e}},3711:e=>{var t=Boolean.prototype.toString;e.exports=t},7810:(e,t,n)=>{var r=n(3711);e.exports=function(e){try{return r.call(e),!0}catch(t){return!1}}},971:(e,t,n)=>{var r=n(8806);e.exports=r},8806:(e,t,n)=>{var r=n(4242);e.exports=function(e){return r(e)&&(e._isBuffer||e.constructor&&"function"===typeof e.constructor.isBuffer&&e.constructor.isBuffer(e))}},1317:(e,t,n)=>{var r=n(8292);e.exports=r},8292:(e,t,n)=>{var r=n(872),a=n(1747);e.exports=function(e){return"object"===typeof e&&null!==e&&"number"===typeof e.length&&r(e.length)&&e.length>=0&&e.length<=a}},1697:(e,t,n)=>{var r=n(8480);e.exports=r},8480:(e,t,n)=>{var r=n(2254),a=n(9341);e.exports=function(e){return e instanceof r||e instanceof a||"object"===typeof e&&null!==e&&"number"===typeof e.re&&"number"===typeof e.im}},6437:(e,t,n)=>{var r=n(9705),a=[n(200),r];e.exports=a},8374:(e,t,n)=>{var r=n(8281);e.exports=r},8281:(e,t,n)=>{var r=n(2793),a=n(9578),o=n(6437),i=n(2722);e.exports=function(e){var t,n;if("object"!==typeof e||null===e)return!1;for(n=0;n{var r;r=!n(6484).call("beep","0"),e.exports=r},9767:(e,t,n)=>{var r=n(8578);e.exports=r},8578:(e,t,n)=>{var r=n(3408),a=n(830).isPrimitive,o=n(4689).isPrimitive,i=n(6484),l=n(5053);e.exports=function(e,t){var n;return void 0!==e&&null!==e&&(!(n=i.call(e,t))&&l&&r(e)?!a(t=+t)&&o(t)&&t>=0&&t{var t=Object.prototype.propertyIsEnumerable;e.exports=t},2825:(e,t,n)=>{var r=n(3736);e.exports=r},3736:(e,t,n)=>{var r=n(9359),a="function"===typeof Float32Array;e.exports=function(e){return a&&e instanceof Float32Array||"[object Float32Array]"===r(e)}},9220:(e,t,n)=>{var r=n(27);e.exports=r},27:(e,t,n)=>{var r=n(9359),a="function"===typeof Float64Array;e.exports=function(e){return a&&e instanceof Float64Array||"[object Float64Array]"===r(e)}},3629:(e,t,n)=>{var r=n(8236);e.exports=r},8236:(e,t,n)=>{var r=n(6253);e.exports=function(e){return"function"===r(e)}},7646:(e,t,n)=>{var r=n(9905);e.exports=r},9905:(e,t,n)=>{var r=n(9359),a="function"===typeof Int16Array;e.exports=function(e){return a&&e instanceof Int16Array||"[object Int16Array]"===r(e)}},6668:(e,t,n)=>{var r=n(6259);e.exports=r},6259:(e,t,n)=>{var r=n(9359),a="function"===typeof Int32Array;e.exports=function(e){return a&&e instanceof Int32Array||"[object Int32Array]"===r(e)}},6195:(e,t,n)=>{var r=n(9870);e.exports=r},9870:(e,t,n)=>{var r=n(9359),a="function"===typeof Int8Array;e.exports=function(e){return a&&e instanceof Int8Array||"[object Int8Array]"===r(e)}},4689:(e,t,n)=>{var r=n(404),a=n(3360),o=n(7588),i=n(3674);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},7987:(e,t,n)=>{var r=n(2857),a=n(8239),o=n(872);e.exports=function(e){return ea&&o(e)}},3360:(e,t,n)=>{var r=n(7588),a=n(3674);e.exports=function(e){return r(e)||a(e)}},3674:(e,t,n)=>{var r=n(2280).isObject,a=n(7987);e.exports=function(e){return r(e)&&a(e.valueOf())}},7588:(e,t,n)=>{var r=n(2280).isPrimitive,a=n(7987);e.exports=function(e){return r(e)&&a(e)}},7536:(e,t,n)=>{var r=n(9475),a={uint16:n(6990),uint8:r};e.exports=a},735:(e,t,n)=>{var r=n(5498);e.exports=r},5498:(e,t,n)=>{var r,a=n(7536);r=function(){var e;return(e=new a.uint16(1))[0]=4660,52===new a.uint8(e.buffer)[0]}(),e.exports=r},830:(e,t,n)=>{var r=n(404),a=n(8625),o=n(8859),i=n(2131);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},8625:(e,t,n)=>{var r=n(8859),a=n(2131);e.exports=function(e){return r(e)||a(e)}},2131:(e,t,n)=>{var r=n(2280).isObject,a=n(6679);e.exports=function(e){return r(e)&&a(e.valueOf())}},8859:(e,t,n)=>{var r=n(2280).isPrimitive,a=n(6679);e.exports=function(e){return r(e)&&a(e)}},5180:(e,t,n)=>{var r=n(404),a=n(483),o=n(6605),i=n(6057);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},483:(e,t,n)=>{var r=n(6605),a=n(6057);e.exports=function(e){return r(e)||a(e)}},6057:(e,t,n)=>{var r=n(4689).isObject;e.exports=function(e){return r(e)&&e.valueOf()>=0}},6605:(e,t,n)=>{var r=n(4689).isPrimitive;e.exports=function(e){return r(e)&&e>=0}},2280:(e,t,n)=>{var r=n(404),a=n(223),o=n(1905),i=n(3117);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},223:(e,t,n)=>{var r=n(1905),a=n(3117);e.exports=function(e){return r(e)||a(e)}},3117:(e,t,n)=>{var r=n(9681),a=n(9359),o=n(2125),i=n(8253),l=r();e.exports=function(e){return"object"===typeof e&&(e instanceof o||(l?i(e):"[object Number]"===a(e)))}},1905:e=>{e.exports=function(e){return"number"===typeof e}},3318:(e,t,n)=>{var r=n(2125).prototype.toString;e.exports=r},8253:(e,t,n)=>{var r=n(3318);e.exports=function(e){try{return r.call(e),!0}catch(t){return!1}}},4242:(e,t,n)=>{var r=n(404),a=n(6188),o=n(7349);r(o,"isObjectLikeArray",a(o)),e.exports=o},7349:e=>{e.exports=function(e){return null!==e&&"object"===typeof e}},4750:(e,t,n)=>{var r=n(3633);e.exports=r},3633:(e,t,n)=>{var r=n(258);e.exports=function(e){return"object"===typeof e&&null!==e&&!r(e)}},5417:(e,t,n)=>{var r=n(1640);e.exports=r},1640:(e,t,n)=>{var r=n(4750),a=n(3629),o=n(9578),i=n(7615),l=n(9359),s=Object.prototype;e.exports=function(e){var t;return!!r(e)&&(!(t=o(e))||!i(e,"constructor")&&i(t,"constructor")&&a(t.constructor)&&"[object Function]"===l(t.constructor)&&i(t,"isPrototypeOf")&&a(t.isPrototypeOf)&&(t===s||function(e){var t;for(t in e)if(!i(e,t))return!1;return!0}(e)))}},2001:(e,t,n)=>{var r=n(404),a=n(7968),o=n(5460),i=n(810);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},7968:(e,t,n)=>{var r=n(5460),a=n(810);e.exports=function(e){return r(e)||a(e)}},810:(e,t,n)=>{var r=n(4689).isObject;e.exports=function(e){return r(e)&&e.valueOf()>0}},5460:(e,t,n)=>{var r=n(4689).isPrimitive;e.exports=function(e){return r(e)&&e>0}},280:(e,t,n)=>{var r=n(404),a=n(7775),o=n(4337),i=n(6109);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},7775:(e,t,n)=>{var r=n(4337),a=n(6109);e.exports=function(e){return r(e)||a(e)}},6109:(e,t,n)=>{var r=n(2280).isObject;e.exports=function(e){return r(e)&&e.valueOf()>0}},4337:(e,t,n)=>{var r=n(2280).isPrimitive;e.exports=function(e){return r(e)&&e>0}},3408:(e,t,n)=>{var r=n(404),a=n(6263),o=n(6473),i=n(3909);r(a,"isPrimitive",o),r(a,"isObject",i),e.exports=a},6263:(e,t,n)=>{var r=n(6473),a=n(3909);e.exports=function(e){return r(e)||a(e)}},3909:(e,t,n)=>{var r=n(9681),a=n(9359),o=n(1679),i=r();e.exports=function(e){return"object"===typeof e&&(e instanceof String||(i?o(e):"[object String]"===a(e)))}},6473:e=>{e.exports=function(e){return"string"===typeof e}},1679:(e,t,n)=>{var r=n(3960);e.exports=function(e){try{return r.call(e),!0}catch(t){return!1}}},3960:e=>{var t=String.prototype.valueOf;e.exports=t},5580:(e,t,n)=>{var r=n(9518),a=n(9475),o=n(7720),i=n(6461),l=n(6990),s=n(8271),u=n(6532),c=n(3872),d=[n(4023),c,s,u,i,l,r,a,o];e.exports=d},3107:(e,t,n)=>{var r=n(4174);e.exports=r},4174:(e,t,n)=>{var r=n(2793),a=n(5527),o=n(9578),i=n(7750),l=n(4023),s=n(5580),u=n(2447),c=i()?o(l):d;function d(){}c="TypedArray"===a(c)?c:d,e.exports=function(e){var t,n;if("object"!==typeof e||null===e)return!1;if(e instanceof c)return!0;for(n=0;n{var r=n(4590);e.exports=r},4590:(e,t,n)=>{var r=n(9359),a="function"===typeof Uint16Array;e.exports=function(e){return a&&e instanceof Uint16Array||"[object Uint16Array]"===r(e)}},3973:(e,t,n)=>{var r=n(9636);e.exports=r},9636:(e,t,n)=>{var r=n(9359),a="function"===typeof Uint32Array;e.exports=function(e){return a&&e instanceof Uint32Array||"[object Uint32Array]"===r(e)}},6424:(e,t,n)=>{var r=n(5231);e.exports=r},5231:(e,t,n)=>{var r=n(9359),a="function"===typeof Uint8Array;e.exports=function(e){return a&&e instanceof Uint8Array||"[object Uint8Array]"===r(e)}},5336:(e,t,n)=>{var r=n(9996);e.exports=r},9996:(e,t,n)=>{var r=n(9359),a="function"===typeof Uint8ClampedArray;e.exports=function(e){return a&&e instanceof Uint8ClampedArray||"[object Uint8ClampedArray]"===r(e)}},6188:(e,t,n)=>{var r=n(1907);e.exports=r},1907:(e,t,n)=>{var r=n(258),a=n(6132);e.exports=function(e){if("function"!==typeof e)throw new TypeError(a("invalid argument. Must provide a function. Value: `%s`.",e));return function(t){var n,a;if(!r(t))return!1;if(0===(n=t.length))return!1;for(a=0;a{e.exports=function(e,t,n,r,a,o,i){var l,s,u,c,d,f,h;for(l=t.data,s=a.data,c=t.accessors[0],u=a.accessors[1],d=r,f=i,h=0;h{var r=n(404),a=n(4441);r(a,"ndarray",n(713)),e.exports=a},4441:(e,t,n)=>{var r=n(2508),a=n(6438);e.exports=function(e,t,n,o,i){var l,s,u,c,d,f;if(e<=0)return o;if(u=r(t),c=r(o),u.accessorProtocol||c.accessorProtocol)return a(e,u,n,l=n<0?(1-e)*n:0,c,i,s=i<0?(1-e)*i:0),c.data;if(1===n&&1===i){if((d=e%8)>0)for(f=0;f{var r=n(2508),a=n(6438);e.exports=function(e,t,n,o,i,l,s){var u,c,d,f,h,p;if(e<=0)return i;if(d=r(t),f=r(i),d.accessorProtocol||f.accessorProtocol)return a(e,d,n,o,f,l,s),f.data;if(u=o,c=s,1===n&&1===l){if((h=e%8)>0)for(p=0;p{var r=n(9347);e.exports=r},9347:e=>{var t=Boolean;e.exports=t},9341:(e,t,n)=>{var r=n(3372);e.exports=r},3372:(e,t,n)=>{var r=n(2280).isPrimitive,a=n(9872),o=n(404),i=n(3887),l=n(6132),s=n(7345),u=n(5810);function c(e,t){if(!(this instanceof c))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!r(e))throw new TypeError(l("invalid argument. Real component must be a number. Value: `%s`.",e));if(!r(t))throw new TypeError(l("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return a(this,"re",{configurable:!1,enumerable:!0,writable:!1,value:i(e)}),a(this,"im",{configurable:!1,enumerable:!0,writable:!1,value:i(t)}),this}o(c,"BYTES_PER_ELEMENT",4),o(c.prototype,"BYTES_PER_ELEMENT",4),o(c.prototype,"byteLength",8),o(c.prototype,"toString",s),o(c.prototype,"toJSON",u),e.exports=c},5810:e=>{e.exports=function(){var e={type:"Complex64"};return e.re=this.re,e.im=this.im,e}},7345:e=>{e.exports=function(){var e=""+this.re;return this.im<0?e+=" - "+-this.im:e+=" + "+this.im,e+="i"}},2254:(e,t,n)=>{var r=n(4737);e.exports=r},4737:(e,t,n)=>{var r=n(2280).isPrimitive,a=n(9872),o=n(404),i=n(6132),l=n(7736),s=n(2019);function u(e,t){if(!(this instanceof u))throw new TypeError("invalid invocation. Constructor must be called with the `new` keyword.");if(!r(e))throw new TypeError(i("invalid argument. Real component must be a number. Value: `%s`.",e));if(!r(t))throw new TypeError(i("invalid argument. Imaginary component must be a number. Value: `%s`.",t));return a(this,"re",{configurable:!1,enumerable:!0,writable:!1,value:e}),a(this,"im",{configurable:!1,enumerable:!0,writable:!1,value:t}),this}o(u,"BYTES_PER_ELEMENT",8),o(u.prototype,"BYTES_PER_ELEMENT",8),o(u.prototype,"byteLength",16),o(u.prototype,"toString",l),o(u.prototype,"toJSON",s),e.exports=u},2019:e=>{e.exports=function(){var e={type:"Complex128"};return e.re=this.re,e.im=this.im,e}},7736:e=>{e.exports=function(){var e=""+this.re;return this.im<0?e+=" - "+-this.im:e+=" + "+this.im,e+="i"}},7400:(e,t,n)=>{var r=n(4015);e.exports=r},4015:e=>{e.exports=function(e){return e.im}},3494:(e,t,n)=>{var r=n(6678);e.exports=r},6678:e=>{e.exports=function(e){return e.im}},1886:(e,t,n)=>{var r=n(7537);e.exports=r},7537:e=>{e.exports=function(e){return e.re}},8212:(e,t,n)=>{var r=n(2955);e.exports=r},2955:e=>{e.exports=function(e){return e.re}},5680:e=>{e.exports=4294967295},1747:e=>{e.exports=9007199254740991},5129:e=>{e.exports=1023},1955:e=>{e.exports=2147483647},8666:e=>{e.exports=2146435072},4004:e=>{e.exports=2147483648},1850:e=>{e.exports=1048575},2587:e=>{e.exports=.6931471805599453},5748:e=>{e.exports=-1023},1384:e=>{e.exports=1023},3285:e=>{e.exports=9007199254740991},3210:e=>{e.exports=-1074},8239:(e,t,n)=>{var r=n(2125).NEGATIVE_INFINITY;e.exports=r},2857:e=>{var t=Number.POSITIVE_INFINITY;e.exports=t},7013:e=>{e.exports=22250738585072014e-324},9530:e=>{e.exports=32767},380:e=>{e.exports=-32768},780:e=>{e.exports=2147483647},2042:e=>{e.exports=-2147483648},3033:e=>{e.exports=127},2403:e=>{e.exports=-128},2761:e=>{e.exports=65535},3335:e=>{e.exports=4294967295},4264:e=>{e.exports=255},6246:(e,t,n)=>{var r=n(9897);e.exports=r},9897:(e,t,n)=>{var r=n(872);e.exports=function(e){return r(e/2)}},7182:(e,t,n)=>{var r=n(2801);e.exports=r},2801:(e,t,n)=>{var r=n(2857),a=n(8239);e.exports=function(e){return e===r||e===a}},872:(e,t,n)=>{var r=n(2927);e.exports=r},2927:(e,t,n)=>{var r=n(7730);e.exports=function(e){return r(e)===e}},6679:(e,t,n)=>{var r=n(7970);e.exports=r},7970:e=>{e.exports=function(e){return e!==e}},411:(e,t,n)=>{var r=n(8694);e.exports=r},8694:(e,t,n)=>{var r=n(6246);e.exports=function(e){return r(e>0?e-1:e+1)}},5542:(e,t,n)=>{var r=n(5737);e.exports=r},5737:(e,t,n)=>{var r=n(2857);e.exports=function(e){return 0===e&&1/e===r}},5350:(e,t,n)=>{var r=n(4297);e.exports=r},4297:e=>{e.exports=function(e,t){var n,r;return((n=(65535&(e>>>=0))>>>0)*(r=(65535&(t>>>=0))>>>0)>>>0)+((e>>>16>>>0)*r+n*(t>>>16>>>0)<<16>>>0)>>>0}},2712:(e,t,n)=>{var r=n(5023);e.exports=r},5023:e=>{e.exports=function(e){return Math.abs(e)}},4037:(e,t,n)=>{var r=n(8932);e.exports=r},8932:e=>{var t=Math.ceil;e.exports=t},940:(e,t,n)=>{var r=n(2243);e.exports=r},2243:(e,t,n)=>{var r=n(4004),a=n(1955),o=n(2105),i=n(4126),l=n(6056),s=[0,0];e.exports=function(e,t){var n,u;return o.assign(e,s,1,0),n=s[0],n&=a,u=i(t),l(n|=u&=r,s[1])}},331:(e,t,n)=>{var r=n(1127),a=n(7713);e.exports=function(e,t,n){var o,i,l;return l=(o=e-t)-(i=o*o)*a(i),r(1-(t-o*l/(2-l)-e),n)}},375:(e,t,n)=>{var r=n(4466);e.exports=r},4466:(e,t,n)=>{var r=n(6679),a=n(7882),o=n(8239),i=n(2857),l=n(331),s=1.4426950408889634,u=1/(1<<28),c=-u;e.exports=function(e){var t;return r(e)||e===i?e:e===o?0:e>709.782712893384?i:e<-745.1332191019411?0:e>c&&e{e.exports=function(e){return 0===e?.16666666666666602:.16666666666666602+e*(e*(6613756321437934e-20+e*(4.1381367970572385e-8*e-16533902205465252e-22))-.0027777777777015593)}},7730:(e,t,n)=>{var r=n(8885);e.exports=r},8885:e=>{var t=Math.floor;e.exports=t},1127:(e,t,n)=>{var r=n(3266);e.exports=r},3266:(e,t,n)=>{var r=n(2857),a=n(8239),o=n(5129),i=n(1384),l=n(5748),s=n(3210),u=n(6679),c=n(7182),d=n(940),f=n(99).assign,h=n(3015),p=n(2105),v=n(6056),m=[0,0],g=[0,0];e.exports=function(e,t){var n,y;return 0===t||0===e||u(e)||c(e)?e:(f(e,m,1,0),t+=m[1],(t+=h(e=m[0]))i?e<0?a:r:(t<=l?(t+=52,y=2220446049250313e-31):y=1,p.assign(e,g,1,0),n=g[0],n&=2148532223,y*v(n|=t+o<<20,g[1])))}},2522:(e,t,n)=>{var r=n(9117);e.exports=r},9117:(e,t,n)=>{var r=n(4126),a=n(730),o=n(6679),i=n(5129),l=n(8239),s=n(3908),u=n(1851),c=.6931471803691238,d=1.9082149292705877e-10,f=1048575;e.exports=function(e){var t,n,h,p,v,m,g,y,b,w,x;return 0===e?l:o(e)||e<0?NaN:(p=0,(n=r(e))<1048576&&(p-=54,n=r(e*=0x40000000000000)),n>=2146435072?e+e:(p+=(n>>20)-i|0,p+=(g=(n&=f)+614244&1048576)>>20,m=(e=a(e,n|1072693248^g))-1,(f&2+n)<3?0===m?0===p?0:p*c+p*d:(v=m*m*(.5-.3333333333333333*m),0===p?m-v:p*c-(v-p*d-m)):(g=n-398458|0,y=440401-n|0,h=(w=(x=(b=m/(2+m))*b)*x)*s(w),v=x*u(w)+h,(g|=y)>0?(t=.5*m*m,0===p?m-(t-b*(t+v)):p*c-(t-(b*(t+v)+p*d)-m)):0===p?m-b*(m-v):p*c-(b*(m-v)-p*d-m))))}},3908:e=>{e.exports=function(e){return 0===e?.3999999999940942:.3999999999940942+e*(.22222198432149784+.15313837699209373*e)}},1851:e=>{e.exports=function(e){return 0===e?.6666666666666735:.6666666666666735+e*(.2857142874366239+e*(.1818357216161805+.14798198605116586*e))}},6666:(e,t,n)=>{var r=n(1885);e.exports=r},1885:(e,t,n)=>{var r=n(5542),a=n(6679),o=n(2857);e.exports=function(e,t){return a(e)||a(t)?NaN:e===o||t===o?o:e===t&&0===e?r(e)?e:t:e>t?e:t}},3898:(e,t,n)=>{var r=n(189);e.exports=r},4173:(e,t,n)=>{var r=n(4126),a=n(4422),o=n(730),i=n(5129),l=n(2448),s=1048576,u=[1,1.5],c=[0,.5849624872207642],d=[0,1.350039202129749e-8];e.exports=function(e,t,n){var f,h,p,v,m,g,y,b,w,x,_,S,E,R,k,O,C,A,L,T;return A=0,n>20)-i|0,n=1072693248|(L=1048575&n),L<=235662?T=0:L<767610?T=1:(T=0,A+=1,n-=s),f=524288+(n>>1|536870912),m=(C=1/((t=o(t,n))+(y=u[T])))*((O=t-y)-(v=a(h=O*C,0))*(g=o(0,f+=T<<18))-v*(t-(g-y))),k=(p=h*h)*p*l(p),g=a(g=3+(p=v*v)+(k+=m*(v+h)),0),E=(_=-7.028461650952758e-9*(w=a(w=(O=v*g)+(C=m*g+(k-(g-3-p))*h),0))+.9617966939259756*(C-(w-O))+d[T])-((S=a(S=(x=.9617967009544373*w)+_+(b=c[T])+(R=A),0))-R-b-x),e[0]=S,e[1]=E,e}},4490:(e,t,n)=>{var r=n(4422),a=n(6049);e.exports=function(e,t){var n,o,i,l,s;return n=(s=1.9259629911266175e-8*(i=t-1)-1.4426950408889634*(i*i*a(i)))-((o=r(o=(l=1.4426950216293335*i)+s,0))-l),e[0]=o,e[1]=n,e}},189:(e,t,n)=>{var r=n(6679),a=n(411),o=n(7182),i=n(872),l=n(2314),s=n(2712),u=n(2105),c=n(4422),d=n(5163),f=n(8239),h=n(2857),p=n(1955),v=n(6950),m=n(9788),g=n(1167),y=n(4173),b=n(4490),w=n(4383),x=1083179008,_=1e300,S=1e-300,E=[0,0],R=[0,0];e.exports=function e(t,n){var k,O,C,A,L,T,M,j,N,I,P,F,D,B;if(r(t)||r(n))return NaN;if(u.assign(n,E,1,0),L=E[0],0===E[1]){if(0===n)return 1;if(1===n)return t;if(-1===n)return 1/t;if(.5===n)return l(t);if(-.5===n)return 1/l(t);if(2===n)return t*t;if(3===n)return t*t*t;if(4===n)return(t*=t)*t;if(o(n))return g(t,n)}if(u.assign(t,E,1,0),A=E[0],0===E[1]){if(0===A)return v(t,n);if(1===t)return 1;if(-1===t&&a(n))return-1;if(o(t))return t===f?e(-0,-n):n<0?0:h}if(t<0&&!1===i(n))return(t-t)/(t-t);if(C=s(t),k=A&p,O=L&p,M=L>>>31|0,T=(T=A>>>31|0)&&a(n)?-1:1,O>1105199104){if(O>1139802112)return m(t,n);if(k<1072693247)return 1===M?T*_*_:T*S*S;if(k>1072693248)return 0===M?T*_*_:T*S*S;P=b(R,C)}else P=y(R,C,k);if(F=(I=(n-(j=c(n,0)))*P[0]+n*P[1])+(N=j*P[0]),u.assign(F,E,1,0),D=d(E[0]),B=d(E[1]),D>=x){if(0!==(D-x|B))return T*_*_;if(I+8008566259537294e-32>F-N)return T*_*_}else if((D&p)>=1083231232){if(0!==(D-3230714880|B))return T*S*S;if(I<=F-N)return T*S*S}return T*(F=w(D,N,I))}},2448:e=>{e.exports=function(e){return 0===e?.5999999999999946:.5999999999999946+e*(.4285714285785502+e*(.33333332981837743+e*(.272728123808534+e*(.23066074577556175+.20697501780033842*e))))}},1748:e=>{e.exports=function(e){return 0===e?.16666666666666602:.16666666666666602+e*(e*(6613756321437934e-20+e*(4.1381367970572385e-8*e-16533902205465252e-22))-.0027777777777015593)}},6049:e=>{e.exports=function(e){return 0===e?.5:.5+e*(.25*e-.3333333333333333)}},4383:(e,t,n)=>{var r=n(4126),a=n(730),o=n(4422),i=n(5163),l=n(1127),s=n(2587),u=n(5129),c=n(1955),d=n(1850),f=n(1748),h=1048576;e.exports=function(e,t,n){var p,v,m,g,y,b,w,x,_;return _=((x=e&c)>>20)-u|0,w=0,x>1071644672&&(v=a(0,((w=e+(h>>_+1)>>>0)&~(d>>(_=((w&c)>>20)-u|0)))>>>0),w=(w&d|h)>>20-_>>>0,e<0&&(w=-w),t-=v),y=(g=(n-((v=o(v=n+t,0))-t))*s+-1.904654299957768e-9*v)-((b=(m=.6931471824645996*v)+g)-m),p=b-(v=b*b)*f(v),e=r(b=1-(b*p/(p-2)-(y+b*y)-b)),e=i(e),b=(e+=w<<20>>>0)>>20<=0?l(b,w):a(b,e)}},6950:(e,t,n)=>{var r=n(411),a=n(940),o=n(8239),i=n(2857);e.exports=function(e,t){return t===o?i:t===i?0:t>0?r(t)?e:0:r(t)?a(i,e):i}},9788:(e,t,n)=>{var r=n(1955),a=n(4126);e.exports=function(e,t){return(a(e)&r)<=1072693247?t<0?1/0:0:t>0?1/0:0}},1167:(e,t,n)=>{var r=n(2712),a=n(2857);e.exports=function(e,t){return-1===e?(e-e)/(e-e):1===e?1:r(e)<1===(t===a)?0:a}},2314:(e,t,n)=>{var r=n(4557);e.exports=r},4557:e=>{var t=Math.sqrt;e.exports=t},7882:(e,t,n)=>{var r=n(7917);e.exports=r},7917:(e,t,n)=>{var r=n(7730),a=n(4037);e.exports=function(e){return e<0?a(e):r(e)}},2125:(e,t,n)=>{var r=n(8828);e.exports=r},8828:e=>{e.exports=Number},3015:(e,t,n)=>{var r=n(3186);e.exports=r},3186:(e,t,n)=>{var r=n(4126),a=n(8666),o=n(5129);e.exports=function(e){var t=r(e);return(t=(t&a)>>>20)-o|0}},6056:(e,t,n)=>{var r=n(9887);e.exports=r},4381:(e,t,n)=>{var r,a,o;!0===n(735)?(a=1,o=0):(a=0,o=1),r={HIGH:a,LOW:o},e.exports=r},9887:(e,t,n)=>{var r=n(6532),a=n(4023),o=n(4381),i=new a(1),l=new r(i.buffer),s=o.HIGH,u=o.LOW;e.exports=function(e,t){return l[s]=e,l[u]=t,i[0]}},9176:(e,t,n)=>{var r;r=!0===n(735)?1:0,e.exports=r},4126:(e,t,n)=>{var r=n(3281);e.exports=r},3281:(e,t,n)=>{var r=n(6532),a=n(4023),o=n(9176),i=new a(1),l=new r(i.buffer);e.exports=function(e){return i[0]=e,l[o]}},5050:(e,t,n)=>{var r=n(7013),a=n(7182),o=n(6679),i=n(2712);e.exports=function(e,t,n,l){return o(e)||a(e)?(t[l]=e,t[l+n]=0,t):0!==e&&i(e){var r=n(404),a=n(1966);r(a,"assign",n(5050)),e.exports=a},1966:(e,t,n)=>{var r=n(5050);e.exports=function(e){return r(e,[0,0],1,0)}},6588:(e,t,n)=>{var r;r=!0===n(735)?1:0,e.exports=r},730:(e,t,n)=>{var r=n(6157);e.exports=r},6157:(e,t,n)=>{var r=n(6532),a=n(4023),o=n(6588),i=new a(1),l=new r(i.buffer);e.exports=function(e,t){return i[0]=e,l[o]=t>>>0,i[0]}},4422:(e,t,n)=>{var r=n(233);e.exports=r},6636:(e,t,n)=>{var r;r=!0===n(735)?0:1,e.exports=r},233:(e,t,n)=>{var r=n(6532),a=n(4023),o=n(6636),i=new a(1),l=new r(i.buffer);e.exports=function(e,t){return i[0]=e,l[o]=t>>>0,i[0]}},3887:(e,t,n)=>{var r,a=n(7002),o=n(9284);r="function"===typeof a?a:o,e.exports=r},7002:e=>{var t="function"===typeof Math.fround?Math.fround:null;e.exports=t},9284:(e,t,n)=>{var r=new(n(3872))(1);e.exports=function(e){return r[0]=e,r[0]}},6248:(e,t,n)=>{var r=n(6532),a=n(4023),o=n(4316),i=new a(1),l=new r(i.buffer),s=o.HIGH,u=o.LOW;e.exports=function(e,t,n,r){return i[0]=e,t[r]=l[s],t[r+n]=l[u],t}},2105:(e,t,n)=>{var r=n(404),a=n(9592);r(a,"assign",n(6248)),e.exports=a},4316:(e,t,n)=>{var r,a,o;!0===n(735)?(a=1,o=0):(a=0,o=1),r={HIGH:a,LOW:o},e.exports=r},9592:(e,t,n)=>{var r=n(6248);e.exports=function(e){return r(e,[0,0],1,0)}},5163:(e,t,n)=>{var r=n(5798);e.exports=r},5798:e=>{e.exports=function(e){return 0|e}},3815:e=>{var t=Object.assign;e.exports=t},4374:(e,t,n)=>{var r=n(3629)(Object.assign);e.exports=r},8832:(e,t,n)=>{var r,a=n(4374),o=n(3815),i=n(5457);r=a?o:i,e.exports=r},5457:(e,t,n)=>{var r=n(167),a=n(2107),o=n(6132);e.exports=function(e){var t,n,i,l,s,u,c;if(void 0===e||null===e)throw new TypeError(o("invalid argument. First argument must be a non-null object. Value: `%s`.",e));for(s=a(e),u=1;u{var r=n(8502);e.exports=r},8502:e=>{var t=Object;e.exports=t},5115:(e,t,n)=>{var r=n(7586),a=n(5068),o=n(2021),i=n(1302);e.exports=function(e,t,n,l){var s;return n===l&&n>1.5?a(e,t,n):n>1&&l>1?o(e,t,n,l):n<1&&l<1?i(e,n,l):(s=r(e,t,n))/(s+r(e,t,l))}},4951:(e,t,n)=>{var r=n(404),a=n(9274),o=n(9333),i=n(5417),l=n(5111).isPrimitive,s=n(3629),u=n(7615),c=n(2672),d=n(7521),f=n(7379).factory,h=n(9121).factory,p=n(6679),v=n(870),m=n(6532),g=n(3973),y=n(8832),b=n(9573),w=n(6132),x=n(2383),_=n(5115);e.exports=function(){var e,t,n,S,E,R,k,O,C;if(O=!0,0===arguments.length)R=h(E={copy:!1});else if(1===arguments.length){if(!i(E=arguments[0]))throw new TypeError(w("invalid argument. Options argument must be an object. Value: `%s`.",E));if(u(E,"copy")&&!l(E.copy))throw new TypeError(w("invalid option. `%s` option must be a boolean. Option: `%s`.","copy",E.copy));if(u(E,"prng")){if(!s(E.prng))throw new TypeError(w("invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.","prng",E.prng));R=E.prng}else{if(u(E,"state")&&!g(E.state))throw new TypeError(w("invalid option. `%s` option must be a Uint32Array. Option: `%s`.","state",E.state));!1===(E=y({},E)).copy?O=!1:E.state&&(E.state=v(E.state.length,E.state,1,new m(E.state.length),1)),E.copy=!1,R=h(E)}}else{if(C=x(n=arguments[0],S=arguments[1]))throw C;if(arguments.length>2){if(!i(E=arguments[2]))throw new TypeError(w("invalid argument. Options argument must be an object. Value: `%s`.",E));if(u(E,"copy")&&!l(E.copy))throw new TypeError(w("invalid option. `%s` option must be a boolean. Option: `%s`.","copy",E.copy));if(u(E,"prng")){if(!s(E.prng))throw new TypeError(w("invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.","prng",E.prng));R=E.prng}else{if(u(E,"state")&&!g(E.state))throw new TypeError(w("invalid option. `%s` option must be a Uint32Array. Option: `%s`.","state",E.state));!1===(E=y({},E)).copy?O=!1:E.state&&(E.state=v(E.state.length,E.state,1,new m(E.state.length),1)),E.copy=!1,R=h(E)}}else R=h(E={copy:!1})}return E&&E.prng?t=f({prng:E.prng}):(E.state?e=E.state:(e=R.state,R.state=e),t=f({state:e,copy:!1})),r(k=void 0===n?function(e,n){if(p(e)||p(n)||e<=0||n<=0)return NaN;return _(R,t,e,n)}:function(){return _(R,t,n,S)},"NAME","beta"),E&&E.prng?(r(k,"seed",null),r(k,"seedLength",null),o(k,"state",c(null),d),r(k,"stateLength",null),r(k,"byteLength",null),r(k,"toJSON",c(null)),r(k,"PRNG",R)):(a(k,"seed",(function(){return R.seed})),a(k,"seedLength",(function(){return R.seedLength})),o(k,"state",(function(){return R.state}),(function(e){if(!g(e))throw new TypeError(w("invalid argument. Must provide a Uint32Array. Value: `%s`.",e));O&&(e=v(e.length,e,1,new m(e.length),1));R.state=e})),a(k,"stateLength",(function(){return R.stateLength})),a(k,"byteLength",(function(){return R.byteLength})),r(k,"toJSON",(function(){var e={type:"PRNG"};e.name=k.NAME,e.state=b(R.state),e.params=void 0===n?[]:[n,S];return e})),r(k,"PRNG",R),R=R.normalized),k}},3789:(e,t,n)=>{var r=n(404),a=n(9516);r(a,"factory",n(4951)),e.exports=a},9516:(e,t,n)=>{var r=n(4951)();e.exports=r},5068:(e,t,n)=>{var r=n(3898),a=n(2522);e.exports=function(e,t,n){var o,i,l,s,u,c,d,f;for(u=r((l=n-1)+l,.5),o=!0;!0===o;)(d=.5*(1+(s=t())/u))>=0&&d<=1&&((c=e())<=(f=1-(i=r(s,4))/(f=8*n-12))?o=!1:c<(f+=.5*r(i/(8*n-8),2))&&(f=l*a(4*d*(1-d)),(f+=s*s/2)>=a(c)&&(o=!1)));return d}},2021:(e,t,n)=>{var r=n(3898),a=n(2522);e.exports=function(e,t,n,o){var i,l,s,u,c,d,f,h,p,v,m;for(f=(d=(u=n-1)+(c=o-1))*a(d),s=u/d,i=.5/r(d,.5),l=!0;!0===l;)(v=s+(h=t())*i)>=0&&v<=1&&(p=e(),m=u*a(v/u),m+=c*a((1-v)/c),(m+=f+.5*h*h)>=a(p)&&(l=!1));return v}},1302:(e,t,n)=>{var r=n(375),a=n(3898),o=n(2522);e.exports=function(e,t,n){for(var i,l,s,u,c,d;;)if(u=e(),c=e(),(s=(d=a(u,1/t))+a(c,1/n))<=1)return s>0?d/s:((i=o(u)/t)>(l=o(c)/n)?(l-=i,i=0):(i-=l,l=0),r(i-o(r(i)+r(l))))}},7586:(e,t,n)=>{var r=n(2522),a=n(2314),o=n(3898),i=1/3;e.exports=function(e,t,n){var l,s,u,c,d,f,h,p,v,m;for(n<1?(d=1/a(9*(f=n+1-i)),p=o(e(),1/n)):(d=1/a(9*(f=n-i)),p=1),l=!0;l;){do{m=1+d*(h=t())}while(m<=0);u=1-.331*(s=h*h)*s,c=.5*s+f*(1-(m*=m*m)+r(m)),((v=e()){var r=n(280).isPrimitive,a=n(6132);e.exports=function(e,t){return r(e)?r(t)?null:new TypeError(a("invalid argument. Second argument must be a positive number. Value: `%s`.",t)):new TypeError(a("invalid argument. First argument must be a positive number. Value: `%s`.",e))}},911:(e,t,n)=>{var r=n(2314),a=n(375),o=n(2522),i=.00991256303526217;e.exports=function(e,t){var n,l,s;for(l=a(-.5*t*t),(n=[]).push(i/l),n.push(t),s=2;s{var r=n(404),a=n(9274),o=n(9333),i=n(3629),l=n(5417),s=n(5111).isPrimitive,u=n(7615),c=n(3973),d=n(9121).factory,f=n(2672),h=n(7521),p=n(7730),v=n(3335),m=n(9573),g=n(6132),y=n(3363);e.exports=function(e){var t,n,b,w;if(w={copy:!0},arguments.length){if(!l(e))throw new TypeError(g("invalid argument. Must provide an object. Value: `%s`.",e));if(u(e,"copy")&&(w.copy=e.copy,!s(e.copy)))throw new TypeError(g("invalid option. `%s` option must be a boolean. Option: `%s`.","copy",e.copy));if(u(e,"prng")){if(!i(e.prng))throw new TypeError(g("invalid option. `%s` option must be a pseudorandom number generator function. Option: `%s`.","prng",e.prng));t=e.prng}else if(u(e,"state")){if(w.state=e.state,!c(e.state))throw new TypeError(g("invalid option. `%s` option must be a Uint32Array. Option: `%s`.","state",e.state))}else if(u(e,"seed")&&(w.seed=e.seed,void 0===e.seed))throw new TypeError(g("invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.","seed",e.seed))}return void 0===w.state?void 0===t?t=(n=d(w)).normalized:(n=d({seed:p(1+v*t()),copy:w.copy}),w.seed=null):t=(n=d(w)).normalized,b=y(t,n),r(b,"NAME","improved-ziggurat"),null===w.seed?(r(b,"seed",null),r(b,"seedLength",null)):(a(b,"seed",(function(){return n.seed})),a(b,"seedLength",(function(){return n.seedLength}))),e&&e.prng?(o(b,"state",f(null),h),r(b,"stateLength",null),r(b,"byteLength",null),r(b,"toJSON",f(null))):(o(b,"state",(function(){return n.state}),(function(e){n.state=e})),a(b,"stateLength",(function(){return n.stateLength})),a(b,"byteLength",(function(){return n.byteLength})),r(b,"toJSON",(function(){var e={type:"PRNG"};return e.name=b.NAME,e.state=m(n.state),e.params=[],e}))),r(b,"PRNG",t),b}},3363:(e,t,n)=>{var r=n(2712),a=n(375),o=n(911),i=n(7170),l=n(5590),s=3.442619855899,u=o(128,s),c=i(u);e.exports=function(e,t){return function(){var n,o,i,d,f,h,p;for(;;){if(f=2*e()-1,h=127&t(),r(f){var r=n(404),a=n(6302);r(a,"factory",n(5833)),e.exports=a},6302:(e,t,n)=>{var r=n(5833)();e.exports=r},7170:e=>{e.exports=function(e){var t,n;for(t=[],n=0;n{var r=n(2522);e.exports=function(e,t,n){var a,o;do{a=r(e())/t,o=r(e())}while(-2*o{var r=n(404),a=n(9274),o=n(9333),i=n(7615),l=n(5417),s=n(1317),u=n(3973),c=n(5111).isPrimitive,d=n(2001).isPrimitive,f=n(3285),h=n(3335),p=n(6532),v=n(6666),m=n(5350),g=n(870),y=n(9573),b=n(6132),w=n(4068),x=624,_=397,S=h>>>0,E=2147483648,R=2147483647,k=1812433253,O=1664525,C=1566083941,A=[0,2567483615],L=1/(f+1),T=2147483648,M=1,j=f*L,N=1,I=3,P=2,F=x+3,D=x+5,B=x+6;function H(e,t){var n;return n=t?"option":"argument",e.length>>0,r=1;r>>0)^n>>>30)>>>0,e[r]=m(n,k)+r>>>0;return e}e.exports=function(e){var t,n,f,k,W,V;if(f={},arguments.length){if(!l(e))throw new TypeError(b("invalid argument. Options argument must be an object. Value: `%s`.",e));if(i(e,"copy")&&(f.copy=e.copy,!c(e.copy)))throw new TypeError(b("invalid option. `%s` option must be a boolean. Option: `%s`.","copy",e.copy));if(i(e,"state")){if(n=e.state,f.state=!0,!u(n))throw new TypeError(b("invalid option. `%s` option must be a Uint32Array. Option: `%s`.","state",n));if(V=H(n,!0))throw V;!1===f.copy?t=n:(t=new p(n.length),g(n.length,n,1,t,1)),n=new p(t.buffer,t.byteOffset+(P+1)*t.BYTES_PER_ELEMENT,x),k=new p(t.buffer,t.byteOffset+(D+1)*t.BYTES_PER_ELEMENT,n[D])}if(void 0===k)if(i(e,"seed"))if(k=e.seed,f.seed=!0,d(k)){if(k>S)throw new RangeError(b("invalid option. `%s` option must be a positive integer less than or equal to the maximum unsigned 32-bit integer. Option: `%u`.","seed",k));k>>>=0}else{if(!1===s(k)||k.length<1)throw new TypeError(b("invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.","seed",k));if(1===k.length){if(k=k[0],!d(k))throw new TypeError(b("invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%s`.","seed",k));if(k>S)throw new RangeError(b("invalid option. `%s` option must be either a positive integer less than or equal to the maximum unsigned 32-bit integer or an array-like object containing integer values less than or equal to the maximum unsigned 32-bit integer. Option: `%u`.","seed",k));k>>>=0}else W=k.length,(t=new p(B+W))[0]=N,t[1]=I,t[P]=x,t[F]=1,t[F+1]=x,t[D]=W,g.ndarray(W,k,1,0,t,1,D+1),n=new p(t.buffer,t.byteOffset+(P+1)*t.BYTES_PER_ELEMENT,x),k=new p(t.buffer,t.byteOffset+(D+1)*t.BYTES_PER_ELEMENT,W),n=function(e,t,n,r){var a,o,i,l;for(o=1,i=0,l=v(t,r);l>0;l--)a=e[o-1]>>>0,a=m(a=(a^a>>>30)>>>0,O)>>>0,e[o]=(e[o]>>>0^a)+n[i]+i>>>0,i+=1,(o+=1)>=t&&(e[0]=e[t-1],o=1),i>=r&&(i=0);for(l=t-1;l>0;l--)a=e[o-1]>>>0,a=m(a=(a^a>>>30)>>>0,C)>>>0,e[o]=(e[o]>>>0^a)-o>>>0,(o+=1)>=t&&(e[0]=e[t-1],o=1);return e[0]=T,e}(n=z(n,x,19650218),x,k,W)}else k=w()>>>0}else k=w()>>>0;return void 0===n&&((t=new p(B+1))[0]=N,t[1]=I,t[P]=x,t[F]=1,t[F+1]=x,t[D]=1,t[D+1]=k,n=new p(t.buffer,t.byteOffset+(P+1)*t.BYTES_PER_ELEMENT,x),k=new p(t.buffer,t.byteOffset+(D+1)*t.BYTES_PER_ELEMENT,1),n=z(n,x,k)),r(X,"NAME","mt19937"),a(X,"seed",U),a(X,"seedLength",K),o(X,"state",G,q),a(X,"stateLength",Y),a(X,"byteLength",$),r(X,"toJSON",Q),r(X,"MIN",0),r(X,"MAX",h),r(X,"normalized",Z),r(Z,"NAME",X.NAME),a(Z,"seed",U),a(Z,"seedLength",K),o(Z,"state",G,q),a(Z,"stateLength",Y),a(Z,"byteLength",$),r(Z,"toJSON",Q),r(Z,"MIN",0),r(Z,"MAX",j),X;function U(){var e=t[D];return g(e,k,1,new p(e),1)}function K(){return t[D]}function Y(){return t.length}function $(){return t.byteLength}function G(){var e=t.length;return g(e,t,1,new p(e),1)}function q(e){var r;if(!u(e))throw new TypeError(b("invalid argument. Must provide a Uint32Array. Value: `%s`.",e));if(r=H(e,!1))throw r;!1===f.copy?f.state&&e.length===t.length?g(e.length,e,1,t,1):(t=e,f.state=!0):(e.length!==t.length&&(t=new p(e.length)),g(e.length,e,1,t,1)),n=new p(t.buffer,t.byteOffset+(P+1)*t.BYTES_PER_ELEMENT,x),k=new p(t.buffer,t.byteOffset+(D+1)*t.BYTES_PER_ELEMENT,t[D])}function Q(){var e={type:"PRNG"};return e.name=X.NAME,e.state=y(t),e.params=[],e}function X(){var e,r;return(r=t[F+1])>=x&&(n=function(e){var t,n,r,a;for(a=x-_,n=0;n>>1^A[t&M];for(r=x-1;n>>1^A[t&M];return t=e[r]&E|e[0]&R,e[r]=e[_-1]^t>>>1^A[t&M],e}(n),r=0),e=n[r],t[F+1]=r+1,e^=e>>>11,e^=e<<7&2636928640,e^=e<<15&4022730752,(e^=e>>>18)>>>0}function Z(){return(67108864*(X()>>>5)+(X()>>>6))*L}}},9121:(e,t,n)=>{var r=n(404),a=n(3344);r(a,"factory",n(1867)),e.exports=a},3344:(e,t,n)=>{var r=n(1867)({seed:n(4068)()});e.exports=r},4068:(e,t,n)=>{var r=n(3335),a=n(7730),o=r-1;e.exports=function(){return a(1+o*Math.random())>>>0}},8893:(e,t,n)=>{var r=n(404),a=n(4124);r(a,"REGEXP",n(7680)),e.exports=a},4124:e=>{e.exports=function(){return/^\s*function\s*([^(]*)/i}},7680:(e,t,n)=>{var r=n(4124)();e.exports=r},3193:(e,t,n)=>{var r=n(3640);e.exports=r},3640:(e,t,n)=>{var r=n(4023);e.exports=function(e,t){return new r(e.buffer,e.byteOffset+e.BYTES_PER_ELEMENT*t,2*(e.length-t))}},5506:(e,t,n)=>{var r=n(277);e.exports=r},277:(e,t,n)=>{var r=n(3872);e.exports=function(e,t){return new r(e.buffer,e.byteOffset+e.BYTES_PER_ELEMENT*t,2*(e.length-t))}},8161:(e,t,n)=>{var r=n(2020),a=Math.abs,o=String.prototype.toLowerCase,i=String.prototype.toUpperCase,l=String.prototype.replace,s=/e\+(\d)$/,u=/e-(\d)$/,c=/^(\d+)$/,d=/^(\d+)e/,f=/\.0$/,h=/\.0*e/,p=/(\..*[^0])0*e/;e.exports=function(e){var t,n,v=parseFloat(e.arg);if(!isFinite(v)){if(!r(e.arg))throw new Error("invalid floating-point number. Value: "+n);v=e.arg}switch(e.specifier){case"e":case"E":n=v.toExponential(e.precision);break;case"f":case"F":n=v.toFixed(e.precision);break;case"g":case"G":a(v)<1e-4?((t=e.precision)>0&&(t-=1),n=v.toExponential(t)):n=v.toPrecision(e.precision),e.alternate||(n=l.call(n,p,"$1e"),n=l.call(n,h,"e"),n=l.call(n,f,""));break;default:throw new Error("invalid double notation. Value: "+e.specifier)}return n=l.call(n,s,"e+0$1"),n=l.call(n,u,"e-0$1"),e.alternate&&(n=l.call(n,c,"$1."),n=l.call(n,d,"$1.e")),v>=0&&e.sign&&(n=e.sign+n),n=e.specifier===i.call(e.specifier)?i.call(n):o.call(n)}},5704:(e,t,n)=>{var r=n(2020),a=n(3942),o=String.prototype.toLowerCase,i=String.prototype.toUpperCase;e.exports=function(e){var t,n,l;switch(e.specifier){case"b":t=2;break;case"o":t=8;break;case"x":case"X":t=16;break;default:t=10}if(n=e.arg,l=parseInt(n,10),!isFinite(l)){if(!r(n))throw new Error("invalid integer. Value: "+n);l=0}return l<0&&("u"===e.specifier||10!==t)&&(l=4294967295+l+1),l<0?(n=(-l).toString(t),e.precision&&(n=a(n,e.precision,e.padRight)),n="-"+n):(n=l.toString(t),l||e.precision?e.precision&&(n=a(n,e.precision,e.padRight)):n="",e.sign&&(n=e.sign+n)),16===t&&(e.alternate&&(n="0x"+n),n=e.specifier===i.call(e.specifier)?i.call(n):o.call(n)),8===t&&e.alternate&&"0"!==n.charAt(0)&&(n="0"+n),n}},836:(e,t,n)=>{var r=n(7179);e.exports=r},2020:e=>{e.exports=function(e){return"number"===typeof e}},6256:e=>{e.exports=function(e){return"string"===typeof e}},7179:(e,t,n)=>{var r=n(5704),a=n(6256),o=n(8161),i=n(2848),l=n(3942),s=String.fromCharCode,u=isNaN,c=Array.isArray;function d(e){var t={};return t.specifier=e.specifier,t.precision=void 0===e.precision?1:e.precision,t.width=e.width,t.flags=e.flags||"",t.mapping=e.mapping,t}e.exports=function(e){var t,n,f,h,p,v,m,g,y;if(!c(e))throw new TypeError("invalid argument. First argument must be an array. Value: `"+e+"`.");for(v="",m=1,g=0;g127)throw new Error("invalid character code. Value: "+f.arg);f.arg=u(p)?String(f.arg):s(p)}break;case"e":case"E":case"f":case"F":case"g":case"G":t||(f.precision=6),f.arg=o(f);break;default:throw new Error("invalid specifier: "+f.specifier)}f.maxWidth>=0&&f.arg.length>f.maxWidth&&(f.arg=f.arg.substring(0,f.maxWidth)),f.padZeros?f.arg=l(f.arg,f.width||f.precision,f.padRight):f.width&&(f.arg=i(f.arg,f.width,f.padRight)),v+=f.arg||"",m+=1}return v}},2848:e=>{function t(e){var t,n="";for(t=0;t{function t(e){var t,n="";for(t=0;t{var r=n(6772);e.exports=r},6772:e=>{var t=/%(?:([1-9]\d*)\$)?([0 +\-#]*)(\*|\d+)?(?:(\.)(\*|\d+)?)?[hlL]?([%A-Za-z])/g;function n(e){var t={mapping:e[1]?parseInt(e[1],10):void 0,flags:e[2],width:e[3],precision:e[5],specifier:e[6]};return"."===e[4]&&void 0===e[5]&&(t.precision="1"),t}e.exports=function(e){var r,a,o,i;for(a=[],i=0,o=t.exec(e);o;)(r=e.slice(i,t.lastIndex-o[0].length)).length&&a.push(r),a.push(n(o)),i=t.lastIndex,o=t.exec(e);return(r=e.slice(i)).length&&a.push(r),a}},6132:(e,t,n)=>{var r=n(5579);e.exports=r},6832:e=>{e.exports=function(e){return"string"===typeof e}},5579:(e,t,n)=>{var r=n(836),a=n(5440),o=n(6832);e.exports=function e(t){var n,i;if(!o(t))throw new TypeError(e("invalid argument. First argument must be a string. Value: `%s`.",t));for(n=[a(t)],i=1;i{var r=n(3245);e.exports=r},3245:e=>{var t="function"===typeof Symbol?Symbol:void 0;e.exports=t},2510:(e,t,n)=>{var r=n(7937);e.exports=r},7937:(e,t,n)=>{var r=n(7128)()?Symbol.iterator:null;e.exports=r},2672:(e,t,n)=>{var r=n(8647);e.exports=r},8647:e=>{e.exports=function(e){return function(){return e}}},2793:(e,t,n)=>{var r=n(9432);e.exports=r},9432:(e,t,n)=>{var r=n(9359),a=n(8893).REGEXP,o=n(971);e.exports=function(e){var t,n,i;if(("Object"===(n=r(e).slice(8,-1))||"Error"===n)&&e.constructor){if("string"===typeof(i=e.constructor).name)return i.name;if(t=a.exec(i.toString()))return t[1]}return o(e)?"Buffer":n}},9274:(e,t,n)=>{var r=n(5629);e.exports=r},5629:(e,t,n)=>{var r=n(9872);e.exports=function(e,t,n){r(e,t,{configurable:!1,enumerable:!1,get:n})}},404:(e,t,n)=>{var r=n(5627);e.exports=r},5627:(e,t,n)=>{var r=n(9872);e.exports=function(e,t,n){r(e,t,{configurable:!1,enumerable:!1,writable:!1,value:n})}},9333:(e,t,n)=>{var r=n(4420);e.exports=r},4420:(e,t,n)=>{var r=n(9872);e.exports=function(e,t,n,a){r(e,t,{configurable:!1,enumerable:!1,get:n,set:a})}},5863:e=>{var t=Object.defineProperty;e.exports=t},4609:e=>{var t="function"===typeof Object.defineProperty?Object.defineProperty:null;e.exports=t},42:(e,t,n)=>{var r=n(4609);e.exports=function(){try{return r({},"x",{}),!0}catch(e){return!1}}},9872:(e,t,n)=>{var r,a=n(42),o=n(5863),i=n(4657);r=a()?o:i,e.exports=r},4657:(e,t,n)=>{var r=n(6132),a=Object.prototype,o=a.toString,i=a.__defineGetter__,l=a.__defineSetter__,s=a.__lookupGetter__,u=a.__lookupSetter__;e.exports=function(e,t,n){var c,d,f,h;if("object"!==typeof e||null===e||"[object Array]"===o.call(e))throw new TypeError(r("invalid argument. First argument must be an object. Value: `%s`.",e));if("object"!==typeof n||null===n||"[object Array]"===o.call(n))throw new TypeError(r("invalid argument. Property descriptor must be an object. Value: `%s`.",n));if((d="value"in n)&&(s.call(e,t)||u.call(e,t)?(c=e.__proto__,e.__proto__=a,delete e[t],e[t]=n.value,e.__proto__=c):e[t]=n.value),f="get"in n,h="set"in n,d&&(f||h))throw new Error("invalid argument. Cannot specify one or more accessors and a value or writable attribute in the property descriptor.");return f&&i&&i.call(e,t,n.get),h&&l&&l.call(e,t,n.set),e}},167:(e,t,n)=>{var r=n(5794);e.exports=r},5794:(e,t,n)=>{var r=n(1393),a=n(6932),o=n(9767);e.exports=function(e){var t,n,i;for(t=r(e),n=a(e),i=0;i{var r=n(8146);e.exports=r},8146:(e,t,n)=>{var r=n(3629),a=n(2357),o=n(6132),i=n(8893).REGEXP,l=a();e.exports=function(e){if(!1===r(e))throw new TypeError(o("invalid argument. Must provide a function. Value: `%s`.",e));return l?e.name:i.exec(e.toString())[1]}},8651:(e,t,n)=>{var r,a=n(3629),o=n(2055),i=n(8955);r=a(Object.getPrototypeOf)?o:i,e.exports=r},9578:(e,t,n)=>{var r=n(8669);e.exports=r},8669:(e,t,n)=>{var r=n(2107),a=n(8651);e.exports=function(e){return null===e||void 0===e?null:(e=r(e),a(e))}},2055:e=>{var t=Object.getPrototypeOf;e.exports=t},8955:(e,t,n)=>{var r=n(9359),a=n(6404);e.exports=function(e){var t=a(e);return t||null===t?t:"[object Function]"===r(e.constructor)?e.constructor.prototype:e instanceof Object?Object.prototype:null}},6404:e=>{e.exports=function(e){return e.__proto__}},8610:(e,t,n)=>{var r=n(5111).isPrimitive,a=n(6132),o=n(1791),i=n(5654),l=n(360),s=n(2914);e.exports=function(e){if(arguments.length){if(!r(e))throw new TypeError(a("invalid argument. Must provide a boolean. Value: `%s`.",e));if(e)return o()}if(s)return s;if(i)return i;if(l)return l;throw new Error("unexpected error. Unable to resolve global object.")}},1791:e=>{e.exports=function(){return new Function("return this;")()}},2914:e=>{var t="object"===typeof globalThis?globalThis:null;e.exports=t},5654:e=>{var t="object"===typeof self?self:null;e.exports=t},360:e=>{var t="object"===typeof window?window:null;e.exports=t},5675:(e,t,n)=>{var r=n(8870);e.exports=r},8870:(e,t,n)=>{var r=n(830),a=n(1317),o=n(3408).isPrimitive,i=n(4689).isPrimitive,l=n(6132);e.exports=function(e,t,n){var s,u;if(!a(e)&&!o(e))throw new TypeError(l("invalid argument. First argument must be an array-like object. Value: `%s`.",e));if(0===(s=e.length))return-1;if(3===arguments.length){if(!i(n))throw new TypeError(l("invalid argument. Third argument must be an integer. Value: `%s`.",n));if(n>=0){if(n>=s)return-1;u=n}else(u=s+n)<0&&(u=0)}else u=0;if(r(t)){for(;u{e.exports=function(e){return Object.keys(Object(e))}},9266:(e,t,n)=>{var r=n(6631),a=n(4574),o=Array.prototype.slice;e.exports=function(e){return r(e)?a(o.call(e)):a(e)}},5027:(e,t,n)=>{var r=n(4574);e.exports=function(){return function(){return 2!==(r(arguments)||"").length}(1,2)}},4535:(e,t,n)=>{var r,a=n(7615),o=n(5675),i=n(6253),l=n(9223),s=n(9608),u=n(4993);r=function(){var e;if("undefined"===i(u))return!1;for(e in u)try{-1===o(s,e)&&a(u,e)&&null!==u[e]&&"object"===i(u[e])&&l(u[e])}catch(t){return!0}return!1}(),e.exports=r},4185:e=>{var t="undefined"!==typeof Object.keys;e.exports=t},2894:(e,t,n)=>{var r=n(9767)(n(7521),"prototype");e.exports=r},2009:(e,t,n)=>{var r=!n(9767)({toString:null},"toString");e.exports=r},6764:e=>{var t="undefined"!==typeof window;e.exports=t},1393:(e,t,n)=>{var r=n(7952);e.exports=r},9223:e=>{e.exports=function(e){return e.constructor&&e.constructor.prototype===e}},4755:(e,t,n)=>{var r=n(4535),a=n(9223),o=n(6764);e.exports=function(e){if(!1===o&&!r)return a(e);try{return a(e)}catch(t){return!1}}},7952:(e,t,n)=>{var r,a=n(5027),o=n(4185),i=n(4574),l=n(9266),s=n(3510);r=o?a()?l:i:s,e.exports=r},3510:(e,t,n)=>{var r=n(4242),a=n(7615),o=n(6631),i=n(2894),l=n(2009),s=n(4755),u=n(9547);e.exports=function(e){var t,n,c,d,f,h,p;if(d=[],o(e)){for(p=0;p0&&!a(e,"0"))for(p=0;p{var t="undefined"===typeof window?void 0:window;e.exports=t},9359:(e,t,n)=>{var r,a=n(9681),o=n(2346),i=n(3460);r=a()?i:o,e.exports=r},2346:(e,t,n)=>{var r=n(8983);e.exports=function(e){return r.call(e)}},3460:(e,t,n)=>{var r=n(7615),a=n(3103),o=n(8983);e.exports=function(e){var t,n,i;if(null===e||void 0===e)return o.call(e);n=e[a],t=r(e,a);try{e[a]=void 0}catch(l){return o.call(e)}return i=o.call(e),t?e[a]=n:delete e[a],i}},8983:e=>{var t=Object.prototype.toString;e.exports=t},3103:(e,t,n)=>{var r=n(2490),a="function"===typeof r?r.toStringTag:"";e.exports=a},7521:(e,t,n)=>{var r=n(2032);e.exports=r},2032:e=>{e.exports=function(){}},8387:(e,t,n)=>{var r=n(2107),a=r.getOwnPropertySymbols;e.exports=function(e){return a(r(e))}},2100:e=>{var t="undefined"!==typeof Object.getOwnPropertySymbols;e.exports=t},6932:(e,t,n)=>{var r,a=n(2100),o=n(8387),i=n(4365);r=a?o:i,e.exports=r},4365:e=>{e.exports=function(){return[]}},5921:(e,t,n)=>{var r=n(6279),a=n(3506),o=n(6087);e.exports=function(){return"function"===typeof r||"object"===typeof o||"function"===typeof a}},3506:(e,t,n)=>{var r=n(8610)(),a=r.document&&r.document.childNodes;e.exports=a},6279:e=>{e.exports=/./},6087:e=>{var t=Int8Array;e.exports=t},6253:(e,t,n)=>{var r=n(5921),a=n(8124),o=n(7466),i=r()?o:a;e.exports=i},8124:(e,t,n)=>{var r=n(2793);e.exports=function(e){var t;return null===e?"null":"object"===(t=typeof e)?r(e).toLowerCase():t}},7466:(e,t,n)=>{var r=n(2793);e.exports=function(e){return r(e).toLowerCase()}},2730:(e,t,n)=>{var r=n(5043),a=n(8853);function o(e){for(var t="https://reactjs.org/docs/error-decoder.html?invariant="+e,n=1;n